text
stringlengths 1
22.8M
|
|---|
Zaccheus Darko-Kelly (born May 3, 1997) is an American professional basketball player who last played for PAOK Thessaloniki of the Greek Basket League and the Basketball Champions League. He played college basketball for the Montana Western Bulldogs and the University of Providence Argonauts.
High school career
Darko-Kelly played basketball for Sentinel High School in Missoula, Montana. In his senior season, he averaged 15.8 points and five rebounds per game, earning all-state honors. Darko-Kelly signed with Montana Western, the only four-year college to offer him a basketball scholarship.
College career
As a freshman at Montana Western, Darko-Kelly averaged 9.1 points and was named Frontier Freshman of the Year. He assumed a leading role in the following season. As a sophomore, he averaged 15.4 points and 6.6 rebounds per game, receiving Second Team National Association of Intercollegiate Athletics (NAIA) All-American and First Team All-Frontier honors.
For his junior season, Darko-Kelly transferred to the University of Providence after Steve Keller, his head coach at Montana Western, was hired there. He sat out for one year due to transfer rules. On February 21, 2020, Darko-Kelly recorded a career-high 40 points and 13 rebounds in a 93–76 win against Montana Western. That month, he became the first player to ever win three straight NAIA Division I National Player of the Week awards, averaging 30.8 points, 10.7 rebounds and 7.7 assists per game during that span. As a junior, Darko-Kelly averaged 22.5 points, eight rebounds, 5.7 assists, 2.3 steals and 1.4 blocks per game, surpassing the program single-season scoring record. He was selected as a First Team NAIA All-American, Frontier Player of the Year and a finalist for the Bevo Francis Award. In his senior season, Darko-Kelly led his team to Frontier regular season and tournament titles. He averaged 18.4 points, 9.4 rebounds, 5.2 assists, 1.5 steals and 1.3 blocks per game, and repeated as a First Team NAIA All-American and Frontier Player of the Year. He chose to forgo his additional year of college eligibility.
Professional career
After going undrafted in the 2021 NBA draft, Darko-Kelly joined the Toronto Raptors for the 2021 NBA Summer League.
On September 1, 2021, he signed with Riesen Ludwigsburg of the German Basketball Bundesliga.
On October 5, 2021, he signed with Helsinki Seagulls of the Finnish Korisliiga.
On July 11, 2022, Darko-Kelly signed with PAOK of the Greek Basket League and the Basketball Champions League. On November 2, 2022, he suffered a season-ending injury during a BCL game against Unicaja Málaga.
References
External links
University of Providence Argonauts bio
Montana Western Bulldogs bio
1997 births
Living people
American men's basketball players
American expatriate basketball people in Finland
American expatriate basketball people in Germany
American expatriate basketball people in Greece
Basketball players from Montana
College men's basketball players in the United States
Helsinki Seagulls players
P.A.O.K. BC players
Riesen Ludwigsburg players
Shooting guards
Small forwards
Sportspeople from Great Falls, Montana
University of Montana Western alumni
University of Providence alumni
|
```javascript
Weak vs Strict equality operator
No block scope
The distinction between `==` and `===`
Getting the *real* dimensions of an image
`console.*` in JavaScript
```
|
Andrew J. Bacevich Jr. (, ; born July 5, 1947) is an American historian specializing in international relations, security studies, American foreign policy, and American diplomatic and military history. He is a Professor Emeritus of International Relations and History at the Boston University Frederick S. Pardee School of Global Studies. He is also a retired career officer in the Armor Branch of the United States Army, retiring with the rank of colonel. He is a former director of Boston University's Center for International Relations (from 1998 to 2005), now part of the Pardee School of Global Studies. Bacevich is the co-founder and president of the Quincy Institute for Responsible Statecraft.
Bacevich has been "a persistent, vocal critic of the U.S. occupation of Iraq, calling the conflict a catastrophic failure." In March 2007, he described George W. Bush's endorsement of such "preventive wars" as "immoral, illicit, and imprudent." His son, Andrew John Bacevich, also an Army officer, died fighting in the Iraq War in May 2007.
Early life and education
Bacevich was born in Normal, Illinois, the son of Martha Ellen (née Bulfer; later Greenis) and Andrew Bacevich Sr. His father was of Lithuanian descent, and his mother was of Irish, German, and English ancestry. Bacevich described himself as a "Catholic conservative".
He graduated from the United States Military Academy in 1969 and served in the United States Army during the Vietnam War, serving in Vietnam from the summer of 1970 to the summer of 1971.
Later he held posts in Germany, including in the 11th Armored Cavalry Regiment; the United States; and the Persian Gulf up to his retirement from the service with the rank of colonel in the early 1990s. His early retirement is thought to be a result of his taking responsibility for the Camp Doha (Kuwait) explosion in 1991 in command of the 11th Armored Cavalry Regiment. He holds a Ph.D. in American Diplomatic History from Princeton University, where his 1982 doctoral thesis was entitled American military diplomacy, 1898–1949: the role of Frank Ross McCoy. Bacevich taught at West Point and Johns Hopkins University before joining the faculty at Boston University in 1998.
Writings
Bacevich initially published writings in a number of politically oriented magazines, including The Wilson Quarterly. He advocates for a non-interventionist foreign policy. His writings have professed a dissatisfaction with the Bush administration and many of its intellectual supporters on matters of U.S. foreign policy.
On August 15, 2008, Bacevich appeared as the guest of Bill Moyers Journal on PBS to promote his book, The Limits of Power. As in both of his previous books, The Long War (2007) and The New American Militarism: How Americans are Seduced by War (2005), Bacevich is critical of U.S. foreign policy in the post-Cold War era, maintaining the United States has developed an over-reliance on military power, in contrast to diplomacy, to achieve its foreign policy aims. He also asserts that policymakers in particular, and the U.S. people in general, overestimate the usefulness of military force in foreign affairs. Bacevich believes romanticized images of war in popular culture (especially films) interact with the lack of actual military service among most of the U.S. population to produce in the U.S. people a highly unrealistic, even dangerous notion of what combat and military service are really like.
Bacevich conceived The New American Militarism as "a corrective to what has become the conventional critique of U.S. policies since 9/11 but [also] as a challenge to the orthodox historical context employed to justify those policies." Finally, he attempts to place current policies in historical context, as part of a U.S. tradition going back to the Presidency of Woodrow Wilson, a tradition (of an interventionist, militarized foreign policy) which has strong bi-partisan roots. To lay an intellectual foundation for this argument, he cites two influential historians from the 20th century: Charles A. Beard and William Appleman Williams. Ultimately, Bacevich eschews the partisanship of current debate about U.S. foreign policy as short-sighted and ahistorical. Instead of blaming only one president (or his advisors) for contemporary policies, Bacevich sees both Republicans and Democrats as sharing responsibility for policies which may not be in the nation's best interest.
In March 2003, at the time of the U.S. invasion of Iraq, Bacevich wrote in the Los Angeles Times that "if, as seems probable, the effort encounters greater resistance than its architects imagine, our way of life may find itself tested in ways that will make the Vietnam War look like a mere blip in American history."
Bacevich's book American Empire: The Realities and Consequences of US Diplomacy, published in 2004, was highly praised by Professor of International Relations and author Peter Gowan for being "a tonic to read: crisp, vivid, pungent, with a dry sense of humour and sharp sense of hypocrisies." Gowan describes Bacevich as a "conservative, who explains that he believed in the justice of America's war against Communism, and continues to do so, but once it was over came to the conclusion that U.S. expansionism both preceded and exceeded the logic of the Cold War, and needed to be understood in a longer, more continuous historical durée."
Bacevich wrote an editorial about the Bush Doctrine published in The Boston Globe in March 2007.
In an article of The American Conservative dated March 24, 2008, Bacevich depicts Democratic presidential candidate Barack Obama as the best choice for conservatives in the fall. Part of his argument includes the fact that "this liberal Democrat has promised to end the U.S. combat role in Iraq. Contained within that promise, if fulfilled, lies some modest prospect of a conservative revival." He also goes on to mention that "For conservatives to hope the election of yet another Republican will set things right is surely in vain. To believe that President John McCain will reduce the scope and intrusiveness of federal authority, cut the imperial presidency down to size, and put the government on a pay-as-you-go basis is to succumb to a great delusion."
In the October 11, 2009, issue of The Boston Globe, he wrote that the decision to commit more troops to Afghanistan may be the most fateful choice of the Obama administration. "If the Afghan war then becomes the consuming issue of Obama's presidency – as Iraq became for his predecessor, as Vietnam did for Lyndon Johnson, and as Korea did for Harry Truman – the inevitable effect will be to compromise the prospects of reform more broadly."
In his article "Non Believer" in the July 7, 2010, issue of The New Republic, Bacevich compared President George W. Bush, characterized as wrong-headed but sincere, with President Obama, who, he says, has no belief in the Afghanistan war but pursues it for his own politically cynical reasons: "Who is more deserving of contempt? The commander-in-chief who sends young Americans to die for a cause, however misguided, in which he sincerely believes? Or the commander-in-chief who sends young Americans to die for a cause in which he manifestly does not believe and yet refuses to forsake?"
In an October 2010 interview with Guernica Magazine, Bacevich addressed his seemingly contradictory stance on Obama. While Bacevich supported Obama during the 2008 presidential race in which Obama repeatedly said he believed in the Afghanistan war, Bacevich has become increasingly critical of Obama's decision to commit additional troops to that war: "I interpreted his campaign rhetoric about Afghanistan as an effort to insulate him from the charge of being a national security wimp. His decision to escalate was certainly not a decision his supporters were clamoring for."
Regarding nuclear policy in particular, Bacevich noted in The Limits of Power that there is no feasible scenario under which nuclear weapons could sensibly be used and keeping them entails many other risks: "For the United States, they are becoming unnecessary, even as a deterrent. Certainly, they are unlikely to dissuade the adversaries most likely to employ such weapons against us – Islamic extremists intent on acquiring their own nuclear capability. If anything, the opposite is true. By retaining a strategic arsenal in readiness (and by insisting without qualification that the dropping of atomic bombs on two Japanese cities in 1945 was justified), the United States continues tacitly to sustain the view that nuclear weapons play a legitimate role in international politics ... ."
Bacevich's papers are archived at the Howard Gotlieb Archival Research Center at Boston University.
Personal life
On May 13, 2007, Bacevich's son, Andrew John Bacevich, was killed during the Iraq War by an improvised explosive device south of Samarra in Saladin Governorate. His son was a first lieutenant in the U.S. Army, assigned to the 3rd Battalion, 8th U.S. Cavalry Regiment, 1st Cavalry Division. Bacevich also has three daughters.
Works
Books
Diplomat in Khaki: Frank Ross McCoy and American Foreign Policy, 1898–1949 (Lawrence, Kansas: University Press of Kansas, 1989) .
American Empire: The Realities and Consequences of U.S. Diplomacy (Cambridge, Massachusetts: Harvard University Press, 2004) .
The New American Militarism: How Americans Are Seduced by War (New York: Oxford University Press, 2005) .
The Long War: A New History of U.S. National Security Policy Since World War II (New York: Columbia University Press, 2007) .
The Limits of Power: The End of American Exceptionalism (New York: Macmillan, 2008) .
Washington Rules: America's Path to Permanent War (New York: Macmillan, 2010) .
Breach of Trust: How Americans Failed Their Soldiers and Their Country (New York: Metropolitan Books, 2013) .
America's War for the Greater Middle East: A Military History (New York: Random House, 2016) .
Twilight of the American Century (Notre Dame, Indiana: University of Notre Dame Press, 2018)
The Age of Illusions: How America Squandered Its Cold War Victory (New York: Metropolitan Books, 2020)
After the Apocalypse: America’s Role in a World Transformed (New York: Metropolitan Books, 2021)
On Shedding an Obsolete Past (Haymarket Books, November 15, 2022)
Essays and reporting
Reprinted:
Andrew J. Bacevich, "The Old Normal: Why we can't beat our addiction to war", Harper's Magazine, vol. 340, no. 2038 (March 2020), pp. 25–32. "In 2010, Admiral Michael Mullen, chairman of the Joint Chiefs of Staff, declared that the national debt, the prime expression of American profligacy, had become 'the most significant threat to our national security.' In 2017, General Paul Selva, Joint Chiefs vice chair, stated bluntly that 'the dynamics that are happening in our climate will drive uncertainty and will drive conflict." (p. 31.)
Bacevich, Andrew J., "The Reckoning That Wasn't: Why America Remains Trapped by False Dreams of Hegemony", Foreign Affairs, vol. 102, no. 2 (March/April 2023), pp. 6–10, 12, 14, 16–21. "Washington... needs to... avoid needless war... and provide ordinary citizens with the prospect of a decent life.... The chimera of another righteous military triumph cannot fix what ails the United States." (p. 21.)
See also
Republican and conservative support for Barack Obama in 2008
The Imperial Presidency
References
External links
Academic profile of Prof. Andrew Bacevich at the Pardee School of Global Studies, Boston University
"Is the war in Afghanistan worth fighting?" Great Debate at Boston University, November 4, 2009
Democracy Now! appearances
"I Lost My Son to a War I Oppose", The Washington Post, May 27, 2007
Interview with Andrew Bacevich in Bostonia, alumni magazine of Boston University, Seduced by War
Extensive excerpts from The New American Militarism
Conversations with Andrew Bacevich
Andrew Bacevich bloggings at HuffPost
Bill Moyers Journal interview of Andrew Bacevich
Author reading with Q&A at Politics and Prose on January 8, 2020
1947 births
Living people
20th-century American historians
20th-century American male writers
20th-century American essayists
20th-century Roman Catholics
21st-century American historians
21st-century American male writers
21st-century American essayists
21st-century Roman Catholics
United States Army personnel of the Vietnam War
American Book Award winners
American foreign policy writers
American male non-fiction writers
American people of English descent
American people of German descent
American people of Irish descent
American people of Lithuanian descent
American political scientists
American political writers
Boston University faculty
Catholics from Illinois
Catholics from Massachusetts
Harper's Magazine people
Historians from Illinois
Historians from Massachusetts
Historians of the United States
HuffPost writers and columnists
American international relations scholars
Johns Hopkins University faculty
Non-interventionism
Old Right (United States)
Pardee School of Global Studies faculty
People from Normal, Illinois
People from Walpole, Massachusetts
Political realists
Princeton University alumni
United States Army colonels
United States Military Academy alumni
United States Military Academy faculty
Writers from Massachusetts
Carnegie Council for Ethics in International Affairs
United States Army personnel of the Gulf War
Military personnel from Illinois
|
```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.sql.parser.statement.core.statement;
import org.apache.shardingsphere.infra.database.core.type.DatabaseType;
import org.apache.shardingsphere.infra.spi.type.typed.TypedSPILoader;
import org.apache.shardingsphere.sql.parser.api.ASTNode;
import java.util.Collection;
import java.util.Collections;
/**
* SQL statement.
*/
public interface SQLStatement extends ASTNode {
/**
* Get count of parameters.
*
* @return count of parameters
*/
int getParameterCount();
/**
* Get database type.
*
* @return database type
*/
default DatabaseType getDatabaseType() {
return TypedSPILoader.getService(DatabaseType.class, "SQL92");
}
/**
* Get variable names.
*
* @return variable names
*/
default Collection<String> getVariableNames() {
return Collections.emptyList();
}
}
```
|
```c
/* wmem_tree.c
* Wireshark Memory Manager Red-Black Tree
* Based on the red-black tree implementation in epan/emem.*
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
*
* 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.
*/
#include "config.h"
#include <string.h>
#include <stdio.h>
#include <glib.h>
#include "wmem_core.h"
#include "wmem_strutl.h"
#include "wmem_tree.h"
#include "wmem_tree-int.h"
#include "wmem_user_cb.h"
static wmem_tree_node_t *
node_uncle(wmem_tree_node_t *node)
{
wmem_tree_node_t *parent, *grandparent;
parent = node->parent;
if (parent == NULL) {
return NULL;
}
grandparent = parent->parent;
if (grandparent == NULL) {
return NULL;
}
if (parent == grandparent->left) {
return grandparent->right;
}
else {
return grandparent->left;
}
}
static void rb_insert_case1(wmem_tree_t *tree, wmem_tree_node_t *node);
static void rb_insert_case2(wmem_tree_t *tree, wmem_tree_node_t *node);
static void
rotate_left(wmem_tree_t *tree, wmem_tree_node_t *node)
{
if (node->parent) {
if (node->parent->left == node) {
node->parent->left = node->right;
}
else {
node->parent->right = node->right;
}
}
else {
tree->root = node->right;
}
node->right->parent = node->parent;
node->parent = node->right;
node->right = node->right->left;
if (node->right) {
node->right->parent = node;
}
node->parent->left = node;
if (tree->post_rotation_cb) {
tree->post_rotation_cb (node);
}
}
static void
rotate_right(wmem_tree_t *tree, wmem_tree_node_t *node)
{
if (node->parent) {
if (node->parent->left == node) {
node->parent->left = node->left;
}
else {
node->parent->right = node->left;
}
}
else {
tree->root = node->left;
}
node->left->parent = node->parent;
node->parent = node->left;
node->left = node->left->right;
if (node->left) {
node->left->parent = node;
}
node->parent->right = node;
if (tree->post_rotation_cb) {
tree->post_rotation_cb (node);
}
}
static void
rb_insert_case5(wmem_tree_t *tree, wmem_tree_node_t *node)
{
wmem_tree_node_t *parent, *grandparent;
parent = node->parent;
grandparent = parent->parent;
parent->color = WMEM_NODE_COLOR_BLACK;
grandparent->color = WMEM_NODE_COLOR_RED;
if (node == parent->left && parent == grandparent->left) {
rotate_right(tree, grandparent);
}
else {
rotate_left(tree, grandparent);
}
}
static void
rb_insert_case4(wmem_tree_t *tree, wmem_tree_node_t *node)
{
wmem_tree_node_t *parent, *grandparent;
parent = node->parent;
grandparent = parent->parent;
if (!grandparent) {
return;
}
if (node == parent->right && parent == grandparent->left) {
rotate_left(tree, parent);
node = node->left;
}
else if (node == parent->left && parent == grandparent->right) {
rotate_right(tree, parent);
node = node->right;
}
rb_insert_case5(tree, node);
}
static void
rb_insert_case3(wmem_tree_t *tree, wmem_tree_node_t *node)
{
wmem_tree_node_t *parent, *grandparent, *uncle;
uncle = node_uncle(node);
if (uncle && uncle->color == WMEM_NODE_COLOR_RED) {
parent = node->parent;
grandparent = parent->parent;
parent->color = WMEM_NODE_COLOR_BLACK;
uncle->color = WMEM_NODE_COLOR_BLACK;
grandparent->color = WMEM_NODE_COLOR_RED;
rb_insert_case1(tree, grandparent);
}
else {
rb_insert_case4(tree, node);
}
}
static void
rb_insert_case2(wmem_tree_t *tree, wmem_tree_node_t *node)
{
/* parent is always non-NULL here */
if (node->parent->color == WMEM_NODE_COLOR_RED) {
rb_insert_case3(tree, node);
}
}
static void
rb_insert_case1(wmem_tree_t *tree, wmem_tree_node_t *node)
{
wmem_tree_node_t *parent = node->parent;
if (parent == NULL) {
node->color = WMEM_NODE_COLOR_BLACK;
}
else {
rb_insert_case2(tree, node);
}
}
wmem_tree_t *
wmem_tree_new(wmem_allocator_t *allocator)
{
wmem_tree_t *tree;
tree = wmem_new(allocator, wmem_tree_t);
tree->master = allocator;
tree->allocator = allocator;
tree->root = NULL;
tree->post_rotation_cb = NULL;
return tree;
}
static gboolean
wmem_tree_reset_cb(wmem_allocator_t *allocator _U_, wmem_cb_event_t event,
void *user_data)
{
wmem_tree_t *tree = (wmem_tree_t *)user_data;
tree->root = NULL;
if (event == WMEM_CB_DESTROY_EVENT) {
wmem_unregister_callback(tree->master, tree->master_cb_id);
wmem_free(tree->master, tree);
}
return TRUE;
}
static gboolean
wmem_tree_destroy_cb(wmem_allocator_t *allocator _U_, wmem_cb_event_t event _U_,
void *user_data)
{
wmem_tree_t *tree = (wmem_tree_t *)user_data;
wmem_unregister_callback(tree->allocator, tree->slave_cb_id);
return FALSE;
}
wmem_tree_t *
wmem_tree_new_autoreset(wmem_allocator_t *master, wmem_allocator_t *slave)
{
wmem_tree_t *tree;
tree = wmem_new(master, wmem_tree_t);
tree->master = master;
tree->allocator = slave;
tree->root = NULL;
tree->post_rotation_cb = NULL;
tree->master_cb_id = wmem_register_callback(master, wmem_tree_destroy_cb,
tree);
tree->slave_cb_id = wmem_register_callback(slave, wmem_tree_reset_cb,
tree);
return tree;
}
gboolean
wmem_tree_is_empty(wmem_tree_t *tree)
{
return tree->root == NULL;
}
static wmem_tree_node_t *
create_node(wmem_allocator_t *allocator, wmem_tree_node_t *parent, const void *key,
void *data, wmem_node_color_t color, gboolean is_subtree)
{
wmem_tree_node_t *node;
node = wmem_new(allocator, wmem_tree_node_t);
node->left = NULL;
node->right = NULL;
node->parent = parent;
node->key = key;
node->data = data;
node->color = color;
node->is_subtree = is_subtree;
node->is_removed = FALSE;
return node;
}
#define CREATE_DATA(TRANSFORM, DATA) ((TRANSFORM) ? (TRANSFORM)(DATA) : (DATA))
/**
* return inserted node
*/
static wmem_tree_node_t *
lookup_or_insert32_node(wmem_tree_t *tree, guint32 key,
void*(*func)(void*), void* data, gboolean is_subtree, gboolean replace)
{
wmem_tree_node_t *node = tree->root;
wmem_tree_node_t *new_node = NULL;
/* is this the first node ?*/
if (!node) {
new_node = create_node(tree->allocator, NULL, GUINT_TO_POINTER(key),
CREATE_DATA(func, data), WMEM_NODE_COLOR_BLACK, is_subtree);
tree->root = new_node;
return new_node;
}
/* it was not the new root so walk the tree until we find where to
* insert this new leaf.
*/
while (!new_node) {
/* this node already exists, so just return the data pointer*/
if (key == GPOINTER_TO_UINT(node->key)) {
if (replace) {
node->data = CREATE_DATA(func, data);
}
return node;
}
else if (key < GPOINTER_TO_UINT(node->key)) {
if (node->left) {
node = node->left;
}
else {
/* new node to the left */
new_node = create_node(tree->allocator, node, GUINT_TO_POINTER(key),
CREATE_DATA(func, data), WMEM_NODE_COLOR_RED,
is_subtree);
node->left = new_node;
}
}
else if (key > GPOINTER_TO_UINT(node->key)) {
if (node->right) {
node = node->right;
}
else {
/* new node to the right */
new_node = create_node(tree->allocator, node, GUINT_TO_POINTER(key),
CREATE_DATA(func, data), WMEM_NODE_COLOR_RED,
is_subtree);
node->right = new_node;
}
}
}
/* node will now point to the newly created node */
rb_insert_case1(tree, new_node);
return new_node;
}
static void *
lookup_or_insert32(wmem_tree_t *tree, guint32 key,
void*(*func)(void*), void* data, gboolean is_subtree, gboolean replace)
{
wmem_tree_node_t *node = lookup_or_insert32_node(tree, key, func, data, is_subtree, replace);
return node->data;
}
static void *
wmem_tree_lookup(wmem_tree_t *tree, const void *key, compare_func cmp)
{
wmem_tree_node_t *node;
if (tree == NULL || key == NULL) {
return NULL;
}
node = tree->root;
while (node) {
int result = cmp(key, node->key);
if (result == 0) {
return node->data;
}
else if (result < 0) {
node = node->left;
}
else if (result > 0) {
node = node->right;
}
}
return NULL;
}
wmem_tree_node_t *
wmem_tree_insert(wmem_tree_t *tree, const void *key, void *data, compare_func cmp)
{
wmem_tree_node_t *node = tree->root;
wmem_tree_node_t *new_node = NULL;
/* is this the first node ?*/
if (!node) {
tree->root = create_node(tree->allocator, node, key,
data, WMEM_NODE_COLOR_BLACK, FALSE);
return tree->root;
}
/* it was not the new root so walk the tree until we find where to
* insert this new leaf.
*/
while (!new_node) {
int result = cmp(key, node->key);
if (result == 0) {
node->data = data;
node->is_removed = data ? FALSE : TRUE;
return node;
}
else if (result < 0) {
if (node->left) {
node = node->left;
}
else {
new_node = create_node(tree->allocator, node, key,
data, WMEM_NODE_COLOR_RED, FALSE);
node->left = new_node;
}
}
else if (result > 0) {
if (node->right) {
node = node->right;
}
else {
/* new node to the right */
new_node = create_node(tree->allocator, node, key,
data, WMEM_NODE_COLOR_RED, FALSE);
node->right = new_node;
}
}
}
/* node will now point to the newly created node */
rb_insert_case1(tree, new_node);
return new_node;
}
void
wmem_tree_insert32(wmem_tree_t *tree, guint32 key, void *data)
{
lookup_or_insert32(tree, key, NULL, data, FALSE, TRUE);
}
void *
wmem_tree_lookup32(wmem_tree_t *tree, guint32 key)
{
wmem_tree_node_t *node = tree->root;
while (node) {
if (key == GPOINTER_TO_UINT(node->key)) {
return node->data;
}
else if (key < GPOINTER_TO_UINT(node->key)) {
node = node->left;
}
else if (key > GPOINTER_TO_UINT(node->key)) {
node = node->right;
}
}
return NULL;
}
void *
wmem_tree_lookup32_le(wmem_tree_t *tree, guint32 key)
{
wmem_tree_node_t *node = tree->root;
while (node) {
if (key == GPOINTER_TO_UINT(node->key)) {
return node->data;
}
else if (key < GPOINTER_TO_UINT(node->key)) {
if (node->left == NULL) {
break;
}
node = node->left;
}
else if (key > GPOINTER_TO_UINT(node->key)) {
if (node->right == NULL) {
break;
}
node = node->right;
}
}
if (!node) {
return NULL;
}
/* If we are still at the root of the tree this means that this node
* is either smaller than the search key and then we return this
* node or else there is no smaller key available and then
* we return NULL.
*/
if (node->parent == NULL) {
if (key > GPOINTER_TO_UINT(node->key)) {
return node->data;
} else {
return NULL;
}
}
if (GPOINTER_TO_UINT(node->key) <= key) {
/* if our key is <= the search key, we have the right node */
return node->data;
}
else if (node == node->parent->left) {
/* our key is bigger than the search key and we're a left child,
* we have to check if any of our ancestors are smaller. */
while (node) {
if (key > GPOINTER_TO_UINT(node->key)) {
return node->data;
}
node=node->parent;
}
return NULL;
}
else {
/* our key is bigger than the search key and we're a right child,
* our parent is the one we want */
return node->parent->data;
}
}
void
wmem_tree_insert_string(wmem_tree_t* tree, const gchar* k, void* v, guint32 flags)
{
char *key;
compare_func cmp;
key = wmem_strdup(tree->allocator, k);
if (flags & WMEM_TREE_STRING_NOCASE) {
cmp = (compare_func)g_ascii_strcasecmp;
} else {
cmp = (compare_func)strcmp;
}
wmem_tree_insert(tree, key, v, cmp);
}
void *
wmem_tree_lookup_string(wmem_tree_t* tree, const gchar* k, guint32 flags)
{
compare_func cmp;
if (flags & WMEM_TREE_STRING_NOCASE) {
cmp = (compare_func)g_ascii_strcasecmp;
} else {
cmp = (compare_func)strcmp;
}
return wmem_tree_lookup(tree, k, cmp);
}
void *
wmem_tree_remove_string(wmem_tree_t* tree, const gchar* k, guint32 flags)
{
void *ret = wmem_tree_lookup_string(tree, k, flags);
if (ret) {
/* Not really a remove, but set data to NULL to mark node with is_removed */
wmem_tree_insert_string(tree, k, NULL, flags);
}
return ret;
}
static void *
create_sub_tree(void* d)
{
return wmem_tree_new(((wmem_tree_t *)d)->allocator);
}
void
wmem_tree_insert32_array(wmem_tree_t *tree, wmem_tree_key_t *key, void *data)
{
wmem_tree_t *insert_tree = NULL;
wmem_tree_key_t *cur_key;
guint32 i, insert_key32 = 0;
for (cur_key = key; cur_key->length > 0; cur_key++) {
for (i = 0; i < cur_key->length; i++) {
/* Insert using the previous key32 */
if (!insert_tree) {
insert_tree = tree;
} else {
insert_tree = (wmem_tree_t *)lookup_or_insert32(insert_tree,
insert_key32, create_sub_tree, tree, TRUE, FALSE);
}
insert_key32 = cur_key->key[i];
}
}
g_assert(insert_tree);
wmem_tree_insert32(insert_tree, insert_key32, data);
}
static void *
wmem_tree_lookup32_array_helper(wmem_tree_t *tree, wmem_tree_key_t *key,
void*(*helper)(wmem_tree_t*, guint32))
{
wmem_tree_t *lookup_tree = NULL;
wmem_tree_key_t *cur_key;
guint32 i, lookup_key32 = 0;
if (!tree || !key) {
return NULL;
}
for (cur_key = key; cur_key->length > 0; cur_key++) {
for (i = 0; i < cur_key->length; i++) {
/* Lookup using the previous key32 */
if (!lookup_tree) {
lookup_tree = tree;
}
else {
lookup_tree =
(wmem_tree_t *)(*helper)(lookup_tree, lookup_key32);
if (!lookup_tree) {
return NULL;
}
}
lookup_key32 = cur_key->key[i];
}
}
/* Assert if we didn't get any valid keys */
g_assert(lookup_tree);
return (*helper)(lookup_tree, lookup_key32);
}
void *
wmem_tree_lookup32_array(wmem_tree_t *tree, wmem_tree_key_t *key)
{
return wmem_tree_lookup32_array_helper(tree, key, wmem_tree_lookup32);
}
void *
wmem_tree_lookup32_array_le(wmem_tree_t *tree, wmem_tree_key_t *key)
{
return wmem_tree_lookup32_array_helper(tree, key, wmem_tree_lookup32_le);
}
static gboolean
wmem_tree_foreach_nodes(wmem_tree_node_t* node, wmem_foreach_func callback,
void *user_data)
{
gboolean stop_traverse = FALSE;
if (!node) {
return FALSE;
}
if (node->left) {
if (wmem_tree_foreach_nodes(node->left, callback, user_data)) {
return TRUE;
}
}
if (node->is_subtree) {
stop_traverse = wmem_tree_foreach((wmem_tree_t *)node->data,
callback, user_data);
} else if (!node->is_removed) {
/* No callback for "removed" nodes */
stop_traverse = callback(node->key, node->data, user_data);
}
if (stop_traverse) {
return TRUE;
}
if(node->right) {
if (wmem_tree_foreach_nodes(node->right, callback, user_data)) {
return TRUE;
}
}
return FALSE;
}
gboolean
wmem_tree_foreach(wmem_tree_t* tree, wmem_foreach_func callback,
void *user_data)
{
if(!tree->root)
return FALSE;
return wmem_tree_foreach_nodes(tree->root, callback, user_data);
}
static void wmem_print_subtree(wmem_tree_t *tree, guint32 level, wmem_printer_func key_printer, wmem_printer_func data_printer);
static void
wmem_print_indent(guint32 level) {
guint32 i;
for (i=0; i<level; i++) {
printf(" ");
}
}
static void
wmem_tree_print_nodes(const char *prefix, wmem_tree_node_t *node, guint32 level,
wmem_printer_func key_printer, wmem_printer_func data_printer)
{
if (!node)
return;
wmem_print_indent(level);
printf("%sNODE:%p parent:%p left:%p right:%p colour:%s key:%p %s:%p\n",
prefix,
(void *)node, (void *)node->parent,
(void *)node->left, (void *)node->right,
node->color?"Black":"Red", node->key,
node->is_subtree?"tree":"data", node->data);
if(key_printer) {
wmem_print_indent(level);
key_printer(node->key);
printf("\n");
}
if(data_printer) {
wmem_print_indent(level);
data_printer(node->data);
printf("\n");
}
if (node->left)
wmem_tree_print_nodes("L-", node->left, level+1, key_printer, data_printer);
if (node->right)
wmem_tree_print_nodes("R-", node->right, level+1, key_printer, data_printer);
if (node->is_subtree)
wmem_print_subtree((wmem_tree_t *)node->data, level+1, key_printer, data_printer);
}
static void
wmem_print_subtree(wmem_tree_t *tree, guint32 level, wmem_printer_func key_printer, wmem_printer_func data_printer)
{
if (!tree)
return;
wmem_print_indent(level);
printf("WMEM tree:%p root:%p\n", (void *)tree, (void *)tree->root);
if (tree->root) {
wmem_tree_print_nodes("Root-", tree->root, level, key_printer, data_printer);
}
}
void
wmem_print_tree(wmem_tree_t *tree, wmem_printer_func key_printer, wmem_printer_func data_printer)
{
wmem_print_subtree(tree, 0, key_printer, data_printer);
}
/*
* Editor modelines - path_to_url
*
* Local variables:
* c-basic-offset: 4
* tab-width: 8
* indent-tabs-mode: nil
* End:
*
* vi: set shiftwidth=4 tabstop=8 expandtab:
* :indentSize=4:tabSize=8:noTabs=true:
*/
```
|
Iris (stylized as i☆Ris) is a Japanese idol girl group, formed in 2012 by Avex. The group currently consists of five members: Saki Yamakita, Yu Serizawa, Himika Akaneya, Yūki Wakai, and Miyu Kubota. The leader is Saki Yamakita. In addition to their music career, all members are also active as voice actresses, most notably in the video game and anime series PriPara. The group has also performed themes for the anime series Wise Man's Grandchild, Magical Girl Site, Magical Sempai, and Twin Star Exorcists.
History
The group was formed as a result of the that was held in 2012 (of the six successful candidates). On November 7, 2012, the group debuted with its first single titled "Color" (on the label Avex). Their third single "Rainbow" was released on August 21, 2013.
On January 21, 2021, it was announced that Azuki Shibuya would graduate from the group on March 31.
On November 7, 2022, during the "Iris 10th Anniversary Live~a Live~" concert, an anime film titled Iris the Movie -Full Energy!!- was announced and will premiere in Japanese theaters in 2024.
Members
Current members
- Leader
Former members
Timeline
Discography
Singles
Albums
DVDs / Blu-ray Discs
References
External links
Profile on the Oricon website
Japanese musical groups
Japanese girl groups
Japanese idol groups
Musical groups established in 2012
Anime singers
Avex Group artists
2012 establishments in Japan
|
The Women's time trial H3 road cycling event at the 2012 Summer Paralympics took place on September 5 at Brands Hatch. Eight riders from eight nations competed. The race distance was 16 km.
Results
References
Women's road time trial H3
2012 in women's road cycling
|
```shell
Execute a command without saving it in history
Aliasing ssh connections
Terminal based browser
Adding directories to your `$PATH`
Retrieve previous arguments
```
|
Stidia is a small town and commune in Hassi Mamèche District, Mostaganem Province, Algeria. In 1998 the commune had a total population of 10,688.
Situation
Stidia is located from Mostaganem, the wilaya (province) capital, and from Oran, the country's second largest city. A four-lane highway links both cities, via Stidia. The city is located on the Greenwich meridian.
Name
The name of Stidia derives from an old fountain named Aïn Stidia. The town was first named La Stidia, before being renamed Georges Clémenceau by the French, after World War I.
According to Salim Ammar who was born in the territory of Stidia, this town was named in the 15th century by the Moors Istija (إستجة) in honor of their lost city in Andalucia, the current Écija. The German settlers later in the 19th century mispronounced the Arabic name and it became Stidia or Stidya.
History
Before the foundation of the European settlement down the hill, the Moors who were expelled from Spain after 1492, founded the original Stidia on the hill and it is called now "Douar" Stidia to differentiate it from " Village" Stidia which is the part built during the French occupation.
The moorish influence is obvious in the territory of Stidia and Fornaka. The ethnic groups living in the territory keep the remembrance of the epic History of the fighting against the Spanish crusades.
Although the fountain Aïn Stidia existed for some time, the town was founded in 1846, by German settlers who tried to emigrate to South America, but were directed to Algeria, after being abandoned in Dunkerque, France by a dishonest conveyor.
The settlement was first helped by French soldiers who left in 1948. Although Algeria was a French colony at the time, the inhabitants continued to speak German until about the first World War.
At the independence of Algeria (1962), the town was renamed Stidia (from Georges Clémenceau).
Demographics
1866 : 486
1958 : 1.301
2002 : 11.500
Attractions
Beaches
The beaches in the Stidia region attract many tourists (mainly Algerians from Mostaganem and surroundings) during the summer. Although not the best ones of the western Algerian coast, they still offer good recreation opportunities. There is often a guarded parking (for a small fee) in front of the beach. The nearest accommodation is in Mostaganem (15 km), or, to a greater extent, in Oran (65 km). There are no hotels in Stidia.
Greenwich meridian
A plate indicates the crossing of the Greenwich meridian, on the Mostaganem-Oran highway.
References
Communes of Mostaganem Province
Cities in Algeria
|
Gothe may refer to:
Surnames
Amon Göth (1908–1946), Austrian Nazi commandant of Kraków-Płaszów concentration camp and executed war criminal
Bror Geijer Göthe (1892 – 1949) a Swedish artist, a painter and textile artist
Dieter Göthe former East German slalom canoeist
Erik Gustaf Göthe (1779 – 1838) a Swedish sculptor
Florian Gothe (born 1962) a retired German football defender
Jurgen Gothe (1944 - 2015) a Canadian radio host
Odd Christian Gøthe (1919 - 2002) a Norwegian civil servant and politician
Staffan Göthe (born 1944) a Swedish playwright, actor and director
Places
Gothe, a village in Karnataka, India.
See also
Goethe (surname)
Goth (disambiguation)
Gotha
Goda (disambiguation)
|
The 2018–19 South Dakota State Jackrabbits men's basketball team represents South Dakota State University during the 2018–19 NCAA Division I men's basketball season. The Jackrabbits, led by third-year head coach T. J. Otzelberger, play their home games at Frost Arena in Brookings, South Dakota as members of the Summit League. They finished the season 24–9, 14–2 in Summit League play to win the regular season championship. They lost in the quarterfinals of the Summit League tournament to Western Illinois. As a regular season league champion who failed to win their league tournament, they received an automatic bid to the National Invitation Tournament where they lost in the first round to Texas.
Previous season
The Jackrabbits finished the season 28–7, 13–1 in Summit League play to win the Summit League regular season championship. In the Summit League tournament, they defeated Western Illinois, North Dakota State, and South Dakota to become Summit League Tournament champions. They received the Summit League's automatic bid to the NCAA tournament where they lost in the first round to Ohio State.
Roster
Schedule and results
|-
!colspan=9 style=| Exhibition
|-
!colspan=9 style=| Non-conference regular season
|-
!colspan=9 style=| Summit League regular season
|-
!colspan=9 style=| Summit League tournament
|-
!colspan=9 style=| National Invitational tournament
Source
References
South Dakota State Jackrabbits men's basketball seasons
South Dakota State
South Dakota State Jackrabbits men's basketball
South Dakota State Jackrabbits men's basketball
South Dakota State
|
```xml
import { Component } from 'react';
import { AnyShapeCoordinates } from './util/types';
export interface Props {
// lat lng array (circle, line, symbol) or array of array... of lat lng (polygons)
coordinates: AnyShapeCoordinates;
// tslint:disable-next-line:no-any
properties?: any;
onClick?: React.MouseEventHandler<HTMLElement>;
onMouseEnter?: React.MouseEventHandler<HTMLElement>;
onMouseLeave?: React.MouseEventHandler<HTMLElement>;
draggable?: boolean;
onDragStart?: React.MouseEventHandler<HTMLElement>;
onDrag?: React.MouseEventHandler<HTMLElement>;
onDragEnd?: React.MouseEventHandler<HTMLElement>;
}
export class Feature extends Component<Props> {
public render() {
return null;
}
}
export default Feature;
```
|
```c++
//
// ssl/impl/error.ipp
// ~~~~~~~~~~~~~~~~~~
//
//
// file LICENSE_1_0.txt or copy at path_to_url
//
#ifndef BOOST_ASIO_SSL_IMPL_ERROR_IPP
#define BOOST_ASIO_SSL_IMPL_ERROR_IPP
#if defined(_MSC_VER) && (_MSC_VER >= 1200)
# pragma once
#endif // defined(_MSC_VER) && (_MSC_VER >= 1200)
#include <boost/asio/detail/config.hpp>
#include <boost/asio/ssl/error.hpp>
#include <boost/asio/ssl/detail/openssl_init.hpp>
#include <boost/asio/detail/push_options.hpp>
namespace boost {
namespace asio {
namespace error {
namespace detail {
class ssl_category : public boost::system::error_category
{
public:
const char* name() const BOOST_ASIO_ERROR_CATEGORY_NOEXCEPT
{
return "asio.ssl";
}
std::string message(int value) const
{
const char* s = ::ERR_reason_error_string(value);
return s ? s : "asio.ssl error";
}
};
} // namespace detail
const boost::system::error_category& get_ssl_category()
{
static detail::ssl_category instance;
return instance;
}
} // namespace error
namespace ssl {
namespace error {
#if (OPENSSL_VERSION_NUMBER < 0x10100000L) && !defined(OPENSSL_IS_BORINGSSL)
const boost::system::error_category& get_stream_category()
{
return boost::asio::error::get_ssl_category();
}
#else
namespace detail {
class stream_category : public boost::system::error_category
{
public:
const char* name() const BOOST_ASIO_ERROR_CATEGORY_NOEXCEPT
{
return "asio.ssl.stream";
}
std::string message(int value) const
{
switch (value)
{
case stream_truncated: return "stream truncated";
default: return "asio.ssl.stream error";
}
}
};
} // namespace detail
const boost::system::error_category& get_stream_category()
{
static detail::stream_category instance;
return instance;
}
#endif
} // namespace error
} // namespace ssl
} // namespace asio
} // namespace boost
#include <boost/asio/detail/pop_options.hpp>
#endif // BOOST_ASIO_SSL_IMPL_ERROR_IPP
```
|
```go
// Unless explicitly stated otherwise all files in this repository are licensed
// This product includes software developed at Datadog (path_to_url
package flare
import (
"path/filepath"
"regexp"
"strings"
"github.com/DataDog/datadog-agent/comp/core/flare/types"
)
// Match .yaml and .yml to ship configuration files in the flare.
var cnfFileExtRx = regexp.MustCompile(`(?i)\.ya?ml`)
func getFirstSuffix(s string) string {
return filepath.Ext(strings.TrimSuffix(s, filepath.Ext(s)))
}
func (f *flare) collectLogsFiles(fb types.FlareBuilder) error {
logFile := f.config.GetString("log_file")
if logFile == "" {
logFile = f.params.defaultLogFile
}
jmxLogFile := f.config.GetString("jmx_log_file")
if jmxLogFile == "" {
jmxLogFile = f.params.defaultJMXLogFile
}
dogstatsdLogFile := f.config.GetString("dogstatsd_log_file")
if dogstatsdLogFile == "" {
dogstatsdLogFile = f.params.defaultDogstatsdLogFile
}
shouldIncludeFunc := func(path string) bool {
if filepath.Ext(path) == ".log" || getFirstSuffix(path) == ".log" {
return true
}
return false
}
f.log.Flush()
fb.CopyDirToWithoutScrubbing(filepath.Dir(logFile), "logs", shouldIncludeFunc) //nolint:errcheck
fb.CopyDirToWithoutScrubbing(filepath.Dir(jmxLogFile), "logs", shouldIncludeFunc) //nolint:errcheck
fb.CopyDirToWithoutScrubbing(filepath.Dir(dogstatsdLogFile), "logs", shouldIncludeFunc) //nolint:errcheck
return nil
}
func (f *flare) collectConfigFiles(fb types.FlareBuilder) error {
confSearchPaths := map[string]string{
"": f.config.GetString("confd_path"),
"dist": filepath.Join(f.params.distPath, "conf.d"),
"checksd": f.params.pythonChecksPath,
}
for prefix, filePath := range confSearchPaths {
fb.CopyDirTo(filePath, filepath.Join("etc", "confd", prefix), func(path string) bool { //nolint:errcheck
// ignore .example file
if filepath.Ext(path) == ".example" {
return false
}
firstSuffix := []byte(getFirstSuffix(path))
ext := []byte(filepath.Ext(path))
if cnfFileExtRx.Match(firstSuffix) || cnfFileExtRx.Match(ext) {
return true
}
return false
})
}
return nil
}
```
|
G. M. Bhat (born 2 July 1959) is a geologist from Jammu and Kashmir, India. He was the head professor at Department of Geology of Jammu University.
In 2020, he was nominated as a member of the Scientific Board of Geoscience Programme (IGCP) by the United Nations Educational, Scientific and Cultural Organization (UNESCO).
In addition to his work as a professor, Bhat has also served as the Head of the Geological Department at Jammu University.
Early life
Ghulam M. Bhat was born on 2 July 1959 in Srinagar. He has received his Bachelor of Science degree from Kashmir University in Srinagar, India in 1979. He then went on to earn his Master of Science from Jammu University in 1981 and his Master of Philosophy from the same institution in 1983. In 1987, he completed his Doctor of Philosophy degree from Jammu University.
Career
G.M. Bhat started his career as a lecturer in higher education in Srinagar in 1986–1987. He then joined Jammu University in 1987 and served as a lecturer until 1992. He was promoted to senior lecturer in 1992 and served in this position until 1998. In 1997, he was designated as a reader in sedimentology and biostratigraphy. In 1999, he became a reader in the department of geology and geophysics at the University of Kashmir in Srinagar.
Throughout his career, Bhat has been an active member of various professional organizations. He has served as the chairman of the Siwalik Research Group and as the convener of the Convention of Indian Association Sedimentologists in 1999. He has also been the convener of the International Research Working Group on Mitigation of Natural Hazards in Jammu and Kashmir in 1999. Bhat has served as the head of the Geological Department at Jammu University.
In 2013, he was appointed as rector at Bhaderwah Campus of Jammu University.
Works
He has published numbers of articles and books, some of them are as follow;
"Petrogenesis of the flood basalts from the Early Permian Panjal Traps, Kashmir, India: Geochemical evidence for shallow melting of the mantle" (2014/9/1) by J Gregory Shellnutt, Ghulam M Bhat, Kuo-Lung Wang, Michael E Brookfield, Bor-Ming Jahn, Jaroslav Dostal.
"No link between the Panjal Traps (Kashmir) and the Late Permian mass extinctions" (2011/10) by JG Shellnutt, GM Bhat, ME Brookfield, B‐M Jahn.
"Two-stage marine anoxia and biotic response during the Permian–Triassic transition in Kashmir, northern India: pyrite framboid evidence" (2019/1/1) by Yuangeng Huang, Zhong-Qiang Chen, Thomas J Algeo, Laishi Zhao, Aymon Baud, Ghulam M Bhat, Lei Zhang, Zhen Guo.
"Origin of the silicic volcanic rocks of the Early Permian Panjal Traps, Kashmir, India" (2012/12/12) by J Gregory Shellnutt, Ghulam M Bhat, Kuo-Lung Wang, Michael E Brookfield, Jaroslav Dostal, Bor-Ming Jahn.
"Hot springs and the geothermal energy potential of Jammu & Kashmir State, NW Himalaya, India" (2013/11/1) by J Craig, A Absar, G Bhat, G Cadel, M Hafiz, N Hakhoo, R Kasskari, J Moore, TE Ricchiuto, J Thurow, B Thusu.
"Petroleum systems and hydrocarbon potential of the North-West Himalaya of India and Pakistan" (2018/12/1) by J Craig, N Hakhoo, GM Bhat, M Hafiz, MR Khan, R Misra, SK Pandita, BK Raina, J Thurow, B Thusu, W Ahmed, S Khullar.
"Geology and hydrocarbon potential of Neoproterozoic–Cambrian Basins in Asia: an introduction" (2012) by GM Bhat, J Craig, M Hafiz, N Hakhoo, JW Thurow, B Thusu, A Cozzi.
"Depositional environments and diagenesis of the kuldhar and Keera Dome carbonates (Late Bathonian–Early Callovian) of Western India" (2006/10/1) by AHM Ahmad, GM Bhat, M Haris Azim Khan.
Foundations: DN Wadia and his links with the Geology Department at the University of Jammu, India (2016) by E. R. Craig-Geen, GM Bhat, Jonathan Craig, Bindra Thusu.
Geology and Hydrocarbon Potential of Neoproterozoic-Cambrian Basins in Asia.
Geoenvironment : challenges ahead.
Northwest Himalayan successions along Jammu-Srinagar transect : field guide.
References
Geology educators
University of Kashmir alumni
University of Jammu alumni
1959 births
Living people
Academic staff of the University of Jammu
|
```go
package message
import (
"fmt"
"github.com/silenceper/wechat/v2/officialaccount/context"
"github.com/silenceper/wechat/v2/util"
)
const (
subscribeSendURL = "path_to_url"
subscribeTemplateListURL = "path_to_url"
subscribeTemplateAddURL = "path_to_url"
subscribeTemplateDelURL = "path_to_url"
subscribeTemplateGetCategoryURL = "path_to_url"
subscribeTemplateGetPubTplKeyWorksURL = "path_to_url"
subscribeTemplateGetPubTplTitles = "path_to_url"
)
// Subscribe
type Subscribe struct {
*context.Context
}
// NewSubscribe
func NewSubscribe(context *context.Context) *Subscribe {
tpl := new(Subscribe)
tpl.Context = context
return tpl
}
// SubscribeMessage
type SubscribeMessage struct {
ToUser string `json:"touser"` // , OpenID
TemplateID string `json:"template_id"` // , ID
Page string `json:"page,omitempty"` // ,
Data map[string]*SubscribeDataItem `json:"data"` // ,
MiniProgram struct {
AppID string `json:"appid"` // appidappid
PagePath string `json:"pagepath"` // ,index?foo=bar
} `json:"miniprogram"` // ,
}
// SubscribeDataItem .DATA
type SubscribeDataItem struct {
Value string `json:"value"`
}
// Send
func (tpl *Subscribe) Send(msg *SubscribeMessage) (err error) {
var accessToken string
accessToken, err = tpl.GetAccessToken()
if err != nil {
return
}
uri := fmt.Sprintf("%s?access_token=%s", subscribeSendURL, accessToken)
response, err := util.PostJSON(uri, msg)
if err != nil {
return
}
return util.DecodeWithCommonError(response, "SendSubscribeMessage")
}
// PrivateSubscribeItem
type PrivateSubscribeItem struct {
PriTmplID string `json:"priTmplId"` // id
Title string `json:"title"` //
Content string `json:"content"` //
Example string `json:"example"` //
SubType int `json:"type"` // 2 3
}
type resPrivateSubscribeList struct {
util.CommonError
SubscriptionList []*PrivateSubscribeItem `json:"data"`
}
// List
func (tpl *Subscribe) List() (templateList []*PrivateSubscribeItem, err error) {
var accessToken string
accessToken, err = tpl.GetAccessToken()
if err != nil {
return
}
uri := fmt.Sprintf("%s?access_token=%s", subscribeTemplateListURL, accessToken)
var response []byte
response, err = util.HTTPGet(uri)
if err != nil {
return
}
var res resPrivateSubscribeList
err = util.DecodeWithError(response, &res, "ListSubscribe")
return res.SubscriptionList, err
}
type resSubscribeAdd struct {
util.CommonError
TemplateID string `json:"priTmplId"`
}
// Add
func (tpl *Subscribe) Add(ShortID string, kidList []int, sceneDesc string) (templateID string, err error) {
var accessToken string
accessToken, err = tpl.GetAccessToken()
if err != nil {
return
}
var msg = struct {
TemplateIDShort string `json:"tid"`
SceneDesc string `json:"sceneDesc"`
KidList []int `json:"kidList"`
}{TemplateIDShort: ShortID, SceneDesc: sceneDesc, KidList: kidList}
uri := fmt.Sprintf("%s?access_token=%s", subscribeTemplateAddURL, accessToken)
var response []byte
response, err = util.PostJSON(uri, msg)
if err != nil {
return
}
var result resSubscribeAdd
err = util.DecodeWithError(response, &result, "AddSubscribe")
return result.TemplateID, err
}
// Delete
func (tpl *Subscribe) Delete(templateID string) (err error) {
var accessToken string
accessToken, err = tpl.GetAccessToken()
if err != nil {
return
}
var msg = struct {
TemplateID string `json:"priTmplId"`
}{TemplateID: templateID}
uri := fmt.Sprintf("%s?access_token=%s", subscribeTemplateDelURL, accessToken)
var response []byte
response, err = util.PostJSON(uri, msg)
if err != nil {
return
}
return util.DecodeWithCommonError(response, "DeleteSubscribe")
}
// PublicTemplateCategory
type PublicTemplateCategory struct {
ID int `json:"id"` // ID
Name string `json:"name"` //
}
type resSubscribeCategoryList struct {
util.CommonError
CategoryList []*PublicTemplateCategory `json:"data"`
}
// GetCategory
func (tpl *Subscribe) GetCategory() (categoryList []*PublicTemplateCategory, err error) {
var accessToken string
accessToken, err = tpl.GetAccessToken()
if err != nil {
return
}
uri := fmt.Sprintf("%s?access_token=%s", subscribeTemplateGetCategoryURL, accessToken)
var response []byte
response, err = util.HTTPGet(uri)
if err != nil {
return
}
var result resSubscribeCategoryList
err = util.DecodeWithError(response, &result, "GetCategory")
return result.CategoryList, err
}
// PublicTemplateKeyWords
type PublicTemplateKeyWords struct {
KeyWordsID int `json:"kid"` // id
Name string `json:"name"` //
Example string `json:"example"` //
Rule string `json:"rule"` //
}
type resPublicTemplateKeyWordsList struct {
util.CommonError
KeyWordsList []*PublicTemplateKeyWords `json:"data"` //
}
// GetPubTplKeyWordsByID
func (tpl *Subscribe) GetPubTplKeyWordsByID(titleID string) (keyWordsList []*PublicTemplateKeyWords, err error) {
var accessToken string
accessToken, err = tpl.GetAccessToken()
if err != nil {
return
}
uri := fmt.Sprintf("%s?access_token=%s&tid=%s", subscribeTemplateGetPubTplKeyWorksURL, accessToken, titleID)
var response []byte
response, err = util.HTTPGet(uri)
if err != nil {
return
}
var result resPublicTemplateKeyWordsList
err = util.DecodeWithError(response, &result, "GetPublicTemplateKeyWords")
return result.KeyWordsList, err
}
// PublicTemplateTitle
type PublicTemplateTitle struct {
TitleID int `json:"tid"` // id
Title string `json:"title"` //
Type int `json:"type"` // 2 3
CategoryID string `json:"categoryId"` // id
}
type resPublicTemplateTitleList struct {
util.CommonError
Count int `json:"count"` //
TemplateTitleList []*PublicTemplateTitle `json:"data"` //
}
// GetPublicTemplateTitleList
func (tpl *Subscribe) GetPublicTemplateTitleList(ids string, start int, limit int) (count int, templateTitleList []*PublicTemplateTitle, err error) {
var accessToken string
accessToken, err = tpl.GetAccessToken()
if err != nil {
return
}
uri := fmt.Sprintf("%s?access_token=%s&ids=%s&start=%d&limit=%d", subscribeTemplateGetPubTplTitles, accessToken, ids, start, limit)
var response []byte
response, err = util.HTTPGet(uri)
if err != nil {
return
}
var result resPublicTemplateTitleList
err = util.DecodeWithError(response, &result, "GetPublicTemplateTitle")
return result.Count, result.TemplateTitleList, err
}
```
|
```kotlin
package expo.modules.kotlin.jni
import com.facebook.jni.HybridData
import expo.modules.core.interfaces.DoNotStrip
/**
* A Kotlin representation of jsi::Object.
* Should be used only on the runtime thread.
*/
@Suppress("KotlinJniMissingFunction")
@DoNotStrip
open class JavaScriptObject @DoNotStrip internal constructor(@DoNotStrip private val mHybridData: HybridData) : Destructible {
/**
* The property descriptor options for the property being defined or modified.
*/
enum class PropertyDescriptor(val value: Int) {
/**
* If set, the type of this property descriptor may be changed and if the property may be deleted from the corresponding object.
*/
Configurable(1 shl 0),
/**
* If set, the property shows up during enumeration of the properties on the corresponding object.
*/
Enumerable(1 shl 1),
/**
* If set, the value associated with the property may be changed with an assignment operator.
*/
Writable(1 shl 2)
}
fun isValid() = mHybridData.isValid
external fun hasProperty(name: String): Boolean
external fun getProperty(name: String): JavaScriptValue
operator fun get(name: String): JavaScriptValue? {
if (hasProperty(name)) {
return getProperty(name)
}
return null
}
external fun getPropertyNames(): Array<String>
external fun createWeak(): JavaScriptWeakObject
private external fun setBoolProperty(name: String, value: Boolean)
private external fun setDoubleProperty(name: String, value: Double)
private external fun setStringProperty(name: String, value: String?)
private external fun setJSValueProperty(name: String, value: JavaScriptValue?)
private external fun setJSObjectProperty(name: String, value: JavaScriptObject?)
private external fun unsetProperty(name: String)
private external fun defineBoolProperty(name: String, value: Boolean, options: Int)
private external fun defineDoubleProperty(name: String, value: Double, options: Int)
private external fun defineStringProperty(name: String, value: String?, options: Int)
private external fun defineJSValueProperty(name: String, value: JavaScriptValue?, options: Int)
private external fun defineJSObjectProperty(name: String, value: JavaScriptObject?, options: Int)
private external fun defineNativeDeallocator(deallocator: JNIFunctionBody)
internal fun defineDeallocator(deallocator: () -> Unit) {
defineNativeDeallocator {
deallocator()
}
}
fun setProperty(name: String, value: Boolean) = setBoolProperty(name, value)
operator fun set(name: String, value: Boolean) = setBoolProperty(name, value)
fun setProperty(name: String, value: Int) = setDoubleProperty(name, value.toDouble())
operator fun set(name: String, value: Int) = setDoubleProperty(name, value.toDouble())
fun setProperty(name: String, value: Double) = setDoubleProperty(name, value)
operator fun set(name: String, value: Double) = setDoubleProperty(name, value)
fun setProperty(name: String, value: String?) = setStringProperty(name, value)
operator fun set(name: String, value: String?) = setStringProperty(name, value)
fun setProperty(name: String, value: JavaScriptValue?) = setJSValueProperty(name, value)
operator fun set(name: String, value: JavaScriptValue?) = setJSValueProperty(name, value)
fun setProperty(name: String, value: JavaScriptObject?) = setJSObjectProperty(name, value)
operator fun set(name: String, value: JavaScriptObject?) = setJSObjectProperty(name, value)
// Needed to handle untyped null value
// Without it setProperty(name, null) won't work
fun setProperty(name: String, @Suppress("UNUSED_PARAMETER") `null`: Nothing?) = unsetProperty(name)
operator fun set(name: String, @Suppress("UNUSED_PARAMETER") `null`: Nothing?) = unsetProperty(name)
fun defineProperty(
name: String,
value: Boolean,
options: List<PropertyDescriptor> = emptyList()
) = defineBoolProperty(name, value, options.toCppOptions())
fun defineProperty(
name: String,
value: Int,
options: List<PropertyDescriptor> = emptyList()
) = defineDoubleProperty(name, value.toDouble(), options.toCppOptions())
fun defineProperty(
name: String,
value: Double,
options: List<PropertyDescriptor> = emptyList()
) = defineDoubleProperty(name, value, options.toCppOptions())
fun defineProperty(
name: String,
value: String?,
options: List<PropertyDescriptor> = emptyList()
) = defineStringProperty(name, value, options.toCppOptions())
fun defineProperty(
name: String,
value: JavaScriptValue?,
options: List<PropertyDescriptor> = emptyList()
) = defineJSValueProperty(name, value, options.toCppOptions())
fun defineProperty(
name: String,
value: JavaScriptObject?,
options: List<PropertyDescriptor> = emptyList()
) = defineJSObjectProperty(name, value, options.toCppOptions())
// Needed to handle untyped null value
fun defineProperty(
name: String,
@Suppress("UNUSED_PARAMETER") `null`: Nothing?,
options: List<PropertyDescriptor> = emptyList()
) = defineJSObjectProperty(name, null, options.toCppOptions())
@Throws(Throwable::class)
protected fun finalize() {
deallocate()
}
override fun deallocate() {
mHybridData.resetNative()
}
}
private fun List<JavaScriptObject.PropertyDescriptor>.toCppOptions(): Int =
fold(0) { acc, current ->
acc or current.value
}
```
|
Acton is an unincorporated community in Shelby County, in the U.S. state of Alabama. It is partially located within the city of Hoover. It is not to be confused with the village of Acton, approximately miles to the northeast in Jefferson County.
History
Alabama Fuel & Iron Company established coal mines at Acton and the company town of Acton grew up around them. The mines were served by the Louisville and Nashville Railroad. On November 18, 1913, 21 miners were killed by an explosion in Mine Number 2. After the mines closed, the area was converted into the Riverchase real estate development.
A post office was established at Acton in 1908, and remained in operation until it was discontinued in 1926. The community was likely named for William Acton, a local businessperson in the mining industry.
In the 1970s, the land was developed into the Riverchase residential planned community, which was annexed into Hoover, Alabama in 1980.
Demographics
Acton/Highland Precinct (1870-1950)
According to the census returns from 1850-2010 for Alabama, Acton village has never reported a population figure separately on the U.S. Census. Acton (Precinct 12 of Shelby County) first appeared on the 1920 U.S. Census (not to be confused with Acton's Precinct 15, which appeared in 1880 and was moved to Jefferson County, where the other Acton village is located). Acton Precinct only appeared under this name on this one occasion. Prior to 1920 and again from 1930 to 1950 the name was Highland Precinct, which first appeared on the 1870 census as Shelby County Beat 4 and then Beat/Precinct 12 from 1880-onwards. In 1960, the precincts were merged and/or reorganized into census divisions (as part of a general reorganization of counties) and it was consolidated into the census division of Helena. In 1980, that census division was consolidated into the new division of Alabaster-Helena.
References
External links
Pictures of Acton coal mines
Unincorporated communities in Shelby County, Alabama
Unincorporated communities in Alabama
|
```java
/*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 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.
*/
package net.runelite.client.plugins.mining;
import com.google.inject.Guice;
import com.google.inject.testing.fieldbinder.Bind;
import com.google.inject.testing.fieldbinder.BoundFieldModule;
import javax.inject.Inject;
import net.runelite.api.ChatMessageType;
import net.runelite.api.Client;
import net.runelite.api.events.ChatMessage;
import net.runelite.client.ui.overlay.OverlayManager;
import static org.junit.Assert.assertNotNull;
import org.junit.Before;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.mockito.Mock;
import org.mockito.junit.MockitoJUnitRunner;
@RunWith(MockitoJUnitRunner.class)
public class MiningPluginTest
{
@Inject
MiningPlugin miningPlugin;
@Mock
@Bind
MiningConfig miningConfig;
@Mock
@Bind
Client client;
@Mock
@Bind
MiningOverlay miningOverlay;
@Mock
@Bind
MiningRocksOverlay miningRocksOverlay;
@Mock
@Bind
OverlayManager overlayManager;
@Before
public void before()
{
Guice.createInjector(BoundFieldModule.of(this)).injectMembers(this);
}
@Test
public void testClay()
{
testMessage("You manage to mine some clay.");
}
@Test
public void testIron()
{
testMessage("You manage to mine some iron.");
}
@Test
public void testRunite()
{
testMessage("You manage to mine some runite.");
}
@Test
public void testSandstone()
{
testMessage("You manage to quarry some sandstone.");
}
@Test
public void testGranite()
{
testMessage("You manage to quarry some granite.");
}
@Test
public void testOpal()
{
testMessage("You just mined an Opal!");
}
@Test
public void testJade()
{
testMessage("You just mined a piece of Jade!");
}
@Test
public void testRedTopaz()
{
testMessage("You just mined a Red Topaz!");
}
@Test
public void testSapphire()
{
testMessage("You just mined a Sapphire!");
}
@Test
public void testEmerald()
{
testMessage("You just mined an Emerald!");
}
@Test
public void testRuby()
{
testMessage("You just mined a Ruby!");
}
@Test
public void testDiamond()
{
testMessage("You just mined a Diamond!");
}
private void testMessage(String gameMessage)
{
ChatMessage chatMessage = new ChatMessage(null, ChatMessageType.SPAM, "", gameMessage, "", 0);
miningPlugin.onChatMessage(chatMessage);
assertNotNull(miningPlugin.getSession());
}
}
```
|
Ben Norris may refer to:
Ben Norris (artist), (1910–2006), American modernist painter
Ben Norris (actor), British playwright and actor
Ben Norris (comedian), British stand-up comic
|
```rust
//! This is an implementation of [`Reader`] for reading from a [`BufRead`] as
//! underlying byte stream.
use std::fs::File;
use std::io::{self, BufRead, BufReader};
use std::path::Path;
use crate::errors::{Error, Result};
use crate::events::Event;
use crate::name::QName;
use crate::parser::Parser;
use crate::reader::{BangType, ReadTextResult, Reader, Span, XmlSource};
use crate::utils::is_whitespace;
macro_rules! impl_buffered_source {
($($lf:lifetime, $reader:tt, $async:ident, $await:ident)?) => {
#[cfg(not(feature = "encoding"))]
#[inline]
$($async)? fn remove_utf8_bom(&mut self) -> io::Result<()> {
use crate::encoding::UTF8_BOM;
loop {
break match self $(.$reader)? .fill_buf() $(.$await)? {
Ok(n) => {
if n.starts_with(UTF8_BOM) {
self $(.$reader)? .consume(UTF8_BOM.len());
}
Ok(())
},
Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue,
Err(e) => Err(e),
};
}
}
#[cfg(feature = "encoding")]
#[inline]
$($async)? fn detect_encoding(&mut self) -> io::Result<Option<&'static encoding_rs::Encoding>> {
loop {
break match self $(.$reader)? .fill_buf() $(.$await)? {
Ok(n) => if let Some((enc, bom_len)) = crate::encoding::detect_encoding(n) {
self $(.$reader)? .consume(bom_len);
Ok(Some(enc))
} else {
Ok(None)
},
Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue,
Err(e) => Err(e),
};
}
}
#[inline]
$($async)? fn read_text $(<$lf>)? (
&mut self,
buf: &'b mut Vec<u8>,
position: &mut u64,
) -> ReadTextResult<'b, &'b mut Vec<u8>> {
let mut read = 0;
let start = buf.len();
loop {
let available = match self $(.$reader)? .fill_buf() $(.$await)? {
Ok(n) if n.is_empty() => break,
Ok(n) => n,
Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue,
Err(e) => {
*position += read;
return ReadTextResult::Err(e);
}
};
match memchr::memchr(b'<', available) {
// Special handling is needed only on the first iteration.
// On next iterations we already read something and should emit Text event
Some(0) if read == 0 => {
self $(.$reader)? .consume(1);
*position += 1;
return ReadTextResult::Markup(buf);
}
Some(i) => {
buf.extend_from_slice(&available[..i]);
let used = i + 1;
self $(.$reader)? .consume(used);
read += used as u64;
*position += read;
return ReadTextResult::UpToMarkup(&buf[start..]);
}
None => {
buf.extend_from_slice(available);
let used = available.len();
self $(.$reader)? .consume(used);
read += used as u64;
}
}
}
*position += read;
ReadTextResult::UpToEof(&buf[start..])
}
#[inline]
$($async)? fn read_with<$($lf,)? P: Parser>(
&mut self,
mut parser: P,
buf: &'b mut Vec<u8>,
position: &mut u64,
) -> Result<&'b [u8]> {
let mut read = 0;
let start = buf.len();
loop {
let available = match self $(.$reader)? .fill_buf() $(.$await)? {
Ok(n) if n.is_empty() => break,
Ok(n) => n,
Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue,
Err(e) => {
*position += read;
return Err(Error::Io(e.into()));
}
};
if let Some(i) = parser.feed(available) {
buf.extend_from_slice(&available[..i]);
// +1 for `>` which we do not include
self $(.$reader)? .consume(i + 1);
read += i as u64 + 1;
*position += read;
return Ok(&buf[start..]);
}
// The `>` symbol not yet found, continue reading
buf.extend_from_slice(available);
let used = available.len();
self $(.$reader)? .consume(used);
read += used as u64;
}
*position += read;
Err(Error::Syntax(P::eof_error()))
}
#[inline]
$($async)? fn read_bang_element $(<$lf>)? (
&mut self,
buf: &'b mut Vec<u8>,
position: &mut u64,
) -> Result<(BangType, &'b [u8])> {
// Peeked one bang ('!') before being called, so it's guaranteed to
// start with it.
let start = buf.len();
let mut read = 1;
buf.push(b'!');
self $(.$reader)? .consume(1);
let bang_type = BangType::new(self.peek_one() $(.$await)? ?)?;
loop {
match self $(.$reader)? .fill_buf() $(.$await)? {
// Note: Do not update position, so the error points to
// somewhere sane rather than at the EOF
Ok(n) if n.is_empty() => break,
Ok(available) => {
// We only parse from start because we don't want to consider
// whatever is in the buffer before the bang element
if let Some((consumed, used)) = bang_type.parse(&buf[start..], available) {
buf.extend_from_slice(consumed);
self $(.$reader)? .consume(used);
read += used as u64;
*position += read;
return Ok((bang_type, &buf[start..]));
} else {
buf.extend_from_slice(available);
let used = available.len();
self $(.$reader)? .consume(used);
read += used as u64;
}
}
Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue,
Err(e) => {
*position += read;
return Err(Error::Io(e.into()));
}
}
}
*position += read;
Err(bang_type.to_err())
}
#[inline]
$($async)? fn skip_whitespace(&mut self, position: &mut u64) -> io::Result<()> {
loop {
break match self $(.$reader)? .fill_buf() $(.$await)? {
Ok(n) => {
let count = n.iter().position(|b| !is_whitespace(*b)).unwrap_or(n.len());
if count > 0 {
self $(.$reader)? .consume(count);
*position += count as u64;
continue;
} else {
Ok(())
}
}
Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue,
Err(e) => Err(e),
};
}
}
#[inline]
$($async)? fn peek_one(&mut self) -> io::Result<Option<u8>> {
loop {
break match self $(.$reader)? .fill_buf() $(.$await)? {
Ok(n) => Ok(n.first().cloned()),
Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue,
Err(e) => Err(e),
};
}
}
};
}
// Make it public for use in async implementations.
// New rustc reports
// > warning: the item `impl_buffered_source` is imported redundantly
// so make it public only when async feature is enabled
#[cfg(feature = "async-tokio")]
pub(super) use impl_buffered_source;
/// Implementation of `XmlSource` for any `BufRead` reader using a user-given
/// `Vec<u8>` as buffer that will be borrowed by events.
impl<'b, R: BufRead> XmlSource<'b, &'b mut Vec<u8>> for R {
impl_buffered_source!();
}
////////////////////////////////////////////////////////////////////////////////////////////////////
/// This is an implementation for reading from a [`BufRead`] as underlying byte stream.
impl<R: BufRead> Reader<R> {
/// Reads the next `Event`.
///
/// This is the main entry point for reading XML `Event`s.
///
/// `Event`s borrow `buf` and can be converted to own their data if needed (uses `Cow`
/// internally).
///
/// Having the possibility to control the internal buffers gives you some additional benefits
/// such as:
///
/// - Reduce the number of allocations by reusing the same buffer. For constrained systems,
/// you can call `buf.clear()` once you are done with processing the event (typically at the
/// end of your loop).
/// - Reserve the buffer length if you know the file size (using `Vec::with_capacity`).
///
/// # Examples
///
/// ```
/// # use pretty_assertions::assert_eq;
/// use quick_xml::events::Event;
/// use quick_xml::reader::Reader;
///
/// let xml = r#"<tag1 att1 = "test">
/// <tag2><!--Test comment-->Test</tag2>
/// <tag2>Test 2</tag2>
/// </tag1>"#;
/// let mut reader = Reader::from_str(xml);
/// reader.config_mut().trim_text(true);
/// let mut count = 0;
/// let mut buf = Vec::new();
/// let mut txt = Vec::new();
/// loop {
/// match reader.read_event_into(&mut buf) {
/// Ok(Event::Start(_)) => count += 1,
/// Ok(Event::Text(e)) => txt.push(e.unescape().unwrap().into_owned()),
/// Err(e) => panic!("Error at position {}: {:?}", reader.error_position(), e),
/// Ok(Event::Eof) => break,
/// _ => (),
/// }
/// buf.clear();
/// }
/// assert_eq!(count, 3);
/// assert_eq!(txt, vec!["Test".to_string(), "Test 2".to_string()]);
/// ```
#[inline]
pub fn read_event_into<'b>(&mut self, buf: &'b mut Vec<u8>) -> Result<Event<'b>> {
self.read_event_impl(buf)
}
/// Reads until end element is found using provided buffer as intermediate
/// storage for events content. This function is supposed to be called after
/// you already read a [`Start`] event.
///
/// Returns a span that cover content between `>` of an opening tag and `<` of
/// a closing tag or an empty slice, if [`expand_empty_elements`] is set and
/// this method was called after reading expanded [`Start`] event.
///
/// Manages nested cases where parent and child elements have the _literally_
/// same name.
///
/// If a corresponding [`End`] event is not found, an error of type [`Error::IllFormed`]
/// will be returned. In particularly, that error will be returned if you call
/// this method without consuming the corresponding [`Start`] event first.
///
/// If your reader created from a string slice or byte array slice, it is
/// better to use [`read_to_end()`] method, because it will not copy bytes
/// into intermediate buffer.
///
/// The provided `buf` buffer will be filled only by one event content at time.
/// Before reading of each event the buffer will be cleared. If you know an
/// appropriate size of each event, you can preallocate the buffer to reduce
/// number of reallocations.
///
/// The `end` parameter should contain name of the end element _in the reader
/// encoding_. It is good practice to always get that parameter using
/// [`BytesStart::to_end()`] method.
///
/// The correctness of the skipped events does not checked, if you disabled
/// the [`check_end_names`] option.
///
/// # Namespaces
///
/// While the `Reader` does not support namespace resolution, namespaces
/// does not change the algorithm for comparing names. Although the names
/// `a:name` and `b:name` where both prefixes `a` and `b` resolves to the
/// same namespace, are semantically equivalent, `</b:name>` cannot close
/// `<a:name>`, because according to [the specification]
///
/// > The end of every element that begins with a **start-tag** MUST be marked
/// > by an **end-tag** containing a name that echoes the element's type as
/// > given in the **start-tag**
///
/// # Examples
///
/// This example shows, how you can skip XML content after you read the
/// start event.
///
/// ```
/// # use pretty_assertions::assert_eq;
/// use quick_xml::events::{BytesStart, Event};
/// use quick_xml::reader::Reader;
///
/// let mut reader = Reader::from_str(r#"
/// <outer>
/// <inner>
/// <inner></inner>
/// <inner/>
/// <outer></outer>
/// <outer/>
/// </inner>
/// </outer>
/// "#);
/// reader.config_mut().trim_text(true);
/// let mut buf = Vec::new();
///
/// let start = BytesStart::new("outer");
/// let end = start.to_end().into_owned();
///
/// // First, we read a start event...
/// assert_eq!(reader.read_event_into(&mut buf).unwrap(), Event::Start(start));
///
/// // ...then, we could skip all events to the corresponding end event.
/// // This call will correctly handle nested <outer> elements.
/// // Note, however, that this method does not handle namespaces.
/// reader.read_to_end_into(end.name(), &mut buf).unwrap();
///
/// // At the end we should get an Eof event, because we ate the whole XML
/// assert_eq!(reader.read_event_into(&mut buf).unwrap(), Event::Eof);
/// ```
///
/// [`Start`]: Event::Start
/// [`End`]: Event::End
/// [`BytesStart::to_end()`]: crate::events::BytesStart::to_end
/// [`read_to_end()`]: Self::read_to_end
/// [`expand_empty_elements`]: crate::reader::Config::expand_empty_elements
/// [`check_end_names`]: crate::reader::Config::check_end_names
/// [the specification]: path_to_url#dt-etag
pub fn read_to_end_into(&mut self, end: QName, buf: &mut Vec<u8>) -> Result<Span> {
Ok(read_to_end!(self, end, buf, read_event_impl, {
buf.clear();
}))
}
}
impl Reader<BufReader<File>> {
/// Creates an XML reader from a file path.
pub fn from_file<P: AsRef<Path>>(path: P) -> Result<Self> {
let file = File::open(path)?;
let reader = BufReader::new(file);
Ok(Self::from_reader(reader))
}
}
#[cfg(test)]
mod test {
use crate::reader::test::check;
use crate::reader::XmlSource;
/// Default buffer constructor just pass the byte array from the test
fn identity<T>(input: T) -> T {
input
}
check!(
#[test]
read_event_impl,
read_until_close,
identity,
&mut Vec::new()
);
}
```
|
The Idea of Beautiful is the debut studio album by American rapper Rapsody. It was released on August 28, 2012, by independent record label It's A Wonderful World Music Group. The album was released after the critical acclaim of her mixtapes such as Return of the B-Girl (2010), Thank H.E.R. Now (2011) and For Everything (2011); as well as the release of her extended play (EP) The Black Mamba (2012).
Background
The album includes the production by the members of The Soul Council (9th Wonder, Khrysis, E. Jones, AMP, Eric G. and Ka$h). The album features guest appearances from Big Rube, Raheem DeVaughn, Ab-Soul, Mac Miller, The Cool Kids, Buckshot, Childish Gambino, GQ, Big Remo, Heather Victoria, Rocki Evans, BJ the Chicago Kid, and Nomsa Mazwai. The first single was "Believe Me"; its music video was released on YouTube and two more videos were released - the songs "Kind of Love" and "The Drums". All of these music videos were directed by It's a Wonderful World Music Group's in-house director Kenneth Price.
Track listing
Personnel
Keyboards: Zo! on "Motivation"
Acoustic guitar: Nick Hagelin on "Good Good Love"
Recording engineer: 9th Wonder, Khrysis
Mixing: Khrysis
Executive Producer: 9th Wonder & Rapsody
Artwork and design: Warren "AMP" Hendricks, Jr.
Photography: Adam Sikora
Cover Photo: Patrick Douthit
Sample Credits
Destiny
"You're The One For Me" performed by The Edwards Generation
References
External links
Undergroundhiphop.com
Itunes.apple.com
Youtube.com
Youtube.com
Youtube.com
2012 debut albums
Albums produced by 9th Wonder
Albums produced by Khrysis
Rapsody albums
|
Josh Mierkalns (born 11 September 1985) is an English former cricketer. He is a right-handed batsman and a right-arm medium-pace bowler who currently plays for Nottinghamshire. Mierkalns' second XI career began in 2003, when he made his debut against Yorkshire's Second XI.
Mierkalns represented the Nottinghamshire first-team in August 2006 when he played in a match against the touring West Indians. The following month he played in a Pro40 match against Durham, though he was soon dropped from the team. His county career ended after he was diagnosed with ulcerative colitis.
Mierkalns remains an occasional member of the Nottinghamshire Second XI. He was a member of the Nottinghamshire Second team which reached the final of the 2005 Second XI trophy.
References
External links
Josh Mierkalns at Cricket Archive
1985 births
English cricketers
Living people
Nottinghamshire cricketers
Place of birth missing (living people)
People with ulcerative colitis
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<definitions xmlns="path_to_url" xmlns:xsi="path_to_url" xmlns:xsd="path_to_url" xmlns:flowable="path_to_url" xmlns:bpmndi="path_to_url" xmlns:omgdc="path_to_url" xmlns:omgdi="path_to_url" xmlns:design="path_to_url" typeLanguage="path_to_url" expressionLanguage="path_to_url" targetNamespace="path_to_url" design:palette="flowable-work-process-palette">
<process id="testTimerEventDateTypes" name="testTimerEventDateTypes" isExecutable="true" flowable:candidateStarterGroups="flowableUser">
<extensionElements>
<design:stencilid><![CDATA[BPMNDiagram]]></design:stencilid>
<design:creationdate><![CDATA[2024-01-30T13:39:51.782Z]]></design:creationdate>
<design:modificationdate><![CDATA[2024-01-30T15:20:28.954Z]]></design:modificationdate>
</extensionElements>
<userTask id="bpmnTask_1" name="User task" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_10" name="dateTask" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_13" name="instantTask" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_16" name="dateStringTask" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_19" name="localDateTask" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_24" name="eventDate" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_26" name="eventInstant" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_30" name="eventDateString" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_34" name="eventLocalDate" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_35" name="localDateTimeTask" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<userTask id="bpmnTask_39" name="eventLocalDateTime" flowable:assignee="${initiator}" flowable:formFieldValidation="false">
<extensionElements>
<flowable:task-candidates-type><![CDATA[all]]></flowable:task-candidates-type>
<design:stencilid><![CDATA[FormTask]]></design:stencilid>
<design:stencilsuperid><![CDATA[Task]]></design:stencilsuperid>
</extensionElements>
</userTask>
<parallelGateway id="bpmnGateway_7">
<extensionElements>
<design:stencilid><![CDATA[ParallelGateway]]></design:stencilid>
</extensionElements>
</parallelGateway>
<startEvent id="startnoneevent1" flowable:initiator="initiator" flowable:formFieldValidation="false">
<extensionElements>
<flowable:work-form-field-validation><![CDATA[false]]></flowable:work-form-field-validation>
<design:stencilid><![CDATA[StartNoneEvent]]></design:stencilid>
</extensionElements>
</startEvent>
<intermediateCatchEvent id="bpmnCatchEvent_19">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEvent]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${eventDate}</timeDate>
</timerEventDefinition>
</intermediateCatchEvent>
<intermediateCatchEvent id="bpmnCatchEvent_22">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEvent]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${eventInstant}</timeDate>
</timerEventDefinition>
</intermediateCatchEvent>
<intermediateCatchEvent id="bpmnCatchEvent_28">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEvent]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${eventDateString}</timeDate>
</timerEventDefinition>
</intermediateCatchEvent>
<intermediateCatchEvent id="bpmnCatchEvent_32">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEvent]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${eventLocalDate}</timeDate>
</timerEventDefinition>
</intermediateCatchEvent>
<intermediateCatchEvent id="bpmnCatchEvent_37">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEvent]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${eventLocalDateTime}</timeDate>
</timerEventDefinition>
</intermediateCatchEvent>
<boundaryEvent id="bpmnBoundaryEvent_9" attachedToRef="bpmnTask_1" cancelActivity="false">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEventBoundary]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${taskDate}</timeDate>
</timerEventDefinition>
</boundaryEvent>
<sequenceFlow id="bpmnSequenceFlow_11" sourceRef="bpmnBoundaryEvent_9" targetRef="bpmnTask_10">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<boundaryEvent id="bpmnBoundaryEvent_12" attachedToRef="bpmnTask_1" cancelActivity="false">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEventBoundary]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${taskInstant}</timeDate>
</timerEventDefinition>
</boundaryEvent>
<sequenceFlow id="bpmnSequenceFlow_14" sourceRef="bpmnBoundaryEvent_12" targetRef="bpmnTask_13">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<boundaryEvent id="bpmnBoundaryEvent_15" attachedToRef="bpmnTask_1" cancelActivity="false">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEventBoundary]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${taskDateString}</timeDate>
</timerEventDefinition>
</boundaryEvent>
<sequenceFlow id="bpmnSequenceFlow_17" sourceRef="bpmnBoundaryEvent_15" targetRef="bpmnTask_16">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<boundaryEvent id="bpmnBoundaryEvent_18" attachedToRef="bpmnTask_1" cancelActivity="false">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEventBoundary]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${taskLocalDate}</timeDate>
</timerEventDefinition>
</boundaryEvent>
<sequenceFlow id="bpmnSequenceFlow_20" sourceRef="bpmnBoundaryEvent_18" targetRef="bpmnTask_19">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<boundaryEvent id="bpmnBoundaryEvent_34" attachedToRef="bpmnTask_1" cancelActivity="false">
<extensionElements>
<design:stencilid><![CDATA[IntermediateTimerEventBoundary]]></design:stencilid>
</extensionElements>
<timerEventDefinition>
<timeDate>${taskLocalDateTime}</timeDate>
</timerEventDefinition>
</boundaryEvent>
<sequenceFlow id="bpmnSequenceFlow_36" sourceRef="bpmnBoundaryEvent_34" targetRef="bpmnTask_35">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_8" sourceRef="bpmnTask_1" targetRef="bpmnGateway_7">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_21" sourceRef="bpmnGateway_7" targetRef="bpmnCatchEvent_19">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_23" sourceRef="bpmnGateway_7" targetRef="bpmnCatchEvent_22">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_29" sourceRef="bpmnGateway_7" targetRef="bpmnCatchEvent_28">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_33" sourceRef="bpmnGateway_7" targetRef="bpmnCatchEvent_32">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_38" sourceRef="bpmnGateway_7" targetRef="bpmnCatchEvent_37">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_2" sourceRef="startnoneevent1" targetRef="bpmnTask_1">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_25" sourceRef="bpmnCatchEvent_19" targetRef="bpmnTask_24">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_27" sourceRef="bpmnCatchEvent_22" targetRef="bpmnTask_26">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_31" sourceRef="bpmnCatchEvent_28" targetRef="bpmnTask_30">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_35" sourceRef="bpmnCatchEvent_32" targetRef="bpmnTask_34">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
<sequenceFlow id="bpmnSequenceFlow_40" sourceRef="bpmnCatchEvent_37" targetRef="bpmnTask_39">
<extensionElements>
<design:stencilid><![CDATA[SequenceFlow]]></design:stencilid>
</extensionElements>
</sequenceFlow>
</process>
<bpmndi:BPMNDiagram id="BPMNDiagram_testTimerEventDateTypes">
<bpmndi:BPMNPlane bpmnElement="testTimerEventDateTypes" id="BPMNPlane_testTimerEventDateTypes">
<bpmndi:BPMNShape bpmnElement="bpmnTask_1" id="BPMNShape_bpmnTask_1">
<omgdc:Bounds height="110.0" width="414.0" x="440.0" y="221.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_10" id="BPMNShape_bpmnTask_10">
<omgdc:Bounds height="80.0" width="100.0" x="568.0" y="31.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_13" id="BPMNShape_bpmnTask_13">
<omgdc:Bounds height="80.0" width="100.0" x="844.0" y="57.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_16" id="BPMNShape_bpmnTask_16">
<omgdc:Bounds height="80.0" width="100.0" x="441.0" y="426.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_19" id="BPMNShape_bpmnTask_19">
<omgdc:Bounds height="80.0" width="100.0" x="694.0" y="426.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_24" id="BPMNShape_bpmnTask_24">
<omgdc:Bounds height="80.0" width="100.0" x="1130.0" y="133.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_26" id="BPMNShape_bpmnTask_26">
<omgdc:Bounds height="80.0" width="100.0" x="1130.0" y="236.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_30" id="BPMNShape_bpmnTask_30">
<omgdc:Bounds height="80.0" width="100.0" x="1130.0" y="357.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_34" id="BPMNShape_bpmnTask_34">
<omgdc:Bounds height="80.0" width="100.0" x="1130.0" y="530.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_35" id="BPMNShape_bpmnTask_35">
<omgdc:Bounds height="80.0" width="100.0" x="561.0" y="426.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnTask_39" id="BPMNShape_bpmnTask_39">
<omgdc:Bounds height="80.0" width="100.0" x="1130.0" y="635.9998779296875"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnGateway_7" id="BPMNShape_bpmnGateway_7">
<omgdc:Bounds height="40.0" width="40.0" x="903.0" y="256.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="startnoneevent1" id="BPMNShape_startnoneevent1">
<omgdc:Bounds height="30.0" width="30.0" x="317.0" y="261.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnCatchEvent_19" id="BPMNShape_bpmnCatchEvent_19">
<omgdc:Bounds height="30.0" width="30.0" x="1050.0" y="158.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnCatchEvent_22" id="BPMNShape_bpmnCatchEvent_22">
<omgdc:Bounds height="30.0" width="30.0" x="1050.0" y="261.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnCatchEvent_28" id="BPMNShape_bpmnCatchEvent_28">
<omgdc:Bounds height="30.0" width="30.0" x="1050.0" y="382.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnCatchEvent_32" id="BPMNShape_bpmnCatchEvent_32">
<omgdc:Bounds height="30.0" width="30.0" x="1050.0" y="555.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnCatchEvent_37" id="BPMNShape_bpmnCatchEvent_37">
<omgdc:Bounds height="30.0" width="30.0" x="1050.0" y="660.9998779296875"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnBoundaryEvent_9" id="BPMNShape_bpmnBoundaryEvent_9">
<omgdc:Bounds height="30.0" width="30.0" x="492.0" y="206.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnBoundaryEvent_12" id="BPMNShape_bpmnBoundaryEvent_12">
<omgdc:Bounds height="30.0" width="30.0" x="743.0" y="206.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnBoundaryEvent_15" id="BPMNShape_bpmnBoundaryEvent_15">
<omgdc:Bounds height="30.0" width="30.0" x="478.0" y="316.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnBoundaryEvent_18" id="BPMNShape_bpmnBoundaryEvent_18">
<omgdc:Bounds height="30.0" width="30.0" x="733.0" y="316.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="bpmnBoundaryEvent_34" id="BPMNShape_bpmnBoundaryEvent_34">
<omgdc:Bounds height="30.0" width="30.0" x="597.0" y="316.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_11" id="BPMNEdge_bpmnSequenceFlow_11" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="507.0" y="206.0"></omgdi:waypoint>
<omgdi:waypoint x="507.0" y="71.0"></omgdi:waypoint>
<omgdi:waypoint x="568.0" y="71.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_33" id="BPMNEdge_bpmnSequenceFlow_33" flowable:sourceDockerX="20.0" flowable:sourceDockerY="20.0" flowable:targetDockerX="15.0" flowable:targetDockerY="15.0">
<omgdi:waypoint x="923.0" y="296.0"></omgdi:waypoint>
<omgdi:waypoint x="923.0" y="570.0"></omgdi:waypoint>
<omgdi:waypoint x="1050.0" y="570.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_21" id="BPMNEdge_bpmnSequenceFlow_21" flowable:sourceDockerX="20.0" flowable:sourceDockerY="20.0" flowable:targetDockerX="15.0" flowable:targetDockerY="15.0">
<omgdi:waypoint x="923.0" y="256.0"></omgdi:waypoint>
<omgdi:waypoint x="923.0" y="173.0"></omgdi:waypoint>
<omgdi:waypoint x="1050.0" y="173.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_35" id="BPMNEdge_bpmnSequenceFlow_35" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="1080.0" y="570.0"></omgdi:waypoint>
<omgdi:waypoint x="1130.0" y="570.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_23" id="BPMNEdge_bpmnSequenceFlow_23" flowable:sourceDockerX="20.0" flowable:sourceDockerY="20.0" flowable:targetDockerX="15.0" flowable:targetDockerY="15.0">
<omgdi:waypoint x="943.0" y="276.0"></omgdi:waypoint>
<omgdi:waypoint x="1050.0" y="276.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_14" id="BPMNEdge_bpmnSequenceFlow_14" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="758.0" y="206.0"></omgdi:waypoint>
<omgdi:waypoint x="758.0" y="97.0"></omgdi:waypoint>
<omgdi:waypoint x="844.0" y="97.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_36" id="BPMNEdge_bpmnSequenceFlow_36" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="612.0" y="346.0"></omgdi:waypoint>
<omgdi:waypoint x="612.0" y="386.0"></omgdi:waypoint>
<omgdi:waypoint x="611.0" y="386.0"></omgdi:waypoint>
<omgdi:waypoint x="611.0" y="426.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_25" id="BPMNEdge_bpmnSequenceFlow_25" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="1080.0" y="173.0"></omgdi:waypoint>
<omgdi:waypoint x="1130.0" y="173.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_17" id="BPMNEdge_bpmnSequenceFlow_17" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="493.0" y="346.0"></omgdi:waypoint>
<omgdi:waypoint x="493.0" y="386.0"></omgdi:waypoint>
<omgdi:waypoint x="491.0" y="386.0"></omgdi:waypoint>
<omgdi:waypoint x="491.0" y="426.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_38" id="BPMNEdge_bpmnSequenceFlow_38" flowable:sourceDockerX="20.0" flowable:sourceDockerY="20.0" flowable:targetDockerX="15.0" flowable:targetDockerY="15.0">
<omgdi:waypoint x="923.0" y="296.0"></omgdi:waypoint>
<omgdi:waypoint x="923.0" y="675.9998779296875"></omgdi:waypoint>
<omgdi:waypoint x="1050.0" y="675.9998779296875"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_27" id="BPMNEdge_bpmnSequenceFlow_27" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="1080.0" y="276.0"></omgdi:waypoint>
<omgdi:waypoint x="1130.0" y="276.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_29" id="BPMNEdge_bpmnSequenceFlow_29" flowable:sourceDockerX="20.0" flowable:sourceDockerY="20.0" flowable:targetDockerX="15.0" flowable:targetDockerY="15.0">
<omgdi:waypoint x="923.0" y="296.0"></omgdi:waypoint>
<omgdi:waypoint x="923.0" y="397.0"></omgdi:waypoint>
<omgdi:waypoint x="1050.0" y="397.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_2" id="BPMNEdge_bpmnSequenceFlow_2" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="207.0" flowable:targetDockerY="55.0">
<omgdi:waypoint x="347.0" y="276.0"></omgdi:waypoint>
<omgdi:waypoint x="440.0" y="276.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_8" id="BPMNEdge_bpmnSequenceFlow_8" flowable:sourceDockerX="207.0" flowable:sourceDockerY="55.0" flowable:targetDockerX="20.0" flowable:targetDockerY="20.0">
<omgdi:waypoint x="854.0" y="276.0"></omgdi:waypoint>
<omgdi:waypoint x="903.0" y="276.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_40" id="BPMNEdge_bpmnSequenceFlow_40" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="1080.0" y="675.9998779296875"></omgdi:waypoint>
<omgdi:waypoint x="1130.0" y="675.9998779296875"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_20" id="BPMNEdge_bpmnSequenceFlow_20" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="748.0" y="346.0"></omgdi:waypoint>
<omgdi:waypoint x="748.0" y="386.0"></omgdi:waypoint>
<omgdi:waypoint x="744.0" y="386.0"></omgdi:waypoint>
<omgdi:waypoint x="744.0" y="426.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="bpmnSequenceFlow_31" id="BPMNEdge_bpmnSequenceFlow_31" flowable:sourceDockerX="15.0" flowable:sourceDockerY="15.0" flowable:targetDockerX="50.0" flowable:targetDockerY="40.0">
<omgdi:waypoint x="1080.0" y="397.0"></omgdi:waypoint>
<omgdi:waypoint x="1130.0" y="397.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
</bpmndi:BPMNPlane>
</bpmndi:BPMNDiagram>
</definitions>
```
|
Roland A. Steiner (December 1839 - January 12, 1906) was a physician, planter, folklorist, and amateur archaeologist who resided in Georgia for most of his life. His archaeological pursuits in Georgia are his most prominent lifetime achievement. He also made significant contributions in the nascent disciplines of cultural anthropology and folklore.
Biography
Roland was born in Philadelphia, Pennsylvania in December 1839 to Dr. Henry Hagner Steiner, a physician, and Susannah Wilhelmina Yoe Steiner. Roland fought at Richmond and Chancellorsville, Virginia during the Civil War as a private with Company C of the 48th Regiment, Georgia Volunteer Infantry, Army of Northern Virginia. Roland graduated from Princeton College in New Jersey in 1861 and he graduated from the Medical College in Richmond, Virginia during the spring of 1864. On October 13, 1870, Roland married Willhelmine J. Taylor, who was one of the wealthiest women in Georgia. Their wedding took place in Manhattan, New York, New York
During the latter half of the 19th century and into the early part of the 20th century, Roland collected a massive quantity of prehistoric artifacts from areas throughout Georgia; including Mound C at the Etowah Mound site near Cartersville, Georgia and sites in Burke, Columbia, Floyd, Hancock, and several other counties. He became a member of the Georgia Historical Society on July 7, 1886, the American Association for the Advancement of Science in 1899 and the American Folklore Society in the same year. Roland was a founding member of the American Anthropological Association.
In his lifetime, Roland collected more than 100,000 Native American relics from Georgia and South Carolina. Throughout the 1890s and early part of the 1910s, Steiner sent approximately 78,000 artifacts including copper axes, copper headdresses, conch shell cups and gorgets, pearl beads, pottery vessels, pottery statuettes, and other artifacts made of polished and chipped stone to the Smithsonian Museum of Natural History in Washington, D.C. His private collection at the Smithsonian is the largest private collection in the museum. Steiner also has collection of artifacts located at the American Museum of Natural History in New York, New York, the Field Museum in Chicago, Illinois, and the Peabody Museum in Massachusetts.
In addition to his interest in archaeology, Roland also was one of Georgia's first ethnologists. He contributed several papers to the Journal of American Folklore, including several that were published. Elliott (2016) compiled the available corpus of these works
Roland died on January 12, 1906, in Augusta, Georgia of an illness that had begun two weeks earlier. He was buried in the old cemetery at Waynesboro, Georgia next to the grave of his wife.
References
Elliott, Daniel T. 2010 The Roland Steiner Project: Introductory Background and Correspondence. LAMAR Institute Publication Series, Report No. 59, Savannah.
Elliott, Daniel T. 2016 Roland Steiner and Early Anthropology in Georgia. LAMAR Institute Publication Series, Report No. 208, Savannah.
Steiner, Roland 1899a Allan Stevenson's Trance. Proceedings of the American Association for the Advancement of Science, 48th Meeting 48:364-365, Columbus, Ohio, August, 1899.
Steiner, Roland 1899b Superstitions and Beliefs from Central Georgia. Journal of American Folk-Lore 12(47) (Oct.-Dec.1899):261-271.
Steiner, Roland 1900a Section XII. The South. In Prehistoric Implements. A Reference Book, by Warren K. Moorehead, pp. 364–394. Yobert Clarke Co., Publishers, Cincinnati, Ohio.
Steiner, Roland 1900c Sol Lockheart's Call. In Notes and Queries. Journal of American Folk-Lore 13(48) (Jan.-Mar. 1900):67-70.
Steiner, Roland 1900d Braziel Robinson Possessed of Two Spirits. Notes and Queries. Journal of American Folk-Lore 13(50) (Jul.-Sep., 1900):226-228.
Steiner, Roland 1901a "Seeking Jesus. A Religious Rite of Negroes in Georgia." The Journal of American Folklore 14(54):172.
Steiner, Roland 1901b "Observations on the Practice of Conjuring in Georgia." The Journal of American Folklore 14(54):173-180.
External links
1840s births
1906 deaths
American planters
|
This is a list of mosques in the Philippines. Prior to the usage of the common Arabic style merged with modernist style mosque architecture, the vernacular mosques of the Philippines used to be the hut-style and the pagoda-style, which were very common until the late 19th century. Most of the mosques in the Philippines today have common Islamic architectures imported from Arabia, though some vernacular pagoda-style mosques can still be seen in Mindanao such as the Masjid Datu Untong Balabaran of Taviran in Datu Odin Sinsuat, Maguindanao. There have been proposals to put the Heritage Mosques of the Philippines into the Philippine tentative list for UNESCO World Heritage Site declaration in the future. The proposals made were to input the historic mosques of the Philippines (mosque in Simunul), to input the vernacular mosques of the Philippines (langga/rangga-style and pagoda-style mosques), or to combine both and input them in the tentative list of UNESCO.
Architectural types of mosques in the Philippines
Very little is known about the architectural designs of mosque types in the Philippines. This is due to several factors: (1) much of the earliest types of mosques constructed by early missionaries were made of temporary materials like wood, bamboo, and cogon which do not last for years; (2) the remaining earlier types were either demolished, destroyed during earthquakes, or reconstructed/remodelled to suit modern architectural types based on the middle-east designs; (3) the yearly pilgrimage to Mecca radically changed all earliest types; and (4) very little has been written about the subject.
According to the National Commission for Culture and the Arts, the main cultural arm of the Philippine government, it is possible that the sampling of the mosque types in Lanao might represent the “typical” mosques in the Philippines prior to the importation of mosque architecture from Arabia, as Islam was introduced to the Sulu archipelago first, followed by Maguindanao, and then Lanao. Both Sulu and Maguindanao have lost almost all of their non-Arabian style mosque architectural knowledge, making Lanao the last area where such knowledge is still extant, although some pockets still exist in Sulu and Maguindanao. One of the earliest types of mosques in Lanao is a five-tiered building resembling a Chinese pagoda. A variation of this type is a three-tiered or seven-tiered edifice. The earliest mosque in Simunul, Tawi-tawi was initially built through the pagoda-style. Its 4 pillars are still there after more than 400 years. Another example of vernacular mosque in the Philippines is the Masgit sa Buadi Sakayo located, a mosque in Lanao that resembles a Buddhist temple with okir motifs. Other early types of mosques are found in the eastern coasts of Lake Lanao, where some mosques have okir motifs and burak (centaur) depictions some mirrors engraved on the panels of the mosque. Some early type mosques also has inverted jars on top of their domes.
In Lanao, a huge drum called tabo is suspended horizontally inside the mosque and is beaten to call the believers to the mosque. Among the Yakan, a bamboo drum is used for calling people to worship. Inside the mosque, one does not find a pulpit (mimbar) but an elevated platform, a chair or a structure, where the khatib delivers his sermon. Philippine mosques do not have a sahn (courtyard) like those of Middle East mosques. Instead, they have benches outside where people sit and talk while waiting for the next prayer. According to Filipino Muslims, it is not permitted to discuss unIslamic matter inside the mosques.
Overall, the types of mosque architecture in the Philippines can be divided into three, namely:
Langgal/ranggar - small structures for the faithful, and is usually built in rural areas (like the small chapels in Catholicism). These are the oldest form of mosque in the Philippines. The langgal/ranggar-style mosques are still being built and used in Islamic areas in the Philippines, especially in rural areas.
Pagoda-style Mosque - used by Muslims throughout Islamic areas in the Philippines prior to the importation of the Arabian-style mosque architecture. It is similar to the pagoda-style places of worship in Malaysia and Indonesia, specifically, Bali. The pagoda-style mosques are largely attributed to Hindu and Buddhist pasts of the current Muslim areas in the Philippines. These mosques have eight, five, or three tiers, making them look as if they are pathways to heaven. The pagoda-style mosque building is currently an endangered art form in the Philippines, as most mosques are now built in the Domed/Arabian-style.
Onion-domed/Arabian-style Mosque - currently the most prominent and widespread style used in building mosques in the Philippines. The Domed/Arabian-style was imported to the Philippines when Filipino Muslims began performing the hajj (pilgrimage to Mecca). On their journey, they saw the mosques of Arabia and copied it, replacing the pagoda-style mosques in the Philippines.
Mosques in the Philippines
See also
Islam in the Philippines
Lists of mosques
Maranao people
Torogan
References
External links
Philippines
Mosques
|
```yaml
id: LogPoint SIEM Playbook
version: -1
name: LogPoint SIEM Playbook
description: LogPoint SIEM Playbook guides users on use cases like blocking IP and
domain and disabling users using products like CheckPoint Firewall, Active Directory,
and VirusTotal. The actions depicted in the playbook helps analysts create their
playbooks based on actual requirements and products deployed. (Available from Cortex
XSOAR 6.0.0).
starttaskid: "0"
tasks:
"0":
id: "0"
taskid: 782df7e3-989a-4592-8556-c2c57b9abcf6
type: start
task:
id: 782df7e3-989a-4592-8556-c2c57b9abcf6
version: -1
name: ""
iscommand: false
brand: ""
description: ''
nexttasks:
'#none#':
- "1"
separatecontext: false
view: |-
{
"position": {
"x": 960,
"y": -970
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"1":
id: "1"
taskid: 09d60617-adaf-4bf4-8191-6035d4a81046
type: regular
task:
id: 09d60617-adaf-4bf4-8191-6035d4a81046
version: -1
name: Retrieve Data from Incident
description: Retrieves a Particular Incident's Data
script: LogPoint SIEM Integration|||lp-get-incident-data
type: regular
iscommand: true
brand: LogPoint SIEM Integration
nexttasks:
'#none#':
- "3"
scriptarguments:
date:
simple: ${incident.logpointdetectiontimestamp}
incident_id:
simple: ${incident.logpointincidentid}
incident_obj_id:
simple: ${incident.logpointobjectid}
separatecontext: false
view: |-
{
"position": {
"x": 960,
"y": -620
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"3":
id: "3"
taskid: bfa0f342-8fce-45f3-8ebc-f7fc88d7f95f
type: condition
task:
id: bfa0f342-8fce-45f3-8ebc-f7fc88d7f95f
version: -1
name: Is there a Source Address field?
description: Check if the given field is source/destination address.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "65"
"yes":
- "35"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: LogPoint.Incidents.data.source_address
iscontext: true
- operator: isExists
left:
value:
complex:
root: LogPoint.Incidents.data.destination_address
iscontext: true
view: |-
{
"position": {
"x": -10,
"y": -210
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"5":
id: "5"
taskid: 5b1ef4bf-dfdc-436b-8a30-4f052ec83756
type: condition
task:
id: 5b1ef4bf-dfdc-436b-8a30-4f052ec83756
version: -1
name: Is there a Domain field?
description: Check if there is a domain field in the incident data.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "7"
"yes":
- "9"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: LogPoint.Incidents.data.domain
iscontext: true
view: |-
{
"position": {
"x": -20,
"y": 680
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"7":
id: "7"
taskid: 69c113a8-f397-4f67-8799-164f20bbe13d
type: condition
task:
id: 69c113a8-f397-4f67-8799-164f20bbe13d
version: -1
name: Is there a User field?
description: Check if there is a user field present in incident data.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "12"
"yes":
- "59"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: LogPoint.Incidents.data.user
iscontext: true
view: |-
{
"position": {
"x": 0,
"y": 1210
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"9":
id: "9"
taskid: da8cca4e-c818-4087-8ed2-52f7866caa22
type: regular
task:
id: da8cca4e-c818-4087-8ed2-52f7866caa22
version: -1
name: Check for Malware Associated Domain
description: Checks the reputation of a domain.
script: VirusTotal|||domain
type: regular
iscommand: true
brand: VirusTotal
nexttasks:
'#none#':
- "30"
scriptarguments:
domain:
complex:
root: LogPoint.Incidents.data.domain
fullResponse: {}
long: {}
retries: {}
sampleSize: {}
threshold: {}
wait: {}
separatecontext: false
view: |-
{
"position": {
"x": 830,
"y": 690
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"12":
id: "12"
taskid: e7a56db8-7d3d-4be7-8000-9949ed191cee
type: regular
task:
id: e7a56db8-7d3d-4be7-8000-9949ed191cee
version: -1
name: Assign Incident to Analyst
description: Assigning/Re-assigning Incidents
script: LogPoint SIEM Integration|||lp-assign-incidents
type: regular
iscommand: true
brand: LogPoint SIEM Integration
nexttasks:
'#none#':
- "13"
scriptarguments:
incident_obj_ids:
complex:
root: incident.logpointobjectid
new_assignee:
simple: ${incident.logpointassignedto}
separatecontext: false
view: |-
{
"position": {
"x": 1690,
"y": 2260
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"13":
id: "13"
taskid: 5c399687-29aa-491c-8c25-d662e8137e31
type: regular
task:
id: 5c399687-29aa-491c-8c25-d662e8137e31
version: -1
name: Add Comment about Incident Investigation
description: Add comments to the incidents
script: LogPoint SIEM Integration|||lp-add-incident-comment
type: regular
iscommand: true
brand: LogPoint SIEM Integration
nexttasks:
'#none#':
- "29"
scriptarguments:
comment:
simple: Incident processed by LogPoint SIEM Playbook on XSOAR.
incident_obj_id:
complex:
root: incident.logpointobjectid
separatecontext: false
view: |-
{
"position": {
"x": 2890,
"y": 2330
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"29":
id: "29"
taskid: b67fcdc8-39cb-4136-8e9c-61264a9b21e1
type: title
task:
id: b67fcdc8-39cb-4136-8e9c-61264a9b21e1
version: -1
name: Done
type: title
iscommand: false
brand: ""
description: ''
separatecontext: false
view: |-
{
"position": {
"x": 4130,
"y": 2530
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"30":
id: "30"
taskid: 754f0020-a958-495d-8ac6-7e4e8e0a2f75
type: condition
task:
id: 754f0020-a958-495d-8ac6-7e4e8e0a2f75
version: -1
name: Is Domain Malicious?
description: Check if the domain is malicious.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "41"
"yes":
- "66"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: Domain.Name
iscontext: true
view: |-
{
"position": {
"x": 1360,
"y": 645
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"34":
id: "34"
taskid: 825ec56e-b2fc-424f-8b15-47f32261317c
type: regular
task:
id: 825ec56e-b2fc-424f-8b15-47f32261317c
version: -1
name: Check for Malware Associated Destination Address
description: Checks the reputation of an destination address.
script: VirusTotal|||ip
type: regular
iscommand: true
brand: VirusTotal
nexttasks:
'#none#':
- "62"
scriptarguments:
fullResponse: {}
ip:
complex:
root: LogPoint.Incidents.data.destination_address
long: {}
retries: {}
sampleSize: {}
threshold:
simple: "3"
wait: {}
separatecontext: false
view: |-
{
"position": {
"x": 1360,
"y": 320
}
}
note: false
timertriggers: []
ignoreworker: false
fieldMapping:
- incidentfield: Malware Name
output:
complex:
root: DBotScore
filters:
- - operator: isEqualString
left:
value:
simple: DBotScore.Type
iscontext: true
right:
value:
simple: ip
accessor: Indicator
skipunavailable: false
quietmode: 0
"35":
id: "35"
taskid: 9141cac4-bc41-4f0a-8396-74ce434317ca
type: condition
task:
id: 9141cac4-bc41-4f0a-8396-74ce434317ca
version: -1
name: Is Source Address Internal?
description: Checks the source address to determine it as internal/external.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "5"
"No":
- "40"
"YES":
- "38"
separatecontext: false
conditions:
- label: "YES"
condition:
- - operator: IsInCidrRanges
left:
value:
complex:
root: LogPoint.Incidents.data.source_address
iscontext: true
right:
value:
simple: 10.0.0.0/8, 172.16.0.0/12, 192.168.0.0/16
- - operator: isExists
left:
value:
complex:
root: LogPoint.Incidents.data.destination_address
iscontext: true
- label: "No"
condition:
- - operator: IsNotInCidrRanges
left:
value:
complex:
root: LogPoint.Incidents.data.source_address
iscontext: true
right:
value:
simple: 10.0.0.0/8, 172.16.0.0/12, 192.168.0.0/16
view: |-
{
"position": {
"x": 700,
"y": -180
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"38":
id: "38"
taskid: 82c58041-420c-42bf-8529-943f71f2af9d
type: condition
task:
id: 82c58041-420c-42bf-8529-943f71f2af9d
version: -1
name: Is Destination Address Internal?
description: Checks the destination address to determine it as internal/external
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "34"
"yes":
- "5"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: IsInCidrRanges
left:
value:
complex:
root: LogPoint.Incidents.data.destination_address
iscontext: true
right:
value:
simple: 10.0.0.0/8, 172.16.0.0/12, 192.168.0.0/16
view: |-
{
"position": {
"x": 830,
"y": 340
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"39":
id: "39"
taskid: a73f0020-9790-4f61-80aa-e8e44f37a03a
type: condition
task:
id: a73f0020-9790-4f61-80aa-e8e44f37a03a
version: -1
name: Is Source Address Malicious?
description: Check if the IP is malicious.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "12"
"yes":
- "66"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: incident.malwarename
filters:
- - operator: containsGeneral
left:
value:
simple: incident.malwarename
iscontext: true
right:
value:
simple: LogPoint.Incidents.data.source_address
iscontext: true
iscontext: true
view: |-
{
"position": {
"x": 2450,
"y": -200
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"40":
id: "40"
taskid: d3b1f869-847a-4c61-8d61-cd361e9a731f
type: regular
task:
id: d3b1f869-847a-4c61-8d61-cd361e9a731f
version: -1
name: Check for Malware Associated Source Address
description: Checks the reputation of an source address.
script: VirusTotal|||ip
type: regular
iscommand: true
brand: VirusTotal
nexttasks:
'#none#':
- "39"
scriptarguments:
fullResponse: {}
ip:
complex:
root: LogPoint.Incidents.data
accessor: source_address
long: {}
retries: {}
sampleSize: {}
threshold: {}
wait: {}
separatecontext: false
view: |-
{
"position": {
"x": 1310,
"y": -190
}
}
note: false
timertriggers: []
ignoreworker: false
fieldMapping:
- incidentfield: Malware Name
output:
complex:
root: DBotScore
filters:
- - operator: isEqualString
left:
value:
simple: DBotScore.Type
iscontext: true
right:
value:
simple: ip
accessor: Indicator
skipunavailable: false
quietmode: 0
"41":
id: "41"
taskid: 7fdbf66f-ff72-4df4-858d-77af36bd04a3
type: regular
task:
id: 7fdbf66f-ff72-4df4-858d-77af36bd04a3
version: -1
name: Calculate Entropy
description: Calculates the entropy for the given data.
scriptName: CalculateEntropy
type: regular
iscommand: false
brand: ""
nexttasks:
'#none#':
- "44"
scriptarguments:
data:
complex:
root: LogPoint.Incidents.data.domain
minimum_entropy: {}
separatecontext: false
view: |-
{
"position": {
"x": 2500,
"y": 730
}
}
note: false
timertriggers: []
ignoreworker: false
fieldMapping:
- incidentfield: Destination IP
output:
simple: ${Domain.VirusTotal.Resolutions.ip_address}
skipunavailable: false
quietmode: 0
"44":
id: "44"
taskid: b37a19c5-11a6-4061-88ae-4c8bb926f8ac
type: condition
task:
id: b37a19c5-11a6-4061-88ae-4c8bb926f8ac
version: -1
name: Is Entropy Higher?
description: Check if the entropy is higher than 4.0
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "12"
user:
- "7"
"yes":
- "66"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: greaterThanOrEqual
left:
value:
complex:
root: EntropyResult.entropy
iscontext: true
right:
value:
simple: "3.5"
- label: user
condition:
- - operator: isExists
left:
value:
complex:
root: LogPoint.Incidents.data.user
iscontext: true
view: |-
{
"position": {
"x": 2960,
"y": 730
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"49":
id: "49"
taskid: b2cce706-baca-43bc-8c6a-d5593959210c
type: regular
task:
id: b2cce706-baca-43bc-8c6a-d5593959210c
version: -1
name: Check for User Detail
description: Retrieves detailed information about a user account. The user can
be specified by name, email address, or as an Active Directory Distinguished
Name (DN). If no filter is specified, all users are returned.
script: Active Directory Query v2|||ad-get-user
type: regular
iscommand: true
brand: Active Directory Query v2
nexttasks:
'#none#':
- "104"
scriptarguments:
attributes: {}
custom-field-data: {}
custom-field-type: {}
dn: {}
email: {}
limit: {}
name: {}
user-account-control-out: {}
username:
complex:
root: LogPoint.Incidents.data.user
separatecontext: false
view: |-
{
"position": {
"x": 1340,
"y": 1230
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"52":
id: "52"
taskid: 8a353d52-20c4-4d5f-8188-ca271e0137db
type: regular
task:
id: 8a353d52-20c4-4d5f-8188-ca271e0137db
version: -1
name: Disable Account
description: Disables an Active Directory user account.
script: Active Directory Query v2|||ad-disable-account
type: regular
iscommand: true
brand: Active Directory Query v2
nexttasks:
'#none#':
- "55"
scriptarguments:
base-dn: {}
username:
complex:
root: Account.Username
separatecontext: false
view: |-
{
"position": {
"x": 2970,
"y": 1270
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"55":
id: "55"
taskid: eee8da3b-21a9-4445-84ff-c4791f1d19ef
type: regular
task:
id: eee8da3b-21a9-4445-84ff-c4791f1d19ef
version: -1
name: Add Comment for Manager
description: Add comments about user disabled to the incidents
script: LogPoint SIEM Integration|||lp-add-incident-comment
type: regular
iscommand: true
brand: LogPoint SIEM Integration
nexttasks:
'#none#':
- "29"
scriptarguments:
comment:
simple: Please Email User ${LogPoint.Incidents.data.user} manager ${ActiveDirectory.Users.manager}
about the user being disabled.
incident_obj_id:
complex:
root: incident.logpointobjectid
separatecontext: false
view: |-
{
"position": {
"x": 3620,
"y": 1230
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"59":
id: "59"
taskid: 27b62e18-7199-45d1-8191-b705e6d05f77
type: condition
task:
id: 27b62e18-7199-45d1-8191-b705e6d05f77
version: -1
name: Check for Malicious User
description: "Check if the alert name refers to some malicious users. The following\
\ keyword on incident name would make the user malicious: \nBrute Force, Account/Credential\
\ Manipulation/compromise/misuse, privilege escalation, insider threat"
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "12"
Malicious:
- "49"
separatecontext: false
conditions:
- label: Malicious
condition:
- - operator: match
left:
value:
complex:
root: incident.name
iscontext: true
right:
value:
simple: (?i)brute\sforce|(account|credential) (manipulation|compromise|misuse)|insider
threat|privilege\sescalation
view: |-
{
"position": {
"x": 780,
"y": 1240
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"62":
id: "62"
taskid: 4d7e6f95-38bc-45eb-8889-96d0a3ef7ba1
type: condition
task:
id: 4d7e6f95-38bc-45eb-8889-96d0a3ef7ba1
version: -1
name: Is Destination Address Malicious?
description: Check if the IP is malicious.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "12"
"yes":
- "66"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: incident.malwarename
filters:
- - operator: containsGeneral
left:
value:
simple: incident.malwarename
iscontext: true
right:
value:
simple: LogPoint.Incidents.data.destination_address
iscontext: true
iscontext: true
view: |-
{
"position": {
"x": 2440,
"y": 245
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"65":
id: "65"
taskid: 2ef82150-36c4-49ba-8da5-8bdf01c32e2a
type: condition
task:
id: 2ef82150-36c4-49ba-8da5-8bdf01c32e2a
version: -1
name: Is there a Destination Address field?
description: Check if the given field is source/destination address.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "5"
"yes":
- "38"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: LogPoint.Incidents.data.source_address
iscontext: true
- operator: isExists
left:
value:
complex:
root: LogPoint.Incidents.data.destination_address
iscontext: true
view: |-
{
"position": {
"x": -40,
"y": 310
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"66":
id: "66"
taskid: 061e1d7b-8654-4abe-81d0-dbd362a95d07
type: condition
task:
id: 061e1d7b-8654-4abe-81d0-dbd362a95d07
version: -1
name: Is Firewall enabled?
description: Check if Firewall is enabled.
type: condition
iscommand: false
brand: ""
nexttasks:
"yes":
- "67"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: containsString
left:
value:
complex:
root: modules.brand
iscontext: true
right:
value:
simple: CheckPoint
view: |-
{
"position": {
"x": 4490,
"y": -525
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"67":
id: "67"
taskid: 63ef28cf-1cc0-4dce-8991-1b07d06aa73b
type: regular
task:
id: 63ef28cf-1cc0-4dce-8991-1b07d06aa73b
version: -1
name: checkpoint-login-and-get-session-id
description: Log in to CheckPoint and get the session ID.
script: CheckPointFirewall_v2|||checkpoint-login-and-get-session-id
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "68"
scriptarguments:
domain: {}
session_timeout: {}
separatecontext: false
view: |-
{
"position": {
"x": 4410,
"y": 0
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"68":
id: "68"
taskid: 4bec2fc9-0dc2-46ff-8cde-f7f344028044
type: condition
task:
id: 4bec2fc9-0dc2-46ff-8cde-f7f344028044
version: -1
name: Is it URL or IP Block?
description: Check if it is URL Block or IP Block.
type: condition
iscommand: false
brand: ""
nexttasks:
IP:
- "79"
URL:
- "69"
separatecontext: false
conditions:
- label: IP
condition:
- - operator: StringContainsArray
left:
value:
complex:
root: incident.malwarename
iscontext: true
right:
value:
complex:
root: LogPoint.Incidents.data.destination_address
iscontext: true
- operator: StringContainsArray
left:
value:
complex:
root: incident.malwarename
iscontext: true
right:
value:
complex:
root: LogPoint.Incidents.data.source_address
iscontext: true
- label: URL
condition:
- - operator: isExists
left:
value:
complex:
root: Domain.Name
iscontext: true
view: |-
{
"position": {
"x": 5240,
"y": 225
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"69":
id: "69"
taskid: 18e0cf77-98dc-4f36-8acf-721ab6ef9527
type: regular
task:
id: 18e0cf77-98dc-4f36-8acf-721ab6ef9527
version: -1
name: Check for application site category
description: Retrieve application site category object using object name or
UID.
script: CheckPointFirewall_v2|||checkpoint-application-site-category-get
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "70"
scriptarguments:
identifier:
simple: Malware
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 4710,
"y": 450
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"70":
id: "70"
taskid: c8de4ff9-4b3e-4601-8c22-c5ee2dc52426
type: condition
task:
id: c8de4ff9-4b3e-4601-8c22-c5ee2dc52426
version: -1
name: Is application site category pre defined?
description: Check if application site category is pre defined.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "75"
"yes":
- "71"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isEqualString
left:
value:
complex:
root: CheckPoint.ApplicationSiteCategory.name
iscontext: true
right:
value:
simple: malware
view: |-
{
"position": {
"x": 4710,
"y": 630
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"71":
id: "71"
taskid: 8c399022-d183-4c2d-8c35-de2ca45057ee
type: regular
task:
id: 8c399022-d183-4c2d-8c35-de2ca45057ee
version: -1
name: Check for Checkpoint objects
description: Retrieve data about objects.
script: CheckPointFirewall_v2|||checkpoint-show-objects
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "72"
scriptarguments:
filter_search:
complex:
root: LogPoint.Incidents.data.domain
ip_only: {}
limit: {}
object_type:
simple: application-site
offset: {}
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 5150,
"y": 860
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"72":
id: "72"
taskid: 6b3ccd26-eb93-4fdc-860b-88a563e0ac56
type: condition
task:
id: 6b3ccd26-eb93-4fdc-860b-88a563e0ac56
version: -1
name: Is application site defined?
description: Check if application site is defined.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "73"
"yes":
- "74"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: CheckPoint.Objects.name
filters:
- - operator: containsGeneral
left:
value:
simple: CheckPoint.Objects.name
iscontext: true
right:
value:
simple: Domain.Name
iscontext: true
iscontext: true
view: |-
{
"position": {
"x": 5160,
"y": 1060
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"73":
id: "73"
taskid: 824bfcd8-1479-41ec-8452-bbbddf8d1051
type: regular
task:
id: 824bfcd8-1479-41ec-8452-bbbddf8d1051
version: -1
name: Add the URL
description: Adds an application site.
script: CheckPointFirewall_v2|||checkpoint-application-site-add
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "100"
scriptarguments:
groups: {}
identifier:
complex:
root: LogPoint.Incidents.data.domain
transformers:
- operator: RegexExtractAll
args:
error_if_no_match: {}
ignore_case: {}
multi_line: {}
period_matches_newline: {}
regex:
value:
simple: '[A-Za-z0-9-\.]+'
name:
simple: domain-${LogPoint.Incidents.data.domain}
primary_category:
simple: Malware
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 5010,
"y": 1380
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"74":
id: "74"
taskid: f2ba5726-a35d-485e-8900-3aa492687091
type: regular
task:
id: f2ba5726-a35d-485e-8900-3aa492687091
version: -1
name: Logout from session
description: Log out from a given session.
script: CheckPointFirewall_v2|||checkpoint-logout
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "29"
scriptarguments:
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 5300,
"y": 2330
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"75":
id: "75"
taskid: d80e9147-2fcd-4f9c-8ade-6ff1279ad019
type: regular
task:
id: d80e9147-2fcd-4f9c-8ade-6ff1279ad019
version: -1
name: Add URL catgeory
description: Adds new application site category.
script: CheckPointFirewall_v2|||checkpoint-application-site-category-add
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "76"
scriptarguments:
groups: {}
identifier:
simple: Malware
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 4450,
"y": 850
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"76":
id: "76"
taskid: 23765208-5e42-4e9a-8993-76720008f6ab
type: condition
task:
id: 23765208-5e42-4e9a-8993-76720008f6ab
version: -1
name: Was category addition successful?
description: Check if category addition was successful.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "78"
"yes":
- "77"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isEqualString
left:
value:
complex:
root: CheckPoint.ApplicationSiteCategory.name
iscontext: true
right:
value:
simple: malware
view: |-
{
"position": {
"x": 4470,
"y": 1080
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"77":
id: "77"
taskid: d9abc1e2-3b3a-4168-8219-71e603324d54
type: regular
task:
id: d9abc1e2-3b3a-4168-8219-71e603324d54
version: -1
name: Checkpoint Publish Configuration
description: Publishes changes.
script: CheckPointFirewall_v2|||checkpoint-publish
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "73"
scriptarguments:
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 4470,
"y": 1260
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"78":
id: "78"
taskid: 96ef5394-00f8-4c01-8e0c-2885e9cb4779
type: regular
task:
id: 96ef5394-00f8-4c01-8e0c-2885e9cb4779
version: -1
name: Add Comment for administrator
description: Add comments to the incidents
script: LogPoint SIEM Integration|||lp-add-incident-comment
type: regular
iscommand: true
brand: LogPoint SIEM Integration
nexttasks:
'#none#':
- "74"
scriptarguments:
comment:
simple: There is some issue due to which playbook is not able to take action.
Kindly review the issue.
incident_obj_id:
complex:
root: incident.logpointobjectid
separatecontext: false
view: |-
{
"position": {
"x": 4360,
"y": 1610
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"79":
id: "79"
taskid: dd65bc83-5574-4bd8-853e-b2ddf718aa92
type: regular
task:
id: dd65bc83-5574-4bd8-853e-b2ddf718aa92
version: -1
name: Check for Checkpoint object
description: Retrieve data about objects.
script: CheckPointFirewall_v2|||checkpoint-show-objects
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "80"
scriptarguments:
filter_search:
complex:
root: incident.malwarename
filters:
- - operator: StringContainsArray
left:
value:
simple: incident.malwarename
iscontext: true
right:
value:
simple: LogPoint.Incidents.data.source_address
iscontext: true
- operator: StringContainsArray
left:
value:
simple: incident.malwarename
iscontext: true
right:
value:
simple: LogPoint.Incidents.data.destination_address
iscontext: true
transformers:
- operator: RegexExtractAll
args:
error_if_no_match: {}
ignore_case: {}
multi_line: {}
period_matches_newline: {}
regex:
value:
simple: \d+\.\d+\.\d+\.\d+
ip_only:
simple: "true"
limit: {}
object_type:
simple: host
offset: {}
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 5650,
"y": 395
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"80":
id: "80"
taskid: 8e943d10-2694-4bf0-8dcb-ee8778771ad3
type: condition
task:
id: 8e943d10-2694-4bf0-8dcb-ee8778771ad3
version: -1
name: Is IP already defined?
description: Check if IP is already defined.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "81"
"yes":
- "86"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: CheckPoint.Objects.ipv4-address
filters:
- - operator: isEqualString
left:
value:
simple: CheckPoint.Objects.ipv4-address
iscontext: true
right:
value:
simple: incident.malwarename
iscontext: true
iscontext: true
view: |-
{
"position": {
"x": 5730,
"y": 585
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"81":
id: "81"
taskid: c301e34e-05b9-44b1-88ea-1de95f0c7d62
type: regular
task:
id: c301e34e-05b9-44b1-88ea-1de95f0c7d62
version: -1
name: Add Host
description: Adds a new host.
script: CheckPointFirewall_v2|||checkpoint-host-add
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "82"
scriptarguments:
groups: {}
ip_address:
complex:
root: incident.malwarename
name:
simple: host-${incident.malwarename}
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 5560,
"y": 860
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"82":
id: "82"
taskid: 4217b266-fd09-4f55-88dc-a9bf91fb59f8
type: condition
task:
id: 4217b266-fd09-4f55-88dc-a9bf91fb59f8
version: -1
name: Was the host addition successful?
description: Check if the host addition was successful.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "102"
"yes":
- "83"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: CheckPoint.Host.name
filters:
- - operator: containsString
left:
value:
simple: CheckPoint.Host.name
iscontext: true
right:
value:
simple: incident.malwarename
iscontext: true
iscontext: true
view: |-
{
"position": {
"x": 5580,
"y": 1050
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"83":
id: "83"
taskid: b7471efd-3dd9-46ac-8d8c-8c368cdc5fae
type: regular
task:
id: b7471efd-3dd9-46ac-8d8c-8c368cdc5fae
version: -1
name: Checkpoint publish configuration
description: Publishes changes.
script: CheckPointFirewall_v2|||checkpoint-publish
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "86"
scriptarguments:
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 6050,
"y": 900
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"86":
id: "86"
taskid: 3498cbbc-59b7-42f9-8ff8-c5bf6129e47a
type: regular
task:
id: 3498cbbc-59b7-42f9-8ff8-c5bf6129e47a
version: -1
name: Add the policy
description: Creates a new access rule.
script: CheckPointFirewall_v2|||checkpoint-access-rule-add
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "87"
scriptarguments:
action: {}
destination:
complex:
root: CheckPoint.Host
filters:
- - operator: isEqualString
left:
value:
simple: CheckPoint.Host.ipv4-address
iscontext: true
right:
value:
simple: incident.malwarename
iscontext: true
accessor: name
transformers:
- operator: FirstArrayElement
layer:
simple: network
name:
simple: XSOAR-BLOCK- ${incident.malwarename}
position:
simple: top
service: {}
session_id:
complex:
root: CheckPoint.Login.session-id
source: {}
vpn: {}
separatecontext: false
view: |-
{
"position": {
"x": 6720,
"y": 860
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"87":
id: "87"
taskid: 968b87e4-6a5e-480b-8a3f-19bd90a868f1
type: regular
task:
id: 968b87e4-6a5e-480b-8a3f-19bd90a868f1
version: -1
name: Publish the policy/access rule
description: Publishes changes.
script: CheckPointFirewall_v2|||checkpoint-publish
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "88"
scriptarguments:
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 7490,
"y": 850
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"88":
id: "88"
taskid: 0302cea7-0b35-4bc9-8d31-279513fe4fac
type: regular
task:
id: 0302cea7-0b35-4bc9-8d31-279513fe4fac
version: -1
name: Show task id
description: Show task progress and details.
script: CheckPointFirewall_v2|||checkpoint-show-task
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "96"
scriptarguments:
session_id:
complex:
root: CheckPoint.Login.session-id
task_id:
complex:
root: CheckPoint.Publish.task-id
separatecontext: false
view: |-
{
"position": {
"x": 7570,
"y": 1145
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"90":
id: "90"
taskid: bddf673c-30cd-49a8-8de0-5ba293bc35dd
type: regular
task:
id: bddf673c-30cd-49a8-8de0-5ba293bc35dd
version: -1
name: Get the status
description: Show task progress and details.
script: CheckPointFirewall_v2|||checkpoint-show-task
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "91"
scriptarguments:
session_id:
complex:
root: CheckPoint.Login.session-id
task_id:
complex:
root: CheckPoint.Publish.task-id
separatecontext: false
view: |-
{
"position": {
"x": 6440,
"y": 1420
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"91":
id: "91"
taskid: d7872f18-3011-4bd2-879f-4d53989ffa5a
type: condition
task:
id: d7872f18-3011-4bd2-879f-4d53989ffa5a
version: -1
name: Is publish successful?
description: Check if the publish is successful.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "102"
"yes":
- "92"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isEqualString
left:
value:
complex:
root: CheckPoint.ShowTask.status
iscontext: true
right:
value:
simple: succeeded
view: |-
{
"position": {
"x": 5890,
"y": 1540
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"92":
id: "92"
taskid: 8e4cc8a1-1c59-4094-82f7-81b95a2aa6bc
type: regular
task:
id: 8e4cc8a1-1c59-4094-82f7-81b95a2aa6bc
version: -1
name: Show the gateways
description: Retrieve all gateways and servers.
script: CheckPointFirewall_v2|||checkpoint-gateways-list
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "101"
scriptarguments:
limit: {}
offset: {}
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 6170,
"y": 1790
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"93":
id: "93"
taskid: 50b77ea9-ced5-4f88-82c5-433cb77d772b
type: regular
task:
id: 50b77ea9-ced5-4f88-82c5-433cb77d772b
version: -1
name: Install the policy
description: Intsalls an Access Control policy.
script: CheckPointFirewall_v2|||checkpoint-install-policy
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "94"
scriptarguments:
access:
simple: "true"
policy_package:
complex:
root: CheckPoint.Packages.name
session_id:
complex:
root: CheckPoint.Login.session-id
targets:
complex:
root: CheckPoint.Gateways.name
separatecontext: false
view: |-
{
"position": {
"x": 7050,
"y": 1570
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"94":
id: "94"
taskid: 2ccbeeff-e6e7-457d-82da-a9c663fbd60a
type: condition
task:
id: 2ccbeeff-e6e7-457d-82da-a9c663fbd60a
version: -1
name: Is the install initiated?
description: Show task progress and details.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "102"
"yes":
- "95"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: CheckPoint.InstallPolicy.task-id
iscontext: true
view: |-
{
"position": {
"x": 7540,
"y": 1420
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"95":
id: "95"
taskid: 153b8e39-57a2-48cf-884c-54b795f24ce8
type: regular
task:
id: 153b8e39-57a2-48cf-884c-54b795f24ce8
version: -1
name: Waiting for the task to complete
description: Sleep for X seconds
scriptName: Sleep
type: regular
iscommand: false
brand: ""
nexttasks:
'#none#':
- "97"
scriptarguments:
seconds:
simple: "15"
separatecontext: false
view: |-
{
"position": {
"x": 7660,
"y": 1650
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"96":
id: "96"
taskid: 733908d7-2039-4729-8326-b544e8d307f7
type: regular
task:
id: 733908d7-2039-4729-8326-b544e8d307f7
version: -1
name: Waiting for the task to complete
description: Sleep for X seconds
scriptName: Sleep
type: regular
iscommand: false
brand: ""
nexttasks:
'#none#':
- "90"
scriptarguments:
seconds:
simple: "10"
separatecontext: false
view: |-
{
"position": {
"x": 6970,
"y": 1230
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"97":
id: "97"
taskid: 136c08ad-7870-4da5-828c-51f4f97029cd
type: regular
task:
id: 136c08ad-7870-4da5-828c-51f4f97029cd
version: -1
name: Get the status
description: Show task progress and details.
script: CheckPointFirewall_v2|||checkpoint-show-task
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "98"
scriptarguments:
session_id:
complex:
root: CheckPoint.Login.session-id
task_id:
complex:
root: CheckPoint.InstallPolicy.task-id
separatecontext: false
view: |-
{
"position": {
"x": 7700,
"y": 1900
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"98":
id: "98"
taskid: 5fb8979a-128a-4a83-8b9f-4e264a837e3a
type: condition
task:
id: 5fb8979a-128a-4a83-8b9f-4e264a837e3a
version: -1
name: Was the install process successful?
description: Check if the install process was successful.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "102"
"yes":
- "103"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isEqualString
left:
value:
complex:
root: CheckPoint.ShowTask.status
iscontext: true
right:
value:
simple: succeeded
view: |-
{
"position": {
"x": 7180,
"y": 2080
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"100":
id: "100"
taskid: 224e7b9f-9df6-4b2f-8618-2023dfd1ff81
type: condition
task:
id: 224e7b9f-9df6-4b2f-8618-2023dfd1ff81
version: -1
name: Was the URL added?
description: Check if the URL was added.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "78"
"yes":
- "87"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isExists
left:
value:
complex:
root: CheckPoint.ApplicationSite
accessor: name
iscontext: true
view: |-
{
"position": {
"x": 4890,
"y": 1555
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"101":
id: "101"
taskid: 3efc4767-3216-43fd-8f66-0f1b20e70bfe
type: regular
task:
id: 3efc4767-3216-43fd-8f66-0f1b20e70bfe
version: -1
name: Get the policy package
description: List all packages.
script: CheckPointFirewall_v2|||checkpoint-packages-list
type: regular
iscommand: true
brand: CheckPointFirewall_v2
nexttasks:
'#none#':
- "93"
scriptarguments:
limit: {}
offset: {}
session_id:
complex:
root: CheckPoint.Login.session-id
separatecontext: false
view: |-
{
"position": {
"x": 6700,
"y": 1790
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"102":
id: "102"
taskid: 10bca740-604a-4f0b-8eaf-95d7ac45ebe4
type: regular
task:
id: 10bca740-604a-4f0b-8eaf-95d7ac45ebe4
version: -1
name: Add comment for issues
description: Add comments to the incidents
script: LogPoint SIEM Integration|||lp-add-incident-comment
type: regular
iscommand: true
brand: LogPoint SIEM Integration
nexttasks:
'#none#':
- "29"
scriptarguments:
comment:
simple: There is some issue due to which the playbook was unable to take action.
kindly review.
incident_obj_id:
complex:
root: incident.logpointobjectid
separatecontext: false
view: |-
{
"position": {
"x": 5610,
"y": 2120
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"103":
id: "103"
taskid: d771d1e8-ba60-4284-8fb6-58631d73dd2e
type: regular
task:
id: d771d1e8-ba60-4284-8fb6-58631d73dd2e
version: -1
name: Add successful comment
description: Add comments to the incidents
script: LogPoint SIEM Integration|||lp-add-incident-comment
type: regular
iscommand: true
brand: LogPoint SIEM Integration
nexttasks:
'#none#':
- "74"
scriptarguments:
comment:
simple: The blocking of IP has been successfully completed by the playbook.
Please verify.
incident_obj_id:
complex:
root: incident.logpointobjectid
separatecontext: false
view: |-
{
"position": {
"x": 6020,
"y": 2330
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
"104":
id: "104"
taskid: 9ebbbd5e-b043-4493-8898-42c0a0673011
type: condition
task:
id: 9ebbbd5e-b043-4493-8898-42c0a0673011
version: -1
name: Is user present in AD?
description: Check if user is present in AD.
type: condition
iscommand: false
brand: ""
nexttasks:
'#default#':
- "12"
"yes":
- "52"
separatecontext: false
conditions:
- label: "yes"
condition:
- - operator: isNotEmpty
left:
value:
complex:
root: Account.Username
iscontext: true
view: |-
{
"position": {
"x": 2070,
"y": 1270
}
}
note: false
timertriggers: []
ignoreworker: false
skipunavailable: false
quietmode: 0
view: |-
{
"linkLabelsPosition": {
"100_87_yes": 0.84,
"30_41_#default#": 0.9,
"30_66_yes": 0.51,
"35_38_YES": 0.49,
"35_5_#default#": 0.19,
"38_5_yes": 0.52,
"39_12_#default#": 0.24,
"39_66_yes": 0.24,
"44_12_#default#": 0.32,
"44_66_yes": 0.19,
"44_7_user": 0.24,
"59_12_#default#": 0.57,
"5_9_yes": 0.44,
"62_12_#default#": 0.13,
"65_38_yes": 0.58,
"65_5_#default#": 0.29,
"72_73_#default#": 0.48,
"7_12_#default#": 0.12,
"80_81_#default#": 0.46,
"80_86_yes": 0.49,
"91_102_#default#": 0.53
},
"paper": {
"dimensions": {
"height": 3565,
"width": 8120,
"x": -40,
"y": -970
}
}
}
inputs: []
outputs: []
tests:
- LogPoint SIEM Integration - Test Playbook 2
- LogPoint SIEM Integration - Test Playbook 1
fromversion: 6.0.0
```
|
Romanie Schotte is a Flemish model and beauty pageant titleholder from Bruges who was crowned Miss Belgium 2017 and represented Belgium at the Miss World 2017 pageant.
Miss Belgium 2017
Schotte, at the time a 19-year-old Business Management student, was crowned "Miss Belgium 2017" by Lenty Frans (Miss Belgium 2016) on 14 January 2017.
After winning the title, Schotte was criticized for her response to a racist comment on Instagram. The Centre for Equal Opportunities and Opposition to Racism opened an investigation but found there was no wrongdoing on her part.
Schotte took part in the Miss World 2017 pageant but did not reach the finals.
Personal life
In June 2019 Schotte married Stefan Talpe. In May 2021 the couple announced that they were expecting their first child.
References
External links
Official Miss Belgium website
1997 births
Living people
Belgian beauty pageant winners
Belgian female models
Miss World 2017 delegates
Miss Belgium winners
Flemish models
|
NGC 113 is an unbarred lenticular galaxy located in the constellation Cetus. It was discovered by German astronomer, Ernst Wilhelm Leberecht Tempel, on August 27, 1876.
References
External links
0113
Unbarred lenticular galaxies
Cetus
001656
Astronomical objects discovered in 1876
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\ShoppingContent;
class CaptureOrderResponse extends \Google\Model
{
/**
* @var string
*/
public $executionStatus;
/**
* @param string
*/
public function setExecutionStatus($executionStatus)
{
$this->executionStatus = $executionStatus;
}
/**
* @return string
*/
public function getExecutionStatus()
{
return $this->executionStatus;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(CaptureOrderResponse::class, 'Google_Service_ShoppingContent_CaptureOrderResponse');
```
|
Grevillea infecunda, commonly known as Anglesea grevillea, is a species of flowering plant in the family Proteaceae and is endemic to a restricted area of southern Victoria in Australia. It is a low-lying to weakly erect shrub with divided leaves with three to sixteen lobes or teeth and greenish-yellow flowers with a dull pink style.
Description
Grevillea infecunda is a low-lying to weakly erect shrub that typically grows to a height of , has hairy branchlets and grows from root suckers. The leaves are egg-shaped to oblong in outline, long and divided, with three to sixteen triangular to rounded teeth or lobes, the end lobes rigid, long and wide and sharply-pointed. The flowers are arranged in clusters on a rachis long and are greenish yellow, ageing to orange or reddish, the pistil long and the style greenish-yellow or dull pink. Flowering occurs from October to December but the plant is not known to produce fruit.
Taxonomy
Grevillea infecunda was first formally described in 1986 by Donald McGillivray in New Names in Grevillea (Proteaceae) from specimens collected in the Anglesea district by James Hamlyn Willis in 1969. The specific epithet (infecunda) means "unfruitful".
Distribution and habitat
Anglesea grevillea grows in forest and woodland, and is currently only known from the Anglesea area, although old records suggest that the species was once found east of Anglesea.
Conservation status
Grevillea infecunda is listed as "vulnerable" under the Australian Government Environment Protection and Biodiversity Conservation Act and the Flora and Fauna Guarantee Act 1988 and the Department of Sustainability and Environment's Advisory List of Rare Or Threatened Plants In Victoria, and a National Recovery Plan has been prepared. The main threats to the species include recreational activities such as the use of off-road vehicles, horse-riding and camping.
References
infecunda
Flora of Victoria (state)
Proteales of Australia
Taxa named by Donald McGillivray
Plants described in 1986
|
```objective-c
#include "src/api/api-inl.h"
#include "src/ast/ast.h"
#include "src/builtins/builtins-definitions.h"
#include "src/common/globals.h"
#include "src/objects/objects-inl.h"
#include "src/objects/dictionary-inl.h"
#include "src/objects/js-objects-inl.h"
#include "src/objects/fixed-array-inl.h"
#include "src/utils/utils.h"
#include "src/utils/vector.h"
#include <algorithm>
#include <cstring>
#include <iterator>
#include <iosfwd>
#include <memory>
#include <string>
```
|
```go
// Unless explicitly stated otherwise all files in this repository are licensed
// This product includes software developed at Datadog (path_to_url
//go:build linux && test
// Package process implements the local process collector for
// Workloadmeta.
package process
import (
"context"
"testing"
"time"
"github.com/benbjohnson/clock"
"github.com/golang/mock/gomock"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/mock"
"github.com/stretchr/testify/require"
"go.uber.org/fx"
"github.com/DataDog/datadog-agent/comp/core"
"github.com/DataDog/datadog-agent/comp/core/config"
workloadmeta "github.com/DataDog/datadog-agent/comp/core/workloadmeta/def"
workloadmetafxmock "github.com/DataDog/datadog-agent/comp/core/workloadmeta/fx-mock"
workloadmetamock "github.com/DataDog/datadog-agent/comp/core/workloadmeta/mock"
"github.com/DataDog/datadog-agent/pkg/languagedetection/languagemodels"
processwlm "github.com/DataDog/datadog-agent/pkg/process/metadata/workloadmeta"
"github.com/DataDog/datadog-agent/pkg/process/procutil"
"github.com/DataDog/datadog-agent/pkg/process/procutil/mocks"
proccontainers "github.com/DataDog/datadog-agent/pkg/process/util/containers/mocks"
"github.com/DataDog/datadog-agent/pkg/util/flavor"
"github.com/DataDog/datadog-agent/pkg/util/fxutil"
)
// NewProcessDataWithMockProbe returns a new ProcessData with a mock probe
func NewProcessDataWithMockProbe(t *testing.T) (*Data, *mocks.Probe) {
probe := mocks.NewProbe(t)
return &Data{
probe: probe,
}, probe
}
type collectorTest struct {
collector *collector
probe *mocks.Probe
mockClock *clock.Mock
mockStore workloadmetamock.Mock
}
func setUpCollectorTest(t *testing.T, configOverrides map[string]interface{}) collectorTest {
mockStore := fxutil.Test[workloadmetamock.Mock](t, fx.Options(
core.MockBundle(),
fx.Replace(config.MockParams{Overrides: configOverrides}),
fx.Supply(workloadmeta.Params{
AgentType: workloadmeta.NodeAgent,
}),
workloadmetafxmock.MockModule(),
))
wlmExtractor := processwlm.NewWorkloadMetaExtractor(mockStore.GetConfig())
mockProcessData, probe := NewProcessDataWithMockProbe(t)
mockProcessData.Register(wlmExtractor)
mockClock := clock.NewMock()
processDiffCh := wlmExtractor.ProcessCacheDiff()
processCollector := &collector{
id: collectorID,
store: mockStore,
catalog: workloadmeta.NodeAgent,
processDiffCh: processDiffCh,
processData: mockProcessData,
pidToCid: make(map[int]string),
wlmExtractor: wlmExtractor,
collectionClock: mockClock,
}
return collectorTest{processCollector, probe, mockClock, mockStore}
}
func TestProcessCollector(t *testing.T) {
originalFlavor := flavor.GetFlavor()
defer flavor.SetFlavor(originalFlavor)
flavor.SetFlavor(flavor.DefaultAgent)
configOverrides := map[string]interface{}{
"language_detection.enabled": true,
"process_config.process_collection.enabled": true,
"process_config.run_in_core_agent.enabled": true,
}
c := setUpCollectorTest(t, configOverrides)
ctx, cancel := context.WithCancel(context.TODO())
defer cancel()
processDiffCh := make(chan *processwlm.ProcessCacheDiff)
c.collector.processDiffCh = processDiffCh
err := c.collector.Start(ctx, c.mockStore)
require.NoError(t, err)
creationTime := time.Now().Unix()
processDiffCh <- &processwlm.ProcessCacheDiff{
Creation: []*processwlm.ProcessEntity{
{
Pid: 1,
ContainerId: "cid",
NsPid: 1,
CreationTime: creationTime,
Language: &languagemodels.Language{Name: languagemodels.Java},
},
},
}
expectedProc1 := &workloadmeta.Process{
EntityID: workloadmeta.EntityID{
ID: "1",
Kind: workloadmeta.KindProcess,
},
NsPid: 1,
ContainerID: "cid",
CreationTime: time.UnixMilli(creationTime),
Language: &languagemodels.Language{Name: languagemodels.Java},
}
assert.EventuallyWithT(t, func(cT *assert.CollectT) {
proc, err := c.mockStore.GetProcess(1)
assert.NoError(cT, err)
assert.Equal(cT, expectedProc1, proc)
}, time.Second, time.Millisecond*100)
processDiffCh <- &processwlm.ProcessCacheDiff{
Creation: []*processwlm.ProcessEntity{
{
Pid: 2,
ContainerId: "cid",
NsPid: 2,
CreationTime: creationTime,
Language: &languagemodels.Language{Name: languagemodels.Python},
},
},
Deletion: []*processwlm.ProcessEntity{
{
Pid: 1,
ContainerId: "cid",
NsPid: 1,
CreationTime: creationTime,
Language: &languagemodels.Language{Name: languagemodels.Java},
},
},
}
expectedProc2 := &workloadmeta.Process{
EntityID: workloadmeta.EntityID{
ID: "2",
Kind: workloadmeta.KindProcess,
},
NsPid: 2,
ContainerID: "cid",
CreationTime: time.UnixMilli(creationTime),
Language: &languagemodels.Language{Name: languagemodels.Python},
}
assert.EventuallyWithT(t, func(cT *assert.CollectT) {
proc, err := c.mockStore.GetProcess(2)
assert.NoError(cT, err)
assert.Equal(cT, expectedProc2, proc)
_, err = c.mockStore.GetProcess(1)
assert.Error(cT, err)
}, time.Second, time.Millisecond*100)
}
func TestProcessCollectorStart(t *testing.T) {
tests := []struct {
name string
agentFlavor string
langDetectionEnabled bool
runInCoreAgent bool
expectedEnabled bool
}{
{
name: "core agent + all configs enabled",
agentFlavor: flavor.DefaultAgent,
langDetectionEnabled: true,
runInCoreAgent: true,
expectedEnabled: true,
},
{
name: "core agent + all configs disabled",
agentFlavor: flavor.DefaultAgent,
langDetectionEnabled: false,
runInCoreAgent: false,
expectedEnabled: false,
},
{
name: "process agent + all configs enabled",
agentFlavor: flavor.ProcessAgent,
langDetectionEnabled: true,
runInCoreAgent: true,
expectedEnabled: false,
},
{
name: "process agent + all configs disabled",
agentFlavor: flavor.ProcessAgent,
langDetectionEnabled: false,
runInCoreAgent: false,
expectedEnabled: false,
},
}
for _, test := range tests {
t.Run(test.name, func(t *testing.T) {
originalFlavor := flavor.GetFlavor()
defer flavor.SetFlavor(originalFlavor)
flavor.SetFlavor(test.agentFlavor)
configOverrides := map[string]interface{}{
"language_detection.enabled": test.langDetectionEnabled,
"process_config.run_in_core_agent.enabled": test.runInCoreAgent,
}
c := setUpCollectorTest(t, configOverrides)
ctx, cancel := context.WithCancel(context.TODO())
defer cancel()
err := c.collector.Start(ctx, c.mockStore)
enabled := err == nil
assert.Equal(t, test.expectedEnabled, enabled)
})
}
}
func TestProcessCollectorWithoutProcessCheck(t *testing.T) {
originalFlavor := flavor.GetFlavor()
defer flavor.SetFlavor(originalFlavor)
flavor.SetFlavor(flavor.DefaultAgent)
configOverrides := map[string]interface{}{
"language_detection.enabled": true,
"process_config.process_collection.enabled": false,
"process_config.run_in_core_agent.enabled": true,
}
c := setUpCollectorTest(t, configOverrides)
ctx, cancel := context.WithCancel(context.TODO())
defer cancel()
mockCtrl := gomock.NewController(t)
mockProvider := proccontainers.NewMockContainerProvider(mockCtrl)
c.collector.containerProvider = mockProvider
err := c.collector.Start(ctx, c.mockStore)
require.NoError(t, err)
c.probe.On("ProcessesByPID", mock.Anything, mock.Anything).Return(map[int32]*procutil.Process{
1: {
Pid: 1,
Cmdline: []string{"proc", "-h", "-v"},
Stats: &procutil.Stats{CreateTime: 1},
},
}, nil).Times(1)
// Testing container id enrichment
expectedCid := "container1"
mockProvider.EXPECT().GetPidToCid(2 * time.Second).Return(map[int]string{1: expectedCid}).MinTimes(1)
c.mockClock.Add(10 * time.Second)
assert.EventuallyWithT(t, func(cT *assert.CollectT) {
proc, err := c.mockStore.GetProcess(1)
assert.NoError(cT, err)
assert.NotNil(cT, proc)
assert.Equal(cT, expectedCid, proc.ContainerID)
}, 1*time.Second, time.Millisecond*100)
}
```
|
```ruby
class AddUniqueIndexToBadgesSlug < ActiveRecord::Migration[5.2]
disable_ddl_transaction!
def up
return if index_exists?(:badges, :slug)
add_index :badges, :slug, unique: true, algorithm: :concurrently
end
def down
return unless index_exists?(:badges, :slug)
remove_index :badges, :slug
end
end
```
|
```python
"""Test common.ensure_stdout_handles_unicode"""
from __future__ import print_function
import unittest
import sys
from subprocess import check_call, CalledProcessError
from tempfile import mkstemp
import os
from os.path import isfile
from contextlib import contextmanager
FILE_TEXT = u'The unicode check mark is \u2713.\n'
@contextmanager
def temp_file(just_name=True):
"""
Context manager that creates temp file and deletes it in the end.
If `just_name` is `False` this yields (file-name, open-file-handle),
if `just_name` is `True` this yields just the file-name (and closes
the file-handle if we are on windows)
"""
tmp_descriptor = None
tmp_name = None
tmp_handle = None
try:
tmp_descriptor, tmp_name = mkstemp()
# we create our own file handle since we want to be able to close the
# file and open it again for reading.
# We keep the os-level descriptor open so file name is still reserved
# for us ... except for Windows where it is not possible for another
# process to write to that handle
if just_name:
if sys.platform.startswith('win'):
os.close(tmp_descriptor)
tmp_descriptor = None
yield tmp_name
else:
tmp_handle = open(tmp_name, 'wb')
yield tmp_handle, tmp_name
except Exception:
raise
finally:
if tmp_descriptor is not None:
os.close(tmp_descriptor)
if tmp_handle is not None:
tmp_handle.close()
if tmp_name is not None and isfile(tmp_name):
os.unlink(tmp_name)
class TestEncodingHandler(unittest.TestCase):
"""Tests replacing stdout encoding in various scenarios"""
def test_print(self):
"""Test regular unicode output not raise error"""
check_call('{python} {this_file} print'.format(python=sys.executable,
this_file=__file__),
shell=True)
def test_print_redirect(self):
"""Test redirection of unicode output to files does not raise error."""
with temp_file() as tmp_file:
check_call('{python} {this_file} print > {tmp_file}'
.format(python=sys.executable, this_file=__file__,
tmp_file=tmp_file),
shell=True)
@unittest.skipIf(not sys.platform.startswith('linux'),
'Need to adapt this test to Windows')
def test_print_no_lang(self):
"""
Test redirection of unicode output to files does not raise error
TODO: Adapt this for other OSs; for win create batch script
"""
check_call('LANG=C {python} {this_file} print'
.format(python=sys.executable, this_file=__file__),
shell=True)
def test_uopen(self):
"""Test that uopen in a nice environment is ok"""
with temp_file(False) as (tmp_handle, tmp_file):
tmp_handle.write(FILE_TEXT.encode('utf8'))
tmp_handle.close()
try:
check_call('{python} {this_file} read {tmp_file}'
.format(python=sys.executable, this_file=__file__,
tmp_file=tmp_file),
shell=True)
except CalledProcessError as cpe:
self.fail(cpe.output)
def test_uopen_redirect(self):
"""Test redirection of unicode output to files does not raise error."""
with temp_file(False) as (tmp_handle, tmp_file):
tmp_handle.write(FILE_TEXT.encode('utf8'))
tmp_handle.close()
with temp_file() as redirect_file:
try:
check_call(
'{python} {this_file} read {tmp_file} >{redirect_file}'
.format(python=sys.executable, this_file=__file__,
tmp_file=tmp_file, redirect_file=redirect_file),
shell=True)
except CalledProcessError as cpe:
self.fail(cpe.output)
@unittest.skipIf(not sys.platform.startswith('linux'),
'Need to adapt this test to Windows')
def test_uopen_no_lang(self):
"""
Test that uopen in a C-LANG environment is ok
TODO: Adapt this for other OSs; for win create batch script
"""
with temp_file(False) as (tmp_handle, tmp_file):
tmp_handle.write(FILE_TEXT.encode('utf8'))
tmp_handle.close()
try:
check_call('LANG=C {python} {this_file} read {tmp_file}'
.format(python=sys.executable, this_file=__file__,
tmp_file=tmp_file),
shell=True)
except CalledProcessError as cpe:
self.fail(cpe.output)
def run_read(filename):
"""This is called from test_uopen* tests as script. Reads text, compares"""
from oletools.common.io_encoding import uopen
# open file
with uopen(filename, 'rt') as reader:
# a few tests
if reader.closed:
raise ValueError('handle is closed!')
if reader.name != filename:
raise ValueError('Wrong filename {}'.format(reader.name))
if reader.isatty():
raise ValueError('Reader is a tty!')
if reader.tell() != 0:
raise ValueError('Reader.tell is not 0 at beginning')
# read text
text = reader.read()
# a few more tests
if not reader.closed:
raise ValueError('Reader is not closed outside context')
if reader.name != filename:
raise ValueError('Wrong filename {} after context'.format(reader.name))
# the following test raises an exception because reader is closed, so isatty cannot be called:
# if reader.isatty():
# raise ValueError('Reader has become a tty!')
# compare text
if sys.version_info.major <= 2: # in python2 get encoded byte string
expect = FILE_TEXT.encode('utf8')
else: # python3: should get real unicode
expect = FILE_TEXT
if text != expect:
raise ValueError('Wrong contents: {!r} != {!r}'
.format(text, expect))
return 0
def run_print():
"""This is called from test_read* tests as script. Prints & logs unicode"""
from oletools.common.io_encoding import ensure_stdout_handles_unicode
from oletools.common.log_helper import log_helper
ensure_stdout_handles_unicode()
print(u'Check: \u2713') # print check mark
# check logging as well
logger = log_helper.get_or_create_silent_logger('test_encoding_handler')
log_helper.enable_logging(False, 'debug', stream=sys.stdout)
logger.info(u'Check: \u2713')
return 0
# tests call this file as script
if __name__ == '__main__':
if len(sys.argv) < 2:
sys.exit(unittest.main())
# hack required to import common from parent dir, not system-wide one
# (usually unittest seems to do that for us)
from os.path import abspath, dirname, join
ole_base = dirname(dirname(dirname(abspath(__file__))))
sys.path.insert(0, ole_base)
if sys.argv[1] == 'print':
if len(sys.argv) > 2:
print('Expect no arg for "print"', file=sys.stderr)
sys.exit(2)
sys.exit(run_print())
elif sys.argv[1] == 'read':
if len(sys.argv) != 3:
print('Expect single arg for "read"', file=sys.stderr)
sys.exit(2)
sys.exit(run_read(sys.argv[2]))
else:
print('Unexpected argument: {}'.format(sys.argv[1]), file=sys.stderr)
sys.exit(2)
```
|
The 1967–68 Montreal Canadiens season was the club's 59th season of play. The Canadiens won their 15th Stanley Cup in club history.
Offseason
Expansion draft
The 1967 NHL Expansion Draft was held on June 6, 1967, in the ballroom of the Queen Elizabeth Hotel in Montreal. The Canadiens lost 18 players in the NHL Expansion Draft. General manager Sam Pollock helped Clarence Campbell draw up the rules for the draft. The most notable players lost were Charlie Hodge, Jean-Guy Talbot, Dave Balon and Jim Roberts.
Regular season
On March 3, 1968, Jean Beliveau joined Gordie Howe as the only players to have 1000 career points.
Final standings
Record vs. opponents
Schedule and results
Playoffs
Stanley Cup finals
This was the first Stanley Cup after the 1967 expansion. Montreal defeated Boston and Chicago to advance to the finals as the East Division champion. St. Louis would defeat Philadelphia and Minnesota to advance to the finals as the West Division champion.
Montreal wins the series 4–0.
Player statistics
Regular season
Scoring
Goaltending
Playoffs
Scoring
Goaltending
Awards and records
Prince of Wales Trophy.
Jean Beliveau, runner-up, Hart Trophy.
Claude Provost, Bill Masterton Memorial Trophy.
J. C. Tremblay, defence, NHL Second Team All-Star.
J. C. Tremblay, runner-up, Norris Trophy.
Rogie Vachon and Gump Worsley, Vezina Trophy.
Gump Worsley, goaltender, NHL First Team All-Star.
Transactions
Draft picks
Montreal's draft picks at the 1967 NHL Amateur Draft held at the Queen Elizabeth Hotel in Montreal, Quebec.
See also
1967–68 NHL season
List of Stanley Cup champions
References
Notes
Bibliography
National Hockey League Official Guide and Record Book 2006, Dan Diamond & Associates, Toronto, Ontario, .
External links
Canadiens on Hockey Database
Canadiens on NHL Reference
Montreal Canadiens seasons
Mon
Mon
Stanley Cup championship seasons
Mon
|
```xml
<?xml version="1.0" encoding="utf-8"?><!--
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.
-->
<resources>
<string name="app_name">Cat Gallery</string>
<string name="content_description_cat_view_holder">Cat image</string>
</resources>
```
|
```yaml
kep-number: 1769
alpha:
approver: "@deads2k"
beta:
approver: "@deads2k"
```
|
The 2002 Winter Olympics torch relay was a 65-day run, from December 4, 2001, until February 8, 2002, prior to the 2002 Winter Olympics. The runners carried the Olympic Flame throughout the United States – following its lighting in Olympia, Greece, to the opening ceremony of the 2002 games at Rice-Eccles Stadium in Salt Lake City, Utah. The 2002 torch relay was also the 50th anniversary of the Winter Olympic torch relay, which was first run during the 1952 Winter Olympics.
Planning
The Salt Lake Organizing Committee (SLOC) contracted with Além International Management, Inc., to plan the torch relay route, including security and marketing plans. The plan produced by SLOC and Além was announced to the public on December 4, 2000. It would have the torch cover passing through 46 of the 50 states in the United States, and be carried by 12,012 torchbearers. The torch would pass through 300 communities, stopping twice a day: once for a midday celebration and then in a larger populated city for the night. 120 of the 300 communities would host the special celebrations, which would allow large groups of people to participate in the Olympic spirit. It also allowed each community to show off local talent, its people, and history. Atlanta, New York City, and Salt Lake City were all selected as special signature cities, and they would host large relay celebrations which would be paid for, planned, and controlled by SLOC. Later plans for special commemorations of September 11, 2001, along the relay route in Washington, D.C., and New York City, would be added to the route plan. The torch and all relay marketing would be designed to closely follow the 2002 Olympic theme Light the Fire Within and the look of the games theme Land of Contrast - Fire and Ice.
In February 2000 The Coca-Cola Company and Chevrolet signed an agreement with SLOC to become the official relay sponsors, agreeing to pay two-thirds of the $25 million relay cost. The remainder of the cost would be paid for by official relay providers, such as Delta Air Lines, who flew the flame from Greece to the United States, and Union Pacific, whose trains transported the flame through parts of the United States.
In February 2001 the nomination process for torchbearers was begun. SLOC had decided on a theme of Inspire for the Torchbearers, and people were encouraged to nominate those who inspire others. Of the 12,012 torchbearer positions, SLOC, Coca-Cola, and Chevrolet each got to select one-third of the nominees, while a few were reserved for providers and special guests at the Opening Ceremony. SLOC received approximately 50,000 nominations for its 3,500 positions, so applications were separated by ZIP code then sent to a local community judging panel who scored the applications and selected the torchbearers for their area. Coca-Cola and Chevrolet both received more than 120,000 applications for their positions, and both used a random selection process to choose torchbearers.
SLOC president Mitt Romney was scheduled to release the names of the selected torchbearers in a press conference at New York City's Battery Park on September 12, 2001. However, this event was canceled due to the September 11 attacks, which destroyed the World Trade Center towers a few blocks away from the park. The announcement of the torchbearers' names was postponed until October 4, when they were unveiled in an event on the steps of the Utah State Capitol.
Relay elements
Torch
The 2002 Olympic Torch, engineered and manufactured by Coleman, was modeled after an icicle, with a slight curve to represent speed and fluidity. The Torch measured long, wide at the top, at the bottom, and was designed by Axiom Design of Salt Lake City. It was created with three sections, each with its own meaning and representation.
The top section was glass, and the Olympic flame burned within the glass, echoing the 2002 Olympic theme Light the Fire Within. The glass stood for purity, winter, ice, and nature. Also inside the glass was a geometric copper structure which helped hold the flame. Copper is a very important natural element of Utah, and represented fire, warmth, Utah's History, and mirrored the orange/red colors of the theme Fire and Ice. The center section was made of silver and finished to look old and worn, while the bottom section was made of clean, highly polished silver. The center section represented the silver mining heritage of the American West, while the bottom section represented the future and modern technology. The Torchbearer gripped the torch at the junction of both the aged and polished silver, during which their hand represented a bridge from the past to the present. The two silver sections also mirrored the blue/purple colors of the Fire and Ice theme.
Modes of transportation
The Olympic torch was carried through a variety of modes, including runners, skiers, motor vehicles, aircraft, boats, canoes, and bicycles.
Aircraft
Delta Air Lines, one of the relay providers, was responsible for carrying the flame across the Atlantic Ocean from Athens, Greece, to the United States. A Boeing 777, known as the Soaring Spirit, decorated in Olympic-themed livery carried the Olympic flame in a ceremonial lantern from Greece to Atlanta, Georgia, during an 11-hour flight.
Railroad car
Union Pacific, another of the relay providers, used a specially designed railroad car to carry the flame across various areas of the United States (mainly rural and desert areas). Coined the "Cauldron Car", it was part of Union Pacific's "Olympic Train", which included two diesel locomotives (UP Numbers: 2001 & 2002), 13 passenger cars, and 3 service cars with the cauldron car serving as the caboose. The entire train was painted in Olympic livery, using Salt Lake's "Look of the Games" style, known as "Land of Contrast - Fire and Ice". The cauldron car contained a 2 million-BTU burner, to keep the flame burning, was originally used during the torch relay for the 1996 Summer Olympics, and was simply redesigned and repainted for the 2002 games. The Olympic train carried the flame on four separate occasions during the 2002 torch relay, for a total of more than through 11 states. Following the games the cauldron car was donated to the Utah State Railroad Museum at Union Station, where it is currently on display. In anticipation of the torch relay Overland Models (model railroading) created an H0 scale model of the Olympic Train, which included the two locomotives and several of the passenger cars.
The Heber Valley Historic Railroad also played a role in the torch relay. Its historic steam locomotives were joined by another from the Nevada Northern Railway Museum, and together they were known as the Olympic Steam Team. During the games all three locomotives would pull their own eight-car train loaded with spectators to the Soldier Hollow Olympic venue. The day prior to the Opening Ceremony of the games, all three locomotives were combined into one triple-headed train, and used to transport the Olympic flame from Soldier Hollow to Heber City, Utah, as part of the torch relay.
Route
On November 19, 2001, the first 2002 Olympic torch was lit at the birthplace of the Olympic Games in Olympia, Greece. Greek actress Thalia Prokopiou played the role of high priestess and lit the torch using a flame kept in a clay urn. Usually the torch is lit using a parabolic mirror and the sun's rays, but for the third games in a row, cloudy conditions prevented that from happening during the ceremony. The weekend prior to the lighting ceremony, the flame held in the clay urn had been lit using the parabolic mirror and the sun's rays in case of this situation. Following the ceremony, a two-day Greek torch relay carried the flame to the Panathenian stadium in Athens, Greece, where it burned in a cauldron for two weeks.
On December 3, 2001, a Greek skier, Thanassis Tsailas, lit a 2002 Olympic torch from a flame in the cauldron, which in turn was used to light a ceremonial lantern. This lantern was then flown aboard the Soaring Spirit to Atlanta, Georgia, where it arrived on the morning of December 4. The lantern was unloaded and Bonnie Blair used its flame to light a temporary cauldron to be used at the celebration in Atlanta. During this celebration, Muhammad Ali lit a 2002 Olympic torch from the flame in the temporary cauldron, which he then passed to Olympians Peggy Fleming and Bob Paul, who began the 2002 Winter Olympics torch relay.
December 3–4: Athens, Greece, to Atlanta, Georgia, to Greenville, South Carolina
December 5: Greenville to Charlotte, North Carolina
December 6: Charlotte to Charleston, South Carolina
December 7: Charleston to Orlando, Florida
December 8: Orlando to Miami, Florida
December 9: Miami to New Orleans, Louisiana
December 10: New Orleans to Beaumont, Texas
December 11: Beaumont to Houston to San Antonio to Austin, Texas
December 12: San Antonio to Austin to Dallas, Texas
December 13:Dallas to Little Rock, Arkansas
December 14: Little Rock to Memphis, Tennessee
December 15: Memphis to Nashville, Tennessee
December 16: Nashville to Louisville, Kentucky
December 17: Louisville to Cincinnati, Ohio
December 18: Cincinnati to Charleston, West Virginia
December 19: Charleston to Pittsburgh, Pennsylvania
December 20: Pittsburgh to Martinsburg, West Virginia
December 21: West Virginia to Washington, D.C.
December 22: Washington to Philadelphia, Pennsylvania
December 23: Philadelphia to New York City, New York
December 24: New York City (rested in a special cauldron at Rockefeller Center for the Christmas Holiday)
December 25: New York City (rested in a special cauldron at Rockefeller Center for the Christmas Holiday)
December 26: New York City to Providence, Rhode Island
December 27: Rhode Island to Boston, Massachusetts
December 28: Boston to Lebanon, New Hampshire
December 29: New Hampshire to Lake Placid, New York
December 30: Lake Placid to Syracuse, New York
December 31: Syracuse to Buffalo, New York
January 1: Buffalo to Cleveland, Ohio
January 2: Cleveland to Columbus, Ohio
January 3: Columbus to Fort Wayne, Indiana
January 4: Fort Wayne to Chicago, Illinois
January 5: Chicago to Milwaukee, Wisconsin
January 6: Milwaukee to Detroit, Michigan
January 7: Detroit to Indianapolis, Indiana
January 8: Indianapolis to St. Louis, Missouri
January 9: St. Louis to Kansas City, Missouri
January 10: Kansas City to Omaha, Nebraska
January 11: Omaha to Oklahoma City, Oklahoma
January 12: Oklahoma to Santa Fe, New Mexico
January 13: New Mexico to Phoenix, Arizona
January 14: Arizona to San Diego, California
January 15: San Diego to Los Angeles, California
January 16: Los Angeles to San Luis Obispo, California
January 17: San Luis Obispo to Seaside, California
January 18: Seaside to San Francisco, California
January 19: San Francisco to Sacramento, California
January 20: Sacramento to Lake Tahoe, California
January 21: Lake Tahoe to Sparks, Nevada
January 22: Sparks to Portland, Oregon
January 23: Portland to Seattle, Washington
January 24: Seattle to Alaska to Spokane, Washington
January 25: Spokane to Boise, Idaho
January 26: Boise to Idaho Falls, Idaho
January 27: Idaho Falls to Bozeman, Montana
January 28: Bozeman to Billings, Montana
January 29: Billings to Cheyenne, Wyoming
January 30: Cheyenne to Denver, Colorado
January 31: Denver to Colorado Springs, Colorado (Columbine survivors Patrick Ireland, Richard Castaldo, and the father of victim John Tomlin got to pass the torch.)
February 1: Colorado Springs to Vail, Colorado
February 2: Vail to Grand Junction, Colorado
February 3: Grand Junction to Southern Utah (no relay celebrations due to the Super Bowl)
February 4: Southern Utah to St. George, Utah (on this day the torch was carried under Delicate Arch.)
February 5: St. George to Provo, Utah
February 6: Provo to Ogden, Utah
February 7: Ogden to Downtown Salt Lake City, Utah
February 8: Downtown Salt Lake City to Rice-Eccles Stadium for Opening Ceremony
See also
Morse v. Frederick (2007)
Notes
External links
Official Site - Torch Relay (Archived)
UEN's 2002 Olympic Site - Torch Relay (Archived)
Utah's KSL-TV Torch Relay Coverage
http://sportsillustrated.cnn.com/olympics/2002/torchroute/ Torch Relay Map
Torch Relay, 2002 Winter Olympics
Olympic torch relays
|
FG (commonly called Les Sucettes after the fifth track on the side B) is the sixth album by French singer France Gall where she is accompanied by Alain Goraguer and His Orchestra. It was released in November 1966.
Track listing
References
1966 albums
Philips Records albums
France Gall albums
|
```c
/*
*
*/
/*********************************************************************************************************************************
* The demo shows BLE and classic Bluetooth coexistence. You can use BLE GATT server and classic bluetooth A2DP together.
* The BLE GATT server part of the demo creates a GATT service and then starts advertising, waiting to be connected by a GATT client.
* After the program is started, a GATT client can discover the device named "ESP_COEX_BLE_DEMO". Once the connection is established,
* GATT client can read or write data to the device. It can also receive notification or indication data.
* Attention: If you test the demo with iPhone, BLE GATT server adv name will change to "ESP_COEX_A2DP_DEMO" after you connect it.
* The classic bluetooth A2DP part of the demo implements Advanced Audio Distribution Profile to receive an audio stream.
* After the program is started, other bluetooth devices such as smart phones can discover the device named "ESP_COEX_A2DP_DEMO".
* Once the connection is established, audio data can be transmitted. This will be visible in the application log including a count
* of audio data packets.
*********************************************************************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <inttypes.h>
#include "freertos/FreeRTOS.h"
#include "freertos/task.h"
#include "nvs.h"
#include "nvs_flash.h"
#include "esp_system.h"
#include "esp_log.h"
#include "esp_bt.h"
#include "bt_app_core.h"
#include "bt_app_av.h"
#include "esp_bt_main.h"
#include "esp_bt_device.h"
#include "esp_gap_bt_api.h"
#include "esp_a2dp_api.h"
#include "esp_avrc_api.h"
#include "esp_gap_ble_api.h"
#include "esp_gatts_api.h"
#include "esp_bt_defs.h"
#include "esp_gatt_common_api.h"
/* log tag */
#define BT_BLE_COEX_TAG "BT_BLE_COEX"
/* device name */
#define BTDM_DEVICE_NAME "ESP_COEX_BTDM_DEMO"
#define BLE_ADV_NAME "ESP_COEX_BLE_DEMO"
/* BLE defines */
#define GATTS_SERVICE_UUID_A 0x00FF
#define GATTS_CHAR_UUID_A 0xFF01
#define GATTS_DESCR_UUID_A 0x3333
#define GATTS_NUM_HANDLE_A 4
#define GATTS_SERVICE_UUID_B 0x00EE
#define GATTS_CHAR_UUID_B 0xEE01
#define GATTS_DESCR_UUID_B 0x2222
#define GATTS_NUM_HANDLE_B 4
#define GATTS_DEMO_CHAR_VAL_LEN_MAX 0x40
#define PREPARE_BUF_MAX_SIZE 1024
#define PROFILE_NUM 2
#define PROFILE_A_APP_ID 0
#define PROFILE_B_APP_ID 1
/* event for stack up */
enum {
BT_APP_EVT_STACK_UP = 0,
};
typedef struct {
uint8_t *prepare_buf;
int prepare_len;
} prepare_type_env_t;
static prepare_type_env_t a_prepare_write_env;
static prepare_type_env_t b_prepare_write_env;
//Declare the static function
static void gatts_profile_a_event_handler(esp_gatts_cb_event_t event, esp_gatt_if_t gatts_if, esp_ble_gatts_cb_param_t *param);
static void gatts_profile_b_event_handler(esp_gatts_cb_event_t event, esp_gatt_if_t gatts_if, esp_ble_gatts_cb_param_t *param);
void example_write_event_env(esp_gatt_if_t gatts_if, prepare_type_env_t *prepare_write_env, esp_ble_gatts_cb_param_t *param);
void example_exec_write_event_env(prepare_type_env_t *prepare_write_env, esp_ble_gatts_cb_param_t *param);
static uint8_t ble_char_value_str[] = {0x11, 0x22, 0x33};
esp_gatt_char_prop_t a_property = 0;
esp_gatt_char_prop_t b_property = 0;
esp_attr_value_t gatts_initial_char_val = {
.attr_max_len = GATTS_DEMO_CHAR_VAL_LEN_MAX,
.attr_len = sizeof(ble_char_value_str),
.attr_value = ble_char_value_str,
};
static esp_ble_adv_params_t adv_params = {
.adv_int_min = 0x060,
.adv_int_max = 0x060,
.adv_type = ADV_TYPE_IND,
.own_addr_type = BLE_ADDR_TYPE_RPA_PUBLIC,
.channel_map = ADV_CHNL_ALL,
.adv_filter_policy = ADV_FILTER_ALLOW_SCAN_ANY_CON_ANY,
};
struct gatts_profile_inst {
esp_gatts_cb_t gatts_cb;
uint16_t gatts_if;
uint16_t app_id;
uint16_t conn_id;
uint16_t service_handle;
esp_gatt_srvc_id_t service_id;
uint16_t char_handle;
esp_bt_uuid_t char_uuid;
esp_gatt_perm_t perm;
esp_gatt_char_prop_t property;
uint16_t descr_handle;
esp_bt_uuid_t descr_uuid;
};
/* One gatt-based profile one app_id and one gatts_if, this array will store the gatts_if returned by ESP_GATTS_REG_EVT */
static struct gatts_profile_inst gl_profile_tab[PROFILE_NUM] = {
[PROFILE_A_APP_ID] = {
.gatts_cb = gatts_profile_a_event_handler,
.gatts_if = ESP_GATT_IF_NONE, /* Not get the gatt_if, so initial is ESP_GATT_IF_NONE */
},
[PROFILE_B_APP_ID] = {
.gatts_cb = gatts_profile_b_event_handler,/* This demo does not implement, similar as profile A */
.gatts_if = ESP_GATT_IF_NONE, /* Not get the gatt_if, so initial is ESP_GATT_IF_NONE */
},
};
static void ble_init_adv_data(const char *name)
{
int len = strlen(name);
uint8_t raw_adv_data[len+5];
//flag
raw_adv_data[0] = 2;
raw_adv_data[1] = ESP_BT_EIR_TYPE_FLAGS;
raw_adv_data[2] = (ESP_BLE_ADV_FLAG_GEN_DISC | ESP_BLE_ADV_FLAG_BREDR_NOT_SPT);
//adv name
raw_adv_data[3] = len + 1;
raw_adv_data[4] = ESP_BLE_AD_TYPE_NAME_CMPL;
for (int i = 0;i < len;i++)
{
raw_adv_data[i+5] = *(name++);
}
//The length of adv data must be less than 31 bytes
esp_err_t raw_adv_ret = esp_ble_gap_config_adv_data_raw(raw_adv_data, sizeof(raw_adv_data));
if (raw_adv_ret){
ESP_LOGE(BT_BLE_COEX_TAG, "config raw adv data failed, error code = 0x%x ", raw_adv_ret);
}
esp_err_t raw_scan_ret = esp_ble_gap_config_scan_rsp_data_raw(raw_adv_data, sizeof(raw_adv_data));
if (raw_scan_ret){
ESP_LOGE(BT_BLE_COEX_TAG, "config raw scan rsp data failed, error code = 0x%x", raw_scan_ret);
}
}
static void gap_event_handler(esp_gap_ble_cb_event_t event, esp_ble_gap_cb_param_t *param)
{
switch (event) {
case ESP_GAP_BLE_ADV_DATA_RAW_SET_COMPLETE_EVT:
//esp_ble_gap_start_advertising(&adv_params);
break;
case ESP_GAP_BLE_SCAN_RSP_DATA_RAW_SET_COMPLETE_EVT:
esp_ble_gap_start_advertising(&adv_params);
break;
case ESP_GAP_BLE_ADV_START_COMPLETE_EVT:
//advertising start complete event to indicate advertising start successfully or failed
if (param->adv_start_cmpl.status != ESP_BT_STATUS_SUCCESS) {
ESP_LOGE(BT_BLE_COEX_TAG, "Advertising start failed");
}else {
ESP_LOGI(BT_BLE_COEX_TAG, "Start adv successfully");
}
break;
case ESP_GAP_BLE_ADV_STOP_COMPLETE_EVT:
if (param->adv_stop_cmpl.status != ESP_BT_STATUS_SUCCESS) {
ESP_LOGE(BT_BLE_COEX_TAG, "Advertising stop failed");
}
else {
ESP_LOGI(BT_BLE_COEX_TAG, "Stop adv successfully");
}
break;
case ESP_GAP_BLE_UPDATE_CONN_PARAMS_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "update connection params status = %d, conn_int = %d, latency = %d, timeout = %d",
param->update_conn_params.status,
param->update_conn_params.conn_int,
param->update_conn_params.latency,
param->update_conn_params.timeout);
break;
default:
break;
}
}
void example_write_event_env(esp_gatt_if_t gatts_if, prepare_type_env_t *prepare_write_env, esp_ble_gatts_cb_param_t *param){
esp_gatt_status_t status = ESP_GATT_OK;
if (param->write.need_rsp){
if (param->write.is_prep) {
if (param->write.offset > PREPARE_BUF_MAX_SIZE) {
status = ESP_GATT_INVALID_OFFSET;
} else if ((param->write.offset + param->write.len) > PREPARE_BUF_MAX_SIZE) {
status = ESP_GATT_INVALID_ATTR_LEN;
}
if (status == ESP_GATT_OK && prepare_write_env->prepare_buf == NULL) {
prepare_write_env->prepare_buf = (uint8_t *)malloc(PREPARE_BUF_MAX_SIZE*sizeof(uint8_t));
prepare_write_env->prepare_len = 0;
if (prepare_write_env->prepare_buf == NULL) {
ESP_LOGE(BT_BLE_COEX_TAG, "Gatt_server prep no mem");
status = ESP_GATT_NO_RESOURCES;
}
}
esp_gatt_rsp_t *gatt_rsp = (esp_gatt_rsp_t *)malloc(sizeof(esp_gatt_rsp_t));
if (gatt_rsp) {
gatt_rsp->attr_value.len = param->write.len;
gatt_rsp->attr_value.handle = param->write.handle;
gatt_rsp->attr_value.offset = param->write.offset;
gatt_rsp->attr_value.auth_req = ESP_GATT_AUTH_REQ_NONE;
memcpy(gatt_rsp->attr_value.value, param->write.value, param->write.len);
esp_err_t response_err = esp_ble_gatts_send_response(gatts_if, param->write.conn_id, param->write.trans_id, status, gatt_rsp);
if (response_err != ESP_OK){
ESP_LOGE(BT_BLE_COEX_TAG, "Send response error\n");
}
free(gatt_rsp);
} else {
ESP_LOGE(BT_BLE_COEX_TAG, "%s, malloc failed", __func__);
status = ESP_GATT_NO_RESOURCES;
}
if (status != ESP_GATT_OK){
return;
}
memcpy(prepare_write_env->prepare_buf + param->write.offset,
param->write.value,
param->write.len);
prepare_write_env->prepare_len += param->write.len;
}else{
esp_ble_gatts_send_response(gatts_if, param->write.conn_id, param->write.trans_id, status, NULL);
}
}
}
void example_exec_write_event_env(prepare_type_env_t *prepare_write_env, esp_ble_gatts_cb_param_t *param){
if (param->exec_write.exec_write_flag == ESP_GATT_PREP_WRITE_EXEC){
ESP_LOG_BUFFER_HEX(BT_BLE_COEX_TAG, prepare_write_env->prepare_buf, prepare_write_env->prepare_len);
}else{
ESP_LOGI(BT_BLE_COEX_TAG,"ESP_GATT_PREP_WRITE_CANCEL");
}
if (prepare_write_env->prepare_buf) {
free(prepare_write_env->prepare_buf);
prepare_write_env->prepare_buf = NULL;
}
prepare_write_env->prepare_len = 0;
}
static void gatts_profile_a_event_handler(esp_gatts_cb_event_t event, esp_gatt_if_t gatts_if, esp_ble_gatts_cb_param_t *param) {
switch (event) {
case ESP_GATTS_REG_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "REGISTER_APP_EVT, status %d, app_id %d", param->reg.status, param->reg.app_id);
esp_ble_gap_config_local_privacy(true);
gl_profile_tab[PROFILE_A_APP_ID].service_id.is_primary = true;
gl_profile_tab[PROFILE_A_APP_ID].service_id.id.inst_id = 0x00;
gl_profile_tab[PROFILE_A_APP_ID].service_id.id.uuid.len = ESP_UUID_LEN_16;
gl_profile_tab[PROFILE_A_APP_ID].service_id.id.uuid.uuid.uuid16 = GATTS_SERVICE_UUID_A;
//init BLE adv data and scan response data
ble_init_adv_data(BLE_ADV_NAME);
esp_ble_gatts_create_service(gatts_if, &gl_profile_tab[PROFILE_A_APP_ID].service_id, GATTS_NUM_HANDLE_A);
break;
case ESP_GATTS_READ_EVT: {
ESP_LOGI(BT_BLE_COEX_TAG, "GATT_READ_EVT, conn_id %d, trans_id %"PRIu32", handle %d", param->read.conn_id, param->read.trans_id, param->read.handle);
esp_gatt_rsp_t rsp;
memset(&rsp, 0, sizeof(esp_gatt_rsp_t));
rsp.attr_value.handle = param->read.handle;
rsp.attr_value.len = 4;
rsp.attr_value.value[0] = 0xde;
rsp.attr_value.value[1] = 0xed;
rsp.attr_value.value[2] = 0xbe;
rsp.attr_value.value[3] = 0xef;
esp_ble_gatts_send_response(gatts_if, param->read.conn_id, param->read.trans_id,
ESP_GATT_OK, &rsp);
break;
}
case ESP_GATTS_WRITE_EVT: {
ESP_LOGI(BT_BLE_COEX_TAG, "GATT_WRITE_EVT, conn_id %d, trans_id %"PRIu32", handle %d", param->write.conn_id, param->write.trans_id, param->write.handle);
if (!param->write.is_prep){
ESP_LOGI(BT_BLE_COEX_TAG, "GATT_WRITE_EVT, value len %d, value :", param->write.len);
ESP_LOG_BUFFER_HEX(BT_BLE_COEX_TAG, param->write.value, param->write.len);
if (gl_profile_tab[PROFILE_A_APP_ID].descr_handle == param->write.handle && param->write.len == 2){
uint16_t descr_value = param->write.value[1]<<8 | param->write.value[0];
if (descr_value == 0x0001){
if (a_property & ESP_GATT_CHAR_PROP_BIT_NOTIFY){
ESP_LOGI(BT_BLE_COEX_TAG, "notify enable");
uint8_t notify_data[15];
for (int i = 0; i < sizeof(notify_data); ++i)
{
notify_data[i] = i%0xff;
}
//the size of notify_data[] need less than MTU size
esp_ble_gatts_send_indicate(gatts_if, param->write.conn_id, gl_profile_tab[PROFILE_A_APP_ID].char_handle,
sizeof(notify_data), notify_data, false);
}
}else if (descr_value == 0x0002){
if (a_property & ESP_GATT_CHAR_PROP_BIT_INDICATE){
ESP_LOGI(BT_BLE_COEX_TAG, "indicate enable");
uint8_t indicate_data[15];
for (int i = 0; i < sizeof(indicate_data); ++i)
{
indicate_data[i] = i%0xff;
}
//the size of indicate_data[] need less than MTU size
esp_ble_gatts_send_indicate(gatts_if, param->write.conn_id, gl_profile_tab[PROFILE_A_APP_ID].char_handle,
sizeof(indicate_data), indicate_data, true);
}
}
else if (descr_value == 0x0000){
ESP_LOGI(BT_BLE_COEX_TAG, "notify/indicate disable ");
}else{
ESP_LOGE(BT_BLE_COEX_TAG, "unknown descr value");
ESP_LOG_BUFFER_HEX(BT_BLE_COEX_TAG, param->write.value, param->write.len);
}
}
}
example_write_event_env(gatts_if, &a_prepare_write_env, param);
break;
}
case ESP_GATTS_EXEC_WRITE_EVT:
ESP_LOGI(BT_BLE_COEX_TAG,"ESP_GATTS_EXEC_WRITE_EVT");
esp_ble_gatts_send_response(gatts_if, param->write.conn_id, param->write.trans_id, ESP_GATT_OK, NULL);
example_exec_write_event_env(&a_prepare_write_env, param);
break;
case ESP_GATTS_MTU_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ESP_GATTS_MTU_EVT, MTU %d", param->mtu.mtu);
break;
case ESP_GATTS_UNREG_EVT:
break;
case ESP_GATTS_CREATE_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "CREATE_SERVICE_EVT, status %d, service_handle %d", param->create.status, param->create.service_handle);
gl_profile_tab[PROFILE_A_APP_ID].service_handle = param->create.service_handle;
gl_profile_tab[PROFILE_A_APP_ID].char_uuid.len = ESP_UUID_LEN_16;
gl_profile_tab[PROFILE_A_APP_ID].char_uuid.uuid.uuid16 = GATTS_CHAR_UUID_A;
esp_ble_gatts_start_service(gl_profile_tab[PROFILE_A_APP_ID].service_handle);
a_property = ESP_GATT_CHAR_PROP_BIT_READ | ESP_GATT_CHAR_PROP_BIT_WRITE | ESP_GATT_CHAR_PROP_BIT_NOTIFY;
esp_err_t add_char_ret = esp_ble_gatts_add_char(gl_profile_tab[PROFILE_A_APP_ID].service_handle, &gl_profile_tab[PROFILE_A_APP_ID].char_uuid,
ESP_GATT_PERM_READ | ESP_GATT_PERM_WRITE,
a_property,
&gatts_initial_char_val, NULL);
if (add_char_ret){
ESP_LOGE(BT_BLE_COEX_TAG, "add char failed, error code = 0x%x",add_char_ret);
}
break;
case ESP_GATTS_ADD_INCL_SRVC_EVT:
break;
case ESP_GATTS_ADD_CHAR_EVT: {
ESP_LOGI(BT_BLE_COEX_TAG, "ADD_CHAR_EVT, status %d, attr_handle %d, service_handle %d",
param->add_char.status, param->add_char.attr_handle, param->add_char.service_handle);
gl_profile_tab[PROFILE_A_APP_ID].char_handle = param->add_char.attr_handle;
gl_profile_tab[PROFILE_A_APP_ID].descr_uuid.len = ESP_UUID_LEN_16;
gl_profile_tab[PROFILE_A_APP_ID].descr_uuid.uuid.uuid16 = ESP_GATT_UUID_CHAR_CLIENT_CONFIG;
esp_err_t add_descr_ret = esp_ble_gatts_add_char_descr(gl_profile_tab[PROFILE_A_APP_ID].service_handle, &gl_profile_tab[PROFILE_A_APP_ID].descr_uuid,
ESP_GATT_PERM_READ | ESP_GATT_PERM_WRITE, NULL, NULL);
if (add_descr_ret){
ESP_LOGE(BT_BLE_COEX_TAG, "add char descr failed, error code = 0x%x", add_descr_ret);
}
break;
}
case ESP_GATTS_ADD_CHAR_DESCR_EVT:
gl_profile_tab[PROFILE_A_APP_ID].descr_handle = param->add_char_descr.attr_handle;
ESP_LOGI(BT_BLE_COEX_TAG, "ADD_DESCR_EVT, status %d, attr_handle %d, service_handle %d",
param->add_char_descr.status, param->add_char_descr.attr_handle, param->add_char_descr.service_handle);
break;
case ESP_GATTS_DELETE_EVT:
break;
case ESP_GATTS_START_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "SERVICE_START_EVT, status %d, service_handle %d",
param->start.status, param->start.service_handle);
break;
case ESP_GATTS_STOP_EVT:
break;
case ESP_GATTS_CONNECT_EVT: {
esp_ble_conn_update_params_t conn_params = {0};
memcpy(conn_params.bda, param->connect.remote_bda, sizeof(esp_bd_addr_t));
break;
}
case ESP_GATTS_DISCONNECT_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ESP_GATTS_DISCONNECT_EVT");
esp_ble_gap_start_advertising(&adv_params);
break;
case ESP_GATTS_CONF_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ESP_GATTS_CONF_EVT, status %d", param->conf.status);
if (param->conf.status != ESP_GATT_OK){
ESP_LOG_BUFFER_HEX(BT_BLE_COEX_TAG, param->conf.value, param->conf.len);
}
break;
case ESP_GATTS_OPEN_EVT:
case ESP_GATTS_CANCEL_OPEN_EVT:
case ESP_GATTS_CLOSE_EVT:
case ESP_GATTS_LISTEN_EVT:
case ESP_GATTS_CONGEST_EVT:
default:
break;
}
}
static void gatts_profile_b_event_handler(esp_gatts_cb_event_t event, esp_gatt_if_t gatts_if, esp_ble_gatts_cb_param_t *param) {
switch (event) {
case ESP_GATTS_REG_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "REGISTER_APP_EVT, status %d, app_id %d", param->reg.status, param->reg.app_id);
gl_profile_tab[PROFILE_B_APP_ID].service_id.is_primary = true;
gl_profile_tab[PROFILE_B_APP_ID].service_id.id.inst_id = 0x00;
gl_profile_tab[PROFILE_B_APP_ID].service_id.id.uuid.len = ESP_UUID_LEN_16;
gl_profile_tab[PROFILE_B_APP_ID].service_id.id.uuid.uuid.uuid16 = GATTS_SERVICE_UUID_B;
esp_ble_gatts_create_service(gatts_if, &gl_profile_tab[PROFILE_B_APP_ID].service_id, GATTS_NUM_HANDLE_B);
break;
case ESP_GATTS_READ_EVT: {
ESP_LOGI(BT_BLE_COEX_TAG, "GATT_READ_EVT, conn_id %d, trans_id %"PRIu32", handle %d", param->read.conn_id, param->read.trans_id, param->read.handle);
esp_gatt_rsp_t rsp;
memset(&rsp, 0, sizeof(esp_gatt_rsp_t));
rsp.attr_value.handle = param->read.handle;
rsp.attr_value.len = 4;
rsp.attr_value.value[0] = 0xde;
rsp.attr_value.value[1] = 0xed;
rsp.attr_value.value[2] = 0xbe;
rsp.attr_value.value[3] = 0xef;
esp_ble_gatts_send_response(gatts_if, param->read.conn_id, param->read.trans_id,
ESP_GATT_OK, &rsp);
break;
}
case ESP_GATTS_WRITE_EVT: {
ESP_LOGI(BT_BLE_COEX_TAG, "GATT_WRITE_EVT, conn_id %d, trans_id %"PRIu32", handle %d", param->write.conn_id, param->write.trans_id, param->write.handle);
if (!param->write.is_prep){
ESP_LOGI(BT_BLE_COEX_TAG, "GATT_WRITE_EVT, value len %d, value :", param->write.len);
ESP_LOG_BUFFER_HEX(BT_BLE_COEX_TAG, param->write.value, param->write.len);
if (gl_profile_tab[PROFILE_B_APP_ID].descr_handle == param->write.handle && param->write.len == 2){
uint16_t descr_value= param->write.value[1]<<8 | param->write.value[0];
if (descr_value == 0x0001){
if (b_property & ESP_GATT_CHAR_PROP_BIT_NOTIFY){
ESP_LOGI(BT_BLE_COEX_TAG, "notify enable");
uint8_t notify_data[15];
for (int i = 0; i < sizeof(notify_data); ++i)
{
notify_data[i] = i%0xff;
}
//the size of notify_data[] need less than MTU size
esp_ble_gatts_send_indicate(gatts_if, param->write.conn_id, gl_profile_tab[PROFILE_B_APP_ID].char_handle,
sizeof(notify_data), notify_data, false);
}
}else if (descr_value == 0x0002){
if (b_property & ESP_GATT_CHAR_PROP_BIT_INDICATE){
ESP_LOGI(BT_BLE_COEX_TAG, "indicate enable");
uint8_t indicate_data[15];
for (int i = 0; i < sizeof(indicate_data); ++i)
{
indicate_data[i] = i%0xff;
}
//the size of indicate_data[] need less than MTU size
esp_ble_gatts_send_indicate(gatts_if, param->write.conn_id, gl_profile_tab[PROFILE_B_APP_ID].char_handle,
sizeof(indicate_data), indicate_data, true);
}
}
else if (descr_value == 0x0000){
ESP_LOGI(BT_BLE_COEX_TAG, "notify/indicate disable ");
}else{
ESP_LOGE(BT_BLE_COEX_TAG, "unknown value");
}
}
}
example_write_event_env(gatts_if, &b_prepare_write_env, param);
break;
}
case ESP_GATTS_EXEC_WRITE_EVT:
ESP_LOGI(BT_BLE_COEX_TAG,"ESP_GATTS_EXEC_WRITE_EVT");
esp_ble_gatts_send_response(gatts_if, param->write.conn_id, param->write.trans_id, ESP_GATT_OK, NULL);
example_exec_write_event_env(&b_prepare_write_env, param);
break;
case ESP_GATTS_MTU_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ESP_GATTS_MTU_EVT, MTU %d", param->mtu.mtu);
break;
case ESP_GATTS_UNREG_EVT:
break;
case ESP_GATTS_CREATE_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "CREATE_SERVICE_EVT, status %d, service_handle %d", param->create.status, param->create.service_handle);
gl_profile_tab[PROFILE_B_APP_ID].service_handle = param->create.service_handle;
gl_profile_tab[PROFILE_B_APP_ID].char_uuid.len = ESP_UUID_LEN_16;
gl_profile_tab[PROFILE_B_APP_ID].char_uuid.uuid.uuid16 = GATTS_CHAR_UUID_B;
esp_ble_gatts_start_service(gl_profile_tab[PROFILE_B_APP_ID].service_handle);
b_property = ESP_GATT_CHAR_PROP_BIT_READ | ESP_GATT_CHAR_PROP_BIT_WRITE | ESP_GATT_CHAR_PROP_BIT_NOTIFY;
esp_err_t add_char_ret =esp_ble_gatts_add_char( gl_profile_tab[PROFILE_B_APP_ID].service_handle, &gl_profile_tab[PROFILE_B_APP_ID].char_uuid,
ESP_GATT_PERM_READ | ESP_GATT_PERM_WRITE,
b_property,
NULL, NULL);
if (add_char_ret){
ESP_LOGE(BT_BLE_COEX_TAG, "add char failed, error code = 0x%x",add_char_ret);
}
break;
case ESP_GATTS_ADD_INCL_SRVC_EVT:
break;
case ESP_GATTS_ADD_CHAR_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ADD_CHAR_EVT, status %d, attr_handle %d, service_handle %d",
param->add_char.status, param->add_char.attr_handle, param->add_char.service_handle);
gl_profile_tab[PROFILE_B_APP_ID].char_handle = param->add_char.attr_handle;
gl_profile_tab[PROFILE_B_APP_ID].descr_uuid.len = ESP_UUID_LEN_16;
gl_profile_tab[PROFILE_B_APP_ID].descr_uuid.uuid.uuid16 = ESP_GATT_UUID_CHAR_CLIENT_CONFIG;
esp_ble_gatts_add_char_descr(gl_profile_tab[PROFILE_B_APP_ID].service_handle, &gl_profile_tab[PROFILE_B_APP_ID].descr_uuid,
ESP_GATT_PERM_READ | ESP_GATT_PERM_WRITE,
NULL, NULL);
break;
case ESP_GATTS_ADD_CHAR_DESCR_EVT:
gl_profile_tab[PROFILE_B_APP_ID].descr_handle = param->add_char_descr.attr_handle;
ESP_LOGI(BT_BLE_COEX_TAG, "ADD_DESCR_EVT, status %d, attr_handle %d, service_handle %d",
param->add_char_descr.status, param->add_char_descr.attr_handle, param->add_char_descr.service_handle);
break;
case ESP_GATTS_DELETE_EVT:
break;
case ESP_GATTS_START_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "SERVICE_START_EVT, status %d, service_handle %d",
param->start.status, param->start.service_handle);
break;
case ESP_GATTS_STOP_EVT:
break;
case ESP_GATTS_CONNECT_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "CONNECT_EVT, conn_id %d, remote %02x:%02x:%02x:%02x:%02x:%02x:",
param->connect.conn_id,
param->connect.remote_bda[0], param->connect.remote_bda[1], param->connect.remote_bda[2],
param->connect.remote_bda[3], param->connect.remote_bda[4], param->connect.remote_bda[5]);
gl_profile_tab[PROFILE_B_APP_ID].conn_id = param->connect.conn_id;
break;
case ESP_GATTS_CONF_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ESP_GATTS_CONF_EVT status %d", param->conf.status);
if (param->conf.status != ESP_GATT_OK){
ESP_LOG_BUFFER_HEX(BT_BLE_COEX_TAG, param->conf.value, param->conf.len);
}
break;
case ESP_GATTS_DISCONNECT_EVT:
case ESP_GATTS_OPEN_EVT:
case ESP_GATTS_CANCEL_OPEN_EVT:
case ESP_GATTS_CLOSE_EVT:
case ESP_GATTS_LISTEN_EVT:
case ESP_GATTS_CONGEST_EVT:
default:
break;
}
}
static void gatts_event_handler(esp_gatts_cb_event_t event, esp_gatt_if_t gatts_if, esp_ble_gatts_cb_param_t *param)
{
/* If event is register event, store the gatts_if for each profile */
if (event == ESP_GATTS_REG_EVT) {
if (param->reg.status == ESP_GATT_OK) {
gl_profile_tab[param->reg.app_id].gatts_if = gatts_if;
} else {
ESP_LOGI(BT_BLE_COEX_TAG, "Reg app failed, app_id %04x, status %d",
param->reg.app_id,
param->reg.status);
return;
}
}
/* If the gatts_if equal to profile A, call profile A cb handler,
* so here call each profile's callback */
do {
int idx;
for (idx = 0; idx < PROFILE_NUM; idx++) {
if (gatts_if == ESP_GATT_IF_NONE || /* ESP_GATT_IF_NONE, not specify a certain gatt_if, need to call every profile cb function */
gatts_if == gl_profile_tab[idx].gatts_if) {
if (gl_profile_tab[idx].gatts_cb) {
gl_profile_tab[idx].gatts_cb(event, gatts_if, param);
}
}
}
} while (0);
}
static void ble_gatts_init(void)
{
esp_err_t ret = esp_ble_gatts_register_callback(gatts_event_handler);
if (ret){
ESP_LOGE(BT_BLE_COEX_TAG, "gatts register error, error code = 0x%x", ret);
return;
}
ret = esp_ble_gap_register_callback(gap_event_handler);
if (ret){
ESP_LOGE(BT_BLE_COEX_TAG, "gap register error, error code = 0x%x", ret);
return;
}
ret = esp_ble_gatts_app_register(PROFILE_A_APP_ID);
if (ret){
ESP_LOGE(BT_BLE_COEX_TAG, "gatts app register error, error code = 0x%x", ret);
return;
}
ret = esp_ble_gatts_app_register(PROFILE_B_APP_ID);
if (ret){
ESP_LOGE(BT_BLE_COEX_TAG, "gatts app register error, error code = 0x%x", ret);
return;
}
esp_err_t local_mtu_ret = esp_ble_gatt_set_local_mtu(500);
if (local_mtu_ret){
ESP_LOGE(BT_BLE_COEX_TAG, "set local MTU failed, error code = 0x%x", local_mtu_ret);
}
}
/********************************
* STATIC FUNCTION DECLARATIONS
*******************************/
/* GAP callback function */
static void bt_app_gap_cb(esp_bt_gap_cb_event_t event, esp_bt_gap_cb_param_t *param);
/* handler for bluetooth stack enabled events */
static void bt_av_hdl_stack_evt(uint16_t event, void *p_param);
/*******************************
* STATIC FUNCTION DEFINITIONS
******************************/
static void bt_app_gap_cb(esp_bt_gap_cb_event_t event, esp_bt_gap_cb_param_t *param)
{
switch (event) {
/* when authentication completed, this event comes */
case ESP_BT_GAP_AUTH_CMPL_EVT: {
if (param->auth_cmpl.stat == ESP_BT_STATUS_SUCCESS) {
ESP_LOGI(BT_BLE_COEX_TAG, "authentication success: %s", param->auth_cmpl.device_name);
ESP_LOG_BUFFER_HEX(BT_BLE_COEX_TAG, param->auth_cmpl.bda, ESP_BD_ADDR_LEN);
} else {
ESP_LOGE(BT_BLE_COEX_TAG, "authentication failed, status: %d", param->auth_cmpl.stat);
}
break;
}
#if (CONFIG_EXAMPLE_A2DP_SINK_SSP_ENABLED == true)
/* when Security Simple Pairing user confirmation requested, this event comes */
case ESP_BT_GAP_CFM_REQ_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ESP_BT_GAP_CFM_REQ_EVT Please compare the numeric value: %"PRIu32, param->cfm_req.num_val);
esp_bt_gap_ssp_confirm_reply(param->cfm_req.bda, true);
break;
/* when Security Simple Pairing passkey notified, this event comes */
case ESP_BT_GAP_KEY_NOTIF_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ESP_BT_GAP_KEY_NOTIF_EVT passkey: %"PRIu32, param->key_notif.passkey);
break;
/* when Security Simple Pairing passkey requested, this event comes */
case ESP_BT_GAP_KEY_REQ_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ESP_BT_GAP_KEY_REQ_EVT Please enter passkey!");
break;
#endif
/* when GAP mode changed, this event comes */
case ESP_BT_GAP_MODE_CHG_EVT:
ESP_LOGI(BT_BLE_COEX_TAG, "ESP_BT_GAP_MODE_CHG_EVT mode: %d", param->mode_chg.mode);
break;
/* others */
default: {
ESP_LOGI(BT_BLE_COEX_TAG, "event: %d", event);
break;
}
}
}
static void bt_av_hdl_stack_evt(uint16_t event, void *p_param)
{
ESP_LOGD(BT_BLE_COEX_TAG, "%s event: %d", __func__, event);
switch (event) {
/* when do the stack up, this event comes */
case BT_APP_EVT_STACK_UP: {
esp_bt_gap_set_device_name(BTDM_DEVICE_NAME);
esp_ble_gap_set_device_name(BTDM_DEVICE_NAME);
esp_bt_gap_register_callback(bt_app_gap_cb);
assert(esp_avrc_ct_init() == ESP_OK);
esp_avrc_ct_register_callback(bt_app_rc_ct_cb);
assert(esp_avrc_tg_init() == ESP_OK);
esp_avrc_tg_register_callback(bt_app_rc_tg_cb);
esp_avrc_rn_evt_cap_mask_t evt_set = {0};
esp_avrc_rn_evt_bit_mask_operation(ESP_AVRC_BIT_MASK_OP_SET, &evt_set, ESP_AVRC_RN_VOLUME_CHANGE);
assert(esp_avrc_tg_set_rn_evt_cap(&evt_set) == ESP_OK);
assert(esp_a2d_sink_init() == ESP_OK);
esp_a2d_register_callback(&bt_app_a2d_cb);
esp_a2d_sink_register_data_callback(bt_app_a2d_data_cb);
/* Get the default value of the delay value */
esp_a2d_sink_get_delay_value();
/* set discoverable and connectable mode, wait to be connected */
esp_bt_gap_set_scan_mode(ESP_BT_CONNECTABLE, ESP_BT_GENERAL_DISCOVERABLE);
break;
}
/* others */
default:
ESP_LOGE(BT_BLE_COEX_TAG, "%s unhandled event: %d", __func__, event);
break;
}
}
/*******************************
* MAIN ENTRY POINT
******************************/
void app_main(void)
{
/* initialize NVS it is used to store PHY calibration data */
esp_err_t err = nvs_flash_init();
if (err == ESP_ERR_NVS_NO_FREE_PAGES || err == ESP_ERR_NVS_NEW_VERSION_FOUND) {
ESP_ERROR_CHECK(nvs_flash_erase());
err = nvs_flash_init();
}
ESP_ERROR_CHECK(err);
esp_bt_controller_config_t bt_cfg = BT_CONTROLLER_INIT_CONFIG_DEFAULT();
if ((err = esp_bt_controller_init(&bt_cfg)) != ESP_OK) {
ESP_LOGE(BT_BLE_COEX_TAG, "%s initialize controller failed: %s", __func__, esp_err_to_name(err));
return;
}
if ((err = esp_bt_controller_enable(ESP_BT_MODE_BTDM)) != ESP_OK) {
ESP_LOGE(BT_BLE_COEX_TAG, "%s enable controller failed: %s", __func__, esp_err_to_name(err));
return;
}
esp_bluedroid_config_t bluedroid_cfg = BT_BLUEDROID_INIT_CONFIG_DEFAULT();
#if (CONFIG_EXAMPLE_A2DP_SINK_SSP_ENABLED == false)
bluedroid_cfg.ssp_en = false;
#endif
if ((err = esp_bluedroid_init_with_cfg(&bluedroid_cfg)) != ESP_OK) {
ESP_LOGE(BT_BLE_COEX_TAG, "%s initialize bluedroid failed: %s", __func__, esp_err_to_name(err));
return;
}
if ((err = esp_bluedroid_enable()) != ESP_OK) {
ESP_LOGE(BT_BLE_COEX_TAG, "%s enable bluedroid failed: %s", __func__, esp_err_to_name(err));
return;
}
#if (CONFIG_EXAMPLE_A2DP_SINK_SSP_ENABLED == true)
/* set default parameters for Secure Simple Pairing */
esp_bt_sp_param_t param_type = ESP_BT_SP_IOCAP_MODE;
esp_bt_io_cap_t iocap = ESP_BT_IO_CAP_IO;
esp_bt_gap_set_security_param(param_type, &iocap, sizeof(uint8_t));
#endif
/* set default parameters for Legacy Pairing (use fixed pin code 1234) */
esp_bt_pin_type_t pin_type = ESP_BT_PIN_TYPE_FIXED;
esp_bt_pin_code_t pin_code;
pin_code[0] = '1';
pin_code[1] = '2';
pin_code[2] = '3';
pin_code[3] = '4';
esp_bt_gap_set_pin(pin_type, 4, pin_code);
bt_app_task_start_up();
/* bluetooth device name, connection mode and profile set up */
bt_app_work_dispatch(bt_av_hdl_stack_evt, BT_APP_EVT_STACK_UP, NULL, 0, NULL);
/* gatt server init */
ble_gatts_init();
}
```
|
Kenneth Yen (; 23 May 1965 – 3 December 2018) was a Taiwanese entrepreneur who was listed as one of the richest people in the world.
Biography
Yen was born in Taipei, Taiwan to 嚴慶齡 and 吳舜文 Vivian Shun-wen Wu. He attended secondary school at in Taipei's Muzha District and later went to boarding school at The Pennington School. He attended Rider University in the United States where he studied business administration. He also received an honorary business degree from St. John's University. In 1986, he returned to Taiwan to lead the China Motor Corporation and Yulon, his family's business. Yen was officially named chairman of Yulon in August 2007. According to Forbes magazine, he had an estimated net worth of US$1.05 billion.
Personal life
Yen had one daughter, Michelle, and a son, John, with wife . He died of esophageal cancer at Taipei Veterans General Hospital on 3 December 2018.
References
1965 births
2018 deaths
Businesspeople from Taipei
Taiwanese billionaires
Rider University alumni
The Pennington School alumni
Deaths from esophageal cancer
Deaths from cancer in Taiwan
|
```hcl
inputs = {
timecmp1 = timecmp("2017-11-22T00:00:00Z", "2017-11-22T00:00:00Z")
timecmp2 = timecmp("2017-11-22T00:00:00Z", "2017-11-22T01:00:00+01:00")
timecmp3 = timecmp("2017-11-22T00:00:01Z", "2017-11-22T01:00:00+01:00")
timecmp4 = timecmp("2017-11-22T01:00:00Z", "2017-11-22T00:59:00-01:00")
timecmp5 = timecmp("2017-11-22T01:00:00+01:00", "2017-11-22T01:00:00-01:00")
timecmp6 = timecmp("2017-11-22T01:00:00-01:00", "2017-11-22T01:00:00+01:00")
}
```
|
Scoot is a low-cost airline in Singapore.
Scoot or skoot may also refer to:
SCOOT (bus service), a shuttle service in California
Scoot (EP), a 1997 EP album
Skoot (ship)
Scoot McNairy (born 1977), American actor and producer
Scoot Networks, an American company which provides public electric scooter sharing systems
Split Cycle Offset Optimisation Technique, a traffic control system
SKØØT, a streetwear label designed by MLMA
See also
Scooter (disambiguation)
|
```java
//your_sha256_hash--------------------------------//
// //
// H e a d L i n k e r //
// //
//your_sha256_hash--------------------------------//
// <editor-fold defaultstate="collapsed" desc="hdr">
//
//
// This program is free software: you can redistribute it and/or modify it under the terms of the
//
// This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
// without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
//
// program. If not, see <path_to_url
//your_sha256_hash--------------------------------//
// </editor-fold>
package org.audiveris.omr.sheet.stem;
import org.audiveris.omr.glyph.Glyph;
import org.audiveris.omr.glyph.GlyphGroup;
import org.audiveris.omr.glyph.Glyphs;
import org.audiveris.omr.glyph.Grades;
import org.audiveris.omr.glyph.Shape;
import org.audiveris.omr.glyph.dynamic.SectionCompound;
import org.audiveris.omr.image.ImageUtil;
import org.audiveris.omr.lag.DynamicSection;
import org.audiveris.omr.lag.Section;
import org.audiveris.omr.lag.Sections;
import org.audiveris.omr.math.GeoOrder;
import org.audiveris.omr.math.GeoUtil;
import org.audiveris.omr.math.LineUtil;
import org.audiveris.omr.math.PointUtil;
import org.audiveris.omr.math.Rational;
import org.audiveris.omr.run.Orientation;
import org.audiveris.omr.run.Run;
import org.audiveris.omr.sheet.Profiles;
import org.audiveris.omr.sheet.Scale;
import org.audiveris.omr.sheet.SheetStub;
import org.audiveris.omr.sheet.SystemInfo;
import org.audiveris.omr.sheet.stem.BeamLinker.BLinker;
import org.audiveris.omr.sheet.stem.HeadLinker.SLinker.CLinker;
import org.audiveris.omr.sheet.stem.StemItem.GapItem;
import org.audiveris.omr.sheet.stem.StemItem.GlyphItem;
import org.audiveris.omr.sheet.stem.StemItem.LinkerItem;
import org.audiveris.omr.sig.SIGraph;
import org.audiveris.omr.sig.inter.AbstractBeamInter;
import org.audiveris.omr.sig.inter.BeamGroupInter;
import org.audiveris.omr.sig.inter.HeadInter;
import org.audiveris.omr.sig.inter.Inter;
import org.audiveris.omr.sig.inter.Inters;
import org.audiveris.omr.sig.inter.StemInter;
import org.audiveris.omr.sig.relation.BeamStemRelation;
import org.audiveris.omr.sig.relation.HeadStemRelation;
import org.audiveris.omr.sig.relation.Relation;
import static org.audiveris.omr.ui.symbol.Alignment.TOP_LEFT;
import org.audiveris.omr.ui.symbol.FontSymbol;
import org.audiveris.omr.ui.symbol.MusicFamily;
import org.audiveris.omr.ui.util.UIUtil;
import org.audiveris.omr.util.HorizontalSide;
import org.audiveris.omr.util.Navigable;
import org.audiveris.omr.util.VerticalSide;
import static org.audiveris.omr.util.VerticalSide.BOTTOM;
import static org.audiveris.omr.util.VerticalSide.TOP;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import java.awt.AlphaComposite;
import java.awt.Color;
import java.awt.Graphics2D;
import java.awt.Point;
import java.awt.Rectangle;
import java.awt.geom.AffineTransform;
import java.awt.geom.Area;
import java.awt.geom.Line2D;
import java.awt.geom.Path2D;
import java.awt.geom.Point2D;
import java.awt.geom.Rectangle2D;
import java.awt.image.BufferedImage;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.EnumMap;
import java.util.EnumSet;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
/**
* Class <code>HeadLinker</code> handles the connections from a head to nearby stems,
* processing the four corners around head.
* <p>
* We have to handle the case where stem pixels between a head and a compatible beam are reduced
* to almost nothing because of poor image quality.
* In this case, we may have no concrete stem inter candidate available, and thus have to
* directly inspect the rather vertical segment area between head reference point and potential
* beam, looking for a few pixels there.
* <ol>
* <li>For every head, we look for one connectable stem seed at LEFT_STEM anchor and one connectable
* stem seed at RIGHT_STEM anchor.
* <li>When no <b>seed</b> can be connected on one head side, we build a head <b>stump</b> there
* from suitable section(s) near head anchor.
* <li>From now on, the seed or the stump will be considered by stem candidates as the head portion
* to connect to.
* </ol>
* Nota: For stem-connected head shapes, stem connection points vary:
* <ul>
* <li>For oval, circle-x, diamond: bottom left stem and top right stem,
* <li>For triangle: top left stem and top right stem,
* <li>For cross: top left stem and bottom left stem, top right stem and bottom right stem which
* means two different ordinates for each horizontal side.
* </ul>
*
* @author Herv Bitteur
*/
public class HeadLinker
{
//~ Static fields/initializers your_sha256_hash-
private static final Logger logger = LoggerFactory.getLogger(HeadLinker.class);
//~ Instance fields your_sha256_hash------------
/** The head being processed. */
@Navigable(false)
private final HeadInter head;
/** Head bounding box. */
private final Rectangle headBox;
/** All beams and hooks interpretations in head vicinity (in no particular order). */
private final List<Inter> neighborBeams;
/** All stems seeds in head vicinity. */
private final Set<Glyph> neighborSeeds;
/** Side linkers. */
private final Map<HorizontalSide, SLinker> sLinkers = new EnumMap<>(HorizontalSide.class);
// System-level information
// ------------------------
@Navigable(false)
private final StemsRetriever retriever;
@Navigable(false)
private final SIGraph sig;
@Navigable(false)
private final SystemInfo system;
@Navigable(false)
private final Scale scale;
private final StemsRetriever.Parameters params;
//~ Constructors your_sha256_hash---------------
/**
* Creates a new <code>HeadLinker</code> object.
*
* @param head the head inter to link
* @param retriever the driving system-level StemsRetriever
*/
public HeadLinker (HeadInter head,
StemsRetriever retriever)
{
this.head = head;
this.retriever = retriever;
headBox = head.getBounds();
sig = head.getSig();
system = sig.getSystem();
scale = system.getSheet().getScale();
params = retriever.getParams();
neighborBeams = retriever.getNeighboringInters(retriever.getSystemBeams(), headBox);
neighborSeeds = retriever.getNeighboringSeeds(headBox);
for (HorizontalSide hSide : HorizontalSide.values()) {
sLinkers.put(hSide, new SLinker(hSide));
}
}
//~ Methods your_sha256_hash--------------------
//-----------------//
// getCornerLinker //
//-----------------//
public CLinker getCornerLinker (HorizontalSide hSide,
VerticalSide vSide)
{
return sLinkers.get(hSide).getCornerLinker(vSide);
}
//-------------//
// getSLinkers //
//-------------//
/**
* Report the two side linkers.
*
* @return the hSide Linkers
*/
public Map<HorizontalSide, SLinker> getSLinkers ()
{
return sLinkers;
}
//-----------------//
// inspectCLinkers //
//-----------------//
/**
* Inspect head on all corners.
*/
public void inspectCLinkers ()
{
if (head.isVip()) {
logger.info("VIP {} inspectCLinkers", this);
}
final int stemProfile = system.getSheet().getStub().getProfile();
// Look for targets in all corners
for (HeadCorner corner : HeadCorner.values()) {
sLinkers.get(corner.hSide).cLinkers.get(corner.vSide).inspect(stemProfile);
}
}
//--------------//
// isRatherGood //
//--------------//
/**
* A rather good head for which at least connection should be found.
*
* @param head the head at stake
* @return true if rather good
*/
private boolean isRatherGood (HeadInter head)
{
return head.getGrade() >= Grades.ratherGoodHeadGrade;
}
//-----------//
// linkSides //
//-----------//
/**
* Try to link head on both horizontal sides.
* <p>
* When this method is called, linking from beams to related (stems and) heads has already been
* done.
* What is left is the linking of:
* <ul>
* <li>Heads <b>related to beam</b> but for which there was no beam stump and the head was not
* located on beam side, hence there has been no attempt to link head starting from the beam.
* Starting from such heads, the beam is a hard target.
* <li>Heads <b>not related to beam</b>.
* For these heads, we'll try to reach the typical stem length as a soft target.
* </ul>
* <p>
* This method is called on each and every head not yet linked from a beam.
* Using higher and higher profiles, on left and right head sides, we check both top and bottom
* CLinker's:
* <ol>
* <li>If no significant length is found on either top or bottom, we consider no link can be
* found on this horizontal side of head.
* <li>If top <b>or</b> bottom (exclusively) exhibits a significant length, then a link can be
* searched on the vertical direction found.
* <li>If both top <b>and</b> bottom exhibit a significant length, then this head is assumed to
* be located within a longer "column of heads".
* No link is searched for this head, we expect that either the starting or the terminating head
* of the column will fall in the case 2 above.
* This head horizontal side is recorded in the 'undefs' collection of undefined heads, to be
* later checked when all other attempts have been made.
* </ol>
* <p>
* Policies:
* <ul>
* <li>A <b>rather good</b> head should have at least one corner connection.
* <li>
* A <b>void</b> head linked (to a stem) to a <b>beam</b> should have a connection on the
* opposite corner.
* </ul>
*
* @param stemProfile desired profile level for stem
* @param linkProfile global profile for links
* @param undefs (output) populated with undefined head sides
* @param append true for appending to already linked heads
* @return true if linked
*/
public boolean linkSides (int stemProfile,
int linkProfile,
LinkedHashMap<Inter, Set<HorizontalSide>> undefs,
boolean append)
{
if (head.isVip()) {
logger.info(
"VIP {} linkSides sp:{} lp:{} append:{}",
this,
stemProfile,
linkProfile,
append);
}
boolean linked = false;
for (HorizontalSide hSide : HorizontalSide.values()) {
final SLinker sLinker = sLinkers.get(hSide);
if (sLinker.isLinked()) {
linked = true;
continue;
}
if (!append && sLinker.isClosed()) {
continue;
}
// Check top and bottom cLinker's
final CLinker clTop = sLinker.getCornerLinker(TOP);
final boolean topOk = clTop.canLink(stemProfile, append);
final CLinker clBot = sLinker.getCornerLinker(BOTTOM);
final boolean botOk = clBot.canLink(stemProfile, append);
if (head.isVip()) {
logger.info(
"VIP {} stemProfile:{} top:{} bottom:{}",
sLinker,
stemProfile,
topOk,
botOk);
}
if (topOk) {
if (!botOk) {
if (clTop.link(stemProfile, linkProfile, append)) {
logger.debug("{} linked", clTop);
linked = true;
}
} else {
// Here, there seems to be potential connections on both vertical sides
// So, stop processing this head immediately for both horizontal sides
// But stay open to a link coming later (from above or below)
Set<HorizontalSide> hSides = undefs.get(head);
if (hSides == null) {
undefs.put(head, hSides = EnumSet.noneOf(HorizontalSide.class));
}
hSides.add(hSide);
return false;
}
} else if (botOk) {
if (clBot.link(stemProfile, linkProfile, append)) {
logger.debug("{} linked", clBot);
linked = true;
}
}
}
if (!linked) {
// Retry with higher profile?
if (isRatherGood(head) && (stemProfile < Profiles.RATHER_GOOD_HEAD)) {
if (head.isVip()) {
logger.info("VIP {} ratherGood", this);
}
return linkSides(++stemProfile, linkProfile, undefs, append);
} else {
for (SLinker sLinker : sLinkers.values()) {
sLinker.setClosed(true);
}
return false;
}
} else {
// Close linked SLinker, except for this starting head
for (SLinker sLinker : sLinkers.values()) {
if (sLinker.isLinked()) {
for (Relation rel : sig.getRelations(head, HeadStemRelation.class)) {
final StemInter stem = (StemInter) sig.getOppositeInter(head, rel);
for (Relation r : sig.getRelations(stem, HeadStemRelation.class)) {
final HeadInter h = (HeadInter) sig.getOppositeInter(stem, r);
if (h != head) {
for (SLinker sl : h.getLinker().sLinkers.values()) {
sl.setClosed(true);
}
}
}
}
}
}
return true;
}
}
//----------//
// toString //
//----------//
@Override
public String toString ()
{
return new StringBuilder(getClass().getSimpleName()).append("{head#").append(head.getId())
.append('}').toString();
}
//~ Static Methods your_sha256_hash-------------
//------------------//
// lookupBeamGroups //
//------------------//
/**
* Look for (groups of) beam interpretations.
*
* @param beams provided collection of candidate beams
* @param refPt starting reference point
* @param yDir vertical direction from reference point
* @param minBeamHeadDy minimum vertical distance between head and beam
* @return the list of groups, ordered by distance from head
*/
public static List<BeamGroupInter> lookupBeamGroups (List<Inter> beams,
Point2D refPt,
int yDir,
int minBeamHeadDy)
{
if (beams.isEmpty()) {
return Collections.emptyList();
}
final double slope = beams.get(0).getSig().getSystem().getSheet().getSkew().getSlope();
// Reject beam candidates which are not in corner direction
// (this can happen because of beam bounding rectangle)
for (Iterator<Inter> it = beams.iterator(); it.hasNext();) {
final AbstractBeamInter b = (AbstractBeamInter) it.next();
final Line2D limit = b.getBorder(VerticalSide.of(-yDir));
if ((yDir * (StemsRetriever.getTargetPt(refPt, limit, slope).getY() - refPt
.getY())) <= 0) {
it.remove();
}
}
StemsRetriever.sortBeamsFromRef(refPt, yDir, beams);
// Build the (ordered) list of beam groups
Set<BeamGroupInter> groups = new LinkedHashSet<>();
for (Inter inter : beams) {
AbstractBeamInter beam = (AbstractBeamInter) inter;
if (groups.isEmpty()) {
// Check if beam is far enough from head
final Line2D limit = beam.getBorder(VerticalSide.of(-yDir));
final Point2D beamPt = StemsRetriever.getTargetPt(refPt, limit, slope);
final double distToBeam = yDir * (beamPt.getY() - refPt.getY());
if (distToBeam < minBeamHeadDy) {
continue;
}
}
groups.add(beam.getGroup());
}
return new ArrayList<>(groups);
}
//
// //------------------//
// // saveHeadVicinity //
// //------------------//
// /**
// * An attempt to check usable chunks in head vicinity.
// * <p>
// * We erase head glyph before looking for suitable vertical sections as stem chunks.
// */
// private void saveHeadVicinity ()
// {
// final Sheet sheet = head.getSig().getSystem().getSheet();
// final ByteProcessor noStaff = sheet.getPicture().getSource(NO_STAFF);
// final Rectangle bounds = head.getBounds();
// final Rectangle box = new Rectangle(bounds);
//
// final int interline = sheet.getInterline();
// box.grow(interline, 2 * interline);
// final Point offset = box.getLocation();
//
// noStaff.setRoi(box);
// final ByteProcessor bp = (ByteProcessor) noStaff.crop();
// noStaff.resetRoi();
//
// // Erase head glyph pixels
// final Glyph headGlyph = head.getGlyph();
// for (int y = 0; y < box.height; y++) {
// for (int x = 0; x < box.width; x++) {
// final Point p = new Point(offset.x + x, offset.y + y);
// if (headGlyph.contains(p)) {
// bp.putPixel(x, y, 255);
//// bp.putPixel(x - 1, y, 255);
//// bp.putPixel(x + 1, y, 255);
// }
// }
// }
//
// final int zoom = 20;
// final BufferedImage img = new BufferedImage(zoom * box.width,
// zoom * box.height,
// BufferedImage.TYPE_INT_RGB);
// final Graphics2D g = img.createGraphics();
// final AffineTransform at = AffineTransform.getScaleInstance(zoom, zoom);
// g.drawImage(bp.getBufferedImage(), at, null);
//
// ImageUtil.saveOnDisk(img, sheet.getStub().getId(), "head#" + head.getId());
// }
//
//~ Inner Classes your_sha256_hash--------------
//---------//
// SLinker //
//---------//
/**
* Head side linker to handle connection on one head side to suitable stem(s).
*/
public class SLinker
extends StemLinker
{
/** Head side considered for stem. */
@Navigable(false)
private final HorizontalSide hSide;
/** Direction of abscissa values when going away from head. */
private final int xDir;
/** Top and bottom corner linkers. */
private final Map<VerticalSide, CLinker> cLinkers = new EnumMap<>(VerticalSide.class);
/** Has been successfully linked. */
private boolean linked;
/** Has been closed (no more link attempt). */
private boolean closed;
/**
* Creates a <code>SLinker</code> object and populates head side stump.
*
* @param hSide dedicated head horizontal side
*/
public SLinker (HorizontalSide hSide)
{
this.hSide = hSide;
xDir = hSide.direction();
for (VerticalSide vSide : VerticalSide.values()) {
cLinkers.put(vSide, new CLinker(vSide));
}
}
//-----------------//
// getCornerLinker //
//-----------------//
public CLinker getCornerLinker (VerticalSide vSide)
{
return cLinkers.get(vSide);
}
//----------------//
// getHalfLinkers //
//----------------//
@Override
public Collection<? extends StemHalfLinker> getHalfLinkers ()
{
return cLinkers.values();
}
//---------//
// getHead //
//---------//
/**
* Report the underlying head.
*
* @return the head
*/
public HeadInter getHead ()
{
return head;
}
//-------------------//
// getHorizontalSide //
//-------------------//
/**
* Report the horizontal side with respect to head
*
* @return hSide
*/
public HorizontalSide getHorizontalSide ()
{
return hSide;
}
@Override
public String getId ()
{
final StringBuilder sb = new StringBuilder();
sb.append("head#").append(head.getId()).append("-Slnk-").append(hSide.name().charAt(0));
return sb.toString();
}
@Override
public Point2D getReferencePoint ()
{
throw new UnsupportedOperationException(
"Not supported. Use CLinker ref point instead.");
}
//-----------//
// getSource //
//-----------//
@Override
public HeadInter getSource ()
{
return head;
}
@Override
public Glyph getStump ()
{
throw new UnsupportedOperationException("Not supported. Use CLinker stump instead.");
}
//----------//
// isClosed //
//----------//
@Override
public boolean isClosed ()
{
return closed;
}
//----------//
// isLinked //
//----------//
@Override
public boolean isLinked ()
{
return linked;
}
//-----------//
// setClosed //
//-----------//
@Override
public void setClosed (boolean closed)
{
this.closed = closed;
}
//-----------//
// setLinked //
//-----------//
@Override
public void setLinked (boolean linked)
{
this.linked = linked;
}
//----------//
// toString //
//----------//
@Override
public String toString ()
{
final StringBuilder asb = new StringBuilder(getClass().getSimpleName()).append('{')
.append(getId());
return asb.append('}').toString();
}
//---------//
// CLinker //
//---------//
/**
* Head corner linker to handle head to stem links in a given corner of the head.
*/
public class CLinker
extends StemHalfLinker
{
/** Vertical side from head to beam/tail. */
@Navigable(false)
private final VerticalSide vSide;
/** Direction of ordinates when going away from head. */
private final int yDir;
/** The head reference point for this head corner. */
private final Point2D refPt;
/** Max outside point. */
private final Point2D outPt;
/** Max inside point. */
private final Point2D inPt;
/** The stump or seed on this head corner, if any. */
private final Glyph stump;
/** The distant target point for the stem. (stem opposite end of refPt) */
private final Point2D targetPt;
/** The look up area for the corner. */
private Area luArea;
/** The stems seeds found in the corner. */
private List<Glyph> seeds;
/** The theoretical line from head. */
private Line2D theoLine;
/** Ordinate range between refPt and limit. */
private final Rectangle yRange;
private final List<BeamGroupInter> beamGroups;
/** Targeted beam if any in this corner. */
private AbstractBeamInter targetBeam;
/** Items sequence. */
private StemBuilder sb;
public CLinker (VerticalSide vSide)
{
this.vSide = vSide;
yDir = vSide.direction();
if (head.isVip()) {
logger.info("<CLinker> {} {}", head.getId(), cName());
}
refPt = head.getStemReferencePoint(hSide, vSide);
outPt = getOutPoint();
inPt = getInPoint();
stump = retrieveStump();
luArea = buildLuArea(null); // This also computes theoLine
// Look for beams and beam hooks in the corner
List<Inter> beamCandidates = Inters.intersectedInters(
neighborBeams,
GeoOrder.BY_ABSCISSA,
luArea);
// Look for suitable beam groups
beamGroups = lookupBeamGroups(beamCandidates);
// Compute target end of stem using either system limit
// or beam group limit if such beam group intersects the theoretical Line.
targetPt = computeTargetPoint(beamGroups);
theoLine.setLine(refPt, targetPt);
yRange = getYRange(targetPt.getY());
}
//-------------//
// buildLuArea //
//-------------//
/**
* Define the lookup area on given corner, based on head reference point
* and provided area horizontal limit if any.
* <p>
* Global slope is used (plus and minus slopeMargin).
* <p>
* Side effect: compute theoLine
*
* @param limit rather horizontal limit for the area, or null to use part limit
* @return the lookup area
*/
private Area buildLuArea (Line2D limit)
{
// Beware: vertical slope is the opposite of sheet slope
final double slope = -system.getSheet().getSkew().getSlope();
final double dSlope = xDir * yDir * params.slopeMargin;
// Look-up path, start by head horizontal segment
final Path2D lu = new Path2D.Double();
lu.moveTo(outPt.getX(), outPt.getY());
lu.lineTo(inPt.getX(), inPt.getY());
// Then segment away from head
final double yLimit;
if (limit == null) {
// Use part limit
final Rectangle partBox = head.getStaff().getPart().getAreaBounds();
yLimit = (yDir > 0) ? partBox.y + partBox.height - 1 : partBox.y;
} else {
// Use provided (beam) limit
yLimit = LineUtil.yAtX(limit, refPt.getX());
}
final double dy = yLimit - outPt.getY();
lu.lineTo(inPt.getX() + ((slope - dSlope) * dy), yLimit);
lu.lineTo(outPt.getX() + ((slope + dSlope) * dy), yLimit);
lu.closePath();
// Attachment
head.addAttachment(cName(), lu);
// Compute theoLine
theoLine = retriever.getTheoreticalLine(refPt, yLimit);
head.addAttachment("theo-" + cName(), theoLine);
return new Area(lu);
}
//------------//
// buildStump //
//------------//
/**
* Build the head stump for this horizontal side, using sections around the
* stem reference point.
* <p>
* We consider only vertical sections around the refPt
*
* @return the stump glyph, perhaps null
*/
private Glyph buildStump ()
{
if (head.isVip()) {
logger.info("VIP {} buildStump", this);
}
final List<Section> sections = new ArrayList<>(
Sections.intersectedSections(getStumpArea(), system.getVerticalSections()));
// Sort by horizontal distance of section area center WRT refPt
Collections.sort(
sections,
(s1,
s2) -> Double.compare(
Math.abs(s1.getAreaCenter().getX() - refPt.getX()),
Math.abs(s2.getAreaCenter().getX() - refPt.getX())));
if (sections.isEmpty()) {
return null;
}
// Pick up first section if any which contains refPt
final SectionCompound compound = new SectionCompound();
final Point p = new Point((int) refPt.getX(), (int) refPt.getY());
for (Section section : sections) {
if (section.contains(p)) {
compound.addSection(section);
break;
}
}
// Then include sections as much as possible
for (Section s : sections) {
compound.addSection(s);
if (compound.getWidth() > params.mainStemThickness) {
compound.removeSection(s);
}
}
if (compound.getWeight() == 0) {
// This can occur when we have a single section, but too wide
// so, we pickup a few runs of the section, around refPt abscissa
// This can occur also if no section was kept
logger.debug("{} nothing kept from {}", this, Sections.ids(sections));
Section subSection = getSubSection(sections.get(0));
if (subSection.getWeight() == 0) {
return null;
}
compound.addSection(subSection);
}
Glyph stumpGlyph = compound.toGlyph(GlyphGroup.STUMP);
stumpGlyph = system.getSheet().getGlyphIndex().registerOriginal(stumpGlyph);
logger.debug("{} {}", this, stumpGlyph);
if (standsOut(stumpGlyph)) {
if (StemBuilder.saveConnections() && head.isVip()) {
StemBuilder.saveConnection(this, stumpGlyph, null);
}
return stumpGlyph;
} else {
return null;
}
}
//---------//
// canLink //
//---------//
/**
* Report whether we can link from this CLinker, based on its StemBuilder items
* and the provided stemProfile level.
*
* @param stemProfile provided level for stem profile
* @param append true to allow appending to already linked head
* @return true if possible
*/
public boolean canLink (int stemProfile,
boolean append)
{
// Check we have a long enough sequence of items
if (!sb.headHasLength(stemProfile)) {
return false;
}
// If we hit a close head, check if we can link with it or not
final int myIndex = sb.indexOf(this);
final CLinker cl = sb.getFirstCLinkerAfter(myIndex, stemProfile);
if (cl == null) {
return true;
}
if (!append && cl.isLinked()) {
return false;
}
// If there is no stem gap between these 2 heads, accept the link
final int icl = sb.indexOf(cl);
Integer gapIndex = null;
for (int i = myIndex + 1; i < icl; i++) {
if (sb.get(i) instanceof GapItem) {
gapIndex = i;
}
}
if (gapIndex == null) {
return true;
}
// Gap: let's check our own opposite corner
final CLinker myDiag = getCornerOpposite();
if (myDiag.hasConcreteStart(Profiles.STRICT)) {
// Use length just before gap
return sb.getLengthAt(gapIndex - 1) >= params.minLinkerLength;
}
// Gap: let's check other head corner in opposite horizontal side
final CLinker diag = cl.getSource().getLinker().getCornerLinker(
hSide.opposite(),
vSide);
if (diag.canLink(Profiles.STRICT, false)) {
// Use length just before gap
return sb.getLengthAt(gapIndex - 1) >= params.minLinkerLength;
}
return true;
}
//-------------------//
// checkStemRelation //
//-------------------//
public HeadStemRelation checkStemRelation (Line2D stemLine,
int profile)
{
return HeadStemRelation.checkRelation(head, stemLine, stump, vSide, scale, profile);
}
//-------//
// cName //
//-------//
/**
* Report corner name (TR, BL, TL or BR).
*
* @return corner name
*/
public final String cName ()
{
return "" + vSide.name().charAt(0) + hSide.name().charAt(0);
}
//--------------------//
// computeTargetPoint //
//--------------------//
/**
* Determine the target end point of stem.
* <p>
* This is based on part limit, unless a beam group intersects corner line, in which
* case the beam group farthest limit is used and the corner area truncated accordingly.
*
* @param beamGroups the relevant beam groups, ordered by distance from head
* @return the target stem end point
*/
private Point2D computeTargetPoint (List<BeamGroupInter> beamGroups)
{
if (!beamGroups.isEmpty()) {
// Find the first group which really intersects the theoretical line
for (BeamGroupInter group : beamGroups) {
// Order its beams by distance from head
final List<Inter> beams = group.getMembers();
retriever.sortBeamsFromRef(refPt, yDir, beams);
for (Inter bInter : beams) {
final AbstractBeamInter beam = (AbstractBeamInter) bInter;
final Line2D median = beam.getMedian();
// TODO: perhaps intersecting theoLine is too strict?
if (median.intersectsLine(theoLine)) {
if (head.getShape().isSmallHead()) {
// Exclude beam, stop just before group
AbstractBeamInter b = (AbstractBeamInter) beams.get(0);
final Line2D border = b.getBorder(vSide.opposite());
luArea = buildLuArea(border);
return getTargetPt(border);
} else {
// Select farthest beam in group
targetBeam = (AbstractBeamInter) beams.get(beams.size() - 1);
final Line2D border = targetBeam.getBorder(vSide);
// Redefine lookup area
final double margin = targetBeam.getHeight(); // Should be enough
final Line2D limit = new Line2D.Double(
border.getX1(),
border.getY1() + yDir * margin,
border.getX2(),
border.getY2() + yDir * margin);
luArea = buildLuArea(limit);
return getTargetPt(border);
}
}
}
}
}
return theoLine.getP2();
}
//--------//
// expand //
//--------//
/**
* Expand current stem from head as much as possible.
* <p>
* This means until reachable beam group if any, otherwise until the stem free portion
* since last head reaches at least yHard (min length) and at best ySoft (target
* length).
*
* @param yHard hard target ordinate
* @param ySoft soft target ordinate
* @param stemProfile desired profile for inclusion of additional items
* @param linkProfile desired profile for head-stem linking
* @param relations (output) to be populated by head-stem and beam-stem relations
* @param glyphs (output) to be populated by glyphs that do compose the stem
* @return index of last item to pick, or -1 if failed
*/
private int expand (double yHard,
double ySoft,
int stemProfile,
int linkProfile,
Map<StemLinker, Relation> relations,
Set<Glyph> glyphs)
{
if (head.isVip()) {
logger.info("VIP {} expand {}", this, sb);
}
final double maxDx = params.maxLineGlyphDx; // Max dx to include a new glyph
double lastY = theoLine.getY1(); // Last ordinate reached so far
// Do we have a target beam?
BLinker bLinker = null;
final List<StemLinker> targets = sb.getTargetLinkers();
if (!targets.isEmpty()) {
final StemLinker last = targets.get(targets.size() - 1);
if (last instanceof BLinker) {
bLinker = (BLinker) last;
}
}
final Scale scale = system.getSheet().getScale();
final int maxIndex = sb.maxIndex();
final int maxYGap = retriever.getGapMap().get(stemProfile);
// Expand until a stop condition is met
// Stem tail length is measured from ordinate of last (good) head encountered
final Line2D stemLine = (yDir > 0) ? theoLine
: new Line2D.Double(theoLine.getP2(), theoLine.getP1());
for (int i = 0; i <= maxIndex; i++) {
final StemItem ev = sb.get(i);
if (ev instanceof GapItem) {
// Show-stopping gap?
if (ev.contrib > maxYGap) {
if (yDir * Double.compare(lastY, yHard) < 0) {
return -1; // We failed before hard length target
}
// No hard target missed, we just stop expansion before too large gap
return i - 1;
}
if (bLinker == null) {
// Soft target reached?
if (yDir * Double.compare(lastY, ySoft) >= 0) {
// We can stop here, but let's check for a plain glyph right after
if (i < maxIndex) {
final StemItem nextEv = sb.get(i + 1);
if (nextEv instanceof GlyphItem) {
if (updateStemLine(nextEv.glyph, glyphs, stemLine, maxDx)) {
return i + 1;
}
}
}
return i - 1;
}
}
} else if (ev instanceof LinkerItem
&& ((LinkerItem) ev).linker instanceof CLinker) {
// Head encountered
final CLinker cl = (CLinker) ((LinkerItem) ev).linker;
final HeadInter clHead = cl.getHead();
if (cl != this) {
// Gap close before head?
final GapItem gap = sb.getLastGapBefore(i);
if (gap != null) {
final double y = cl.getReferencePoint().getY();
final double dy = (yDir > 0) ? y - gap.line.getY2()
: gap.line.getY1() - y;
if (dy < params.minLinkerLength) {
// We include this coming head only if not tied on other vSide
final CLinker clOpp = clHead.getLinker().getCornerLinker(
cl.getSLinker().getHorizontalSide().opposite(),
vSide);
if (clOpp.hasConcreteStart(linkProfile)) {
logger.debug(
"{} separated from head#{}",
this,
clHead.getId());
return sb.indexOf(gap) - 1;
}
}
}
}
final HeadStemRelation hsRel = cl.checkStemRelation(stemLine, linkProfile);
if (hsRel == null) {
continue;
}
relations.put(cl, hsRel);
updateStemLine(ev.glyph, glyphs, stemLine, null);
// Check that resulting contextual head grade is sufficient
// to reset stem free soft portion at this head ordinate
final double cg = retriever.getMaxHeadContextualGrade(cl.getHead(), hsRel);
if (cg >= Grades.minContextualGrade) {
final double cly = cl.getReferencePoint().getY();
ySoft = cly + yDir * params.bestStemTailLg;
// // Allow to push yHard to include new segments
// // But, if last segment fails, we should step back to the last good one
// if (stemProfile < Profiles.MAX_VALUE) {
// final double yHardNew = cly + yDir * params.minStemTailLg;
//
// if (yDir * Double.compare(yHardNew, yHard) > 0) {
// yHard = yHardNew;
// }
// }
}
} else if (ev instanceof LinkerItem
&& ((LinkerItem) ev).linker instanceof BLinker) {
// Beam encountered
final BLinker bl = (BLinker) ((LinkerItem) ev).linker;
final AbstractBeamInter beam = bl.getSource();
updateStemLine(ev.glyph, glyphs, stemLine, null);
final BeamStemRelation bsRel = BeamStemRelation.checkRelation(
beam,
stemLine,
vSide,
scale,
stemProfile);
relations.put(bl, bsRel);
// If there are other reachable beams in the same beam group,
// then let's keep on going to link them too
boolean stop = true;
final BeamGroupInter group = beam.getGroup();
for (int j = i + 1; j <= maxIndex; j++) {
final StemItem ev2 = sb.get(i);
if (ev2 instanceof LinkerItem
&& ((LinkerItem) ev2).linker instanceof BLinker) {
final BLinker bl2 = (BLinker) ((LinkerItem) ev2).linker;
final AbstractBeamInter beam2 = bl2.getSource();
if (beam2.getGroup() == group) {
stop = false;
}
break;
}
}
if (stop) {
return i;
}
} else if (ev instanceof GlyphItem) {
// Plain glyph encountered
// Check compatibility with existing stem line
if (!updateStemLine(ev.glyph, glyphs, stemLine, maxDx)) {
return i - 1;
}
}
if (!(ev instanceof GapItem) && (ev != null) && (ev.line != null)) {
lastY = (yDir > 0) ? Math.max(lastY, ev.line.getY2())
: Math.min(lastY, ev.line.getY1());
}
}
// All items seen, check we have reached minimum of free tail length
if (yDir * Double.compare(lastY, yHard) < 0) {
return -1; // We failed before hard length target
}
// Check initial head-stem relation with final stemLine
final HeadStemRelation hsRel = this.checkStemRelation(stemLine, linkProfile);
if (hsRel == null) {
return -1;
}
relations.put(this, hsRel);
return maxIndex;
}
//------------//
// getContrib //
//------------//
/**
* Report the (vertical) contribution of a rectangle to the filling of white
* space above or below the head.
*
* @param box the rectangle to check
* @return the corresponding height within white space
*/
private int getContrib (Rectangle box)
{
return Math.max(0, GeoUtil.yOverlap(yRange, box));
}
//-------------------//
// getCornerOpposite //
//-------------------//
/**
* Report the CLinker that handles the opposite corner of this one.
*
* @return the corner-opposite CLinker
*/
public CLinker getCornerOpposite ()
{
return sLinkers.get(hSide.opposite()).getCornerLinker(vSide.opposite());
}
//----------------//
// getHalfLinkers //
//----------------//
@Override
public Collection<? extends StemHalfLinker> getHalfLinkers ()
{
return Collections.singleton(this);
}
//---------//
// getHead //
//---------//
public HeadInter getHead ()
{
return head;
}
//-------------------//
// getHorizontalSide //
//-------------------//
/**
* Report the horizontal side with respect to head
*
* @return hSide
*/
public HorizontalSide getHorizontalSide ()
{
return hSide;
}
//-------//
// getId //
//-------//
/**
* Report the corner ID.
*
* @return id
*/
@Override
public String getId ()
{
final StringBuilder sb = new StringBuilder();
sb.append("head#").append(head.getId()).append("-Clnk-").append(cName());
return sb.toString();
}
//------------//
// getInPoint //
//------------//
/**
* Report the reference point slightly translated to the interior of the head,
* to catch stem candidates.
*
* @return the inner refPt
*/
private Point2D getInPoint ()
{
return new Point2D.Double(refPt.getX() - (xDir * params.maxHeadInDx), refPt.getY());
}
//----------//
// getLimit //
//----------//
/**
* Report closer beam limit, according to corner vertical direction.
*
* @param beam the beam or hook of interest
* @return the top or bottom beam limit, according to dir
*/
private Line2D getLimit (AbstractBeamInter beam)
{
return beam.getBorder(vSide.opposite());
}
//---------------//
// getLookupArea //
//---------------//
@Override
public Area getLookupArea ()
{
return luArea;
}
//-------------//
// getOutPoint //
//-------------//
/**
* Report the reference point slightly translated to the exterior of the head,
* to catch stem candidates.
*
* @return the outer refPt
*/
private Point2D getOutPoint ()
{
return new Point2D.Double(
refPt.getX() + (xDir * params.maxHeadOutDx),
refPt.getY());
}
//-------------------//
// getReferencePoint //
//-------------------//
/**
* Report the head reference point for this corner.
*
* @return head corner reference point
*/
@Override
public Point2D getReferencePoint ()
{
return refPt;
}
//-------------//
// getSeedArea //
//-------------//
/**
* Define the lookup area on head corner for suitable stem seed.
*
* @return the seed lookup area
*/
private Area getSeedArea ()
{
final double dy = params.maxHeadSeedDy;
final Point2D left = (xDir > 0) ? inPt : outPt;
final Point2D right = (xDir > 0) ? outPt : inPt;
final Rectangle2D rect = new Rectangle2D.Double(
left.getX(),
left.getY() - dy,
right.getX() - left.getX(),
2 * dy);
head.addAttachment("seed-" + cName(), rect);
return new Area(rect);
}
//------------//
// getSLinker //
//------------//
/**
* Report the containing head side linker.
*
* @return containing SLinker
*/
public SLinker getSLinker ()
{
return SLinker.this;
}
//-----------//
// getSource //
//-----------//
@Override
public HeadInter getSource ()
{
return head;
}
//----------//
// getStump //
//----------//
/**
* Report the head stump, if any, on this horizontal side of the head.
*
* @return the head side stump, or null
*/
@Override
public Glyph getStump ()
{
return stump;
}
//--------------//
// getStumpArea //
//--------------//
/**
* Define the lookup area on head side for suitable stump building.
*
* @return the stump lookup area
*/
private Area getStumpArea ()
{
final double rx = refPt.getX();
final double height = params.stumpAreaDy;
final double left = (xDir > 0) ? rx - params.stumpAreaDxIn
: rx - params.stumpAreaDxOut;
final double right = (xDir > 0) ? rx + params.stumpAreaDxOut
: rx + params.stumpAreaDxIn;
final double top = (yDir > 0) ? refPt.getY() : refPt.getY() - height;
final Rectangle2D rect = new Rectangle2D.Double(left, top, right - left, height);
head.addAttachment("stump-" + cName(), rect);
return new Area(rect);
}
//---------------//
// getSubSection //
//---------------//
/**
* Extract a thinner section from the provided (too wide) section.
*
* @param wide the too wide section
* @return thinner section extracted around refPt
*/
private Section getSubSection (Section wide)
{
final int stemWidth = scale.getStemThickness();
final int x0 = (int) Math.rint(refPt.getX() - stemWidth / 2.0);
final int i0 = Math.max(0, x0 - wide.getFirstPos());
final int x1 = x0 + stemWidth;
final int i1 = Math.min(x1 - wide.getFirstPos(), wide.getRunCount());
final DynamicSection ds = new DynamicSection(Orientation.VERTICAL);
if (i1 > i0) {
final List<Run> runs = wide.getRuns().subList(i0, i1);
ds.setFirstPos(x0);
for (Run run : runs) {
ds.append(new Run(run));
}
}
return ds;
}
//-------------//
// getTargetPt //
//-------------//
/**
* Compute the point where the (skewed) vertical from reference point
* crosses the provided limit.
*
* @param limit the end of the white space (a rather horizontal line)
* @return the limit crossing point with skewed vertical at reference point
*/
private Point2D getTargetPt (Line2D limit)
{
return StemsRetriever.getTargetPt(
refPt,
limit,
system.getSheet().getSkew().getSlope());
}
//--------------------//
// getTheoreticalLine //
//--------------------//
@Override
public Line2D getTheoreticalLine ()
{
return theoLine;
}
//-----------//
// getYRange //
//-----------//
/**
* Compute the range to be covered by stem items
*
* @param yLimit the limit farthest from head
* @return a range rectangle
*/
private Rectangle getYRange (double yLimit)
{
return new Rectangle(
0, // x is irrelevant
(int) Math.rint((yDir > 0) ? refPt.getY() : yLimit),
0, // width is irrelevant
(int) Math.rint(Math.abs(yLimit - refPt.getY())));
}
//------------------//
// hasConcreteStart //
//------------------//
public boolean hasConcreteStart (int profile)
{
return sb.headHasConcreteStart(profile);
}
//---------//
// inspect //
//---------//
/**
* Look for reachable targets in head corner and store them in StemBuilder.
* <p>
* Targets can be: beam, other head, stem end
* (based on seed or chunk or head stump or beam stump)
*
* @param maxStemProfile maximum possible stem profile
*/
public void inspect (int maxStemProfile)
{
if (head.isVip()) {
logger.info("VIP {} inspect maxStemProfile:{}", this, maxStemProfile);
}
// Collect suitable seeds (on top of head stump)
seeds = retrieveSeeds();
// Other head linkers
final List<StemLinker> linkers = new ArrayList<>();
linkers.addAll(lookupOtherHeads());
// Beam linker at end?
if (targetBeam != null) {
if ((head.getShape() != Shape.NOTEHEAD_VOID) || yDir != hSide.direction()) {
// Include all relevant beams in beam group
final Point2D xp = LineUtil.intersection(targetBeam.getMedian(), theoLine);
final List<AbstractBeamInter> siblings = targetBeam.getLinker()
.getSiblingBeamsAt(xp);
for (AbstractBeamInter b : siblings) {
final BLinker bLinker = b.getLinker().findLinker(theoLine);
linkers.add(bLinker);
}
}
}
sb = new StemBuilder(retriever, this, seeds, linkers, maxStemProfile);
if (head.isVip()) {
logger.info("VIP {} {}", this, sb);
}
}
//----------//
// isClosed //
//----------//
@Override
public boolean isClosed ()
{
return closed;
}
//----------//
// isLinked //
//----------//
@Override
public boolean isLinked ()
{
return linked;
}
//------//
// link //
//------//
/**
* Try to link head to reachable heads and beams.
* <p>
* Processing is done from head to tail or beam.
* <p>
* Stop the search at the first good beam found or at the expected stem length or
* at the first non acceptable vertical gap, whichever comes first.
*
* @param stemProfile desired profile level for stem building
* @param linkProfile desired profile level for stem linking
* @param append true to allow appending to already linked head
* @return true if OK
*/
public boolean link (int stemProfile,
int linkProfile,
boolean append)
{
if (head.isVip()) {
logger.info("VIP {} link", this);
}
final double yHard = refPt.getY() + yDir * params.minStemTailLg;
final double ySoft = refPt.getY() + yDir * params.bestStemTailLg;
final Map<StemLinker, Relation> relations = new LinkedHashMap<>();
final Set<Glyph> glyphs = new LinkedHashSet<>();
final int lastIndex = expand(
yHard,
ySoft,
stemProfile,
linkProfile,
relations,
glyphs);
if (lastIndex == -1) {
return false;
}
// Stem built from glyphs
if (glyphs.isEmpty()) {
return false;
}
StemInter stem = null;
// Extending existing stem?
if (append) {
stem = reuseStem(lastIndex);
}
if (stem == null) {
stem = sb.createStem(glyphs, stemProfile);
}
if (stem == null) {
return false;
}
final SIGraph sig = system.getSig();
if (stem.getId() == 0) {
sig.addVertex(stem);
}
// Connections by "applying" links (head-stem and beam-stem)
for (Entry<StemLinker, Relation> entry : relations.entrySet()) {
final Relation relation = entry.getValue();
if (relation instanceof HeadStemRelation headStemRelation) {
final CLinker cl = (CLinker) entry.getKey();
final HeadInter h = cl.getSource();
if (null == sig.getRelation(h, stem, HeadStemRelation.class)) {
headStemRelation.setConsistency(head, stem);
sig.addEdge(h, stem, relation);
}
cl.getSLinker().setLinked(true);
} else if (relation instanceof BeamStemRelation) {
final BLinker bl = (BLinker) entry.getKey();
final AbstractBeamInter beam = bl.getSource();
if (!beam.isRemoved()) { // To prevent step crash
if (null == sig.getRelation(beam, stem, BeamStemRelation.class)) {
sig.addEdge(beam, stem, relation);
}
bl.setLinked(true);
}
}
}
// At this point, we have successfully linked a stem w/ heads
// Sequence of items still to be processed?
if (lastIndex < sb.maxIndex()) {
// Pickup first remaining CLinker if any
final CLinker first = sb.getFirstCLinkerAfter(lastIndex, stemProfile);
if ((first != null) && !first.isClosed()) {
final HeadInter h = first.getHead();
///h.getLinker().linkSides(0, linkProfile);
int maxProf = isRatherGood(h) ? Profiles.RATHER_GOOD_HEAD : linkProfile;
for (int prof = Profiles.STRICT; prof <= maxProf; prof++) {
if (first.link(prof, linkProfile, append)) {
break;
}
}
}
}
return true;
}
//------------------//
// lookupBeamGroups //
//------------------//
/**
* Look for (groups of) beam interpretations in the lookup area.
*
* @param beams provided collection of candidate beams
* @return the list of groups, ordered by distance from head
*/
private List<BeamGroupInter> lookupBeamGroups (List<Inter> beams)
{
return HeadLinker.lookupBeamGroups(beams, refPt, yDir, params.minBeamHeadDy);
}
//------------------//
// lookupOtherHeads //
//------------------//
private List<CLinker> lookupOtherHeads ()
{
if (head.isVip()) {
logger.info("VIP {} lookupOtherHeads", this);
}
final List<CLinker> list = new ArrayList<>();
// Last ordinate before candidates
final double yLast = refPt.getY() + yDir * params.minHeadHeadDy;
// Filter head candidates
final List<Inter> headCandidates = Inters.intersectedInters(
retriever.getSystemHeads(),
GeoOrder.BY_ABSCISSA,
luArea);
headCandidates.remove(head);
headCandidates.removeAll(sig.getCompetingInters(head));
final Rational headDuration = head.getShape().getNoteDuration();
for (Inter hInter : headCandidates) {
final HeadInter h = (HeadInter) hInter;
// Check other head shape is compatible with initial head shape
if (!h.getShape().getNoteDuration().equals(headDuration)) {
continue;
}
// Check head is far enough from start
final double dy = yDir * (h.getCenter().y - yLast);
if (dy < 0) {
continue;
}
for (SLinker sLinker : h.getLinker().getSLinkers().values()) {
final CLinker cLinker = sLinker.getCornerLinker(vSide);
if (luArea.contains(cLinker.getReferencePoint())) {
list.add(cLinker);
}
}
}
return list;
}
//---------------//
// retrieveSeeds //
//---------------//
/**
* Look for suitable stem seeds.
*/
private List<Glyph> retrieveSeeds ()
{
// Collect all seeds that intersect corner lookup area.
final Set<Glyph> set = Glyphs.intersectedGlyphs(neighborSeeds, luArea);
final Rectangle stumpBox = (stump != null) ? stump.getBounds() : null;
for (Iterator<Glyph> it = set.iterator(); it.hasNext();) {
final Glyph seed = it.next();
final Rectangle seedBox = seed.getBounds();
// Purge seeds that overlap ordinate-wise the head stump, if any
if ((stumpBox != null) && GeoUtil.yOverlap(seedBox, stumpBox) > 0) {
it.remove();
} else if (getContrib(seedBox) < params.minSeedContrib) {
// Purge seeds that do not contribute enough to ordinate range
it.remove();
} else {
// Purge seeds that are too far abscissa-wise from theoretical line
Point2D seedCenter = seed.getCentroid();
double dist = theoLine.ptLineDist(seedCenter);
if (dist > params.maxLineSeedDx) {
it.remove();
}
}
}
// In case of seeds overlap, simply keep the most contributive
final List<Glyph> kept = new ArrayList<>();
final List<Glyph> list = new ArrayList<>(set);
Collections.sort(
list,
(g1,
g2) -> Integer.compare(
getContrib(g2.getBounds()),
getContrib(g1.getBounds())));
StemLoop:
for (Glyph seed : list) {
Rectangle stemBox = seed.getBounds();
for (Glyph k : kept) {
if (GeoUtil.yOverlap(stemBox, k.getBounds()) > 0) {
continue StemLoop;
}
}
// No overlap
kept.add(seed);
}
return kept;
}
//---------------//
// retrieveStump //
//---------------//
/**
* Retrieve a suitable seed near reference point or try to build a stump if no
* seed could be selected.
*
* @return the stump if any: a seed found or a brand-new stump or null
*/
private Glyph retrieveStump ()
{
if (head.isVip()) {
logger.info("VIP {} retrieveStump", this);
}
// Look for suitable stem seed if any
final List<Glyph> theSeeds = new ArrayList<>(
Glyphs.intersectedGlyphs(neighborSeeds, getSeedArea()));
if (theSeeds.size() > 1) {
// Prefer the closest to refPt
Collections.sort(
theSeeds,
(g1,
g2) -> Double.compare(
g1.getCenterLine().ptSegDistSq(refPt),
g2.getCenterLine().ptSegDistSq(refPt)));
}
for (Glyph seed : theSeeds) {
// Impose a maximum dx between refPt and seed
final double seedX = LineUtil.xAtY(seed.getCenterLine(), refPt.getY());
final int dx = (int) Math.round(xDir * (seedX - refPt.getX()));
if (((dx >= 0) && (dx <= params.maxHeadOutDx)) || ((dx <= 0)
&& (-dx <= params.maxHeadInDx))) {
if (standsOut(seed)) {
return seed;
}
}
}
// No suitable seed, so let's build a stump from suitable runs/sections
return buildStump();
}
//-----------//
// reuseStem //
//-----------//
private StemInter reuseStem (int lastIndex)
{
final List<CLinker> headLinkers = sb.getCLinkers(lastIndex);
for (CLinker cl : headLinkers) {
final HeadInter h = cl.getSource();
for (Relation r : sig.getRelations(h, HeadStemRelation.class)) {
HeadStemRelation hsRel = (HeadStemRelation) r;
if (hsRel.getHeadSide() == cl.getSLinker().getHorizontalSide()) {
return (StemInter) sig.getOppositeInter(h, r);
}
}
}
return null;
}
//-----------//
// saveStump //
//-----------//
/**
* Debugging feature that saves the stump image to disk.
*
* @param stumpGlyph glyph of the created stump
*/
private void saveStump (Glyph stumpGlyph)
{
final int zoom = 20;
final Rectangle bounds = head.getBounds();
final BufferedImage img = new BufferedImage(
3 * zoom * bounds.width,
3 * zoom * bounds.height,
BufferedImage.TYPE_INT_ARGB);
// Background
final Graphics2D g = img.createGraphics();
g.setColor(Color.WHITE);
g.fillRect(0, 0, img.getWidth(), img.getHeight());
// img offset WRT sheet origin
final Point offset = new Point(bounds.x - bounds.width, bounds.y - bounds.height);
final AffineTransform at = AffineTransform.getScaleInstance(zoom, zoom);
at.concatenate(AffineTransform.getTranslateInstance(-offset.x, -offset.y));
g.setTransform(at);
// Stump
g.setColor(Color.RED);
stumpGlyph.getRunTable().render(g, stumpGlyph.getTopLeft());
// Head glyph
g.setColor(Color.BLACK);
final Glyph headGlyph = head.getGlyph();
headGlyph.getRunTable().render(g, bounds.getLocation());
// Head attachments
UIUtil.setAbsoluteStroke(g, 1f);
head.renderAttachments(g);
// Head symbol
g.setComposite(AlphaComposite.getInstance(AlphaComposite.SRC_OVER, 0.25f));
final Shape shape = head.getShape();
final MusicFamily family = system.getSheet().getStub().getMusicFamily();
final FontSymbol fs = shape.getFontSymbolByInterline(family, scale.getInterline());
fs.symbol.paintSymbol(g, fs.font, bounds.getLocation(), TOP_LEFT);
final SheetStub stub = system.getSheet().getStub();
ImageUtil.saveOnDisk(img, stub.getId(), getId() + "-stump");
}
//-----------//
// setClosed //
//-----------//
@Override
public void setClosed (boolean closed)
{
SLinker.this.setClosed(closed);
}
//-----------//
// setLinked //
//-----------//
@Override
public void setLinked (boolean linked)
{
SLinker.this.setLinked(linked);
}
//-----------//
// standsOut //
//-----------//
/**
* Report whether the provided (stump?) glyph really stands out of head in the corner
* vertical direction.
* <p>
* We simply check how far the glyph extends away from head in corner direction
*
* @param stump the glyph to check WRT head corner
*/
private boolean standsOut (Glyph stump)
{
final Rectangle glyphBox = stump.getBounds();
final int refY = (int) Math.rint(refPt.getY());
final int extDy = (yDir > 0) ? glyphBox.y + glyphBox.height - 1 - refY
: refY - glyphBox.y;
return extDy >= params.minHeadStumpDy;
}
//----------//
// toString //
//----------//
@Override
public String toString ()
{
final StringBuilder asb = new StringBuilder(getClass().getSimpleName()).append('{')
.append(getId());
if (stump != null) {
asb.append(' ').append(stump);
} else if (refPt != null) {
asb.append(" refPt:").append(PointUtil.toString(refPt));
}
return asb.append('}').toString();
}
}
}
}
```
|
The Human Chain for Basque Self-determination, 2018 took place on 10 June in the Basque Autonomous Community of Spain organized by the movement Gure Esku Dago ("It is in our hands") advocating for a self-determination vote with an independence option. It counted on the active support of the Basque National Party (PNV), EH Bildu, and Elkarrekin Podemos, the main forces of the autonomous region.
The human chain held on Sunday connected at noon the cities of Donostia (San Sebastián), Bilbao and Vitoria-Gasteiz, extending for 202 kilometres (125 miles), gathering approximately 175,000 protesters. It relied on the support of 5,000 volunteers and drew on the use of 1,000 coaches for transportation. The event was attended, among others, by Juan Mari Aburto, mayor of Bilbao, and senior PNV officials Andoni Ortuzar and Itxaso Atutxa. However, the lehendakari Iñigo Urkullu (the region's premier) did not take a clear position on the initiative.
The organizers drafted a document they handed over to the Basque Parliament with a seat in Vitoria-Gasteiz demanding it open the avenues necessary to carry out the vote including an independence option. The 1978 Spanish Constitution forbids independence inasmuch as it states that "Spain is one and indivisible".
See also
Human Chain for Basque Self-determination, 2014
Catalan Way
Hong Kong Way
References
Basque Country (autonomous community)
Basque politics
2018 in the Basque Country (autonomous community)
June 2018 events in Spain
Human chains (politics)
|
Keiko Tanaka (; born 6 May 1986) is a Japanese footballer who plays as a defender or midfielder for Gladesville Ravens.
Early life
Tanaka started playing football during fourth grade.
Career
In 2013, Tanaka signed for Japanese side NHK Spring Yokohama FC Seagulls, where she captained the club.
After that, she signed for Australian side NWS Koalas FC and left due to the coronavirus pandemic. Before the 2021 season, she signed for Australian side Gladesville Ravens, helping the club achieve promotion.
Personal life
Tanaka has worked as a football coach and at a Japanese restaurant.
References
Living people
1986 births
Women's association football defenders
Women's association football midfielders
Expatriate women's soccer players in Australia
Japanese expatriate sportspeople in Australia
Japanese women's footballers
Japanese expatriate women's footballers
Mynavi Sendai Ladies players
TEPCO Mareeze players
|
Cyprus sent a delegation to compete at the 2008 Summer Paralympics in Beijing, People's Republic of China. Its delegation consisted in one track and field athlete (Antonis Aresti), one competitor in shooting (Evripides Georgiou), and two swimmers (Karolina Pelendritou and Andreas Potamitis).
The country won a total of four medals: one gold, two silver and one bronze. This was by far Cyprus' best performance ever at the Paralympics; over the course of its five previous participations, it had won a single medal: a gold in swimming in 2004.
Medalists
Sports
Athletics
Men's track
Shooting
Swimming
See also
Cyprus at the Paralympics
Cyprus at the 2008 Summer Olympics
External links
International Paralympic Committee
References
Nations at the 2008 Summer Paralympics
2008
Summer Paralympics
|
Cortinarius infractiflavus is a species of fungus in the family Cortinariaceae. It was originally described as new to science in 1999 by Meinhard Moser, who named it Cortinarius infractus var. flavus. It was raised to species status in 2014 when molecular analysis showed it to be genetically distinct from C. infractus. The specific epithet infractiflavus refers to its relationship to C. infractus and its yellow cap. The mushroom is known from North American north of Mexico, Finland, and Bulgaria, where it grows on the ground in boreal and mountainous conifer forests.
See also
List of Cortinarius species
References
External links
infractiflavus
Fungi described in 2014
Fungi of Europe
Fungi of North America
|
Mariusz Sowiński (born 1976) is a Polish serial killer, rapist, and zoophile known as The Stefankowice Vampire. In the years 1994 to 1997, he raped and killed four women.
Crimes
Sowiński committed his first murder in 1994 in Stefankowice, in which he raped and murdered Zofia K. before throwing her body down a well. His next attack was a year later; in Kułakowice, he raped Antonina E., and to erase any traces he set her house on fire. The woman later died in hospital from her injuries. In August 1996, in a garden plot in Hrubieszów he raped and stabbed Wiesława Ł. His last murder was on the night of August 31 to September 1, 1997; in Stefankowice, Genowefa S., a resident of the village, was raped and then strangled with a cable.
Victims
Investigation and arrest
The initial suspect was a man named Kazimierz P., who served 19 months in prison. On the trail of Sowiński, the police had already fallen off in September 1997. He was a conscript soldier in the Nadwślańskie units of the Ministry of Interior and Administration in Sanok. During the interrogations, without any embarrassment or emotions, he confessed to the crimes. This, combined with other evidence gathered, was enough to prosecute him.
Trial and sentence
The trial began in autumn 1998 in Zamość and from the very beginning was accompanied by great emotions. In October, during the first trial, the father of Wiesława Ł., one of Sowiński's victims, attacked him with an axe smuggled to court, wounding him in the back. Sowiński went to the hospital and the attacker was detained. However, thanks to the intercession of the voivodes of Zamość and the protests of his neighbors, he was released. After he recovered, his case was resumed. The prosecutor's office accused him of quadruple murder and rape. To emphasize how dangerous and deranged he was, the prosecutor cited that after one of the killings he killed the owner's cows and then began to interact sexually with their corpses. The accused himself refused to give explanations, he only said he was innocent. His advocate tried to prove that Sowiński could not be convicted because he was mentally ill. 20 experts in the field of psychology and sexology were appointed in his case. Everyone clearly stated that he was fully sane, and his deviations could be even deeper. The prosecutor's office demanded the penalty of life imprisonment with the possibility of conditional release after 50 years. In 2000, the District Court of Zamość sentenced him to the highest penalty. The Court of Appeal in Lublin also upheld it on the grounds that Sowiński posed a threat to the environment. A year later, as a result of the cassation of Sowiński, the Supreme Court quashed the verdict and remitted it for re-examination. In 2002, the District Court of Zamość imposed on him a life imprisonment with the possibility of conditional release after serving 50 years of imprisonment. In 2003, the Court of Appeal in Lublin finally upheld the sentence.
Punishment
Sowiński is serving a sentence in the Rzeszów-Załęże Criminal Facility, in a one-person cell in the therapeutic ward. He repeatedly sued in court during the sanction: against the father of one of his victims, who attacked him with an axe when he was led to the courtroom, from whom he demanded PLN 13,000 for "moral damage and losses"; against two policemen who escorted him - demanded PLN 80,000 for "not providing him with adequate protection", and PLN 360 for "damaged clothing". In another case, against the District Prosecutor of Zamość, he demanded PLN 500,000 in compensation for "the prosecutor being rude and did not allow him to get acquainted with the case file". Sowiński brought his last action in 2010 against Radio Lublin. For using the term "vampire", he demanded compensation from the radio in the amount of PLN 500,000. All actions brought by Sowiński were validly dismissed.
While serving the penalty, he completed a journeyman's course in the profession of a basket-maker.
Since 2004, he has consistently sought a pardon from successive presidents of Poland: Aleksander Kwaśniewski, Lech Kaczyński, and more recently (in 2011) - Bronisław Komorowski. So far, all the requests, due to the negative criminological prognosis (progressive progression of sexual dysfunction) have been treated negatively at the judicial stage, and thus left without further progress.
Mariusz Sowiński will be apply for conditional early release in early 2047, at the age of 71.
See also
List of serial killers by country
References
1976 births
1994 crimes in Poland
1994 murders in Europe
1997 crimes in Poland
1997 murders in Europe
1990s murders in Poland
Living people
Necrophiles
Polish rapists
Polish serial killers
Zoophilia
|
```python
import demistomock as demisto
from CommonServerPython import *
from CommonServerUserPython import *
import random
import secrets
import string
DEFAULT_MIN = 0
DEFAULT_MAX = 10
LOWERCASE_CHARS = string.ascii_lowercase
UPPERCASE_CHARS = string.ascii_uppercase
DIGITS = string.digits
SYMBOLS = "!@#$%^&*()[]+:\"?_><=';/-.,\\|"
def randomize_number_in_range(min_val: int, max_val: int) -> int:
n = max(max_val - min_val, 0)
return secrets.randbelow(n + 1) + min_val
def print_char_values(pw):
ascii_values = [ord(char) for char in pw]
ascii_string = ', '.join(str(value) for value in ascii_values)
demisto.debug(f"ASCII for password = {ascii_string}")
def generate_password(args: Dict[str, Any]) -> CommandResults:
is_debug = argToBoolean(args.get('debug'))
min_lowercase = arg_to_number(args.get('min_lcase', DEFAULT_MIN))
max_lowercase = arg_to_number(args.get('max_lcase', DEFAULT_MAX))
min_uppercase = arg_to_number(args.get('min_ucase', DEFAULT_MIN))
max_uppercase = arg_to_number(args.get('max_ucase', DEFAULT_MAX))
min_digits = arg_to_number(args.get('min_digits', DEFAULT_MIN))
max_digits = arg_to_number(args.get('max_digits', DEFAULT_MAX))
min_symbols = arg_to_number(args.get('min_symbols', DEFAULT_MIN))
max_symbols = arg_to_number(args.get('max_symbols', DEFAULT_MAX))
if min(min_uppercase, min_lowercase, min_digits, min_symbols) < 0: # type:ignore[type-var,operator]
raise DemistoException("All numeral arguments must be positive.")
if sum((min_uppercase, min_lowercase, min_digits, min_symbols)) == 0: # type:ignore[arg-type]
raise DemistoException("error: At least one of the following arguments should be above 0: "
"min_uppercase, min_lowercase, min_digits, min_symbols")
# randomize the amount of characters we get as per parameters
num_upper = randomize_number_in_range(min_uppercase, max_uppercase) # type:ignore[arg-type]
num_lower = randomize_number_in_range(min_lowercase, max_lowercase) # type:ignore[arg-type]
num_digits = randomize_number_in_range(min_digits, max_digits) # type:ignore[arg-type]
num_symbols = randomize_number_in_range(min_symbols, max_symbols) # type:ignore[arg-type]
if num_upper + num_lower + num_digits + num_symbols == 0:
raise DemistoException("error: insane password. No character length.")
# start with a blank password
pw = []
# iterate through each character class and add
for _ in range(num_upper):
pw.append(secrets.choice(UPPERCASE_CHARS))
for _ in range(num_lower):
pw.append(secrets.choice(LOWERCASE_CHARS))
for _ in range(num_digits):
pw.append(secrets.choice(DIGITS))
for _ in range(num_symbols):
pw.append(secrets.choice(SYMBOLS))
# randomize our new password string
rpw = ''.join(random.sample(pw, len(pw)))
if is_debug:
print_char_values(rpw)
return CommandResults(
outputs_prefix="NEW_PASSWORD",
outputs=rpw,
readable_output=tableToMarkdown('Newly Generated Password', {'password': rpw})
)
def main(): # pragma: no cover
try:
args = demisto.args()
return_results(generate_password(args))
except Exception as e:
return_error(str(e))
if __name__ in ('__builtin__', 'builtins'): # pragma: no cover
main()
```
|
```scala
/*
*/
package akka.stream.alpakka.ironmq.scaladsl
import akka.NotUsed
import akka.dispatch.ExecutionContexts
import akka.stream.alpakka.ironmq.{IronMqSettings, IronMqSpec, PushMessage}
import akka.stream.scaladsl.{Sink, Source}
import com.typesafe.config.{Config, ConfigFactory}
import org.scalatest.ParallelTestExecution
import akka.stream.testkit.scaladsl.StreamTestKit.assertAllStagesStopped
import scala.concurrent.ExecutionContext
class IronMqConsumerSpec extends IronMqSpec with ParallelTestExecution {
implicit val ec: ExecutionContext = ExecutionContexts.global()
val messages: Source[PushMessage, NotUsed] =
Source.fromIterator(() => Iterator.from(0)).map(i => PushMessage(s"test-$i"))
override protected def initConfig(): Config =
ConfigFactory.parseString(s"""alpakka.ironmq {
| consumer.reservation-timeout = 30 seconds
|}
""".stripMargin).withFallback(super.initConfig())
"atLeastOnceConsumerSource" should {
"not delete messages from the queue if not committed" in assertAllStagesStopped {
val queue = givenQueue()
val numberOfMessages = 10
messages
.take(numberOfMessages)
.mapAsync(1)(ironMqClient.pushMessages(queue, _))
.runWith(Sink.ignore)
.futureValue
IronMqConsumer
.atLeastOnceSource(queue, IronMqSettings())
.take(numberOfMessages)
.runWith(Sink.ignore)
.futureValue
ironMqClient.peekMessages(queue, 100).futureValue shouldBe empty
// Sleep enough time to be sure the messages has been put back in queue by IronMQ
Thread.sleep(45000L)
ironMqClient.peekMessages(queue, 100).futureValue should have size numberOfMessages
}
"delete the messages from the queue when committed" in assertAllStagesStopped {
val queue = givenQueue()
val numberOfMessages = 10
messages
.take(numberOfMessages)
.mapAsync(1)(ironMqClient.pushMessages(queue, _))
.runWith(Sink.ignore)
.futureValue
IronMqConsumer
.atLeastOnceSource(queue, IronMqSettings())
.take(numberOfMessages)
.mapAsync(3)(_.commit())
.runWith(Sink.ignore)
.futureValue
ironMqClient.peekMessages(queue, 100).futureValue shouldBe empty
// Sleep enough time to be sure the messages may have been put back in queue by IronMQ
Thread.sleep(45000L)
ironMqClient.peekMessages(queue, 100).futureValue shouldBe empty
}
}
}
```
|
Al Maya Group is a Dubai based retail chain in UAE and operates supermarkets all over GCC countries, with around 40 outlets in UAE alone.
Foundation
The Al Maya Group in the Middle East commenced its business operations with a stand-alone supermarket in Ajman in the late 1970s. In 1981 the Group was refurbished by its new partner and Chairman, Mr Lachmandas. K. Pagrani. Thereafter the Group set up 18 stores in the next 18 months. Al Maya Flagship has 56 Supermarkets in GCC. As part of providing better solutions and services, a wholesale foodstuff division was created to supply the UAE and neighboring countries.
The Al Maya Group further diversified into the wholesale of textiles, followed by novelties, households, garments and electronics. In 1985, the Group acquired the prestigious British Home Stores (BHS) franchise for the Northern Emirates. Again in year 2006 Al Maya group signed franchise agreement with BORDERS group for entire GCC.
References
Companies based in Dubai
Retail companies of the United Arab Emirates
|
```smalltalk
// ***********************************************************************
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
// ***********************************************************************
using NUnit.Framework.Api;
namespace NUnit.Framework.Internal.Commands
{
/// <summary>
/// TODO: Documentation needed for class
/// </summary>
public abstract class DelegatingTestCommand : TestCommand
{
/// <summary>TODO: Documentation needed for field</summary>
protected TestCommand innerCommand;
/// <summary>
/// TODO: Documentation needed for constructor
/// </summary>
/// <param name="innerCommand"></param>
protected DelegatingTestCommand(TestCommand innerCommand)
: base(innerCommand.Test)
{
this.innerCommand = innerCommand;
}
}
}
```
|
Tracy-sur-Mer (, literally Tracy on Sea) is a commune in the Calvados department in the Normandy region in northwestern France.
History
The village was part of the west flank of the British 50th (Northumbrian) Infantry Division during the first days of the D-day invasion, in close proximity to the port of Arromanches-les-Bains, also known as Gold Beach.
Sights
Tracy-sur-Mer has a church dedicated to Saint Martin. The building was largely reconstructed in the nineteenth century, but some masonry of the original thirteenth century church remains in the choir. The bell tower was built in 1957.
Population
See also
Communes of the Calvados department
References
Communes of Calvados (department)
Calvados communes articles needing translation from French Wikipedia
Populated coastal places in France
|
```php
<?php
/**
* Twenty Fourteen back compat functionality
*
* Prevents Twenty Fourteen from running on WordPress versions prior to 3.6,
* since this theme is not meant to be backward compatible beyond that
* and relies on many newer functions and markup changes introduced in 3.6.
*
* @package WordPress
* @subpackage Twenty_Fourteen
* @since Twenty Fourteen 1.0
*/
/**
* Prevent switching to Twenty Fourteen on old versions of WordPress.
*
* Switches to the default theme.
*
* @since Twenty Fourteen 1.0
*/
function twentyfourteen_switch_theme() {
switch_theme( WP_DEFAULT_THEME, WP_DEFAULT_THEME );
unset( $_GET['activated'] );
add_action( 'admin_notices', 'twentyfourteen_upgrade_notice' );
}
add_action( 'after_switch_theme', 'twentyfourteen_switch_theme' );
/**
* Add message for unsuccessful theme switch.
*
* Prints an update nag after an unsuccessful attempt to switch to
* Twenty Fourteen on WordPress versions prior to 3.6.
*
* @since Twenty Fourteen 1.0
*/
function twentyfourteen_upgrade_notice() {
printf(
'<div class="error"><p>%s</p></div>',
sprintf(
/* translators: %s: WordPress version. */
__( 'Twenty Fourteen requires at least WordPress version 3.6. You are running version %s. Please upgrade and try again.', 'twentyfourteen' ),
$GLOBALS['wp_version']
)
);
}
/**
* Prevent the Customizer from being loaded on WordPress versions prior to 3.6.
*
* @since Twenty Fourteen 1.0
*/
function twentyfourteen_customize() {
wp_die(
sprintf(
/* translators: %s: WordPress version. */
__( 'Twenty Fourteen requires at least WordPress version 3.6. You are running version %s. Please upgrade and try again.', 'twentyfourteen' ),
$GLOBALS['wp_version']
),
'',
array(
'back_link' => true,
)
);
}
add_action( 'load-customize.php', 'twentyfourteen_customize' );
/**
* Prevent the Theme Preview from being loaded on WordPress versions prior to 3.4.
*
* @since Twenty Fourteen 1.0
*/
function twentyfourteen_preview() {
if ( isset( $_GET['preview'] ) ) {
wp_die(
sprintf(
/* translators: %s: WordPress version. */
__( 'Twenty Fourteen requires at least WordPress version 3.6. You are running version %s. Please upgrade and try again.', 'twentyfourteen' ),
$GLOBALS['wp_version']
)
);
}
}
add_action( 'template_redirect', 'twentyfourteen_preview' );
```
|
Asumah Abubakar-Ankrah (born 10 May 1997) is a footballer who plays as a forward for Swiss club Luzern. Born in Ghana, he is a youth international for Portugal.
Club career
Born in Kumasi, Ghana, Abubakar had a successful trial with Willem II in the summer of 2015, but he had to wait to the following year to sign a contract due to work permit problems. He eventually received a Portuguese passport as his father had been working in the nation for several years, and on 2 March 2016 he committed to the Dutch club on a short-term deal.
On 2 April 2016, whilst still a junior, Abubakar made his senior debut, coming on as a late substitute in a 2–3 Eredivisie home loss against FC Twente. He transferred to MVV Maastricht for the 2018-2019 season on a free transfer. After 27 appearances and another goalless season Abubakar transferred to Swiss club SC Kriens. On the 28th July 2019, he would score his first professional goal against FC Aarau after being subbed on in the 71st minute. He ended the season third in the top scorer rankings. In his second season, despite Kriens finishing mid-table, he again finished third in the scoring charts and won the Switzerland Challenge League Best Player Award. Abubakar transferred to Swiss Super League club FC Lugano at the start of the 2021-2022 season for 100,000 Euros. He scored his first goal for Lugano on his third appearance in a 1–1 draw with FC Basel.
On 14 January 2022, Abubakar signed a contract with Luzern until 30 June 2024.
International career
Having acquired Portuguese citizenship, Abubakar chose to represent that country. On 16 June 2016, he was selected for a 23-man preliminary list for the 2016 UEFA European Under-19 Championship and also made the final squad, scoring in a 4–3 group stage win over the hosts Germany. Shortly after, however, after doubts arose regarding his eligibility, the Portuguese Football Federation opted to immediately remove him from the competition pending further approval.
Career statistics
Club
References
External links
National team data
1997 births
Living people
Footballers from Kumasi
Portuguese men's footballers
Portugal men's youth international footballers
Ghanaian men's footballers
Portuguese people of Ghanaian descent
Ghanaian emigrants to Portugal
Men's association football forwards
Eredivisie players
Eerste Divisie players
Willem II (football club) players
MVV Maastricht players
SC Kriens players
FC Lugano players
FC Luzern players
Swiss Challenge League players
Swiss Super League players
Portuguese expatriate men's footballers
Ghanaian expatriate men's footballers
Expatriate men's footballers in the Netherlands
Expatriate men's footballers in Switzerland
Ghanaian expatriate sportspeople in Portugal
Ghanaian expatriate sportspeople in the Netherlands
Ghanaian expatriate sportspeople in Switzerland
Portuguese expatriate sportspeople in the Netherlands
Portuguese expatriate sportspeople in Switzerland
|
Ahlgrens was a Swedish confectionery company. It was founded by Fredrik Ahlgren in the town of Gävle in 1885 as a store for paint and wallpaper, a business which was later extended to the production and sale of various types of chemicals, perfumes and other products. A mouthwash, introduced in 1908, was given the brandname Läkerol, a year later given to a pastille, which is still sold internationally in several variants.
The company was in 1993 later bought by the Finnish company Huhtamäki which quickly terminated the brand Ahlgrens and rebranded all its products to Leaf except for Ahlgrens bilar.
The product still most closely associated with the brand is 'Ahlgrens bilar' ("Ahlgren's Cars"), sold since 1953 and marketed as "the world's most sold car" (which is possibly technically correct, by number of cars). The small marshmallow cars are so popular within Sweden that stores that specifically cater to Swedish tourists and residents in other countries have started selling them as well.
The brand has been extended to other car- and road-related products, liquorice car tyres, travel trailers and sour road signs, the latter including the elk warning signs beloved by German tourists.
External links
Ahlgrens bilar (in Swedish, Danish and Norwegian)
Defunct food and drink companies of Sweden
Defunct food and drink companies of Finland
Brand name confectionery
1885 establishments in Sweden
Companies based in Gävleborg County
1993 disestablishments in Finland
Food and drink companies disestablished in 1993
|
```kotlin
/*
* Nextcloud - Android Client
*
*/
package com.nextcloud.client.sso
import androidx.test.espresso.intent.rule.IntentsTestRule
import com.owncloud.android.AbstractIT
import com.owncloud.android.ui.activity.SsoGrantPermissionActivity
import org.junit.Rule
import org.junit.Test
class SSOActivityTests : AbstractIT() {
@Suppress("DEPRECATION")
@get:Rule
var activityRule = IntentsTestRule(SsoGrantPermissionActivity::class.java, true, false)
@Test
fun testActivityTheme() {
val sut = activityRule.launchActivity(null)
assert(sut.binding != null)
assert(sut.materialAlertDialogBuilder != null)
}
}
```
|
Nicole Savoy is an American retired professional wrestler. She has performed in Shimmer Women Athletes, where she was the longest reigning Shimmer Champion.
Early life
Savoy is trained in Muay Thai and Jiu-Jitsu.
Professional wrestling career
Shimmer Women Athletes (2015–present)
On March 23, 2015, Savoy participated in the ChickFight tournament on Volume 71 to determine the No. 1 contender for the Shimmer Championship. She managed to defeat Candice LeRae at the first round, however, was eliminated during the semifinals by losing to Evie. Savoy received a Shimmer Championship match on October 11 at Volume 78, where she unsuccessfully challenged then-champion Madison Eagles. On April 2, 2016, Savoy participated in a twelve-woman tournament on Volume 80 to crown the inaugural Heart of Shimmer Champion. After defeating Kimber Lee and LuFisto, Savot advanced to the finals where she defeated LeRae and Lovelace in a three-way elimination match to win the championship. At the Volume 93 taping on July 8, 2017, Savoy lost the championship to Shazza McKenzie, ending her reign at 462 days with five successful title defenses.
Savoy defeated Mercedes Martinez on Volume 99 on November 12, 2017, to win the Shimmer Championship. On Volume 100 on April 7, 2018, she successfully defended the title against Martinez in a rematch. She went on to retain the title against Britt Baker, Cheerleader Melissa, Deonna Purrazzo, and Nicole Matthews. On Volume 114 on November 2, 2019, she teamed with Big Swole, unsuccessfully challenging Martinez and Melissa for the Shimmer Tag Team Championship. On Volume 116 on November 2, Savoy lost her title to Lee in a four-way elimination match, which also involved Priscilla Kelly and Shotzi Blackheart, ending her reign at 721 days with 17 successful title defenses. By the end of her title reign, Savoy had become the longest reigning Shimmer Champion.
World Wonder Ring Stardom (2015)
Savoy made her World Wonder Ring Stardom debut on October 16, 2015, during Stardom's USA Tour, in a loss to Mayu Iwatani. On October 18, Savoy, Brittany Wonder and Datura lost to Oedo Tai (Act Yasukawa, Kyoko Kimura and Thunder Rosa).
National promotions (2017–present)
Savoy competed for WWE in their 2017 Mae Young Classic tournament. She defeated Reina González in the first round but lost to Candice LeRae during the next round. On August 31, 2019, Savoy participated in the Casino Battle Royal taking place at All Elite Wrestling (AEW)'s All Out, where she was eliminated by Nyla Rose. On December 15, Savoy made her Ring of Honor (ROH) debut at the taping of the second night of Final Battle by defeating Sumie Sakai.
In February 2020, Savoy was announced as a participant in a 16-woman tournament to crown the inaugural ROH Women's World Champion on April 27 at Quest for Gold. The event, however, was cancelled, and the tournament was postponed due to the COVID-19 pandemic. In August, Savoy participated in AEW's Women's Tag Team Cup Tournament: The Deadly Draw under the name Lil' Swole, teaming with Big Swole. The two defeated Leva Bates and Raché Chanel in the quarter-finals but lost to Allie and Brandi Rhodes during the semifinals.
Savoy returned in 2021 to ROH to participate in a tournament to crown the inaugural ROH Women's World Champion. On July 30, Savoy defeated Mazzerati in the first round of the tournament. Savoy lost the following round to Miranda Alize, thus was eliminated from the tournament.
World Wonder Ring Stardom (2018)
In August and September of 2018, Savoy competed in the Blue Stars block of the 2018 5 Star Grand Prix, in which she scored a total of eight points.
Major League Wrestling (2021–2022)
On the September 22, 2021, episode of Fusion Alpha, Major League Wrestling (MLW) announced Savoy as part of their new women's featherweight division.
Championships and accomplishments
Alternative Wrestling Show
AWS Women's Championship (1 time)
Race for the Ring Women's Tournament (2015)
Gold Rush Pro Wrestling
Golden Thrones Tournament (2016) – with JR Kratos
Pro Wrestling Illustrated
Ranked No. 10 of the top 100 female wrestlers in the PWI Female 100 in 2019
Pro Wrestling Revolution
PWR World Women's Championship (1 time, current)
Shimmer Women Athletes
Heart of Shimmer Championship (1 time, inaugural)
Heart of Shimmer Championship Tournament (2016)
Shimmer Championship (1 time)
References
External links
Living people
African-American female professional wrestlers
American female professional wrestlers
Year of birth missing (living people)
21st-century African-American sportspeople
21st-century African-American women
21st-century female professional wrestlers
Shimmer Champions
|
"Keeping Time" is a song written and performed by Australian singer Angie McMahon. The song was released in July 2018 as the third single from McMahon's debut studio album Salt (2019). The song was certified gold in Australia in 2023.
The song premiered on triple j with McMahon saying, "I wrote it a while back thinking about diving into this music career thing and having the confidence to do that amidst all my insecurities - feeling like everyone was a better musician than me. This song is about pushing that stuff aside... Like, 'you can do this, you know how to play music, just get over yourself and do it!'"."
The music video was released in March 2019.
Reception
Triple J said "Built upon an openly inviting chord pattern and a rough strut, Angie's voice is plump with feeling yet glides in satin-smooth phrases."
Certifications
References
2018 songs
2018 singles
Angie McMahon songs
|
```asciidoc
////
This file is generated by DocsTest, so don't change it!
////
= apoc.coll
:description: This section contains reference documentation for the apoc.coll procedures.
[.procedures, opts=header, cols='5a,1a,1a']
|===
| Qualified Name | Type | Release
|xref::overview/apoc.coll/apoc.coll.elements.adoc[apoc.coll.elements icon:book[]]
apoc.coll.elements(list,limit,offset) yield _1,_2,..,_10,_1s,_2i,_3f,_4m,_5l,_6n,_7r,_8p - deconstruct subset of mixed list into identifiers of the correct type
|label:procedure[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.pairWithOffset.adoc[apoc.coll.pairWithOffset icon:book[]]
apoc.coll.pairWithOffset(values, offset) - returns a list of pairs defined by the offset
|label:procedure[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.partition.adoc[apoc.coll.partition icon:book[]]
apoc.coll.partition(list,batchSize)
|label:procedure[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.split.adoc[apoc.coll.split icon:book[]]
apoc.coll.split(list,value) \| splits collection on given values rows of lists, value itself will not be part of resulting lists
|label:procedure[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.zipToRows.adoc[apoc.coll.zipToRows icon:book[]]
apoc.coll.zipToRows(list1,list2) - creates pairs like zip but emits one row per pair
|label:procedure[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.avg.adoc[apoc.coll.avg icon:book[]]
apoc.coll.avg([0.5,1,2.3])
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.avgDuration.adoc[apoc.coll.avgDuration icon:book[]]
apoc.coll.avgDuration([duration('P2DT3H'), duration('PT1H45S'), ...]) - returns the average of a list of duration values
|label:function[]
|label:apoc-full[]
|xref::overview/apoc.coll/apoc.coll.combinations.adoc[apoc.coll.combinations icon:book[]]
apoc.coll.combinations(coll, minSelect, maxSelect:minSelect) - Returns collection of all combinations of list elements of selection size between minSelect and maxSelect (default:minSelect), inclusive
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.contains.adoc[apoc.coll.contains icon:book[]]
apoc.coll.contains(coll, value) optimized contains operation (using a HashSet) (returns single row or not)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.containsAll.adoc[apoc.coll.containsAll icon:book[]]
apoc.coll.containsAll(coll, values) optimized contains-all operation (using a HashSet) (returns single row or not)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.containsAllSorted.adoc[apoc.coll.containsAllSorted icon:book[]]
apoc.coll.containsAllSorted(coll, value) optimized contains-all on a sorted list operation (Collections.binarySearch) (returns single row or not)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.containsDuplicates.adoc[apoc.coll.containsDuplicates icon:book[]]
apoc.coll.containsDuplicates(coll) - returns true if a collection contains duplicate elements
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.containsSorted.adoc[apoc.coll.containsSorted icon:book[]]
apoc.coll.containsSorted(coll, value) optimized contains on a sorted list operation (Collections.binarySearch) (returns single row or not)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.different.adoc[apoc.coll.different icon:book[]]
apoc.coll.different(values) - returns true if values are different
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.disjunction.adoc[apoc.coll.disjunction icon:book[]]
apoc.coll.disjunction(first, second) - returns the disjunct set of the two lists
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.dropDuplicateNeighbors.adoc[apoc.coll.dropDuplicateNeighbors icon:book[]]
apoc.coll.dropDuplicateNeighbors(list) - remove duplicate consecutive objects in a list
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.duplicates.adoc[apoc.coll.duplicates icon:book[]]
apoc.coll.duplicates(coll) - returns a list of duplicate items in the collection
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.duplicatesWithCount.adoc[apoc.coll.duplicatesWithCount icon:book[]]
apoc.coll.duplicatesWithCount(coll) - returns a list of duplicate items in the collection and their count, keyed by `item` and `count` (e.g., `[{item: xyz, count:2}, {item:zyx, count:5}]`)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.fill.adoc[apoc.coll.fill icon:book[]]
apoc.coll.fill(item, count) - returns a list with the given count of items
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.fillObject.adoc[apoc.coll.fillObject icon:book[]]
apoc.coll.fillObject(item, count) - returns a list of equals items with the given size
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.flatten.adoc[apoc.coll.flatten icon:book[]]
apoc.coll.flatten(coll, [recursive]) - flattens list (nested if recursive is true)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.frequencies.adoc[apoc.coll.frequencies icon:book[]]
apoc.coll.frequencies(coll) - returns a list of frequencies of the items in the collection, keyed by `item` and `count` (e.g., `[{item: xyz, count:2}, {item:zyx, count:5}, {item:abc, count:1}]`)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.frequenciesAsMap.adoc[apoc.coll.frequenciesAsMap icon:book[]]
apoc.coll.frequenciesAsMap(coll) - return a map of frequencies of the items in the collection, key `item`, value `count` (e.g., `{1:2, 2:1}`)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.indexOf.adoc[apoc.coll.indexOf icon:book[]]
apoc.coll.indexOf(coll, value) \| position of value in the list
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.insert.adoc[apoc.coll.insert icon:book[]]
apoc.coll.insert(coll, index, value) \| insert value at index
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.insertAll.adoc[apoc.coll.insertAll icon:book[]]
apoc.coll.insertAll(coll, index, values) \| insert values at index
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.intersection.adoc[apoc.coll.intersection icon:book[]]
apoc.coll.intersection(first, second) - returns the unique intersection of the two lists
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.isEqualCollection.adoc[apoc.coll.isEqualCollection icon:book[]]
apoc.coll.isEqualCollection(coll, values) return true if two collections contain the same elements with the same cardinality in any order (using a HashMap)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.max.adoc[apoc.coll.max icon:book[]]
apoc.coll.max([0.5,1,2.3])
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.min.adoc[apoc.coll.min icon:book[]]
apoc.coll.min([0.5,1,2.3])
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.occurrences.adoc[apoc.coll.occurrences icon:book[]]
apoc.coll.occurrences(coll, item) - returns the count of the given item in the collection
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.pairWithOffset.adoc[apoc.coll.pairWithOffset icon:book[]]
apoc.coll.pairWithOffset(values, offset) - returns a list of pairs defined by the offset
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.pairs.adoc[apoc.coll.pairs icon:book[]]
apoc.coll.pairs([1,2,3]) returns [1,2],[2,3],[3,null]
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.pairsMin.adoc[apoc.coll.pairsMin icon:book[]]
apoc.coll.pairsMin([1,2,3]) returns [1,2],[2,3]
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.partition.adoc[apoc.coll.partition icon:book[]]
apoc.coll.partition(list,batchSize)
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.randomItem.adoc[apoc.coll.randomItem icon:book[]]
apoc.coll.randomItem(coll)- returns a random item from the list, or null on an empty or null list
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.randomItems.adoc[apoc.coll.randomItems icon:book[]]
apoc.coll.randomItems(coll, itemCount, allowRepick: false) - returns a list of itemCount random items from the original list, optionally allowing picked elements to be picked again
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.remove.adoc[apoc.coll.remove icon:book[]]
apoc.coll.remove(coll, index, [length=1]) \| remove range of values from index to length
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.removeAll.adoc[apoc.coll.removeAll icon:book[]]
apoc.coll.removeAll(first, second) - returns first list with all elements of second list removed
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.reverse.adoc[apoc.coll.reverse icon:book[]]
apoc.coll.reverse(coll) - returns reversed list
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.runningTotal.adoc[apoc.coll.runningTotal icon:book[]]
apoc.coll.runningTotal(list1) - returns an accumulative array. For example apoc.coll.runningTotal([1,2,3.5]) return [1,3,6.5]
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.set.adoc[apoc.coll.set icon:book[]]
apoc.coll.set(coll, index, value) \| set index to value
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.shuffle.adoc[apoc.coll.shuffle icon:book[]]
apoc.coll.shuffle(coll) - returns the shuffled list
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.sort.adoc[apoc.coll.sort icon:book[]]
apoc.coll.sort(coll) sort on Collections
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.sortMaps.adoc[apoc.coll.sortMaps icon:book[]]
apoc.coll.sortMaps([maps], 'name') - sort maps by property
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.sortMulti.adoc[apoc.coll.sortMulti icon:book[]]
apoc.coll.sortMulti(coll, ['^name','age'],[limit],[skip]) - sort list of maps by several sort fields (ascending with ^ prefix) and optionally applies limit and skip
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.sortNodes.adoc[apoc.coll.sortNodes icon:book[]]
apoc.coll.sortNodes([nodes], 'name') sort nodes by property
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.sortText.adoc[apoc.coll.sortText icon:book[]]
apoc.coll.sortText(coll) sort on string based collections
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.stdev.adoc[apoc.coll.stdev icon:book[]]
apoc.coll.stdev(list, isBiasCorrected) - returns the sample or population standard deviation with isBiasCorrected true or false respectively. For example apoc.coll.stdev([10, 12, 23]) return 7
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.subtract.adoc[apoc.coll.subtract icon:book[]]
apoc.coll.subtract(first, second) - returns unique set of first list with all elements of second list removed
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.sum.adoc[apoc.coll.sum icon:book[]]
apoc.coll.sum([0.5,1,2.3])
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.sumLongs.adoc[apoc.coll.sumLongs icon:book[]]
apoc.coll.sumLongs([1,3,3])
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.toSet.adoc[apoc.coll.toSet icon:book[]]
apoc.coll.toSet([list]) returns a unique list backed by a set
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.union.adoc[apoc.coll.union icon:book[]]
apoc.coll.union(first, second) - creates the distinct union of the 2 lists
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.unionAll.adoc[apoc.coll.unionAll icon:book[]]
apoc.coll.unionAll(first, second) - creates the full union with duplicates of the two lists
|label:function[]
|label:apoc-core[]
|xref::overview/apoc.coll/apoc.coll.zip.adoc[apoc.coll.zip icon:book[]]
apoc.coll.zip([list1],[list2])
|label:function[]
|label:apoc-core[]
|===
```
|
The Vanishing Legion is a 1931 American pre-Code Western film serial from Mascot, directed by Ford Beebe and B. Reeves Eason.
Stars Harry Carey and Edwina Booth were originally intended to be in the studio's previous serial, King of the Wild, but had to be re-cast when the MGM film Trader Horn (1931) overran its schedule. Both also starred in the Mascot serial The Last of the Mohicans and Carey was the lead in The Devil Horse. An infection received while filming Trader Horn led to Booth's retirement from acting. Boris Karloff supplied the voice of the serial's mystery villain, "The Voice".
Plot
Masked mystery villain The Voice is out to sabotage the Milesburg Oil Co. "Happy" Cardigan needs to successfully drill for oil before his contract with Milesburg expires or he goes broke. Jimmie Williams' father, Jed (Edward Hearn), has been framed for murder. Secretary Caroline Hall appears to have an ulterior motive. The mysterious "Vanishing Legion" is also on the scene. Jimmie and Cardigan team up, along with Jimmie's horse Rex, to defeat The Voice and solve the mysteries surrounding Milesburg.
Cast
Harry Carey as "Happy" Cardigan, drilling for oil before his contract expires
Edwina Booth as Caroline Hall, Hornbeck's secretary
Rex the Wonder Horse as Rex, King of Wild Horses, whom only Jimmie can ride
William Desmond as Milesburg Sheriff
Frankie Darro as Jimmie Williams, whose father is wanted for murder, teams up with Cardigan to unmask The Voice
Philo McCullough as Stevens
Yakima Canutt as Yak
Joe Bonomo as Stuffy
Tom Dugan as Warren, a Milesburg Oil Company director
Lafe McKee as Hornbeck, a lawyer for the Milesburg Oil Company
Bob Kortman as Marno, henchman of The Voice
Paul Weigel as Larribee, a Milesburg Oil Company director
Olive Carey as Nurse Lewis
Boris Karloff as the voice of The Voice, the serial's masked mystery villain
Chapter titles
Voice from the Void
Queen of the Night Riders
The Invisible Enemy
The Fatal Message
The Trackless Trail
The Radio Riddle
The Crimson Clue
Doorway of Disaster
When Time Stood Still
Riding the Whirlwind
Capsule of Oblivion
Hoofs of Horror [sic]
Source:
See also
Harry Carey filmography
Boris Karloff filmography
List of film serials
List of film serials by studio
References
External links
1931 films
American black-and-white films
1930s English-language films
Films directed by B. Reeves Eason
Films directed by Ford Beebe
Mascot Pictures film serials
1931 Western (genre) films
American Western (genre) films
Works about petroleum
Films produced by Nat Levine
1930s American films
|
The Golden Dawn were an indie pop/indie rock band from Glasgow, Scotland formed in 1986, who were signed to Sarah Records on the strength of a 9-track demo. They had two hits on the UK Indie Chart in 1988 and 1989, with what have been described as "awesomely ragged, feedback-riddled singles". The band were dropped by Sarah Records, when the tracks the band put forward for a third single, "No Reason Why" and "Luminous", for the label were rejected. These songs would eventually be released in 2000 on Heaven.
Band members Robert Smith and Kenny Forte went on to form Christine's Cat (who released a 5" flexi-disc, "Your Love Is", on Sarah Records), while Smith later resurfaced as The Besotted (who released a single, "Kaleidoscope" on the Blam-A-Bit label) and as a member of Meth O.D.who released several singles and albums throughout the 1990s.
Ulric Kennedy revived his pre-Golden Dawn band The Catalysts following the release of their early demos as "The Catalysts EP" by Felicite Singles Club in 2002, belatedly following it up with the "Long Distance EP" (Spirophone, 2006). Kennedy has also worked as a producer, most notably on releases by Roy Moller (Book Club Records) and The Happy Couple (Matinee/Felicite).
Live performances
With the exception of their last performance, The Golden Dawn gave all their concerts a title that would be used in promotional posters and flyers.
"Death Of The Love Generation", Fury Murry's, 21 June 1987, Glasgow
Setlist: "Spring-Heeled Jack", "The Sun Never Shines For Me", "I Love You More Than Marilyn Monroe", "Chase My Blues Away", "George Hamilton's Dead", "The Sweetest Touch", "Song For Jane", "Fire".
"Playing Soft Tonight", Texas Fever, 27 November 1987, Glasgow
Setlist: "The Railway Track", "Our Children", "Chase My Blues Away", "Siren Song", "George Hamilton's Dead", "The Sweetest Touch", "I Love You More Than Marilyn Monroe", "My Secret World", "Pretty Poison", "Fire", "Spring-Heeled Jack", "Black".
"So Cool, So Right", Rooftops, 8 July 1988, Glasgow
Setlist: "The Railway Track", "Black", "Surf Song", "George Hamilton's Dead", "The Sweetest Touch", "The Sun Never Shines For Me", "No reason Why", "Siren Song", "Let's Build A Dyson Sphere", "My Secret World", "My Secret World", "Our Children", "Fire".
"Musick In Theory And Practice", Hollywood Studios, 9 October 1988, Glasgow
Setlist: "The Railway Track", "Our Children", "Surf Song", "Black", "Let's Build A Dyson Sphere", "No Reason Why", "George Hamilton's Dead", "Siren Song", "Fire".
Maryhill Community Centre, 13 May 1989, Glasgow
Setlist: "The Railway Track", "Surf Song", "Black", "George Hamilton's Dead", "Let's Build A Dyson Sphere", "Our Children", "Spring-Heeled Jack", "No Reason Why", "Fire".
Discography
Chart placings shown are from the UK Indie Chart.
Demos
First Demo (1986):
"Is This What We Call Love?", "Thousand Years", "Stranded"
Second Demo (1987): "Spring-Heeled Jack", "Sun Never Shines For Me", "Chase My Blues Away", "I Love You More Than Marilyn Monroe", "Shining Stars", "My Secret World", "George Hamilton's Dead", "The Sweetest Touch", "Fire"
Singles
"My Secret World" (1988), B-Sdies: "Spring-Heeled Jack", "The Railway Track",Sarah Records Catalogue Number 009 (#14)
"George Hamilton's Dead" (1989), B-Sides: "The Sweetest Touch", "Let's Build A Dyson Sphere", Sarah Records Catalogue Number 017 (#19)
"No Reason Why" (2000), B-side "Luminous" Heaven Records
Compilation appearances
Airspace! (1989) Breaking Down ("George Hamilton's Dead")
The Velvet Dawn Flexi (1989) Raving Pop Blast! ("The Sun Never Shines")
Shadow Factory (1989) Sarah ("My Secret World")
Air Balloon Road (1989) Sarah ("My Secret World", "George Hamilton's Dead")
Airpsace II (1990) Breaking Down ("No Reason Why")
Temple Cloud (1990) Sarah ("George Hamilton's Dead")
And They Call It Pop (19??) Fragrant ("Luminous")
Everlasting Happiness (19??) ("Chase My Blues Away", "Fire")
References
Scottish rock music groups
Scottish pop music groups
Musical groups from Glasgow
Musical groups established in 1986
1986 establishments in Scotland
|
```javascript
npm can handle multiple versions of a dependency
Manage local node modules with `npm link`
`config` object in `package.json`
Reduce package duplication
Hook scripts!
```
|
Charles Jay McWilliams (June 7, 1915 – October 17, 2010) was an American college basketball coach. A graduate of Penn State University, McWilliams was head coach of the Virginia Military Institute, Trinity College, and Alfred University during his twenty-year coaching career.
Coaching career
McWilliams began coaching in 1945 at the Virginia Military Institute in Lexington, Virginia. At VMI, he led the Keydets basketball team to a 1–10 season, his only one with the school. This ranks him 27th (last) at VMI in total wins and 26th in terms of winning percentage.
After returning to school in Springfield, Massachusetts for a year, McWilliams picked up coaching again at Alfred University, in Allegany County, New York. He spent ten seasons at the school, and compiled a 78–96 record with the Saxons. Following his time at Alfred, McWilliams joined Trinity College in Connecticut, where he was head basketball coach from 1957 to 1965, as well as an assistant football. McWilliams' 66–60 record at Trinity make him third all-time in school history in wins as well as winning percentage.
After his twenty-year career in collegiate athletics, McWilliams became the director of physical education for Hudson City Public Schools in Hudson, Ohio. He became the city's first director of recreation. McWilliams was also tennis coach at Ashland University after retirement.
Personal life
McWilliams attended Penn State University where he earned his Bachelor of Science in 1937. At Penn State McWilliams starred on the basketball team. He later earned a master's degree in process engineering from Springfield College in 1947. McWilliams briefly served in World War II as an athletic and recreation officer.
McWilliams died on October 17, 2010, in his hometown of Willoughby, Ohio. He preceded in death his wife, Natalie, and his three children, Kathryn, Peter, and Barbara.
Head coaching record
References
1915 births
2010 deaths
Alfred Saxons men's basketball coaches
American men's basketball players
Basketball coaches from Ohio
Basketball players from Ohio
Penn State Nittany Lions basketball players
People from Hudson, Ohio
People from Willoughby, Ohio
Springfield College alumni
Trinity Bantams men's basketball coaches
Trinity Bantams football coaches
VMI Keydets basketball coaches
|
```elixir
defmodule Commanded.ProcessManagers.ResumeCommandHandler do
@moduledoc false
@behaviour Commanded.Commands.Handler
alias Commanded.ProcessManagers.ResumeAggregate
alias Commanded.ProcessManagers.ResumeAggregate.Commands.{ResumeProcess, StartProcess}
def handle(%ResumeAggregate{} = aggregate, %StartProcess{} = start_process) do
ResumeAggregate.start_process(aggregate, start_process)
end
def handle(%ResumeAggregate{} = aggregate, %ResumeProcess{} = resume_process) do
ResumeAggregate.resume_process(aggregate, resume_process)
end
end
```
|
```objective-c
/*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* FFmpeg is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
/**
* @file
* H.265 parser code
*/
#ifndef AVCODEC_HEVC_PARSE_H
#define AVCODEC_HEVC_PARSE_H
#include "hevc.h"
int ff_hevc_decode_extradata(const uint8_t *data, int size, HEVCParamSets *ps,
int *is_nalff, int *nal_length_size,
int err_recognition, void *logctx);
#endif /* AVCODEC_HEVC_PARSE_H */
```
|
Oh-seong, also spelled Oh-sung, is a Korean masculine given name. Its meaning differs based on the hanja used to write each syllable of the name. There are 33 hanja with the reading "oh" and 27 hanja with the reading "seong" on the South Korean government's official list of hanja which may be registered for use in given names; they are listed in the table at right (four are not displayed due to encoding issues).
People with this name include:
Yu Oh-seong (born 1968), South Korean actor
Kim Oh-sung (born 1986), South Korean footballer
See also
List of Korean given names
References
Korean masculine given names
Masculine given names
|
The Homestake experiment (sometimes referred to as the Davis experiment or Solar Neutrino Experiment and in original literature called Brookhaven Solar Neutrino Experiment or Brookhaven 37Cl (Chlorine) Experiment ) was an experiment headed by astrophysicists Raymond Davis, Jr. and John N. Bahcall in the late 1960s. Its purpose was to collect and count neutrinos emitted by nuclear fusion taking place in the Sun. Bahcall performed the theoretical calculations and Davis designed the experiment. After Bahcall calculated the rate at which the detector should capture neutrinos, Davis's experiment turned up only one third of this figure. The experiment was the first to successfully detect and count solar neutrinos, and the discrepancy in results created the solar neutrino problem. The experiment operated continuously from 1970 until 1994. The University of Pennsylvania took it over in 1984. The discrepancy between the predicted and measured rates of neutrino detection was later found to be due to neutrino "flavour" oscillations.
Methodology
The experiment took place in the Homestake Gold Mine in Lead, South Dakota. Davis placed a 380 cubic meter (100,000 gallon) tank of perchloroethylene, a common dry-cleaning fluid, 1,478 meters (4,850 feet) underground. A big target deep underground was needed to prevent interference from cosmic rays, taking into account the very small probability of a successful neutrino capture, and, therefore, very low effect rate even with the huge mass of the target. Perchloroethylene was chosen because it is rich in chlorine. Upon interaction with an electron neutrino, a 37Cl atom transforms into a radioactive isotope of 37Ar, which can then be extracted and counted. The reaction of the neutrino capture is
The reaction threshold is 0.814 MeV, i.e. the neutrino should have at least this energy to be captured by the 37Cl nucleus.
Because 37Ar has a half-life of 35 days, every few weeks, Davis bubbled helium through the tank to collect the argon that had formed. A small (few cubic cm) gas counter was filled by the collected few tens of atoms of 37Ar (together with the stable argon) to detect its decays. In such a way, Davis was able to determine how many neutrinos had been captured.
Conclusions
Davis' figures were consistently very close to one-third of Bahcall's calculations. The first response from the scientific community was that either Bahcall or Davis had made a mistake. Bahcall's calculations were checked repeatedly, with no errors found. Davis scrutinized his own experiment and insisted there was nothing wrong with it. The Homestake experiment was followed by other experiments with the same purpose, such as Kamiokande in Japan, SAGE in the former Soviet Union, GALLEX in Italy, Super Kamiokande, also in Japan, and SNO (Sudbury Neutrino Observatory) in Ontario, Canada. SNO was the first detector able to detect neutrino oscillation, solving the solar neutrino problem. The results of the experiment, published in 2001, revealed that of the three "flavours" between which neutrinos are able to oscillate, Davis's detector was sensitive to only one. After it had been proven that his experiment was sound, Davis shared the 2002 Nobel Prize in Physics for contributions to neutrino physics with Masatoshi Koshiba of Japan, who worked on the Kamiokande and the Super Kamiokande (the prize was also shared with Riccardo Giacconi for his contributions to x-ray astronomy).
See also
Cowan–Reines neutrino experiment (a previous experiment by Reines and Cowan which discovered the antineutrino)
Sanford Underground Research Facility
References
Physics experiments
Neutrino observatories
|
```css
Vertical centering fluid blocks
Clearfix for layouts
Difference between `display: none` and `visibility: hidden`
Controlling cellpadding and cellspacing in CSS
Vertically-center anything
```
|
An interview is a structured conversation where one participant asks questions, and the other provides answers. In common parlance, the word "interview" refers to a one-on-one conversation between an interviewer and an interviewee. The interviewer asks questions to which the interviewee responds, usually providing information. That information may be used or provided to other audiences immediately or later. This feature is common to many types of interviews – a job interview or interview with a witness to an event may have no other audience present at the time, but the answers will be later provided to others in the employment or investigative process. An interview may also transfer information in both directions.
Interviews usually take place face-to-face, in person, but the parties may instead be separated geographically, as in videoconferencing or telephone interviews. Interviews almost always involve spoken conversation between two or more parties. In some instances a "conversation" can happen between two persons who type their questions and answers.
Interviews can be unstructured, free-wheeling and open-ended conversations without predetermined plan or prearranged questions. One form of unstructured interview is a focused interview in which the interviewer consciously and consistently guides the conversation so that the interviewee's responses do not stray from the main research topic or idea. Interviews can also be highly structured conversations in which specific questions occur in a specified order. They can follow diverse formats; for example, in a ladder interview, a respondent's answers typically guide subsequent interviews, with the object being to explore a respondent's subconscious motives. Typically the interviewer has some way of recording the information that is gleaned from the interviewee, often by keeping notes with a pencil and paper, or with a video or audio recorder.
The traditionally two-person interview format, sometimes called a one-on-one interview, permits direct questions and follow-ups, which enables an interviewer to better gauge the accuracy and relevance of responses. It is a flexible arrangement in the sense that subsequent questions can be tailored to clarify earlier answers. Further, it eliminates possible distortion due to other parties being present.
Contexts
Interviews can happen in a wide variety of contexts:
Employment. A job interview is a formal consultation for evaluating the qualifications of the interviewee for a specific position. One type of job interview is a case interview in which the applicant is presented with a question or task or challenge, and asked to resolve the situation. Candidates may be treated to a mock interview as a training exercise to prepare the respondent to handle questions in the subsequent 'real' interview. A series of interviews may be arranged, with the first interview sometimes being a short screening interview, followed by more in-depth interviews, usually by company personnel who can ultimately hire the applicant. Technology has enabled new possibilities for interviewing; for example, video telephony has enabled inteviewing applicants from afar.
Psychology. Psychologists use a variety of interviewing methods and techniques to try to understand and help their patients. In a psychiatric interview, a psychiatrist or psychologist or nurse asks a battery of questions to complete what is called a psychiatric assessment. Sometimes two people are interviewed by an interviewer, with one format being called couple interviews. Criminologists and detectives sometimes use cognitive interviews on eyewitnesses and victims to try to ascertain what can be recalled specifically from a crime scene, hopefully before the specific memories begin to fade in the mind.
Marketing and Academic. In marketing research and academic research, interviews are used in a wide variety of ways as a method to do extensive personality tests. Interviews are the most used form of data collection in qualitative research. Interviews are used in marketing research as a tool that a firm may utilize to gain an understanding of how consumers think. Consumer research firms sometimes use computer-assisted telephone interviewing to randomly dial phone numbers to conduct highly structured telephone interviews, with scripted questions and responses entered directly into the computer.
Journalism and other media. Typically, reporters covering a story in journalism conduct interviews over the phone and in person to gain information for subsequent publication. Reporters also interview government officials and political candidates for broadcast. In a talk show, a radio or television "host" interviews one or more people, with the topic usually chosen by the host, sometimes for the purposes of entertainment, sometimes for informational purposes. Such interviews are often recorded.
Other situations. Sometimes college representatives or alumni conduct college interviews with prospective students as a way of assessing a student's suitability while offering the student a chance to learn more about a college. Some services specialize in coaching people for interviews. Embassy officials may conduct interviews with applicants for student visas before approving their visa applications. Interviewing in legal contexts is often called interrogation. Debriefing is another kind of interview.
Blind interview
In a blind interview the identity of the interviewee is concealed so as to reduce interviewer bias. Blind interviews are sometimes used in the software industry and are standard in orchestral auditions. Blind interviews have been shown in some cases to increase the hiring of minorities and women.
Interviewer bias
The relationship between the interviewer and interviewee in research settings can have both positive and negative consequences. Their relationship can bring deeper understanding of the information being collected, however this creates a risk that the interviewer will be unable to be unbiased in their collection and interpretation of information. Bias can be created from the interviewers perception of the interviewee, or from the interviewee's perception of the interviewer. Additionally, a researcher can bring biases to the table based on the researcher’s mental state, their preparedness for conducting the research, and the researcher conducting inappropriate interviews. Interviewers can use various practices known in qualitative research to mitigate interviewer bias. These practices include subjectivity, objectivity, and reflexivity. Each of these practices allows the interviewer, or researcher, the opportunity to use their bias to enhance their work by gaining a deeper understanding of the problem they are studying.
See also
Repertory grid interview
In research
Telephone interview
Computer assisted telephone interviewing
Interview (research)
Knowledge transfer
Online interview
Mall intercept interview
Qualitative research interview
Structured interview
Unstructured interview
In journalism and media
Interview (journalism)
Talk show
In other contexts
College interview
Reference interview, between a librarian and a library user
References
Survey methodology
|
```python
#
# 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.
#
"""
Query 11, How many bids did a user make in each session he was active?
(Not in original suite.)
Group bids by the same user into sessions with window_size_sec max gap.
However limit the session to at most max_log_events. Emit the number of
bids per session.
"""
import apache_beam as beam
from apache_beam.testing.benchmarks.nexmark.queries import nexmark_query_util
from apache_beam.testing.benchmarks.nexmark.queries.nexmark_query_util import ResultNames
from apache_beam.transforms import trigger
from apache_beam.transforms import window
def load(events, metadata=None, pipeline_options=None):
return (
events
# filter to get only bids and then extract bidder id
| nexmark_query_util.JustBids()
| 'query11_extract_bidder' >> beam.Map(lambda bid: bid.bidder)
# window auction and key by auctions' seller
| 'query11_session_window' >> beam.WindowInto(
window.Sessions(metadata.get('window_size_sec')),
trigger=trigger.AfterWatermark(
early=trigger.AfterCount(metadata.get('max_log_events'))),
accumulation_mode=trigger.AccumulationMode.DISCARDING,
allowed_lateness=metadata.get('occasional_delay_sec') // 2)
# count per bidder
| beam.combiners.Count.PerElement()
| beam.Map(
lambda bidder_count: {
ResultNames.BIDDER_ID: bidder_count[0],
ResultNames.BID_COUNT: bidder_count[1]
}))
```
|
```swift
import Foundation
import UIKit
public extension String {
typealias Attributes = [NSAttributedString.Key: Any]
/**
Interprets `self` as an HTML string to produce an attributed string.
- parameter base: The base attributes to use for the attributed string.
- parameter bold: Optional attributes to use on bold tags. If not specified it will be derived
from `font`.
- parameter italic: Optional attributes for use on italic tags. If not specified it will be derived
from `font`.
- returns: The attributed string, or `nil` if something goes wrong with interpreting the string
as html.
*/
func simpleHtmlAttributedString(
base: Attributes,
bold optionalBold: Attributes? = nil,
italic optionalItalic: Attributes? = nil
) -> NSAttributedString? {
func parsedHtml() -> NSAttributedString? {
let baseFont = (base[NSAttributedString.Key.font] as? UIFont) ?? UIFont.systemFont(ofSize: 12.0)
// If bold or italic are not specified we can derive them from `font`.
let bold = optionalBold ?? [NSAttributedString.Key.font: baseFont.bolded]
let italic = optionalItalic ?? [NSAttributedString.Key.font: baseFont.italicized]
guard let data = self.data(using: String.Encoding.utf8) else { return nil }
let options: [NSAttributedString.DocumentReadingOptionKey: Any] = [
NSAttributedString.DocumentReadingOptionKey.documentType: NSAttributedString.DocumentType.html,
NSAttributedString.DocumentReadingOptionKey.characterEncoding: String.Encoding.utf8.rawValue
]
guard let string = try? NSMutableAttributedString(data: data, options: options, documentAttributes: nil)
else {
return nil
}
// Sub all bold and italic fonts in the attributed html string
let stringRange = NSRange(location: 0, length: string.length)
string.beginEditing()
string
.enumerateAttribute(NSAttributedString.Key.font, in: stringRange, options: []) { value, range, _ in
guard let htmlFont = value as? UIFont else { return }
let newAttributes: Attributes
if htmlFont.fontDescriptor.symbolicTraits.contains(.traitBold) {
newAttributes = bold
} else if htmlFont.fontDescriptor.symbolicTraits.contains(.traitItalic) {
newAttributes = italic
} else {
newAttributes = base
}
string.addAttributes(newAttributes, range: range)
}
string.endEditing()
return string
}
if Thread.isMainThread {
return parsedHtml()
} else {
return DispatchQueue.main.sync {
parsedHtml()
}
}
}
/**
Interprets `self` as an HTML string to produce an attributed string.
- parameter font: The base font to use for the attributed string.
- parameter bold: An optional font for bolding. If not specified it will be derived from `font`.
- parameter italic: An optional font for italicizing. If not specified it will be derived
from `font`.
- returns: The attributed string, or `nil` if something goes wrong with interpreting the string
as html.
*/
func simpleHtmlAttributedString(
font: UIFont,
bold optionalBold: UIFont? = nil,
italic optionalItalic: UIFont? = nil
) -> NSAttributedString? {
return self.simpleHtmlAttributedString(
base: [NSAttributedString.Key.font: font],
bold: optionalBold.flatMap { [NSAttributedString.Key.font: $0] },
italic: optionalItalic.flatMap { [NSAttributedString.Key.font: $0] }
)
}
/**
Removes all HTML from `self`.
- parameter trimWhitespace: If `true`, then all whitespace will be trimmed from the stripped string.
Defaults to `true`.
- returns: A string with all HTML stripped.
*/
func htmlStripped(trimWhitespace: Bool = true) -> String? {
func parsedHtml() -> String? {
guard let data = self.data(using: String.Encoding.utf8) else { return nil }
let options: [NSAttributedString.DocumentReadingOptionKey: Any] = [
NSAttributedString.DocumentReadingOptionKey.documentType: NSAttributedString.DocumentType.html,
NSAttributedString.DocumentReadingOptionKey.characterEncoding: String.Encoding.utf8.rawValue
]
let string = try? NSAttributedString(data: data, options: options, documentAttributes: nil)
let result = string?.string
if trimWhitespace {
return result?.trimmingCharacters(in: .whitespacesAndNewlines)
}
return result
}
if Thread.isMainThread {
return parsedHtml()
} else {
return DispatchQueue.main.sync {
parsedHtml()
}
}
}
}
// MARK: - Functions
func == (lhs: String.Attributes, rhs: String.Attributes) -> Bool {
return NSDictionary(dictionary: lhs).isEqual(to: rhs)
}
```
|
The UBS 100 Index is a Swiss share index launched in April 1987. It tracks the 100 Swiss companies with the largest market capitalizations that are listed on the SIX Swiss stock exchange. In 2022, the UBS 100 Index covered 98% of the publicly traded shares of Swiss companies, measured by free-float market capitalization.
In April 1987, the UBS 100 Index began at 1000 points. On 16th September 2022, the index registered at 640 points, and the three largest constituents (Nestlé, Novartis and Roche) made up 48.83% of the assets of an ETF that tracks the index.
References
Swiss stock market indices
|
```javascript
#version 450
layout(location = 0) in vec4 vA;
layout(location = 1) in float vB;
layout(location = 0) out vec4 FragColor;
void main()
{
FragColor = round(vA);
FragColor *= round(vB);
}
```
|
Rudolf Steiner I (20 October 1903 – 24 January 1994) was a Romanian football midfielder.
International career
Rudolf Steiner played five friendly games for Romania. He and his brother Adalbert made their debut together in a 3–1 away victory against Turkey in 1926.
Personal life
His father, Karl Steiner was an engineer that was born in Bohemia who settled in Timișoara where he got married and had eight children. One of Rudolf's brothers, Adalbert Steiner was also a footballer, they played together at Chinezul Timișoara and Romania's national team.
Honours
Chinezul Timișoara
Divizia A: 1926–27
Notes
References
1903 births
1994 deaths
Romanian men's footballers
Romania men's international footballers
Men's association football midfielders
Liga I players
Footballers from Timișoara
Chinezul Timișoara players
|
Jean-Louis Bernard is a French author. He writes about mysticism and esotericism.
Studies
He studies german and audio-visual in La Sorbonne in Paris (France) and obtains a Master of Educational Sciences at Paris-Descartes University. He learns also staging with famous actor and stage director Jean-Louis Barrault at Théâtre du Rond Point in Paris.
Career
Editor
President of Emergences Littéraires et Artistiques : literary director, publisher, he edits in the 90s several books. Poems from Anne Vinh, Empire Céleste, and from Basile Gonnord, La raison d’être. Jean-Louis Bernard publishes various texts too, among them a collective work with authors as Jean-Louis Bernard, France Curat, Basile Gonnord, and illustrated by Sigrid Hagel.
Journalist
La Vie magazine publishes his interviews with famous writers, Régine Deforges, Hector Bianciotti, Jean-Marie Pelt , director of the European Institute of Ecology, and a novel En suivant l’étoile
Speaker
He animates regularly at the Forum of Club Méditerranée, in France, Greece, Marocco, Portugal, series of conferences and seminars of one week about reincarnation, dreams interprétations and also seminars about reincarnation and dreams interpretation in Paris and in Fort-de-France (Martinique)
Published works
Nô, theater piece at Emergences editions *Co-author with Bernard Duboy of :
Les autres vies et la réincarnation, essai, éditions du Rocher, 1992
A reencarnaçao es as vidas anteriores, en portugais éditions Estampa 1993
Mehdi l'initiation d'un soufi, éditions du Rocher, 1994
Mehdi l'initiation d'un soufi édition de poche Pocket 1997
Sogni nel deserto (una iniziazione Sufi) en italien éditions Xenia 1997
Contributed to collective work Il Sofà delle fusa (40 accademici raccontano i loro gatti) éditions Felinamente 1999
Notes and references
Living people
Year of birth missing (living people)
20th-century French writers
|
James Madison Carpenter, born in 1888 in Blacklands, Mississippi, near Booneville, in Prentiss County, was a Methodist minister and scholar of American and British folklore. He received his Bachelor of Arts and Master of Arts degrees from the University of Mississippi, and the Doctor of Philosophy degree from Harvard in 1929. He is best known for his substantial work collecting folk songs in England, Scotland and Wales. He recorded well-known singers and musicians that other folklorists had documented, as well as some never recorded before or since such as Bell Duncan, whose repertoire (according to Carpenter) consisted of some 300 songs, including 65 Child ballads. His collection methods included Dictaphone recordings as well as transcriptions of lyrics.
Carpenter's method of collecting songs often involved recording several verses using the Dictaphone cylinder machine, then asking the singer to start again and dictate the words of the song, two lines at a time, while he typed them up on a portable typewriter.
Carpenter returned to Harvard in 1935 where he gave occasional lectures and worked on transcribing the tunes of the ballads he had collected, intending to put the material into publishable form. From 1938 to 1943 he taught part-time at Duke University in the English Department. In 1943 he took another post in Virginia and finally moved to the English Department at Greensboro College, North Carolina, where he stayed until his retirement in 1954. He returned to Booneville in 1964 and remained there until his death in 1983.
In the end, only a handful of items from his collection were ever published. His extensive material eventually found a home at the American Folklife Center at the Library of Congress where it has been made accessible (and searchable). It is considered "a major collection of traditional song and drama, plus some items of traditional instrumental music, dance, custom, narrative and children's folklore, from England, Scotland, Wales, Ireland and the US, documented in the period 1927-55." In 2003, the James Madison Carpenter Collection Online Catalogue, the University of Sheffield, and the American Folklife Center, Library of Congress, were jointly awarded the Brenda McCallum Prize of the American Folklore Society for their work on the Carpenter Collection. In 2018, the fully digitised James Madison Carpenter Collection was made available online on the Vaughan Williams Memorial Library’s digital archive.
For a more extensive biography see "'Dr Carpenter from the Harvard College in America': An Introduction to James Madison Carpenter and his Collection" by Julia C. Bishop, Folk Music Journal, 7/4, 1998, pp. 402–420. This is the first article in a special issue of the Journal devoted to Carpenter and his collection.
References
The James Madison Carpenter Collection (Vaughan Williams Memorial Library)
The James Madison Carpenter Collection Online Catalogue (University of Sheffield)
The James Madison Carpenter Collection (Library of Congress, America Folklife Center)
External links
The James Madison Carpenter Collection via the Vaughan Williams Memorial Library
Two hour interview with James Madison Carpenter
American Folklife Center
The James Madison Carpenter Collection Project at the Elphinstone Institute, University of Aberdeen, Scotland
Folk collection returns ‘back home’ to new audiences – Vaughan Williams Memorial Library news story
1888 births
1983 deaths
Harvard University alumni
American folk-song collectors
University of Mississippi alumni
People from Booneville, Mississippi
20th-century American musicologists
|
```javascript
'use strict';
var directivesModule = require('./_index.js');
/**
* @ngInject
*/
function statDirective() {
return {
scope: {
data: '=data'
},
templateUrl: 'stat.html',
};
}
directivesModule.directive('stat', statDirective);
```
|
Vadim Slivchenko (born March 28, 1970) is a Ukrainian retired professional ice hockey player.
Slivchenko competed at the 1999 and 2001 IIHF World Championships as a member of the Ukraine men's national ice hockey team. He also competed with Team Ukraine at the 2002 Winter Olympics.
Career statistics
Regular season and playoffs
International
References
External links
1970 births
Living people
Chatham Wheels players
EHC Freiburg players
ETC Crimmitschau players
Färjestad BK players
Frankfurt Lions players
Greensboro Monarchs players
Houston Aeros (1994–2013) players
Krefeld Pinguine players
Schwenninger Wild Wings players
Sokil Kyiv players
Sportspeople from Kharkiv
Ukrainian ice hockey right wingers
Wheeling Nailers players
Wheeling Thunderbirds players
Wiener EV players
Olympic ice hockey players for Ukraine
Ice hockey players at the 2002 Winter Olympics
Portland Rage players
Sacramento River Rats players
Ukrainian expatriate sportspeople in Canada
Ukrainian expatriate sportspeople in the United States
|
```xml
import * as React from 'react';
import { Flex, Text } from '@fluentui/react-northstar';
const TextExampleRtl = () => (
<Flex column gap="gap.small">
<div>
<Text content=" !" />
<Text content=" " />
</div>
<Text content="Hello world!" />
<Text content=" !" />
</Flex>
);
export default TextExampleRtl;
```
|
The Kabul Khel are a Pashtun tribe in Pakistan.
History
In November 1859, Britain launched a punitive expedition against the Kabul Khel following the murder of a British officer in Latammar on the 5 November. The largest battle of this conflict took place at the Maidani hills, where British forces suffered 11 casualties.
References
Pashtun tribes
Social groups of Pakistan
|
```rust
//! Code for interacting with ZooKeeper to determine which Noria worker acts as the controller, and
//! for detecting failed controllers which necessitate a controller changeover.
use failure::Error;
use serde::de::DeserializeOwned;
use serde::Serialize;
mod local;
mod zk;
pub use self::local::LocalAuthority;
pub use self::zk::ZookeeperAuthority;
pub const CONTROLLER_KEY: &str = "/controller";
pub const STATE_KEY: &str = "/state";
#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord, Serialize, Deserialize)]
pub struct Epoch(i64);
pub enum ElectionResult {
Won(Epoch),
Lost { epoch: Epoch, payload: Vec<u8> },
}
pub trait Authority: Send + Sync {
/// Attempt to become leader. Returns leader epoch or None if there already was a leader. The
/// payload_data must be unique among all possible leaders to avoid confusion about which was
/// elected.
fn become_leader(&self, payload_data: Vec<u8>) -> Result<Option<Epoch>, Error>;
/// Voluntarily give up leadership, allowing another node to become leader. It is extremely
/// important that the node calling this function is actually the leader.
fn surrender_leadership(&self) -> Result<(), Error>;
/// Returns the epoch and payload data for the current leader, blocking if there is not
/// currently as leader. This method is intended for clients to determine the current leader.
fn get_leader(&self) -> Result<(Epoch, Vec<u8>), Error>;
/// Same as `get_leader` but return None if there is no leader instead of blocking.
fn try_get_leader(&self) -> Result<Option<(Epoch, Vec<u8>)>, Error>;
/// Wait until it is no longer the epoch indicated in `current_epoch`, and then return the new
/// epoch or None if a new epoch hasn't started yet. This method enables a leader to watch to
/// see if it has been overthrown.
fn await_new_epoch(&self, current_epoch: Epoch) -> Result<Option<(Epoch, Vec<u8>)>, Error>;
/// Do a non-blocking read at the indicated key.
fn try_read(&self, key: &str) -> Result<Option<Vec<u8>>, Error>;
/// Repeatedly attempts to do a read modify write operation. Each attempt consists of a read of
/// the indicated node, a call to `f` with the data read (or None if the node did not exist),
/// and finally a write back to the node if it hasn't changed from when it was originally
/// written. The process aborts when a write succeeds or a call to `f` returns `Err`. In either
/// case, returns the last value produced by `f`.
fn read_modify_write<F, P, E>(&self, key: &str, f: F) -> Result<Result<P, E>, Error>
where
F: FnMut(Option<P>) -> Result<P, E>,
P: Serialize + DeserializeOwned;
}
```
|
Noémi Szécsi (born 1976) is a Hungarian writer and translator. She was educated in Budapest and Helsinki. Her debut novel The Finno-Ugrian Vampire was published in 2002, and later translated into English. Her historical novel Communist Monte Cristo (2006) won the EU Prize for Literature.
References
1976 births
Hungarian women novelists
Living people
Historical novelists
Hungarian translators
21st-century Hungarian women writers
Women historical novelists
21st-century Hungarian novelists
21st-century translators
Date of birth missing (living people)
|
The Middle Fork Stanislaus River is a tributary of the Stanislaus River in the central Sierra Nevada and Stanislaus National Forest of eastern California.
Geography
The river begins at the confluence of Kennedy Creek and Summit Creek in the Emigrant Wilderness. It flows initially northwest, receiving the Clark Fork from the right then turning southwest, through a deep canyon to its confluence with the North Fork Stanislaus River, forming the Stanislaus River. The river drains a watershed of in Tuolumne County, much of it within the Stanislaus National Forest.
Power and water infrastructure
There are four dams on the main stem of the Middle Fork – at Donnells, Beardsley, Beardsley Forebay and Sand Bar Flat. The only significant tributary impoundment is Relief Reservoir, formed by Relief Dam on Summit Creek. Middle Fork water is managed by the Spring Gap–Stanislaus hydroelectric project, owned by Pacific Gas and Electric, and the Tri-Dam project owned by the Oakdale and South San Joaquin irrigation districts.
Tunnels connect the four mainstem reservoirs to take advantage of the hydraulic head created by the Middle Fork's steep drop. The final tunnel, from Sand Bar Flat, enters the main Stanislaus River about below the mouth of the Middle Fork, at the head of New Melones Lake reservoir. As a result, much of the Middle Fork is dewatered during the drier months.
See also
List of rivers of California
References
External links
Rivers of the Sierra Nevada (United States)
Rivers of Tuolumne County, California
Stanislaus National Forest
Rivers of Northern California
Rivers of the Sierra Nevada in California
|
Boat Harbour West 37 is a Mi'kmaq reserve located in Pictou County, Nova Scotia.
It was created between 1962 and 1963, and its 98.2 ha are used solely by the Pictou Landing First Nation.
References
Indian reserves in Nova Scotia
Communities in Pictou County
Pictou Landing First Nation
|
Progress for America (PFA) (a 501(c)(4)) and its affiliate Progress for America Voter Fund (PFA-VF) (a 527 committee) are national tax-exempt organizations in the United States. PFA was established in 2001 to support George W. Bush's "agenda for America". The PFA Voter Fund, which was set up in 2004, raised US$38 million in support of Bush's 2004 election bid.
History
PFA was registered as a 501(c)(4) group in February 2001 by Tony Feather, a political director of the Bush-Cheney 2000 campaign and partner at DCI Group as well as at the affiliated telemarketing and fundraising firm of Feather Larson Synhorst-DCI (FLS-DCI). Feather set up PFA as a "grassroots organization that mobilizes the public to contact their members of Congress about pending legislation and to write local newspapers to publicize the White House's agenda," the Center for Public Integrity wrote in 2002. During the first part of the Bush administration, it led campaigns to support tax cuts, conservative judicial appointments and energy legislation.
Feather told The Washington Post in August 2002 that PFA was simply a vehicle for building grassroots support for Bush administration policies. However others said it was intended to accept soft money donations which political parties were barred from accepting starting in 2002. Feather left PFA in 2003 after receiving a legal opinion that his involvement with it and the Bush-Cheney campaign could violate regulations barring coordination between the entities.
PFA spin-offs and projects
Progress for America Voter Fund
On July 21, 2004, complaints were filed with the Federal Election Commission (FEC) by Democracy 21, the Campaign Legal Center, and OpenSecrets. The Complaints charged that Progress for America Voter Fund (PFA-VF) was illegally raising and spending soft money to influence the 2004 presidential elections.
On February 28, 2007, the Federal Election Commission (FEC) reached a settlement with Progress for America related to its activities in 2004. In the 2004 election cycle, the Fund had raised US$45 million. Under the terms of the settlement, PFA-VF did not admit to any wrongdoing, and agreed to pay US$750,000 and to register as a political committee if it undertakes any activities similar to those in 2004. The FEC stated: "Over US$41 million of those funds consisted of excessive contributions from individuals, while over US$2 million came from sources prohibited from making contributions . . . ."
Ashley and friends
PFA-VF spent US$14.2 million on ad time for "Ashley's Story", which ran on cable stations and in nine key states. According to USA Today, the ad was supported by ashleysstory.com, as well as "e-mails, automated phone calls and 2.3 million brochures" mailed to voters.
Push for privatized Social Security
After winning re-election in 2004, Bush emphasized changes in Social Security as a major domestic goal of his second term. He called for partial privatization of the system. PFA "has estimated it will spend US$20 million promoting private accounts. It has run a series of ads on cable television, including a spot that invokes the legacy of Democratic President Franklin Roosevelt, who signed the legislation creating the retirement system", the Houston Chronicle reported in February 2005.
In late February 2005, the Houston Chronicle reported that Texas A&M University economics professor Thomas R. Saving had joined up with Progress for America as an advisor and spokesman. Saving, however, is serving as one of seven trustees for the Social Security Administration, raising questions about potential conflicts of interest between his advocacy work at PFA and his role as a Social Security "trustee". Saving is also a fellow at the National Center for Policy Analysis. According to the Chronicle, former US Treasurer Rosario Marin joined PFA as an advisor as well.
"I'm interested in the issues and I'm working on them and I'll continue to work on them", Saving told the Chronicle. "I already do an awful lot of speeches about Social Security and Medicare."
Federal judicial battles
In May 2005, PFA began running ads targeted at pressuring Republicans Senators into supporting a ban on Senate filibusters for judicial nominations. Associated Press reported that PFA would spend US$350,000 on "radio ads on Christian stations" and US$1.5 million on television ads to be run in Alaska, Arkansas, Maine, North Dakota, Nebraska and Rhode Island as well as nationally.
In June 2005, The Hill reported that PFA intended to "spend at least US$18 million on the expected fight to replace William Rehnquist, chief justice of the US Supreme Court". PFA's campaign would include "national cable-news and broadcast-television ads in targeted states. The group will also coordinate grassroots organizers and public-relations specialists in eighteen states, including states represented by centrist Republican senators such as Arizona, Maine and Oregon" The Hill wrote. The groups will also use phone-bank and direct-mail in its campaign. "Before Senate confirmation of Owen and Brown, PFA claims to have helped generate nearly 80,000 telephone calls supporting their nominations", The Hill reported. PFA will work closely with the Judicial Confirmation Network and the Committee for Justice on the campaign.
On June 22, 2005, PFA issued a press release announcing a US$700,000 campaign in anticipation of a Supreme Court Justice vacancy during the Court's summer break. The campaign included buys on big newspapers' internet websites, and a roll-out of a new website: upordownvote.com.
Iraq War advertising campaign
Starting in 2006, Progress for America began an ad campaign in support of the Iraq War, with a US$1 million ad campaign in Minnesota. Progress for America spokesman Stuart Roy said the group purchased "a saturation buy" in Minnesota and said that bolstering support for the war now "will be a major focus, if not the major focus of Progress for America". These ads often feature war veterans speaking in support for the war and for then President Bush.
References
External links
Official website
"Progress for America", OpenSecrets.org.
Nicholas Confessore, "Bush's Secret Stash," Washington Monthly, May 1, 2004.
Glen Justice and Jim Rutenberg, "Advocacy Groups Step Up Costly Battle of Political Ads", The New York Times, September 25, 2004, A10.
Glen Justice, "New Pet Cause for the Very Rich: Swaying the Election", The New York Times, September 25, 2004, A10.
Thomas Edsall, "After Late Start, Republican Groups Jump Into the Lead", Washington Post, October 17, 2004, page A17.
Laura Miller, "The Fix Behind Fixing Social Security," PR Watch, 2005 (Vol. 12, No. 1).
Glen Justice, "Social Security Fight Begins, Over a Bill Still Nonexistent," New York Times, February 17, 2005.
527 organizations
501(c)(4) nonprofit organizations
|
```xml
import 'reflect-metadata';
import { deserialize, deserializeArray, serialize } from '../../src/index';
import { defaultMetadataStorage } from '../../src/storage';
import { Exclude } from '../../src/decorators';
describe('serialization and deserialization objects', () => {
it('should perform serialization and deserialization properly', () => {
defaultMetadataStorage.clear();
class User {
firstName: string;
lastName: string;
@Exclude()
password: string;
}
const user = new User();
user.firstName = 'Umed';
user.lastName = 'Khudoiberdiev';
user.password = 'imnosuperman';
const user1 = new User();
user1.firstName = 'Dima';
user1.lastName = 'Zotov';
user1.password = 'imnosuperman';
const user2 = new User();
user2.firstName = 'Bakhrom';
user2.lastName = 'Baubekov';
user2.password = 'imnosuperman';
const users = [user1, user2];
const plainUser = {
firstName: 'Umed',
lastName: 'Khudoiberdiev',
password: 'imnosuperman',
};
const plainUsers = [
{
firstName: 'Dima',
lastName: 'Zotov',
password: 'imnobatman',
},
{
firstName: 'Bakhrom',
lastName: 'Baubekov',
password: 'imnosuperman',
},
];
const plainedUser = serialize(user);
expect(plainedUser).toEqual(
JSON.stringify({
firstName: 'Umed',
lastName: 'Khudoiberdiev',
})
);
const plainedUsers = serialize(users);
expect(plainedUsers).toEqual(
JSON.stringify([
{
firstName: 'Dima',
lastName: 'Zotov',
},
{
firstName: 'Bakhrom',
lastName: 'Baubekov',
},
])
);
const classedUser = deserialize(User, JSON.stringify(plainUser));
expect(classedUser).toBeInstanceOf(User);
expect(classedUser).toEqual({
firstName: 'Umed',
lastName: 'Khudoiberdiev',
});
const classedUsers = deserializeArray(User, JSON.stringify(plainUsers));
expect(classedUsers[0]).toBeInstanceOf(User);
expect(classedUsers[1]).toBeInstanceOf(User);
const userLike1 = new User();
userLike1.firstName = 'Dima';
userLike1.lastName = 'Zotov';
const userLike2 = new User();
userLike2.firstName = 'Bakhrom';
userLike2.lastName = 'Baubekov';
expect(classedUsers).toEqual([userLike1, userLike2]);
});
it('should successfully deserialize object with unknown nested properties ', () => {
defaultMetadataStorage.clear();
class TestObject {
prop: string;
}
const payload = {
prop: 'Hi',
extra: {
anotherProp: "let's see how this works out!",
},
};
const result = deserialize(TestObject, JSON.stringify(payload));
expect(result).toBeInstanceOf(TestObject);
expect(result.prop).toEqual('Hi');
// TODO: We should strip, but it's a breaking change
// (<any>result).extra.should.be.undefined;
});
it('should not overwrite non writable properties on deserialize', () => {
class TestObject {
get getterOnlyProp(): string {
return 'I cannot write!';
}
normalProp: string = 'Hello!';
}
const payload = {
getterOnlyProp: 'I CAN write!',
normalProp: 'Goodbye!',
};
const result = deserialize(TestObject, JSON.stringify(payload));
expect(result.getterOnlyProp).toEqual('I cannot write!');
expect(result.normalProp).toEqual('Goodbye!');
});
});
```
|
```shell
#!/bin/bash
#
# env.sh -- edit uboot environment for prebuilt uboot images
#
#
ROOT_IMAGE=${U_ROOT_IMAGE}
DTB_IMAGE=${U_DTB_IMAGE}
KERNEL_IMAGE=${U_KERNEL_IMAGE}
BOOT_CMD=${U_BOOT_CMD}
IMAGES_DIR=${TFTPBOOT}
UBOOT_IMAGE=${BIMAGE}
# Save env to the last 1M of pflash
if [ -n "$ENV_IMG" ]; then
[ ! -f $PFLASH_IMG ] && truncate -s $((PFLASH_SIZE * 1024))K $PFLASH_IMG
dd if=$ENV_IMG of=$PFLASH_IMG bs=1M seek=$ENV_OFFSET conv=notrunc status=none
fi
```
|
The 2014 Women's Challenge Cup was an English rugby league knockout tournament competed for during the summer of 2014. The Challenge Cup was won by Thatto Heath St Helens who beat Bradford Thunderbirds 32–24 in the final. The Challenge Shield was won by Fetherstone Rovers who beat Stanningley 64–14 in the final. Both finals took place on 3 August 2014 at the Tetley's Stadium, Dewsbury.
Preliminary round
Matches in the preliminary round took place on 27 April and 4 May:
Cumbria Crusaders 0 – 46 Wigan St Patricks
Oulton Raidettes 20 – 18 Selby Warriors
Round One
The first round took place on 11 May:
Bradford Thunderbirds 48 – 6 Stanningley
Fryston Warriors 70 – 6 Hunslet Hawks
Normanton Knights 22 – 20 Featherstone Rovers
Rochdale Hornets 8 – 18 Oulton Raidettes
West Craven Warriors 4 – 76 Army RL
Round Two
The second round took place on 15 June:
Bradford Thunderbirds 78 – 0 Oulton Raidettes
Brighouse 8 – 48 Fryston Warriors
Thatto Heath St Helens 30 – 16 Army RL
Normanton Knights – ?
Semi Finals
The semi-finals had been completed before 24 July when the venue for the final was confirmed.
Final
The fixture was a repeat of the 2013 Final which had been won by Thatto Heath. The 2014 final took place on 3 August at the Tetley's Stadium, Dewsbury. The score was Thatto Heath St Helens 32–24 Bradford Thunderbirds.
Challenge Shield
Shield Round One
The first round took place on 15 June:
Rochdale Hornets 0 – 72 Featherstone Rovers
Selby Warriors 30 – 14 West Craven Warriors
Stanningley 34 – 16 Leigh Miners Rangers
Shield Semi Finals
The semi-finals had been completed before 24 July when the venue for the final was confirmed.
Shield Final
The final took place on 3 August 2014 at the Tetley's Stadium, Dewsbury. The score was Featherstone Rovers 64–14 Stanningley.
References
RFL Women's Challenge Cup
2014 in English rugby league
2014 in English women's sport
|
```css
/* Sidebar Numbers */
.nav-account.loan .negative {
background-color: #fff !important;
background-color: var(--sidebarAccountNegativeBalanceBackground) !important;
color: #ca481d !important;
color: var(--labelNegative) !important;
border-radius: 1em;
display: block;
font-weight: 700 !important;
margin: 0 -0.265rem 0.2rem 0.5rem !important;
margin-bottom: 0.2em;
margin-right: -0.265rem;
padding: 0 0.4em !important;
overflow: hidden;
text-overflow: ellipsis;
white-space: nowrap;
}
```
|
Jaanu may refer to:
Jaanu (2012 film), a 2012 Indian Kannada-language film
Jaanu (2020 film), a 2020 Indian Telugu-language film
See also
Ok Jaanu, a 2017 Indian Hindi-language film
|
```kotlin
package expo.modules.adapters.react.apploader
import android.content.Context
import com.facebook.react.ReactApplication
import com.facebook.react.ReactInstanceEventListener
import com.facebook.react.ReactInstanceManager
import com.facebook.react.bridge.ReactContext
import com.facebook.react.common.LifecycleState
import expo.modules.apploader.HeadlessAppLoader
import expo.modules.core.interfaces.Consumer
import expo.modules.core.interfaces.DoNotStrip
private val appRecords: MutableMap<String, ReactInstanceManager> = mutableMapOf()
class RNHeadlessAppLoader @DoNotStrip constructor(private val context: Context) : HeadlessAppLoader {
//region HeadlessAppLoader
override fun loadApp(context: Context, params: HeadlessAppLoader.Params?, alreadyRunning: Runnable?, callback: Consumer<Boolean>?) {
if (params == null || params.appScopeKey == null) {
throw IllegalArgumentException("Params must be set with appScopeKey!")
}
if (context.applicationContext is ReactApplication) {
val reactInstanceManager = (context.applicationContext as ReactApplication).reactNativeHost.reactInstanceManager
if (!appRecords.containsKey(params.appScopeKey)) {
reactInstanceManager.addReactInstanceEventListener(object : ReactInstanceEventListener {
override fun onReactContextInitialized(context: ReactContext) {
HeadlessAppLoaderNotifier.notifyAppLoaded(params.appScopeKey)
callback?.apply(true)
}
})
appRecords[params.appScopeKey] = reactInstanceManager
if (reactInstanceManager.hasStartedCreatingInitialContext()) {
reactInstanceManager.recreateReactContextInBackground()
} else {
reactInstanceManager.createReactContextInBackground()
}
} else {
alreadyRunning?.run()
}
} else {
throw IllegalStateException("Your application must implement ReactApplication")
}
}
override fun invalidateApp(appScopeKey: String?): Boolean {
return if (appRecords.containsKey(appScopeKey) && appRecords[appScopeKey] != null) {
val appRecord: ReactInstanceManager = appRecords[appScopeKey]!!
android.os.Handler(context.mainLooper).post {
// Only destroy the `ReactInstanceManager` if it does not bind with an Activity.
// And The Activity would take over the ownership of `ReactInstanceManager`.
// This case happens when a user clicks a background task triggered notification immediately.
if (appRecord.lifecycleState == LifecycleState.BEFORE_CREATE) {
appRecord.destroy()
}
HeadlessAppLoaderNotifier.notifyAppDestroyed(appScopeKey)
appRecords.remove(appScopeKey)
}
true
} else {
false
}
}
override fun isRunning(appScopeKey: String?): Boolean =
appRecords.contains(appScopeKey) && appRecords[appScopeKey]!!.hasStartedCreatingInitialContext()
//endregion HeadlessAppLoader
}
```
|
Bee Journal is a 2012 poetry collection by Sean Borodale. It is written in the form of a journal and follows one colony for around one year, from the initial formation of the hive to the capture of a swarm.
Reception
A review in The Daily Telegraph of Bee Journal described it as "the most beautiful expression of what it is like to live with bees that you could hope to find.". Granta compared it to The Life of the Bee by Maurice Maeterlinck. It has also been reviewed by Varsity.
Bee Journal was shortlisted for the 2012 T S Eliot Prize, and the 2012 Costa Poetry Award.
References
2012 poetry books
Bees in popular culture
English poetry collections
Jonathan Cape books
|
Hlaing Township (, ), also spelt Hline, is an area of Yangon, Myanmar in the West Yangon District of Yangon Region. The township is entirely urban and comprises 16 wards. In 2000, the township's population was estimated to be about 125,000.
Geography
Hlaing Township is an urbanized township on mostly flat terrain on the east bank of the Hlaing River. Hlaing Township is bordered by Mayangon township and Thamaing Creek in the north, Mayangon township and Inya Lake in the east, Kamayut Township and Tadaphyu Stream in the south and the Hlaing River and Hlaingthaya Township in the west.
The climate of the township ranges between 40'C and 12'C with an average of 118 days of rain in a year. A few plants grow within the town including jackfruit, tamarind, flame trees and banyan trees. Green spaces within the township include college campuses, sports fields and the teak trees along Parami Road. The township faces air quality issues with a PM2.5 of 110 µg/m3 in the morning and 90 µg/m3 in the evenings.
Demographics
The 2014 Myanmar Census reported that Hlaing Township had a population of 160,307. However, the General Administration Department's 2019 township report reported only 126,111. It is unlikely to reflect a real loss in population as the GAD also reports a consistently growing population.
74.7% of the township's reproductive age married women practice family planning with contraceptive injections and oral contraceptive pills being the most common methods.
The median age is between 25 and 30 and more females than males in the township. Only 50-60% of children in the township attend school comparable to the national average. The Township is 91.4% Buddhist, with Hinduism making up the second largest group at 3.2%. A significant 4.41% of the township are Burmese Indians.
Economy
Hlaing Township has become a part of the Yangon city economic core region over the 2010s and is primary a service-sector economy. The average income in the 2017-2018 fiscal year was Ks.35,27,923/- (roughly US$2,380 by 2019 conversion rates).
Most prominent in sectors are computer services in MICT Park and the 18 car showrooms within the township (as of 2018). There are 6 YCDC managed markets within the township alongside 2 privately operated shopping centres. The most common store type are tea shops and clothing stores.
There is no agriculture and a limited industrial sector in the township. 6 of the 7 factories within the township are state-owned enterprises including aluminium and wood products. There are 27 car mechanic or battery workshops within the township.
The Yangon Circular Railway has 3 stops in the township: Okkyin, Thiri Myaing and Kamayut, which is not in Kamayut Township despite its name.
Education
The Township has 32 primary schools, eight middle schools and four high schools.
The Yangon University of Education and the University of Information Technology both have a Hlaing Campus in the northeastern section of the township on the border with Mayangone Township.
Landmarks
Yangon United Football Club and their base Yangon United Sports Complex are located in Hlaing near Insein Road. The Bayint Naung Golf Driving Range is located on the west side of the township near the No. 1 Army Barracks.
The following is a list of landmarks protected by the city in Hlaing township.
References
Townships of Yangon
|
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. path_to_url
#ifndef CORE_FXGE_CFX_UNICODEENCODING_H_
#define CORE_FXGE_CFX_UNICODEENCODING_H_
#include <stdint.h>
#include "core/fxcrt/unowned_ptr.h"
#if 1 // def PDF_ENABLE_XFA // weolar
#define FXFM_ENC_TAG(a, b, c, d) \
(((uint32_t)(a) << 24) | ((uint32_t)(b) << 16) | ((uint32_t)(c) << 8) | \
(uint32_t)(d))
#define FXFM_ENCODING_MS_SYMBOL FXFM_ENC_TAG('s', 'y', 'm', 'b')
#define FXFM_ENCODING_UNICODE FXFM_ENC_TAG('u', 'n', 'i', 'c')
#define FXFM_ENCODING_MS_SJIS FXFM_ENC_TAG('s', 'j', 'i', 's')
#define FXFM_ENCODING_MS_GB2312 FXFM_ENC_TAG('g', 'b', ' ', ' ')
#define FXFM_ENCODING_MS_BIG5 FXFM_ENC_TAG('b', 'i', 'g', '5')
#define FXFM_ENCODING_MS_WANSUNG FXFM_ENC_TAG('w', 'a', 'n', 's')
#define FXFM_ENCODING_MS_JOHAB FXFM_ENC_TAG('j', 'o', 'h', 'a')
#define FXFM_ENCODING_ADOBE_STANDARD FXFM_ENC_TAG('A', 'D', 'O', 'B')
#define FXFM_ENCODING_ADOBE_EXPERT FXFM_ENC_TAG('A', 'D', 'B', 'E')
#define FXFM_ENCODING_ADOBE_CUSTOM FXFM_ENC_TAG('A', 'D', 'B', 'C')
#define FXFM_ENCODING_ADOBE_LATIN_1 FXFM_ENC_TAG('l', 'a', 't', '1')
#define FXFM_ENCODING_OLD_LATIN_2 FXFM_ENC_TAG('l', 'a', 't', '2')
#define FXFM_ENCODING_APPLE_ROMAN FXFM_ENC_TAG('a', 'r', 'm', 'n')
#endif // PDF_ENABLE_XFA
class CFX_Font;
class CFX_UnicodeEncoding {
public:
explicit CFX_UnicodeEncoding(CFX_Font* pFont);
virtual ~CFX_UnicodeEncoding();
virtual uint32_t GlyphFromCharCode(uint32_t charcode);
protected:
UnownedPtr<CFX_Font> const m_pFont;
};
#endif // CORE_FXGE_CFX_UNICODEENCODING_H_
```
|
The Bisan City tourist village is a pleasure garden located in the northern part of Gaza.
The 270 dunam leisure park includes a new wedding hall, gardens, soccer fields, an Olympic-size swimming pool a 19-hectare zoo, playgrounds, and restaurants. 6,000 people are said to visit every weekend; some arrive in buses subsidized for by the government. On arrival, the passengers pay admission fees. It was built on government-owned land at a cost of $1.5 million and is supervised by Fathi Hammad, the Hamas Minister of the Interior.
The tourist village was built by the government on Interior Ministry land formerly used as a garbage dump.
According to Egyptian journalist Ashraf Abu Al-Houl writing in Al-Ahram, the tourist village is one of a rapidly growing group of Gaza pleasure parks, including Zahrat Al-Madain, the Al-Bustan resort, and the Crazy Water Park, so many of which were completed between his visit to Gaza in February 2010 and his return in July 2010 as to make Gaza "almost unrecognizable." He continues, "A sense of absolute prosperity prevails, as manifested by the grand resorts along and near Gaza's coast. Further, the sight of the merchandise and luxuries filling the Gaza shops amazed me. Merchandise is sold more cheaply than in Egypt, although most of it is from the Egyptian market, and there are added shipping costs and costs for smuggling it via the tunnels – so that it could be expected to be more expensive...the siege was broken even before Israel's crime against the ships of the Freedom Flotilla in late May; everything already was coming into the Gaza Strip from Egypt. If this weren't the case, businessmen would not have been able to build so many resorts in under four months."
According to Reuters, the resort is part of a "construction boom" in "recreational facilities" that has prompted some to criticize Hamas for putting money into entertainment venues like the tourist village at Bisan City and the Crazy Water Park rather than into housing and infrastructure.
References
Amusement parks in the State of Palestine
Companies of the State of Palestine
Tourist attractions in the State of Palestine
Buildings and structures in the Gaza Strip
|
```shell
#!/bin/bash
echo "Removing all 'flowable' images"
docker rmi $(docker images |grep flowable|awk '{print $3;}')
```
|
```vue
<template>
<div>
<br>
<x-progress :percent="percent1"></x-progress>
<br>
<box gap="10px">
<x-progress :percent="percent2" :show-cancel="false"></x-progress>
</box>
</div>
</template>
<script>
import { XProgress, Box } from 'vux'
export default {
components: {
XProgress,
Box
},
data () {
return {
percent1: 30,
percent2: 60
}
}
}
</script>
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.