text stringlengths 1 22.8M |
|---|
```xml
<?xml version="1.0" encoding="utf-8"?>
<!--
~ All Rights Reserved.
-->
<me.zhanghai.android.douya.ui.DispatchInsetsDrawerLayout
xmlns:android="path_to_url"
xmlns:app="path_to_url"
xmlns:tools="path_to_url"
android:id="@+id/drawer"
android:layout_height="match_parent"
android:layout_width="match_parent"
tools:context=".main.ui.MainActivity">
<me.zhanghai.android.douya.ui.InsetBackgroundFrameLayout
android:id="@+id/container"
android:layout_width="match_parent"
android:layout_height="match_parent"
android:fitsSystemWindows="true"
app:insetBackground="?colorPrimaryDarkWithoutSystemWindowScrim" />
<fragment
android:id="@+id/navigation_fragment"
android:name="me.zhanghai.android.douya.navigation.ui.NavigationFragment"
android:layout_width="wrap_content"
android:layout_height="match_parent"
android:layout_gravity="start"
tools:layout="@layout/navigation_fragment" />
<me.zhanghai.android.douya.ui.MaxDimensionDispatchInsetsFrameLayout
android:id="@+id/notification_list_drawer"
android:layout_width="wrap_content"
android:maxWidth="@dimen/drawer_max_width"
android:layout_height="match_parent"
android:layout_gravity="end"
android:background="?android:colorBackground" />
</me.zhanghai.android.douya.ui.DispatchInsetsDrawerLayout>
``` |
Metal is the sixth album by French composer Pierre Estève and was released in 2001 by Shooting Star. It is the second album after Bamboo from Esteve's MADe IN series, based on matters from Chinese instrument classification.
Track listing
Personnel
Musicians
Pierre Estève
Ramon Fossati
Axel Lecourt
Alain Rouault
Release history
References
2001 albums
Pierre Estève albums |
Mohd Fahmi bin Aliman (Jawi: محمد فهمى عليمن; born 1972) is a Singaporean politician who has been serving as Mayor of South East District since 2020. A member of the governing People's Action Party (PAP), he has been the Member of Parliament (MP) representing the Geylang Serai division of Marine Parade GRC since 2020.
Early life and education
Fahmi was born in 1972 in Singapore to a father who was a gas checker and a mother who was a cleaner, and has two siblings.
He attended Jubilee Primary School and Jurong Secondary School before graduating from Ngee Ann Polytechnic with a diploma.
Fahmi subsequently went on to complete a Bachelor of Engineering with honours degree at the University of Liverpool. He also has a graduate diploma from the National University of Singapore in defence technological science.
Career
Military career
Fahmi served in the Singapore Army for 26 years and attained the rank Colonel. He was deployed for six months to Blangpidie, Sumatra, Indonesia for the Aceh Monitoring Mission in 2005, and six months in Kabul, Afghanistan in 2012 as part of Singapore's contribution to the International Security Assistance Force (ISAF). He was awarded Pingat Penghargaan (Tentera) in 2014 and Long Service Medal (Military) in 2017.
In 2019, Fahmi left the Singapore Armed Forces (SAF) and had a brief stint as the deputy chief executive of Majlis Ugama Islam Singapura (MUIS), before leaving to join the National Trades Union Congress (NTUC) as Director of the Administration and Research Unit in March 2020.
Political career
Fahmi made his political debut in the 2020 general election as part of a five-member PAP team contesting in Marine Parade GRC against the Workers' Party. His running mates were Tan Chuan-Jin, Seah Kian Peng, Tan See Leng, and Edwin Tong. On 11 July 2020, he was elected as the Member of Parliament (MP) representing the Geylang Serai ward of Marine Parade GRC after the PAP team garnered 57.76% of the valid votes.
Personal life
Fahmi is married and has four children
Awards
Commendation Medal (Military) in 2014
Long Service Medal (Military) in 2017
References
External links
Mohd Fahmi Aliman on Parliament of Singapore
Living people
1972 births
National University of Singapore alumni
Ngee Ann Polytechnic alumni
Alumni of the University of Liverpool
People's Action Party politicians
Members of the Parliament of Singapore
Singaporean people of Malay descent
Singaporean Muslims |
Muriel's Wedding is a 1994 Australian comedy-drama film written and directed by P. J. Hogan. The film, which stars Toni Collette, Rachel Griffiths, Jeanie Drynan, Sophie Lee, and Bill Hunter, focuses on the socially awkward Muriel whose ambition is to have a glamorous wedding and improve her personal life by moving from her dead-end hometown, the fictional Porpoise Spit, to Sydney.
The film premiered at the 1994 Toronto International Film Festival and was released in Australia on 29 September 1994. It received positive reviews and earned multiple award nominations, including a Golden Globe Award nomination for Best Actress in a Motion Picture – Musical or Comedy (Collette).
Plot
Socially awkward young Muriel Heslop is the target of ridicule by her shallow and egotistical friends, Tania, Cheryl, Janine, and Nicole. She spends her time listening to ABBA songs and daydreaming of a glamorous wedding to get her away from the dead-end beach town of Porpoise Spit and Bill, her domineering father and corrupt politician who constantly belittles his whole family. Muriel attends the wedding of Tania and Chook, during which she sees him and Nicole secretly having sex. Wedding guest Dianne, a department store detective, calls the police on Muriel for stealing the dress she is wearing, and they publicly escort Muriel out of the reception.
Soon after, Bill's rumoured mistress, Deidre Chambers, recruits Muriel into her multilevel marketing business, and Muriel's "friends" officially kick her out of their group after clarifying she is not invited on an island holiday. Muriel's mother, Betty, signs a blank cheque for Muriel to buy products for the cosmetics business, but she instead uses it to withdraw $12,000 and follow them to the island anyway. There, Muriel runs into Rhonda Epinstall, an old high school acquaintance, and they quickly strike up a friendship, cemented when Rhonda gleefully tells Tania about Nicole and Chook.
Returning home, Muriel is confronted by Betty regarding the stolen money. She immediately runs away to Sydney, sharing a flat with Rhonda and changing her name to Mariel. She gets a job at a video store, meets and briefly dates an awkward but kind man, Brice Nobes. One night, Rhonda suddenly falls down, unable to feel her legs. While at the hospital, Muriel calls home and learns her father is being investigated for taking bribes. Rhonda has a cancerous tumour in her spine and undergoes multiple operations, eventually leaving her paraplegic. Muriel promises Rhonda to look after her and never let her go back to Porpoise Spit. She also uses Rhonda's health crisis to obtain pampered service at numerous bridal shops, trying on wedding dresses and taking photographs to indulge her wedding obsession. When Rhonda confronts Muriel, she finally confesses to her fixation on a storybook wedding, and their friendship becomes strained.
Desperate, Muriel agrees to marry South African swimmer David Van Arkle so he can join Team Australia in the upcoming Olympics; she is paid $10,000 by David's parents for her help. At Muriel's elaborate wedding in Sydney, Tania, Cheryl, and Janine are her bridesmaids; bitter Rhonda refuses to be one. Bill openly treats Deidre as his date, and Betty is late to the wedding as she is unable to afford plane tickets; Muriel does not notice her at the wedding. Rhonda moves back to her mother's home, unable to live in Sydney without help. After the wedding, David makes his disinterest in Muriel clear to her.
In Porpoise Spit, an increasingly distraught Betty unintentionally shoplifts a pair of sandals she tries on, and Dianne calls the police. Bill arranges for the charges to disappear. Betty then pleads with Bill for help, only for Bill to announce his intention to divorce her and marry Deidre. She is later found dead by her daughter Joanie. It is announced that Betty had a heart attack, but Joanie reveals to Muriel that it was suicide. At her mother's funeral, David comforts Muriel, and they finally consummate their marriage. Her mother's death forces her to take a hard look at her life, and she tells him she can no longer remain married to him as neither of them are in love, and she wants to stop lying. Bill asks Muriel to help raise her siblings, as Deidre is less likely to marry him with the children in tow. He has also lost his job on city council. Muriel stands up to him, giving him $5,000 of her wedding money and telling him she will repay the rest of the stolen amount when she gets a job in Sydney. Impressing her father with her more assertive personality, Muriel demands that he stop his verbally abusive treatment of her siblings.
Muriel goes to Rhonda's house, where Muriel's former tormentors are visiting, and offers to take her back to Sydney. Rhonda accepts and lets the other girls know what she thinks of them, much to their shock and anger. The best friends head to the airport, happily leaving Porpoise Spit behind for a more promising future.
Cast
Production
The film used Tweed Heads as the locale for Porpoise Spit, although the scene of Muriel and Rhonda leaving Porpoise Spit was filmed in its adjoining "Twin Town", Coolangatta. Other filming locations included Moreton Island, Darlinghurst, the Gold Coast, Elanora, Tugun, Parramatta, Kensington, Surfers Paradise and Sydney.
For the role of Muriel, Toni Collette gained 18kg (40lb) in seven weeks.
Release
The film premiered at the Toronto International Film Festival in September 1994 and opened in Australia at the end of the month, a month after another Australian film, The Adventures of Priscilla, Queen of the Desert.
Critical reception
Muriel's Wedding received positive reviews from critics and has a score of 81% on Rotten Tomatoes, based on 47 reviews, with an average rating of 6.9/10. The critical consensus states "Heartfelt and quirky, though at times broad, Muriel's Wedding mixes awkward comedy, oddball Australian characters, and a nostalgia-heavy soundtrack." The film also has a score of 63 out of 100 on Metacritic, based on 14 critics, indicating 'Generally favourable reviews'
Roger Ebert of the Chicago Sun-Times stated the film "is merciless in its portrait of provincial society, and yet has a huge affection for its misfit survivors...has a lot of big and little laughs in it, but also a melancholy undercurrent, which reveals itself toward the end of the film in a series of surprises and unexpected developments...The film's good heart keeps it from ever making fun of Muriel, although there are moments that must have been tempting."
Peter Stack of the San Francisco Chronicle wrote "With such recent hits as Strictly Ballroom and Priscilla, Queen of the Desert, Australia seems to be cornering the market for odd but delightful comedies laced with substance and romance. The latest, Muriel's Wedding, is another bright, occasionally brilliant, example... the movie is much meatier than its larky comic sheen leads you to think at first...There's poignant drama in this brash, sometimes overstated film, and Muriel's transformation is truly touching."
Peter Travers of Rolling Stone called it "exuberantly funny...a crowd pleaser that spices a tired formula with genuine feeling... In the final scenes, when Hogan dares to let his humour turn edgy, Collette's performance gains in force, and Muriel's Wedding becomes a date you want to keep."
Box office
Muriel's Wedding grossed AU$2.2 million in its opening week in Australia (September 1994) from 72 screens, at that time the third biggest opening for an Australian film behind two films starring Paul Hogan (no relation to the director of Muriel's Wedding)Crocodile Dundee II (1988) and Lightning Jack (1994). It went on to gross AU$15.8 million (equivalent to AU$34.7 million in 2023) at the box office in Australia.
It earned US$245,000 on 14 screens in its opening weekend in the US (March 1995) and eventually grossed US$15.1 million in the United States and Canada.
Accolades
Soundtrack
The music of ABBA forms the backbone of the film's soundtrack. Songwriters Björn Ulvaeus and Benny Andersson allowed their use in the film and permitted "Dancing Queen" to be adapted as an orchestral piece. Additional ABBA songs included are "Waterloo" and "I Do, I Do, I Do, I Do, I Do".
ABBA only gave permission for their music to be included in the film two weeks before shooting commenced; the filmmakers were considering changing Muriel's favourite band to The Village People.
Also included in the soundtrack are "Sugar Baby Love" by The Rubettes, "The Tide Is High" by Blondie, "I Go to Rio" by Peter Allen, and "Happy Together" by The Turtles.
Stage adaptation
In September 2016, it was announced that Sydney Theatre Company would produce a musical adaptation of Muriel's Wedding. Muriel's Wedding the Musical incorporates songs by ABBA as well as original music by Kate Miller-Heidke and Keir Nuttall. P. J. Hogan wrote the musical's book, Simon Phillips directed, and Gabriela Tylesova designed the set and costumes. The musical ran at the Roslyn Packer Theatre from 6 November 2017 through 27 January 2018.
See also
Cinema of Australia
Sydney in film
Four Weddings and a Funeral
References
External links
Muriel's Wedding at Oz Movies
Muriel's Wedding at the National Film and Sound Archive
UrbanCinefile.com article
Muriel's Wedding at Screen Australia
1994 films
1990s romantic comedy-drama films
Adultery in films
Australian romantic comedy-drama films
French romantic comedy-drama films
Films about weddings
Films set in New South Wales
Films set in Sydney
Films shot in Sydney
Films shot in Queensland
Films directed by P. J. Hogan
Films scored by Peter Best (composer)
Miramax films
Roadshow Entertainment films
1994 directorial debut films
1994 comedy films
1994 drama films
1990s female buddy films
Films shot on the Gold Coast, Queensland
1990s English-language films
1990s French films |
Statistics of Czechoslovak First League in the 1927–28 season. Karel Meduna was the league's top scorer with 12 goals.
Overview
It was contested by 7 teams, and FK Viktoria Žižkov won the championship.
League standings
Results
Top goalscorers
References
Czechoslovakia - List of final tables (RSSSF)
Czechoslovak First League seasons
1927–28 in Czechoslovak football
Czech |
Cürəli or Dzhurali or Dzhuraly may refer to:
Aşağı Cürəli, Azerbaijan
Aşağı Cürəli (Ashagy Dzhurali), Azerbaijan
Yuxarı Cürəli, Azerbaijan |
Kahnan Kash-e Bala (, also Romanized as Kahnān Kash-e Bālā) is a village in Bahu Kalat Rural District, Dashtiari District, Chabahar County, Sistan and Baluchestan Province, Iran. At the 2006 census, its population was 138, in 27 families.
References
Populated places in Chabahar County |
Sheila Waters (13 March 1929 – 18 March 2022) was a British calligrapher and teacher who spent the last half-century of her life in the United States.
Life
Sheila Waters was born in Gravesend, England, on 13 March 1929. She graduated from the Medway College of Art, Kent, in 1948 with a Diploma of Design, and received an associate degree from the Royal College of Art in London in 1951. There she developed her calligraphic skills under the tutelage of Dorothy Mahoney (assistant to the calligrapher Edward Johnston).
At twenty-two, Waters was elected a fellow of the Society of Scribes and Illuminators. She inaugurated the program of calligraphy courses at the Smithsonian Institution, Washington, D.C., and later developed her own private classes and annual workshops. Waters was the first president and founding member of the Washington Calligraphers Guild.
Waters was married to bookbinder and conservator Peter Waters from 1953 until his death in 2003. One of her three sons is Julian Waters, a noted calligrapher and typographer. In 1971 the family moved to the United States after Peter was appointed Chief of Conservation at the Library of Congress. Once she obtained a teaching job in 1976, she was able to be more selective about what calligraphy work she took on and dedicate more time to develop her craft as an art form.
Books and artwork
Between 1961 and 1978, Waters hand-lettered and illustrated an illuminated manuscript of Dylan Thomas' Under Milk Wood. The book was released in 1979.
Waters is the author of Foundations of Calligraphy, published in 2006. Her 2016 book Waters Rising: Letters from Florence documented her husband's efforts to save hundreds of thousands of books damaged in the 1966 Florence flood.
Time-Line Triptych is the name of an artwork from 1986 which consists of three works individually titled Ancient, Mediaeval and Modern in gouache and pastel.
Further reading
Thomas, Dylan; Under Milk Wood, A Play for Voices, A Reproduction of the Illuminated Manuscript by Sheila Waters. Foreword by Heather Child. International Letter Arts Network, Santa Ana, California 1989.
Halliday, Peter; Calligraphy Masterclass Sheila Waters, Collins, London, 1990
Waters, Sheila; Foundations of Calligraphy, Foreword by Rose Folsom. John Neal Books, Greensboro, North Carolina, 2006.
References
External links
Sheila Waters: Granddaughter, Mother and Queen of Calligraphy - blogpost with interview
1929 births
2022 deaths
English calligraphers
Alumni of the Royal College of Art
Women calligraphers
People from Gravesend, Kent |
Root cause may refer to:
Root Cause (film), a 2019 documentary
"Root Cause" (Person of Interest), a TV show episode
Root cause analysis, a problem solving technique |
Abiola Babatope née Odeyale is a Nigerian politician who represented Mushin Central District II, Lagos in the House of Representatives during the second republic.
Babatope attended St Anne's School Ibadan for her secondary school education and later studied geology at University of Ibadan. After her graduation she worked at the office of the Secretary to the Lagos State government. After leaving the services of Lagos State, she joined Mobil Producing Nigeria in 1971. In 1977, she was a Councillor in Mushin and in 1979, she was elected a House of Representative member under Unity Party of Nigeria (UPN).
She is married to Ebenezer Babatope.
References
Unity Party of Nigeria politicians
Women members of the House of Representatives (Nigeria)
University of Ibadan alumni |
The American Archive of Public Broadcasting (AAPB) is a collaboration between the Library of Congress and WGBH Educational Foundation, founded through the efforts of the Corporation for Public Broadcasting (CPB). The AAPB is a national effort to digitally preserve and make accessible historically significant public radio and television programs created over the past 70+ years. The archive comprises over 120 collections from contributing stations and original producers from US states and territories. the collection includes nearly 113,000 digitized items preserved on-site at the Library of Congress, and 53,000 items in the collection are streaming online in the AAPB Online Reading Room.
Funders include the CPB, the Council on Library and Information Resources, and Institute of Museum and Library Services.
History
The Corporation for Public Broadcasting (CPB) began inventorying US public media content in 2007. By 2013, 2.5 million items had been inventoried including 40,000 hours of broadcasting which was being digitized with funding from the CPB. An advisory council, which included Ken Burns, John W. Carlin, Henry Louis Gates, Jr., Cokie Roberts, Stephen D. Smith, Margaret Spellings, Howard Stringer, and Jesús Salvador Treviño, recommended that a collaboration between WGBH and the Library of Congress form and operate the archive.
In the first phase of the project, which began in 2013, the Archive will complete the digitization of 40,000 hours of radio and television programs and select an additional 5,000 hours of born-digital programs to be included in the collection. The collection will be made available to the public on-site in Washington, DC and in Boston. A rights clearance strategy will be developed to comply with legal restrictions, including copyright law and a website will provide public access to much of the collection.
Other projects
Programs from National Educational Television (NET), which operated from 1952 through 1972, are being cataloged in a project scheduled to be completed in 2018. 8,000–10,000 NET titles are expected to be cataloged and an incomplete preliminary list is currently online.
The PBS NewsHour Digitization Project has made more than 13,500 episodes of PBS NewsHour and its predecessor programs available online. Transcripts of over 9,000 shows (1975–2015) will also be made available.
The Public Broadcasting Preservation Fellowship (PBPF) began in 2018 and supports graduate students enrolled in non-specialized programs to pursue digital preservation projects at public broadcasting organizations around the country. In 2020, the University of Alabama partnered with WGBH to adopt and launch its model of the PBPF program, providing both local and remote students enrolled in the University of Alabama's School of Library and Information Studies with opportunities to pursue Fellowships at stations in their area.
In 2021, the AAPB launched the “Presenting the Past" podcast series in collaboration with the Society for Cinema and Media Studies (SCMS). The series features informed conversations with scholars, educators, industry professionals, researchers, archivists, and others about significant events, issues, and topics documented in the AAPB collections.
Special Collections and Exhibits
The AAPB Special Collections include notable selections of public radio and television content with a specified search bar for items within the collection, a detailed summary of the content, and related resources. Some of these collections feature individual series such as Say Brother (now known as Basic Black), raw interviews from documentaries such as Eyes on the Prize and Ken Burns' The Civil War, event coverage such as the Watergate Hearings, and selections of items related to specific themes, such as the LGBT+ Collection.
In the AAPB curated Exhibits, curators select primary and secondary source recordings to present a diversity of perspectives concerning the exhibit's focus. These exhibits illuminate how public broadcasting stations and producers have covered topics such as civil rights, climate change, speaking and protesting in America, public media and presidential elections, structuring news magazines, televising Black politics, and historic preservation on public broadcasting.
See also
National Public Broadcasting Archives
PBCore
References
External links
Forgotten radio show offers view into Durand’s past, Rich Tupica, Argus-Press, September 4, 2016.
How segregationists sold their message on US television, University of Leicester, August 31, 2016.
Public Broadcasting Preservation Fellowship (PBPF)
RadioSurvivor Podcast #218: Archiving Public Media, November 7, 2019.
Aca-Media Podcast, Society for Cinema and Media Studies, Episode 53: Just a Plain Curiosity, March 19, 2020.
RadioSurvivor Podcast #301: Digitizing & Transcribing the Archives of NYC Progressive Church Radio, June 9, 2020.
"Creating Transcripts from Primary Sources", The Primary Source Podcast, January 4, 2021.
"Pairing Picture Books and Primary Sources: The Teachers March!", The Primary Source Podcast, January 18, 2021.
Archives in the United States
Public broadcasting in the United States |
"I Should Be Proud" is a 1970 protest song written by Henry Cosby, Pam Sawyer and Joe Hinton and recorded by Motown girl group Martha and the Vandellas (credited as Martha Reeves & the Vandellas).
Background
The song was noted for being the first released Motown protest song (released in February of the year), just months before the releases of Edwin Starr's "War" and The Temptations' "Ball of Confusion".
The song had the narrator talk of how she was devastated on hearing the news that her loved one, who had been fighting in the Vietnam War, had been shot and killed in action. Instead of being proud that her loved one had "fought for her", as people around her were claiming, all she wanted was him and not his honors for fighting the war, exclaiming that the man, disguised as "Private Johnny C. Miller", had been "fightin' for the evils of society". On the MSNBC program, Headliners And Legends: Martha & The Vandellas, Reeves commented that this song was pulled off many radio stations' playlists due to its controversial "anti-war" message during the height of the Vietnam War. Lead singer Martha Reeves took the song personally, recounting that one of her brothers had died in a Vietnam War-related incident. It was the first release off the Vandellas' Natural Resources Motown LP.
Personnel
Lead vocals by Martha Reeves
Background vocals by Sandra Tilley, Lois Reeves, and The Andantes: Marlene Barrow, Jackie Hicks and Louvain Demps
Instrumentation by The Funk Brothers
Chart performance
Though not a big hit (peaking at #80 pop and #45 R&B),, the song broke ground for protest songs, released on the Motown labels.
See also
List of anti-war songs
References
1970 singles
Protest songs
Anti-war songs
Songs of the Vietnam War
Martha and the Vandellas songs
Songs written by Pam Sawyer
Songs written by Henry Cosby
Motown singles
Gordy Records singles |
```objective-c
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
/*
* The following is auto-generated. Do not manually edit. See scripts/loops.js.
*/
#ifndef STDLIB_NDARRAY_BASE_UNARY_B_T_H
#define STDLIB_NDARRAY_BASE_UNARY_B_T_H
#include "stdlib/ndarray/ctor.h"
#include <stdint.h>
/*
* If C++, prevent name mangling so that the compiler emits a binary file having undecorated names, thus mirroring the behavior of a C compiler.
*/
#ifdef __cplusplus
extern "C" {
#endif
/**
* Applies a unary callback to an input ndarray and assigns results to elements in an output ndarray.
*/
int8_t stdlib_ndarray_b_t( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a zero-dimensional input ndarray and assigns results to elements in a zero-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_0d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a one-dimensional input ndarray and assigns results to elements in a one-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_1d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a two-dimensional input ndarray and assigns results to elements in a two-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_2d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a two-dimensional input ndarray and assigns results to elements in a two-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_2d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a three-dimensional input ndarray and assigns results to elements in a three-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_3d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a three-dimensional input ndarray and assigns results to elements in a three-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_3d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a four-dimensional input ndarray and assigns results to elements in a four-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_4d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a four-dimensional input ndarray and assigns results to elements in a four-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_4d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a five-dimensional input ndarray and assigns results to elements in a five-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_5d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a five-dimensional input ndarray and assigns results to elements in a five-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_5d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a six-dimensional input ndarray and assigns results to elements in a six-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_6d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a six-dimensional input ndarray and assigns results to elements in a six-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_6d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a seven-dimensional input ndarray and assigns results to elements in a seven-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_7d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a seven-dimensional input ndarray and assigns results to elements in a seven-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_7d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to an eight-dimensional input ndarray and assigns results to elements in an eight-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_8d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to an eight-dimensional input ndarray and assigns results to elements in an eight-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_8d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a nine-dimensional input ndarray and assigns results to elements in a nine-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_9d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a nine-dimensional input ndarray and assigns results to elements in a nine-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_9d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a ten-dimensional input ndarray and assigns results to elements in a ten-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_10d( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to a ten-dimensional input ndarray and assigns results to elements in a ten-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_10d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a unary callback to an n-dimensional input ndarray and assigns results to elements in an n-dimensional output ndarray.
*/
int8_t stdlib_ndarray_b_t_nd( struct ndarray *arrays[], void *fcn );
#ifdef __cplusplus
}
#endif
#endif // !STDLIB_NDARRAY_BASE_UNARY_B_T_H
``` |
```toml
[package]
org = "sameera"
name = "myproject"
version = "0.1.0"
[[platform.java17.dependency]]
path = "./libs/one-1.0.0.jar"
graalvmCompatible = true
[[platform.java11.dependency]]
path = "./libs/one-1.0.1.jar"
graalvmCompatible = false
``` |
The 1947 Green Bay Packers season was their 29th season overall and their 27th season in the National Football League. The team finished with a 6–5–1 record under coach Curly Lambeau, earning a third-place finish in the Western Conference.
Offseason
Draft
Regular season
Schedule
Standings
Roster
References
Sportsencyclopedia.com
Green Bay Packers seasons
Green Bay Packers
Green |
The 525th Fighter Squadron is a United States Air Force unit. It is assigned to the 3d Operations Group at Joint Base Elmendorf–Richardson, Alaska. The squadron was first activated as the 309th Bombardment Squadron in February 1942. After training in the United States, it deployed to the Mediterranean Theater of Operations, where it became the 525th Fighter-Bomber Squadron and engaged in combat until the spring of 1945, earning two Distinguished Unit Citations. After VE Day, the squadron became part of the occupation forces in Germany. Briefly inactivated in 1946, it returned to Germany a few months later.
During the Cold War, the squadron served in the fighter bomber role as the 525th Fighter-Bomber Squadron and in the air defense role as the 525th Fighter-Interceptor Squadron. It became the 525th Tactical Fighter Squadron in 1969. The squadron again saw combat service in the Gulf War before inactivating in March 1992.
The squadron was reactivated in its current location in September 2007.
Mission
The combat-ready fighter squadron is prepared for rapid worldwide deployment of a squadron of Lockheed Martin F-22A Raptor aircraft to accomplish precision engagement of surface targets using a wide variety of conventional air-to-surface munitions. The 525th trains in the fighter missions of strategic attack, interdiction, offensive counterair (air-to-surface), suppression of enemy air defenses, as well as offensive and defensive counterair (air-to-air).
History
World War II
The 525th Fighter Squadron originally activated during World War II as the 309th Bombardment Squadron (Light) on 10 February 1942, to support Allied Forces in the European Theater of Operations. The squadron began training for operations at Will Rogers Field, Oklahoma, and was assigned to the 86th Bombardment Group.
In August 1942, the squadron transferred to Key Field, Mississippi, to start flight training in the Douglas A-20 Havoc. A month later, the squadron was redesignated the 309th Bombardment Squadron (Dive). By year's end, the squadron started the transition to two new combat aircraft types, the Vultee A-31 Vengeance and the North American A-36 Apache. The squadron achieved combat ready status on 19 March 1943.
Ready to support the war effort, the 309th Bombardment Squadron boarded the in April 1943. Twelve days after its departure from the United States, the squadron landed at La Senia Airfield, Algeria. The 309th moved to Mediouna Airfield, French Morocco, on 15 May 1943; Marnia Airfield, French Morocco, on 3 June 1943; and to Tafaraoui Airfield, Algeria on 11 June 1943. This is where the squadron acquired its first combat experience on 6 July 1943. On the squadron's first day of combat, it struck enemy entrenchments in Sicily, softening enemy resistance for General George S. Patton's invading Seventh Army. Following the invasion, the 309th Bombardment Squadron set up its operations in Gela Airfield, Sicily, on 20 July 1943, and to Barcellona Landing Ground, Sicily, on 27 July 1943, to support the Allied campaign against the West Coast of Italy.
The 309th Bombardment Squadron was redesignated the 525th Fighter-Bomber Squadron on 23 August 1943. While in Italy, the 525th moved several more times while participating in the Rome-Arno campaign. Bases for the 525th included Sele Airfield, Serretella Airfield, and Pomigliano Airfield in 1943. During 1944, the squadron operated from Marcianise Airfield, Ciampino Airport, Orbetello Airfield, Grosseto Airfield, Italy and Poretta Airfield, Corsica. Two of the more famous battles during the Italian campaigns were Salerno and the Battle of Monte Cassino. The 525th Fighter-Bomber Squadron figured prominently in these battles, providing air support to Allied ground forces.
In 1944, the 525th transitioned to the Republic P-47 Thunderbolt. Along with the new aircraft the 525th was redesignated the 525th Fighter Squadron on 30 May 1944. In February 1945, the squadron moved to Tatonville Airfield, France, to fly missions against Germany. Two months later it moved into Germany, establishing its headquarters at Braunshardt Airfield on 18 April 1945. The 525th flew its last combat mission on 8 May 1945, and postwar the headquarters moved to AAF Station Schweinfurt on 23 October 1945.
Cold War
The 525th moved to Bolling Field, District of Columbia on 23 October 1945, as it awaited the realignment of U.S. Forces under the Status of Forces Agreements at the end of World War II. The 525thwas temporarily inactivated on 31 March 1946.
It was reactivated on 20 August 1946, at AAF Station Nordholz, Germany, again flying the P-47 Thunderbolt. The squadron made three more moves in Germany; to Lechfeld Air Base on 13 November 1946, Bad Kissingen Air Base on 5 March 1947, and then to Neubiberg Air Base on 12 June 1947, where the squadron was the closest operational Air Force unit to the Iron Curtain. On 20 January 1950, the 525th Fighter Squadron was redesignated the 525th Fighter-Bomber Squadron. In October 1950, the squadron transitioned to its first jet aircraft, the Republic F-84E Thunderjet and operated under the Mutual Defense Assistance Program. As a part of MDAP, the 525th trained pilots and ground crews of many European and Middle Eastern countries.
The 525th moved to Landstuhl Air Base, Germany on 20 November 1952, where it transitioned to the North American F-86 Sabre. The F-86 was Europe's first all-weather fighter-interceptor, and the 86th Fighter Group was the first to fly it in Europe. The 525th first flew the F-86F Sabre on 14 April 1953. Flying the F-86 in the air defense role, the 525th was redesignated as the 525th Fighter-Interceptor Squadron on 9 August 1954.
In 1957, the squadrons of the 86th Group were dispersed throughout Europe to provide better air defense coverage and reduce vulnerability to attack. On 12 February 1957, the squadron moved to Bitburg Air Base, Germany. The 525th was the only squadron at Bitburg to maintain air defense alert for the next 20 years.
The 525th received its first Convair F-102 Delta Dagger in February 1959 and was selected to represent the U.S. Air Forces in Europe (USAFE) at the 1959 William Tell competition. Although new to its aircraft, the 525th took the lead in the competition and held it until the last event when it was nosed out by a few points.
In 1965, 1967, and 1971 the 525th was chosen as the Sector III representative to the NATO Air Superiority Competitions. In each competition, the squadron made an outstanding showing, winning the Guynemer Trophy for the best sector performance in 1971.
The 525th became part of the 36th Tactical Fighter Wing on 1 November 1968. On 1 October 1969, the squadron was redesignated the 525th Tactical Fighter Squadron. Still maintaining two aircraft on 24-hour air defense alert status, the 525th's new mission now included close air support and limited nuclear air-to-ground delivery. Additionally, on 16 November 1969, the 525th became the first squadron in Germany to fly the McDonnell Douglas F-4E Phantom II. The 525th was subsequently nominated by USAFE for the Hughes Trophy in 1969.
In 1970 and 1971, the 525th was awarded the Allied Forces Central Europe Scroll of Honor. This award for "outstanding operational achievement" was given for twice consecutively earning the rating of "1" on tactical evaluations by Allied Air Forces Central Europe. In 1974, the 525th was nominated by USAFE again for the Hughes Trophy, and received a commendable citation in a close finals competition. That year the squadron established Dissimilar Air Combat Tactics (DACT) training with the Northrop F-5 Tiger II aggressor squadron at RAF Alconbury, England. Later, the squadron was the first in USAFE to establish DACT programs with non-aggressor and non-USAF adversaries. The 525th was chosen to be the first squadron in Europe to fly the McDonnell Douglas F-15 Eagle.
525th pilots flew the first 23 F-15 Eagles to Europe on 27 April 1977 during a non-stop deployment from Langley Air Force Base, Virginia, to Bitburg. Operation Ready Eagle became a success when, 18 hours after arrival at Bitburg, the squadron's pilots were sitting five-minute alert status with two of the F-15s. After less than one month on station, the Bulldogs were declared Europe's first operationally ready F-15 squadron on 26 May 1977.
In 1978, the 525th was featured as part of the McDonnell Douglas film, "Eagles in Defense of Europe." In October 1979, the 525th flew the first training missions at the new Air Combat Maneuvering Instrumentation range at Decimomannu Air Base, Sardinia, Italy. In 1984, the squadron participated in an exchange with the French Air Force, sending six F-15s to Orange-Caritat Air Base, France, in exchange for four Mirage F-1 aircraft. The French pilots flew for several weeks with the 525th and operated out of its operations facilities at Bitburg. In 1986, and again in 1987, the 525th deployed to Morocco and set up bare base operations at Sidi Slimane Air Base. The 525th lived and functioned for four weeks out of tents and flew its missions with Mirage F-1 and F-5 aircraft from Morocco. In November 1988, the 525th won USAFE's Excalibur air-to-air weapons competition. In April 1989, the squadron set a wing record for the most sorties in one month, flying 678 sorties, with 14 aircraft, while deployed to Decimomannu Air Base, Italy.
Gulf War
In August 1990, Iraqi military forces attacked and occupied the nation of Kuwait, precipitating the Gulf War. As a result, the 525th deployed to Incirlik Air Base, Turkey, in December 1990. When the squadron arrived at Incirlik it joined General Dynamics F-16 Fighting Falcons from Spain, General Dynamics F-111 Aardvarks from England, Wild Weasels from Germany, Boeing KC-135 Stratotankers from Texas, and Boeing E-3 Sentry and other electronic combat support aircraft from around the world. These units, deployed to Incirlik Air Base, formed the 7440th Combat Wing (Provisional).
On the night of 17 January 1991, the squadron flew its first strike against Iraq. On 19 January 1991, two 525th pilots used AIM-7 Sparrow radar missiles to destroy two Iraqi Mirage F-1s. During the next six weeks, until the cease-fire, the 525th flew around the clock, protecting two strikes per day and one strike each night. These strikes targeted military airfields, nuclear and chemical facilities, communications centers, power plants, and oil refineries and storage facilities in northern Iraq. By the middle of February, the 525th was attacking Baghdad. In addition to protecting strike aircraft, the 525th was frequently tasked to man barrier Combat Air Patrols in eastern Iraq to destroy Iraqi fighters attempting to flee to Iran. These missions, often lasting in excess of five hours, required the squadron to operate more than 150 miles behind enemy lines without any support assets.
The squadron flew 1,329 combat sorties for a total of 3,550 combat hours during operations against Iraq. The squadron shot down six enemy aircraft without losing any of its own aircraft. On 13 March 1991, the 525th returned to Bitburg. The squadron deployed back to Incirlik AB on 5 April 1991 to support Operation Provide Comfort.
Following the war against Iraq, numerous Kurdish refugees fled northward from the remaining forces of Saddam Hussein. The United States initiated Operation Provide Comfort, to drop food and supplies to these refugees concentrated in Iraq along the Turkish border. Because tensions between the Iraqi and Allied forces in the area remained quite high, the 525th was called back to Turkey in April 1991 to protect the vulnerable Allied cargo aircraft. In addition, the 525th was tasked, as part of the operation, to fly at low altitude over Iraq and provide intelligence updates of Iraqi troop and equipment locations.
Between 5 April and 25 May 1991, the 525th flew 285 sorties over Iraq in support of Operation Provide Comfort without a single Allied aircraft being lost in Iraq due to hostile fire.
Recent Events
The 525th deployed to Leeuwarden Air Base, Netherlands, during October 1991. In December 1991, the Bulldogs deployed to RAF Bentwaters, England, to train on the new North Sea Air Combat Maneuvering Instrumentation range. The final weapons training deployment for the 525th was at Leeuwarden Air Base, Netherlands, from 16–27 March 1992.
The 525th inactivated at Bitburg AB on 1 April 1992. After 15 years of inactivation, Pacific Air Forces activated the 525th Fighter Squadron at Elmendorf Air Force Base, Alaska, on 29 October 2007. The 525th Fighter Squadron is now armed with the Air Force's newest fighter aircraft, the Lockheed Martin F-22 Raptor.
Lineage
Constituted as the 309th Bombardment Squadron (Light) on 13 January 1942
Activated on 10 February 1942
Redesignated 309th Bombardment Squadron (Dive) on 3 September 1942
Redesignated 525th Fighter-Bomber Squadron on 23 August 1943
Redesignated 525th Fighter Squadron on 30 May 1944
Inactivated on 31 March 1946
Activated on 20 August 1946
Redesignated 525th Fighter-Bomber Squadron on 20 January 1950
Redesignated 525th Fighter-Interceptor Squadron on 9 August 1954
Redesignated 525th Tactical Fighter Squadron on 1 October 1969
Inactivated on 31 March 1992
Redesignated 525th Fighter Squadron on 18 September 2007
Activated on 30 September 2007
Assignments
86th Bombardment Group (later 86th Fighter-Bomber Group, 86th Fighter Group), 10 February 1942 – 31 March 1946
86th Fighter Group (later 86th Composite Group, 86th Fighter Group, 86th Fighter-Bomber Group, 86th Fighter-Interceptor Group), 20 August 1946 (attached to 86th Fighter-Interceptor Wing, 22 May 1954 – 7 October 1955 and after 10 August 1956)
86th Fighter-Interceptor Wing (later 86th Air Division), 8 March 1958
36th Tactical Fighter Wing (later 36th Fighter Wing), 1 November 1968 – 31 March 1992
3d Operations Group, 30 September 2007 – present
Stations
Will Rogers Field, Oklahoma, 10 February 1942
Hunter Field, Georgia, c. 22 June 1942
Key Field, Mississippi, c. 7 August 1942
Camp Kilmer, New Jersey, 22 March–28 April 1943
La Senia Airfield, Algeria, 11 May 1943
Marnia Airfield, French Morocco, 3 June 1943
Tafaraoui Airfield, Algeria, 11 June 1943
Korba Airfield, Tunisia, 30 June 1943
Gela Airfield, Sicily, Italy, 21 July 1943
Barcellona Landing Ground, Sicily, Italy, 27 August 1943
Sele Airfield, Italy, 22 September 1943
Serretella Airfield, Italy, 12 October 1943
Pomigliano Airfield, Italy, 19 November 1943
Marcianise Airfield, Italy, 30 April 1944
Ciampino Airport, Italy, c. 12 June 1944
Orbetello Airfield, Italy, c. 19 June 1944
Poretta Airfield, Corsica, France, c. 12 July 1944
Grosseto Airfield, Italy, c. 17 September 1944
Pisa Airport, Italy, 6 November 1944
Tatonville Airfield (Y-1), France, 20 February 1945
Braunshardt Airfield (Y-72), Germany, c. 17 April 1945
AAF Station Schweinfurt, Germany (R-25), 26 September 1945 – 15 February 1946
Bolling Field, Washington, D.C., 15 February – 31 March 1946
AAF Station Nordholz, Germany, 20 August 1946
AAF Station Lechfeld, Germany c. 14 November 1946
AAF Station Bad Kissingen, Germany, 5 March 1947
Neubiberg Air Base, Germany, 12 June 1947
Deployed at Munich-Riem Air Base, Germany, July-7 August 1948
Deployed at Giebelstadt Air Base, Germany, 20 May – 3 August 1951
Landstuhl Air Base (later Ramstein Air Base), Germany, 9 August 1952
Bitburg Air Base, Germany, 12 February 1957 – 31 March 1992
Elmendorf AFB, AK, 30 September 2007 – present
Aircraft
Douglas A-20 Havoc, 1942
Vultee A-31 Vengeance, 1942
North American A-36 Apache, 1942–1944
Curtiss P-40 Warhawk, 1944
Republic P-47 Thunderbolt, 1944–1946; 1946–1950
Republic F-84 Thunderjet, 1950–1953
North American F-86 Sabre, 1953–1959
Convair F-102 Delta Dagger, 1959–1969
McDonnell Douglas F-4 Phantom II, 1969–1977
McDonnell Douglas F-15 Eagle, 1977–1991
Lockheed Martin F-22 Raptor 2007 – present
References
Notes
Explanatory notes
Citations
Bibliography
(subscription required for web access)
External links
525th Fighter Squadron Fact Sheet
525
Military units and formations in Alaska
Fighter squadrons of the United States Army Air Forces |
```php
<?php
require_once __DIR__ . '/../bootstrap.php';
$source = Rx\Observable::range(0, 9)->average();
$subscription = $source->subscribe($stdoutObserver);
``` |
Baja Prog is an annual progressive rock festival in Mexicali, Baja California, Mexico, held since 1997. It draws a number of well-known bands in the genre, and an average of 1500 attendees each day.
References
External links
Official site
Bands - 2007
Schedule - 2007
Festivals in Mexicali
Music festivals established in 1997
Rock festivals in Mexico
Tourist attractions in Baja California |
Saphenamycin is an antibiotic with the molecular formula C23H18N2O5 which is produced by the bacterium Streptomyces canarius and other Streptomyces species.
References
Antibiotics
Phenazines
Esters
Benzoic acids
Salicylic acids |
```javascript
import { BaseItemCounts } from '../lib/BaseItemCounts.js'
import * as Factory from '../lib/factory.js'
import { createRelatedNoteTagPairPayload } from '../lib/Items.js'
chai.use(chaiAsPromised)
const expect = chai.expect
describe('importing', function () {
this.timeout(Factory.TenSecondTimeout)
let expectedItemCount
let application
let email
let password
let context
afterEach(async function () {
if (application) {
await Factory.safeDeinit(application)
}
localStorage.clear()
application = undefined
context = undefined
})
describe('fake crypto', function () {
beforeEach(async function () {
localStorage.clear()
expectedItemCount = BaseItemCounts.DefaultItems
context = await Factory.createAppContext()
await context.launch()
application = context.application
email = UuidGenerator.GenerateUuid()
password = UuidGenerator.GenerateUuid()
Factory.handlePasswordChallenges(application, password)
})
it('should not import backups made from unsupported versions', async function () {
const result = await application.importData({
version: '-1',
items: [],
})
expect(result.isFailed()).to.be.true
})
it('should not import backups made from 004 into 003 account', async function () {
await Factory.registerOldUser({
application,
email,
password,
version: ProtocolVersion.V003,
})
const result = await application.importData({
version: ProtocolVersion.V004,
items: [],
})
expect(result.isFailed()).to.be.true
})
it('importing existing data should keep relationships valid', async function () {
const pair = createRelatedNoteTagPairPayload()
const notePayload = pair[0]
const tagPayload = pair[1]
await application.mutator.emitItemsFromPayloads([notePayload, tagPayload], PayloadEmitSource.LocalChanged)
expectedItemCount += 2
const note = application.items.getItems([ContentType.TYPES.Note])[0]
const tag = application.items.getItems([ContentType.TYPES.Tag])[0]
expect(tag.content.references.length).to.equal(1)
expect(tag.noteCount).to.equal(1)
expect(note.content.references.length).to.equal(0)
expect(application.items.itemsReferencingItem(note).length).to.equal(1)
await application.importData(
{
items: [notePayload, tagPayload],
},
true,
)
expect(application.items.items.length).to.equal(expectedItemCount)
expect(tag.content.references.length).to.equal(1)
expect(tag.noteCount).to.equal(1)
expect(note.content.references.length).to.equal(0)
expect(application.items.itemsReferencingItem(note).length).to.equal(1)
})
it('importing same note many times should create only one duplicate', async function () {
/**
* Used strategy here will be KEEP_LEFT_DUPLICATE_RIGHT
* which means that new right items will be created with different
*/
const notePayload = Factory.createNotePayload()
await application.mutator.emitItemFromPayload(notePayload, PayloadEmitSource.LocalChanged)
expectedItemCount++
const mutatedNote = new DecryptedPayload({
...notePayload,
content: {
...notePayload.content,
title: `${Math.random()}`,
},
})
await application.importData(
{
items: [mutatedNote, mutatedNote, mutatedNote],
},
true,
)
expectedItemCount++
expect(application.items.getDisplayableNotes().length).to.equal(2)
const imported = application.items.getDisplayableNotes().find((n) => n.uuid !== notePayload.uuid)
expect(imported.content.title).to.equal(mutatedNote.content.title)
})
it('importing a tag with lesser references should not create duplicate', async function () {
const pair = createRelatedNoteTagPairPayload()
const tagPayload = pair[1]
await application.mutator.emitItemsFromPayloads(pair, PayloadEmitSource.LocalChanged)
const mutatedTag = new DecryptedPayload({
...tagPayload,
content: {
...tagPayload.content,
references: [],
},
})
await application.importData(
{
items: [mutatedTag],
},
true,
)
expect(application.items.getDisplayableTags().length).to.equal(1)
expect(application.items.findItem(tagPayload.uuid).content.references.length).to.equal(1)
})
it('importing data with differing content should create duplicates', async function () {
const pair = createRelatedNoteTagPairPayload()
const notePayload = pair[0]
const tagPayload = pair[1]
await application.mutator.emitItemsFromPayloads(pair, PayloadEmitSource.LocalChanged)
expectedItemCount += 2
const note = application.items.getDisplayableNotes()[0]
const tag = application.items.getDisplayableTags()[0]
const mutatedNote = new DecryptedPayload({
...notePayload,
content: {
...notePayload.content,
title: `${Math.random()}`,
},
})
const mutatedTag = new DecryptedPayload({
...tagPayload,
content: {
...tagPayload.content,
title: `${Math.random()}`,
},
})
await application.importData(
{
items: [mutatedNote, mutatedTag],
},
true,
)
expectedItemCount += 2
expect(application.items.items.length).to.equal(expectedItemCount)
const newNote = application.items.getDisplayableNotes().find((n) => n.uuid !== notePayload.uuid)
const newTag = application.items.getDisplayableTags().find((t) => t.uuid !== tagPayload.uuid)
expect(newNote.uuid).to.not.equal(note.uuid)
expect(newTag.uuid).to.not.equal(tag.uuid)
const refreshedTag = application.items.findItem(tag.uuid)
expect(refreshedTag.content.references.length).to.equal(2)
expect(refreshedTag.noteCount).to.equal(2)
const refreshedNote = application.items.findItem(note.uuid)
expect(refreshedNote.content.references.length).to.equal(0)
expect(application.items.itemsReferencingItem(refreshedNote).length).to.equal(2)
expect(newTag.content.references.length).to.equal(1)
expect(newTag.noteCount).to.equal(1)
expect(newNote.content.references.length).to.equal(0)
expect(application.items.itemsReferencingItem(newNote).length).to.equal(1)
})
it('when importing items, imported values should not be used to determine if changed', async function () {
/**
* If you have a note and a tag, and the tag has 1 reference to the note,
* and you import the same two items, except modify the note value so that
* a duplicate is created, we expect only the note to be duplicated, and the
* tag not to. However, if only the note changes, and you duplicate the note,
* which causes the tag's references content to change, then when the incoming
* tag is being processed, it will also think it has changed, since our local
* value now doesn't match what's coming in. The solution is to get all values
* ahead of time before any changes are made.
*/
const note = await Factory.createMappedNote(application)
const tag = await Factory.createMappedTag(application)
expectedItemCount += 2
await application.mutator.changeItem(tag, (mutator) => {
mutator.e2ePendingRefactor_addItemAsRelationship(note)
})
const externalNote = Object.assign(
{},
{
uuid: note.uuid,
content: note.getContentCopy(),
content_type: note.content_type,
},
)
externalNote.content.text = `${Math.random()}`
const externalTag = Object.assign(
{},
{
uuid: tag.uuid,
content: tag.getContentCopy(),
content_type: tag.content_type,
},
)
await application.importData(
{
items: [externalNote, externalTag],
},
true,
)
expectedItemCount += 1
/** We expect now that the total item count is 3, not 4. */
expect(application.items.items.length).to.equal(expectedItemCount)
const refreshedTag = application.items.findItem(tag.uuid)
/** References from both items have merged. */
expect(refreshedTag.content.references.length).to.equal(2)
})
it('should import decrypted data and keep items that were previously deleted', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
Factory.handlePasswordChallenges(application, password)
const [note, tag] = await Promise.all([
Factory.createMappedNote(application),
Factory.createMappedTag(application),
])
await application.sync.sync({ awaitAll: true })
await application.mutator.deleteItem(note)
await application.sync.sync()
expect(application.items.findItem(note.uuid)).to.not.exist
await application.mutator.deleteItem(tag)
await application.sync.sync()
expect(application.items.findItem(tag.uuid)).to.not.exist
await application.importData(
{
items: [note, tag],
},
true,
)
expect(application.items.getDisplayableNotes().length).to.equal(1)
expect(application.items.findItem(note.uuid).deleted).to.not.be.ok
expect(application.items.getDisplayableTags().length).to.equal(1)
expect(application.items.findItem(tag.uuid).deleted).to.not.be.ok
})
it('should duplicate notes by alternating UUIDs when dealing with conflicts during importing', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
const note = await Factory.createSyncedNote(application)
/** Sign into another account and import the same item. It should get a different UUID. */
application = await Factory.signOutApplicationAndReturnNew(application)
email = UuidGenerator.GenerateUuid()
Factory.handlePasswordChallenges(application, password)
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
await application.importData(
{
items: [note.payload],
},
true,
)
expect(application.items.getDisplayableNotes().length).to.equal(1)
expect(application.items.getDisplayableNotes()[0].uuid).to.not.equal(note.uuid)
})
it('should maintain consistency between storage and PayloadManager after an import with conflicts', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
const note = await Factory.createSyncedNote(application)
/** Sign into another account and import the same items. They should get a different UUID. */
application = await Factory.signOutApplicationAndReturnNew(application)
email = UuidGenerator.GenerateUuid()
Factory.handlePasswordChallenges(application, password)
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
await application.importData(
{
items: [note],
},
true,
)
const storedPayloads = await application.storage.getAllRawPayloads()
expect(application.items.items.length).to.equal(storedPayloads.length)
const notes = storedPayloads.filter((p) => p.content_type === ContentType.TYPES.Note)
const itemsKeys = storedPayloads.filter((p) => p.content_type === ContentType.TYPES.ItemsKey)
expect(notes.length).to.equal(1)
expect(itemsKeys.length).to.equal(1)
})
it('should import encrypted data and keep items that were previously deleted', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
const [note, tag] = await Promise.all([
Factory.createMappedNote(application),
Factory.createMappedTag(application),
])
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
await application.sync.sync({ awaitAll: true })
await application.mutator.deleteItem(note)
await application.sync.sync()
expect(application.items.findItem(note.uuid)).to.not.exist
await application.mutator.deleteItem(tag)
await application.sync.sync()
expect(application.items.findItem(tag.uuid)).to.not.exist
await application.importData(backupData, true)
expect(application.items.getDisplayableNotes().length).to.equal(1)
expect(application.items.findItem(note.uuid).deleted).to.not.be.ok
expect(application.items.getDisplayableTags().length).to.equal(1)
expect(application.items.findItem(tag.uuid).deleted).to.not.be.ok
})
it('should import decrypted data and all items payload source should be FileImport', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
const [note, tag] = await Promise.all([
Factory.createMappedNote(application),
Factory.createMappedTag(application),
])
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
Factory.handlePasswordChallenges(application, password)
await application.importData(backupData, true)
const importedNote = application.items.findItem(note.uuid)
const importedTag = application.items.findItem(tag.uuid)
expect(importedNote.payload.source).to.be.equal(PayloadSource.FileImport)
expect(importedTag.payload.source).to.be.equal(PayloadSource.FileImport)
})
it('should import encrypted data and all items payload source should be FileImport', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
const [note, tag] = await Promise.all([
Factory.createMappedNote(application),
Factory.createMappedTag(application),
])
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
Factory.handlePasswordChallenges(application, password)
await application.importData(backupData, true)
const importedNote = application.items.findItem(note.uuid)
const importedTag = application.items.findItem(tag.uuid)
expect(importedNote.payload.source).to.be.equal(PayloadSource.FileImport)
expect(importedTag.payload.source).to.be.equal(PayloadSource.FileImport)
})
it('should import data from 003 encrypted payload using client generated backup', async function () {
const oldVersion = ProtocolVersion.V003
await Factory.registerOldUser({
application: application,
email: email,
password: password,
version: oldVersion,
})
const noteItem = await application.mutator.createItem(ContentType.TYPES.Note, {
title: 'Encrypted note',
text: 'On protocol version 003.',
})
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
Factory.handlePasswordChallenges(application, password)
const result = (await application.importData(backupData, true)).getValue()
expect(result.affectedItems.length).to.be.eq(backupData.items.length)
expect(result.errorCount).to.be.eq(0)
const decryptedNote = application.items.findItem(noteItem.uuid)
expect(decryptedNote.title).to.be.eq('Encrypted note')
expect(decryptedNote.text).to.be.eq('On protocol version 003.')
expect(application.items.getDisplayableNotes().length).to.equal(1)
})
it('should import data from 004 encrypted payload', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
const noteItem = await application.mutator.createItem(ContentType.TYPES.Note, {
title: 'Encrypted note',
text: 'On protocol version 004.',
})
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
Factory.handlePasswordChallenges(application, password)
const result = (await application.importData(backupData, true)).getValue()
expect(result.affectedItems.length).to.be.eq(backupData.items.length)
expect(result.errorCount).to.be.eq(0)
const decryptedNote = application.items.findItem(noteItem.uuid)
expect(decryptedNote.title).to.be.eq('Encrypted note')
expect(decryptedNote.text).to.be.eq('On protocol version 004.')
expect(application.items.getDisplayableNotes().length).to.equal(1)
})
it('should return correct errorCount', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
const noteItem = await application.mutator.createItem(ContentType.TYPES.Note, {
title: 'This is a valid, encrypted note',
text: 'On protocol version 004.',
})
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
Factory.handlePasswordChallenges(application, password)
const madeUpPayload = JSON.parse(JSON.stringify(noteItem))
madeUpPayload.items_key_id = undefined
madeUpPayload.content = '004:somenonsense'
madeUpPayload.enc_item_key = '003:anothernonsense'
madeUpPayload.version = '004'
madeUpPayload.uuid = 'fake-uuid'
backupData.items = [...backupData.items, madeUpPayload]
const result = (await application.importData(backupData, true)).getValue()
expect(result.affectedItems.length).to.be.eq(backupData.items.length - 1)
expect(result.errorCount).to.be.eq(1)
})
it('should not import data from 003 encrypted payload if an invalid password is provided', async function () {
const oldVersion = ProtocolVersion.V003
await Factory.registerOldUser({
application: application,
email: email,
password: UuidGenerator.GenerateUuid(),
version: oldVersion,
})
await application.mutator.createItem(ContentType.TYPES.Note, {
title: 'Encrypted note',
text: 'On protocol version 003.',
})
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
application.setLaunchCallback({
receiveChallenge: (challenge) => {
const values = challenge.prompts.map((prompt) =>
CreateChallengeValue(
prompt,
prompt.validation === ChallengeValidation.None ? 'incorrect password' : password,
),
)
application.submitValuesForChallenge(challenge, values)
},
})
const result = (await application.importData(backupData, true)).getValue()
expect(result.affectedItems.length).to.be.eq(0)
expect(result.errorCount).to.be.eq(backupData.items.length)
expect(application.items.getDisplayableNotes().length).to.equal(0)
})
it('should not import data from 004 encrypted payload if an invalid password is provided', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
await application.mutator.createItem(ContentType.TYPES.Note, {
title: 'This is a valid, encrypted note',
text: 'On protocol version 004.',
})
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
application.setLaunchCallback({
receiveChallenge: (challenge) => {
const values = challenge.prompts.map((prompt) => CreateChallengeValue(prompt, 'incorrect password'))
application.submitValuesForChallenge(challenge, values)
},
})
const result = (await application.importData(backupData, true)).getValue()
expect(result.affectedItems.length).to.be.eq(0)
expect(result.errorCount).to.be.eq(backupData.items.length)
expect(application.items.getDisplayableNotes().length).to.equal(0)
})
it('should not import encrypted data with no keyParams or auth_params', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
await application.mutator.createItem(ContentType.TYPES.Note, {
title: 'Encrypted note',
text: 'On protocol version 004.',
})
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
delete backupData.keyParams
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
const result = await application.importData(backupData)
expect(result.isFailed()).to.be.true
})
it('should not import payloads if the corresponding ItemsKey is not present within the backup file', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
Factory.handlePasswordChallenges(application, password)
await application.mutator.createItem(ContentType.TYPES.Note, {
title: 'Encrypted note',
text: 'On protocol version 004.',
})
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
backupData.items = backupData.items.filter((payload) => payload.content_type !== ContentType.TYPES.ItemsKey)
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
Factory.handlePasswordChallenges(application, password)
const result = (await application.importData(backupData, true)).getValue()
expect(result.affectedItems.length).to.equal(BaseItemCounts.BackupFileRootKeyEncryptedItems)
expect(result.errorCount).to.be.eq(backupData.items.length - BaseItemCounts.BackupFileRootKeyEncryptedItems)
expect(application.items.getDisplayableNotes().length).to.equal(0)
})
it('importing another accounts notes/tags should correctly keep relationships', async function () {
await Factory.registerUserToApplication({
application: application,
email: email,
password: password,
})
Factory.handlePasswordChallenges(application, password)
const pair = createRelatedNoteTagPairPayload()
await application.mutator.emitItemsFromPayloads(pair, PayloadEmitSource.LocalChanged)
await application.sync.sync()
const backupData = (await application.createEncryptedBackupFile.execute({ skipAuthorization: true })).getValue()
await Factory.safeDeinit(application)
application = await Factory.createInitAppWithFakeCrypto()
Factory.handlePasswordChallenges(application, password)
await Factory.registerUserToApplication({
application: application,
email: `${Math.random()}`,
password: password,
})
await application.importData(backupData, true)
expect(application.items.getDisplayableNotes().length).to.equal(1)
expect(application.items.getDisplayableTags().length).to.equal(1)
const importedNote = application.items.getDisplayableNotes()[0]
const importedTag = application.items.getDisplayableTags()[0]
expect(application.items.referencesForItem(importedTag).length).to.equal(1)
expect(application.items.itemsReferencingItem(importedNote).length).to.equal(1)
await Factory.safeDeinit(application)
}).timeout(Factory.TwentySecondTimeout)
})
describe('real crypto', function () {
let identifier = 'standardnotes'
it('should import data from 003 encrypted payload using server generated backup with 004 key params', async function () {
context = await Factory.createAppContextWithRealCrypto(identifier)
await context.launch()
application = context.application
const backupData = {
items: [
{
uuid: 'eb1b7eed-e43d-48dd-b257-b7fc8ccba3da',
duplicate_of: null,
items_key_id: null,
content:
'003:your_sha256_hash:eb1b7eed-e43d-48dd-b257-b7fc8ccba3da:9f38642b7a3f57546520a9e32aa7c0ad:your_sha256_hash5Aqxc5FqhvuF0+dE1f4+uQOeiRFNX73V2pJJY0w5Qq7l7ZuhB08ZtOMY4Ctq7evBBSIVZ+your_sha256_hashbP6XAm8U/la1bdtdMO112XjUW7ixkWi3POWcM=:your_sha256_hashyour_sha256_hashyour_sha256_hashMyJ9',
content_type: 'Note',
enc_item_key:
'003:your_sha256_hash:eb1b7eed-e43d-48dd-b257-b7fc8ccba3da:14721ff8dbdd36fb57ae4bf7414c5eab:odmq91dfaTZG/zeSUA09fD/PdB2OkiDxcQZ0FL06GPstxdvxnU17k1rtsWoA7HoNNnd5494BZ/b7YiKqUb76ddd8x3/+cTZgCa4tYxNINmb1T3wwUX0Ebxc8xynAhg6nTY/BGq+ba6jTyl8zw12dL3kBEGGglRCHnO0ZTeylwQW7asfONN8s0BwrvHdonRlx:your_sha256_hashyour_sha256_hashyour_sha256_hashMyJ9',
auth_hash: null,
created_at: '2019-05-12T02:29:21.789000Z',
updated_at: '2019-11-12T21:47:48.382708Z',
deleted: false,
},
{
uuid: '10051be7-4ca2-4af3-aae9-021939df4fab',
duplicate_of: null,
items_key_id: null,
content:
'004:77a986823b8ffdd87164b6f541de6ed420b70ac67e055774:+8cjww1QbyXNX+PSKeCwmnysv0rAoEaKh409VWQJpDbEy/your_sha256_hash2tdreW4J8v9pFEzPMec1oq40u+c+UI/Y6ChOLV/4ozyWmpQCK3y8Ugm7B1/your_sha256_hashe3trabdU0ICu0WMvDVii4qNlQo/inD41oHXKeV5QwnYoGjPrLJIaP0hiLKhDURTHygCdvWdp63OWI+aGxv0/HI+nfcRsqSE+aYECrWB/kp/c5yTrEqBEafuWZkw==:your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashdiI6IjAwNCJ9',
content_type: 'SN|ItemsKey',
enc_item_key:
'004:d25deb224251b4705a44d8ce125a62f6a2f0e0e856603e8f:FEv1pfU/VfY7XhJrTfpcdhaSBfmNySTQtHohFYDm8V84KlyF5YaXRKV7BfXsa77DKTjOCU/EHHsWwhBEEfsNnzNySHxTHNc26bpoz0V8h50=:your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashdiI6IjAwNCJ9',
auth_hash: null,
created_at: '2020-09-07T12:22:06.562000Z',
updated_at: '2021-03-03T15:09:55.741107Z',
deleted: false,
},
],
auth_params: {
identifier: 'playground@bitar.io',
pw_nonce: your_sha256_hash,
version: '004',
},
}
Factory.handlePasswordChallenges(application, 'password')
const result = (await application.importData(backupData, true)).getValue()
expect(result.affectedItems.length).to.be.eq(backupData.items.length)
expect(result.errorCount).to.be.eq(0)
})
it('importing data with no items key should use the root key generated by the file password', async function () {
/**
* In SNJS 2.0.12, this file import would fail with "incorrect password" on file.
* The reason was that we would use the default items key we had for the current account
* instead of using the password generated root key for the file.
*
* Note this test will not be able to properly sync as the credentials are invalid.
* This test is only meant to test successful local importing.
*/
const application = await Factory.createApplicationWithRealCrypto(identifier)
/** Create legacy migrations value so that base migration detects old app */
await application.device.setRawStorageValue(
'keychain',
JSON.stringify({
[identifier]: {
version: '003',
masterKey: your_sha256_hash,
dataAuthenticationKey: your_sha256_hash,
},
}),
)
await application.device.setRawStorageValue(
'descriptors',
JSON.stringify({
[identifier]: {
identifier: 'standardnotes',
label: 'Main Application',
primary: true,
},
}),
)
await application.device.setRawStorageValue('standardnotes-snjs_version', '2.0.11')
await application.device.saveDatabaseEntry(
{
content:
'003:your_sha256_hash:58e3322b-269a-4be3-a658-b035dffcd70f:9140b23a0fa989e224e292049f133154:SESTNOgIGf2+ZqmJdFnGU4EMgQkhKOzpZNoSzx76SJaImsayzctAgbUmJ+UU2gSQAHADS3+your_sha256_hash8hS+kNW2j1DjM4YWqd0JQxMOeOrMIrxr/6Awn5TzYE+9wCbXZdYHyvRQcp9ui/G02ZJ67IA86vNEdjTTBAAWipWqTqKH9VDZbSQ2W/IOKfIquB373SFDKZb1S1NmBFvcoG2G7w//fAl/+ehYiL6UdiNH5MhXCDAOTQRFNfOh57HFDWVnz1VIp8X+VAPy6d9zzQH+8aws1JxHq/7BOhXrFE8UCueV6kERt9njgQxKJzd9AH32ShSiUB9X/sPi0fUXbS178xAZMJrNx3w==:your_sha256_hashyour_sha256_hashyour_sha256_hashIm9yaWdpbmF0aW9uIjoicmVnaXN0cmF0aW9uIn0=',
content_type: 'SN|ItemsKey',
created_at: new Date(),
enc_item_key:
'003:your_sha256_hash:58e3322b-269a-4be3-a658-b035dffcd70f:2384a22d8f8bf671ba6517c6e1d0be30:0qXjBDPLCcMlNTnuUDcFiJPIXU9OP6b4ttTVE58n2Jn7971xMhx6toLbAZWWLPk/ezX/19EYE9xmRngWsG4jJaZMxGZIz/melU08K7AHH3oahQpHwZvSM3iV2ufsN7liQywftdVH6NNzULnZnFX+FgEfpDquru++R4aWDLvsSegWYmde9zD62pPNUB9Kik6P:your_sha256_hashyour_sha256_hashyour_sha256_hashIm9yaWdpbmF0aW9uIjoicmVnaXN0cmF0aW9uIn0=',
updated_at: new Date(),
uuid: '58e3322b-269a-4be3-a658-b035dffcd70f',
},
identifier,
)
/**
* Note that this storage contains "sync.standardnotes.org" as the API Host param.
*/
await application.device.setRawStorageValue(
'standardnotes-storage',
JSON.stringify({
wrapped: {
uuid: '15af096f-4e9d-4cde-8d67-f132218fa757',
content_type: 'SN|EncryptedStorage',
enc_item_key:
'003:your_sha256_hash:15af096f-4e9d-4cde-8d67-f132218fa757:09a4da52d5214e76642f0363246daa99:zt5fnmxYSZOqC+your_sha256_hash6Y4Y25rqO4lIerKjxxNqPwDze9mtPOGeoR48csUPiMIHiH78bLGZZs4VoBwYKAP+uEygXEFYRuscGnDOrFV7fnwGDL/nkhr6xpM159OTUKBgiBpVMS:your_sha256_hashyour_sha256_hashyour_sha256_hashIm9yaWdpbmF0aW9uIjoicmVnaXN0cmF0aW9uIn0=',
content:
'003:your_sha256_hash:15af096f-4e9d-4cde-8d67-f132218fa757:b92fb4b030ac51f4d3eef0ada35f3d5f:your_sha256_hash6EKHOT7zyCytR5l2B9b1J7Tls00uVgfEKs3zX7n3F6ne+ju0++WsJuy0Gre5your_sha512_hash+your_sha256_hashyour_sha256_hashtdvNOom3Vjwyour_sha512_hash+jb2vmv+TGHUV4kZJPluG7A9IEphMZrMWwiU56FdSlSDD82qd9iG+C3Pux+X/GYCMiWS2T/BoyI6a9OERSARuTUuom2bv59hqD1yUoj7VQXhqXmverSwLE1zDeF+dc0tMwuTNCNOTk08A6wRKTR9ZjuFlLcxHsg/VZyfIdCkElFh1FrliMbW2ZsgsPFaZAI+YN8pid1tTw+Ou1cOfyD85aki98DDvg/cTi8ahrrm8UvxRQwhIW17Cm1RnKxhIvaq5HRjEN76Y46ubkZv7/HjhNwJt9vPEr9wyOrMH6XSxCnSIFD1kbVHI33q444xyUWa/EQju8SoEGGU92HhpMWd1kIz37SJRJTC7u2ah2Xg60JGcUcCNtHG3IHMPVP+UKUjx5nKP6t/NVSa+xsjIvM/your_sha256_hash0Ze22HoouKBPAtWlYJ8fmvg2HiW6nX/L9DqoxK4OXt/LnC2BTEvtP4PUzBqx8WoqmVNNnYp+FgYptLcgxmgckle41w1eMr6NYGeaaC1Jk3i/e9Piw0w0XjV/lB+yn03gEMYPTT2yiXMQrfPmkUNYNN7/xfhY3bqqwfER7iXdr/80Lc+x9byywChXLvg8VCjHWGd+Sky3NHyMdxLY8IqefyyZWMeXtt1aNYH6QW9DeK5KvK3DI+your_sha256_hashfbMU06bYt0vszT2szAkOnVuyi6TBRiGLyjMxYI0csM0SHZWZUQK0z7ZoQAWR5D+adX29tOvrKc2kJA8Lrzgeqw/rJIh6zPg3kmsd2rFbo+Qfe3J6XrlZU+J+your_sha256_hasha6F2fEHPiXs4+9:your_sha256_hashyour_sha256_hashyour_sha256_hashIm9yaWdpbmF0aW9uIjoicmVnaXN0cmF0aW9uIn0=',
created_at: '2020-11-24T00:53:42.057Z',
updated_at: '1970-01-01T00:00:00.000Z',
},
nonwrapped: {
ROOT_KEY_PARAMS: {
pw_nonce: your_sha256_hash,
pw_cost: 110000,
identifier: 'nov2322@bitar.io',
version: '003',
},
},
}),
)
const password = 'password'
await application.prepareForLaunch({
receiveChallenge: (challenge) => {
if (challenge.reason === ChallengeReason.Custom) {
return
}
if (
challenge.reason === ChallengeReason.DecryptEncryptedFile ||
challenge.reason === ChallengeReason.ImportFile
) {
application.submitValuesForChallenge(
challenge,
challenge.prompts.map((prompt) =>
CreateChallengeValue(
prompt,
prompt.validation !== ChallengeValidation.ProtectionSessionDuration
? password
: UnprotectedAccessSecondsDuration.OneMinute,
),
),
)
}
},
})
await application.launch(false)
await application.setHost.execute(Factory.getDefaultHost())
const backupFile = {
items: [
{
uuid: '11204d02-5a8b-47c0-ab94-ae0727d656b5',
content_type: 'Note',
created_at: '2020-11-23T17:11:06.322Z',
enc_item_key:
'003:your_sha256_hash:11204d02-5a8b-47c0-ab94-ae0727d656b5:62de2b95cca4d7948f70516d12f5cb3a:lhUF/EoQP2DC8CSVrXyLp1yXsiJUXxwmtkwXtLUJ5sm4E0your_sha512_hash0EfuT/SJ9IqVbjgYhKA5xt/lMgw4JSbiW8ZkVQ5tVDfgt0omhDRLlkh758ou:your_sha256_hashyour_sha256_hashImlkZW50aWZpZXIiOiJub3YyMzVAYml0YXIuaW8iLCJ2ZXJzaW9uIjoiMDAzIn0=',
content:
'003:your_sha256_hash:11204d02-5a8b-47c0-ab94-ae0727d656b5:84a2b760019a62d7ad9c314bc7a5564a:G8Mm9fy9ybuo92VbV4NUERruJ1VA7garv1+fBg4KRDRjsRGoLvORhHldQHRfUQmSR6PkrG6ol/your_sha256_hashGFhAbYcVX4xrHKbkiuLQnu9bZp9zbR6txB1NtLoNFvwDZTMko7Q+28fM4TKBbQCCw3NufLHVUnfEwS7tLLFFPdEyyMXOerKP93u8X+7NG2eDmsUetPsPOq:your_sha256_hashyour_sha256_hashImlkZW50aWZpZXIiOiJub3YyMzVAYml0YXIuaW8iLCJ2ZXJzaW9uIjoiMDAzIn0=',
auth_hash: null,
updated_at: '2020-11-23T17:11:40.399Z',
},
],
auth_params: {
pw_nonce: your_sha256_hash,
pw_cost: 110000,
identifier: 'nov235@bitar.io',
version: '003',
},
}
const result = (await application.importData(backupFile, false)).getValue()
expect(result.errorCount).to.equal(0)
await Factory.safeDeinit(application)
})
})
})
``` |
The men's 40 km points race competition at the 1998 Asian Games was held on 17 December at Huamark Velodrome.
Schedule
All times are Indochina Time (UTC+07:00)
Results
Legend
DNF — Did not finish
References
External links
Results
Track Men points race |
Wo Hop is a restaurant in Chinatown, Manhattan, New York City.
Wo Hop may also refer to:
Wo Hop Shek, an area in the south of Fanling, Hong Kong
Wo Hop Shek Public Cemetery
Wo Hop To, a Hong Kong Triad |
```javascript
javascript: (function () {
window.bookmarkver = "1.4";
var isReddit =
document.location.hostname.split(".").slice(-2).join(".") === "reddit.com";
var isOverview = document.location.href.match(/\/overview\b/);
if (isReddit && isOverview) {
var cachBustUrl = `?${new Date().getDate()}`;
var cachBustUrl = 'path_to_url + (new Date().getDate());
// var cachBustUrl = "path_to_url" + (new Date().getDate());
fetch(cachBustUrl)
.then(function (response) {
return response.text();
})
.then(function (data) {
var script = document.createElement("script");
script.id = "pd-script";
script.innerHTML = data;
document.getElementsByTagName("head")[0].appendChild(script);
})
.catch(function () {
alert("Error retrieving PowerDeleteSuite from github");
});
} else if (
confirm(
"This script can only be run from your own user profile on reddit. Would you like to go there now?"
)
) {
document.location = "path_to_url";
} else {
alert("Please go to your reddit profile before running this script");
}
})();
``` |
```smalltalk
/***************** NCore Softwares Pvt. Ltd., India **************************
ColorBox
This program is provided to you under the terms of the Microsoft Public
***********************************************************************************/
using System;
using System.Windows;
using System.Windows.Controls;
using System.Windows.Markup;
namespace ColorBox
{
internal class Spinner : ContentControl
{
static Spinner()
{
DefaultStyleKeyProperty.OverrideMetadata(typeof(Spinner), new FrameworkPropertyMetadata(typeof(Spinner)));
}
public static readonly DependencyProperty ValidSpinDirectionProperty = DependencyProperty.Register("ValidSpinDirection", typeof(ValidSpinDirections), typeof(Spinner), new PropertyMetadata(ValidSpinDirections.Increase | ValidSpinDirections.Decrease, OnValidSpinDirectionPropertyChanged));
public ValidSpinDirections ValidSpinDirection
{
get { return (ValidSpinDirections)GetValue(ValidSpinDirectionProperty); }
set { SetValue(ValidSpinDirectionProperty, value); }
}
public static void OnValidSpinDirectionPropertyChanged(DependencyObject d, DependencyPropertyChangedEventArgs e)
{
ValidSpinDirections oldvalue = (ValidSpinDirections)e.OldValue;
ValidSpinDirections newvalue = (ValidSpinDirections)e.NewValue;
}
public event EventHandler<SpinEventArgs> Spin;
protected virtual void OnSpin(SpinEventArgs e)
{
EventHandler<SpinEventArgs> handler = Spin;
if (handler != null)
handler(this, e);
}
}
}
``` |
Frederick Robert Haxton (1879–1933) was an English professional footballer who made three appearances at left-half in the Southern League for Southampton in the 1900s, but spent most of his football career with Eastleigh Athletic in the Hampshire League.
Football career
Haxton was born in the parish of St Olave's in Southwark, South London but by his teens was living in Chandler's Ford, Hampshire. As a youth, he first played football with Chandlers Ford Star, before joining Eastleigh Athletic for the first time in September 1899. He spent a year with Chandlers Ford United from 1900 to 1901, before returning to Eastleigh Athletic for another three years.
In January 1904, he "assisted" Southampton's reserve team, before signing for the club in the 1904 close season. Regarded as a "keen, untiring fellow" who was as "hard as nails", he spent most of his time with the "Saints" in the reserves, being part of the side which won the Hampshire Senior Cup in 1905.
He made his first-team debut on 1 October 1904, when England international Bert Houlker was injured. In the Southern League match against Brighton & Hove Albion, he played at left-half in a 1–1 draw. His next appearance came six months later on 25 March 1905, when he again replaced Houlker, in a 2–1 victory at Portsmouth, with his third and final appearance on 11 November 1905, this time replacing Samuel Meston against Bristol Rovers (lost 5–1).
Haxton left Southampton in 1906 and returned to Eastleigh Athletic until moving to Manchester in 1909.
References
External links
Career details
1879 births
Footballers from Southwark
1933 deaths
English men's footballers
Men's association football midfielders
Southampton F.C. players
Southern Football League players
Eastleigh Athletic F.C. players |
The Keeper of the Register (more formally known as the Keeper of the National Register of Historic Places) is a National Park Service (NPS) official, responsible for deciding on the eligibility of historic properties for inclusion on the U.S. National Register of Historic Places (NRHP).
The Keeper of the Register role was created following the 1966 enactment of the National Historic Preservation Act (NHPA). The NHPA declared a national policy focus on preserving significant historic sites, and it has been amended several times since it was first enacted. The NHPA authorized the Secretary of the Interior to maintain a National Register of Historic Places, which has been delegated to the Keeper by the Director of the National Park Service.
The first person to hold the office was William J. Murtagh, whose term ran from 1967 through 1979. The Keeper's authority may be delegated as they see fit. The State Historic Preservation Officer for each state submits nominations to the Keeper. Upon receipt, the Keeper has 45 days to decide whether to add the property to the NRHP.
The Keeper of the Register role is supported by several regional reviewers, who review submissions for inclusion on the NHRP. This team also is supported by several archaeologists, archivists, and historians.
List of Keepers
William J. Murtagh – 1967-1979
Jerry L. Rogers – approximately 1981-1994
Carol D. Shull – Acting Keeper 1979–1980, Keeper 1994–2005, Interim Keeper 2009 to January 3, 2015
Jan Snyder Matthews – 2005–2009
Stephanie Toothman – Keeper January 4, 2015 – June 2, 2017
J. Paul Loether - Keeper June 3, 2017 – June 25, 2018
Joy Beasley(NPS Associate Director, Cultural Resources, Partnerships, and Science) - Keeper July 2018 – current
References
National Register of Historic Places
Historic preservation
Historical preservationists |
```sqlpl
ALTER TABLE users ADD COLUMN lastfm_username TEXT;
ALTER TABLE users ADD COLUMN lastfm_session_key TEXT;
``` |
Erhard Etzlaub ( 1455[?]/1465 – 1532) was a German astronomer, geodesist, cartographer, instrument maker and physician.
Life
Little is known of Etzlaub's life. One "Erhart Etzlauber" became a citizen of Nuremberg in 1484, but his profession was not recorded on that occasion. Assuming that the "Eberhardus Eczleiben" who matriculated at the Erfurter Hochschule in 1469 is the same person, then the year of his birth should be between 1455 and 1460 rather than later.
Letters from a third party dated 1500 and 1507 describe Etzlaub as a well-known instrument ("compass") maker and a geodesist, and a letter dated 1517 reveals that "he had also practicised as a physician for at least four years" and that he "comes from Erfurt". In 1515, he declared himself to be an "astronomer and physician, from Erfurt University".
His death is officially quoted as the 15th entry in an official list of 20 people buried between December 20, 1531, and February 21, 1532. Therefore, he very probably died in January or early February 1532. There were no inheritors.
The cartographer
The "Romweg" Map
On the occasion of the Holy Year 1500, when many pilgrims were expected to go to Rome, he designed his famous "Rom-Weg" map (= the Way to Rome), a 41 x 29 cm wood engraving in stereographic projection to a scale of about 1:5,600,000. This is the earliest printed road map of central Europe. It is, as all of Etzlaub's maps, "south up". Distances between cities can be computed by dotted lines, where a one-dot-step means one German Mile (7400m). Coloured prints (according to author's innovative requirements) show political regions, too.
The area of the map is between latitudes 58° (Viborg, Denmark) and 41° (Naples). No longitudes are given, but Paris shows up at the western margin, and Budapest at the eastern one. Data may have been drawn from c.1421 Klosterneuburg Fridericus map as well as from Etzlaub's own interviews with travelling merchants.
The "Roman Empire" road map
This was a second and improved edition of principally the same map, 1501, 54.5 x 39.7 cm, printed in Nuremberg by Georg Glogkendon. In 1533, Glogkendon's son Albrecht printed one more (unchanged) edition. The area covered by that later map was expanded to latitude 40° (south of Salerno), and about 74 more km towards west, and the map was more detailed in former marginal regions.
From all three editions, only 6 samples are known to have survived (e.g. the ones held by SUB (Göttingen), Germanisches Nationalmuseum (Nuremberg), Bibliothèque Nationale (Paris), British Library (London)), but Etzlaub's data were widely used during the first half of the 16th century, among others by Martin Waldseemüller and Sebastian Munster. Often, even the "south up" display was copied.
More maps
Besides the innovative "Romweg" map and its later editions, only two still existing maps are definitely known to be designed by Etzlaub:
A 1492 wood-cut (39 x 27 cm, printed by Jorg [George] Glogkendon, Nuremberg), showing 100 localities and their names within a radius of 120 km from Nuremberg.
Another map of Nuremberg's territory, 1519, painted on parchment by Nuremberg painter Michel Graf (scale ca. 1:30.000, 94 x 84 cm).
An earlier similar map, from 1516, came to us only as a copy made in 1600.
A 1507 plan of Hauseck real estates bought by the Nuremberg magistrate is lost.
With some probability (being very similar to the 1519 map), a map from 1516, parchment, 60 x 69 cm is Etzlaub's design.
The earliest map of Bohemia, created by Mikuláš Klaudyán (Nikolaus Klaudian or Claudianus) and printed in Nuremberg in 1518, is likely to be somehow "connected" to Etzlaub: Klaudyán stayed at Nuremberg several times during the years before, and one of Etzlaub's Almanachs appeared in Czech in 1517 although Etzlaub is very unlikely to have spoken it. The Klaudyán map is "South-up", shows an outline of Bohemia's borders similar to the "Romweg" map, and is coloured in a similar way.
The instrument maker
"Kompast" [sic!] was the term used for pocket-size sundials produced in Nuremberg since Regiomontanus' days, which were fitted with a compass, too, and were also used by seafarers. Only two of Etzlaub's pieces remain: one, from 1511, is kept by Germanisches Nationalmuseum (Nuremberg), another one, from 1513 and in Drecker's collection, purportedly "went to the USA".
In his time, Etzlaub's pieces were demanded: In a 1507 letter, Michel Beheim, brother of famous globe maker Martin Behaim, tells his brother Wolfgang that such pieces (i.e. more than one) will be sent to him to Lisbon within a few weeks, as soon as Etzlaub would have finished them. Johannes Cochlaeus notes on Etzlaub's work in Brevis Germaniae Descriptio, 1512, that his sundials were even demanded in Rome.
Miniature maps (latitudes 67°–0°, "South-up", no longitudes given) are engraved on the outside of the instrument's lids, allowing its user to adjust the gnomone according to actual latitude. To cope with compass bearings between the cities given, varying latitudes were used, reducing scale for lower latitudes, which was innovative, but conceptually opposite to Mercator's later approach (F.W. Krücken, 2004). In 1917, Joseph Drecker (1853–1931) had examined the 1513 miniature map and declared it to be a Mercator projection. After carefully analyzing both Etzlaub's und Mercator's maps, Krücken finds out: "There is no reason to see Etzlaub as a precursor of Mercator's projection".
Instructions on the use of his sundials were given by Etzlaub in Codex ad Compastum Norembergensem which was kept by Staatsbibliothek, Munich, Germany, but seems lost.
Etzlaub's "almanachs"
Those were calendars to be hanged on the wall, giving festive days, new and full moon, some planet's positions and hints on healthcare like best times for blood-letting. They show up since 1515. It is likely that Etzlaub published them every year, although the preserved samples are not continuous. According to different regions where they would be sold, the same content was presented in a varying design. From 1520, four different versions exist, designed for "Hochstift Eichstädt", "City of Regensburg", "Pfalzbayern" and Austria.
Since 1517, Etzlaub's coat of arms
shows up in many but not all of his almanacs. It seems, however, to be unknown to relevant German collections of heraldry.
Literature
Brigitte English, Erhard Etzlaub's Projection and Methods of Mapping, in: Imago Mundi, 48 (1996), pp. 103–123.
External links
Fritz Schnelbögl, „Leben und Werk des Nürnberger Kartographen Erhard Etzlaub“ in Mitteilungen des Vereins für Geschichte der Stadt Nürnberg Bd. 57. 1970, S. 216–231, Facsimile, German.
F.W. Krücken, Düsseldorf 2004, On Etzlaub's and Mercator's maps, German
Original woodcut of the "Romweg map"
Facsimile of the 1500 "Romweg" map, not coloured, but high resolution
Cut of the 1500 "Romweg" map, coloured
Cut of the 1501 coloured edition
1492, Surroundings of Nuremberg, zoomable map (Österreichische Nationalbibliothek, Vienna, Austria)
German cartographers
16th-century German astronomers
15th-century births
1532 deaths
Year of birth uncertain
Scientists from Erfurt
German scientific instrument makers
Engineers from Nuremberg
15th-century German astronomers |
```java
//
//
// 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.
//
///////////////////////////////////////////////////////////////////////////
import com.codahale.metrics.MetricRegistry;
import com.codahale.metrics.health.HealthCheckRegistry;
import com.code_intelligence.jazzer.api.FuzzedDataProvider;
import com.fasterxml.jackson.core.JsonFactory;
import com.fasterxml.jackson.core.JsonFactoryBuilder;
import com.fasterxml.jackson.databind.ObjectMapper;
import io.dropwizard.core.Configuration;
import io.dropwizard.core.server.DefaultServerFactory;
import io.dropwizard.core.setup.Environment;
// Generated with path_to_url
// Minor modifications to beautify code and ensure exception is caught.
// jvm-autofuzz-heuristics-6
// Heuristic name: jvm-autofuzz-heuristics-6
// Target method: [io.dropwizard.core.server.DefaultServerFactory] public void
// configure(io.dropwizard.core.setup.Environment)
public class DefaultServerFactoryFuzzer {
public static void fuzzerTestOneInput(FuzzedDataProvider data) {
DefaultServerFactory obj = new DefaultServerFactory();
obj.setAdminMaxThreads(data.consumeInt());
obj.setAdminMinThreads(data.consumeInt());
obj.setApplicationContextPath(data.consumeString(data.remainingBytes() / 2));
obj.setAdminContextPath(data.consumeString(data.remainingBytes() / 2));
obj.configure(new Environment(data.consumeRemainingAsString()));
}
}
``` |
```c++
#include "PowerTelemetryContainer.h"
#include "../ControlLib/Exceptions.h"
#include <algorithm>
#include <ranges>
#include <functional>
#include "../CommonUtilities/log/GlogShim.h"
bool PowerTelemetryContainer::Repopulate() {
try {
telemetry_providers_.clear();
telemetry_adapters_.clear();
// create providers
for (int iVendor = 0; iVendor < int(PM_DEVICE_VENDOR_UNKNOWN); iVendor++) {
try {
if (auto pProvider = pwr::PowerTelemetryProviderFactory::Make(
PM_DEVICE_VENDOR(iVendor))) {
telemetry_providers_.push_back(std::move(pProvider));
}
}
catch (const TelemetrySubsystemAbsent& e) {
LOG(INFO) << "Skipping Telemetry Provider: " << e.what();
}
catch (const std::runtime_error& e) {
LOG(INFO) << "Power Telemetry Failure: " << e.what();
}
catch (...) {
LOG(INFO) << "Unknown Telemetry Failure.";
}
}
// collect all adapters together from providers
for (const auto& pProvider : telemetry_providers_) {
auto& adapters = pProvider->GetAdapters();
telemetry_adapters_.insert(telemetry_adapters_.end(), adapters.begin(),
adapters.end());
}
// bail if there are not adapters
if (telemetry_adapters_.size() == 0) {
return false;
}
// Re-sort adapters based on video memory size in an attempt to return back the most
// capable adapters
constexpr auto ComparisonField = &pwr::PowerTelemetryAdapter::GetDedicatedVideoMemory;
std::ranges::sort(telemetry_adapters_, std::greater{}, ComparisonField);
return true;
}
catch (...) {
return false;
}
}
``` |
Charles Richard Gorry (18 September 1878 – 13 September 1950) was an Australian cricketer. He played first-class cricket as a wicket-keeper for New South Wales from 1907/08 to 1910/11.
Gorry was born in Auckland, but his family moved to Australia a few weeks later. He represented Glebe in the Sydney senior cricket competition. When the Australian team to England in 1909 was selected, his two Glebe teammates Warren Bardsley and Tibby Cotter, who were both selected, expressed their displeasure that Gorry had not also been chosen. Gorry was selected as the main wicketkeeper for the Australian tour of New Zealand in 1909–10, and played in the two matches against New Zealand.
Gorry worked for the Union Steam Ship Company in Sydney and lived in the suburb of Petersham. He died at Marrickville Hospital in September 1950.
See also
List of New South Wales representative cricketers
References
External links
1878 births
1950 deaths
Australian cricketers
New South Wales cricketers
Cricketers from Auckland
Colony of New Zealand emigrants to colonial Australia
Wicket-keepers |
Nehru School of Architecture (NSA) is one of the colleges of Nehru Group of Institutions, Coimbatore, Tamil Nadu. It was established in 2015 and is located in the Nehru Aeuronautical Campus, Palakkad, main road, Kuniyamuthur.
NSA is headed by Dr. Amrutha Sachin as its Director. The college is approved by the Council of Architecture (COA), New Delhi, affiliated to Anna University and The Indian Institute of Architects. The school conducts undergraduate courses in Architecture. The school has its own library with a collection of publications which include books, journals, thesis reports and back volumes.
Architecture schools in India
Universities and colleges in Chennai |
Leonidas Kormalis (; 6 November 1932 - 6 October 2003) was a Greek former sprinter who competed in the 1960 Summer Olympics. He was also part of Greece's winning 4×400 metres relay team at the 1959 Mediterranean Games.
References
External links
1932 births
Living people
Greek male sprinters
Olympic athletes for Greece
Athletes (track and field) at the 1960 Summer Olympics
Athletes from Athens
Athletes (track and field) at the 1959 Mediterranean Games
Mediterranean Games gold medalists for Greece
Mediterranean Games medalists in athletics
20th-century Greek people
2003 deaths |
```yaml
apiVersion: v1
name: primary-replica
description: Deploy a basic crunchy primary and replica cluster
version: 5.3.1
appVersion: 5.3.1
keywords:
- postgresql
- postgres
- database
- sql
home: path_to_url
icon: path_to_url
sources:
- path_to_url
``` |
Ras Lanuf ( ( , also: Ra’s al-Unūf )) is a Mediterranean town in northern Libya, on the Gulf of Sidra in Tripolitania. The town is also home to the Ra's Lanuf Refinery, completed in 1984, with a crude oil refining capacity of . The oil refinery is operated by the Ra's Lanuf Oil & Gas Processing Company, a subsidiary of the state-owned National Oil Corporation. Additionally, the city houses the Ra's Lanuf petrochemical complex – a major oil terminal – and oil pipelines: the Amal–Ra's Lanuf, the Messla–Ra's Lanuf, and the Defa-Ra's Lanuf pipeline.
History
Classical
Ras Lanouf was part of the Greek Pentapolis colonies. The traditional western boundary of the Pentapolis lay at Arae Philaenorum. Some historians claim it is 40 km west of El Agheila, while others place Arae Philaenorum near Ra's Lanuf, and the modern Italian commemorative arch featuring the Philaeni stood here before its destruction in 1973.
World War II
On 3 April 1941 there was a British war communiqué that in the North Africa Campaign in World War II in the night of 1 April 1941 Allied bomber aircraft heavily attacked German/Italian motor transport at Ra's Lanuf and destroyed many vehicles.
Growth under Gaddafi
Beginning in 1984, a major urban development program for Ra's Lanuf was initiated by the Brega and Ras Lanuf Higher Committee to accommodate employees of the nearby oil industries, and envisaged for 40,000 inhabitants. The general design of the town layout was to be linear, following the coast and allowing extensive views and easy physical connection with the sea from all parts of town.
The town's structure was based on a functional hierarchy, containing three centers forming public zones with community facilities extending to the Mediterranean coast; these are in turn surrounded by high-rise housing blocks. A pedestrian route links different public, commercial, and recreational facilities to residential areas. The project was carried out by Devecon Engineers and Architects.
Libyan Civil War
On 4 March 2011 after heavy fighting, anti-Gaddafi Libyan rebels captured Ra's Lanuf. The rebel advance was halted in the Battle of Bin Jawad and a counter-offensive by government forces opened the second phase of the Battle of Ra's Lanuf. After a heavy bombardment from air, land, and sea the government forces retook the city on 10 March. On 27 March rebels retook control of Ra's Lanuf as part of a rapid advance as 24 hours earlier they had retaken the strategic towns of Brega and Ajdabiya, but within a matter of days rebel forces retreated from the city once more in the face of a new government counter-offensive. On 23 August, rebels recaptured Ra's Lanuf from government loyalists and continued their advance towards Bin Jawad and Sirte; however, sporadic fighting continued in Ra's Lanuf into September.
Administrative governance
Under the Ottoman Empire, Ra's Lanuf was part of Tripolitania under Italy after 1934, then occupied by the British as again part of Tripolitania. In 1983 it became part of the Bin Jawad District. Since 1987, it has been under the Sirte District.
Economy
Ra's Lanuf is an import center for the petrochemical industry. The Ra's Lanuf Refinery has a capacity of . It is a part of larger petrochemical complex consisting of an ethylene plant, a polyethylene plant, plant utilities, and the Port of Ra's Lanuf. The Port of Ra's Lanuf consists of a small harbor, operated by the Veba Oil Company and RASCO. Its primary activities include loading crude oil and oil products. It has a maximum draft of 22 meters and is about west of the Benina International Airport.
Ra's Lanuf is the terminus of the Defa-Ra's Lanuf oil pipeline and the Majid-Nafora-Amal-Ra's Lanuf oil pipeline.
Ra's Lanuf has two airports: Ra's Lanuf Oil (Code:HLNF) and Matratin (Code:FR3803).
Ra's Lanuf is to be a station on the new national railway system of Libya. In addition it is to be a construction base for the section to be built by Russian engineers, with a port for the delivery of supplies. The port will be connected to the base by a branch line.
Nearby cities and towns
Sidra ( west)
Bin Jawad ( west)
El Agheila ( east)
Qaryat Bishr ( east)
Brega ( east)
Zella ( south)
Marada ( south)
See also
List of cities in Libya
Notes
External links
GPCO Website
اللجنة الشعبية العامة للمالية (= General People's Committee of Finance)
Libya: Country Profile
http://www.RasLanuf.com
Port cities and towns in Libya
Gulf of Sidra
Populated places in Sirte District
Populated coastal places in Libya
Tripolitania
Ports and harbors of Libya |
Kirkton Bridge Halt railway station or Kirkton Bridge Platform railway station was a request stop on the Fraserburgh and St Combs Light Railway, Aberdeenshire. It was opened in 1904 as Kirton Bridge Halt, later renamed as Kirkton Bridge Platform, on the links to serve the Fraserburgh golf course users and tourists a year after the line's other stations had opened. The 1948 timetable gives the station name as Kirkton Bridge Halt.
History
The line from Fraserburgh to St Combs itself had opened in 1903 and was the last line built by the Great North of Scotland Railway before it became part of the London and North Eastern Railway. The line was closed in 1965 by the Scottish Region of British Railways as part of the Beeching Cuts. The St Combs line was partly unfenced and it was therefore classified as a light railway and as a result the locomotives had cow catchers. The ruins of the old Church or Kirk of Philoth are located nearby, hence the name of the station.
Infrastructure
The short single platformed halt stood on the west of the line just south of Kirkton Bridge with the Fraserburgh golf club house nearby, located between the St Combs branch and the Fraserburgh branch close to the point where the two lines diverged. It was accessed via a path running across the road from the clubhouse and photographs show that it was built of wood with a gravel surface. No shelter or lighting were provided and the station had no sidings or signalling. A level crossing was located nearby at the 1.6 km or 1 mile mile post on the running towards St Combs. White posts beside the track at the halt assisted the train driver in positioning the train in poor light conditions or after dark. The gradient running towards St Combs was 1 in 50.
Services
The line in 1910 had seven return workings on weekdays and an additional late night Saturday train from Fraserburgh that departed at 9.30pm and returned at 10pm. No Sunday services were provided on the railway. The 1964 - 1965 timetable had 11 return workings per day between Fraserburgh and St Combs with an additional service on Saturdays. A journey took around twenty minutes and Kirkton Bridge was a request stop with passengers required to inform the guard if they wished to alight there. The line closed to goods on 7 November 1960, Kirkton Bridge Halt however had never handled goods.
The site today
The trackbed is visible in places however nothing remains of the halt. The Fraserburgh golf clubhouse is still present.
References
Sources
Maxtone, Graham and Cooper, Mike (2018). Then and Now on the Great North. V.1. GNoSR Association. .
Disused railway stations in Aberdeenshire
Beeching closures in Scotland
Former Great North of Scotland Railway stations
Railway stations in Great Britain opened in 1904
Railway stations in Great Britain closed in 1965
1903 establishments in Scotland
1965 disestablishments in Scotland |
The Theatre of María Guerrero (Spanish: Teatro María Guerrero) is a theatre located in Madrid, Spain. It was declared Bien de Interés Cultural on 1 March 1996. It is the home of the national theatre of Spain, Centro Dramático Nacional.
Its plays was programmed on 15 January 1934 until 1935, when it was remodeled. It was closed on 27 April 1940 because Spanish Civil War started. It was directed successively by Luis Escobar Kirkpatrick (with Huberto Pérez de la Ossa as subdirector) (1940-1952), Claudio de la Torre (1952-1960) and José Luis Alonso Mañés (1960-1975).
References
Maria Guerrero
Theatres in Madrid
Bien de Interés Cultural landmarks in Madrid
Buildings and structures in Justicia neighborhood, Madrid |
The village church of Landow () is the Evangelical parish church of the parish of Rambin in the south of the German island of Rügen. It is located in the village of Landow in the municipality of Dreschvitz.
It was built as a Wegekirche in Landow around the year 1312. A Wegekirche is a church which is designed such that the location of the priest and congregation gives the impression that they are on their way to the Lord, facing the Christ, usually in the symbolic form of a cross or painting.
In 2004, dendrochronological research of the oak timber-framing was carried out. This demonstrated that the church is one of the oldest on the island of Rügen and may be the oldest timber-framed church building in North Germany and the entire southeast Baltic Sea region.
The church was sited on an old salt and herring trading route. It was first mentioned in the records when reference was made to a priest at Landow ...plebane (Priester) in Landaue dating to the year 1333. In 1369 a Kaland Brotherhood was mentioned, something which was important for churches in the Middle Ages.
The original timber-framed of the building was bricked in around 1542. The interior was decorated in the baroque style in the 18th century. The altar, font, pulpit and painted wooden ceiling of the church all came from the workshop of the most important Pomeranian sculptor of the baroque style, Elias Kessler from the town of Stralsund. The vestry attached to the church later became a crypt chapel for the family of the church patrons. After 1945, the coffins were removed from the crypt chapel and buried in the cemetery.
During the GDR period, major repairs were carried out, most recently in 1959 on the church roof. In the late 1960s, the continued preservation of the church building became an issue. The consistory of the Evangelical Church of Greifswald felt in 1970 that it was no longer in a position to fund the preservation of the isolated church building. In 1982 the church was assessed as in danger of collapse and, in the 1980s, it was also removed from the county monument list.
The church is now supported by a preservation society. Various events are held in it, including concerts as part of the Mecklenburg-Vorpommern Festival.
The cemetery and its graves, some of which are very old, are also worth seeing.
Parish
The Evangelical parish belongs to the church district of Stralsund within the Pomeranian Evangelical Church.
See also
List of churches on Rügen
Literature
Ulrike Reinfeldt: Die Dorfkirche zu Landow. In: Pommern. Zeitschrift für Kultur und Geschichte. Heft 1/2012, , p. 16–19.
External links
Kirchenseite
Lutheran churches in Mecklenburg-Western Pomerania
Buildings and structures in Vorpommern-Rügen
Rügen
Dreschvitz
Lutheran churches converted from Roman Catholicism |
Shipwreck is an album by the Scottish musician Chris Connelly, released in 1994. It continued Connelly's move away from industrial music.
Connelly supported the album by touring with Low Pop Suicide.
Production
The album was produced by the New Pain. It was recorded in the wake of the suicide of Connelly's girlfriend, and dealt with Connelly's reevaluation of his life after the excesses of his twenties; Connelly had taken an 18-month break from music before entering the studio. The backing band included Ministry members Bill Rieflin and William Tucker.
"The Early Nighters" is dedicated to River Phoenix.
Critical reception
Rolling Stone stated: "Its music gorgeous, its lyrics strange, confessional and sometimes oddly comic, Shipwreck is a stunning album—a furious attempt to fashion something glorious." Trouser Press wrote that "Connelly's pronounced vocal resemblance to Bowie remains disarming throughout Shipwreck'''s eleven fascinating chapters, but as long as the real thing shows no inclination of creating music this affecting and accessible, Connelly might as well make the most of it." The Baltimore Sun deemed Shipwreck an "amiably upbeat album recalls the arty appeal of late-'70s David Bowie."
The Chicago Tribune called the album "a masterful blend of creepy atmospherics, the odd noise, visceral guitars-and-drums interplay and folkish melodies-delivered in Connelly's evocative, brogue-tinged tenor." The St. Louis Post-Dispatch thought that Shipwreck "ditches the industrial shtick for a near art/rock approach." The Los Angeles Times opined that "even among the obvious Bowie-isms, there was enough sense of personal vision to indicate that Connelly can transcend the reference and stake out territory distinctly his own."
AllMusic wrote that "most of the songs have a sharp acoustic/electric guitar kick and at once rough and carefully produced feel to them." MusicHound Rock: The Essential Album Guide deemed Shipwreck'' "one of the great, overlooked albums of the decade."
Track listing
References
Chris Connelly (musician) albums
1994 albums
Wax Trax! Records albums |
Mary Florence Denton (July 4, 1857 – December 24, 1947) was an American educator in Japan, and a longtime member of the faculty at Doshisha University in Kyoto.
Early life
Mary Florence Denton was born in Grass Valley, California, the daughter of Edward Michael Denton and Mary Mehitable Strobridge Denton.
Career
As a young woman, Denton was a teacher and temperance activist in Pasadena. She went to Japan in 1888, supported by the American Board of Commissioners for Foreign Missions, and taught English, Bible study, and cookery classes for many years at the Doshisha University in Kyoto. She raised funds for the school from American benefactors, lectured on Japan during her few furlough visits to the United States, and encouraged Doshisha students, including Hisa Nagano and Taki Handa, to pursue further study abroad. She was also active in the Red Cross, the WCTU and the YWCA in Japan, serving on the YWCA's national committee from 1910 to 1927. She retired from active teaching in 1928. In 1931, she was granted an honorary doctorate from Williams College, in recognition of her lifetime of teaching.
While living on the Doshisha campus, she often hosted American visitors to Japan, including Charles Lindbergh and Anne Morrow Lindbergh. In 1936, she hosted a visiting American art collector, Lilla Cabot Perry, who wrote about Denton, "She is doubtless in her late eighties, but made of wire and steel." Denton lived in Japan through World War II, despite several orders for Americans to leave the country. Because of her advanced age and frailty, and out of respect for her long service to the school, Doshisha College arranged for her to stay in her home, officially on house arrest, for the war's duration. Her family in the United States had no news from her during the war, only learning of her survival from an Associated Press report in October 1945.
Personal life
Denton died from bronchitis in 1947, aged 90 years, in Kyoto. Her remains were buried in the common grave of missionary teachers, in the college cemetery. Her library was donated to the Doshisha University Library, and a building on the Doshisha campus is named Denton Hall in her memory. In 2008, the college celebrated the 150th anniversary of Denton's birth, with a program including two of her great-nieces, and a few people who had known Denton in her later years. One of her great-nieces was actress Sandra Church.
References
External links
Frances Benton Clapp, Mary Florence Denton and the Doshisha (Doshisha University Press 1955). A biography written by a missionary colleague of Denton's, published after Denton's death.
1857 births
1947 deaths
American expatriates in Japan
American educators
People from Nevada County, California
Academic staff of Doshisha University
People from Grass Valley, California
American Christian missionaries |
USS Champlin (DD-104) was a built for the United States Navy during World War I.
Description
The Wickes class was an improved and faster version of the preceding . Two different designs were prepared to the same specification that mainly differed in the turbines and boilers used. The ships built to the Bethlehem Steel design, built in the Fore River and Union Iron Works shipyards, mostly used Yarrow boilers that deteriorated badly during service and were mostly scrapped during the 1930s. The ships displaced at standard load and at deep load. They had an overall length of , a beam of and a draught of . They had a crew of 6 officers and 108 enlisted men.
Performance differed radically between the ships of the class, often due to poor workmanship. The Wickes class was powered by two steam turbines, each driving one propeller shaft, using steam provided by four water-tube boilers. The turbines were designed to produce a total of intended to reach a speed of . The ships carried of fuel oil which was intended gave them a range of at .
The ships were armed with four 4-inch (102 mm) guns in single mounts and were fitted with two 1-pounder guns for anti-aircraft defense. Their primary weapon, though, was their torpedo battery of a dozen 21 inch (533 mm) torpedo tubes in four triple mounts. In many ships a shortage of 1-pounders caused them to be replaced by 3-inch (76 mm) anti-aircraft (AA) guns. They also carried a pair of depth charge rails. A "Y-gun" depth charge thrower was added to many ships.
Construction and career
Champlin, named in honor of Stephen Champlin, was launched 7 April 1918 by Union Iron Works, San Francisco, California; sponsored by Miss G. H. Rolph; and commissioned 11 November 1918.
Champlin arrived at Newport, Rhode Island, 12 December 1918 for duty with the Atlantic Fleet. After training operations in the Caribbean, she cleared New York City 19 November 1919 for San Diego, California. Arriving 24 December 1919, she went into reserve with the Pacific Fleet the same day, and cruised on training assignments with a reduced complement until decommissioned 7 June 1922. Laid up at San Diego until her assignment for use in experiments on 19 May 1933, Champlin was sunk in tests 12 August 1936.
Notes
References
External links
NavSource Photos
Champlin (DD-104)
Ships built in San Francisco
1918 ships
Maritime incidents in 1936
Ships sunk as targets
Shipwrecks of the California coast |
```c
/*********************************************************************/
/* */
/* Optimized BLAS libraries */
/* By Kazushige Goto <kgoto@tacc.utexas.edu> */
/* */
/* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING */
/* THIS SOFTWARE AND DOCUMENTATION, INCLUDING ANY WARRANTIES OF */
/* MERCHANTABILITY, FITNESS FOR ANY PARTICULAR PURPOSE, */
/* NON-INFRINGEMENT AND WARRANTIES OF PERFORMANCE, AND ANY WARRANTY */
/* THAT MIGHT OTHERWISE ARISE FROM COURSE OF DEALING OR USAGE OF */
/* TRADE. NO WARRANTY IS EITHER EXPRESS OR IMPLIED WITH RESPECT TO */
/* THE USE OF THE SOFTWARE OR DOCUMENTATION. */
/* Under no circumstances shall University be liable for incidental, */
/* special, indirect, direct or consequential damages or loss of */
/* profits, interruption of business, or related expenses which may */
/* arise from use of Software or Documentation, including but not */
/* limited to those resulting from defects in Software and/or */
/* Documentation, or loss or inaccuracy of data of any kind. */
/*********************************************************************/
#include <stdio.h>
#include <ctype.h>
#include "common.h"
const static FLOAT dm1 = -1.;
#undef GEMV_UNROLL
#define GEMV_UNROLL DTB_ENTRIES
int CNAME(BLASLONG m, FLOAT *a, BLASLONG lda, FLOAT *b, BLASLONG incb, void *buffer){
BLASLONG i, is, min_i;
FLOAT *gemvbuffer = (FLOAT *)buffer;
FLOAT *B = b;
if (incb != 1) {
B = buffer;
gemvbuffer = (FLOAT *)(((BLASLONG)buffer + m * sizeof(FLOAT) + 4095) & ~4095);
COPY_K(m, b, incb, buffer, 1);
}
for (is = 0; is < m; is += GEMV_UNROLL){
min_i = MIN(m - is, GEMV_UNROLL);
#ifdef TRANSA
if (is > 0){
GEMV_T(is, min_i, 0, dm1,
a + is * lda , lda,
B, 1,
B + is, 1, gemvbuffer);
}
#endif
for (i = 0; i < min_i; i++) {
FLOAT *AA = a + is + (i + is) * lda;
FLOAT *BB = B + is;
#ifdef TRANSA
if (i > 0) BB[i] -= DOTU_K(i, AA, 1, BB, 1);
#endif
#ifndef UNIT
BB[i] /= AA[i];
#endif
#ifndef TRANSA
if (i < min_i - 1) {
AXPYU_K(min_i - i - 1 , 0, 0, - BB[i],
AA + i + 1, 1, BB + i + 1, 1, NULL, 0);
}
#endif
}
#ifndef TRANSA
if (m - is > min_i){
GEMV_N(m - is - min_i, min_i, 0, dm1,
a + is + min_i + is * lda, lda,
B + is, 1,
B + (is + min_i), 1, gemvbuffer);
}
#endif
}
if (incb != 1) {
COPY_K(m, buffer, 1, b, incb);
}
return 0;
}
``` |
Birlikte is the name and motto of a series of semi-annual rallies and corresponding cultural festivals against right-wing extremist violence in Germany, which first took place on 9 June 2014 in Cologne. The term "" is Turkish and means "together" (German: "").
Birlikte – Zusammenstehen: 7–9 June 2014
The concept of a cultural festival named "" was based on an idea by , and was further developed and supported by the Cologne Arsch huh, Zäng ussenander (English: "Raise your ass, open your mouth!") campaign.
The first rally " – " (English: "Birlikte – Standing together") was held on Whit Monday, 9 June 2014, on the occurrence of the tenth anniversary of the nail bomb attacks in Cologne. The festival deliberately took place at a spare area at Cologne's , near , the street, where the National Socialist Underground (German: ) (NSU) attacks had happened a decade earlier.
The event comprised a mixture of speeches and multi-cultural music performances. Among the planned speakers and musicians were Stefan Aust, Aynur Doğan, Stephan Bachmann, BAP and Wolfgang Niedecken, the Bläck Fööss, Andreas Bourani, Tom Buhrow, Clueso, Wilma Elles, Eko Fresh, , Tommy Engel and , Sertab Erener and Demir Demirkan, Die Fantastischen Vier, Alexa Feser, , Max Herre, Höhner, Ralf Jäger, the , , Carolin Kebekus, Hardy Krüger senior, Udo Lindenberg, Zülfü Livaneli, Sylvia Löhrmann, Peter Maffay, , (mayor of Lampedusa e Linosa), , Meral Sahin, , Wilfried Schmickler, (the daughter of Enver Şimşek, the first victim of the NSU attacks), , Atanasios Tsiolakidis, the , and the German Federal President Joachim Gauck, who opened the event.
Due to the severe supercell thunderstorm Ela the event had to be terminated prematurely, so that some of the planned guests could no longer perform. This included the solo performances of Udo Lindenberg and Peter Maffay. Parts of the abandoned performance of BAP including the approaching thunder storm were published on the 2014 album (English: "The tale of the unplugged plug").
The rally was moderated by Sandra Maischberger and . It was attended by a total of around people.
Birlikte – Zusammenleben: 14 June 2015
Originally planned as a one-time event only, the festival was repeated on 14 June 2015 under the modified motto " – " (English: "Birlikte – Living together") following continuing threats by right-wing rallies of Pegida and Kögida, but also, because the longwinded NSU trial still hadn't come to an end.
However, this time the event was limited to one day.
Also, the organizers didn't rely on a large open-air stage as before, instead the number and size of the other stages was increased, so that effectively more people could participate in the festival compared to 2014. In total, over 500 local and over-regional artists performed on some 30 stages, including Brings, the Bläck Fööss, De Höhner, Eko Fresh, , , Mariama Kouyaté, Maryam Akhondy, the , Syavash Rastani Bandari Trance, and .
The concert programme was accompanied by various other activities like theatre performances, speeches and public discussions at the Schauspiel Köln/ and in the Keupstraße. Among the participants were Esther Bejarano, , Lamya Kaddor, Navid Kermani, Rupert Neudeck and . According to the organizers, the estimated number of festival visitors was in the s, similar to the numbers a year earlier.
The event started at 11 o'clock in the morning, the last performance ended at 23 o'clock.
Birlikte – Zusammenreden: 27 May – 5 June 2016
When the festival was held for the third time, this time under the motto " – " (English: "Birlikte – Talking together"), the programme was expanded to include a "week of dialogue" with various events distributed all over the city.
This started on 27 May 2016. The event week aimed at initiating a dialogue between the participants and artists, scientists, intellectuals and members of the city council on the possibilities how to improve ways of living together and to overcome cultural, religious and language barriers.
These activities peaked in a huge whole-day art and cultural festival and a central rally held at Keupstraße and at the Carlswerk on 5 June 2016. On 25 stages more than 400 artists should have performed. However, due to a severe weather warning, the main event in Köln-Mülheim had again to be cancelled at 16 o'clock already.
See also
Rock gegen Rechts
Rock Against Racism
Wir sind mehr
References
External links
[12:12]
[3:38]
[30:51]
Nonviolence
Anti-fascist organisations in Germany
21st century in Cologne
Cultural festivals in Germany
Festivals of multiculturalism
Music festivals established in 2014
2014 music festivals
2015 music festivals
2016 music festivals
Political terminology in Germany |
```c++
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Tencent is pleased to support the open source community by making behaviac available.
//
//
//
// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//your_sha256_hash--------
//your_sha256_hash--------
#include "behaviac/common/meta/meta.h"
#include "test.h"
SUITE(behaviac)
{
SUITE(Type)
{
struct TrueCheck
{
enum { Result = 1 };
};
struct FalseCheck
{
enum { Result = 2 };
};
TEST(IfThenElse, Test4)
{
const int32_t trueCheck = behaviac::Meta::IfThenElse< true, TrueCheck, FalseCheck >::Result::Result;
const int32_t falseCheck = behaviac::Meta::IfThenElse< false, TrueCheck, FalseCheck >::Result::Result;
CHECK_EQUAL(1, trueCheck);
CHECK_EQUAL(2, falseCheck);
}
}
}
``` |
```objective-c
/*
*
* in the file LICENSE in the source distribution or at
* path_to_url
*/
#ifndef HEADER_BN_H
# define HEADER_BN_H
# include <openssl/e_os2.h>
# ifndef OPENSSL_NO_STDIO
# include <stdio.h>
# endif
# include <openssl/opensslconf.h>
# include <openssl/ossl_typ.h>
# include <openssl/crypto.h>
# include <openssl/bnerr.h>
#ifdef __cplusplus
extern "C" {
#endif
/*
* 64-bit processor with LP64 ABI
*/
# ifdef SIXTY_FOUR_BIT_LONG
# define BN_ULONG unsigned long
# define BN_BYTES 8
# endif
/*
* 64-bit processor other than LP64 ABI
*/
# ifdef SIXTY_FOUR_BIT
# define BN_ULONG unsigned long long
# define BN_BYTES 8
# endif
# ifdef THIRTY_TWO_BIT
# define BN_ULONG unsigned int
# define BN_BYTES 4
# endif
# define BN_BITS2 (BN_BYTES * 8)
# define BN_BITS (BN_BITS2 * 2)
# define BN_TBIT ((BN_ULONG)1 << (BN_BITS2 - 1))
# define BN_FLG_MALLOCED 0x01
# define BN_FLG_STATIC_DATA 0x02
/*
* avoid leaking exponent information through timing,
* BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,
* BN_div() will call BN_div_no_branch,
* BN_mod_inverse() will call BN_mod_inverse_no_branch.
*/
# define BN_FLG_CONSTTIME 0x04
# define BN_FLG_SECURE 0x08
# if OPENSSL_API_COMPAT < 0x00908000L
/* deprecated name for the flag */
# define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME
# define BN_FLG_FREE 0x8000 /* used for debugging */
# endif
void BN_set_flags(BIGNUM *b, int n);
int BN_get_flags(const BIGNUM *b, int n);
/* Values for |top| in BN_rand() */
#define BN_RAND_TOP_ANY -1
#define BN_RAND_TOP_ONE 0
#define BN_RAND_TOP_TWO 1
/* Values for |bottom| in BN_rand() */
#define BN_RAND_BOTTOM_ANY 0
#define BN_RAND_BOTTOM_ODD 1
/*
* get a clone of a BIGNUM with changed flags, for *temporary* use only (the
* two BIGNUMs cannot be used in parallel!). Also only for *read only* use. The
* value |dest| should be a newly allocated BIGNUM obtained via BN_new() that
* has not been otherwise initialised or used.
*/
void BN_with_flags(BIGNUM *dest, const BIGNUM *b, int flags);
/* Wrapper function to make using BN_GENCB easier */
int BN_GENCB_call(BN_GENCB *cb, int a, int b);
BN_GENCB *BN_GENCB_new(void);
void BN_GENCB_free(BN_GENCB *cb);
/* Populate a BN_GENCB structure with an "old"-style callback */
void BN_GENCB_set_old(BN_GENCB *gencb, void (*callback) (int, int, void *),
void *cb_arg);
/* Populate a BN_GENCB structure with a "new"-style callback */
void BN_GENCB_set(BN_GENCB *gencb, int (*callback) (int, int, BN_GENCB *),
void *cb_arg);
void *BN_GENCB_get_arg(BN_GENCB *cb);
# define BN_prime_checks 0 /* default: select number of iterations based
* on the size of the number */
/*
* BN_prime_checks_for_size() returns the number of Miller-Rabin iterations
* that will be done for checking that a random number is probably prime. The
* error rate for accepting a composite number as prime depends on the size of
* the prime |b|. The error rates used are for calculating an RSA key with 2 primes,
* and so the level is what you would expect for a key of double the size of the
* prime.
*
* This table is generated using the algorithm of FIPS PUB 186-4
* Digital Signature Standard (DSS), section F.1, page 117.
* (path_to_url
*
* The following magma script was used to generate the output:
* securitybits:=125;
* k:=1024;
* for t:=1 to 65 do
* for M:=3 to Floor(2*Sqrt(k-1)-1) do
* S:=0;
* // Sum over m
* for m:=3 to M do
* s:=0;
* // Sum over j
* for j:=2 to m do
* s+:=(RealField(32)!2)^-(j+(k-1)/j);
* end for;
* S+:=2^(m-(m-1)*t)*s;
* end for;
* A:=2^(k-2-M*t);
* B:=8*(Pi(RealField(32))^2-6)/3*2^(k-2)*S;
* pkt:=2.00743*Log(2)*k*2^-k*(A+B);
* seclevel:=Floor(-Log(2,pkt));
* if seclevel ge securitybits then
* printf "k: %5o, security: %o bits (t: %o, M: %o)\n",k,seclevel,t,M;
* break;
* end if;
* end for;
* if seclevel ge securitybits then break; end if;
* end for;
*
* It can be run online at:
* path_to_url
*
* And will output:
* k: 1024, security: 129 bits (t: 6, M: 23)
*
* k is the number of bits of the prime, securitybits is the level we want to
* reach.
*
* prime length | RSA key size | # MR tests | security level
* -------------+--------------|------------+---------------
* (b) >= 6394 | >= 12788 | 3 | 256 bit
* (b) >= 3747 | >= 7494 | 3 | 192 bit
* (b) >= 1345 | >= 2690 | 4 | 128 bit
* (b) >= 1080 | >= 2160 | 5 | 128 bit
* (b) >= 852 | >= 1704 | 5 | 112 bit
* (b) >= 476 | >= 952 | 5 | 80 bit
* (b) >= 400 | >= 800 | 6 | 80 bit
* (b) >= 347 | >= 694 | 7 | 80 bit
* (b) >= 308 | >= 616 | 8 | 80 bit
* (b) >= 55 | >= 110 | 27 | 64 bit
* (b) >= 6 | >= 12 | 34 | 64 bit
*/
# define BN_prime_checks_for_size(b) ((b) >= 3747 ? 3 : \
(b) >= 1345 ? 4 : \
(b) >= 476 ? 5 : \
(b) >= 400 ? 6 : \
(b) >= 347 ? 7 : \
(b) >= 308 ? 8 : \
(b) >= 55 ? 27 : \
/* b >= 6 */ 34)
# define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w);
int BN_is_zero(const BIGNUM *a);
int BN_is_one(const BIGNUM *a);
int BN_is_word(const BIGNUM *a, const BN_ULONG w);
int BN_is_odd(const BIGNUM *a);
# define BN_one(a) (BN_set_word((a),1))
void BN_zero_ex(BIGNUM *a);
# if OPENSSL_API_COMPAT >= 0x00908000L
# define BN_zero(a) BN_zero_ex(a)
# else
# define BN_zero(a) (BN_set_word((a),0))
# endif
const BIGNUM *BN_value_one(void);
char *BN_options(void);
BN_CTX *BN_CTX_new(void);
BN_CTX *BN_CTX_secure_new(void);
void BN_CTX_free(BN_CTX *c);
void BN_CTX_start(BN_CTX *ctx);
BIGNUM *BN_CTX_get(BN_CTX *ctx);
void BN_CTX_end(BN_CTX *ctx);
int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom);
int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
int BN_priv_rand_range(BIGNUM *rnd, const BIGNUM *range);
int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
int BN_num_bits(const BIGNUM *a);
int BN_num_bits_word(BN_ULONG l);
int BN_security_bits(int L, int N);
BIGNUM *BN_new(void);
BIGNUM *BN_secure_new(void);
void BN_clear_free(BIGNUM *a);
BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
void BN_swap(BIGNUM *a, BIGNUM *b);
BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);
int BN_bn2bin(const BIGNUM *a, unsigned char *to);
int BN_bn2binpad(const BIGNUM *a, unsigned char *to, int tolen);
BIGNUM *BN_lebin2bn(const unsigned char *s, int len, BIGNUM *ret);
int BN_bn2lebinpad(const BIGNUM *a, unsigned char *to, int tolen);
BIGNUM *BN_mpi2bn(const unsigned char *s, int len, BIGNUM *ret);
int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
/** BN_set_negative sets sign of a BIGNUM
* \param b pointer to the BIGNUM object
* \param n 0 if the BIGNUM b should be positive and a value != 0 otherwise
*/
void BN_set_negative(BIGNUM *b, int n);
/** BN_is_negative returns 1 if the BIGNUM is negative
* \param b pointer to the BIGNUM object
* \return 1 if a < 0 and 0 otherwise
*/
int BN_is_negative(const BIGNUM *b);
int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
BN_CTX *ctx);
# define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
BN_CTX *ctx);
int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
const BIGNUM *m);
int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
BN_CTX *ctx);
int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
const BIGNUM *m);
int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
BN_CTX *ctx);
int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);
int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m,
BN_CTX *ctx);
int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
int BN_mul_word(BIGNUM *a, BN_ULONG w);
int BN_add_word(BIGNUM *a, BN_ULONG w);
int BN_sub_word(BIGNUM *a, BN_ULONG w);
int BN_set_word(BIGNUM *a, BN_ULONG w);
BN_ULONG BN_get_word(const BIGNUM *a);
int BN_cmp(const BIGNUM *a, const BIGNUM *b);
void BN_free(BIGNUM *a);
int BN_is_bit_set(const BIGNUM *a, int n);
int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
int BN_lshift1(BIGNUM *r, const BIGNUM *a);
int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
const BIGNUM *m, BN_CTX *ctx);
int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
const BIGNUM *m, BN_CTX *ctx,
BN_MONT_CTX *in_mont);
int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,
const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,
BN_CTX *ctx, BN_MONT_CTX *m_ctx);
int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
const BIGNUM *m, BN_CTX *ctx);
int BN_mask_bits(BIGNUM *a, int n);
# ifndef OPENSSL_NO_STDIO
int BN_print_fp(FILE *fp, const BIGNUM *a);
# endif
int BN_print(BIO *bio, const BIGNUM *a);
int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);
int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
int BN_rshift1(BIGNUM *r, const BIGNUM *a);
void BN_clear(BIGNUM *a);
BIGNUM *BN_dup(const BIGNUM *a);
int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
int BN_set_bit(BIGNUM *a, int n);
int BN_clear_bit(BIGNUM *a, int n);
char *BN_bn2hex(const BIGNUM *a);
char *BN_bn2dec(const BIGNUM *a);
int BN_hex2bn(BIGNUM **a, const char *str);
int BN_dec2bn(BIGNUM **a, const char *str);
int BN_asc2bn(BIGNUM **a, const char *str);
int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); /* returns
* -2 for
* error */
BIGNUM *BN_mod_inverse(BIGNUM *ret,
const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
BIGNUM *BN_mod_sqrt(BIGNUM *ret,
const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
void BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords);
/* Deprecated versions */
DEPRECATEDIN_0_9_8(BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe,
const BIGNUM *add,
const BIGNUM *rem,
void (*callback) (int, int,
void *),
void *cb_arg))
DEPRECATEDIN_0_9_8(int
BN_is_prime(const BIGNUM *p, int nchecks,
void (*callback) (int, int, void *),
BN_CTX *ctx, void *cb_arg))
DEPRECATEDIN_0_9_8(int
BN_is_prime_fasttest(const BIGNUM *p, int nchecks,
void (*callback) (int, int, void *),
BN_CTX *ctx, void *cb_arg,
int do_trial_division))
/* Newer versions */
int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,
const BIGNUM *rem, BN_GENCB *cb);
int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);
int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,
int do_trial_division, BN_GENCB *cb);
int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx);
int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
const BIGNUM *Xp, const BIGNUM *Xp1,
const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,
BN_GENCB *cb);
int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1,
BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e,
BN_CTX *ctx, BN_GENCB *cb);
BN_MONT_CTX *BN_MONT_CTX_new(void);
int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
BN_MONT_CTX *mont, BN_CTX *ctx);
int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
BN_CTX *ctx);
int BN_from_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
BN_CTX *ctx);
void BN_MONT_CTX_free(BN_MONT_CTX *mont);
int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx);
BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);
BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, CRYPTO_RWLOCK *lock,
const BIGNUM *mod, BN_CTX *ctx);
/* BN_BLINDING flags */
# define BN_BLINDING_NO_UPDATE 0x00000001
# define BN_BLINDING_NO_RECREATE 0x00000002
BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod);
void BN_BLINDING_free(BN_BLINDING *b);
int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx);
int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
BN_CTX *);
int BN_BLINDING_is_current_thread(BN_BLINDING *b);
void BN_BLINDING_set_current_thread(BN_BLINDING *b);
int BN_BLINDING_lock(BN_BLINDING *b);
int BN_BLINDING_unlock(BN_BLINDING *b);
unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);
void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);
BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
int (*bn_mod_exp) (BIGNUM *r,
const BIGNUM *a,
const BIGNUM *p,
const BIGNUM *m,
BN_CTX *ctx,
BN_MONT_CTX *m_ctx),
BN_MONT_CTX *m_ctx);
DEPRECATEDIN_0_9_8(void BN_set_params(int mul, int high, int low, int mont))
DEPRECATEDIN_0_9_8(int BN_get_params(int which)) /* 0, mul, 1 high, 2 low, 3
* mont */
BN_RECP_CTX *BN_RECP_CTX_new(void);
void BN_RECP_CTX_free(BN_RECP_CTX *recp);
int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *rdiv, BN_CTX *ctx);
int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
BN_RECP_CTX *recp, BN_CTX *ctx);
int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
const BIGNUM *m, BN_CTX *ctx);
int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
BN_RECP_CTX *recp, BN_CTX *ctx);
# ifndef OPENSSL_NO_EC2M
/*
* Functions for arithmetic over binary polynomials represented by BIGNUMs.
* The BIGNUM::neg property of BIGNUMs representing binary polynomials is
* ignored. Note that input arguments are not const so that their bit arrays
* can be expanded to the appropriate size if needed.
*/
/*
* r = a + b
*/
int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
# define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)
/*
* r=a mod p
*/
int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p);
/* r = (a * b) mod p */
int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
const BIGNUM *p, BN_CTX *ctx);
/* r = (a * a) mod p */
int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
/* r = (1 / b) mod p */
int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx);
/* r = (a / b) mod p */
int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
const BIGNUM *p, BN_CTX *ctx);
/* r = (a ^ b) mod p */
int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
const BIGNUM *p, BN_CTX *ctx);
/* r = sqrt(a) mod p */
int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
BN_CTX *ctx);
/* r^2 + r = a mod p */
int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
BN_CTX *ctx);
# define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))
/*-
* Some functions allow for representation of the irreducible polynomials
* as an unsigned int[], say p. The irreducible f(t) is then of the form:
* t^p[0] + t^p[1] + ... + t^p[k]
* where m = p[0] > p[1] > ... > p[k] = 0.
*/
/* r = a mod p */
int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[]);
/* r = (a * b) mod p */
int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
const int p[], BN_CTX *ctx);
/* r = (a * a) mod p */
int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
BN_CTX *ctx);
/* r = (1 / b) mod p */
int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const int p[],
BN_CTX *ctx);
/* r = (a / b) mod p */
int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
const int p[], BN_CTX *ctx);
/* r = (a ^ b) mod p */
int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
const int p[], BN_CTX *ctx);
/* r = sqrt(a) mod p */
int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,
const int p[], BN_CTX *ctx);
/* r^2 + r = a mod p */
int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,
const int p[], BN_CTX *ctx);
int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max);
int BN_GF2m_arr2poly(const int p[], BIGNUM *a);
# endif
/*
* faster mod functions for the 'NIST primes' 0 <= a < p^2
*/
int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
const BIGNUM *BN_get0_nist_prime_192(void);
const BIGNUM *BN_get0_nist_prime_224(void);
const BIGNUM *BN_get0_nist_prime_256(void);
const BIGNUM *BN_get0_nist_prime_384(void);
const BIGNUM *BN_get0_nist_prime_521(void);
int (*BN_nist_mod_func(const BIGNUM *p)) (BIGNUM *r, const BIGNUM *a,
const BIGNUM *field, BN_CTX *ctx);
int BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,
const BIGNUM *priv, const unsigned char *message,
size_t message_len, BN_CTX *ctx);
/* Primes from RFC 2409 */
BIGNUM *BN_get_rfc2409_prime_768(BIGNUM *bn);
BIGNUM *BN_get_rfc2409_prime_1024(BIGNUM *bn);
/* Primes from RFC 3526 */
BIGNUM *BN_get_rfc3526_prime_1536(BIGNUM *bn);
BIGNUM *BN_get_rfc3526_prime_2048(BIGNUM *bn);
BIGNUM *BN_get_rfc3526_prime_3072(BIGNUM *bn);
BIGNUM *BN_get_rfc3526_prime_4096(BIGNUM *bn);
BIGNUM *BN_get_rfc3526_prime_6144(BIGNUM *bn);
BIGNUM *BN_get_rfc3526_prime_8192(BIGNUM *bn);
# if OPENSSL_API_COMPAT < 0x10100000L
# define get_rfc2409_prime_768 BN_get_rfc2409_prime_768
# define get_rfc2409_prime_1024 BN_get_rfc2409_prime_1024
# define get_rfc3526_prime_1536 BN_get_rfc3526_prime_1536
# define get_rfc3526_prime_2048 BN_get_rfc3526_prime_2048
# define get_rfc3526_prime_3072 BN_get_rfc3526_prime_3072
# define get_rfc3526_prime_4096 BN_get_rfc3526_prime_4096
# define get_rfc3526_prime_6144 BN_get_rfc3526_prime_6144
# define get_rfc3526_prime_8192 BN_get_rfc3526_prime_8192
# endif
int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom);
# ifdef __cplusplus
}
# endif
#endif
``` |
The Costello School is an 11–16 mixed secondary school with academy status in Basingstoke, Hampshire, England.
It originally opened as Basingstoke High School for girls. It became Harriet Costello Secondary School in 1972 when it became a co-ed, but was renamed Costello Technology College after gaining specialist Technology College status. The school was converted to academy status on 1 July 2012 and was renamed The Costello School. Before becoming an academy it was a community school under the direct control of Hampshire County Council. The school continues to coordinate with Hampshire County Council for admissions. The school, as of 1 September 2018, is now part of the multi-academy trust (MAT) Bohunt Education Trust.
Notable alumni
Elizabeth Hurley, actress
Tom Rees, ex-England rugby union footballer
References
External links
Secondary schools in Hampshire
Academies in Hampshire |
Ashley Elizabeth "Ashlie" Atkinson (born August 6, 1977) is an American character actress who works in movies and television (with over 90 credits) – as well as in theater. Atkinson is known for her work as Ace on Happy!, Peaches in the Netflix film Juanita, Connie in the Spike Lee film BlacKkKlansman, and Janice in the fourth season of Mr. Robot.
Early life and education
Atkinson was born in Little Rock, Arkansas. Her father was a doctor and her mother was a nurse. Her family has lived in Arkansas for many generations.
In 1995, Atkinson graduated from Pulaski Academy in Little Rock, Arkansas. Atkinson attended Barnard College of Columbia University in New York City for three semesters but in 1996, moved back to Arkansas and eventually transferred to Hendrix College, where she had previously attended a summer program through Arkansas Governor's School for drama. In 2001, Atkinson graduated from Hendrix College with a degree in theater arts.
In 2003, after moving back to New York City when she was 24, Atkinson graduated from the Neighborhood Playhouse School of the Theatre. While at the Neighborhood Playhouse, she studied the Meisner technique.
Career
Film and television
While at the Neighborhood Playhouse School, director Jace Alexander saw Atkinson perform in a showcase there. This led to a 2004 guest starring appearance in the TV show Law & Order and a six-episode arc in the Denis Leary TV series, Rescue Me.
Atkinson then starred in a breakout role as Helen, the sweet-faced, plus-size librarian in Neil LaBute's 2004 off-Broadway play Fat Pig. The role garnered her a Theatre World Award for Outstanding Off-Broadway Debut, as well as nominations for both a Lucille Lortel Award and an Outer Critics Circle Award.
In 2007, Atkinson appeared in a Broadway revival of the Terrence McNally play, The Ritz.
In 2011, Atkinson hit the three guest star appearance in the Law & Order franchise, following her 2005 debut on the original Law & Order with a 2007 appearance on Law & Order: Criminal Intent, and then in 2011 both Law & Order: Criminal Intent and Law & Order: Special Victims Unit.
In 2012, Atkinson guest starred on the TV series Boardwalk Empire as Gyp's wife, Gianconda Rosetti. She appeared on a 2012 episode of 30 Rock.
In 2013, Atkinson portrayed Rochelle Applebaum in the Martin Scorsese film The Wolf of Wall Street.
In 2013 and 2014, Atkinson had a four episode arc in the TV show, F to 7th. From 2013 to 2014, she was featured on the American remake of Gavin and Stacey, called Us & Them in the role of Nessa.
In 2018, Atkinson played the role of Connie Kendrickson in the Academy Award-winning film BlacKkKlansman, directed by Spike Lee. She had previously worked with Lee in the 2006 Denzel Washington film, Inside Man. Atkinson also worked alongside Lee's sister Joie Lee, contributing sound work on his 2008 WWII drama, Miracle at St. Anna. Also in 2018, Atkinson had a recurring role on the TV series, One Dollar.
From 2018 to 2019, Atkinson was Ace, Internal Affairs Detective, in four episodes of the Syfy TV show Happy!, a live-action/adult animated black comedy/action-drama television series.
In 2019, Atkinson portrayed Mrs. Fosse in the mini-series Fosse/Verdon. She had a two episode arc in the 2019 Allison Tolman thriller Emergence and played a trucker in the ensemble opposite Alfre Woodard in the Netflix movie, Juanita.
And also in 2019, Atkinson was on the fourth and final season of Mr. Robot, playing the character Janice.
Other work
From 2003, Atkinson is a former skater and long-time member of the 5-time world champion Gotham Girls roller derby team under the name of "Margaret Thrasher (Prime Minister of Your Demise)", although she has since retired.
In 2004, Atkinson appeared in the music video for the Kings of Leon song, "Four Kicks" off their album Aha Shake Heartbreak.
In 2006, Atkinson became the face of a fictional character called Chunky Pam. Her character, Chunky Pam, was featured in three videos: in a Christmas promotion for MTV called "Merry X.X.X.L.M.A.S. (Pam I Am)", in a Valentine's Day promotion called "Pampered", and a one-off music video titled "Dirrrty Jerzy", in which she raps about being from New Jersey.
In 2016, Atkinson appeared in the Ubisoft video game WATCH_DOGS 2 as Lenni.
In 2017, Atkinson starred as Dakota "Dak" Prentiss in a 14-episode noir science fiction thriller audio drama podcast called Steal the Stars, the story of two government employees guarding the biggest secret in the world: a crashed UFO.
Personal life
In 2015, Atkinson married gaffer, musician, and filmmaker Leon Chase. The couple were married at the Arkansas music venue the White Water Tavern and live in Brooklyn. Shortly after that, Atkinson came out as queer.
Filmography
Film
Television
Awards
2005: Theatre World Award, Outstanding Off-Broadway Debut for Fat Pig
2005: Lucille Lortel Award (nominee), Outstanding Lead Actress for Fat Pig
2005: Outer Critics Circle Award, Outstanding Featured Actress in a Play (nominee), for Fat Pig
2014: Hendrix College, Outstanding Young Alumnus Award
Selected theater
2005: The 24 Hour Plays – as Winnie
2005: Fat Pig by Neil LaBute – as Helen (Lucille Lortel Theatre)<ref name=2004_NYPost-FatPig>{{cite news|last1=Hoffman|first1=Barbara|title=The Bravest Actress in New York – Would You Star in Something Called 'Fat Pig?|url=https://nypost.com/2004/12/02/the-bravest-actress-in-new-york-would-you-star-in-something-called-fat-pig/|work=New York Post|date=2 December 2004|language=en}}</ref>
2005: Making Marilyn – as Marilyn Monroe (Bridge Theatre Company at Theatre 54)
2005: The Butcher of Baraboo by Marisa Wegrzyn – as Midge (Second Stage Theatre)
2007: The Ritz by Terrence McNally – as Vivian Proclo (Roundabout Theatre)
2010: As You Like It by William Shakespeare (The Bridge Project)
2010: The Tempest by William Shakespeare (The Bridge Project)
2010: Psychomachia by Jennifer Lane – as Lydia (Theatre 54 @ Shelter Studios)
2011: The Book Club Play by Karen Zacarías (Arena Stage)
2013: January Joiner: A Weight Loss Horror Comedy by Laura Jacqmin – as Terry (Long Wharf Theatre)
2014: Love, Loss, and What I Wore by Nora and Delia Ephron (Rubicon Theatre Company)
2015: Steve by Mark Gerrard – as Carrie (Pershing Square Signature Center / The Romulus Linney Courtyard Theatre)
2016: The Forgotten Woman by Jonathan Tolins (Bay Street Theater)
2017: Imogen Says Nothing'' by Aditi Kapil (Yale Rep at Binger Center for New Theatre)
References
External links
1977 births
Living people
American film actresses
American stage actresses
American television actresses
Actresses from Little Rock, Arkansas
Barnard College alumni
Roller derby skaters
American roller skaters
Hendrix College alumni
21st-century American actresses
Theatre World Award winners
Sportspeople from Little Rock, Arkansas
Queer actors
LGBT people from Arkansas |
Renormalization is a collection of techniques in quantum field theory, statistical field theory, and the theory of self-similar geometric structures, that are used to treat infinities arising in calculated quantities by altering values of these quantities to compensate for effects of their self-interactions. But even if no infinities arose in loop diagrams in quantum field theory, it could be shown that it would be necessary to renormalize the mass and fields appearing in the original Lagrangian.
For example, an electron theory may begin by postulating an electron with an initial mass and charge. In quantum field theory a cloud of virtual particles, such as photons, positrons, and others surrounds and interacts with the initial electron. Accounting for the interactions of the surrounding particles (e.g. collisions at different energies) shows that the electron-system behaves as if it had a different mass and charge than initially postulated. Renormalization, in this example, mathematically replaces the initially postulated mass and charge of an electron with the experimentally observed mass and charge. Mathematics and experiments prove that positrons and more massive particles like protons exhibit precisely the same observed charge as the electron – even in the presence of much stronger interactions and more intense clouds of virtual particles.
Renormalization specifies relationships between parameters in the theory when parameters describing large distance scales differ from parameters describing small distance scales. Physically, the pileup of contributions from an infinity of scales involved in a problem may then result in further infinities. When describing spacetime as a continuum, certain statistical and quantum mechanical constructions are not well-defined. To define them, or make them unambiguous, a continuum limit must carefully remove "construction scaffolding" of lattices at various scales. Renormalization procedures are based on the requirement that certain physical quantities (such as the mass and charge of an electron) equal observed (experimental) values. That is, the experimental value of the physical quantity yields practical applications, but due to their empirical nature the observed measurement represents areas of quantum field theory that require deeper derivation from theoretical bases.
Renormalization was first developed in quantum electrodynamics (QED) to make sense of infinite integrals in perturbation theory. Initially viewed as a suspect provisional procedure even by some of its originators, renormalization eventually was embraced as an important and self-consistent actual mechanism of scale physics in several fields of physics and mathematics.
Today, the point of view has shifted: on the basis of the breakthrough renormalization group insights of Nikolay Bogolyubov and Kenneth Wilson, the focus is on variation of physical quantities across contiguous scales, while distant scales are related to each other through "effective" descriptions. All scales are linked in a broadly systematic way, and the actual physics pertinent to each is extracted with the suitable specific computational techniques appropriate for each. Wilson clarified which variables of a system are crucial and which are redundant.
Renormalization is distinct from regularization, another technique to control infinities by assuming the existence of new unknown physics at new scales.
Self-interactions in classical physics
The problem of infinities first arose in the classical electrodynamics of point particles in the 19th and early 20th century.
The mass of a charged particle should include the mass–energy in its electrostatic field (electromagnetic mass). Assume that the particle is a charged spherical shell of radius . The mass–energy in the field is
which becomes infinite as . This implies that the point particle would have infinite inertia and thus cannot be accelerated. Incidentally, the value of that makes equal to the electron mass is called the classical electron radius, which (setting and restoring factors of and ) turns out to be
where is the fine-structure constant, and is the reduced Compton wavelength of the electron.
Renormalization: The total effective mass of a spherical charged particle includes the actual bare mass of the spherical shell (in addition to the mass mentioned above associated with its electric field). If the shell's bare mass is allowed to be negative, it might be possible to take a consistent point limit. This was called renormalization, and Lorentz and Abraham attempted to develop a classical theory of the electron this way. This early work was the inspiration for later attempts at regularization and renormalization in quantum field theory.
(See also regularization (physics) for an alternative way to remove infinities from this classical problem, assuming new physics exists at small scales.)
When calculating the electromagnetic interactions of charged particles, it is tempting to ignore the back-reaction of a particle's own field on itself. (Analogous to the back-EMF of circuit analysis.) But this back-reaction is necessary to explain the friction on charged particles when they emit radiation. If the electron is assumed to be a point, the value of the back-reaction diverges, for the same reason that the mass diverges, because the field is inverse-square.
The Abraham–Lorentz theory had a noncausal "pre-acceleration". Sometimes an electron would start moving before the force is applied. This is a sign that the point limit is inconsistent.
The trouble was worse in classical field theory than in quantum field theory, because in quantum field theory a charged particle experiences Zitterbewegung due to interference with virtual particle–antiparticle pairs, thus effectively smearing out the charge over a region comparable to the Compton wavelength. In quantum electrodynamics at small coupling, the electromagnetic mass only diverges as the logarithm of the radius of the particle.
Divergences in quantum electrodynamics
When developing quantum electrodynamics in the 1930s, Max Born, Werner Heisenberg, Pascual Jordan, and Paul Dirac discovered that in perturbative corrections many integrals were divergent (see The problem of infinities).
One way of describing the perturbation theory corrections' divergences was discovered in 1947–49 by Hans Kramers, Hans Bethe,
Julian Schwinger, Richard Feynman, and Shin'ichiro Tomonaga, and systematized by Freeman Dyson in 1949. The divergences appear in radiative corrections involving Feynman diagrams with closed loops of virtual particles in them.
While virtual particles obey conservation of energy and momentum, they can have any energy and momentum, even one that is not allowed by the relativistic energy–momentum relation for the observed mass of that particle (that is, is not necessarily the squared mass of the particle in that process, e.g. for a photon it could be nonzero). Such a particle is called off-shell. When there is a loop, the momentum of the particles involved in the loop is not uniquely determined by the energies and momenta of incoming and outgoing particles. A variation in the energy of one particle in the loop can be balanced by an equal and opposite change in the energy of another particle in the loop, without affecting the incoming and outgoing particles. Thus many variations are possible. So to find the amplitude for the loop process, one must integrate over all possible combinations of energy and momentum that could travel around the loop.
These integrals are often divergent, that is, they give infinite answers. The divergences that are significant are the "ultraviolet" (UV) ones. An ultraviolet divergence can be described as one that comes from
the region in the integral where all particles in the loop have large energies and momenta,
very short wavelengths and high-frequencies fluctuations of the fields, in the path integral for the field,
very short proper-time between particle emission and absorption, if the loop is thought of as a sum over particle paths.
So these divergences are short-distance, short-time phenomena.
Shown in the pictures at the right margin, there are exactly three one-loop divergent loop diagrams in quantum electrodynamics:
(a) A photon creates a virtual electron–positron pair, which then annihilates. This is a vacuum polarization diagram.
(b) An electron quickly emits and reabsorbs a virtual photon, called a self-energy.
(c) An electron emits a photon, emits a second photon, and reabsorbs the first. This process is shown in the section below in figure 2, and it is called a vertex renormalization. The Feynman diagram for this is also called a “penguin diagram” due to its shape remotely resembling a penguin.
The three divergences correspond to the three parameters in the theory under consideration:
The field normalization Z.
The mass of the electron.
The charge of the electron.
The second class of divergence called an infrared divergence, is due to massless particles, like the photon. Every process involving charged particles emits infinitely many coherent photons of infinite wavelength, and the amplitude for emitting any finite number of photons is zero. For photons, these divergences are well understood. For example, at the 1-loop order, the vertex function has both ultraviolet and infrared divergences. In contrast to the ultraviolet divergence, the infrared divergence does not require the renormalization of a parameter in the theory involved. The infrared divergence of the vertex diagram is removed by including a diagram similar to the vertex diagram with the following important difference: the photon connecting the two legs of the electron is cut and replaced by two on-shell (i.e. real) photons whose wavelengths tend to infinity; this diagram is equivalent to the bremsstrahlung process. This additional diagram must be included because there is no physical way to distinguish a zero-energy photon flowing through a loop as in the vertex diagram and zero-energy photons emitted through bremsstrahlung. From a mathematical point of view, the IR divergences can be regularized by assuming fractional differentiation w.r.t. a parameter, for example:
is well defined at but is UV divergent; if we take the -th fractional derivative with respect to , we obtain the IR divergence
so we can cure IR divergences by turning them into UV divergences.
A loop divergence
The diagram in Figure 2 shows one of the several one-loop contributions to electron–electron scattering in QED. The electron on the left side of the diagram, represented by the solid line, starts out with 4-momentum and ends up with 4-momentum . It emits a virtual photon carrying to transfer energy and momentum to the other electron. But in this diagram, before that happens, it emits another virtual photon carrying 4-momentum , and it reabsorbs this one after emitting the other virtual photon. Energy and momentum conservation do not determine the 4-momentum uniquely, so all possibilities contribute equally and we must integrate.
This diagram's amplitude ends up with, among other things, a factor from the loop of
The various factors in this expression are gamma matrices as in the covariant formulation of the Dirac equation; they have to do with the spin of the electron. The factors of are the electric coupling constant, while the provide a heuristic definition of the contour of integration around the poles in the space of momenta. The important part for our purposes is the dependency on of the three big factors in the integrand, which are from the propagators of the two electron lines and the photon line in the loop.
This has a piece with two powers of on top that dominates at large values of (Pokorski 1987, p. 122):
This integral is divergent and infinite, unless we cut it off at finite energy and momentum in some way.
Similar loop divergences occur in other quantum field theories.
Renormalized and bare quantities
The solution was to realize that the quantities initially appearing in the theory's formulae (such as the formula for the Lagrangian), representing such things as the electron's electric charge and mass, as well as the normalizations of the quantum fields themselves, did not actually correspond to the physical constants measured in the laboratory. As written, they were bare quantities that did not take into account the contribution of virtual-particle loop effects to the physical constants themselves. Among other things, these effects would include the quantum counterpart of the electromagnetic back-reaction that so vexed classical theorists of electromagnetism. In general, these effects would be just as divergent as the amplitudes under consideration in the first place; so finite measured quantities would, in general, imply divergent bare quantities.
To make contact with reality, then, the formulae would have to be rewritten in terms of measurable, renormalized quantities. The charge of the electron, say, would be defined in terms of a quantity measured at a specific kinematic renormalization point or subtraction point (which will generally have a characteristic energy, called the renormalization scale or simply the energy scale). The parts of the Lagrangian left over, involving the remaining portions of the bare quantities, could then be reinterpreted as counterterms, involved in divergent diagrams exactly canceling out the troublesome divergences for other diagrams.
Renormalization in QED
For example, in the Lagrangian of QED
the fields and coupling constant are really bare quantities, hence the subscript above. Conventionally the bare quantities are written so that the corresponding Lagrangian terms are multiples of the renormalized ones:
Gauge invariance, via a Ward–Takahashi identity, turns out to imply that we can renormalize the two terms of the covariant derivative piece
together (Pokorski 1987, p. 115), which is what happened to ; it is the same as .
A term in this Lagrangian, for example, the electron–photon interaction pictured in Figure 1, can then be written
The physical constant , the electron's charge, can then be defined in terms of some specific experiment: we set the renormalization scale equal to the energy characteristic of this experiment, and the first term gives the interaction we see in the laboratory (up to small, finite corrections from loop diagrams, providing such exotica as the high-order corrections to the magnetic moment). The rest is the counterterm. If the theory is renormalizable (see below for more on this), as it is in QED, the divergent parts of loop diagrams can all be decomposed into pieces with three or fewer legs, with an algebraic form that can be canceled out by the second term (or by the similar counterterms that come from and ).
The diagram with the counterterm's interaction vertex placed as in Figure 3 cancels out the divergence from the loop in Figure 2.
Historically, the splitting of the "bare terms" into the original terms and counterterms came before the renormalization group insight due to Kenneth Wilson. According to such renormalization group insights, detailed in the next section, this splitting is unnatural and actually unphysical, as all scales of the problem enter in continuous systematic ways.
Running couplings
To minimize the contribution of loop diagrams to a given calculation (and therefore make it easier to extract results), one chooses a renormalization point close to the energies and momenta exchanged in the interaction. However, the renormalization point is not itself a physical quantity: the physical predictions of the theory, calculated to all orders, should in principle be independent of the choice of renormalization point, as long as it is within the domain of application of the theory. Changes in renormalization scale will simply affect how much of a result comes from Feynman diagrams without loops, and how much comes from the remaining finite parts of loop diagrams. One can exploit this fact to calculate the effective variation of physical constants with changes in scale. This variation is encoded by beta-functions, and the general theory of this kind of scale-dependence is known as the renormalization group.
Colloquially, particle physicists often speak of certain physical "constants" as varying with the energy of interaction, though in fact, it is the renormalization scale that is the independent quantity. This running does, however, provide a convenient means of describing changes in the behavior of a field theory under changes in the energies involved in an interaction. For example, since the coupling in quantum chromodynamics becomes small at large energy scales, the theory behaves more like a free theory as the energy exchanged in an interaction becomes large – a phenomenon known as asymptotic freedom. Choosing an increasing energy scale and using the renormalization group makes this clear from simple Feynman diagrams; were this not done, the prediction would be the same, but would arise from complicated high-order cancellations.
For example,
is ill-defined.
To eliminate the divergence, simply change lower limit of integral into and :
Making sure , then
Regularization
Since the quantity is ill-defined, in order to make this notion of canceling divergences precise, the divergences first have to be tamed mathematically using the theory of limits, in a process known as regularization (Weinberg, 1995).
An essentially arbitrary modification to the loop integrands, or regulator, can make them drop off faster at high energies and momenta, in such a manner that the integrals converge. A regulator has a characteristic energy scale known as the cutoff; taking this cutoff to infinity (or, equivalently, the corresponding length/time scale to zero) recovers the original integrals.
With the regulator in place, and a finite value for the cutoff, divergent terms in the integrals then turn into finite but cutoff-dependent terms. After canceling out these terms with the contributions from cutoff-dependent counterterms, the cutoff is taken to infinity and finite physical results recovered. If physics on scales we can measure is independent of what happens at the very shortest distance and time scales, then it should be possible to get cutoff-independent results for calculations.
Many different types of regulator are used in quantum field theory calculations, each with its advantages and disadvantages. One of the most popular in modern use is dimensional regularization, invented by Gerardus 't Hooft and Martinus J. G. Veltman, which tames the integrals by carrying them into a space with a fictitious fractional number of dimensions. Another is Pauli–Villars regularization, which adds fictitious particles to the theory with very large masses, such that loop integrands involving the massive particles cancel out the existing loops at large momenta.
Yet another regularization scheme is the lattice regularization, introduced by Kenneth Wilson, which pretends that hyper-cubical lattice constructs our spacetime with fixed grid size. This size is a natural cutoff for the maximal momentum that a particle could possess when propagating on the lattice. And after doing a calculation on several lattices with different grid size, the physical result is extrapolated to grid size 0, or our natural universe. This presupposes the existence of a scaling limit.
A rigorous mathematical approach to renormalization theory is the so-called causal perturbation theory, where ultraviolet divergences are avoided from the start in calculations by performing well-defined mathematical operations only within the framework of distribution theory. In this approach, divergences are replaced by ambiguity: corresponding to a divergent diagram is a term which now has a finite, but undetermined, coefficient. Other principles, such as gauge symmetry, must then be used to reduce or eliminate the ambiguity.
Zeta function regularization
Julian Schwinger discovered a relationship between zeta function regularization and renormalization, using the asymptotic relation:
as the regulator . Based on this, he considered using the values of to get finite results. Although he reached inconsistent results, an improved formula studied by Hartle, J. Garcia, and based on the works by E. Elizalde includes the technique of the zeta regularization algorithm
where the Bs are the Bernoulli numbers and
So every can be written as a linear combination of .
Or simply using Abel–Plana formula we have for every divergent integral:
valid when . Here the zeta function is Hurwitz zeta function and Beta is a positive real number.
The "geometric" analogy is given by, (if we use rectangle method) to evaluate the integral so:
Using Hurwitz zeta regularization plus the rectangle method with step h (not to be confused with the Planck constant).
The logarithmic divergent integral has the regularization
since for the Harmonic series in the limit we must recover the series
For multi-loop integrals that will depend on several variables we can make a change of variables to polar coordinates and then replace the integral over the angles by a sum so we have only a divergent integral, that will depend on the modulus and then we can apply the zeta regularization algorithm, the main idea for multi-loop integrals is to replace the factor after a change to hyperspherical coordinates so the UV overlapping divergences are encoded in variable . In order to regularize these integrals one needs a regulator, for the case of multi-loop integrals, these regulator can be taken as
so the multi-loop integral will converge for big enough using the Zeta regularization we can analytic continue the variable to the physical limit where and then regularize any UV integral, by replacing a divergent integral by a linear combination of divergent series, which can be regularized in terms of the negative values of the Riemann zeta function .
Attitudes and interpretation
The early formulators of QED and other quantum field theories were, as a rule, dissatisfied with this state of affairs. It seemed illegitimate to do something tantamount to subtracting infinities from infinities to get finite answers.
Freeman Dyson argued that these infinities are of a basic nature and cannot be eliminated by any formal mathematical procedures, such as the renormalization method.
Dirac's criticism was the most persistent. As late as 1975, he was saying:
Most physicists are very satisfied with the situation. They say: 'Quantum electrodynamics is a good theory and we do not have to worry about it any more.' I must say that I am very dissatisfied with the situation because this so-called 'good theory' does involve neglecting infinities which appear in its equations, ignoring them in an arbitrary way. This is just not sensible mathematics. Sensible mathematics involves disregarding a quantity when it is small – not neglecting it just because it is infinitely great and you do not want it!
Another important critic was Feynman. Despite his crucial role in the development of quantum electrodynamics, he wrote the following in 1985:
The shell game that we play is technically called 'renormalization'. But no matter how clever the word, it is still what I would call a dippy process! Having to resort to such hocus-pocus has prevented us from proving that the theory of quantum electrodynamics is mathematically self-consistent. It's surprising that the theory still hasn't been proved self-consistent one way or the other by now; I suspect that renormalization is not mathematically legitimate.
Feynman was concerned that all field theories known in the 1960s had the property that the interactions become infinitely strong at short enough distance scales. This property called a Landau pole, made it plausible that quantum field theories were all inconsistent. In 1974, Gross, Politzer and Wilczek showed that another quantum field theory, quantum chromodynamics, does not have a Landau pole. Feynman, along with most others, accepted that QCD was a fully consistent theory.
The general unease was almost universal in texts up to the 1970s and 1980s. Beginning in the 1970s, however, inspired by work on the renormalization group and effective field theory, and despite the fact that Dirac and various others—all of whom belonged to the older generation—never withdrew their criticisms, attitudes began to change, especially among younger theorists. Kenneth G. Wilson and others demonstrated that the renormalization group is useful in statistical field theory applied to condensed matter physics, where it provides important insights into the behavior of phase transitions. In condensed matter physics, a physical short-distance regulator exists: matter ceases to be continuous on the scale of atoms. Short-distance divergences in condensed matter physics do not present a philosophical problem since the field theory is only an effective, smoothed-out representation of the behavior of matter anyway; there are no infinities since the cutoff is always finite, and it makes perfect sense that the bare quantities are cutoff-dependent.
If QFT holds all the way down past the Planck length (where it might yield to string theory, causal set theory or something different), then there may be no real problem with short-distance divergences in particle physics either; all field theories could simply be effective field theories. In a sense, this approach echoes the older attitude that the divergences in QFT speak of human ignorance about the workings of nature, but also acknowledges that this ignorance can be quantified and that the resulting effective theories remain useful.
Be that as it may, Salam's remark in 1972 seems still relevant
Field-theoretic infinities – first encountered in Lorentz's computation of electron self-mass – have persisted in classical electrodynamics for seventy and in quantum electrodynamics for some thirty-five years. These long years of frustration have left in the subject a curious affection for the infinities and a passionate belief that they are an inevitable part of nature; so much so that even the suggestion of a hope that they may, after all, be circumvented — and finite values for the renormalization constants computed – is considered irrational. Compare Russell's postscript to the third volume of his autobiography The Final Years, 1944–1969 (George Allen and Unwin, Ltd., London 1969), p. 221:
In the modern world, if communities are unhappy, it is often because they have ignorances, habits, beliefs, and passions, which are dearer to them than happiness or even life. I find many men in our dangerous age who seem to be in love with misery and death, and who grow angry when hopes are suggested to them. They think hope is irrational and that, in sitting down to lazy despair, they are merely facing facts.
In QFT, the value of a physical constant, in general, depends on the scale that one chooses as the renormalization point, and it becomes very interesting to examine the renormalization group running of physical constants under changes in the energy scale. The coupling constants in the Standard Model of particle physics vary in different ways with increasing energy scale: the coupling of quantum chromodynamics and the weak isospin coupling of the electroweak force tend to decrease, and the weak hypercharge coupling of the electroweak force tends to increase. At the colossal energy scale of 1015 GeV (far beyond the reach of our current particle accelerators), they all become approximately the same size (Grotz and Klapdor 1990, p. 254), a major motivation for speculations about grand unified theory. Instead of being only a worrisome problem, renormalization has become an important theoretical tool for studying the behavior of field theories in different regimes.
If a theory featuring renormalization (e.g. QED) can only be sensibly interpreted as an effective field theory, i.e. as an approximation reflecting human ignorance about the workings of nature, then the problem remains of discovering a more accurate theory that does not have these renormalization problems. As Lewis Ryder has put it, "In the Quantum Theory, these [classical] divergences do not disappear; on the contrary, they appear to get worse. And despite the comparative success of renormalisation theory, the feeling remains that there ought to be a more satisfactory way of doing things."
Renormalizability
From this philosophical reassessment, a new concept follows naturally: the notion of renormalizability. Not all theories lend themselves to renormalization in the manner described above, with a finite supply of counterterms and all quantities becoming cutoff-independent at the end of the calculation. If the Lagrangian contains combinations of field operators of high enough dimension in energy units, the counterterms required to cancel all divergences proliferate to infinite number, and, at first glance, the theory would seem to gain an infinite number of free parameters and therefore lose all predictive power, becoming scientifically worthless. Such theories are called nonrenormalizable.
The Standard Model of particle physics contains only renormalizable operators, but the interactions of general relativity become nonrenormalizable operators if one attempts to construct a field theory of quantum gravity in the most straightforward manner (treating the metric in the Einstein–Hilbert Lagrangian as a perturbation about the Minkowski metric), suggesting that perturbation theory is not satisfactory in application to quantum gravity.
However, in an effective field theory, "renormalizability" is, strictly speaking, a misnomer. In nonrenormalizable effective field theory, terms in the Lagrangian do multiply to infinity, but have coefficients suppressed by ever-more-extreme inverse powers of the energy cutoff. If the cutoff is a real, physical quantity—that is, if the theory is only an effective description of physics up to some maximum energy or minimum distance scale—then these additional terms could represent real physical interactions. Assuming that the dimensionless constants in the theory do not get too large, one can group calculations by inverse powers of the cutoff, and extract approximate predictions to finite order in the cutoff that still have a finite number of free parameters. It can even be useful to renormalize these "nonrenormalizable" interactions.
Nonrenormalizable interactions in effective field theories rapidly become weaker as the energy scale becomes much smaller than the cutoff. The classic example is the Fermi theory of the weak nuclear force, a nonrenormalizable effective theory whose cutoff is comparable to the mass of the W particle. This fact may also provide a possible explanation for why almost all of the particle interactions we see are describable by renormalizable theories. It may be that any others that may exist at the GUT or Planck scale simply become too weak to detect in the realm we can observe, with one exception: gravity, whose exceedingly weak interaction is magnified by the presence of the enormous masses of stars and planets.
Renormalization schemes
In actual calculations, the counterterms introduced to cancel the divergences in Feynman diagram calculations beyond tree level must be fixed using a set of renormalisation conditions. The common renormalization schemes in use include:
Minimal subtraction (MS) scheme and the related modified minimal subtraction (MS-bar) scheme
On-shell scheme
Besides, there exists a "natural" definition of the renormalized coupling (combined with the photon propagator) as a propagator of dual free bosons, which does not explicitly require introducing the counterterms.
Renormalization in statistical physics
History
A deeper understanding of the physical meaning and generalization of the
renormalization process, which goes beyond the dilatation group of conventional renormalizable theories, came from condensed matter physics. Leo P. Kadanoff's paper in 1966 proposed the "block-spin" renormalization group. The blocking idea is a way to define the components of the theory at large distances as aggregates of components at shorter distances.
This approach covered the conceptual point and was given full computational substance in the extensive important contributions of Kenneth Wilson. The power of Wilson's ideas was demonstrated by a constructive iterative renormalization solution of a long-standing problem, the Kondo problem, in 1974, as well as the preceding seminal developments of his new method in the theory of second-order phase transitions and critical phenomena in 1971. He was awarded the Nobel prize for these decisive contributions in 1982.
Principles
In more technical terms, let us assume that we have a theory described
by a certain function of the state variables
and a certain set of coupling constants
. This function may be a partition function,
an action, a Hamiltonian, etc. It must contain the
whole description of the physics of the system.
Now we consider a certain blocking transformation of the state
variables ,
the number of must be lower than the number of
. Now let us try to rewrite the
function only in terms of the . If this is achievable by a
certain change in the parameters, , then the theory is said to berenormalizable.
The possible
macroscopic states of the system, at a large scale, are given by this
set of fixed points.
Renormalization group fixed points
The most important information in the RG flow is its fixed points'''. A fixed point is defined by the vanishing of the beta function associated to the flow. Then, fixed points of the renormalization group are by definition scale invariant. In many cases of physical interest scale invariance enlarges to conformal invariance. One then has a conformal field theory at the fixed point.
The ability of several theories to flow to the same fixed point leads to universality.
If these fixed points correspond to free field theory, the theory is said to exhibit quantum triviality. Numerous fixed points appear in the study of lattice Higgs theories, but the nature of the quantum field theories associated with these remains an open question.
See also
History of quantum field theory
Quantum triviality
Zeno's paradoxes
References
Further reading
General introduction
DeDeo, Simon; Introduction to Renormalization (2017). Santa Fe Institute Complexity Explorer MOOC. Renormalization from a complex systems point of view, including Markov Chains, Cellular Automata, the real space Ising model, the Krohn-Rhodes Theorem, QED, and rate distortion theory.
Baez, John; Renormalization Made Easy, (2005). A qualitative introduction to the subject.
Blechman, Andrew E.; Renormalization: Our Greatly Misunderstood Friend, (2002). Summary of a lecture; has more information about specific regularization and divergence-subtraction schemes.
Shirkov, Dmitry; Fifty Years of the Renormalization Group, C.E.R.N. Courrier 41(7) (2001). Full text available at : I.O.P Magazines.
E. Elizalde; Zeta regularization techniques with Applications.
Mainly: quantum field theory
N. N. Bogoliubov, D. V. Shirkov (1959): The Theory of Quantized Fields. New York, Interscience. The first text-book on the renormalization group theory.
Ryder, Lewis H.; Quantum Field Theory (Cambridge University Press, 1985), Highly readable textbook, certainly the best introduction to relativistic Q.F.T. for particle physics.
Zee, Anthony; Quantum Field Theory in a Nutshell, Princeton University Press (2003) . Another excellent textbook on Q.F.T.
Weinberg, Steven; The Quantum Theory of Fields (3 volumes) Cambridge University Press (1995). A monumental treatise on Q.F.T. written by a leading expert, Nobel laureate 1979.
Pokorski, Stefan; Gauge Field Theories, Cambridge University Press (1987) .
't Hooft, Gerard; The Glorious Days of Physics – Renormalization of Gauge theories, lecture given at Erice (August/September 1998) by the Nobel laureate 1999 . Full text available at: hep-th/9812203.
Rivasseau, Vincent; An introduction to renormalization, Poincaré Seminar (Paris, Oct. 12, 2002), published in : Duplantier, Bertrand; Rivasseau, Vincent (Eds.); Poincaré Seminar 2002, Progress in Mathematical Physics 30, Birkhäuser (2003) . Full text available in PostScript.
Rivasseau, Vincent; From perturbative to constructive renormalization, Princeton University Press (1991) . Full text available in PostScript and in PDF (draft version).
Iagolnitzer, Daniel & Magnen, J.; Renormalization group analysis, Encyclopaedia of Mathematics, Kluwer Academic Publisher (1996). Full text available in PostScript and pdf here.
Scharf, Günter; Finite quantum electrodynamics: The causal approach, Springer Verlag Berlin Heidelberg New York (1995) .
A. S. Švarc (Albert Schwarz), Математические основы квантовой теории поля, (Mathematical aspects of quantum field theory), Atomizdat, Moscow, 1975. 368 pp.
Mainly: statistical physics
A. N. Vasil'ev; The Field Theoretic Renormalization Group in Critical Behavior Theory and Stochastic Dynamics (Routledge Chapman & Hall 2004);
Nigel Goldenfeld; Lectures on Phase Transitions and the Renormalization Group, Frontiers in Physics 85, Westview Press (June, 1992) . Covering the elementary aspects of the physics of phases transitions and the renormalization group, this popular book emphasizes understanding and clarity rather than technical manipulations.
Zinn-Justin, Jean; Quantum Field Theory and Critical Phenomena, Oxford University Press (4th edition – 2002) . A masterpiece on applications of renormalization methods to the calculation of critical exponents in statistical mechanics, following Wilson's ideas (Kenneth Wilson was Nobel laureate 1982).
Zinn-Justin, Jean; Phase Transitions & Renormalization Group: from Theory to Numbers, Poincaré Seminar (Paris, Oct. 12, 2002), published in : Duplantier, Bertrand; Rivasseau, Vincent (Eds.); Poincaré Seminar 2002, Progress in Mathematical Physics 30, Birkhäuser (2003) . Full text available in PostScript .
Domb, Cyril; The Critical Point: A Historical Introduction to the Modern Theory of Critical Phenomena, CRC Press (March, 1996) .
Brown, Laurie M. (Ed.); Renormalization: From Lorentz to Landau (and Beyond), Springer-Verlag (New York-1993) .
Cardy, John; Scaling and Renormalization in Statistical Physics, Cambridge University Press (1996) .
Miscellaneous
Shirkov, Dmitry; The Bogoliubov Renormalization Group, JINR Communication E2-96-15 (1996). Full text available at: hep-th/9602024
Zinn-Justin, Jean; Renormalization and renormalization group: From the discovery of UV divergences to the concept of effective field theories, in: de Witt-Morette C., Zuber J.-B. (eds), Proceedings of the NATO ASI on Quantum Field Theory: Perspective and Prospective, June 15–26, 1998, Les Houches, France, Kluwer Academic Publishers, NATO ASI Series C 530, 375–388 (1999). Full text available in PostScript.
Connes, Alain; Symétries Galoisiennes & Renormalisation, Poincaré Seminar (Paris, Oct. 12, 2002), published in : Duplantier, Bertrand; Rivasseau, Vincent (Eds.); Poincaré Seminar 2002'', Progress in Mathematical Physics 30, Birkhäuser (2003) . French mathematician Alain Connes (Fields medallist 1982) describe the mathematical underlying structure (the Hopf algebra) of renormalization, and its link to the Riemann-Hilbert problem. Full text (in French) available at .
External links
Quantum field theory
Renormalization group
Mathematical physics |
Stockleigh may refer to the following places:
Stockleigh, Queensland, Australia
Stockleigh English, Devon, England
Stockleigh Pomeroy, Devon, England
See also
Stockley (disambiguation) |
Parkallen is a residential neighbourhood in south Edmonton, Alberta, Canada located just to the east of the University of Alberta farm and the Neil Crawford Centre. Most of the neighbourhood development occurred after the end of World War II with eight out of ten residences constructed by 1960 according to the 2005 municipal census.
The community is represented by the Parkallen Community League, established in 1920, which maintains a community hall and outdoor rink located at 111 Street and 65 Avenue.
Demographics
In the City of Edmonton's 2016 municipal census, Parkallen had a population of living in dwellings, a 3.0% increase from its 2014 population of . With a land area of , it had a population density of people/km2 in 2016.
Residential development
Most of the residences in the neighbourhood are single-family dwellings (81%). A further 15% are apartments in low rise buildings with fewer than five stories. There are also a few duplexes (3%) and row houses (1%). Approximately two out of three residences are owner occupied, with the remainder being rented. The average household size is 2.2 people, with close to eight out of every ten households having only one or two persons.
The population of Parkallen is comparatively mobile with just under half (49.2%) of the population having lived at the same address for more than five years according to the 2005 municipal census. Just under one in five residents (17.6%) have been at the same address for under a year, and another one in five (22.1.9%) have been at the same address for one to three years.
The neighbourhood is bounded on the north by 72 Avenue, to the west by 113 Street, to the south by 61 Avenue, and on the east by 109 Street.
Residents have good access to the University of Alberta main campus by travelling north along 113 Street. Travel north along 109 Street takes residents into the Old Strathcona area, and beyond into the downtown core. A short distance south of the neighbourhood is Southgate Centre. There is one school in the neighbourhood, Parkallen School. Also located in the neighbourhood is Violet Archer Park.
Commencing in 2008, residents were connected to the LRT system when the South Campus/Fort Edmonton Park station opened just west of the Neil Crawford Centre. In June 2009, the neighbourhood partook in an "eco-mobility" challenge to determine how well individuals could function without the automobile. Many residents succeeded in changing their travel modes as a result of the challenge.
Surrounding neighbourhoods
Northwest = Belgravia
North = McKernan
Northeast = Queen Alexandra
West = University of Alberta farm
East = Allendale
Southwest = University of Alberta South Campus
South = Lendrum Place
Southeast = Pleasantview
See also
Edmonton Federation of Community Leagues
References
External links
Parkallen Neighbourhood Profile
www.parkallen.ca
Neighbourhoods in Edmonton |
Streptomyces sporoverrucosus is a bacterium species from the genus of Streptomyces. Streptomyces sporoverrucosus produces the antileukemic naphthocoumarins chrysomycin A, chrysomycin B, and chrysomycin C.
See also
List of Streptomyces species
References
Further reading
External links
Type strain of Streptomyces sporoverrucosus at BacDive - the Bacterial Diversity Metadatabase
sporoverrucosus
Bacteria described in 1986 |
The Mid-Suburban League (MSL) is an Illinois High School Association recognized high school extra-curricular league which includes 12 schools located in the northwest suburbs of Chicago, Illinois. The conference is split up into two divisions for all interscholastic activities. The primary criteria for the separate divisions is geography, with the schools in the West Division being located west of IL Route 53 and the schools of the East Division being east of it. However, the schools of the western division are also larger than the schools of the eastern division.
Members
West Division
East Division
History
The Mid-Suburban League came into existence for the 1963–64 school year. The MSL and Des Plaines Valley League both broke off from an interim suburban league that dated back several decades. The original members of the MSL were Deerfield High School, Forest View High School, Glenbrook North High School, Glenbrook South High School, Maine West High School, and Prospect High School. Not even a year old, the conference announced expansion for the 1965–66 season with, Palatine High School, Wheeling High School, Niles North High School, and New Trier West High School joining as the schools opened. The MSL then announced a realignment for the 1965–66 season when Niles West High School and James B. Conant High School were added, with Deerfield, Glenbrook North, Glenbrook South, Niles West, Niles North, and New Trier West comprising one division, and Forest View, Prospect, Wheeling, Maine West, and James Conant comprising the other.
Just prior to the start of the 1964–65 season, it was announced that Arlington High School would join the league for the 1966–67 season, leaving the West Suburban Conference, and joining the division which included Forest View High School and soon to open school Elk Grove High School and 5 year old high school Fremd. Maine West left the league in 1967 and moved to the Central Suburban. Glenbard North joined the league in 1968, and Hersey in 1969, closing out the final changes in the conference of the 1960's.
The conference would change again in the early 1970's as Schaumburg was added in 1970, Rolling Meadows in 1971, Buffalo Grove in 1974 and Hoffman Estates in 1975. At the conclusion of the 1973 school year, Glenbard North would leave for the DuPage Valley Conference, however, in 1977, Barrington would come over from the North Suburban Conference. Unfortunately, in 1984, based on declining enrollment and high maintenance costs, Arlington High School would close with Forest View seeing the same fate 2 years later.
Membership timeline
References
External links
Mid-Suburban League homepage
High school sports conferences and leagues in the United States
Illinois high school sports conferences
High school sports in Illinois |
```c++
//your_sha256_hash--------------
// CLING - the C++ LLVM-based InterpreterG :)
// author: Vassil Vassilev <vvasilev@cern.ch>
//
// This file is dual-licensed: you can choose to license it under the University
// LICENSE.TXT for details.
//your_sha256_hash--------------
#include "clang/Frontend/FrontendPluginRegistry.h"
#include "clang/Lex/Preprocessor.h"
struct PluginConsumer : public clang::ASTConsumer {
bool HandleTopLevelDecl(clang::DeclGroupRef /*DGR*/) override {
llvm::outs() << "PluginConsumer::HandleTopLevelDecl\n";
return true; // Happiness
}
};
template<typename ConsumerType>
class Action : public clang::PluginASTAction {
protected:
std::unique_ptr<clang::ASTConsumer>
CreateASTConsumer(clang::CompilerInstance&,
llvm::StringRef /*InFile*/) override {
llvm::outs() << "Action::CreateASTConsumer\n";
return std::unique_ptr<clang::ASTConsumer>(new ConsumerType());
}
bool ParseArgs(const clang::CompilerInstance &,
const std::vector<std::string>&) override {
llvm::outs() << "Action::ParseArgs\n";
// return false; // Tells clang not to create the plugin.
return true; // Happiness
}
PluginASTAction::ActionType getActionType() override {
return AddBeforeMainAction;
}
};
// Define a pragma handler for #pragma demoplugin
class DemoPluginPragmaHandler : public clang::PragmaHandler {
public:
DemoPluginPragmaHandler() : clang::PragmaHandler("demoplugin") { }
void HandlePragma(clang::Preprocessor &/*PP*/,
clang::PragmaIntroducer /*Introducer*/,
clang::Token &/*PragmaTok*/) override {
llvm::outs() << "DemoPluginPragmaHandler::HandlePragma\n";
// Handle the pragma
}
};
// Register the PluginASTAction in the registry.
static clang::FrontendPluginRegistry::Add<Action<PluginConsumer> >
X("DemoPlugin", "Used to test plugin mechanisms in cling.");
// Register the DemoPluginPragmaHandler in the registry.
static clang::PragmaHandlerRegistry::Add<DemoPluginPragmaHandler>
Y("demoplugin","Used to test plugin-attached pragrams in cling.");
``` |
```css
Position elements with `position: sticky`
Difference between `display: none` and `visibility: hidden`
Controlling cellpadding and cellspacing in CSS
Vertically-center anything
Equal width table cells
``` |
Brachodes rhagensis is a moth of the family Brachodidae. It is found in Iran.
The wingspan is about 29 mm for males and 24 mm for females.
References
Moths described in 1870
Brachodidae
Moths of the Middle East |
Tomáš Mica (born 25 May 1983 in Brno) is a Czech association footballer.
References
External links
1983 births
Living people
Czech men's footballers
Czech Republic men's youth international footballers
Czech expatriate men's footballers
Expatriate men's footballers in Switzerland
Expatriate men's footballers in Italy
Expatriate men's footballers in Bulgaria
Czech First League players
1. FC Slovácko players
PFC Neftochimic Burgas (2009–2014) players
FC Wil players
FC La Chaux-de-Fonds players
First Professional Football League (Bulgaria) players
Men's association football forwards
Footballers from Brno
Czech expatriate sportspeople in Bulgaria |
Renato Mambor (4 December 1936 – 6 December 2014) was an Italian painter, writer, photographer and actor.
Born in Rome, Mambor was a member of the 1960s artistic movement known as the Scuola di Piazza del Popolo together with Mario Schifano, Pino Pascali and Jannis Kounellis, among others. He is considered the founder of the "Conceptual Neo-Figuration" movement (Italian: Neofigurazione Concettuale). His artistic interests included photography, performance art and installation art. He was also active in cinema as a writer, a poster designer and character actor.
References
External links
1936 births
2014 deaths
Painters from Rome
Male actors from Rome
20th-century Italian painters
Italian male painters
21st-century Italian painters
Italian male film actors
20th-century Italian male actors
Photographers from Rome
Italian contemporary artists
20th-century Italian male artists
21st-century Italian male artists |
Bob Owens (born c. 1946) is an American football coach. He is the head football coach at Chapman University in Orange, California, a position he has held since 2006. Owens served as head football coach at Whittier College in Whittier, California from 1996 to 2002. He was an assistant coach for the Sacramento Surge of the World League of American Football (WLAF) in 1992 when the team won World Bowl '92.
Head coaching record
References
External links
Chapman profile
1946 births
Living people
Chapman Panthers football coaches
Chico State Wildcats football coaches
Fresno State Bulldogs football coaches
Humboldt State Lumberjacks football coaches
Nevada Wolf Pack football coaches
Oregon Ducks football coaches
Utah State Aggies football coaches
Sacramento Surge coaches
Whittier Poets football coaches
California State University, Chico faculty
University of Oregon faculty
Whittier College faculty
University of La Verne alumni
University of Oregon alumni
African-American coaches of American football
20th-century African-American sportspeople
21st-century African-American sportspeople |
Ernest Leroy Wilkinson (May 4, 1899 – April 6, 1978) was an American academic administrator, lawyer, and prominent figure in the Church of Jesus Christ of Latter-day Saints (LDS Church). He was president of Brigham Young University (BYU) from 1951 to 1971, simultaneously overseeing the entire LDS Church Educational System (CES). He is credited with the expansion of BYU. Under his presidency, the student body increased six times to over twenty-five thousand students due to the physical growth of the university and his aggressive recruiting policies. The number of colleges at the university increased from five to thirteen and the number of faculty members increased four-fold. Wilkinson focused on recruiting more faculty and convincing current faculty to receive education outside the university. As a result, the number of teachers with doctorate degrees increased from 50 to 500. Associate and doctoral programs were created for BYU.
The J. Reuben Clark Library (now the Harold B. Lee Library (HBLL)) was built, and library resources were expanded by 500 percent. The number of buildings on BYU campus increased from 6 to over 300, representing an increase in floor space of about 4.2 million square feet. He initiated the construction of various student housing options to accommodate over 6,000 students. Additionally, he increased the number of student religious congregations. During his twenty-year presidency, the number of congregations increased from 1 student branch to 98 wards and 10 stakes for LDS students. Under Wilkinson's presidency, the BYU Honor Code was more clearly established and was designed to include a strict dress code.
Wilkinson was a strongly conservative Republican. He unsuccessfully ran for the U.S. Senate in 1964, while he was president of BYU. Prior to his career in education, Wilkinson was a lawyer in Washington, D.C. and New York City, his most well-known and lucrative case being a $32 million settlement from the U.S. government for the Ute Indian Tribes.
Background and education
Ernest Leroy Wilkinson was born in Ogden, Utah, on May 4, 1899. He was one of seven children of Robert Brown Wilkinson and Annie Cecilia Anderson. Robert Wilkinson was a Scottish immigrant who arrived in the United States as a young boy and later married Annie Anderson. Robert Wilkinson worked for the Southern Pacific Railroad for 25 years. Robert Wilkinson supported the union and according to family, at one time ran for mayor of Ogden as a Socialist candidate. During Ernest Wilkinson's childhood, he associated mostly with older boys and men, as there were few boys his age. He became involved in cock fighting, buying a few cocks with the money he made from delivering Desert News, but stopped after police started persecuting offenders.
In order to cultivate his faith as a member of the LDS Church, his mother suggested he attend Weber Academy in Ogden, which was then owned by the church. Before his graduation, he won the Dr. Edward S. Rich oratorical contest with his speech entitled, "American Ideals". He graduated from Weber Academy in 1917. He continued his studies at the expanded Weber Academy, then known as Weber College. During his time at Weber, he organized the Public Service Bureau (a service organization), was editor of the yearbook, and was president of the student body for two years. He competed in forensics meets and won the state championship with his team. He received the Lewis Efficacy Medal for students excelling in scholarship and public service and was valedictorian of his class. After a year at Weber College, Wilkinson became a member of the Student Army Training Corps unit located at BYU. Wilkinson attributed his success to what he learned at Weber Academy and became interested in the idea of offering a religiously affiliated education to more LDS youth. After the war, he became a regular student at BYU and among other things served as the editor of the weekly newspaper White and Blue and was president of his senior class. Wilkinson and a few colleagues received special recognition when they beat the Princeton debate team. He earned a Bachelor of Arts degree at BYU in 1921.
He married Alice Valera Ludlow, a native of Spanish Fork, whom he had met while they were both students at BYU. They were married in the Salt Lake Temple on August 16, 1923. The ceremony was performed by James E. Talmage. Alice was elected vice president of the student body with Wilkinson as her campaign manager and had studied drama at BYU. The Wilkinsons had five children.
Career
After graduation, Wilkinson began teaching English and speech at Weber College. During this time, Wilkinson began to take an active interest in politics. He ran as a Democrat for county auditor and lost.
Law School
In 1923, Wilkinson was involved with the campaign of William H. King for United States Senate. King invited Wilkinson to be his secretary (administrative assistant) in Washington D.C. He agreed so that he could take evening classes at George Washington University. When he arrived in Washington D.C., he was informed by King's current secretary that he was to arrange for another position for him. He was offered the position of assistant architect of the Capitol Building. Uninterested in architecture, Wilkinson found a job as a teacher of a business high school teaching shorthand and typing, still able to attend law school at night. He earned a law degree from George Washington University summa cum laude in 1926. He was admitted to the Washington D.C., Utah, and New York bar associations. He studied at Harvard Law School on scholarship for his graduate studies. Even though five years of teaching were prerequisite for entering in the doctoral program, he was granted exception from Dean Roscoe Pound of the law school due to his academics at George Washington University. In 1927, Wilkinson graduated from Harvard Law School with a Doctor of Juridical Science.
Teaching law
He initially accepted a position teaching law at the University of California, but quickly resigned in order to pursue another offer to teach at the more prestigious New Jersey Law School, the largest law school in the United States at the time, where he taught from 1927 to 1933. After aiding Hughes, Schurman, and Dwight law firm with a challenging tax problem, he was invited to join their law firm in New York City. He began practicing there as well as teaching at New Jersey Law School, where he was known as a notoriously difficult professor.
Practicing law
After working for future Supreme Court chief justice Charles Evans Hughes, and working with Moyle & Wilkinson in Washington D.C., Wilkinson opened up a private firm in 1940 where he practiced for 11 years. One case involved a young, American soldier in Japan who was sentenced to death for accidentally killing a child in a motorcycle accident. He succeeded in lowering the sentence to only the time in jail that the man had already served. Even though he received no compensation for the case, he considered it the most gratifying case he ever worked on. He served as attorney for the Ute Indian Tribes in their suit to be compensated for land never paid for by the U.S. government as part of the Treaty of 1880. In 1950, this suit was upheld by the United States Court of Claims and as a result, the Ute tribes were awarded $32 million. Due to Wilkinson's work, the Indian Claims Commission was signed in 1946 by Harry S. Truman. This opened up more claims to be filed and prosecuted by Wilkinson, making his firm the most active in the country for tribal cases. Wilkinson's share of the Ute Indian settlement as the plaintiff's attorney made him independently wealthy and allowed him to give up his law practice to pursue his interests in education. When he became the 7th president of BYU, Wilkinson created a new law firm: Wilkinson, Cragun, and Barker. He was the senior partner, but management was left to his brother, Glen Wilkinson, Cragun, and Barker.
Political
Wilkinson was heavily interested in politics. Influenced by his socialist father from a young age, his viewpoints shifted to conservatism in his adult years. During the Cold War, LDS Church leaders were particularly fearful of the influence of communism in the United States. This was manifest in their choice of strictly conservative Wilkinson as the next BYU president. LDS Church leader Stephen L. Richards hoped in Wilkinson's inauguration that Wilkinson would, "implant in youth a deep love of country and a reverential regard for the Constitution of the United States." Wilkinson made it clear that he supported the Republican party and disliked communism. Some students at BYU criticized his "unabashed partisanship". Despite his interest in politics during the beginning of his presidency at BYU, he did not seriously consider running for the U.S. Senate. Though his law career had taught him how to navigate federal bureaucracy, he did not feel that he had the skills to win a congressional race. In addition, he was more concerned, at the time, in the work he could accomplish in Utah as BYU president rather than in Washington. Several times during the 1950s and 1960s, Wilkinson approached church president David O. McKay for his permission to run for public office. He was advised not to run until 1964 when he was given a one-year leave of absence to run for the senate. In his absence, duties of the president and chancellor were taken up by Earl C. Crockett and Harvey L. Taylor, respectively. In 1964, Wilkinson won the Republican Party nomination for the United States Senate, defeating Sherman P. Lloyd. Wilkinson lost in the general election to incumbent Senator Frank Moss. Within a month after his defeat, Wilkinson returned to BYU, but members of the Board of Trustees maintained that Harvey Taylor remain chancellor. As consolation, Wilkinson was granted a $20,000 salary, the largest salary of any BYU employee at the time.
BYU presidency
The First Era: 1951–1957
Beginnings
After Howard S. McDonald resigned from his position as BYU president, Christian Jensen served as interim president for about ten months. In 1949, at a dinner for Jensen, Wilkinson gave a speech asserting the ways in which he believed BYU could excel. He expressed that he had high aspirations for the school and believed in the values of combining a spiritual and secular education. After the dinner, Wilkinson was invited to share his ideas with the church's First Presidency and the Board of Trustees. The favorite candidate of J. Reuben Clark to fill the vacancy of BYU president was the vocally conservative Wilkinson, who lobbied LDS Church leaders to be appointed as president of BYU and was offered the position in July 1950. Wilkinson refused to be paid a salary, which attracted church officials in the aftermath of tense financial negotiations with previous president, McDonald. In September 1950, Wilkinson changed the members of the board of trustees from local members to the Quorum of the Twelve Apostles with the First Presidency serving as president and vice presidents, respectively, of the board. Wilkinson wanted a direct line of communication to McKay, the church president at the time. Wilkinson would frequently counsel directly with McKay, avoiding the Board of Trustees. From 1951 to the end of 1952, Wilkinson had no official assistants besides William F. Edwards, the dean of the College of Commerce, and William E. Berrett, a professor of religion. At the end of 1952, Harvey L. Taylor became Wilkinson's first administrative assistant. Wilkinson was considered by most of his subordinates difficult to work with, citing him as dictatorial and inconsiderate. At 5'5", his nicknames among colleagues were "Little General" or "Little Napoleon". Aware of his difficulty getting along with his employees, he claimed he "[didn't] have time to be polite".
Unification and CES
In 1953, in an attempt to unify church schools, Wilkinson was named administrator of the church's schools. Besides his duties at BYU, he oversaw the administrative duties of Ricks College (now Brigham Young University-Idaho), LDS Business College, the McCune School of Music, and Juarez Academy in Mexico, along with seventeen institutes and 193 seminaries. Wilkinson proposed that the name CES be changed to University of Deseret, but his proposal was rejected for multiple reasons, one of them being that people were unwilling to drop the name of Brigham Young from their school. After this expansion of CES and thus Wilkinson's duties, he appointed Edwards and Berrett as vice presidents of the LDS Department of Education. In 1953, CES considered reacquiring Weber College, Snow College, and Dixie College in order to expand its influence. A referendum was included on the November 1954 ballot to transfer these three junior colleges from the State of Utah back to CES. The controversial referendum was defeated in the election with less than 40% of voters in favor. Still interested in pursuing junior colleges, CES established the Church College of Hawaii (CCH) (now Brigham Young University-Hawaii) in 1955 in Laie, Hawaii. Shortly thereafter, CCH and other LDS institutions in the Pacific were removed from CES, considered to be closer to "missionary operations", and the presidents of the institution were subject to the local school systems rather than CES.
Enrollment and the establishment of colleges
The next concern for Wilkinson was increasing the enrollment of BYU. He instituted a program in which members of BYU faculty would travel with general authorities to stake conferences. They attended nearly 180 conferences, emphasizing the benefits of a BYU education. Enrollment increased by more than twenty-five percent in fall of 1952. After discontinuing the program in 1952, Wilkinson continued to recruit for BYU by sending representatives to high schools and church missions, which received some criticism from mission presidents and was terminated by the First Presidency shortly after. Despite the criticisms, Wilkinson's tactics were successful, and enrollment increased to over 10,000 by the 1956–57 school year. Colleges were reorganized in order to group similar studies together and allow for the most growth and success of students. For example, the College of Arts and Sciences and the College of Applied Sciences were broken into multiple colleges in 1954 including, but not limited to, the College of Biological and Agricultural Sciences and the College of Humanities and Social Sciences. The Department of Physical Education, Health, and Athletics was separated from the College of Education and established as its own college and the College of Education was forced to relinquish its monopoly on the training of teachers and made to be a college specific to teaching methods. Wilkinson improved the salaries of faculty in order to recruit more talented professors and staff members to BYU. The Army and Air Force ROTC program at BYU was established by Wilkinson in 1951 for the Air Force and 1968 for the Army. An engineering program with its own building was established by Wilkinson with the help of Harvey Fletcher, and in 1956, broke into three programs: civil, mechanical, and electrical. Wilkinson also established a College of Family Living in late 1951, alleged to be the first in the United States, however, Purdue University had opened a Department of Family Life in 1946. In order to increase the size and quality of the graduate program at BYU, Wilkinson instituted a policy that encouraged faculty to pursue graduate studies at other universities. Through the policy, the university could obtain faculty qualified to teach graduate students as well as faculty who have attended other universities and thus obtained a more well-balanced education, preventing the "academic inbreeding" that had been a problem at the institution. The number of professors that held doctorates, especially from other universities, increased significantly.
Building construction
Wilkinson sought to increase the size and the beauty of the BYU campus. The first construction project during his presidency commenced July 1952. The Student Service Center, or unofficially, the bookstore, was dedicated in March 1953. After the planning committee devised a "master plan" for building and expansion of BYU campus, and the LDS Church appropriated $500,000 for the acquisition of more land in pursuit of the building projects proposed in the master plan. Wilkinson received ten million dollars from the board of trustees in order to build student housing and academic buildings. In order to accommodate more students, student housing was expanded. Heritage Halls were apartment-style dormitories that included a kitchen were built for girls, and Helaman Halls, which included a large dining hall, were built for men. With these additions, the number of women's accommodations increased to 2,000 students while the men's accommodations increased to 1,600 students. 150 homes were bought from the Mountain Home Air Force Base in Idaho and transported to Provo. Considered a fairly temporary solution, the complex was named Wyview Village and was intended to accommodate married students. Construction of the Harvey Fletcher Building was completed in 1953 in order to house the new engineering program, though other departments, namely the English department was allowed to share the space due to the lack of buildings. The David O. McKay Building was completed in 1954 for the College of Education. The college shared its walls with some other humanities disciplines until the campus was expanded more in later years. The Benjamin Cluff Jr. Building, along with two greenhouses, was built to house the laboratories for the College of Biological and Agricultural Sciences in 1955. These buildings were torn down for the new Life Science Building completed in 2014. The Howard S. McDonald Student Health Center, which also housed the Air Force ROTC program, was completed in 1955 and contained an x-ray room and a hydrotherapy room. A separate Student Health Center now exists. The Howard S. McDonald Building now contains BYU's MRI Research Facility. The Joseph F. Smith Family Living Center was built in 1957 to house the College of Family Living. Dedicated in 2005 and still home to the College of Family, Home and Social Sciences, the Joseph Fielding Smith Building took the place of the Family Living Center. A number of other smaller, miscellaneous buildings were built in the 1950s, including a ticket office for the football stadium and a poultry laboratory for the Animal Science Department. Significant effort was also put into improving the campus utilities and landscaping. The Department of Physical Plant was established in 1954. Due to the nearly seventy hours of work he was putting in per week, Wilkinson suffered a heart attack in October 1956. He was permitted to return to work in January 1957. Taylor, Edwards, and Berrett took over his responsibilities while he was recovering.
The Second Era: 1957–1971
Building construction
With the continuous growth of the student body, Wilkinson understood the need to continue expanding campus. The first large project was the BYU Motion Picture Studio (now the LDS Motion Picture Studios), built in 1958. In 1961, At a cost of nearly $4,000,000, the J. Reuben Clark Jr. Library (now the HBLL) was built due to lack of library resources and space in the Heber J. Grant Library. The library was built to accommodate 3,000 people and house one million books. The Jesse Knight Building was completed in 1960 to house the College of Commerce. Plans were made in early 1960 for a new student center; student costs were raised by ten dollars each student to raise the funds for the project. The building cost $7 million, and two-thirds of the funds came directly from students. The building was six stories and contained a bookstore, cafeteria, two theaters, lounges, a bowling alley, and a barber shop. A consensus hadn't been reached on the name of the building. Students were interested in naming the building "Memorial Union" to honor BYU students killed in war. Shortly before the dedication, the board of trustees revealed they intended to name the building the Ernest L. Wilkinson Student Center. Although some students believed that they should have had the right to name the building since they paid for most of it, the board of trustees named the building after Wilkinson. During his presidency, church appropriations to the school increased from $1 million to $22 million annually, while university expenditures increased from $2 million to $65 million annually.
The Honor Code
Wilkinson felt that his job was to prevent the decay of moral values of the students and increase administrative control of the BYU Honor Code. He instituted a strict dress code meant to prevent students from dressing like "go-go girls" or "surfers". Women's skirts and dresses were required to be below the knee and they were prohibited from wearing pants. Upon protestation, female students achieved a small victory when they were permitted to wear slacks at the university's bowling alley. Men were required to keep their hair cut short. Wilkinson pushed to increase the social interaction among the students, believing that it would be facilitated if every student was required to wear a name tag. Due to the unpopularity of the plan among students, this was never enforced. Wilkinson attempted to weed out students who were not following the honor code, because he felt that they prevented other worthy students from attending the university. Wilkinson also instituted a rule against male facial hair with the exception of a small, well-trimmed mustache.
The 1966 BYU spy ring controversy
Extremely conservative and anti-communist, Wilkinson was not bashful in expressing his political philosophy to BYU students and faculty. After his unsuccessful run for U.S. Senate in 1964, he "returned to campus with a vengeance". Some of the employees publicly supported his opponent Sherman Lloyd in the primaries, which Wilkinson felt was disloyal. When he returned to BYU, he became aware of a group of "liberal" teachers who were interested in changing the social and political atmosphere at BYU. He invited right-wing speakers to BYU and gave highly political speeches on campus. Wilkinson gave a lengthy May 1965 commencement address in which he attributed the beginning of moral decay of American values to Franklin D. Roosevelt's New Deal as well as criticizing the current president Lyndon B. Johnson's views of social security. Hoping to incite controversy, Wilkinson planned to give another politically charged speech in April 1966. He asked his comptroller, Joseph Bentley, to find students to report on professors' reactions to the speech. Bentley in turn asked student Stephen Hays Russell to report on professors' reactions unofficially. The two made a list of professors to surveil, and Russell recruited ten students to take notes on what their professors said about Wilkinson's speech in their classes. Political science professor Ray Hillam was one of Bentley and Russell's targets. He was notified of the spy ring by one of his students and requested a formal hearing be arranged. In the first hearing on September 15, presided over by vice presidents of the university, Hillam was formally charged for being pro-communist and disloyal to the university, with information gathered by the student spies used as evidence. Hillam rejected the charges and questioned the motives of all involved. The vice presidents formally issued a report on October 17. The report did not address that Hillam was the target of a spy ring, only accusing him of "minor indiscretions". Ronald Hankin, one of the students involved, went to local television and radio stations to inform them of the spying scandal and Wilkinson's involvement in it. Wilkinson admitted that he recruited students to report on faculty members in an official statement. In the official history of BYU, Wilkinson included information about the spy ring, but omitted any information that led him to appear guilty.
End of presidency
Wilkinson considered the most important accomplishment of his term as president to have been the organization of student wards and stakes. Wilkinson was the ninth Commissioner of Church Education of the LDS Church. During his tenure, he also bore the title "Administrator–Chancellor of the Unified Church Schools System". On April 21, 1966, Wilkinson gave an address to the student body of BYU, entitled "The Changing Nature of American Government from a Constitutional Republic to a Welfare State". This was published in booklet form by Deseret Book Company. After McKay died in 1970, Neal A. Maxwell was named the new commissioner of CES. Wilkinson had relied on McKay as a buffer in interacting with Harold B. Lee, a senior member of the Board of Trustees with whom Wilkinson differed greatly in educational and administrative philosophies. Sensing a lack of support among the church leaders, Wilkinson resigned from his position as BYU president in mid-1970 and was released at the beginning of 1971. Even though he was no longer president, Wilkinson hoped to be involved in the establishment of the J. Reuben Clark Law School. Due to his domineering reputation, school officials were unsure that he should continue to be so closely involved in administration of BYU, so they asked him to edit the university's official centennial history. Published in 1976, Brigham Young University: The First One Hundred Years was composed of four volumes.
Death
Wilkinson died of a heart attack April 6, 1978. Before he died, he had been supervising the work on his biography, Ernest L. Wilkinson: Indian Advocate and University President.
LDS Church service
In the early 1930s, Wilkinson served as branch president in New York and Queens, and later, bishop of the Queens Ward. His colleagues in the Hughes law firm called him the "Bishop of Wall Street". In 1940, he served as second counselor to Ezra Taft Benson in the presidency of the Washington Stake and as first counselor from 1944 to 1948 to a later president of the stake. He represented the church on the General Commission for Chaplains of the Army and Navy.
Legacy
During the twenty years of Wilkinson's presidency at BYU, the student body increased from 4,004 students in 1951 to over 25,000 in 1971. The university went from having five colleges with 37 departments to 13 colleges with 71 departments. The number of faculty members increased by from 244 to 932, while the number of them holding a doctoral degree increased from 50 to more than 500. The first associate and doctoral programs were organized. The quarter system was changed to the semester system. The number of resources in the library increased by 500%. The number of buildings increased from six permanent buildings to 254 permanent buildings and 85 temporary buildings, an increase from 800,000 to 5 million square feet of floor space. After 1972, student housing could accommodate almost 6,000 students, an increase from the 1,200 student accommodations in 1951. The achievement Wilkinson was most proud of was the creation of student wards and stakes. In 1951, there was one branch for LDS students and in 1971, there were 98 wards and 10 stakes for LDS students.
Notes
References
.
.
.
.
.
.
.
.
.
.
.
.
External links
Wilkinson's presidential profile listed at BYU
Wilkinson resources available through BYU
Ernest L. Wilkinson Papers at BYU
Ernest L. Wilkinson scrapbook of Brigham Young University buildings, UA 5529 at L. Tom Perry Special Collections, Brigham Young University
Wilkinson, Cragun, and Barker papers, MSS 2382 at L. Tom Perry Special Collections, Harold B. Lee Library, Brigham Young University
United States Petioner v. Southern Ute Tribe or Band of Indians
1899 births
1978 deaths
American leaders of the Church of Jesus Christ of Latter-day Saints
Brigham Young University alumni
Commissioners of Church Education (LDS Church)
George Washington University Law School alumni
Harvard Law School alumni
Legal educators
People from Ogden, Utah
Presidents of Brigham Young University
Rutgers University faculty
Utah lawyers
Utah Republicans
Weber State University alumni
Latter Day Saints from Utah
Latter Day Saints from Washington, D.C.
Latter Day Saints from Massachusetts
Latter Day Saints from New York (state)
Latter Day Saints from New Jersey
Harold B. Lee Library-related University Archives articles |
```python
import logging
def test_logging(caplog):
logger = logging.getLogger(__name__)
caplog.set_level(logging.DEBUG) # Set minimum log level to capture
logger.debug("This is a debug message.")
logger.info("This is an info message.")
logger.warning("This is a warning message.")
logger.error("This is an error message.")
logger.critical("This is a critical message.")
``` |
Student selected components (SSCs; formerly known as special study modules or SSMs) are optional elements within the undergraduate medical syllabus in UK medical schools, introduced following the recommendations of the 2002 report, "Tomorrow's Doctors", by the General Medical Council (GMC) that the syllabus should include student choice. In 2003, the GMC required that between 25% and 33% of curricular time be available for SSCs. However in the 2009 edition of Tomorrow's Doctors this requirement was reduced to a minimum of 10 percent.
References
Medical education in the United Kingdom |
```python
import functools
import re
from openpilot.tools.lib.auth_config import get_token
from openpilot.tools.lib.api import CommaApi
from openpilot.tools.lib.helpers import RE
@functools.total_ordering
class Bootlog:
def __init__(self, url: str):
self._url = url
r = re.search(RE.BOOTLOG_NAME, url)
if not r:
raise Exception(f"Unable to parse: {url}")
self._id = r.group('log_id')
self._dongle_id = r.group('dongle_id')
@property
def url(self) -> str:
return self._url
@property
def dongle_id(self) -> str:
return self._dongle_id
@property
def id(self) -> str:
return self._id
def __str__(self):
return f"{self._dongle_id}/{self._id}"
def __eq__(self, b) -> bool:
if not isinstance(b, Bootlog):
return False
return self.id == b.id
def __lt__(self, b) -> bool:
if not isinstance(b, Bootlog):
return False
return self.id < b.id
def get_bootlog_from_id(bootlog_id: str) -> Bootlog | None:
# TODO: implement an API endpoint for this
bl = Bootlog(bootlog_id)
for b in get_bootlogs(bl.dongle_id):
if b == bl:
return b
return None
def get_bootlogs(dongle_id: str) -> list[Bootlog]:
api = CommaApi(get_token())
r = api.get(f'v1/devices/{dongle_id}/bootlogs')
return [Bootlog(b) for b in r]
``` |
Bernard John Darre (November 8, 1939 – April 26, 2006) was an American football guard in the National Football League (NFL) for the Washington Redskins. He played college football at Tulane University and was drafted in the 15th round of the 1960 NFL Draft.
External links
1939 births
2006 deaths
Alcee Fortier High School alumni
American football offensive guards
Players of American football from New Orleans
Tulane Green Wave football players
Washington Redskins players |
Ladins can refer to:
Ladin people, an ethnic group in northern Italy
speakers of the Ladin language
Ladins Political Movement, a political party in South Tyrol |
```objective-c
/** @file
* @brief Service Discovery Protocol handling.
*/
/*
*
*/
#ifndef ZEPHYR_INCLUDE_BLUETOOTH_SDP_H_
#define ZEPHYR_INCLUDE_BLUETOOTH_SDP_H_
/**
* @file
* @brief Service Discovery Protocol (SDP)
* @defgroup bt_sdp Service Discovery Protocol (SDP)
* @ingroup bluetooth
* @{
*/
#include <zephyr/bluetooth/uuid.h>
#include <zephyr/bluetooth/conn.h>
#ifdef __cplusplus
extern "C" {
#endif
/*
* All definitions are based on Bluetooth Assigned Numbers
* of the Bluetooth Specification
*/
/**
* @name Service class identifiers of standard services and service groups
* @{
*/
#define BT_SDP_SDP_SERVER_SVCLASS 0x1000 /**< Service Discovery Server */
#define BT_SDP_BROWSE_GRP_DESC_SVCLASS 0x1001 /**< Browse Group Descriptor */
#define BT_SDP_PUBLIC_BROWSE_GROUP 0x1002 /**< Public Browse Group */
#define BT_SDP_SERIAL_PORT_SVCLASS 0x1101 /**< Serial Port */
#define BT_SDP_LAN_ACCESS_SVCLASS 0x1102 /**< LAN Access Using PPP */
#define BT_SDP_DIALUP_NET_SVCLASS 0x1103 /**< Dialup Networking */
#define BT_SDP_IRMC_SYNC_SVCLASS 0x1104 /**< IrMC Sync */
#define BT_SDP_OBEX_OBJPUSH_SVCLASS 0x1105 /**< OBEX Object Push */
#define BT_SDP_OBEX_FILETRANS_SVCLASS 0x1106 /**< OBEX File Transfer */
#define BT_SDP_IRMC_SYNC_CMD_SVCLASS 0x1107 /**< IrMC Sync Command */
#define BT_SDP_HEADSET_SVCLASS 0x1108 /**< Headset */
#define BT_SDP_CORDLESS_TELEPHONY_SVCLASS 0x1109 /**< Cordless Telephony */
#define BT_SDP_AUDIO_SOURCE_SVCLASS 0x110a /**< Audio Source */
#define BT_SDP_AUDIO_SINK_SVCLASS 0x110b /**< Audio Sink */
#define BT_SDP_AV_REMOTE_TARGET_SVCLASS 0x110c /**< A/V Remote Control Target */
#define BT_SDP_ADVANCED_AUDIO_SVCLASS 0x110d /**< Advanced Audio Distribution */
#define BT_SDP_AV_REMOTE_SVCLASS 0x110e /**< A/V Remote Control */
#define BT_SDP_AV_REMOTE_CONTROLLER_SVCLASS 0x110f /**< A/V Remote Control Controller */
#define BT_SDP_INTERCOM_SVCLASS 0x1110 /**< Intercom */
#define BT_SDP_FAX_SVCLASS 0x1111 /**< Fax */
#define BT_SDP_HEADSET_AGW_SVCLASS 0x1112 /**< Headset AG */
#define BT_SDP_WAP_SVCLASS 0x1113 /**< WAP */
#define BT_SDP_WAP_CLIENT_SVCLASS 0x1114 /**< WAP Client */
#define BT_SDP_PANU_SVCLASS 0x1115 /**< Personal Area Networking User */
#define BT_SDP_NAP_SVCLASS 0x1116 /**< Network Access Point */
#define BT_SDP_GN_SVCLASS 0x1117 /**< Group Network */
#define BT_SDP_DIRECT_PRINTING_SVCLASS 0x1118 /**< Direct Printing */
#define BT_SDP_REFERENCE_PRINTING_SVCLASS 0x1119 /**< Reference Printing */
#define BT_SDP_IMAGING_SVCLASS 0x111a /**< Basic Imaging Profile */
#define BT_SDP_IMAGING_RESPONDER_SVCLASS 0x111b /**< Imaging Responder */
#define BT_SDP_IMAGING_ARCHIVE_SVCLASS 0x111c /**< Imaging Automatic Archive */
#define BT_SDP_IMAGING_REFOBJS_SVCLASS 0x111d /**< Imaging Referenced Objects */
#define BT_SDP_HANDSFREE_SVCLASS 0x111e /**< Handsfree */
#define BT_SDP_HANDSFREE_AGW_SVCLASS 0x111f /**< Handsfree Audio Gateway */
#define BT_SDP_DIRECT_PRT_REFOBJS_SVCLASS 0x1120 /**< Direct Printing Reference Objects Service */
#define BT_SDP_REFLECTED_UI_SVCLASS 0x1121 /**< Reflected UI */
#define BT_SDP_BASIC_PRINTING_SVCLASS 0x1122 /**< Basic Printing */
#define BT_SDP_PRINTING_STATUS_SVCLASS 0x1123 /**< Printing Status */
#define BT_SDP_HID_SVCLASS 0x1124 /**< Human Interface Device Service */
#define BT_SDP_HCR_SVCLASS 0x1125 /**< Hardcopy Cable Replacement */
#define BT_SDP_HCR_PRINT_SVCLASS 0x1126 /**< HCR Print */
#define BT_SDP_HCR_SCAN_SVCLASS 0x1127 /**< HCR Scan */
#define BT_SDP_CIP_SVCLASS 0x1128 /**< Common ISDN Access */
#define BT_SDP_VIDEO_CONF_GW_SVCLASS 0x1129 /**< Video Conferencing Gateway */
#define BT_SDP_UDI_MT_SVCLASS 0x112a /**< UDI MT */
#define BT_SDP_UDI_TA_SVCLASS 0x112b /**< UDI TA */
#define BT_SDP_AV_SVCLASS 0x112c /**< Audio/Video */
#define BT_SDP_SAP_SVCLASS 0x112d /**< SIM Access */
#define BT_SDP_PBAP_PCE_SVCLASS 0x112e /**< Phonebook Access Client */
#define BT_SDP_PBAP_PSE_SVCLASS 0x112f /**< Phonebook Access Server */
#define BT_SDP_PBAP_SVCLASS 0x1130 /**< Phonebook Access */
#define BT_SDP_MAP_MSE_SVCLASS 0x1132 /**< Message Access Server */
#define BT_SDP_MAP_MCE_SVCLASS 0x1133 /**< Message Notification Server */
#define BT_SDP_MAP_SVCLASS 0x1134 /**< Message Access Profile */
#define BT_SDP_GNSS_SVCLASS 0x1135 /**< GNSS */
#define BT_SDP_GNSS_SERVER_SVCLASS 0x1136 /**< GNSS Server */
#define BT_SDP_MPS_SC_SVCLASS 0x113a /**< MPS SC */
#define BT_SDP_MPS_SVCLASS 0x113b /**< MPS */
#define BT_SDP_PNP_INFO_SVCLASS 0x1200 /**< PnP Information */
#define BT_SDP_GENERIC_NETWORKING_SVCLASS 0x1201 /**< Generic Networking */
#define BT_SDP_GENERIC_FILETRANS_SVCLASS 0x1202 /**< Generic File Transfer */
#define BT_SDP_GENERIC_AUDIO_SVCLASS 0x1203 /**< Generic Audio */
#define BT_SDP_GENERIC_TELEPHONY_SVCLASS 0x1204 /**< Generic Telephony */
#define BT_SDP_UPNP_SVCLASS 0x1205 /**< UPnP Service */
#define BT_SDP_UPNP_IP_SVCLASS 0x1206 /**< UPnP IP Service */
#define BT_SDP_UPNP_PAN_SVCLASS 0x1300 /**< UPnP IP PAN */
#define BT_SDP_UPNP_LAP_SVCLASS 0x1301 /**< UPnP IP LAP */
#define BT_SDP_UPNP_L2CAP_SVCLASS 0x1302 /**< UPnP IP L2CAP */
#define BT_SDP_VIDEO_SOURCE_SVCLASS 0x1303 /**< Video Source */
#define BT_SDP_VIDEO_SINK_SVCLASS 0x1304 /**< Video Sink */
#define BT_SDP_VIDEO_DISTRIBUTION_SVCLASS 0x1305 /**< Video Distribution */
#define BT_SDP_HDP_SVCLASS 0x1400 /**< HDP */
#define BT_SDP_HDP_SOURCE_SVCLASS 0x1401 /**< HDP Source */
#define BT_SDP_HDP_SINK_SVCLASS 0x1402 /**< HDP Sink */
#define BT_SDP_GENERIC_ACCESS_SVCLASS 0x1800 /**< Generic Access Profile */
#define BT_SDP_GENERIC_ATTRIB_SVCLASS 0x1801 /**< Generic Attribute Profile */
#define BT_SDP_APPLE_AGENT_SVCLASS 0x2112 /**< Apple Agent */
/**
* @}
*/
#define BT_SDP_SERVER_RECORD_HANDLE 0x0000
/**
* @name Attribute identifier codes
*
* Possible values for attribute-id are listed below.
* See SDP Spec, section "Service Attribute Definitions" for more details.
*
* @{
*/
#define BT_SDP_ATTR_RECORD_HANDLE 0x0000 /**< Service Record Handle */
#define BT_SDP_ATTR_SVCLASS_ID_LIST 0x0001 /**< Service Class ID List */
#define BT_SDP_ATTR_RECORD_STATE 0x0002 /**< Service Record State */
#define BT_SDP_ATTR_SERVICE_ID 0x0003 /**< Service ID */
#define BT_SDP_ATTR_PROTO_DESC_LIST 0x0004 /**< Protocol Descriptor List */
#define BT_SDP_ATTR_BROWSE_GRP_LIST 0x0005 /**< Browse Group List */
#define BT_SDP_ATTR_LANG_BASE_ATTR_ID_LIST 0x0006 /**< Language Base Attribute ID List */
#define BT_SDP_ATTR_SVCINFO_TTL 0x0007 /**< Service Info Time to Live */
#define BT_SDP_ATTR_SERVICE_AVAILABILITY 0x0008 /**< Service Availability */
#define BT_SDP_ATTR_PROFILE_DESC_LIST 0x0009 /**< Bluetooth Profile Descriptor List */
#define BT_SDP_ATTR_DOC_URL 0x000a /**< Documentation URL */
#define BT_SDP_ATTR_CLNT_EXEC_URL 0x000b /**< Client Executable URL */
#define BT_SDP_ATTR_ICON_URL 0x000c /**< Icon URL */
#define BT_SDP_ATTR_ADD_PROTO_DESC_LIST 0x000d /**< Additional Protocol Descriptor List */
#define BT_SDP_ATTR_GROUP_ID 0x0200 /**< Group ID */
#define BT_SDP_ATTR_IP_SUBNET 0x0200 /**< IP Subnet */
#define BT_SDP_ATTR_VERSION_NUM_LIST 0x0200 /**< Version Number List */
#define BT_SDP_ATTR_SUPPORTED_FEATURES_LIST 0x0200 /**< Supported Features List */
#define BT_SDP_ATTR_GOEP_L2CAP_PSM 0x0200 /**< GOEP L2CAP PSM */
#define BT_SDP_ATTR_SVCDB_STATE 0x0201 /**< Service Database State */
#define BT_SDP_ATTR_MPSD_SCENARIOS 0x0200 /**< MPSD Scenarios */
#define BT_SDP_ATTR_MPMD_SCENARIOS 0x0201 /**< MPMD Scenarios */
#define BT_SDP_ATTR_MPS_DEPENDENCIES 0x0202 /**< Supported Profiles & Protocols */
#define BT_SDP_ATTR_SERVICE_VERSION 0x0300 /**< Service Version */
#define BT_SDP_ATTR_EXTERNAL_NETWORK 0x0301 /**< External Network */
#define BT_SDP_ATTR_SUPPORTED_DATA_STORES_LIST 0x0301 /**< Supported Data Stores List */
#define BT_SDP_ATTR_DATA_EXCHANGE_SPEC 0x0301 /**< Data Exchange Specification */
#define BT_SDP_ATTR_NETWORK 0x0301 /**< Network */
#define BT_SDP_ATTR_FAX_CLASS1_SUPPORT 0x0302 /**< Fax Class 1 Support */
#define BT_SDP_ATTR_REMOTE_AUDIO_VOLUME_CONTROL 0x0302 /**< Remote Audio Volume Control */
#define BT_SDP_ATTR_MCAP_SUPPORTED_PROCEDURES 0x0302 /**< MCAP Supported Procedures */
#define BT_SDP_ATTR_FAX_CLASS20_SUPPORT 0x0303 /**< Fax Class 2.0 Support */
#define BT_SDP_ATTR_SUPPORTED_FORMATS_LIST 0x0303 /**< Supported Formats List */
#define BT_SDP_ATTR_FAX_CLASS2_SUPPORT 0x0304 /**< Fax Class 2 Support (vendor-specific)*/
#define BT_SDP_ATTR_AUDIO_FEEDBACK_SUPPORT 0x0305 /**< Audio Feedback Support */
#define BT_SDP_ATTR_NETWORK_ADDRESS 0x0306 /**< Network Address */
#define BT_SDP_ATTR_WAP_GATEWAY 0x0307 /**< WAP Gateway */
#define BT_SDP_ATTR_HOMEPAGE_URL 0x0308 /**< Homepage URL */
#define BT_SDP_ATTR_WAP_STACK_TYPE 0x0309 /**< WAP Stack Type */
#define BT_SDP_ATTR_SECURITY_DESC 0x030a /**< Security Description */
#define BT_SDP_ATTR_NET_ACCESS_TYPE 0x030b /**< Net Access Type */
#define BT_SDP_ATTR_MAX_NET_ACCESSRATE 0x030c /**< Max Net Access Rate */
#define BT_SDP_ATTR_IP4_SUBNET 0x030d /**< IPv4 Subnet */
#define BT_SDP_ATTR_IP6_SUBNET 0x030e /**< IPv6 Subnet */
#define BT_SDP_ATTR_SUPPORTED_CAPABILITIES 0x0310 /**< BIP Supported Capabilities */
#define BT_SDP_ATTR_SUPPORTED_FEATURES 0x0311 /**< BIP Supported Features */
#define BT_SDP_ATTR_SUPPORTED_FUNCTIONS 0x0312 /**< BIP Supported Functions */
#define BT_SDP_ATTR_TOTAL_IMAGING_DATA_CAPACITY 0x0313 /**< BIP Total Imaging Data Capacity */
#define BT_SDP_ATTR_SUPPORTED_REPOSITORIES 0x0314 /**< Supported Repositories */
#define BT_SDP_ATTR_MAS_INSTANCE_ID 0x0315 /**< MAS Instance ID */
#define BT_SDP_ATTR_SUPPORTED_MESSAGE_TYPES 0x0316 /**< Supported Message Types */
#define BT_SDP_ATTR_PBAP_SUPPORTED_FEATURES 0x0317 /**< PBAP Supported Features */
#define BT_SDP_ATTR_MAP_SUPPORTED_FEATURES 0x0317 /**< MAP Supported Features */
#define BT_SDP_ATTR_SPECIFICATION_ID 0x0200 /**< Specification ID */
#define BT_SDP_ATTR_VENDOR_ID 0x0201 /**< Vendor ID */
#define BT_SDP_ATTR_PRODUCT_ID 0x0202 /**< Product ID */
#define BT_SDP_ATTR_VERSION 0x0203 /**< Version */
#define BT_SDP_ATTR_PRIMARY_RECORD 0x0204 /**< Primary Record */
#define BT_SDP_ATTR_VENDOR_ID_SOURCE 0x0205 /**< Vendor ID Source */
#define BT_SDP_ATTR_HID_DEVICE_RELEASE_NUMBER 0x0200 /**< HID Device Release Number */
#define BT_SDP_ATTR_HID_PARSER_VERSION 0x0201 /**< HID Parser Version */
#define BT_SDP_ATTR_HID_DEVICE_SUBCLASS 0x0202 /**< HID Device Subclass */
#define BT_SDP_ATTR_HID_COUNTRY_CODE 0x0203 /**< HID Country Code */
#define BT_SDP_ATTR_HID_VIRTUAL_CABLE 0x0204 /**< HID Virtual Cable */
#define BT_SDP_ATTR_HID_RECONNECT_INITIATE 0x0205 /**< HID Reconnect Initiate */
#define BT_SDP_ATTR_HID_DESCRIPTOR_LIST 0x0206 /**< HID Descriptor List */
#define BT_SDP_ATTR_HID_LANG_ID_BASE_LIST 0x0207 /**< HID Language ID Base List */
#define BT_SDP_ATTR_HID_SDP_DISABLE 0x0208 /**< HID SDP Disable */
#define BT_SDP_ATTR_HID_BATTERY_POWER 0x0209 /**< HID Battery Power */
#define BT_SDP_ATTR_HID_REMOTE_WAKEUP 0x020a /**< HID Remote Wakeup */
#define BT_SDP_ATTR_HID_PROFILE_VERSION 0x020b /**< HID Profile Version */
#define BT_SDP_ATTR_HID_SUPERVISION_TIMEOUT 0x020c /**< HID Supervision Timeout */
#define BT_SDP_ATTR_HID_NORMALLY_CONNECTABLE 0x020d /**< HID Normally Connectable */
#define BT_SDP_ATTR_HID_BOOT_DEVICE 0x020e /**< HID Boot Device */
/**
* @}
*/
/*
* These identifiers are based on the SDP spec stating that
* "base attribute id of the primary (universal) language must be 0x0100"
*
* Other languages should have their own offset; e.g.:
* #define XXXLangBase yyyy
* #define AttrServiceName_XXX 0x0000+XXXLangBase
*/
#define BT_SDP_PRIMARY_LANG_BASE 0x0100
#define BT_SDP_ATTR_SVCNAME_PRIMARY (0x0000 + BT_SDP_PRIMARY_LANG_BASE)
#define BT_SDP_ATTR_SVCDESC_PRIMARY (0x0001 + BT_SDP_PRIMARY_LANG_BASE)
#define BT_SDP_ATTR_PROVNAME_PRIMARY (0x0002 + BT_SDP_PRIMARY_LANG_BASE)
/**
* @name The Data representation in SDP PDUs (pps 339, 340 of BT SDP Spec)
*
* These are the exact data type+size descriptor values
* that go into the PDU buffer.
*
* The datatype (leading 5bits) + size descriptor (last 3 bits)
* is 8 bits. The size descriptor is critical to extract the
* right number of bytes for the data value from the PDU.
*
* For most basic types, the datatype+size descriptor is
* straightforward. However for constructed types and strings,
* the size of the data is in the next "n" bytes following the
* 8 bits (datatype+size) descriptor. Exactly what the "n" is
* specified in the 3 bits of the data size descriptor.
*
* TextString and URLString can be of size 2^{8, 16, 32} bytes
* DataSequence and DataSequenceAlternates can be of size 2^{8, 16, 32}
* The size are computed post-facto in the API and are not known apriori.
* @{
*/
#define BT_SDP_DATA_NIL 0x00 /**< Nil, the null type */
#define BT_SDP_UINT8 0x08 /**< Unsigned 8-bit integer */
#define BT_SDP_UINT16 0x09 /**< Unsigned 16-bit integer */
#define BT_SDP_UINT32 0x0a /**< Unsigned 32-bit integer */
#define BT_SDP_UINT64 0x0b /**< Unsigned 64-bit integer */
#define BT_SDP_UINT128 0x0c /**< Unsigned 128-bit integer */
#define BT_SDP_INT8 0x10 /**< Signed 8-bit integer */
#define BT_SDP_INT16 0x11 /**< Signed 16-bit integer */
#define BT_SDP_INT32 0x12 /**< Signed 32-bit integer */
#define BT_SDP_INT64 0x13 /**< Signed 64-bit integer */
#define BT_SDP_INT128 0x14 /**< Signed 128-bit integer */
#define BT_SDP_UUID_UNSPEC 0x18 /**< UUID, unspecified size */
#define BT_SDP_UUID16 0x19 /**< UUID, 16-bit */
#define BT_SDP_UUID32 0x1a /**< UUID, 32-bit */
#define BT_SDP_UUID128 0x1c /**< UUID, 128-bit */
#define BT_SDP_TEXT_STR_UNSPEC 0x20 /**< Text string, unspecified size */
#define BT_SDP_TEXT_STR8 0x25 /**< Text string, 8-bit length */
#define BT_SDP_TEXT_STR16 0x26 /**< Text string, 16-bit length */
#define BT_SDP_TEXT_STR32 0x27 /**< Text string, 32-bit length */
#define BT_SDP_BOOL 0x28 /**< Boolean */
#define BT_SDP_SEQ_UNSPEC 0x30 /**< Data element sequence, unspecified size */
#define BT_SDP_SEQ8 0x35 /**< Data element sequence, 8-bit length */
#define BT_SDP_SEQ16 0x36 /**< Data element sequence, 16-bit length */
#define BT_SDP_SEQ32 0x37 /**< Data element sequence, 32-bit length */
#define BT_SDP_ALT_UNSPEC 0x38 /**< Data element alternative, unspecified size */
#define BT_SDP_ALT8 0x3d /**< Data element alternative, 8-bit length */
#define BT_SDP_ALT16 0x3e /**< Data element alternative, 16-bit length */
#define BT_SDP_ALT32 0x3f /**< Data element alternative, 32-bit length */
#define BT_SDP_URL_STR_UNSPEC 0x40 /**< URL string, unspecified size */
#define BT_SDP_URL_STR8 0x45 /**< URL string, 8-bit length */
#define BT_SDP_URL_STR16 0x46 /**< URL string, 16-bit length */
#define BT_SDP_URL_STR32 0x47 /**< URL string, 32-bit length */
/**
* @}
*/
#define BT_SDP_TYPE_DESC_MASK 0xf8
#define BT_SDP_SIZE_DESC_MASK 0x07
#define BT_SDP_SIZE_INDEX_OFFSET 5
/** @brief SDP Generic Data Element Value. */
struct bt_sdp_data_elem {
uint8_t type; /**< Type of the data element */
uint32_t data_size; /**< Size of the data element */
uint32_t total_size; /**< Total size of the data element */
const void *data;
};
/** @brief SDP Attribute Value. */
struct bt_sdp_attribute {
uint16_t id; /**< Attribute ID */
struct bt_sdp_data_elem val; /**< Attribute data */
};
/** @brief SDP Service Record Value. */
struct bt_sdp_record {
uint32_t handle; /**< Redundant, for quick ref */
struct bt_sdp_attribute *attrs; /**< Base addr of attr array */
size_t attr_count; /**< Number of attributes */
uint8_t index; /**< Index of the record in LL */
struct bt_sdp_record *next; /**< Next service record */
};
/*
* --------------------------------------------------- ------------------
* | Service Hdl | Attr list ptr | Attr count | Next | -> | Service Hdl | ...
* --------------------------------------------------- ------------------
*/
/**
* @brief Declare an array of 8-bit elements in an attribute.
*/
#define BT_SDP_ARRAY_8(...) ((uint8_t[]) {__VA_ARGS__})
/**
* @brief Declare an array of 16-bit elements in an attribute.
*/
#define BT_SDP_ARRAY_16(...) ((uint16_t[]) {__VA_ARGS__})
/**
* @brief Declare an array of 32-bit elements in an attribute.
*/
#define BT_SDP_ARRAY_32(...) ((uint32_t[]) {__VA_ARGS__})
/**
* @brief Declare a fixed-size data element header.
*
* @param _type Data element header containing type and size descriptors.
*/
#define BT_SDP_TYPE_SIZE(_type) .type = _type, \
.data_size = BIT(_type & BT_SDP_SIZE_DESC_MASK), \
.total_size = BIT(_type & BT_SDP_SIZE_DESC_MASK) + 1
/**
* @brief Declare a variable-size data element header.
*
* @param _type Data element header containing type and size descriptors.
* @param _size The actual size of the data.
*/
#define BT_SDP_TYPE_SIZE_VAR(_type, _size) .type = _type, \
.data_size = _size, \
.total_size = BIT((_type & BT_SDP_SIZE_DESC_MASK) - \
BT_SDP_SIZE_INDEX_OFFSET) + _size + 1
/**
* @brief Declare a list of data elements.
*/
#define BT_SDP_DATA_ELEM_LIST(...) ((struct bt_sdp_data_elem[]) {__VA_ARGS__})
/**
* @brief SDP New Service Record Declaration Macro.
*
* Helper macro to declare a new service record.
* Default attributes: Record Handle, Record State,
* Language Base, Root Browse Group
*
*/
#define BT_SDP_NEW_SERVICE \
{ \
BT_SDP_ATTR_RECORD_HANDLE, \
{ BT_SDP_TYPE_SIZE(BT_SDP_UINT32), BT_SDP_ARRAY_32(0) } \
}, \
{ \
BT_SDP_ATTR_RECORD_STATE, \
{ BT_SDP_TYPE_SIZE(BT_SDP_UINT32), BT_SDP_ARRAY_32(0) } \
}, \
{ \
BT_SDP_ATTR_LANG_BASE_ATTR_ID_LIST, \
{ BT_SDP_TYPE_SIZE_VAR(BT_SDP_SEQ8, 9), \
BT_SDP_DATA_ELEM_LIST( \
{ BT_SDP_TYPE_SIZE(BT_SDP_UINT16), BT_SDP_ARRAY_8('n', 'e') }, \
{ BT_SDP_TYPE_SIZE(BT_SDP_UINT16), BT_SDP_ARRAY_16(106) }, \
{ BT_SDP_TYPE_SIZE(BT_SDP_UINT16), \
BT_SDP_ARRAY_16(BT_SDP_PRIMARY_LANG_BASE) } \
), \
} \
}, \
{ \
BT_SDP_ATTR_BROWSE_GRP_LIST, \
{ BT_SDP_TYPE_SIZE_VAR(BT_SDP_SEQ8, 3), \
BT_SDP_DATA_ELEM_LIST( \
{ BT_SDP_TYPE_SIZE(BT_SDP_UUID16), \
BT_SDP_ARRAY_16(BT_SDP_PUBLIC_BROWSE_GROUP) }, \
), \
} \
}
/**
* @brief Generic SDP List Attribute Declaration Macro.
*
* Helper macro to declare a list attribute.
*
* @param _att_id List Attribute ID.
* @param _data_elem_seq Data element sequence for the list.
* @param _type_size SDP type and size descriptor.
*/
#define BT_SDP_LIST(_att_id, _type_size, _data_elem_seq) \
{ \
_att_id, { _type_size, _data_elem_seq } \
}
/**
* @brief SDP Service ID Attribute Declaration Macro.
*
* Helper macro to declare a service ID attribute.
*
* @param _uuid Service ID 16bit UUID.
*/
#define BT_SDP_SERVICE_ID(_uuid) \
{ \
BT_SDP_ATTR_SERVICE_ID, \
{ BT_SDP_TYPE_SIZE(BT_SDP_UUID16), &((struct bt_uuid_16) _uuid) } \
}
/**
* @brief SDP Name Attribute Declaration Macro.
*
* Helper macro to declare a service name attribute.
*
* @param _name Service name as a string (up to 256 chars).
*/
#define BT_SDP_SERVICE_NAME(_name) \
{ \
BT_SDP_ATTR_SVCNAME_PRIMARY, \
{ BT_SDP_TYPE_SIZE_VAR(BT_SDP_TEXT_STR8, (sizeof(_name)-1)), _name } \
}
/**
* @brief SDP Supported Features Attribute Declaration Macro.
*
* Helper macro to declare supported features of a profile/protocol.
*
* @param _features Feature mask as 16bit unsigned integer.
*/
#define BT_SDP_SUPPORTED_FEATURES(_features) \
{ \
BT_SDP_ATTR_SUPPORTED_FEATURES, \
{ BT_SDP_TYPE_SIZE(BT_SDP_UINT16), BT_SDP_ARRAY_16(_features) } \
}
/**
* @brief SDP Service Declaration Macro.
*
* Helper macro to declare a service.
*
* @param _attrs List of attributes for the service record.
*/
#define BT_SDP_RECORD(_attrs) \
{ \
.attrs = _attrs, \
.attr_count = ARRAY_SIZE((_attrs)), \
}
/* Server API */
/** @brief Register a Service Record.
*
* Register a Service Record. Applications can make use of
* macros such as BT_SDP_DECLARE_SERVICE, BT_SDP_LIST,
* BT_SDP_SERVICE_ID, BT_SDP_SERVICE_NAME, etc.
* A service declaration must start with BT_SDP_NEW_SERVICE.
*
* @param service Service record declared using BT_SDP_DECLARE_SERVICE.
*
* @return 0 in case of success or negative value in case of error.
*/
int bt_sdp_register_service(struct bt_sdp_record *service);
/* Client API */
/** @brief Generic SDP Client Query Result data holder */
struct bt_sdp_client_result {
/** buffer containing unparsed SDP record result for given UUID */
struct net_buf *resp_buf;
/** flag pointing that there are more result chunks for given UUID */
bool next_record_hint;
/** Reference to UUID object on behalf one discovery was started */
const struct bt_uuid *uuid;
};
/** @brief Helper enum to be used as return value of bt_sdp_discover_func_t.
* The value informs the caller to perform further pending actions or stop them.
*/
enum {
BT_SDP_DISCOVER_UUID_STOP = 0,
BT_SDP_DISCOVER_UUID_CONTINUE,
};
/** @typedef bt_sdp_discover_func_t
*
* @brief Callback type reporting to user that there is a resolved result
* on remote for given UUID and the result record buffer can be used by user
* for further inspection.
*
* A function of this type is given by the user to the bt_sdp_discover_params
* object. It'll be called on each valid record discovery completion for given
* UUID. When UUID resolution gives back no records then NULL is passed
* to the user. Otherwise user can get valid record(s) and then the internal
* hint 'next record' is set to false saying the UUID resolution is complete or
* the hint can be set by caller to true meaning that next record is available
* for given UUID.
* The returned function value allows the user to control retrieving follow-up
* resolved records if any. If the user doesn't want to read more resolved
* records for given UUID since current record data fulfills its requirements
* then should return BT_SDP_DISCOVER_UUID_STOP. Otherwise returned value means
* more subcall iterations are allowable.
*
* @param conn Connection object identifying connection to queried remote.
* @param result Object pointing to logical unparsed SDP record collected on
* base of response driven by given UUID.
*
* @return BT_SDP_DISCOVER_UUID_STOP in case of no more need to read next
* record data and continue discovery for given UUID. By returning
* BT_SDP_DISCOVER_UUID_CONTINUE user allows this discovery continuation.
*/
typedef uint8_t (*bt_sdp_discover_func_t)
(struct bt_conn *conn, struct bt_sdp_client_result *result);
/** @brief Main user structure used in SDP discovery of remote. */
struct bt_sdp_discover_params {
sys_snode_t _node;
/** UUID (service) to be discovered on remote SDP entity */
const struct bt_uuid *uuid;
/** Discover callback to be called on resolved SDP record */
bt_sdp_discover_func_t func;
/** Memory buffer enabled by user for SDP query results */
struct net_buf_pool *pool;
};
/** @brief Allows user to start SDP discovery session.
*
* The function performs SDP service discovery on remote server driven by user
* delivered discovery parameters. Discovery session is made as soon as
* no SDP transaction is ongoing between peers and if any then this one
* is queued to be processed at discovery completion of previous one.
* On the service discovery completion the callback function will be
* called to get feedback to user about findings.
*
* @param conn Object identifying connection to remote.
* @param params SDP discovery parameters.
*
* @return 0 in case of success or negative value in case of error.
*/
int bt_sdp_discover(struct bt_conn *conn,
const struct bt_sdp_discover_params *params);
/** @brief Release waiting SDP discovery request.
*
* It can cancel valid waiting SDP client request identified by SDP discovery
* parameters object.
*
* @param conn Object identifying connection to remote.
* @param params SDP discovery parameters.
*
* @return 0 in case of success or negative value in case of error.
*/
int bt_sdp_discover_cancel(struct bt_conn *conn,
const struct bt_sdp_discover_params *params);
/* Helper types & functions for SDP client to get essential data from server */
/** @brief Protocols to be asked about specific parameters */
enum bt_sdp_proto {
BT_SDP_PROTO_RFCOMM = 0x0003,
BT_SDP_PROTO_L2CAP = 0x0100,
};
/** @brief Give to user parameter value related to given stacked protocol UUID.
*
* API extracts specific parameter associated with given protocol UUID
* available in Protocol Descriptor List attribute.
*
* @param buf Original buffered raw record data.
* @param proto Known protocol to be checked like RFCOMM or L2CAP.
* @param param On success populated by found parameter value.
*
* @return 0 on success when specific parameter associated with given protocol
* value is found, or negative if error occurred during processing.
*/
int bt_sdp_get_proto_param(const struct net_buf *buf, enum bt_sdp_proto proto,
uint16_t *param);
/** @brief Get additional parameter value related to given stacked protocol UUID.
*
* API extracts specific parameter associated with given protocol UUID
* available in Additional Protocol Descriptor List attribute.
*
* @param buf Original buffered raw record data.
* @param proto Known protocol to be checked like RFCOMM or L2CAP.
* @param param_index There may be more than one parameter related to the
* given protocol UUID. This function returns the result that is
* indexed by this parameter. It's value is from 0, 0 means the
* first matched result, 1 means the second matched result.
* @param[out] param On success populated by found parameter value.
*
* @return 0 on success when a specific parameter associated with a given protocol
* value is found, or negative if error occurred during processing.
*/
int bt_sdp_get_addl_proto_param(const struct net_buf *buf, enum bt_sdp_proto proto,
uint8_t param_index, uint16_t *param);
/** @brief Get profile version.
*
* Helper API extracting remote profile version number. To get it proper
* generic profile parameter needs to be selected usually listed in SDP
* Interoperability Requirements section for given profile specification.
*
* @param buf Original buffered raw record data.
* @param profile Profile family identifier the profile belongs.
* @param version On success populated by found version number.
*
* @return 0 on success, negative value if error occurred during processing.
*/
int bt_sdp_get_profile_version(const struct net_buf *buf, uint16_t profile,
uint16_t *version);
/** @brief Get SupportedFeatures attribute value
*
* Allows if exposed by remote retrieve SupportedFeature attribute.
*
* @param buf Buffer holding original raw record data from remote.
* @param features On success object to be populated with SupportedFeature
* mask.
*
* @return 0 on success if feature found and valid, negative in case any error
*/
int bt_sdp_get_features(const struct net_buf *buf, uint16_t *features);
#ifdef __cplusplus
}
#endif
/**
* @}
*/
#endif /* ZEPHYR_INCLUDE_BLUETOOTH_SDP_H_ */
``` |
{{Infobox person
| name = Cirie Fields
| image = Cirie_Fields_Qatar.jpg
| caption = Fields on a U.S. military tour in 2008
| birth_name = Cirie Tiffany Fields
| birth_date =
| birth_place = Jersey City, New Jersey, U.S.
| television = Survivor: PanamaSurvivor: MicronesiaSurvivor: Heroes vs. VillainsSurvivor: Game ChangersSnake in the Grass (co-winner)The Traitors (winner) Big Brother 25
| spouse = Clarencio "H.B." Hacker
| children = 3
}}
Cirie Tiffany Fields (; born July 18, 1970) is an American nurse and television personality who competed on four seasons of Survivor. She first appeared in 2006 on Survivor: Panama, finishing in 4th place. In 2008, she returned and placed 3rd on Survivor: Micronesia. She made her third appearance on Survivor: Heroes vs. Villains in 2010, finishing 17th after being targeted and blindsided early in the game. She made her fourth and final appearance on Survivor: Game Changers in 2017, where she finished 6th and was eliminated without receiving a vote.
She is widely considered one of the greatest Survivor players of all-time and often cited as the best to never win. She competed on and won the first season of The Traitors on Peacock.
, Fields is competing in the twenty-fifth season of Big Brother, along with her son Jared Fields.
Early life
Fields was born on July 18, 1970, in Jersey City, New Jersey. She grew up partially in Norwalk, Connecticut, with her sisters Karla and Cicely, and her brother Kenneth. She has worked as a surgical instrumentalist, home care provider, candy factory worker, and telemarketer. She studied nursing at St. Francis Nursing School in New Castle, Pennsylvania, where she earned her degree. She went on to work as a clinical coordinator at Norwalk Hospital Surgical Center.
Survivor
Fields has participated in four different seasons of Survivor, and has even been praised by series host Jeff Probst for being a self-proclaimed couch potato who "got up off the couch to live their adventure".
Panama
Fields first gained fame on Survivor: Panama — Exile Island. Originally cast as a member of Casaya, the tribe made up of the oldest women in the game, she was at risk of being the first one eliminated when her tribe lost the first Immunity Challenge. However, she used her persuasion skills to convince Melinda Hyder and Ruth-Marie Milliman to vote off Tina Scheer. When the four original tribes were contracted down to two, leaving only the La Mina and Casaya tribes in the contest, Fields was once again in the spotlight as one of the physically weakest competitors on the new Casaya tribe, but saved herself yet again on Day Six when Hyder was eliminated. Eventually, Fields was able to assimilate with her tribemates, and managed to make the merge.
With only four players in the game on Day 34, Danielle DiLorenzo and Terry Dietz teamed up to eliminate Fields after they were both sent to Exile Island by Aras Baskauskas, who would go on to win immunity on Day 36. Alone at camp, Fields and Baskauskas decided to vote out DiLorenzo (since Dietz probably had a hidden immunity idol and they did not want to risk it being used). Already predicting a draw and the subsequent fire-making challenge, Dietz coached DiLorenzo on starting a fire using flint, while Baskauskas did the same with Fields. At Tribal Council, the imminent tie vote happened and DiLorenzo and Fields were deadlocked at two votes each. The two faced off in the fire-making challenge where, using a flint and materials to support the fire (coconut shells, pieces of wood, straw, etc.), they were to create a bonfire high enough to burn through a rope. The first one to complete this task would survive, while the other would be sent to the jury. In this challenge, Fields lost and became the sixth member of the jury, placing fourth overall. In her final words following her elimination, Fields said that she was proud of having come so far in the competition.
At the Final Tribal Council, Fields voted for Baskauskas, over DiLorenzo, to win the prize of $1 million and the title of "Sole Survivor." During this season, Fields herself won a 2007 GMC Yukon pickup truck, for being voted most popular participant of the season by viewers.
Micronesia
Two years after her first Survivor competition, Fields returned to the show for Survivor: Micronesia — Fans vs. Favorites, which premiered on February 7, 2008. She was initially assigned to Malakal, the tribe of "Favorites," or returning players, and initially floated between the two alliances within this tribe: one consisting of Ami Cusack, Eliza Orlins, Jonathan Penner and Yau-Man Chan; and the other consisting of Amanda Kimmel, James Clement, Oscar "Ozzy" Lusth and Parvati Shallow (with Jonny Fairplay also meandering between both alliances). Fields volunteered to be sent to Exile Island with Kathy Sleckman of Airai, the tribe of "Fans," or first-time players in the game, after Malakal won the combined Reward/Immunity Challenge in the Episode Two.
In the third episode of the season, she opted to join the alliance of Kimmel, Lusth, Clement, and Shallow after doubting the trustworthiness of Penner and Chan. On this occasion, Fields convinced her alliance to eliminate Chan, instead of Orlins, for being one of the biggest threats in the game. In Episode Four, Fields remained secure since her tribe had won Immunity. By the fifth episode, the original tribes were switched and Fields ended up in the new Malakal tribe, formed by four Fans and four Favorites.
After the merge, Fields became part of the "Black Widow Brigade," an all-female alliance consisting of herself, Kimmel, Shallow, Natalie Bolton, and Alexis Jones. After the merge, she concocted a plan to take Ozzy out due to him being a physical threat and possessing an immunity idol. Cirie, along with Natalie, Alexis, Parvati, and Jason (who was slated to be eliminated) voted out Ozzy, subsequently blindsiding Amanda. This alliance was forced to vote out one of its own on Day 33, after the lone surviving outsider, Erik Reichenbach, won his second straight immunity. That night, Fields, joined the majority of the tribe in voting against Kimmel, but to everyone's surprise, Kimmel produced an immunity idol, which cancelled all the votes against her and sent Jones out of the game instead. On Day 36, Reichenbach won immunity yet again, but before Tribal Council, Fields came up with a plan to keep the Black Widows intact. She would try to trick Reichenbach into thinking that he was untrustworthy and that he needed to give his immunity to Bolton to earn back the jury's trust. Fields even went so far as to assure him that she and Bolton would join him in voting out Shallow if he gave up immunity. The plan worked, and Reichenbach gave his immunity necklace to Bolton right before the vote. Without immunity, Reichenbach was unanimously voted out.
At that point, Fields was confident that she was just one Tribal Council away from securing a spot in the Final Tribal Council. But on Day 38, following the elimination of Bolton, it was revealed that there would be one last immunity challenge followed by a Tribal Tribal Council, to decide who would get to plead their case to the jury in the Final Two. Kimmel went on to win final immunity, and Fields became the 18th person eliminated from Micronesia in third place as the eighth and final member of the jury as Kimmel felt that Fields was extremely hard to beat and would have a better chance of winning against Shallow. She would end up casting her final jury vote for Shallow to win the $1 million prize, and the title of "Sole Survivor," over Kimmel.
Heroes vs. Villains
For the third time in her career, Fields was chosen to participate in Survivor, this time for its 20th season, Heroes vs. Villains. As part of the Heroes tribe, she immediately became targeted for elimination by Tom Westman and Stephenie LaGrossa, but survived the first Tribal Council when the Heroes tribe unanimously eliminated Jessica "Sugar" Kiper, who was seen as the weakest and most emotional person on the tribe. In Episode Two, Fields and her tribemate, Candice Woodcock, became the decisive votes in eliminating LaGrossa by a 6–3 margin.
In Episode Four, after being given a clue to a hidden immunity idol and believing that Westman had found it, Fields devised a plan to eliminate a member of the opposing alliance and eventually the Immunity Idol. She wanted to split the votes between Westman and Colby Donaldson, but she did not count on J.T. Thomas, who had eavesdropped on her plans. At Tribal Council, Thomas betrayed his alliance and helped eliminate Fields after Westman used his idol. She was the fourth person eliminated from the season, placing 17th overall.
Game Changers
In 2017, Fields was featured in Survivor: Game Changers, her fourth time on the show, making her the third contestant, and the first female, to compete on Survivor four times. Initially placed on the Nuku tribe, she was eventually switched to the brand new Tavua tribe, then the Mana tribe, and finally, the merged Maku Maku tribe, making her the only player of the season to be on four different tribes. Fields was the only player to make it to the merge without having to attend a single Tribal Council, Following the merge, she aligned with Michaela Bradshaw. At the first post-merge Tribal Council, Bradshaw was targeted for elimination, but Fields managed to get Hali Ford voted out instead.
On Day 25, Fields struggled to finish the obstacle course featured in the reward challenge, but Jeff encouraged her to keep trying, and she eventually finished, albeit long after the challenge was decided. At that same challenge, Sarah Lacina had found a vote-stealer advantage hidden under a bench. A few days later, Lacina told Fields about this advantage. On Day 35, Lacina gave Fields custody of the advantage as a sign of trust, and Fields promised to give it back after Tribal Council was over. But at that night's Tribal Council, Fields tried to play the advantage, only to learn that it was non-transferable. Lacina, upset at Fields' attempt to usurp the advantage, immediately targeted Fields' ally Bradshaw, who was indeed voted out that night.
The following night, Brad Culpepper won immunity, and at Tribal Council, Fields joined Aubry Bracco and Tai Trang in voting against Lacina, while the rest of the tribe split their votes between Bracco and Trang. After the votes were cast, though, Trang played two idols: one for himself and one for Bracco. Lacina then played her Legacy Advantage, which gave her immunity at the Final Six. This prompted "Troyzan" Robertson to play his own immunity idol as well. In the end, Fields, being the only one without any form of immunity, became the first player ever to be eliminated by default, despite having no votes cast against her that night, nor at any point during the entire season. She was the fifteenth person eliminated from the game, placing sixth overall and becoming the eighth member of the jury. As her torch was snuffed, Fields received a standing ovation from the jury members. At the Final Tribal Council, she voted for Lacina to win the $1 million prize over Culpepper and Robertson.
Legacy
On December 12, 2011, Fields was inducted into Xfinity's Survivor Hall of Fame. In a 2011 Rob Has a Podcast community fan poll, Fields was ranked the 6th greatest contestant of all-time. In a 2014 follow-up poll, she was ranked 7th. In a 2015 issue of CBS Watch magazine, commemorating the 15th anniversary of Survivor, she was voted by viewers as the tenth greatest contestant in the history of the series to date. In total, she has played the game of Survivor a total of 121 days, making her one of only a handful of players to have passed the 100-day mark on Survivor.
When all twenty contestants of Survivor: Winners at War were asked to name the best player to have never won Survivor, Fields received the most support, with six winners choosing her: Parvati Shallow, Natalie Anderson, Adam Klein, Yul Kwon, Boston Rob Mariano, and Nick Wilson.Big Brother
In 2023, Fields was cast on Big Brother 25 alongside her son Jared. She became the first former Survivor player to compete on Big Brother, and only the third ever to compete on both television shows.
Other media appearances
In 2016, Fields appeared on a Survivor themed episode of The Price is Right.
Fields was a contestant on the 2022 USA Network reality competition series Snake in the Grass alongside her former Heroes vs. Villains tribemate, Stephenie LaGrossa Kendrick. Fields split the $100,000 prize with Big Brother and The Amazing Race alums Janelle Pierzina and Rachel Reilly after they correctly determined that LaGrossa Kendrick was the Snake.
In 2023, she competed on the Peacock reality TV series The Traitors,'' on a cast that again included LaGrossa Kendrick and Reilly. Chosen to play as a traitor, she received the entire $250,000 prize pool for being the only traitor remaining at the end of the game.
Personal life
Fields is married to Clarencio "H.B." Hacker and they live with her three children: John, Jamil, and Jared.
Filmography
Television
References
External links
Official CBS biography page (2006)
1970 births
African-American television personalities
American nurses
American women nurses
Living people
People from Jersey City, New Jersey
People from Norwalk, Connecticut
Survivor (American TV series) contestants
21st-century African-American people
21st-century African-American women
20th-century African-American people
20th-century African-American women
Reality show winners
Big Brother (American TV series) contestants |
The Arboretum Jean Aubouin (10 hectares) is an arboretum located in the Mothe-Clédou forest near Combiers, Charente, Poitou-Charentes, France. The arboretum was established in 1932 by botanist Jean Aubouin. It contains deciduous trees and conifers including Cedrus deodara, Sequoia sempervirens, etc.
See also
List of botanical gardens in France
References
Sylvie Boutet, Arboretum Jean Aubouin : forêt domaniale de La Mothe-Clédou, Charente, Fontainebleau : Office national des forêts, 1999. .
Petit Futé description (French)
France, le trésor des régions (French)
Jean Aubouin, Arboretum
Jean Aubouin, Arboretum |
```c
/* -*- mode: C; c-basic-offset: 4; indent-tabs-mode: nil -*- */
// vim: expandtab:ts=8:sw=4:softtabstop=4:
///////////////////////////////////////////////////////////////////////////////
//
/// \file common.h
/// \brief Common functions needed in many places in liblzma
//
// Author: Lasse Collin
//
// This file has been put into the public domain.
// You can do whatever you want with this file.
//
///////////////////////////////////////////////////////////////////////////////
#include "common.h"
/////////////
// Version //
/////////////
extern LZMA_API(uint32_t)
lzma_version_number(void)
{
return LZMA_VERSION;
}
extern LZMA_API(const char *)
lzma_version_string(void)
{
return LZMA_VERSION_STRING;
}
///////////////////////
// Memory allocation //
///////////////////////
extern void * lzma_attribute((malloc))
lzma_alloc(size_t size, lzma_allocator *allocator)
{
// Some malloc() variants return NULL if called with size == 0.
if (size == 0)
size = 1;
void *ptr;
if (allocator != NULL && allocator->alloc != NULL)
ptr = allocator->alloc(allocator->opaque, 1, size);
else
ptr = malloc(size);
return ptr;
}
extern void
lzma_free(void *ptr, lzma_allocator *allocator)
{
if (allocator != NULL && allocator->free != NULL)
allocator->free(allocator->opaque, ptr);
else
free(ptr);
return;
}
//////////
// Misc //
//////////
extern size_t
lzma_bufcpy(const uint8_t *restrict in, size_t *restrict in_pos,
size_t in_size, uint8_t *restrict out,
size_t *restrict out_pos, size_t out_size)
{
const size_t in_avail = in_size - *in_pos;
const size_t out_avail = out_size - *out_pos;
const size_t copy_size = MIN(in_avail, out_avail);
memcpy(out + *out_pos, in + *in_pos, copy_size);
*in_pos += copy_size;
*out_pos += copy_size;
return copy_size;
}
extern lzma_ret
lzma_next_filter_init(lzma_next_coder *next, lzma_allocator *allocator,
const lzma_filter_info *filters)
{
lzma_next_coder_init(filters[0].init, next, allocator);
return filters[0].init == NULL
? LZMA_OK : filters[0].init(next, allocator, filters);
}
extern void
lzma_next_end(lzma_next_coder *next, lzma_allocator *allocator)
{
if (next->init != (uintptr_t)(NULL)) {
// To avoid tiny end functions that simply call
// lzma_free(coder, allocator), we allow leaving next->end
// NULL and call lzma_free() here.
if (next->end != NULL)
next->end(next->coder, allocator);
else
lzma_free(next->coder, allocator);
// Reset the variables so the we don't accidentally think
// that it is an already initialized coder.
*next = LZMA_NEXT_CODER_INIT;
}
return;
}
//////////////////////////////////////
// External to internal API wrapper //
//////////////////////////////////////
extern lzma_ret
lzma_strm_init(lzma_stream *strm)
{
if (strm == NULL)
return LZMA_PROG_ERROR;
if (strm->internal == NULL) {
strm->internal = lzma_alloc(sizeof(lzma_internal),
strm->allocator);
if (strm->internal == NULL)
return LZMA_MEM_ERROR;
strm->internal->next = LZMA_NEXT_CODER_INIT;
}
strm->internal->supported_actions[LZMA_RUN] = false;
strm->internal->supported_actions[LZMA_SYNC_FLUSH] = false;
strm->internal->supported_actions[LZMA_FULL_FLUSH] = false;
strm->internal->supported_actions[LZMA_FINISH] = false;
strm->internal->sequence = ISEQ_RUN;
strm->total_in = 0;
strm->total_out = 0;
return LZMA_OK;
}
extern LZMA_API(lzma_ret)
lzma_code(lzma_stream *strm, lzma_action action)
{
// Sanity checks
if ((strm->next_in == NULL && strm->avail_in != 0)
|| (strm->next_out == NULL && strm->avail_out != 0)
|| strm->internal == NULL
|| strm->internal->next.code == NULL
|| (unsigned int)(action) > LZMA_FINISH
|| !strm->internal->supported_actions[action])
return LZMA_PROG_ERROR;
switch (strm->internal->sequence) {
case ISEQ_RUN:
switch (action) {
case LZMA_RUN:
break;
case LZMA_SYNC_FLUSH:
strm->internal->sequence = ISEQ_SYNC_FLUSH;
break;
case LZMA_FULL_FLUSH:
strm->internal->sequence = ISEQ_FULL_FLUSH;
break;
case LZMA_FINISH:
strm->internal->sequence = ISEQ_FINISH;
break;
}
break;
case ISEQ_SYNC_FLUSH:
// The same action must be used until we return
// LZMA_STREAM_END, and the amount of input must not change.
if (action != LZMA_SYNC_FLUSH
|| strm->internal->avail_in != strm->avail_in)
return LZMA_PROG_ERROR;
break;
case ISEQ_FULL_FLUSH:
if (action != LZMA_FULL_FLUSH
|| strm->internal->avail_in != strm->avail_in)
return LZMA_PROG_ERROR;
break;
case ISEQ_FINISH:
if (action != LZMA_FINISH
|| strm->internal->avail_in != strm->avail_in)
return LZMA_PROG_ERROR;
break;
case ISEQ_END:
return LZMA_STREAM_END;
case ISEQ_ERROR:
default:
return LZMA_PROG_ERROR;
}
size_t in_pos = 0;
size_t out_pos = 0;
lzma_ret ret = strm->internal->next.code(
strm->internal->next.coder, strm->allocator,
strm->next_in, &in_pos, strm->avail_in,
strm->next_out, &out_pos, strm->avail_out, action);
strm->next_in += in_pos;
strm->avail_in -= in_pos;
strm->total_in += in_pos;
strm->next_out += out_pos;
strm->avail_out -= out_pos;
strm->total_out += out_pos;
strm->internal->avail_in = strm->avail_in;
switch (ret) {
case LZMA_OK:
// Don't return LZMA_BUF_ERROR when it happens the first time.
// This is to avoid returning LZMA_BUF_ERROR when avail_out
// was zero but still there was no more data left to written
// to next_out.
if (out_pos == 0 && in_pos == 0) {
if (strm->internal->allow_buf_error)
ret = LZMA_BUF_ERROR;
else
strm->internal->allow_buf_error = true;
} else {
strm->internal->allow_buf_error = false;
}
break;
case LZMA_STREAM_END:
if (strm->internal->sequence == ISEQ_SYNC_FLUSH
|| strm->internal->sequence == ISEQ_FULL_FLUSH)
strm->internal->sequence = ISEQ_RUN;
else
strm->internal->sequence = ISEQ_END;
// Fall through
case LZMA_NO_CHECK:
case LZMA_UNSUPPORTED_CHECK:
case LZMA_GET_CHECK:
case LZMA_MEMLIMIT_ERROR:
// Something else than LZMA_OK, but not a fatal error,
// that is, coding may be continued (except if ISEQ_END).
strm->internal->allow_buf_error = false;
break;
default:
// All the other errors are fatal; coding cannot be continued.
assert(ret != LZMA_BUF_ERROR);
strm->internal->sequence = ISEQ_ERROR;
break;
}
return ret;
}
extern LZMA_API(void)
lzma_end(lzma_stream *strm)
{
if (strm != NULL && strm->internal != NULL) {
lzma_next_end(&strm->internal->next, strm->allocator);
lzma_free(strm->internal, strm->allocator);
strm->internal = NULL;
}
return;
}
extern LZMA_API(lzma_check)
lzma_get_check(const lzma_stream *strm)
{
// Return LZMA_CHECK_NONE if we cannot know the check type.
// It's a bug in the application if this happens.
if (strm->internal->next.get_check == NULL)
return LZMA_CHECK_NONE;
return strm->internal->next.get_check(strm->internal->next.coder);
}
extern LZMA_API(uint64_t)
lzma_memusage(const lzma_stream *strm)
{
uint64_t memusage;
uint64_t old_memlimit;
if (strm == NULL || strm->internal == NULL
|| strm->internal->next.memconfig == NULL
|| strm->internal->next.memconfig(
strm->internal->next.coder,
&memusage, &old_memlimit, 0) != LZMA_OK)
return 0;
return memusage;
}
extern LZMA_API(uint64_t)
lzma_memlimit_get(const lzma_stream *strm)
{
uint64_t old_memlimit;
uint64_t memusage;
if (strm == NULL || strm->internal == NULL
|| strm->internal->next.memconfig == NULL
|| strm->internal->next.memconfig(
strm->internal->next.coder,
&memusage, &old_memlimit, 0) != LZMA_OK)
return 0;
return old_memlimit;
}
extern LZMA_API(lzma_ret)
lzma_memlimit_set(lzma_stream *strm, uint64_t new_memlimit)
{
// Dummy variables to simplify memconfig functions
uint64_t old_memlimit;
uint64_t memusage;
if (strm == NULL || strm->internal == NULL
|| strm->internal->next.memconfig == NULL)
return LZMA_PROG_ERROR;
if (new_memlimit != 0 && new_memlimit < LZMA_MEMUSAGE_BASE)
return LZMA_MEMLIMIT_ERROR;
return strm->internal->next.memconfig(strm->internal->next.coder,
&memusage, &old_memlimit, new_memlimit);
}
``` |
Johnny Hazard is an action-adventure comic strip created by cartoonist Frank Robbins for King Features Syndicate. It was published from June 5, 1944, until August 20, 1977, with separate storylines for the daily strip and the Sunday strip.
Day before D-Day
After work in advertising, Robbins took over the daily strip Scorchy Smith from Noel Sickles in 1939 with a Sunday page added in 1940. King Features then asked Robbins to do Secret Agent X-9, but Robbins instead chose to devise an aviation comic for the syndicate, and Johnny Hazard was launched on Monday, June 5, 1944, one day before D-Day. While working on the strip during the 1940s, Robbins contributed illustrations to Life, Look, The Saturday Evening Post and other magazines. Robbins stopped drawing Johnny Hazard in 1977 and retired to Mexico in order to devote himself to painting full-time.
Characters and story
The strip followed the globe-trotting adventures of aviator Johnny Hazard, initially as a member of the United States Army Air Corps in World War II, later as a Cold War secret agent. Comics historian Don Markstein described the transition:
As the story opened, Johnny, like most American men of his generation, was fighting World War II. But his gig with the Army Air Corps didn't last long, as D-Day came when the strip was only a day old. But the only effect civilian life had on him was to enlarge the scope of his adventures—as a freelance pilot, Johnny ranged throughout the entire world. (An early focus, tho, was China, putting him head-to-head with the rival Chicago Tribune Syndicate's Terry and the Pirates.) Johnny dealt with spies, beautiful women, smugglers, gorgeous dames, sci-fi style menaces, fabulous chicks and all the other kinds of folks a two-fisted adventurer of his calibre would be expected to deal with. As he did, unlike many fictional two-fisted adventurers, he matured—not as quickly as real people, but after a third of a century or so, he was quite gray at the temples. And a third of a century was as long as the strip ran. It was popular enough at first, and ran far longer than most post-war adventure strips, but the times were against it. Newspaper editors were more interested in daily gags than continuous stories, and Johnny Hazard succumbed to the trend in 1977.
International Distribution
Johnny Hazard was reprinted in the British comic Rocket during the 1950s. The strip was also translated into nine other languages, and was widely published in Western European newspapers.
Reception
According to biographer Mark Evanier, Jack Kirby expressed admiration for Johnny Hazard. Comics historian Ron Goulart described Johnny Hazard as "an impressively drawn and scripted feature."
Reprints
Robbins' Johnny Hazard comic book was published by Standard Comics from August 1948 to May 1949. The Sunday strips were reprinted in a full-color volume published by the Pacific Comics Club. Other reprints were published by Pioneer Comics and Dragon Lady Press.
In 2011, Hermes Press announced a hardcover archive reprint series, with separate volumes for daily and Sunday strips.
Archives
The Frank Robbins collection at Syracuse University has 1090 original Johnny Hazard strips, consisting of 934 daily strips and 156 Sunday strips.
1963–66 story arcs
Daily strip continuities
"Wheel and Deal" (4 Feb 1963 – 27 Apr 1963)
"My Son the Millionaire" (29 Apr 1963 – 20 Jul 1963)
"The Mink-Lined Nest" (23 Jul 1963 – 12 Oct 1963)
"Mysterious Friend" (14 Oct 1963 – 4 Jan 1964)
"A Gift for Florian" (6 Jan 1964 – 28 Mar 1964)
"Extortion Inc." (30 Mar 1964 – 27 Jun 1964)
"Traders in Death" (29 Jun 1964 – 19 Sep 1964)
"Alphabet Soup" (21 Sep 1964 – 26 Dec 1964)
"Operation Beardles" (28 Dec 1964 – 20 Mar 1965)
"Tell It to Telstar" (22 Mar 1965 – 29 May 1965)
"Operation Trojan Horse" (30 Aug 1965 – 20 Nov 1965)
"Rescue Inc." (22 Nov 1965 – 19 Feb 1966)
"The Many Faces of Henry Clay" (21 Feb 1966 – 21 Mar 1966)
Sunday strip continuities
"Capone Squadron" (6 Jan 1963 – 13 Jan 1963)
"Operation Bodyguard" (20 Jan 1963 – 5 May 1963)
"The Diamond Mountain" (12 May 1963 – 25 Aug 1963)
"Disaster Area" (1 Sep 1963 – 8 Dec 1963)
"Head-Locked Secret" (15 Dec 1963 – 22 Mar 1964)
"Sentimental Journey" (5 April 1964 – 19 Jul 1964)
"Fatal Lure" (26 Jul 1964 – 8 Nov 1964)
"Commando Isle" (15 Nov 1964 – 7 Mar 1965)
"Tea for Two?" (14 Mar 1965 – 20 Jun 1965)
"The Big Gamble" (4 Jul 1965 – 3 Oct 1965)
"Cargo Cult" (17 Oct 1965 – 30 Jan 1966)
"The Kono Affair" (6 Feb 1966 – 27 Feb 1966)
References
External links
Around in Europe with Johnny Hazard
Comiclopedia: Johnny Hazard
Johnny Hazard Flying Toy Airplane
1944 comics debuts
1977 comics endings
Adventure comic strips
Hazard, Johnny
American comic strips
Aviation comics
Characters created by Frank Robbins
Hazard, Johnny
Hazard, Johnny
Fictional United States Army personnel
Hazard, Johnny
Comics set during World War II
Comics about Nazi Germany |
Terror Night (also known as Bloody Movie) is a 1987 American slasher film directed by Nick Marino.
Plot
When a group of kids sneak into the dilapidated, apparently-abandoned mansion of vanished silent film star Lance Hayward, they are methodically killed off by the psychotic actor, who dons costumes from his classic film roles for each murder.
Cast
John Ireland - Lance Hayward
Cameron Mitchell - Detective Sanders
Alan Hale Jr. - Jake Nelson
Staci Greason - Kathy
William Butler - Chip
Michelle Bauer - Jo
Timothy Elwell - Angel
Carla Baron - Lorraine
Ken Abraham - Greg
Aldo Ray - Captain Ned
Dan Haggerty - Ted Michaels
Production
While producer Nick Marino is credited as the director, numerous cast and crew members assert that several uncredited directors worked on the film, including Fred Lincoln and Andre DeToth (the latter of whom had not officially directed a film for almost 20 years). Several accounts claim that DeToth convinced veteran actors John Ireland and Cameron Mitchell to join the cast, and shot the scenes they appear in after the majority of principal photography had been completed. DeToth wore a neckbrace during shooting, after suffering an injury.
One shooting location was an estate which had once belonged to Errol Flynn.
Release
Although filming was completed in 1987, no record appears to exist of the film having an official release until 2004, when Fred Olen Ray's Retromedia put it on DVD under the title Bloody Movie. A Legacy Entertainment release from 2005 uses the film's original title.
Critical reception
Allmovie called the film a "substandard horror film" and that "the real fun to be had in Terror Night is its virtually limitless source of bizarre trivia for dedicated exploitation buffs." DVD Talk's Daniel W. Kelly wrote, "With a storyline revolving around vintage movies and appearances by some recognizable has-beens, the film has more of a camp quality than horror. It's not the worst of the genre, but it's not the best. It's a bit simple and unexciting."
References
External links
1987 films
American slasher films
1987 horror films
1980s slasher films
1980s English-language films
1980s American films |
Spine is a biweekly peer-reviewed medical journal covering research in the field of orthopaedics, especially concerning the spine. It was established in 1976 and is published by Lippincott Williams & Wilkins. The current editor-in-chief is Andrew J. Schoenfeld, M.D.. Spine is considered the leading orthopaedic journal covering cutting-edge spine research. Spine is available in print and online. Spine is considered the most cited journal in orthopaedics.
Affiliated societies
The following societies are affiliated with Spine:
References
External links
Biweekly journals
Lippincott Williams & Wilkins academic journals
Academic journals established in 1976
English-language journals
Orthopedics journals |
The Police Benevolent Association of the City of New York (PBA) is the largest police union representing police officers of the New York City Police Department. It represents about 24,000 of the department's 36,000 officers.
The PBA was originally called the Patrolmen's Benevolent Association. On January 14, 2019, it changed its name to the gender-neutral Police Benevolent Association of the City of New York.
History
As a benevolent or fraternal organization, the New York City's Patrolmen's Benevolent Association was founded in 1892. In 1901, it advocated for and received 8-hour workdays. In 1967, New York State passed the Taylor Law, which sets the rules for municipal union organization with regard to representation and bargaining. New York City set up the Office of Collective Bargaining for municipal union demands.
Lindsay Administration
The PBA was successful in its campaign to defeat Mayor John Lindsay's proposed Civilian Complaint Review Board in 1967.
After a SBA (NYPD Sergeants Benevolent Association) lawsuit which was expected to succeed failed, officers who had been expecting a favorable settlement began a wildcat strike. This unplanned police strike of 1971 was in violation of the Taylor Act which prohibits police from engaging in job actions. The PBA publicly disavowed the strike.
In 1973, New York City began assigning female police officers to work street patrols. The association was opposed to the change, claiming women lacked the physical strength needed to back up male officers.
Koch Administration
In January 1978, Mayor Ed Koch prohibited city agencies from discrimination on the basis of sexual orientation. Samuel DeMilia, then the president of the association, explained in an article in The New York Times that the order was "unworkable in the police department and can do more harm than good."
Dinkins Administration
In September 1992, the Patrolmen's Benevolent Association organized a rally of thousands of police officers who blocked the Brooklyn Bridge to protest police oversight proposed by Mayor David Dinkins. Other uniformed officers jumped over police barricades to rush City Hall. Some were openly drinking, damaging cars, and physically attacking journalists from The New York Times on the scene. On-duty officers did little to control the riot.
Giuliani Administration
The PBA's relations with Mayor Rudy Giuliani (mayoralty, 1994–2001) were marked by years of labor disputes.
In 1997, it led a campaign asking Giuliani not to attend the funerals of city officers killed on duty.
The PBA urged members to resist the mayor's incentive pay initiative in 1998. Additionally, in a five-year contract, officers were subject to a two-year freeze on salaries before seeing salaries increased 13 percent during the last years of the Giuliani tenure.
During November 2007, in anticipation of the 2008 presidential election, PBA president Patrick Lynch criticized the relationship between Giuliani and the NYPD. He said that the union would not endorse Giuliani. He criticized the mayor on pay issues, saying, "The inability to keep veteran cops on the job or to recruit adequate numbers of new ones can be traced directly back to the Giuliani mayoralty." He added, "While the city was rolling in money, the Giuliani administration cried future poverty and stuck New York police officers with three and half years without a pay raise." Lynch further asserted that "Rudy Giuliani has no real credentials as a terrorism fighter."
September 11th
Many officers perished at the Twin Towers during the September 11, 2001 attacks in Lower Manhattan. In the course of their work shifts, scores more were exposed to toxins—produced by the collapse of the Twin Towers during the rescue and recovery effort after the September 11, 2001 attacks at Ground Zero. Surviving first responders and their advocates are asserting that their illnesses resulted from exposure to toxins at Ground Zero.
The PBA filed a lawsuit to secure benefits for Officer Christopher Hynes (then aged 36). In March 2004, he was diagnosed as having sarcoidosis. Despite the diagnosis, the NYPD refused to grant line-of-duty injury status to him. Hynes had worked for a total of 111 hours at Ground Zero and its vicinity. He has claimed that he was never given a proper respirator for his work at Ground Zero. He has had difficulty in paying medical bills because of the denial of line-of-duty status. The PBA noted that firefighters, by contrast, have been given line-of-duty status for illnesses traced back to working at Ground Zero.
de Blasio Administration
Following NYC Mayor Bill de Blasio's election in 2013, running largely on a political campaign advocating for reform in publicly unpopular NYPD policies, including "Stop and Frisk", the PBA began actively organizing against de Blasio, accusing him of failing to support the NYPD, as these policies were heavily promoted by previous mayoral administrations to prevent violent crime. Prior to these policies being instated, the city was suffering from a crime epidemic which promoted the aggressive "Stop and Frisk" policy under the Bloomberg administration. This was a shift from a mildly successful movement towards community policing under the Giuliani administration. The PBA felt that their officers were being wrongly blamed for the failed change of policies by politicians, rather than being supported in transitioning to a new form of policing by the de Blasio administration.
Following the killing of two NYPD officers in Brooklyn on December 20, 2014, in an execution-style shooting, the PBA's opposition to de Blasio reached an all-time high, with PBA President Patrick Lynch accusing Mayor de Blasio of having blood on his hands, and of encouraging violence against police and acting like the leader of a "f-ing revolution." Further, the PBA asked members to sign letters ordering the Mayor not to attend their funerals, should they perish in the line of duty. They felt that if the Mayor were to attend their funerals it would be out of political motivation rather than a sincere appreciation of their sacrifice to protect the citizens of New York City. Lynch urged the police to stick close to the rules to protect themselves.
Lynch's comments were much criticized by supporters of Mayor de Blasio. Many feared Lynch's comments would further inflame the more radical elements of his opposition, serve to incite further acts of violence against the NYPD, and lead to further police abuses carried out as a result of the "wartime" posture.
On January 31, 2017, the city and the union reached an agreement on a new contract. If ratified by the union members, the contract called for an 11% pay increase for police officers on the force and cuts to officers hired in the future.
In March 2020 NYC Health Commissioner Oxiris Barbot denied a New York Police Department (NYPD) request for 500,000 additional surgical masks in priority over other departments. She told NYPD Chief of Department Terence Monahan during the heated dispute that “I don’t give two rats’ asses about your cops.” The Police Benevolent Association of the City of New York called for her to fired. Barbot later apologized.
Eric Garner's death
PBA president Patrick Lynch blamed the killing of Eric Garner by policeman Daniel Pantaleo on Garner's resistance to arrest. New York Police Department Administrative Judge Rosemarie Maldonado would eventually find that video evidence and autopsy results provided "'overwhelming'" evidence that Pantaleo had placed Garner in a chokehold. In her recommendation to the Commissioner, Judge Maldonado found that Pantaleo's "'use of a chokehold fell so far short of objective reasonableness that this tribunal found it to be reckless — a gross deviation from the standard of conduct established for a New York City police officer.'"
Shake Shack incident
In June 2020, three policemen from the Bronx were on duty because of civil unrest in Manhattan. They ordered milkshakes from a nearby Shake Shack using a phone app. They picked up their order, but became suspicious of how the milkshakes tasted. The manager apologized and gave them coupons for free food. The police officers left and later reported the incident. This led to an investigation that determined there was no foul play.
The Police Benevolent Association president Patrick Lynch stated that the police officers had come “under attack” from a “toxic substance, believed to be bleach.” The association later retracted their comments and deleted their online posts.
Endorsement of Donald Trump
On August 18, 2020, Lynch and the PBA endorsed Donald Trump for President in the 2020 United States presidential election. Lynch appeared at the Republican National Convention to praise Trump. Lynch had not conferred with the PBA before endorsing Trump on the union's behalf.
Adams Administration
After the COVID-19 vaccine mandate for city employees was repealed, the PBA called for officers that were dismissed for noncompliance to be rehired and given back pay.
PBA Cards
The PBA issues cards to its officers that read “The bearer of this card is a supporter of the PBA, and you should try to extend every courtesy possible.” Prior to 2018, officers were allowed to receive a maximum of thirty cards and retired officers a maximum of twenty; this has since been reduced to twenty and ten, respectively. Sometimes referred to as "get out of jail free cards" or "courtesy cards," they are officially given out as a "public relations tool" which do not provide immunity from arrest. Citizens that claim to have used them say the cards have allowed them to avoid punishment for offenses. Other New York City police unions also issue cards, including the Detectives Endowment Association and the Sergeants Benevolent Association.
See also
Detectives' Endowment Association
Health effects arising from the September 11, 2001 attacks
Sergeants Benevolent Association
References
External links
New York City Police Department
Police unions in the United States
Trade unions established in 1892
Law enforcement in New York City
Organizations based in New York City
1892 establishments in New York (state)
Trade unions in New York (state) |
Mahawadiya is a village in the Bhopal district of Madhya Pradesh, India. It is located in the Huzur tehsil and the Phanda block.
Demographics
According to the 2011 census of India, Mahawadiya has 247 households. The effective literacy rate (i.e. the literacy rate of population excluding children aged 6 and below) is 49.47%.
References
Villages in Huzur tehsil |
The Square of Russia (also known as Russian Square or Russia Square) is a square in Yerevan, Armenia. It is located in Grigori Lusavorich and Argishti Streets. Armenian President Serzh Sargsyan and Russian President Dmitry Medvedev took part in the opening ceremony. It is located near Alexander Myasnikyan square. The City Hall and the House of Moscow are located the square.
In the immediate vicinity of the square is also the Embassy of Russia in Armenia. In November 2022, during the visit of Vladimir Putin to Yerevan, demonstration on Russia Square protesting the 2022 Russian Invasion of Ukraine and the lack of intervention of the CSTO in the September 2022 Armenia–Azerbaijan clashes took place.
See also
List of squares in Yerevan
References
Tourist attractions in Yerevan
Squares in Yerevan |
The Collegiate Church of Saint-Vulfran () is a collegiate church located in Abbeville, France. The church, dedicated to Saint Vulfran is of Flamboyant Gothic style.
History
The construction of the church was started on 7 June 1488. From 31 August it was clear that funding would be an issue and thus the construction was ceased for some time. On 4 April 1520 Jean Crétel of Tours-en-Vimeu was commissioned to lead the work. The nave would be under construction until 1539. Construction resumed 120 years later when the choir was built in two years, from 1661 to 1663 in a more simplified style.
As the French Revolution took place, the church became a Temple of Reason and a feast was celebrated in honor of the Supreme Being on 8 June 1794. Catholic worship in the church resumed in 1803. The church was listed as a Monument historique in 1840.
Damages during World War II
The church was heavily damaged on 20 May 1940 by German bombings as part of the Battle of France in World War II. The restoration of the church was not completed until 1998.
References
Roman Catholic churches completed in 1663
17th-century churches in France
Collegiate churches in France
Abbeville |
Matthew Corbett (born 28 March 1948) born as Peter Graham Corbett, is an English former actor, singer, comedian, magician, puppeteer, television presenter, and writer, best known for presenting The Sooty Show and later Sooty and Co.
He is the son of Sooty's creator, Harry Corbett, and took over the show from his father in 1976. He retired in 1998.
Career
Corbett was born in Guiseley, West Riding of Yorkshire, on 28 March 1948. In the late 1960s he had to choose another name when joining the performing arts trade union Equity, as there was already a Peter Corbett registered. He kept his surname and chose to go by the first name Matthew, retaining the name throughout his television career.
Corbett appeared in the Doctor Who serial The Dæmons (1971) as a character called Jones and was a regular performer in the Thames Television children's show Rainbow, where he sang and performed and wrote with Rod Burton and Jane Tucker as Rod, Matt and Jane, later on known as Rod, Jane and Roger and finally being better known as Rod, Jane and Freddy.
In 1976, Corbett left Rainbow to take over The Sooty Show from his father Harry, who was retiring (he made a special guest appearance on Rainbow with Sooty in the episodes "1000th Birthday Party" and "The VIP"). Corbett retired in 1998 after 22 years, and chose Richard Cadell to replace him.
In January 2008, he reappeared on television, presenting Locks and Quays, a regional interest programme shown in the ITV Granada area (North West England), featuring a journey from the east to the west coast of England, along waterways such as the Humber estuary, the Aire and Calder Navigation and the Leeds and Liverpool Canal.
On Sooty's 60th birthday in 2012, he said that the bear was "in, or should I say on, the right hands".
Personal life
Corbett's great-uncle was the fish and chip shop chain owner Harry Ramsden, as revealed on Locks and Quays.
Corbett contracted COVID-19 in 2020. He nearly died from the disease, after contracted pneumionia , which led to atrial fibrillation and had to spend 10 days in intensive care.
As of 2020, he stated he and his wife planned to reside in a retirement village in Horsham, West Sussex.
Corbett has a brother, David Corbett
Filmography
References
Further reading
Tibballs, Geoff (1990). The Secret Life of Sooty. Letchworth, UK: Ringpress Books. .
External links
1948 births
British magicians
British male comedians
British male singers
British male television actors
British male writers
British puppeteers
English magicians
English male comedians
English male singers
English male television actors
English male writers
English puppeteers
English television presenters
Living people
People from Guiseley
Sooty
Comedians from Yorkshire |
```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
* X-Face common data and utilities definition.
*/
#include "libavutil/avassert.h"
#include "xface.h"
void ff_big_add(BigInt *b, uint8_t a)
{
int i;
uint8_t *w;
uint16_t c;
a &= XFACE_WORDMASK;
if (a == 0)
return;
w = b->words;
c = a;
for (i = 0; i < b->nb_words && c; i++) {
c += *w;
*w++ = c & XFACE_WORDMASK;
c >>= XFACE_BITSPERWORD;
}
if (i == b->nb_words && c) {
av_assert0(b->nb_words < XFACE_MAX_WORDS);
b->nb_words++;
*w = c & XFACE_WORDMASK;
}
}
void ff_big_div(BigInt *b, uint8_t a, uint8_t *r)
{
int i;
uint8_t *w;
uint16_t c, d;
a &= XFACE_WORDMASK;
if (a == 1 || b->nb_words == 0) {
*r = 0;
return;
}
/* treat this as a == WORDCARRY and just shift everything right a WORD */
if (a == 0) {
i = --b->nb_words;
w = b->words;
*r = *w;
while (i--) {
*w = *(w + 1);
w++;
}
*w = 0;
return;
}
i = b->nb_words;
w = b->words + i;
c = 0;
while (i--) {
c <<= XFACE_BITSPERWORD;
c += *--w;
d = c / (uint16_t)a;
c = c % (uint16_t)a;
*w = d & XFACE_WORDMASK;
}
*r = c;
if (b->words[b->nb_words - 1] == 0)
b->nb_words--;
}
void ff_big_mul(BigInt *b, uint8_t a)
{
int i;
uint8_t *w;
uint16_t c;
a &= XFACE_WORDMASK;
if (a == 1 || b->nb_words == 0)
return;
if (a == 0) {
/* treat this as a == WORDCARRY and just shift everything left a WORD */
av_assert0(b->nb_words < XFACE_MAX_WORDS);
i = b->nb_words++;
w = b->words + i;
while (i--) {
*w = *(w - 1);
w--;
}
*w = 0;
return;
}
i = b->nb_words;
w = b->words;
c = 0;
while (i--) {
c += (uint16_t)*w * (uint16_t)a;
*(w++) = c & XFACE_WORDMASK;
c >>= XFACE_BITSPERWORD;
}
if (c) {
av_assert0(b->nb_words < XFACE_MAX_WORDS);
b->nb_words++;
*w = c & XFACE_WORDMASK;
}
}
const ProbRange ff_xface_probranges_per_level[4][3] = {
// black grey white
{ { 1, 255}, {251, 0}, { 4, 251} }, /* Top of tree almost always grey */
{ { 1, 255}, {200, 0}, { 55, 200} },
{ { 33, 223}, {159, 0}, { 64, 159} },
{ {131, 0}, { 0, 0}, {125, 131} }, /* Grey disallowed at bottom */
};
const ProbRange ff_xface_probranges_2x2[16] = {
{ 0, 0}, {38, 0}, {38, 38}, {13, 152},
{38, 76}, {13, 165}, {13, 178}, { 6, 230},
{38, 114}, {13, 191}, {13, 204}, { 6, 236},
{13, 217}, { 6, 242}, { 5, 248}, { 3, 253},
};
/*
* The "guess the next pixel" tables follow. Normally there are 12
* neighbour pixels used to give 1<<12 cases as we get closer to the
* upper left corner lesser numbers of neighbours are available.
*
* Each byte in the tables represents 8 boolean values starting from
* the most significant bit.
*/
static const uint8_t g_00[] = {
0x00, 0x00, 0x01, 0x01, 0x00, 0x00, 0xe3, 0xdf, 0x05, 0x17,
0x05, 0x0f, 0x00, 0x1b, 0x0f, 0xdf, 0x00, 0x04, 0x00, 0x00,
0x0d, 0x0f, 0x03, 0x7f, 0x00, 0x00, 0x00, 0x01, 0x00, 0x1d,
0x45, 0x2f, 0x00, 0x00, 0x00, 0x0d, 0x00, 0x0a, 0xff, 0xff,
0x00, 0x04, 0x00, 0x05, 0x01, 0x3f, 0xcf, 0xff, 0x10, 0x01,
0x80, 0xc9, 0x0f, 0x0f, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00,
0x1b, 0x1f, 0xff, 0xff, 0x4f, 0x54, 0x07, 0x1f, 0x57, 0x47,
0xd7, 0x3d, 0xff, 0xff, 0x5f, 0x1f, 0x7f, 0xff, 0x7f, 0x7f,
0x05, 0x0f, 0x01, 0x0f, 0x0f, 0x5f, 0x9b, 0xdf, 0x7f, 0xff,
0x5f, 0x1d, 0x5f, 0xff, 0x0f, 0x1f, 0x0f, 0x5f, 0x03, 0x1f,
0x4f, 0x5f, 0xf7, 0x7f, 0x7f, 0xff, 0x0d, 0x0f, 0xfb, 0xff,
0xf7, 0xbf, 0x0f, 0x4f, 0xd7, 0x3f, 0x4f, 0x7f, 0xff, 0xff,
0x67, 0xbf, 0x56, 0x25, 0x1f, 0x7f, 0x9f, 0xff, 0x00, 0x00,
0x00, 0x05, 0x5f, 0x7f, 0x01, 0xdf, 0x14, 0x00, 0x05, 0x0f,
0x07, 0xa2, 0x09, 0x0f, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x5f,
0x18, 0xd7, 0x94, 0x71, 0x00, 0x05, 0x1f, 0xb7, 0x0c, 0x07,
0x0f, 0x0f, 0x00, 0x0f, 0x0f, 0x1f, 0x84, 0x8f, 0x05, 0x15,
0x05, 0x0f, 0x4f, 0xff, 0x87, 0xdf, 0x05, 0x01, 0x10, 0x00,
0x0f, 0x0f, 0x00, 0x08, 0x05, 0x04, 0x04, 0x01, 0x4f, 0xff,
0x9f, 0x8f, 0x4a, 0x40, 0x5f, 0x5f, 0xff, 0xfe, 0xdf, 0xff,
0x7f, 0xf7, 0xff, 0x7f, 0xff, 0xff, 0x7b, 0xff, 0x0f, 0xfd,
0xd7, 0x5f, 0x4f, 0x7f, 0x7f, 0xdf, 0xff, 0xff, 0xff, 0xff,
0xff, 0x77, 0xdf, 0x7f, 0x4f, 0xef, 0xff, 0xff, 0x77, 0xff,
0xff, 0xff, 0x6f, 0xff, 0x0f, 0x4f, 0xff, 0xff, 0x9d, 0xff,
0x0f, 0xef, 0xff, 0xdf, 0x6f, 0xff, 0xff, 0xff, 0x4f, 0xff,
0xcd, 0x0f, 0x4f, 0xff, 0xff, 0xdf, 0x00, 0x00, 0x00, 0x0b,
0x05, 0x02, 0x02, 0x0f, 0x04, 0x00, 0x00, 0x0c, 0x01, 0x06,
0x00, 0x0f, 0x20, 0x03, 0x00, 0x00, 0x05, 0x0f, 0x40, 0x08,
0x00, 0x00, 0x00, 0x01, 0x00, 0x01, 0x0c, 0x0f, 0x01, 0x00,
0x80, 0x00, 0x00, 0x00, 0x80, 0x00, 0x00, 0x14, 0x01, 0x05,
0x01, 0x15, 0xaf, 0x0f, 0x00, 0x01, 0x10, 0x00, 0x08, 0x00,
0x46, 0x0c, 0x20, 0x00, 0x88, 0x00, 0x0f, 0x15, 0xff, 0xdf,
0x02, 0x00, 0x00, 0x0f, 0x7f, 0x5f, 0xdb, 0xff, 0x4f, 0x3e,
0x05, 0x0f, 0x7f, 0xf7, 0x95, 0x4f, 0x0d, 0x0f, 0x01, 0x0f,
0x4f, 0x5f, 0x9f, 0xdf, 0x25, 0x0e, 0x0d, 0x0d, 0x4f, 0x7f,
0x8f, 0x0f, 0x0f, 0xfa, 0x04, 0x4f, 0x4f, 0xff, 0xf7, 0x77,
0x47, 0xed, 0x05, 0x0f, 0xff, 0xff, 0xdf, 0xff, 0x4f, 0x6f,
0xd8, 0x5f, 0x0f, 0x7f, 0xdf, 0x5f, 0x07, 0x0f, 0x94, 0x0d,
0x1f, 0xff, 0xff, 0xff, 0x00, 0x02, 0x00, 0x03, 0x46, 0x57,
0x01, 0x0d, 0x01, 0x08, 0x01, 0x0f, 0x47, 0x6c, 0x0d, 0x0f,
0x02, 0x00, 0x00, 0x00, 0x0b, 0x4f, 0x00, 0x08, 0x05, 0x00,
0x95, 0x01, 0x0f, 0x7f, 0x0c, 0x0f, 0x01, 0x0e, 0x00, 0x00,
0x0f, 0x41, 0x00, 0x00, 0x04, 0x24, 0x0d, 0x0f, 0x0f, 0x7f,
0xcf, 0xdf, 0x00, 0x00, 0x00, 0x00, 0x04, 0x40, 0x00, 0x00,
0x06, 0x26, 0xcf, 0x05, 0xcf, 0x7f, 0xdf, 0xdf, 0x00, 0x00,
0x17, 0x5f, 0xff, 0xfd, 0xff, 0xff, 0x46, 0x09, 0x4f, 0x5f,
0x7f, 0xfd, 0xdf, 0xff, 0x0a, 0x88, 0xa7, 0x7f, 0x7f, 0xff,
0xff, 0xff, 0x0f, 0x04, 0xdf, 0x7f, 0x4f, 0xff, 0x9f, 0xff,
0x0e, 0xe6, 0xdf, 0xff, 0x7f, 0xff, 0xff, 0xff, 0x0f, 0xec,
0x8f, 0x4f, 0x7f, 0xff, 0xdf, 0xff, 0x0f, 0xcf, 0xdf, 0xff,
0x6f, 0x7f, 0xff, 0xff, 0x03, 0x0c, 0x9d, 0x0f, 0x7f, 0xff,
0xff, 0xff,
};
static const uint8_t g_01[] = {
0x37, 0x73, 0x00, 0x19, 0x57, 0x7f, 0xf5, 0xfb, 0x70, 0x33,
0xf0, 0xf9, 0x7f, 0xff, 0xff, 0xff,
};
static const uint8_t g_02[] = {
0x50,
};
static const uint8_t g_10[] = {
0x00, 0x00, 0x00, 0x00, 0x50, 0x00, 0xf3, 0x5f, 0x84, 0x04,
0x17, 0x9f, 0x04, 0x23, 0x05, 0xff, 0x00, 0x00, 0x00, 0x02,
0x03, 0x03, 0x33, 0xd7, 0x05, 0x03, 0x5f, 0x3f, 0x17, 0x33,
0xff, 0xff, 0x00, 0x80, 0x02, 0x04, 0x12, 0x00, 0x11, 0x57,
0x05, 0x25, 0x05, 0x03, 0x35, 0xbf, 0x9f, 0xff, 0x07, 0x6f,
0x20, 0x40, 0x17, 0x06, 0xfa, 0xe8, 0x01, 0x07, 0x1f, 0x9f,
0x1f, 0xff, 0xff, 0xff,
};
static const uint8_t g_20[] = {
0x04, 0x00, 0x01, 0x01, 0x43, 0x2e, 0xff, 0x3f,
};
static const uint8_t g_30[] = {
0x11, 0x11, 0x11, 0x11, 0x51, 0x11, 0x13, 0x11, 0x11, 0x11,
0x13, 0x11, 0x11, 0x11, 0x33, 0x11, 0x13, 0x11, 0x13, 0x13,
0x13, 0x13, 0x31, 0x31, 0x11, 0x01, 0x11, 0x11, 0x71, 0x11,
0x11, 0x75,
};
static const uint8_t g_40[] = {
0x00, 0x0f, 0x00, 0x09, 0x00, 0x0d, 0x00, 0x0d, 0x00, 0x0f,
0x00, 0x4e, 0xe4, 0x0d, 0x10, 0x0f, 0x00, 0x0f, 0x44, 0x4f,
0x00, 0x1e, 0x0f, 0x0f, 0xae, 0xaf, 0x45, 0x7f, 0xef, 0xff,
0x0f, 0xff, 0x00, 0x09, 0x01, 0x11, 0x00, 0x01, 0x1c, 0xdd,
0x00, 0x15, 0x00, 0xff, 0x00, 0x10, 0x00, 0xfd, 0x00, 0x0f,
0x4f, 0x5f, 0x3d, 0xff, 0xff, 0xff, 0x4f, 0xff, 0x1c, 0xff,
0xdf, 0xff, 0x8f, 0xff, 0x00, 0x0d, 0x00, 0x00, 0x00, 0x15,
0x01, 0x07, 0x00, 0x01, 0x02, 0x1f, 0x01, 0x11, 0x05, 0x7f,
0x00, 0x1f, 0x41, 0x57, 0x1f, 0xff, 0x05, 0x77, 0x0d, 0x5f,
0x4d, 0xff, 0x4f, 0xff, 0x0f, 0xff, 0x00, 0x00, 0x02, 0x05,
0x00, 0x11, 0x05, 0x7d, 0x10, 0x15, 0x2f, 0xff, 0x40, 0x50,
0x0d, 0xfd, 0x04, 0x0f, 0x07, 0x1f, 0x07, 0x7f, 0x0f, 0xbf,
0x0d, 0x7f, 0x0f, 0xff, 0x4d, 0x7d, 0x0f, 0xff,
};
static const uint8_t g_11[] = {
0x01, 0x13, 0x03, 0x7f,
};
static const uint8_t g_21[] = {
0x17,
};
static const uint8_t g_31[] = {
0x55, 0x57, 0x57, 0x7f,
};
static const uint8_t g_41[] = {
0x01, 0x01, 0x01, 0x1f, 0x03, 0x1f, 0x3f, 0xff,
};
static const uint8_t g_12[] = {
0x40,
};
static const uint8_t g_22[] = {
0x00,
};
static const uint8_t g_32[] = {
0x10,
};
static const uint8_t g_42[] = {
0x10,
};
void ff_xface_generate_face(uint8_t *dst, uint8_t * const src)
{
int h, i, j, k, l, m;
for (j = 0; j < XFACE_HEIGHT; j++) {
for (i = 0; i < XFACE_WIDTH; i++) {
h = i + j * XFACE_WIDTH;
k = 0;
/*
Compute k, encoding the bits *before* the current one, contained in the
image buffer. That is, given the grid:
l i
| |
v v
+--+--+--+--+--+
m -> | 1| 2| 3| 4| 5|
+--+--+--+--+--+
| 6| 7| 8| 9|10|
+--+--+--+--+--+
j -> |11|12| *| | |
+--+--+--+--+--+
the value k for the pixel marked as "*" will contain the bit encoding of
the values in the matrix marked from "1" to "12". In case the pixel is
near the border of the grid, the number of values contained within the
grid will be lesser than 12.
*/
for (l = i - 2; l <= i + 2; l++) {
for (m = j - 2; m <= j; m++) {
if (l >= i && m == j)
continue;
if (l > 0 && l <= XFACE_WIDTH && m > 0)
k = 2*k + src[l + m * XFACE_WIDTH];
}
}
/*
Use the guess for the given position and the computed value of k.
The following table shows the number of digits in k, depending on
the position of the pixel, and shows the corresponding guess table
to use:
i=1 i=2 i=3 i=w-1 i=w
+----+----+----+ ... +----+----+
j=1 | 0 | 1 | 2 | | 2 | 2 |
|g22 |g12 |g02 | |g42 |g32 |
+----+----+----+ ... +----+----+
j=2 | 3 | 5 | 7 | | 6 | 5 |
|g21 |g11 |g01 | |g41 |g31 |
+----+----+----+ ... +----+----+
j=3 | 5 | 9 | 12 | | 10 | 8 |
|g20 |g10 |g00 | |g40 |g30 |
+----+----+----+ ... +----+----+
*/
#define GEN(table) dst[h] ^= (table[k>>3]>>(7-(k&7)))&1
switch (i) {
case 1:
switch (j) {
case 1: GEN(g_22); break;
case 2: GEN(g_21); break;
default: GEN(g_20); break;
}
break;
case 2:
switch (j) {
case 1: GEN(g_12); break;
case 2: GEN(g_11); break;
default: GEN(g_10); break;
}
break;
case XFACE_WIDTH - 1:
switch (j) {
case 1: GEN(g_42); break;
case 2: GEN(g_41); break;
default: GEN(g_40); break;
}
break;
case XFACE_WIDTH:
switch (j) {
case 1: GEN(g_32); break;
case 2: GEN(g_31); break;
default: GEN(g_30); break;
}
break;
default:
switch (j) {
case 1: GEN(g_02); break;
case 2: GEN(g_01); break;
default: GEN(g_00); break;
}
break;
}
}
}
}
``` |
Aricia hyacinthus, the Anatolian false argus, is a butterfly of the family Lycaenidae. It is found in Asia Minor and around the Levant Sea.
Description from Seitz
L. hyacinthus H.-Schiff. (80 b, c). Above similar to the preceding [donzelii] the dark margin still broader, especially on the hindwing. Very different on the underside, being light blue-grey with rust-red marginal spots, distinct ocelli and on the hindwing without distinct white median smear. — From the countries around the eastern part of the Black Sea.
References
Butterflies described in 1847
Butterflies of Asia
hyacinthus |
Joseph Francis Dronzek (born July 14, 1940 in Yonkers, New York) is an American sprint canoer who competed at the 1964 Summer Olympics in Tokyo, Japan. Canoeing at the 1964 Summer Olympics was held between 20 October and 22 October on Lake Sagami, 60 km (37 miles) from Sagamiko, Kanagawa, Japan. There were seven events, five for men and two for women. Dronzek was eliminated in the semifinals of the C-2 1000 metres event. This is a picture of Mr. Dronzek is affiliated with the Yonkers Canoe Club, and trained for the world competition in New York's Hudson River and lake Osceola with his doubles partner James Jerome O'Rourke, Jr. During their training he was working full-time learning the electrical trade. Joe Dronzek became an electrician by trade and handyman for most that knew him; and even restored an old oak canoe with his daughter Christine years ago. At age 73, he still canoes mostly on Lake Oscawana in Putnam Valley, New York, where he lives.
References
Sports-reference.com profile
1940 births
Living people
American male canoeists
Canoeists at the 1964 Summer Olympics
Olympic canoeists for the United States |
The Python Package Index, abbreviated as PyPI () and also known as the Cheese Shop (a reference to the Monty Python's Flying Circus sketch "Cheese Shop"), is the official third-party software repository for Python. It is analogous to the CPAN repository for Perl and to the CRAN repository for R. PyPI is run by the Python Software Foundation, a charity. Some package managers, including pip, use PyPI as the default source for packages and their dependencies.
more than 350,000 Python packages can be accessed through PyPI.
In May 2023, more than 450 000 Python packages are available.
PyPI primarily hosts Python packages in the form of archives called (source distributions) or precompiled "wheels."
PyPI as an index allows users to search for packages by keywords or by filters against their metadata, such as free software license or compatibility with POSIX. A single entry on PyPI is able to store, aside from just a package and its metadata, previous releases of the package, precompiled wheels (e.g. containing DLLs on Windows), as well as different forms for different operating systems and Python versions.
History
The Python Distribution Utilities () Python module was first added to the Python standard library in the 1.6.1 release, in September 2000, and in the 2.0 release, in October 2000, nine years after first python release in February 1991, with the goal of simplifying the process of installing third-party Python packages.
However, only provided the tools for packaging Python code, and no more. It was able to collect and distribute metadata but did not use it for other purposes. Python still lacked a centralised catalog for packages on the internet. PEP 241, a proposal to standardize metadata for indexes, was finalized in March 2001. A proposal to create a comprehensive centralised catalog, hosted at the python.org domain, was later finalized in November 2002.
On 16 April 2018, all PyPI traffic began being served by a more modern website platform: Warehouse. The legacy website was turned off at the end of that month. All existing packages were migrated to the new platform with their histories preserved.
As of 15 April 2023, more than 445,000 Python packages are available.
In May 2023 the Python Software Foundation reported that the United States Department of Justice had subpoenaed the user data of three PyPI contributors. A representative of the organization further explained that they expect privacy for contributors, but they also comply with the law and court orders, and for this reason turned over the data which the government requested.
Notes
References
Archive networks
Python (programming language) |
Unreality is the debut solo album by Kennedy Ashlyn under the alias SRSQ. The album was released on October 26, 2018, by Dais Records.
Background
Prior to SRSQ, Ashlyn was one half of the dream pop and dark wave duo Them Are Us Too with Cash Askew. The duo formed in 2012 and released one EP and one album together in 2015. Askew died in the Ghost Ship warehouse fire in 2016. Ashlyn subsequently completed Them Are Us Too's second album, Amends, which was released in June 2018. With Them Are Us Too officially disbanded after Amends, Ashlyn moved on to her solo career as SRSQ, which had started with her first live performance under the name in May 2017.
Ashlyn went into the album knowing its sound would be informed by her work with Them Are Us Too's, and that its fundamental aspects will always be connected to Askew.
Release
The album was first announced on August 24, 2018, and released on October 26 by Dais Records. The album was preceded by one single, "The Martyr", which was released on August 22. The album name came from Ashlyn's belief that the album speaks to "trying to process what a surreal world feels like in the wake of such a reality".
Style
The music of Unreality has been called ethereal dark wave while also including influences of post-punk and neoclassical music. It has been compared to the output of the English record label 4AD, especially the 4AD band Cocteau Twins and their "goth-minded kin". Ashlyn's vocals have been compared to Cocteau Twins vocalist Elizabeth Fraser and fellow 4AD alum Dead Can Dance's Lisa Gerrard, as well as late-era David Bowie and Zola Jesus. The album has also been said to continue the musical direction of Ashlyn's former duo Them Are Us Too, though with "an added level of poignancy".
Though the album comes after Askew's death, the lyrics are noted as uplifting and celebratory, with Ashlyn sounding "utterly grateful" to have known Askew and offering hope while honoring Askew's memory.
Reception
AllMusic's Paul Simpson called Unreality an "immensely beautiful, affecting record." PopMatters Spyros Stasis said the album "feels a bit downgraded in terms of texture" and works best when Ashlyn experiments with additions of noise or subtle glitching sounds, which she only leans into occasionally but those moments are among the album's most powerful. Stasis concludes by calling the album "overall interesting" and revealing of Ashlyn's "further potential".
Critics consistently praised Ashlyn's vocals, calling them "astounding" and the "singular center of the record" with which she delivers "an unbelievable performance." Pitchforks Larry Fitzmaurice noted that while the layers of "incantatory spoken-word" and "high-register vocal acrobatics" would typically be called "otherworldly", Ashlyn's have a "lovely human imperfection".
Track listing
Personnel
Kennedy Ashlyn – vocals, synthesizers, sequencing
Matia Simovich – producer
References
2018 debut albums
SRSQ albums
Dais Records albums
Albums in memory of deceased persons |
WKBN may refer to:
WKBN (AM), a radio station (570 AM) licensed to Youngstown, Ohio, United States
WKBN-TV, a television station (channel 27) licensed to Youngstown, Ohio, United States
WMXY, a radio station (98.9 FM) licensed to Youngstown, Ohio, United States, which formerly used the call sign WKBN-FM |
Brian Tyrrell (died 19 April 2009) was an Irish football player who played as a forward.
Career
Tyrrell was born in Dublin and signed for Shamrock Rovers in 1961. In September 1963 he emigrated to New York City along with Tony O'Connell. He made two appearances in the Inter-Cities Fairs Cup against previous winners Real Zaragoza in 1965. Within days of winning the 1966 FAI Cup he signed for Australian side Sydney United. Tyrrell returned home to sign for Drogheda United in October 1967. He died on 19 April 2009.
Honours
Shamrock Rovers
FAI Cup: 1966
League of Ireland Shield: 1965–66
Top Four Cup: 1965–66
Sources
The Hoops by Paul Doolan and Robert Goggins ()
References
2009 deaths
Republic of Ireland men's association footballers
Men's association football forwards
Shamrock Rovers F.C. players
Drogheda United F.C. players
League of Ireland players
Year of birth missing |
```objective-c
/*
*
*/
#pragma once
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include "esp_err.h"
#include "soc/soc_caps.h"
#include "soc/periph_defs.h"
#include "hal/modem_clock_types.h"
#include "esp_private/esp_pmu.h"
#if SOC_MODEM_CLOCK_IS_INDEPENDENT
#include "hal/modem_clock_hal.h"
#endif
#ifdef __cplusplus
extern "C" {
#endif
/**
* @brief Enable the clock of modem module
*
* Solve the clock dependency between modem modules, For example, the wifi
* module depends on the wifi mac, wifi baseband and FE, when wifi module
* clock is enabled, the wifi MAC, baseband and FE clocks will be enabled
*
* This interface and modem_clock_module_disable will jointly maintain the
* ref_cnt of each device clock source. The ref_cnt indicates how many modules
* are relying on the clock source. Each enable ops will add 1 to the ref_cnt of
* the clock source that the module depends on, and only when the ref_cnt of
* the module is from 0 to 1 will the clock enable be actually configured.
*
* !!! Do not use the hal/ll layer interface to configure the clock for the
* consistency of the hardware state maintained in the driver and the hardware
* actual state.
*
* @param module modem module
*/
void modem_clock_module_enable(periph_module_t module);
/**
* @brief Disable the clock of modem module
*
* This interface and modem_clock_module_enable will jointly maintain the ref_cnt
* of each device clock source. The ref_cnt indicates how many modules are relying
* on the clock source. Each disable ops will minus 1 to the ref_cnt of the clock
* source that the module depends on, and only when the ref_cnt of the module is
* from 1 to 0 will the clock disable be actually configured.
*
* !!! Do not use the hal/ll layer interface to configure the clock for the
* consistency of the hardware state maintained in the driver and the hardware
* actual state.
*
* @param module modem module
*/
void modem_clock_module_disable(periph_module_t module);
/**
* @brief Reset the mac of modem module
*
* @param module modem module, must be one of
* PERIPH_WIFI_MODULE / PERIPH_BT_MODULE /PERIPH_IEEE802154_MODULE
*/
void modem_clock_module_mac_reset(periph_module_t module);
#if SOC_BLE_USE_WIFI_PWR_CLK_WORKAROUND
/**
* @brief Enable modem clock domain clock gate to gate it's output
*
* @param domain modem module clock domain
* @param mode PMU HP system ACTIVE, MODEM and SLEEP state
*
* @return
* - ESP_OK on success
* - ESP_ERR_INVALID_ARG if the argument value are not correct
*/
esp_err_t modem_clock_domain_clk_gate_enable(modem_clock_domain_t domain, pmu_hp_icg_modem_mode_t mode);
/**
* @brief Disable modem clock domain clock gate to ungate it's output
*
* @param domain modem module clock domain
* @param mode PMU HP system ACTIVE, MODEM and SLEEP state
*
* @return
* - ESP_OK on success
* - ESP_ERR_INVALID_ARG if the argument value are not correct
*/
esp_err_t modem_clock_domain_clk_gate_disable(modem_clock_domain_t domain, pmu_hp_icg_modem_mode_t mode);
#endif
/**
* @brief Select the modem module lowpower clock source and configure the clock divider
*
* @param module modem module
* @param src lowpower clock source
* @param divider divider value to lowpower clock source
*/
void modem_clock_select_lp_clock_source(periph_module_t module, modem_clock_lpclk_src_t src, uint32_t divider);
/**
* @brief Disable lowpower clock source selection
*/
void modem_clock_deselect_lp_clock_source(periph_module_t module);
/**
* @brief Reset wifi mac
*/
void modem_clock_wifi_mac_reset(void);
/**
* @brief Enable clock registers which shared by both modem and ADC. Need a ref count to enable/disable them
*
* @param enable true: enable; false: disable
*/
void modem_clock_shared_enable(bool enable);
#ifdef __cplusplus
}
#endif
``` |
The William and Estella Adair Farm, named the Broadacre Farm in 1922, is a 115-acre dairy farm in Carnation, Washington that illustrates the evolution of a typical dairy farming operation in the Snoqualmie Valley. Established in 1910, it was added to the National Register of Historic Places in 2002.
History
The farm was established in 1910 on the west bank of the Snoqualmie River. Structures on the property include a Craftsman bungalow residence, a hay barn, milk house, milking parlor, woodshed, and other outbuildings.
The residence, built in 1915, is a -story wood-frame bungalow with a side gable. The hay barn, added in 1922, is notable as the earliest extant example in the Snoqualmie Valley of the use of the bow truss or Gothic arch for the roof.
One of the first milking parlors in the county was installed at Broadacre Farm in about 1950. The milking parlor and milk house are part of a complex of four adjoining buildings. The complex, with additions made through the 1990s, is integrated with the hay barn.
The Adairs sold the Broadacre Farm to Peter Sinnema in 1945. Sinnema expanded the existing farm complex by constructing loafing sheds on either side of the bam, adding a new tank house, and building a new Surge six-in-a-line milking parlor, one of first to be installed in the valley. Later additions include large detached loafing sheds, a new herringbone milking parlor designed for 16 cows, and a modem milk house with a 22,000 gallon tank.
For many years, Broadacre Farm was the site for the annual Snoqualmie Valley Pioneer Picnic, which the Adair family first hosted in 1923. Broadacre Farm was a working dairy farm until the mid-1990s.
References
National Register of Historic Places in King County, Washington
Buildings and structures completed in 1915
Buildings and structures completed in 1922
Dairy farming
Dairy buildings in the United States |
Gordon McGhie (14 October 1907 – c. 1975) was a rugby union player who represented Australia. He rose to prominence in the late 1920s / early 1930s as a flying winger when the Queensland Rugby Union reformed after a ten-year hiatus.
McGhie, a wing, was born in Brisbane, Queensland and claimed a total of 3 international rugby caps for Australia.
References
Australian rugby union players
Australia international rugby union players
1907 births
1975 deaths
Rugby union players from Brisbane
Rugby union wings |
Viplove Thakur (born 4 October 1943) is an Indian politician. A senior leader of the Indian National Congress party, she has been a member of the Parliament of India. Thakur has represented Himachal Pradesh in the Rajya Sabha, the upper house of the Parliament since April, 2006. She retired from the Upper House in April, 2020.
Family
She comes from a freedom fighter family of Himachal Pradesh. Her father late Sh. Paras Ram was a freedom fighter from Himachal Pradesh and a leader of the Communist Party of India. Her mother late Smt. Sarla Sharma was also a prominent leader of the Indian National Congress.
Positions held
1985–90, 1993–98 and 1998-2003 Member, Himachal Pradesh Legislative Assembly.
1995-98 Minister of State (Independent charge), Indian System of Medicines, Government of Himachal Pradesh.
Aug. 2003 - March 2006 Chairperson, State Commission for Women, Himachal Pradesh.
April 2006 Elected to Rajya Sabha.
June 2006 - Nov. 2006 Member, Committee on Science and Technology, Environment and Forests.
Aug. 2006 - July 2008 President, Himachal Pradesh Congress Committee.
Aug. 2006 - May 2009 Member, Committee on Defence.
Nov. 2006 - May 2009 & Aug. 2009 - April 2012 Member, Committee on Health and Family Welfare.
July 2007 - May 2009 Member, India-U.S.A. Parliamentary Friendship Group.
Aug. 2007 - April 2012 Member, Post-Graduate Institute of Medical Education and Research (PGIMER), Chandigarh.
May 2008 - Sept. 2009 Member, Committee on Government Assurances.
May 2008 - May 2009 Member, Consultative Committee for the Ministry of Women and Child Development.
Aug. 2008 - May 2009 Member, Hindi Salahkar Samiti of the Ministry of Commerce and Industry.
Sept. 2009 - May 2010 Member, Committee on Petitions.
Sept. 2009 - April 2012 Member, Consultative Committee for the Ministry of Road Transport and Highways.
March 2010 - April 2012 Member, Agricultural and Processed Food Products Export Development Authority (APEDA).
December 2010 - April 2012 Member, Central Advisory Committee for the National Cadet Corps.
Jan. 2010 - April 2012 Member, Hindi Salahkar Samiti of the Ministry of Health and Family Welfare.
May 2011 - April 2012 Member, Sub-Committee-I to examine the functioning of AIIMS of the Committee of Health and Family Welfare.
April 2014 Elected to Rajya Sabha (Second term).
References
Indian National Congress politicians from Himachal Pradesh
Rajya Sabha members from Himachal Pradesh
Living people
Women in Himachal Pradesh politics
21st-century Indian women politicians
21st-century Indian politicians
1943 births
Women members of the Rajya Sabha |
Local elections were held in the Indian state of Gujarat in 2021. Elections were held for 8,235 seats, with 237 seats having only one unopposed candidates. No form was filled for two seats in Taluka panchayat. The elections included six municipal corporations where elections took place in February — Ahmedabad, Surat, Vadodara, Rajkot, Bhavnagar and Jamnagar – and one (Gandhinagar) in which the elections were held on 3 October. Results to Gandhinagar Municipal Corporation were declared on 5 October 2021.
Before the elections, the Bharatiya Janata Party (BJP) ruled all the municipal corporations in the state.
Background
In previous elections, the BJP won 389 seats and Indian National Congress (INC) won 176 seats. In 2017 BJP won the state assembly elections and was able to win all Lok Sabha seats in 2019.
In 2021, Aam Aadmi Party (AAP) and All India Majlis-e-Ittehadul Muslimeen (AIMIM) had also decided to contest elections to civic bodies. This is the first election in state since COVID-19 pandemic began. Candidates in 6 corporations include 577 from the BJP, 566 by Congress, and 470 by AAP. Election to Gandhinagar Municipal Corporation were held in October 2021 to 44 seats across 11 wards. Results were declared on 5 October 2021.
For Gandhinagar elections BJP and Congress have given 44 candidates each and AAP has given 40 candidates. The elections to Gujarat local bodies were held in view of strict COVID-19 guidelines
Voters
The six municipal corporations reported an average 46.1% voting.
Results
Votes percentage (party wise)
By municipal corporation
BJP won all the 6 Municipal Corporation. Congress, the biggest opposition party, had won 55 seats. AAP became biggest opposition in Surat Municipal Corporation. AAP won seats in Surat and Gandhinagar Municipal elections.
BJP gained 94 seats while Congress lost 121 seats this time.
AIMIM also contested local body polls and won seven seats in Ahmedabad's Muslim-dominated Jamalpur and Maktampura wards. Bahujan Samaj Party (BSP) won 3 seats in Jamnagar Municipal Corporation. In 6 municipalities and 15 taluka panchayats, no party holds clear majority. In October 2021 results for Gandhinagar Municipal elections were declared. BJP won the election to Gandhinagar Corporation too with 40 seats. In all the 7 bodies BJP won with majority.
Amdavad Municipal Corporation
Surat Municipal Corporation
Vadodara Municipal Corporation
Bhavnagar Municipal Corporation
Jamnagar Municipal Corporation
Rajkot Municipal Corporation
Gandhinagar Municipal Corporation
Reactions
Prime Minister Modi congratulated the party's workers. CM Vijay Rupani expressed his gratitude towards Gujarati people. Delhi Chief Minister Arvind Kejriwal did a road show in Surat for party's representation as main opposition. Home Minister Amit Shah expressed his gratitude towards Gujarati people and party workers.
References
External links
Gujarat: Voting for 6 municipal corporations underway amid strict Covid norms
LIVE: Gujarat Taluka Panchayat Elections Results 2021: BJP wins 1036 seats - Check latest news updates, seats details here
Gandhinagar municipal election to be held on October 3
2021 elections in India
Elections in Gujarat |
```yaml
organizations:
- name: org1
connProfilePath: ./connection-profile/connection_profile_org1.yaml
- name: org2
connProfilePath: ./connection-profile/connection_profile_org2.yaml
createChannel:
- channelName: your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422
channelTxPath: ./channel-artifacts/your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422/your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422.tx
organizations: org1
anchorPeerUpdate:
- channelName: your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422
organizations: org1
anchorPeerUpdateTxPath: ./channel-artifacts/your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422/your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422org1anchor.tx
joinChannel:
- channelName: your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422
organizations: org1
installChaincode:
# installs chaincode with specified name on all peers in listed organziations
- name: samplecc
sdk: cli
version: v1
path: github.com/hyperledger/fabric-test/chaincodes/samplecc/go
organizations: org1,org2
language: golang
metadataPath: ""
instantiateChaincode:
- channelName: your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422
name: samplecc
sdk: cli
version: v1
args: ""
organizations: org1
endorsementPolicy: 1of(org1,org2)
collectionPath: ""
invokes:
- channelName: your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422
name: samplecc
targetPeers: OrgAnchor
nProcPerOrg: 1
nRequest: 1
runDur: 0
organizations: org1
txnOpt:
- mode: constant
options:
constFreq: 0
devFreq: 0
queryCheck: 100
eventOpt:
type: FilteredBlock
listener: Block
timeout: 240000
ccOpt:
ccType: ccchecker
keyStart: 0
payLoadMin: 1024
payLoadMax: 2048
args: "put,a1,1"
queries:
- channelName: your_sha256_hashyour_sha256_hashyour_sha256_hash22422422422422422422422422422422422422422422422422
name: samplecc
targetPeers: OrgAnchor
nProcPerOrg: 1
nRequest: 1
runDur: 0
organizations: org1
ccOpt:
ccType: ccchecker
keyStart: 0
txnOpt:
- mode: constant
options:
constFreq: 0
devFreq: 0
args: "get,a1"
``` |
```cmake
# Source: path_to_url#file-bin2h-cmake
# Added modifications to suit prusaslicer
include(CMakeParseArguments)
# Function to wrap a given string into multiple lines at the given column position.
# Parameters:
# VARIABLE - The name of the CMake variable holding the string.
# AT_COLUMN - The column position at which string will be wrapped.
function(WRAP_STRING)
set(oneValueArgs VARIABLE AT_COLUMN)
cmake_parse_arguments(WRAP_STRING "${options}" "${oneValueArgs}" "" ${ARGN})
string(LENGTH ${${WRAP_STRING_VARIABLE}} stringLength)
math(EXPR offset "0")
while(stringLength GREATER 0)
if(stringLength GREATER ${WRAP_STRING_AT_COLUMN})
math(EXPR length "${WRAP_STRING_AT_COLUMN}")
else()
math(EXPR length "${stringLength}")
endif()
string(SUBSTRING ${${WRAP_STRING_VARIABLE}} ${offset} ${length} line)
set(lines "${lines}\n${line}")
math(EXPR stringLength "${stringLength} - ${length}")
math(EXPR offset "${offset} + ${length}")
endwhile()
set(${WRAP_STRING_VARIABLE} "${lines}" PARENT_SCOPE)
endfunction()
# Function to embed contents of a file as byte array in C/C++ header file(.h). The header file
# will contain a byte array and integer variable holding the size of the array.
# Parameters
# SOURCE_FILE - The path of source file whose contents will be embedded in the header file.
# VARIABLE_NAME - The name of the variable for the byte array. The string "_SIZE" will be append
# to this name and will be used a variable name for size variable.
# HEADER_FILE - The path of header file.
# APPEND - If specified appends to the header file instead of overwriting it
# NULL_TERMINATE - If specified a null byte(zero) will be append to the byte array. This will be
# useful if the source file is a text file and we want to use the file contents
# as string. But the size variable holds size of the byte array without this
# null byte.
# Usage:
# bin2h(SOURCE_FILE "Logo.png" HEADER_FILE "Logo.h" VARIABLE_NAME "LOGO_PNG")
function(BIN2H)
set(options APPEND NULL_TERMINATE ADD_WARNING_TEXT)
set(oneValueArgs SOURCE_FILE VARIABLE_NAME HEADER_FILE)
cmake_parse_arguments(BIN2H "${options}" "${oneValueArgs}" "" ${ARGN})
# reads source file contents as hex string
file(READ ${BIN2H_SOURCE_FILE} hexString HEX)
string(LENGTH ${hexString} hexStringLength)
# appends null byte if asked
if(BIN2H_NULL_TERMINATE)
set(hexString "${hexString}00")
endif()
# wraps the hex string into multiple lines at column 32(i.e. 16 bytes per line)
wrap_string(VARIABLE hexString AT_COLUMN 32)
math(EXPR arraySize "${hexStringLength} / 2")
# adds '0x' prefix and comma suffix before and after every byte respectively
string(REGEX REPLACE "([0-9a-f][0-9a-f])" "0x\\1, " arrayValues ${hexString})
# removes trailing comma
string(REGEX REPLACE ", $" "" arrayValues ${arrayValues})
# converts the variable name into proper C identifier
string(MAKE_C_IDENTIFIER "${BIN2H_VARIABLE_NAME}" BIN2H_VARIABLE_NAME)
# string(TOUPPER "${BIN2H_VARIABLE_NAME}" BIN2H_VARIABLE_NAME)
# declares byte array and the length variables
set(arrayDefinition "const unsigned char ${BIN2H_VARIABLE_NAME}[] = { ${arrayValues} };")
set(arraySizeDefinition "const size_t ${BIN2H_VARIABLE_NAME}_SIZE = ${arraySize};")
set(warnTxt "")
if (BIN2H_ADD_WARNING_TEXT)
set(warnTxt "/* WARN: This file is auto-generated from ${BIN2H_SOURCE_FILE} */\n")
endif ()
set(declarations "${warnTxt}${arrayDefinition}\n\n${arraySizeDefinition}\n\n")
if(BIN2H_APPEND)
file(APPEND ${BIN2H_HEADER_FILE} "${declarations}")
else()
file(WRITE ${BIN2H_HEADER_FILE} "${declarations}")
endif()
endfunction()
``` |
Marc Oberweis (born 6 November 1982) is a retired Luxembourgian footballer who last played as a goalkeeper for Jeunesse Esch in Luxembourg's domestic National Division.
Club career
Oberweis came through the youth ranks at F91 Dudelange where he made his senior debut in 2002. In 2004, he joined Grevenmacher.
International career
Oberweis made his debut for Luxembourg in a March 2005 World Cup qualification match against Latvia, taking the national team jersey over from Alija Besic. He went on to earn 7 caps, 5 of them FIFA World Cup qualification matches.
He also played several Euro League and Champions League Qualification games for his clubs Jeunesse Esch, CS Grevenmacher and F91 Dudelange.
Honours
Luxembourg Cup: 2
2004, 2008
National Champion 2010 with Jeunesse Esch
Elected 3 times best Goalkeeper in BGL Ligue
2nd best player in BGL Ligue in the season 09–10.
References
External links
Player profile - CS Grevenmacher
1982 births
Living people
Footballers from Luxembourg City
Luxembourgian men's footballers
F91 Dudelange players
CS Grevenmacher players
Luxembourg men's international footballers
Men's association football goalkeepers |
Eine Symphonie des Kampfwillens (A Symphony of the Will to Fight) is the first film documentary of a Nuremberg Rally.
Made soon after the establishment of the Nazi Party film office, the film is a short record of the highlights of the conference, interspersed with newspaper descriptions of the rally. It begins with the arrival at Nuremberg of the various contingents of Nazis, some on train, others in trucks or on foot. The main gatherings are held in parks, rather than the stadiums that would be used later.
An important moment in the film is the sequence when Adolf Hitler greets the delegations from areas of Germany that have been occupied or cut off from the Reich, such as the Ruhr, or Austria, and vows that the foreigners will be expelled and German people reunited. The film ends, like others in this series, with a parade of the Sturmabteilung before the Führer.
References
1927 films
German silent short films
Nazi propaganda films
Films of the Weimar Republic
Nuremberg Rally films
1927 documentary films
German black-and-white films
German documentary films
1920s German films |
The Khabur River is the largest perennial tributary to the Euphrates in Syria. Although the Khabur originates in Turkey, the karstic springs around Ras al-Ayn are the river's main source of water. Several important wadis join the Khabur north of Al-Hasakah, together creating what is known as the Khabur Triangle, or Upper Khabur area. From north to south, annual rainfall in the Khabur basin decreases from over 400 mm to less than 200 mm, making the river a vital water source for agriculture throughout history. The Khabur joins the Euphrates near the town of Busayrah.
Geography
The course of the Khabur can be divided in two distinct zones: the Upper Khabur area or Khabur Triangle north of Al-Hasakah, and the Middle and Lower Khabur between Al-Hasakah and Busayrah.
Tributaries
The tributaries to the Khabur are listed from east to west. Most of these wadis only carry water for part of the year.
Wadi Radd
Wadi Khnezir
Wadi Jarrah
Jaghjagh River
Wadi Khanzir
Wadi Avedji
History
The river was well noted by ancient writers, with various names used by various writers: Ptolemy and Pliny the Elder called it the Chaboras (),<ref name=Chaboras>Ptolemy, The Geography, 5.18.3; Pliny the Elder, Natural History, 30.3.</ref> Procopius called it the Chabura, Strabo, Zosimus, and Ammianus Marcellinus called it the Aborrhas (Ἀβόρρας), and Isidore of Charax called it the Aburas (Ἀβούρας). It was described as a large river of Mesopotamia which rose in Mons Masius, about from Nisibis, and flowed into the Euphrates at Circesium (Kerkesiah). Procopius speaks of it as a river of importance, and Ammianus states that Julian the Apostate crossed it "per navalem Aborae pontem". Strabo describes it as near the town of Anthemusias.
The river is fed by several smaller streams, the names of which are mentioned in the later classical writers. These are, the Scirtus (Procop. de Aedif. 2.7), the Cordes (Procop. de Aedif. 2.2), and the Mygdonius (Julian. Or. i.).
Ptolemy (5.18.6) mentions a town called Chabora (Χαβώρα), on the Euphrates, which he places near Nicephorion, and which probably derives its name from the river, and Theophylact Simocatta mentions Ἀβορέων φρούριον, which is, as certainly, the same place.
Since the 1930s, numerous archaeological excavations and surveys have been carried out in the Khabur Valley, indicating that the region has been occupied since the Lower Palaeolithic period. Important sites that have been excavated include Tell Halaf, Tell Brak, Tell Leilan, Tell Mashnaqa, Tell Mozan and Tell Barri. The region has given its name to a distinctive painted ware found in northern Mesopotamia and Syria in the early 2nd millennium BCE, called Khabur ware. The region of the Khabur River is also associated with the rise of the Kingdom of the Mitanni that flourished c. 1500–1300 BC.
The Khabur River is mentioned in the Hebrew Bible: "Tiglath-Pileser ... took the Reubenites, the Gadites and the half tribe of Manasseh into exile. He took them to Halah, Habor (Khabur), Hara and the River Gozan, where they are to this day". The identification of the Khabur with the Habor is not contested.
The ancient city of Corsote, visited by Cyrus the Younger on his ill-fated expedition against the Persians as told by Xenophon, was located at the confluence of the Khabur River, known by them as the 'Mascas', and the Euphrates according to Robin Waterfield. Other authors have been circumspect upon the precise location of Corsote due to the changing names and courses of the rivers since that time.
The Khabur river was sometimes identified with the Chebar or Kebar, the location of Tel Abib and setting of several important scenes of the Book of Ezekiel. However, recent scholarship identifies the Chebar as the ka-ba-ru'' waterway mentioned among the 5th century BCE Murushu archives from Nippur, close to Nippur and the Shatt el-Nil, a silted up canal toward the east of Babylon.
Modern Khabur River Valley
The Khabur River Project, begun in the 1960s, involved the construction of a series of dams and canals. Three dams were built in the Khabur Basin as part of a large irrigation scheme that also includes the Tabqa Dam on the Euphrates. The section of the Khabur River within Tell Tamer Subdistrict are home to a self-governing Assyrian enclave. Two dams, Hasakah West and Hasakah East, have been constructed on tributaries to the Khabur between Ra's al-'Ayn and Al-Hasakah. The capacity of the reservoir of Hasakah West is 0.09 km3, and is also the southeastern end of the Assyrian enclave. The capacity of Hasakah East is 0.2 km3. A third dam, Hassakeh South, was constructed on the Khabur 25 km south of Al-Hasakah. The reservoir of this dam has a capacity of 0.7 km3. The Khabur Valley, which now has about four million acres (16,000 km²) of farmland, is Syria's main wheat-cultivation area. The northeastern part is also the center for Syria's oil production.
References
Rivers of Turkey
Rivers of Syria
International rivers of Asia
Euphrates
Tur Abdin
Upper Mesopotamia
Landforms of Şanlıurfa Province
Geography of Turkish Kurdistan
Levant
Eastern Mediterranean
New Testament places |
The Robert J. Terry Anatomical Skeletal Collection is a collection of some 1,728 human skeletons held by the Department of Anthropology of the National Museum of Natural History of the Smithsonian Institution, Washington, D.C., United States.
Background
It was created by Robert J. Terry (1871–1966) during his time as professor of anatomy and head of the Anatomy Department at Washington University Medical School in St. Louis, Missouri from 1899 until his retirement in 1941. It was transferred to its present holders in 1967. The Terry Collection is composed of skeletons that Terry collected from the Medical School's Gross Anatomy classes during his tenure at Washington University. The majority of the remains that make up the collection came from local hospitals in the St. Louis area, as well as institutional morgues. The remains obtained from these hospitals and institutions were those of individuals who had not been claimed by relatives, effectively making the remains the property of the state. The state of Missouri decided to donate the bodies to the medical school rather than spend taxpayer money to bury them.
The collection is an important source for anthropological research because of the extensive documentation that accompanies each skeleton. Terry attempted to collect data such as morgue records, dental charts, bone inventory forms, and anthropometric and anthroposcopic forms for the majority of the skeletons in the collection. Although methods of data collection changed over the years that the collection was being amassed, the same basic information was consistently collected. This information includes name, sex, age, race, cause of death, date of death, morgue or institution of origin, permit number, and various dates and records that pertain to embalming and processing of the cadaver. Terry also collected other resources for some of the individuals in the collection such as photographs or photo negatives of cadavers, plaster death masks, hair samples, and skin samples. The skin samples, however, had to be disposed of when the Anatomy building underwent renovations in the 1960s and the room they were stored in was removed.
Research using the Terry Collection
There have been considerable amounts of research performed utilizing the skeletal remains within the Robert J. Terry collection. Much of this research has centered around attempts to create new methods of determining biological profile (height, age, sex, and ancestry) from an individual's skeletal remains. Some of the more prominent studies have included ones such as Mildred Trotter and Goldine Gleser's stature estimation from the long bones of American Whites and Negroes, Giles and Elliot's cranial measurements for determining ancestry and sex, Işcan's ancestry determination using the pelvis, DiBennardo and Taylor's method of sex and ancestry assessment utilizing the pelvis and femur, which was later expanded upon by Işcan and Cotton, who included the tibia in the analysis. Other, more modern, studies using the Terry Collection have continued to focus on estimation of sex, ancestry, and stature as well. These include the attempt to estimate sex from the posterior portion of the ilium by Novak, Schultz, and McIntyre, Kindschuh, Dupras, and Cowgill's approach for estimating ancestry utilizing the hyoid, and Albanese's use of the clavicle, humerus, radius, and ulna to estimate sex.
These studies have contributed greatly to the field of anthropology, especially forensic anthropology and bioarchaeology, in that many of the earlier methods, such as Trotter and Gleser's stature estimation formula, are still utilized today in conjunction with more modern methods to assess biological profile of skeletal remains. It is the well documented, and highly detailed, nature of the Terry Collection that has allowed for successful development of these methodologies which are still utilized today. It is this same nature that perpetuates continued use of the Terry Collection for research into skeletal biology and pathology, thus leading to development of more successful methodologies for assessing biological profile and pathological affects on the human skeleton.
The Terry Collection has also contributed to the construction of the Forensic Anthropology Data Bank (FDB), which is large digital database of skeletal measurements taken from various cases since its establishment in 1986. A number of African-American skeletal measurements from the Terry Collection were contributed to the FDB. The FDB is the main data pool that the computer program FORDISC utilizes in order to estimate sex, stature, and ancestry from specific skeletal measurements. FORDISC is primarily utilized in forensic applications, but may be applied to any skeletal measurements providing that they are diagnostic in nature, such as measurements of the skull and long bones.
Forensic anthropological research
As mentioned above, numerous studies have utilized the Robert J. Terry Collection for research and development of skeletal identification techniques. A vast majority have been aimed at advancing forensic anthropology and its methodologies for identification through various aspects of skeletal anatomy. One of the most well known of these studies was performed by Mildred Trotter and Goldine Gleser in 1952. Trotter and Gleser utilized the Terry Collection to create stature estimation formulas for American Whites and Negroes utilizing the long bones of the arm (humerus, radius, and ulna) and of the leg (femur, tibia, and fibula). This was achieved by taking measurements of all of the aforementioned bones and creating regression formulas from the taken measurements. The result was a number of formulas that allow for accurate estimation of the living stature of both American White and African-American males and females from dry bone.
Another well known study that utilized the Terry Collection to create forensic identification methods was the assessment of race/ancestry using the pelvis performed by Mehmet Yaşar Işcan. His study utilized 400 individuals from the Terry collection that encompassed both White and African American male and female pelves of known age and race/ancestry. Measurements of the pelves were taken while they were in articulated form, and then analyzed to determine if successful estimation of race/ancestry was possible. Results indicated that there was the possibility of an 88 percent correct assessment, and that race/ancestry assessment of female pelves was easier than that of male pelves. It was, however, cautioned to use these results carefully due to the fact that a large number of the remains were of low socioeconomic status and of unknown nutritional health.
Bioarchaeological Research
While bioarchaeology benefits from the methodologies that have been developed by forensic anthropological research using the Terry Collection, there are other studies that take a solely bioarchaeological focus. While not nearly as numerous as the forensic studies, they provide a different aspect to and use of the Robert J. Terry Anatomical Collection. Such studies have been conducted by Kristina Killgrove, who aimed at determining biodistance of Native American populations on the North Carolina Coastal Plain and utilized 52 individuals (26 White males and 26 White females) from the Terry Collection as a control group for comparison against the Native American data that was processed.
Further bioarchaeological research using the Terry Collection was performed by Kristrina Schuler and J. Alyssa White of Auburn University in Alabama. Their research focused on reconstructing body mass from skeletal remains and used a sample of 60 individuals (30 males and 30 females) from the Terry Collection in order to make these assessments. They opted to use the Terry Collection because of its highly controlled collection of living weight for many donors.
Potential issues for modern use
While the Robert J. Terry Anatomical Collection has proven to be an excellent source for research in the field of anthropology, specifically forensic anthropology and bioarchaeology, the collection is now over 100 years old and no modern remains have been added. This has raised questions about the collection's applicability to modern populations when compared to collections such as the William Bass Donated Skeletal Collection where modern skeletal remains are still being added to the collection. This is thought to raise problems due to the secular changes that are taking place in American populations. It has been demonstrated that clear secular changes have taken place in North America over the last 100–125 years. This has implications for the applicability of studies utilizing the Terry Collection because these changes could impede the ability to make generalizations that are applicable to modern society from these remains since population statistics are not the same today as they were when the collection was being amassed. It was found, however, that the Robert J. Terry Collection and the William Bass Donated Skeletal Collection only have significant differences between age-at-death and year of birth for individuals in the collection, therefore indicating that the more modern remains in the Terry Collection are still applicable to modern research. There were potential secular differences noted in the males of the Terry collection, however. Females had less significant secular differences when compared to males, and while none of these changes were found to be present in large quantities it does indicate that secular change could be beginning to affect skeletal morphology, specifically that of males. Further research utilizing the Terry Collection, specifically utilizing those individuals born before 1890, is required to determine if these changes are significant and what may be causing them.
See also
FORDISC
Hamann-Todd Collection at the Cleveland Museum of Natural History
For demographic and postcraniometric databases, go to: https://smithsonian.figshare.com/articles/Terry_Collection_data/11412846
References
Glade (Green), Amber M. (2001). A study of long bone fracture patterns in the Robert. J. Terry Collection, Smithsonian Institution. Durham University. Department of Archaeology, Division of Paleopathology.
Former private collections in the United States
Collection of the Smithsonian Institution
Human anatomy
History of anatomy |
```xml
// Components
import React, {PureComponent} from 'react'
import {connect} from 'react-redux'
// Libraries
import _ from 'lodash'
import {Link} from 'react-router'
// Components
import AlertsTableRow from 'src/alerts/components/AlertsTableRow'
import InfiniteScroll from 'src/shared/components/InfiniteScroll'
import SearchBar from 'src/alerts/components/SearchBar'
// Constants
import {ALERTS_TABLE} from 'src/alerts/constants/tableSizing'
// Types
import {Alert} from 'src/types/alerts'
import {Source, TimeZones} from 'src/types'
// Decorators
import {ErrorHandling} from 'src/shared/decorators/errors'
enum Direction {
ASC = 'asc',
DESC = 'desc',
NONE = 'none',
}
interface OwnProps {
alerts: Alert[]
source: Source
shouldNotBeFilterable: boolean
limit: number
isAlertsMaxedOut: boolean
alertsCount: number
onGetMoreAlerts: () => void
}
interface StateProps {
timeZone: TimeZones
}
interface State {
searchTerm: string
filteredAlerts: Alert[]
sortDirection: Direction
sortKey: string
}
type Props = OwnProps & StateProps
class AlertsTable extends PureComponent<Props, State> {
constructor(props) {
super(props)
this.state = {
searchTerm: '',
filteredAlerts: this.props.alerts,
sortDirection: Direction.NONE,
sortKey: '',
}
}
public UNSAFE_componentWillReceiveProps(newProps) {
this.filterAlerts(this.state.searchTerm, newProps.alerts)
}
public render() {
const {
shouldNotBeFilterable,
limit,
onGetMoreAlerts,
isAlertsMaxedOut,
alertsCount,
} = this.props
return shouldNotBeFilterable ? (
<div className="alerts-widget">
{this.renderTable()}
{limit && alertsCount ? (
<button
className="btn btn-sm btn-default btn-block"
onClick={onGetMoreAlerts}
disabled={isAlertsMaxedOut}
style={{marginBottom: '20px'}}
>
{isAlertsMaxedOut
? `All ${alertsCount} Alerts displayed`
: 'Load next 30 Alerts'}
</button>
) : null}
</div>
) : (
<div className="panel">
<div className="panel-heading">
<h2 className="panel-title">{this.props.alerts.length} Alerts</h2>
{this.props.alerts.length ? (
<SearchBar onSearch={this.filterAlerts} />
) : null}
</div>
<div className="panel-body">{this.renderTable()}</div>
</div>
)
}
private filterAlerts = (searchTerm: string, newAlerts?: Alert[]): void => {
const alerts = newAlerts || this.props.alerts
const filterText = searchTerm.toLowerCase()
const filteredAlerts = alerts.filter(({name, host, level}) => {
return (
(name && name.toLowerCase().includes(filterText)) ||
(host && host.toLowerCase().includes(filterText)) ||
(level && level.toLowerCase().includes(filterText))
)
})
this.setState({searchTerm, filteredAlerts})
}
private changeSort = (key: string): (() => void) => (): void => {
// if we're using the key, reverse order; otherwise, set it with ascending
if (this.state.sortKey === key) {
const reverseDirection: Direction =
this.state.sortDirection === Direction.ASC
? Direction.DESC
: Direction.ASC
this.setState({sortDirection: reverseDirection})
} else {
this.setState({sortKey: key, sortDirection: Direction.ASC})
}
}
private sortableClasses = (key: string): string => {
if (this.state.sortKey === key) {
if (this.state.sortDirection === Direction.ASC) {
return 'alert-history-table--th sortable-header sorting-ascending'
}
return 'alert-history-table--th sortable-header sorting-descending'
}
return 'alert-history-table--th sortable-header'
}
private sort = (
alerts: Alert[],
key: string,
direction: Direction
): Alert[] => {
switch (direction) {
case Direction.ASC:
return _.sortBy<Alert>(alerts, e => e[key])
case Direction.DESC:
return _.sortBy<Alert>(alerts, e => e[key]).reverse()
default:
return alerts
}
}
private renderTable(): JSX.Element {
const {
source: {id},
timeZone,
} = this.props
const alerts = this.sort(
this.state.filteredAlerts,
this.state.sortKey,
this.state.sortDirection
)
const {colName, colLevel, colTime, colHost, colValue} = ALERTS_TABLE
return this.props.alerts.length ? (
<div className="alert-history-table">
<div className="alert-history-table--thead">
<div
onClick={this.changeSort('name')}
className={this.sortableClasses('name')}
style={{width: colName}}
>
Name <span className="icon caret-up" />
</div>
<div
onClick={this.changeSort('level')}
className={this.sortableClasses('level')}
style={{width: colLevel}}
>
Level <span className="icon caret-up" />
</div>
<div
onClick={this.changeSort('time')}
className={this.sortableClasses('time')}
style={{width: colTime}}
>
Time ({timeZone})<span className="icon caret-up" />
</div>
<div
onClick={this.changeSort('host')}
className={this.sortableClasses('host')}
style={{width: colHost}}
>
Host <span className="icon caret-up" />
</div>
<div
onClick={this.changeSort('value')}
className={this.sortableClasses('value')}
style={{width: colValue}}
>
Value <span className="icon caret-up" />
</div>
</div>
<InfiniteScroll
className="alert-history-table--tbody"
itemHeight={25}
items={alerts.map((alert, i) => (
<div className="alert-history-table--tr" key={i}>
<AlertsTableRow sourceID={id} {...alert} timeZone={timeZone} />
</div>
))}
/>
</div>
) : (
this.renderTableEmpty()
)
}
private renderTableEmpty(): JSX.Element {
const {
source: {id},
shouldNotBeFilterable,
} = this.props
return shouldNotBeFilterable ? (
<div className="graph-empty">
<p>
Learn how to configure your first <strong>Rule</strong> in
<br />
the <em>Getting Started</em> guide
</p>
</div>
) : (
<div className="generic-empty-state">
<h4 className="no-user-select">There are no Alerts to display</h4>
<br />
<h6 className="no-user-select">
Try changing the Time Range or
<Link
style={{marginLeft: '10px'}}
to={`/sources/${id}/alert-rules/new`}
className="btn btn-primary btn-sm"
>
Create an Alert Rule
</Link>
</h6>
</div>
)
}
}
const mstp = ({app}) => ({
timeZone: app.persisted.timeZone,
})
export default connect(mstp, null)(ErrorHandling(AlertsTable))
``` |
```vue
<!--{}-->
<template>
<div
:class="{
foo:
a === b &&
c === d
}"
/>
</template>
``` |
Beating the Odds IBI & Child Development Services, commonly known as Beating the Odds, was a Canadian company that provided therapy to children on the autism spectrum.
Founded by Amber Maloney in 2015, the company initially provided home-care visits, and opened a therapy centre near Barrie, Ontario in 2022.
The centre was shut down in 2023, shortly before the owner was arrested.
Activities
Beating the Odds IBI & Child Development Services was founded in 2015 by Amber-Lee Maloney (born ). Based in Essa, Ontario, the company provided Applied Behaviour Analysis and Intensive Behavioural Intervention therapies. Initially providing autism therapy via home-visits, the company opened a therapy centre on June 23, 2022. By July 2023, the centre had not obtained a license to operate the therapy centre.
On July 18, 2023, the Ontario Ministry of Education issued a protection order to the school, declaring "an imminent risk to the safety and wellbeing of the children receiving care." The order prohibited the centre from operating. The Ontario Ministry of the Solicitor General issued a statement discouraging parents from using the centre. The day prior, the Ontario Provincial Police issued a public advisory about Lauriston Maloney (born ) the husband of Amber Maloney and a convinced sex offender. Lauriston Maloney was operating a construction company, registered to the same address as the centre and lived on the same premises. From 2002 to 2004, Lauriston Charles Maloney operated a business managing sex workers. According to Maloney, one of his workers was under 18 years old. In 2004, Maloney was arrested and charged with offences after a fourteen-year-old girl from Brampton was allegedly forced to perform sex work for one month. In their public advisory, police noted Lauriston Maloney's sixteen convictions in relation to "trafficking and sexual offences involving minors." His convictions occurred in 2004 and 2013.
Parents of the children who attended the centre held a second protest outside the centre on July 19. The same day the centre was searched by police and both Lauriston Maloney and Amber Maloney were arrested. Lauriston Maloney was charged with "two counts of assault, trafficking a person, receiving material benefit from trafficking a person and forcible confinement". Amber was charged with "trafficking a person, receiving material benefit from trafficking a person, administering a noxious substance, fraud and uttering a forged document."
See also
Autism therapies
List of schools for people on the autism spectrum
References
External links
Official website (23 October 2022 archive)
Facebook page
Schools for people on the autistic spectrum
Special schools in Canada
Autism-related organizations in Canada
2015 establishments in Ontario
2023 disestablishments in Ontario |
In the United States, the Special Milk Program, sometimes known as the School Milk Program, offers federal reimbursements for milk served to children in an eligible participating outlet, which includes schools, child care institutions, settlement houses, homeless shelters, or summer camps. This federal aid program is administered by the United States Department of Agriculture (USDA) under the Food and Nutrition Service (FNS).
Depending on income, a student may buy subsidized "paid milk", or receive free milk. The Milk Program was designed as a form of agricultural subsidy to dairy farmers, as well as a means of raising milk consumption among school children.
History
Originally, the program was variously referred to as either the School Milk Program, the Special Milk Program, or the Special School Milk Program. The "School Milk Program" name is still used by some sources.
With the United States having just entered World War II, the Department of Agriculture released a pamphlet promoting the Milk Program in 1942. It referred to milk as a "Victory Food", and stated that it hoped to reduce malnutrition and hidden hunger among American school children through the program. It was also intended to provide farmers with a fair return on their product.
Previously, the program was authorized under the Agricultural Act of 1954. The Department of Agriculture intended to provide students with wider access to milk. It was designed to provide price supports for dairy products. The Milk Program has served nonprofit camps run by organizations such as the Boy Scouts.
The Special Milk Program is now permanently authorized under the Child Nutrition Act of 1966 (P.L. 89-642, as amended; 42 U.S.C. 1771 et seq.).
The program is federally administered by the Food and Nutrition Service, and funded by annual agricultural appropriations. At a state-level the program is usually administered by state education agencies. Schools are reimbursed for each half pint served to eligible students. The reimbursement rate is determined every July 1 by the U.S. Department of Agriculture. The annual rate adjustment reflects changes in the Producer Price Index for Fluid Milk Products.
Eligibility
Participating institutions must operate their milk programs on a non-profit basis. To be eligible for the Special Milk Program, an institution must not participate in other federally subsidized meal programs like the National School Lunch Program.
There is an exception from the eligibility limitation for kindergarten and pre-kindergarten children in split session programs, meaning "an education program operating for approximately one-half of the regular school day."
Schools may offer free milk to children meeting free lunch income requirements, if they choose, and this milk is reimbursed at full cost. Otherwise, children buy so-called paid milk, which is subsidized at a legislatively set rate for each half-pint served. A child's family must re-apply annually for free milk eligibility.
Only pasteurized fluid type fat-free or low-fat (1%) milk may be offered. Flavored milk is allowed for children six and over. With a doctor's note, a student may receive a substitute if they have a disability which prevents them from consuming cow's milk, granted certain nutrition standards are met for the substitute.
Budget and impact
A 1957 report found an increase in average daily milk consumption among school children in Los Angeles, at 68% in elementary schools, 250% in junior high schools, and 200% in senior high schools. A 1960 study found that children attending participating schools drank an average of 1.7 more ounces per capita per day of milk. A 1978 national survey by the Food and Nutrition Service found similar: the program raised student milk consumption by 42% in participating schools.
In 2008, 4,676 schools and residential child care institutions participated in the Special Milk Program, along with 743 summer camps and 522 non-residential child care institutions. Over 85 million half pints of milk were served that year through the program, down from 3 billion half pints served through it in 1969, 1.8 billion in 1980, and 181 million in 1990. The Special Milk Program's reach and budget has been reduced due to the expansion of the National School Lunch Program and School Breakfast Programs, which include milk.
Federal spending on the program was at 11.9 million by FY 2010. This was down from 101.2 million in FY 1970.
See also
Butter mountain
Child and Adult Care Food Program
Got Milk?
Government cheese
National School Lunch Act
School Breakfast Program
References
Milk
United States Department of Agriculture programs
School meal programs in the United States
External links
United States Department of Agriculture page
Benefits.gov page |
Margo Hayes (born February 11, 1998) is an American professional rock climber from Boulder, Colorado. In 2016, she won both the competition bouldering and the competition lead climbing events at the IFSC Climbing World Youth Championships in Guangzhou (China). In 2017, she became the first woman in history to climb a graded route, and in 2019, became the first woman to complete the "9a+ Trilogy".
Early life
Originally a gymnast who trained at CATS Gymnastics in Boulder, Hayes began climbing at age 10. She joined Team ABC, a renowned youth climbing program in Boulder, where she was coached by Robyn Erbesfield-Raboutou. Hayes' grandfather, Dr. James Morrissey, led the first successful climb of the Kangshung Face on Mt. Everest and her father spent time climbing in Yosemite Valley.
Climbing career
Competition climbing
As part of the US National Team, Hayes has competed in all three disciplines (lead climbing, speed climbing, and bouldering) of the International Federation of Sport Climbing competitions. In 2015, at the IFSC World Youth Championships in Arco, Italy Hayes won silver both in bouldering and lead, behind Janja Garnbret.
In 2016, at the IFSC World Youth Championships in Guangzhou (China), she competed in the Juniors category, winning both the bouldering and lead events, placing 15th in speed, and placing first in the overall standings.
Hayes was one of four women to earn a spot on the 2019 U.S. Overall National Team as a first step to qualifying for the 2020 Olympics climbing competition.
Sport climbing
In 2016, Hayes won a in the Sport Climbing category from Climbing Magazine for successfully climbing 14 routes graded 5.14.
On February 26, 2017, Hayes became the first-ever woman in history to climb a graded route when she ascended La Rambla, in Siurana, Spain). On September 24, 2017, she also completed the third-ever female ascent of a when she ascended Realization/Biographie, in Céüse, in France. In March 2019, Hayes completed her third , climbing Papichulo at Oliana, Spain, and thus completing the trilogy of the "benchmark" and most notable graded routes.
Personal life
In 2016 she won a prize in a scholastic art show.
Rankings
2019 - USA Climbing Open Bouldering Championships - Bronze
2018 - IFSC Climbing World Championships Female Boulder - 10th
2017 - IFSC Youth World Championships Female Junior Combined - Bronze
2017 - USA Climbing Sport & Speed Climbing Champions - Silver
2017 - IFSC Pan American Youth Championships Female Junior Boulder - Gold
2017 - IFSC Pan American Youth Championships Female Junior Lead - Silver
2016 - USA Climbing Sport & Speed Climbing Champions - Gold
2016 - IFSC Youth World Championships Female Junior Boulder - Gold
2016 - IFSC Youth World Championships Female Junior Lead - Gold
2015 - USA Climbing Sport & Speed Climbing Champions - Silver
2015 - IFSC Youth World Championships Female Youth A Boulder - Silver
2015 - IFSC Youth World Championships Female Youth A Lead - Silver
Notable ascents
Redpointed routes
:
Papichulo – Oliana (ESP) – March 24, 2019 – First female ascent. Hayes became the first female to complete the "9a+ trilogy".
Realization/Biographie – Céüse (FRA) – September 24, 2017 – First female ascent of one of the famous routes in sport climbing.
La Rambla – Siurana (ESP) – February 26, 2017 – First-ever female ascent in history of a consensus climb.
:
Bad Girls Club – Wicked Cave (Rifle Mountain Park. (USA) – August 2016 – First female ascent.
:
The Crew – Rifle Mountain Park (Colorado, (USA) – June 2016.
Filmography
Break on Through - 2017 film directed by Matty Hong, documenting Hayes' ascent of La Rambla and Biographie, featured on Reel Rock 12.
See also
Notable first free ascents
References
External links
1998 births
Living people
American female climbers
Sportspeople from Boulder, Colorado
Competitors at the 2017 World Games
21st-century American women
Golden Piton winners |
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package v1
// This file contains a collection of methods that can be used from go-restful to
// generate Swagger API documentation for its models. Please read this PR for more
// information on the implementation: path_to_url
//
// TODOs are ignored from the parser (e.g. TODO(andronat):... || TODO:...) if and only if
// they are on one line! For multiple line or blocks that you want to ignore use ---.
// Any context after a --- is ignored.
//
// Those methods can be generated by using hack/update-codegen.sh
// AUTO-GENERATED FUNCTIONS START HERE. DO NOT EDIT.
var map_AggregationRule = map[string]string{
"": "AggregationRule describes how to locate ClusterRoles to aggregate into the ClusterRole",
"clusterRoleSelectors": "ClusterRoleSelectors holds a list of selectors which will be used to find ClusterRoles and create the rules. If any of the selectors match, then the ClusterRole's permissions will be added",
}
func (AggregationRule) SwaggerDoc() map[string]string {
return map_AggregationRule
}
var map_ClusterRole = map[string]string{
"": "ClusterRole is a cluster level, logical grouping of PolicyRules that can be referenced as a unit by a RoleBinding or ClusterRoleBinding.",
"metadata": "Standard object's metadata.",
"rules": "Rules holds all the PolicyRules for this ClusterRole",
"aggregationRule": "AggregationRule is an optional field that describes how to build the Rules for this ClusterRole. If AggregationRule is set, then the Rules are controller managed and direct changes to Rules will be stomped by the controller.",
}
func (ClusterRole) SwaggerDoc() map[string]string {
return map_ClusterRole
}
var map_ClusterRoleBinding = map[string]string{
"": "ClusterRoleBinding references a ClusterRole, but not contain it. It can reference a ClusterRole in the global namespace, and adds who information via Subject.",
"metadata": "Standard object's metadata.",
"subjects": "Subjects holds references to the objects the role applies to.",
"roleRef": "RoleRef can only reference a ClusterRole in the global namespace. If the RoleRef cannot be resolved, the Authorizer must return an error. This field is immutable.",
}
func (ClusterRoleBinding) SwaggerDoc() map[string]string {
return map_ClusterRoleBinding
}
var map_ClusterRoleBindingList = map[string]string{
"": "ClusterRoleBindingList is a collection of ClusterRoleBindings",
"metadata": "Standard object's metadata.",
"items": "Items is a list of ClusterRoleBindings",
}
func (ClusterRoleBindingList) SwaggerDoc() map[string]string {
return map_ClusterRoleBindingList
}
var map_ClusterRoleList = map[string]string{
"": "ClusterRoleList is a collection of ClusterRoles",
"metadata": "Standard object's metadata.",
"items": "Items is a list of ClusterRoles",
}
func (ClusterRoleList) SwaggerDoc() map[string]string {
return map_ClusterRoleList
}
var map_PolicyRule = map[string]string{
"": "PolicyRule holds information that describes a policy rule, but does not contain information about who the rule applies to or which namespace the rule applies to.",
"verbs": "Verbs is a list of Verbs that apply to ALL the ResourceKinds contained in this rule. '*' represents all verbs.",
"apiGroups": "APIGroups is the name of the APIGroup that contains the resources. If multiple API groups are specified, any action requested against one of the enumerated resources in any API group will be allowed. \"\" represents the core API group and \"*\" represents all API groups.",
"resources": "Resources is a list of resources this rule applies to. '*' represents all resources.",
"resourceNames": "ResourceNames is an optional white list of names that the rule applies to. An empty set means that everything is allowed.",
"nonResourceURLs": "NonResourceURLs is a set of partial urls that a user should have access to. *s are allowed, but only as the full, final step in the path Since non-resource URLs are not namespaced, this field is only applicable for ClusterRoles referenced from a ClusterRoleBinding. Rules can either apply to API resources (such as \"pods\" or \"secrets\") or non-resource URL paths (such as \"/api\"), but not both.",
}
func (PolicyRule) SwaggerDoc() map[string]string {
return map_PolicyRule
}
var map_Role = map[string]string{
"": "Role is a namespaced, logical grouping of PolicyRules that can be referenced as a unit by a RoleBinding.",
"metadata": "Standard object's metadata.",
"rules": "Rules holds all the PolicyRules for this Role",
}
func (Role) SwaggerDoc() map[string]string {
return map_Role
}
var map_RoleBinding = map[string]string{
"": "RoleBinding references a role, but does not contain it. It can reference a Role in the same namespace or a ClusterRole in the global namespace. It adds who information via Subjects and namespace information by which namespace it exists in. RoleBindings in a given namespace only have effect in that namespace.",
"metadata": "Standard object's metadata.",
"subjects": "Subjects holds references to the objects the role applies to.",
"roleRef": "RoleRef can reference a Role in the current namespace or a ClusterRole in the global namespace. If the RoleRef cannot be resolved, the Authorizer must return an error. This field is immutable.",
}
func (RoleBinding) SwaggerDoc() map[string]string {
return map_RoleBinding
}
var map_RoleBindingList = map[string]string{
"": "RoleBindingList is a collection of RoleBindings",
"metadata": "Standard object's metadata.",
"items": "Items is a list of RoleBindings",
}
func (RoleBindingList) SwaggerDoc() map[string]string {
return map_RoleBindingList
}
var map_RoleList = map[string]string{
"": "RoleList is a collection of Roles",
"metadata": "Standard object's metadata.",
"items": "Items is a list of Roles",
}
func (RoleList) SwaggerDoc() map[string]string {
return map_RoleList
}
var map_RoleRef = map[string]string{
"": "RoleRef contains information that points to the role being used",
"apiGroup": "APIGroup is the group for the resource being referenced",
"kind": "Kind is the type of resource being referenced",
"name": "Name is the name of resource being referenced",
}
func (RoleRef) SwaggerDoc() map[string]string {
return map_RoleRef
}
var map_Subject = map[string]string{
"": "Subject contains a reference to the object or user identities a role binding applies to. This can either hold a direct API object reference, or a value for non-objects such as user and group names.",
"kind": "Kind of object being referenced. Values defined by this API group are \"User\", \"Group\", and \"ServiceAccount\". If the Authorizer does not recognized the kind value, the Authorizer should report an error.",
"apiGroup": "APIGroup holds the API group of the referenced subject. Defaults to \"\" for ServiceAccount subjects. Defaults to \"rbac.authorization.k8s.io\" for User and Group subjects.",
"name": "Name of the object being referenced.",
"namespace": "Namespace of the referenced object. If the object kind is non-namespace, such as \"User\" or \"Group\", and this value is not empty the Authorizer should report an error.",
}
func (Subject) SwaggerDoc() map[string]string {
return map_Subject
}
// AUTO-GENERATED FUNCTIONS END HERE
``` |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.