text stringlengths 1 22.8M |
|---|
Whoever Slew Auntie Roo? (U.S. title: Who Slew Auntie Roo?) is a 1972 horror-thriller film directed by Curtis Harrington and starring Shelley Winters, Mark Lester, and Sir Ralph Richardson. Based partly on the fairy tale "Hansel and Gretel", the film focuses on a demented American widow living in her husband's English manor who becomes obsessed with a young orphan girl who resembles her dead daughter.
A co-production between the United States and the United Kingdom, the film was shot at Shepperton Studios in London. Like What Ever Happened to Baby Jane?, Hush...Hush, Sweet Charlotte, What Ever Happened to Aunt Alice, and What's the Matter with Helen?, it is one of the many films in the psycho-biddy subgenre. Whoever Slew Auntie Roo? and the latter film, also starring Winters, were released on DVD as a MGM Midnite Movies Double Feature, and Winters requested that Helen'''s director Harrington direct the picture.
Plot
Every year, Rosie Forrest, known as "Auntie Roo", throws a lavish overnight Christmas party for ten of the best-mannered children at the local orphanage. Despite her warm demeanour, Rosie is in fact demented and mentally ill and keeps the mummified remains of her daughter Katharine in a nursery room in the attic.
Christopher and Katy Coombs, an orphaned brother and sister, sneak into the party. Auntie Roo notices that Katy resembles her late daughter and warmly welcomes her and her brother. After the party ends, Auntie Roo kidnaps Katy with the intention of making her a substitute for Katherine. Christopher believes Auntie Roo is a witch who wants to devour him and his sister. He tries to warn people about Auntie Roo, and when no one believes him he returns to the house alone to rescue his sister.
Auntie Roo prepares a dinner for the coming New Year while Christopher assists her by gathering firewood. In the process, he steals the key to the nursery room and lets Katy out. During their escape, they steal Auntie Roo's jewelry and stuff it inside an old teddy bear that once belonged to Katharine. Christopher and Katy fight their way out of Auntie Roo's mansion. Once outside, they place the firewood at the door and set it on fire.
The orphans encounter Auntie Roo's butcher, Mr. Harrison, who is delivering a whole piglet by horsecart. He sees the smoke inside and drives off to call the fire brigade. Katy realizes that she was to cook the pig, but Christopher says that they were to be eaten after it. The fire brigade arrives and puts out the fire but are unable to rescue Auntie Roo. Inspector Willoughby takes the children back to the orphanage. Christopher and Katy smile at each other as they depart from the burned mansion, knowing that Auntie Roo will not harm anyone else and that they can use her jewelry (which Christopher calls "the wicked witch's treasure") to ensure their own happy ending.
Cast
Production
A co-production between the United States and the United Kingdom, the film was shot at Shepperton Studios in Shepperton, England. The film was financed by AIP and the British company, Hemdale, who represented Mark Lester. It was one of three films financed by Hemdale (the others were Where Does It Hurt? and Love on Horseback) with a total budget of £1,250,000.
Harrington was going to direct Wuthering Heights in England for AIP but did this instead after Shelley Winters requested him. Shelley Winters had worked with Harrington on What's the Matter with Helen? and asked for him on this movie "because of his ability with actors. I thought he would be wonderful." Harrington says it was not a project "I personally wanted particularly to do."
The film was based on a storyline from Jimmy Sangster inspired by Hansel and Gretel. Sam Arkoff and James Nicholson of AIP hired Robert Blees to write a script which Harrington was dissatisfied with so the director arranged for the script to be rewritten by Gavin Lambert.
Even after this Harrington said "It had a very weak, incredibly lousy script... what I finally shot is an incredible imporovment over the original. Even so, it was very difficult to do enough with it to make it work."
Harrington says it was his idea to set the film in the 1920s. "I have a great fondness for all the imagery and quality of the traditional Victorian Christmas celebration. I tried to put as much as I could of that in the film."
Harrington enjoyed working with Louis Heyward and says he was the one who suggested Ralph Richardson. Harrington says the only actor the producers "imposed on me" was Michael Gothard who Harrington called a "lousy actor" and "a pain in the arse."
The film was originally called The Gingerbread House which Harrington felt was the best title but it had to be changed due to its similarities to the Neil Simon play, The Gingerbread Lady.
At one stage the film was called The Best of Friends. Filming was going to commence on 30 November 1970 but then was pushed back until April 1971. It mostly took place at Shepperton Studios.
Harrington felt Mark Lester was not interested in acting but the director enjoyed working with Chloe Franks.
ReleaseWhoever Slew Auntie Roo? was released theatrically in the United States in late 1971, opening regionally in several cities in Ohio and Pennsylvania on December 22, 1971.
Shelley Winters said "If they’d had a bigger budget and released it differently, things would have been a lot different for him and me. They didn’t release it like an A-picture and they should have. We had a great deal of fun rehearsing. Ralph Richardson was great in it. But they released it like a spooky, spooky picture and they shouldn’t have."
ReceptionVariety said "script is overly-contrived, but carries certain element of interest that may see it through selected bookings."
Harrington called it "just a rather thin little fable. I found Shelley Winter’s mad behavior vastly amusing... I do feel that I had achieved the pathos of the situation at the end... I still think that whatever flaws it had. it turned out astonishingly well, considering that it was a terrible uphill struggle for me all the way."
On Rotten Tomatoes, the film holds an approval rating of 60% based on , with a weighted average rating of 4.8/10.
Craig Butler from Allmovie wrote, "If one is in the right frame of mind, Who Slew Auntie Roo? can be a lot of ghoulish fun. It's not good, mind you; as a matter of fact, Roo is basically trash. But it's campy and silly and just the ticket if you're in the mood for a film that makes you groan at its inanity as often as it makes you shiver." On his website Fantastic Movie Musings and Ramblings, Dave Sindelar stated that the film "never really becomes either a full-blooded horror movie or an effective variation on the fairy tale. The scare scenes would be more effective if they didn’t seem so arbitrary, and the last third of the movie fails to build up the necessary tension or suspense." TV Guide awarded the film 2/5 stars and stated that the film "walks a fine line between good and bad taste, manipulating audience expectations and loyalties gleefully and shamelessly." The Terror Trap gave the film 3/4 stars, writing, "A nice retelling of the classic fairy tale Hansel and Gretel (with Winters clearly delighting in the devilish role), this is lovingly directed by genre regular Curtis Harrington."
See also
Psycho-biddy
What Ever Happened to Baby Jane? (1962)
Hush...Hush, Sweet Charlotte (1964)
What Ever Happened to Aunt Alice? (1969)
What's the Matter with Helen? (1971)
Dear Dead Delilah'' (1972)
References
Notes
External links
1972 films
1972 horror films
1970s Christmas films
1970s Christmas horror films
1970s horror thriller films
American Christmas horror films
American horror thriller films
American International Pictures films
British Christmas horror films
British horror thriller films
Films about orphans
Films based on Hansel and Gretel
Films directed by Curtis Harrington
Films set in country houses
Films shot at Shepperton Studios
Films with screenplays by Jimmy Sangster
Psycho-biddy films
1970s English-language films
1970s American films
1970s British films |
Events from the year 1964 in the United States.
Incumbents
Federal government
President: Lyndon B. Johnson (D–Texas)
Vice President: vacant
Chief Justice: Earl Warren (California)
Speaker of the House of Representatives: John William McCormack (D–Massachusetts)
Senate Majority Leader: Mike Mansfield (D–Montana)
Congress: 88th
Events
January
January 3 – Senator Barry Goldwater of Arizona announces that he will seek the Republican nomination for president.
January 7 – A British firm, the Leyland Motor Corp., announces the sale of 450 buses to the Cuban government, challenging the United States blockade of Cuba.
January 8 – In his first State of the Union Address, U.S. President Lyndon Johnson declares a "War on Poverty".
January 9 – Martyrs' Day: Armed clashes between United States troops and Panamanian civilians in the Panama Canal Zone precipitate a major international crisis, resulting in the deaths of 21 Panamanians and 4 U.S. soldiers.
January 10 – Introducing...the Beatles is released by Chicago's Vee-Jay Records to get the jump on Capitol Records' release of Meet the Beatles!, scheduled for January 20. The two record companies fight in court over Vee-Jay's release of the album.
January 11 – United States Surgeon General Luther Leonidas Terry reports that smoking may be hazardous to one's health, the first such statement from the U.S. government.
January 12
The predominantly Arab government of Zanzibar is overthrown by African nationalist rebels; a United States Navy destroyer evacuates 61 U.S. citizens.
Routine U.S. naval patrols of the South China Sea begin.
January 13 – In Manchester, New Hampshire, 14-year-old Pamela Mason is murdered. Edward Coolidge is tried and convicted of the crime, but the conviction is set aside by the landmark Fourth Amendment case Coolidge v. New Hampshire (1971).
January 15
The nightclub Whisky a Go Go opens its doors on Sunset Strip in Hollywood. Johnny Rivers leads the first house band at the club, which helps pave the club's way to international fame and contributes to the beginning of rock n' roll on the Strip.
The Teamsters union negotiates the first national labor contract in the United States.
San Francisco Giants make champion outfielder Willie Mays the highest-paid player in baseball when they sign him to a new $105,000 per season contract.
January 16
John Glenn, the first American to orbit the Earth, resigns from the space program.
The musical Hello, Dolly! opens in New York City's St. James Theatre.
January 17
John Glenn announces that he will seek the Democratic nomination for U.S. Senator from Ohio.
Roald Dahl's Charlie and the Chocolate Factory is published by Alfred A. Knopf, Inc. in the United States.
January 18 – Plans to build the World Trade Center in New York City are announced.
January 20 – Meet the Beatles!, the first Capitol Records Beatles album in the United States, is released.
January 23
Thirteen years after its proposal and nearly 2 years after its passage by the United States Senate, the 24th Amendment to the United States Constitution, prohibiting the use of poll taxes in national elections, is ratified.
Arthur Miller's After the Fall opens Off-Broadway. A semi-autobiographical work, it arouses controversy over his portrayal of late ex-wife Marilyn Monroe.
Designed by McKim, Mead & White, the Smithsonian Institution's Museum of History and Technology, predecessor of the National Museum of American History, opens to the public in Washington, D.C.
January 27 – U.S. Senator Margaret Chase Smith, 66, announces her candidacy for the Republican presidential nomination.
January 28 – A U.S. Air Force jet training plane that strays into East Germany is shot down by Soviet fighters near Erfurt; all 3 crew men are killed.
January 29 – Ranger 6 is launched by NASA, on a mission to carry television cameras and crash-land on the Moon.
February
February 1 – The Beatles vault to the #1 spot on the U.S. singles charts for the first time, with "I Want to Hold Your Hand", starting the British Invasion in America.
February 3 – Protesting against alleged de facto school racial segregation, Black and Puerto Rican groups in New York City boycott public schools.
February 4
The Government of the United States authorizes the Twenty-fourth Amendment, outlawing the poll tax.
General Motors introduces the Oldsmobile Vista Cruiser and the Buick Sport Wagon.
February 6 – Cuba cuts off the normal water supply to the United States Guantanamo Bay Naval Base, in reprisal for the U.S. seizure 4 days earlier of 4 Cuban fishing boats off the coast of Florida.
February 7
An all-white jury in Jackson, Mississippi, trying Byron De La Beckwith for the murder of Medgar Evers in June 1963, reports that it cannot reach a verdict, resulting in a mistrial.
The Beatles arrive from the UK at New York City's JFK International Airport, receiving a tumultuous reception from an estimated 4,000, marking the first occurrence of "Beatlemania" in the United States. The "Fab Four" stay in suites 1260, 1263, 1264 and 1273 of the Plaza Hotel.
February 9 – The Beatles appear on The Ed Sullivan Show, marking their first live performance on American television. Seen by an estimated 73 million viewers, the appearance becomes the catalyst for the mid-1960s "British Invasion" of American popular music.
February 17 – Wesberry v. Sanders (376 US 1 1964): The Supreme Court of the United States rules that congressional districts have to be approximately equal in population.
February 23 – Chrysler's second generation Hemi racing engine is showcased at the Daytona 500. The 426 hemi-powered Plymouth of Richard Petty (#43) wins. Hemi-powered Plymouths finish in first, second and third places.
February 25 – Muhammad Ali vs. Sonny Liston: Cassius Clay beats Sonny Liston in Miami Beach, Florida, and is crowned heavyweight boxing champion of the world. This evening he celebrates in a hotel room with his three closest friends, activist Malcolm X, singer Sam Cooke and American football fullback Jim Brown, and soon afterwards changes his name.
February 26 – U.S. politician and ex-astronaut John Glenn slips on a bathroom rug in his Columbus, Ohio apartment and hits his head on the bathtub, injuring his left inner ear, and prompting him (later that week) to withdraw from the race for the Democratic Party Senate nomination.
February 29 – U.S. President Lyndon B. Johnson announces that the United States has developed a jet airplane (the A-11), capable of sustained flight at more than and of altitudes of more than .
March
March 4 – President of the Teamsters, Jimmy Hoffa is convicted by a federal jury of jury tampering in 1962 and receives a jail sentence.
March 6
Malcolm X, suspended from the Nation of Islam, says in New York City that he is forming a black nationalist party.
Boxer Cassius Clay announces the change of his name to Muhammad Ali.
March 8 – Malcolm X, suspended from the Nation of Islam, says in New York City that he is forming a black nationalist party.
March 9
New York Times Co. v Sullivan (376 US 254 1964): The United States Supreme Court rules that under the First Amendment, speech criticizing political figures cannot be censored.
The first Ford Mustang is manufactured, by the Ford Motor Company, in Dearborn, Michigan.
March 10
Soviet military forces shoot down an unarmed reconnaissance bomber that had strayed into East Germany; the 3 U.S. flyers parachute to safety.
Henry Cabot Lodge Jr., Ambassador to South Vietnam, wins the New Hampshire Republican primary.
March 12 – Malcolm X leaves the Nation of Islam.
March 13 – It is falsely reported that 38 neighbors in Queens, New York City fail to respond to the cries of Kitty Genovese, 28, as she is being stabbed to death.
March 14 – A Dallas, Texas jury finds Jack Ruby guilty of killing John F. Kennedy assassin Lee Harvey Oswald.
March 26 – U.S. Defense Secretary Robert McNamara delivers an address that reiterates American determination to give South Vietnam increased military and economic aid, in its war against the Communist insurgency.
March 27 – The Good Friday earthquake, the most powerful earthquake in U.S. history at a magnitude of 9.2, strikes South Central Alaska, killing 125 people and inflicting massive damage to the city of Anchorage, Alaska.
March 30 – Merv Griffin's game show Jeopardy! debuts on NBC; Art Fleming is its first host.
March 31 – The military, backed by the US, overthrows Brazilian President João Goulart in a coup, starting 21 years of dictatorship in Brazil.
April
April 2 – Mrs. Malcolm Peabody, 72, mother of Massachusetts Governor Endicott Peabody, is released on $450 bond after spending 2 days in a St. Augustine, Florida jail, for participating in an anti-segregation demonstration there.
April 3 – Malcolm X makes his "The Ballot or the Bullet" speech in Cleveland.
April 4
Three high school friends in Hoboken, N.J., open the first BLIMPIE on Washington Street.
The Beatles hold the top 5 positions in the Billboard Top 40 singles in the United States, an unprecedented achievement. The top songs in America as listed on April 4, in order, are: "Can't Buy Me Love", "Twist and Shout", "She Loves You", "I Want to Hold Your Hand", and "Please Please Me".
April 7 – IBM announces the System/360 computer.
April 8 – Four of 5 railroad operating unions strike against the Illinois Central Railroad without warning, bringing to a head a 5-year dispute over railroad work rules.
April 10 – Demolition of the Polo Grounds sports stadium commences in New York City.
April 12 – In Detroit, Michigan, Malcolm X delivers a speech entitled "The Ballot or the Bullet."
April 13 – The 36th Academy Awards ceremony, hosted by Jack Lemmon, is held at Santa Monica Civic Auditorium. Tony Richardson's Tom Jones is tied with Joseph L. Mankiewicz's Cleopatra for the most award wins with four, winning Best Picture and Best Director for Richardson. The film receives the most nominations with ten. Sidney Poitier also becomes the first black actor to win the award for Best Actor.
April 14 – A Delta rocket's third-stage motor ignites prematurely in an assembly room at Cape Canaveral, killing 3.
April 17
In the United States, the Ford Mustang is officially unveiled to the public.
Shea Stadium opens in Flushing, New York.
April 20 – U.S. President Lyndon Johnson in New York, and Soviet Premier Nikita Khrushchev in Moscow, simultaneously announce plans to cut back production of materials for making nuclear weapons.
April 22 – The 1964 New York World's Fair opens to celebrate the 300th anniversary of New Amsterdam being taken over by British forces under the Duke of York (later King James II) and being renamed New York in 1664. The fair runs until Oct. 18, 1964 and reopens April 21, 1965, finally closing October 17, 1965. (Not sanctioned, due to being within 10 years of the Seattle World's Fair in 1962, some countries decline, but many countries have pavilions with exotic crafts, art & food.)
May
May 2
Senator Barry Goldwater receives more than 75% of the votes in the Texas Republican presidential primary.
Some 400–1,000 students march through Times Square, New York and another 700 in San Francisco, in the first major student demonstration against the Vietnam War. Smaller marches also occur in Boston, Seattle, and Madison, Wisconsin.
Henry Hezekiah Dee and Charles Eddie Moore, hitchhiking in Meadville, Mississippi, are kidnapped, beaten, and murdered by members of the Ku Klux Klan. Their badly decomposed bodies are found by chance in July during the search for missing activists Chaney, Goodman, and Schwerner.
May 7 – Pacific Air Lines Flight 773 crashes near San Ramon, California, killing all 44 aboard; the FBI later reports that a cockpit recorder tape indicates that the pilot and co-pilot had been shot by a suicidal passenger.
May 12 – First draft-card burning: 12 young men in New York publicly burn their draft cards as an act of resistance to the Vietnam War.
May 19 – The United States Department of State says that more than 40 hidden microphones have been found embedded in the walls of the U.S. Embassy in Moscow.
May 22 – President Lyndon Johnson makes a speech at the University of Michigan, introducing the concept of the "Great Society".
May 26 – Nelson Rockefeller defeats Barry Goldwater in the Oregon Republican primary, slowing but not stalling Goldwater's drive toward the presidential nomination.
May 30 – Eddie Sachs and Dave MacDonald are killed in a fiery crash during the 1964 Indianapolis 500.
June
June 2
Senator Barry Goldwater wins the California Republican primary, making him the overwhelming favorite for the party's nomination as President of the United States.
Five million shares of stock in the Communications Satellite Corporation (Comsat) are offered for sale at $20 a share, and the issue is quickly sold out.
June 9 – In Federal Court in Kansas City, Kansas, Army deserter George John Gessner, 28, is convicted of passing United States secrets to the Soviet Union.
June 10
The U.S. Senate votes cloture of the Civil Rights Bill after a 75-day filibuster.
The Deacons for Defense and Justice (Black self-defense organization) is founded in Jonesboro, Louisiana.
June 12 – Pennsylvania Governor William Scranton announces his candidacy for the Republican presidential nomination, as part of a 'stop-Goldwater' movement.
June 14 – Freedom Summer, a volunteer Civil Rights project intended to promote voter registration for as many African Americans as possible in Mississippi, begins with orientation sessions for the 300 volunteers at Western College for Women, Oxford, Ohio.
June 19 – U.S. Senator Edward Kennedy, 32, is seriously injured in a private plane crash at Southampton, Massachusetts; the pilot is killed.
June 21
Civil Rights Movement: Murders of Chaney, Goodman, and Schwerner – Three Congress of Racial Equality workers, Michael Schwerner, Andrew Goodman and James Chaney, are abducted and murdered near Philadelphia, Mississippi, by local members of the White Knights of the Ku Klux Klan with local law enforcement officials involved in the conspiracy.
Jim Bunning pitches a perfect game for the Philadelphia Phillies.
July
July 2 – President Lyndon Johnson signs the Civil Rights Act of 1964 into law, abolishing racial segregation in the United States.
July 8 – U.S. military personnel announce that U.S. casualties in Vietnam have risen to 1,387, including 399 dead and 17 MIA.
July 16 – At the Republican National Convention in San Francisco, U.S. presidential nominee Barry Goldwater declares that "extremism in the defense of liberty is no vice", and "moderation in the pursuit of justice is no virtue".
July 18
Six days of race riots begin in Harlem, New York, United States, apparently prompted by the shooting of a teenager.
"False Hare" is the final Warner Bros. cartoon with "target" titles.
July 23 – The first Arby's opens in Boardman, Ohio.
July 24 – There is a minor criticality accident at a United Nuclear Corporation Fuels recovery plant in Wood River Junction, Richmond, Rhode Island. 37-year-old Robert Peabody dies two days after the incident.
July 27 – Vietnam War: The U.S. sends 5,000 more military advisers to South Vietnam, bringing the total number of United States forces in Vietnam to 21,000.
August
August 1 – The final Looney Tune, Señorella and the Glass Huarache, is released before the Warner Bros. cartoon division is shut down by Jack Warner.
August 2–4 – Vietnam War – Gulf of Tonkin incident: United States destroyers and are attacked in the Gulf of Tonkin. Air support from the carrier sinks one gunboat, while the other two leave the battle.
August 4 – Murders of Chaney, Goodman, and Schwerner – The bodies of Michael Schwerner, Andrew Goodman and James Chaney, murdered in June, are found.
August 5 – Vietnam War: Operation Pierce Arrow – Aircraft from carriers and bomb North Vietnam in retaliation for strikes against U.S. destroyers in the Gulf of Tonkin.
August 7 – Vietnam War: The United States Congress passes the Gulf of Tonkin Resolution, giving U.S. President Lyndon B. Johnson broad war powers to deal with North Vietnamese attacks on U.S. forces.
August 16 – Vietnam War: In a coup, General Nguyễn Khánh replaces Dương Văn Minh as South Vietnam's chief of state and establishes a new constitution, drafted partly by the U.S. Embassy.
August 17 – Margaret Harshaw, Metropolitan Opera Soprano, sings the role of Turandot in Puccini's opera Turandot at the New York World's Fair. August 21, 1964
August 22 – Fannie Lou Hamer, civil rights activist and Vice Chair of the Mississippi Freedom Democratic Party, addresses the Credentials Committee of the Democratic National Convention, challenging the all-white Mississippi delegation.
August 24–27 – The Democratic National Convention in Atlantic City nominates incumbent President Lyndon B. Johnson for a full term, and U.S. Senator Hubert Humphrey of Minnesota as his running mate.
August 27 – Walt Disney's Mary Poppins has its world premiere in Los Angeles. It will go on to become Disney's biggest moneymaker, and winner of 5 Academy Awards, including a Best Actress award for Julie Andrews, who accepted the part after she was passed over by Jack L. Warner for the leading role of Eliza Doolittle in the film version of My Fair Lady. Mary Poppins is the first Disney film to be nominated for Best Picture.
August 28 – Bob Dylan turns the Beatles on to cannabis for the first time.
August 28–30 – Philadelphia 1964 race riot: Tensions between African American residents and police lead to 341 injuries and 774 arrests.
September
September 4 – The last execution in the U.S. for a crime other than murder occurs in Alabama, as James Coburn is put to death for robbery.
September 7 – President Lyndon Johnson's re-election campaign airs the controversial and influential "Daisy" ad.
September 12 – Canyonlands National Park is established.
September 16 – Shindig! premieres on ABC television, featuring the top musical acts of the decade.
September 17 – Bewitched, starring Elizabeth Montgomery, premieres on ABC.
September 21 – The North American XB-70 Valkyrie makes its first flight at Palmdale, California.
September 26 – The sitcom Gilligan's Island, starring Bob Denver as Gilligan premieres on CBS.
September 27 – The Warren Commission Report, the first official investigation of the assassination of John F. Kennedy, is published.
October
October 1 – Three thousand student activists at University of California, Berkeley surround and block a police car from taking a CORE volunteer arrested for not showing his ID, when he violated a ban on outdoor activist card tables. This protest eventually evolves into the Berkeley Free Speech Movement.
October 10–24 – The United States participates in the 1964 Summer Olympics in Tokyo, Japan and ranks first for the 10th time, bringing home 36 gold, 26 silver and 28 bronze medals for a total of 90 medals.
October 14 – Martin Luther King Jr., a leader in the American civil rights movement, becomes the youngest recipient of the Nobel Peace Prize, which was awarded to him for leading non-violent resistance to end racial prejudice in the United States.
October 15
Craig Breedlove's jet-powered car Spirit of America goes out of control on Bonneville Salt Flats in Utah and makes skid marks long.
The St. Louis Cardinals defeat the visiting New York Yankees 7–5 to win the World Series in 7 games (4–3), ending a long run of 29 World Series appearances in 44 seasons for the Bronx Bombers (also known as the Yankee Dynasty).
October 18 – The New York World's Fair closes for the year (it reopens April 21, 1965).
October 20 – Former President Herbert Hoover dies in New York City.
October 21 – The film version of the hit Lerner and Loewe Broadway stage musical My Fair Lady premieres in New York City. The movie stars Belgian-born Audrey Hepburn in the role of Eliza Doolittle (with her singing voice dubbed by Marni Nixon) and English actor Rex Harrison repeating his stage performance as Professor Henry Higgins, and which will win him his only Academy Award for Best Actor. The film will win seven other Oscars, including Best Picture, but Hepburn will not be nominated. Critics interpret this as a rebuke to studio executive Jack L. Warner for choosing Ms. Hepburn over English singer Julie Andrews.
October 22 – A 5.3 kiloton nuclear device is detonated at the Tatum Salt Dome, from Hattiesburg, Mississippi, as part of the Vela Uniform program. This test is the Salmon phase of the Atomic Energy Commission's Project Dribble.
October 27 – In the Democratic Republic of the Congo, rebel leader Christopher Gbenye takes 60 Americans and 800 Belgians hostage.
October 29 – A collection of irreplaceable gemstones, including the Star of India, is stolen from the American Museum of Natural History in New York City.
October 31 – Campaigning at Madison Square Garden in New York City, President Lyndon Johnson pledges the creation of the Great Society.
October – Dr. Robert Moog demonstrates his prototype synthesizers.
November
November 1 – Mortar fire from North Vietnamese forces rains on the USAF base at Biên Hòa, South Vietnam, killing 4 U.S. servicemen, wounding 72, and destroying 5 B-57 jet bombers and other planes.
November 3 – U.S. presidential election, 1964: Incumbent U.S. President Lyndon B. Johnson defeats Republican challenger Barry Goldwater with over 60 percent of the popular vote.
November 5 – Mariner program: Mariner 3, a U.S. space probe intended for Mars, is launched from Cape Kennedy but fails.
November 13 – Bob Pettit (St. Louis Hawks) becomes the first NBA player to score 20,000 points.
November 19 – The United States Department of Defense announces the closing of 95 military bases and facilities, including the Brooklyn Navy Yard, the Brooklyn Army Terminal, and Fort Jay, New York.
November 28
Mariner program: NASA launches the Mariner 4 space probe from Cape Kennedy toward Mars to take television pictures of that planet in July 1965.
Vietnam War: United States National Security Council members, including Robert McNamara, Dean Rusk, and Maxwell Taylor, agree to recommend a plan for a 2-stage escalation of bombing in North Vietnam, to President Lyndon B. Johnson.
December
December 1 – Vietnam War: U.S. President Lyndon B. Johnson and his top-ranking advisers meet to discuss plans to bomb North Vietnam (after some debate, they agree on a 2-phase bombing plan).
December 3 – Berkeley Free Speech Movement: Police arrest about 800 students at the University of California, Berkeley, following their takeover of and massive sit-in at the Sproul Hall administration building. The sit-in most directly protested the U.C. Regents' decision to punish student activists for what many thought had been justified civil disobedience earlier in the conflict.
December 6 – The 1-hour stop-motion animated special Rudolph the Red-Nosed Reindeer, based on the popular Christmas song, is broadcast for the first time, on NBC. It becomes a Christmas tradition.
December 10 – Martin Luther King Jr. is awarded the Nobel Peace Prize in Oslo, Norway.
December 11
Sam Cooke, African American singer-songwriter, is shot and killed at a motel in Los Angeles, California.
Che Guevara addresses the United Nations General Assembly; a bazooka attack is launched at the Headquarters of the United Nations in New York City.
December 14 – Heart of Atlanta Motel v. United States (379 US 241 1964): The U.S. Supreme Court rules that, in accordance with the Civil Rights Act of 1964, establishments providing public accommodations must refrain from racial discrimination.
December 15 – The Washington Post publishes an article about James Hampton, who had built a glittering religious throne out of recycled materials.
December 18
In the wake of deadly riots in January over control of the Panama Canal, the U.S. offers to negotiate a new canal treaty.
The deadly Christmas flood of 1964 begins, affecting the United States' Pacific Northwest and some of Northern California. It continues until January 7 and results in 19 deaths, damage to 10 towns, serious damage to 20 major highway and county bridges, and the loss of 4,000 head of livestock.
December 27 – The Cleveland Browns defeat the Baltimore Colts in the NFL Championship Game.
Undated
Dr. Farrington Daniels' book Direct Use of the Sun's Energy is published by Yale University Press.
Pasadena Maple Leafs, an amateur youth ice hockey club in California is founded.
Ongoing
Cold War (1947–1991)
Space Race (1957–1975)
Vietnam War, U.S. involvement (1964–1973)
Births
January
January 1
Juliana Donald, actress
Dedee Pfeiffer, film and television actress
January 3 – Jon Gibson, Christian musician
January 4 – Dot-Marie Jones, shot putter (competed as Dot Jones) and actress
January 6
Colin Cowherd, talk show host
Charles Haley, American football player and coach
Jacqueline Moore, wrestler
Anthony Scaramucci, financier, entrepreneur, and political figure
January 7 – Nicolas Cage, actor, producer and director
January 10 – Karen and Sarah Josephson, synchronized swimmers
January 12 – Jimmy John Liautaud, entrepreneur and founder of Jimmy John's
January 13 Jeff Bezos founder of amazon
January 14 – Shepard Smith, broadcast journalist
January 17 – Michelle Obama, lawyer, first African-American First Lady of the United States as wife of the 44th president of the United States, Barack Obama
January 20 – Fareed Zakaria, journalist
January 25 – Billy Andrade, golfer
January 29 – Andre Reed, American football player and sportscaster
February
February 10 – Glenn Beck, television and radio host, conservative political commentator, author, television network producer, filmmaker and entrepreneur
February 11
Sarah Palin, politician, Governor of Alaska from 2006 to 2009, and 2008 Republican vice-presidential candidate
Ken Shamrock, mixed martial arts fighter
February 15
Mark Price, basketball player
Chris Farley, actor and comedian (d. 1997)
February 17
Jim Jordan, politician
Buster Olney, journalist
Angelica Page, actress, director, producer and screenwriter
February 18 – Matt Dillon, actor and film director
February 19
Jennifer Doudna, biochemist
Jonathan Lethem, fiction writer
Richard A. Scott, illustrator
February 20
Willie Garson, character actor (died 2021)
French Stewart, screen actor
February 22 – Ed Boon, video game designer
February 24 – Chris Austin, country music singer (died 1991)
March
March 2
Mike Von Erich, professional wrestler (died 1987)
Tim Layana, baseball pitcher player (died 1999)
March 3 – Rod Jones, American football tight end (died 2018)
March 4
Paul Bostaph, thrash metal drummer
Tom Lampkin, baseball player
March 6
Skip Ewing, country singer
Yvette Wilson, African American screen actress and comedian (died 2012)
March 7
Bret Easton Ellis, fiction writer
Wanda Sykes, African American comedian and actress
March 9 – Steve Wilkos, retired police officer and talk show host
March 11 – Vinnie Paul, drummer (Pantera, Damageplan, Hellyeah) (died 2018)
March 18 – Bonnie Blair, speed skater
March 23 – Hope Davis, actress
March 24 – Steve Souza, singer (Exodus)
March 25
LisaGay Hamilton, actress
Mike Henry, actor and voice actor
Vince Offer, writer, director, comedian and pitchman
March 26
Todd Barry, stand-up comedian, actor and voice actor
Cynthia MacGregor, tennis player (died 1996)
Ed Wasser, actor
March 29
Michael A. Jackson, Maryland State Senator
Catherine Cortez Masto, U.S. Senator from Nevada
Ming Tsai, Chinese-American chef
March 30 – Ian Ziering, actor and voice actor
April
April 4
David Cross, actor, writer and stand-up comedian
Robbie Rist, actor, voice actor, singer and musician
April 6
Tim Walz, politician
David Woodard, businessman
April 8
Biz Markie, rapper and DJ (died 2021)
Lisa Guerrero, Hispanic American actress, model and sportscaster/reporter
April 9
Doug Ducey, 23rd Governor of Arizona
Lisa Guerrero, Hispanic actress, model and sportscaster/reporter
April 13 – Page Hannah, television and film actress
April 14
Brian Adams, professional wrestler (died 2007)
Jeff Andretti, race car driver
Jeff Andretti, race car driver
Greg Battle, American-Canadian football player
Stuart Duncan, bluegrass musician
Jim Grabb, tennis player
April 17
Lela Rochon, actress
Maynard James Keenan, singer, actor, and winemaker, frontman of Tool
April 19 – Harris Barton, American football player
April 20
John Carney, American football player
Crispin Glover, actor, author, director, screenwriter, publisher and recording artist
Sean A. Moore, writer (died 1998)
April 21 – Michael Louden, actor (died 2004)
April 24
Cedric the Entertainer, actor and comedian
Augusta Read Thomas, composer
April 25
Hank Azaria, voice actor
Wes Freed, outsider artist (died 2022)
April 28
L'Wren Scott, fashion designer (suicide 2014)
David Hampton, con artist and robber (died 2003)
May
May 1 – Will Kimbrough, singer-songwriter, guitarist and producer
May 4 – Gary Holt, guitarist (Exodus and Slayer)
May 6 – Dana Hill, voice actress (died 1996)
May 7
Ronnie Harmon, American football player
Leslie O'Neal, American football player
May 8 – Bobby Labonte, race car driver
May 11
Tim Blake Nelson, actor, writer, and director
Katie Wagner, television personality
May 12 – Geechy Guy, comedian
May 13
Ronnie Coleman, retired professional IFBB bodybuilder, 8x Mr Olympia
Stephen Colbert, comedian, political commentator, and television personality; host of The Late Show with Stephen Colbert
May 14 – Suzy Kolber, sportscaster
May 15 – Michael Gerson, journalist and speechwriter (died 2022)
May 16 – John Salley, basketball player and talk show host
May 17 – Nancy Benoit, professional wrestling valet and model (died 2007)
May 22 – Marcus Dupree, American football player
May 27 – Adam Carolla, comedic radio and television personality
May 30
Tom Morello, musician and political activist (Rage Against the Machine, Audioslave, Prophets of Rage)
Wynonna Judd, country singer
June
June 3
Daniel Lieberman, paleoanthropologist
Kerry King, guitarist (Slayer)
June 7
Judie Aronson, actress
Judith Neelley, serial killer
June 9 – Wayman Tisdale, NBA basketball star and smooth jazz musician (died 2009)
June 10 – Kate Flannery, actress
June 12 – Paula Marshall, actress
June 14 – E. Elias Merhige, director
June 15 – Courteney Cox, actress, producer, and director
June 19
Bill Barretta, actor, puppeteer, producer and director
Laura Ingraham, radio host and political commentator
June 20 – Michael Landon Jr., actor, director, writer, and producer
June 21
Doug Savant, actor
Josh Pais, actor
June 22
Cadillac Anderson, basketball player
Amy Brenneman, actress
Dan Brown, author
June 23 – Clete Blakeman, American football referee
June 24 – Kari Kennell, actress
June 27 – Michael Reilly Burke, actor
June 30 – Mark Waters, screenwriter, director and film producer
July
July 1
Paul Coyne, TV producer and editor
M Otis Beard, writer, singer/songwriter
July 3 – Peyton Reed, television and film director
July 4 – Mark Slaughter, singer and musician
July 5
Jimmy Demers, singer-songwriter
Ronald D. Moore, screenwriter and television producer
July 6 – John Ottman, film composer and editor
July 7 – Tracy Reiner, actress
July 9 – Courtney Love, actress, artist, author, musician, singer-songwriter and Kurt Cobain's wife
July 10 – Urban Meyer, college football player and coach
July 13 – Charlie Hides, drag queen and comedian
July 14 – Mike Morasky, composer, visual effects artist, director, and programmer
July 15 – John Brzenk, armwrestler
July 17
Heather Langenkamp, actress
Craig Morgan, country music singer-songwriter
July 19
Peter Dobson, actor
Teresa Edwards, basketball player
July 20
Chris Cornell, singer (Soundgarden, Audioslave, Temple of the Dog) (d. 2017)
Rudy Pantoja, internet meme
Dean Winters, actor
July 21 – Susan Swift, actress
July 22 – David Spade, comedian, actor and television personality
July 24 – Barry Bonds, baseball player
July 26 – Sandra Bullock, actress
July 28 – Lori Loughlin, actress
August
August 3 – Joan Higginbotham, African-American astronaut and engineer
August 5 – Adam Yauch, rapper (Beastie Boys) (died 2012)
August 7 – Tom McGrath, voice actor, animator, screenwriter, and film director
August 11 – Lawrence Monoson, actor
August 16
Jimmy Arias, tennis player
William Salyers, actor
August 20 – Markus Flanagan, actor
August 22
Andrew Wilson, film actor and director
Tom Gibis, voice actor
August 23 – Wendy Pepper, fashion designer (died 2017)
August 24 – Mark Cerny, video game programmer
August 25 – Blair Underwood, actor and director
August 26 – Sabine Hyland, anthropologist
August 28 – Felicia Taylor, anchor-correspondent
September
September 1
Holly Golightly, author and illustrator
Charlie Robison, singer-songwriter and guitarist
David West, baseball player (died 2022)
September 2 – Jimmy Banks, soccer defender (died 2019)
September 3
Adam Curry, American-Dutch businessman and television host, co-founded Mevio
Spike Feresten, screenwriter and producer
Holt McCallany, actor
September 4 – Anthony Weiner, U.S. Congressman
September 6
Todd Palin, husband of politician Sarah Palin
Rosie Perez, screen actress
John E. Sununu, U.S. Senator from New Hampshire from 2003 to 2009
September 8
Michael Johns, health care executive and presidential speechwriter
Mitchell Whitfield, actor and voice actor
Raven, professional wrestler
September 10 – Donna De Lory, singer and dancer
September 11 – Ellis Burks, baseball player and manager
September 12 – Greg Gutfeld, television personality
September 14
Faith Ford, actress
Stephen Dunham, actor (died 2012)
September 18 – Holly Robinson Peete, actress and singer
September 19
Kim Richards, actress
Trisha Yearwood, country singer
September 24 – Jeff Krosnoff, race car driver (died 1996)
September 26 – Scott Brower, ice hockey goaltender (died 1998)
September 28 – Janeane Garofalo, actress and comedian
October
October 1 – Christopher Titus, comedian and actor
October 5 – Dave Dederer, guitarist and singer
October 7 – Dan Savage, author and journalist
October 8 – CeCe Winans, African-American Christian musician
October 13
Matt Walsh, actor, comedian, director, and writer
Gordy Hoffman, screenwriter and director
Doug Emhoff, Second Gentleman of the United States
October 14
Joe Girardi, baseball player-manager
Jim Rome, sports TV and radio host
October 19 – Ty Pennington, carpenter, model and television personality
October 20 – Kamala Harris, 49th (and first female) vice president of the United States since 2021
October 22 – TobyMac, Christian musician
October 23 – Robert Trujillo, Metallica bassist
October 25
Dwight Garner, American football player (died 2022)
Kevin Michael Richardson, African-American actor and voice actor
October 26 – Danny Mastrogiorgio, actor
October 30
Tabitha St. Germain, American-born Canadian actress
Mark Steven Johnson, screenwriter, film director, and producer
November
November 1
Sophie B. Hawkins, singer-songwriter
Daran Norris, actor and voice actor
November 4 – Douglas Wilson, television personality and interior designer
November 7 – Dana Plato, actress (died 1999)
November 10 – Kenny Rogers, baseball player
November 11
Calista Flockhart, actress
Philip McKeon, actor (died 2019)
November 12
Vic Chesnutt, folk rock singer-songwriter and guitarist (brute. and The Undertow Orchestra) (died 2009)
David Ellefson, rock bassist and songwriter (Megadeth, Avian and F5)
Michael Kremer, development economist, recipient of the Nobel Memorial Prize in Economic Sciences
November 14
Rockie Lynne, singer-songwriter and guitarist
Joseph Simmons, rapper
Patrick Warburton, actor and voice artist
November 17
Mitch Williams, baseball player
Susan Rice, diplomat and National Security Advisor from 2013 to 2017
November 18 – Seth Joyner, African-American football player
November 19
Fred Diamond, mathematician
Shawn Holman, baseball pitcher
Eric Musselman, college basketball coach (Sacramento Kings)
November 21 – Shane Douglas, wrestler
November 23 – Boyd Kestner, actor
November 24
Garret Dillahunt, actor
Chris Reccardi, animator (died 2019)
November 25 – Mark Lanegan, singer-songwriter (died 2022)
November 27
Robin Givens, African-American actress
Adam Shankman, film director, producer, dancer, author, actor, and choreographer
November 28
Giorgi Bagaturov, Georgian-Armenian chess grandmaster
Michael Bennet, U.S. Senator from Colorado from 2009
Paul Kostacopoulos, college baseball coach
Michelle McKormick, talk radio personality
Roy Tarpley, basketball player
Craig Wilson, baseball third baseman
December
December 3
Darryl Hamilton, baseball player (died 2015)
Scott Huckabay, guitarist
December 4
Chelsea Noble, actress
Jonathan Goldstein, actor, director and musician
December 7
Patrick Fabian, actor
Curtis Hughes, wrestler
Peter Laviolette, ice hockey coach
December 10 – Bobby Flay, chef and author
December 12
Haywood Jeffires, American football player and coach
Sabu, professional wrestler
December 13 – Tony Roper, stock car racing driver (d. 2000)
December 14 – Karey Kirkpatrick, screenwriter and director
December 15 – Jerry Ball, American football player
December 16 – Billy Ripken, baseball player
December 17 – Steve Marmel, television writer and producer
December 18
Stone Cold Steve Austin, professional wrestler
Cledus T. Judd, Country comedy singer
December 21 – Daniel Suarez, novelist
December 22 – Mike Jackson, former MLB pitcher
December 27 – Theresa Randle, actress
December 29 – Michael Cudlitz, actor
December 30 – George Newbern, actor
December 31 – Michael McDonald, actor and comedian
Deaths
January 15 – Jack Teagarden, jazz trombonist (born 1905)
January 19 – Joe Weatherly, NASCAR championship driver (born 1922)
January 27
Norman Z. McLeod, film director (born 1898)
Louis Allen, civil rights activist and businessman (born 1919)
January 31 – Waite Phillips, oil man, banker and real estate investor (born 1883)
February 15 – Robert L. Thornton, American businessman, philanthropist and mayor of Dallas, Texas (born 1880)
February 16 – James M. Canty, educator, school administrator, and businessperson (born 1865)
February 25
Johnny Burke, lyricist (born 1908)
Grace Metalious, writer (born 1924)
February 29 – Frank Albertson, actor (born 11909)
March 6 – Edward Van Sloan, actor (born 1882)
March 22 – Addison Richards, actor (born 1887)
April 4 – Georgia Caine, actress (born 1876)
April 7 – Bruce W. Klunder, Presbyterian minister and civil rights activist (born 1937)
April 9 – Jerry Gaetz, politician (born 1914)
April 20 – Eddie Dyer, baseball player and manager (born 1899)
May 7 – Lee Fenner, American footballer (born 1897)
May 17 – Steve Owen, American football coach (New York Giants) and a member of the Pro Football Hall of Fame (born 1898)
May 20 – Rudy Lewis, rhythm and blues singer (born 1936)
May 30
Dave MacDonald, racing driver (born 1936)
Eddie Sachs, racing driver (born 1927)
June 6 – Robert Warwick, actor (born 1878)
June 17
Clarence G. Badger, film director (born 1880)
Joel S. Goldsmith, spiritual healer and founder of "The Infinite Way" movement (born 1892)
June 21
James Chaney, civil rights activist (born 1943; murdered by Ku Klux Klan)
Andrew Goodman, civil rights activist (born 1943; murdered by Ku Klux Klan)
Michael Schwerner, civil rights activist (born 1939; murdered by Ku Klux Klan)
July 2 – Fireball Roberts, race car driver and member of the NASCAR Hall of Fame (born 1929)
July 13 – Stephen Galatti, American Field Service director (born 1888)
July 26 – William A. Seiter, film director (born 1890)
July 29 – Vean Gregg, baseball player (born 1885)
July 31 – Jim Reeves, country singer-songwriter (born 1923)
August 3 – Flannery O'Connor, novelist and short story writer (born 1925)
September 2 –Glenn Albert Black, archaeologist (born 1900)
September 6 – Jane Hadley Barkley, Second Lady of the United States as wife of Alben W. Barkley (born 1911)
September 9 – Herschel Bennett, baseball player of St. Louis Browns (born 1896)
September 15 – Herbert Heywood, actor (born 1881)
September 23 – Fred M. Wilcox, film director (born 1907)
September 28
Nacio Herb Brown, songwriter (born 1896)
Harpo Marx, comedian (born 1888)
October 10 – Eddie Cantor, entertainer (born 1892)
October 19 – Russ Brown, actor (born 1892)
October 20 – Herbert Hoover, 31st president of the United States from 1929 to 1933 (born 1874)
October 21 – Margaret Gibson, actress (born 1894)
October 22 – Whip Wilson, actor (born 1911)
October 28 – Harold Hitz Burton, politician and jurist, Associate Justice of the Supreme Court of the United States (born 1888)
October 31 – Theodore Freeman, trainee astronaut (born 1930)
November 10
Jimmie Dodd, actor and television personality (born 1910)
Sam Newfield, movie director (born 1899)
November 21 – Catherine Bauer Wurster, architect and public housing advocate (born 1905)
November 24 – William O'Dwyer, diplomat and politician, 100th Mayor of New York City (born 1890)
November 28 – Charles Meredith, actor (born 11894)
December 3 – Charles P. Snyder, admiral (born 1879)
December 11
Sam Cooke, singer-songwriter (born 1931)
Percy Kilbride, actor (born 1888)
Alma Mahler, widow and muse of Gustav Mahler, Walter Gropius and Franz Werfel (born 1879 in Vienna)
December 28 – Cliff Sterrett, cartoonist (born 1883)
December 31 – Gertrude Michael, actress (born 1911)
See also
1964 (film)
List of American films of 1964
Timeline of United States history (1950–1969)
References
External links
Booknotes interview with Jon Margolis on The Last Innocent Year: America in 1964, June 27, 1999.
1960s in the United States
United States
United States
Years of the 20th century in the United States |
Jambhavan may refer to:
Jambavan, a character originating in Indian mythology: the King of the Bears, a bear in Indian epic tradition but a monkey in other scriptures
Jambhavan (film), a 2006 Indian Tamil action film directed by Nandakumar and produced by Rajalakshmi Kalaikudam |
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package ssh
import (
"io"
"io/ioutil"
"sync"
"testing"
)
func muxPair() (*mux, *mux) {
a, b := memPipe()
s := newMux(a)
c := newMux(b)
return s, c
}
// Returns both ends of a channel, and the mux for the the 2nd
// channel.
func channelPair(t *testing.T) (*channel, *channel, *mux) {
c, s := muxPair()
res := make(chan *channel, 1)
go func() {
newCh, ok := <-s.incomingChannels
if !ok {
t.Fatalf("No incoming channel")
}
if newCh.ChannelType() != "chan" {
t.Fatalf("got type %q want chan", newCh.ChannelType())
}
ch, _, err := newCh.Accept()
if err != nil {
t.Fatalf("Accept %v", err)
}
res <- ch.(*channel)
}()
ch, err := c.openChannel("chan", nil)
if err != nil {
t.Fatalf("OpenChannel: %v", err)
}
return <-res, ch, c
}
// Test that stderr and stdout can be addressed from different
// goroutines. This is intended for use with the race detector.
func TestMuxChannelExtendedThreadSafety(t *testing.T) {
writer, reader, mux := channelPair(t)
defer writer.Close()
defer reader.Close()
defer mux.Close()
var wr, rd sync.WaitGroup
magic := "hello world"
wr.Add(2)
go func() {
io.WriteString(writer, magic)
wr.Done()
}()
go func() {
io.WriteString(writer.Stderr(), magic)
wr.Done()
}()
rd.Add(2)
go func() {
c, err := ioutil.ReadAll(reader)
if string(c) != magic {
t.Fatalf("stdout read got %q, want %q (error %s)", c, magic, err)
}
rd.Done()
}()
go func() {
c, err := ioutil.ReadAll(reader.Stderr())
if string(c) != magic {
t.Fatalf("stderr read got %q, want %q (error %s)", c, magic, err)
}
rd.Done()
}()
wr.Wait()
writer.CloseWrite()
rd.Wait()
}
func TestMuxReadWrite(t *testing.T) {
s, c, mux := channelPair(t)
defer s.Close()
defer c.Close()
defer mux.Close()
magic := "hello world"
magicExt := "hello stderr"
go func() {
_, err := s.Write([]byte(magic))
if err != nil {
t.Fatalf("Write: %v", err)
}
_, err = s.Extended(1).Write([]byte(magicExt))
if err != nil {
t.Fatalf("Write: %v", err)
}
err = s.Close()
if err != nil {
t.Fatalf("Close: %v", err)
}
}()
var buf [1024]byte
n, err := c.Read(buf[:])
if err != nil {
t.Fatalf("server Read: %v", err)
}
got := string(buf[:n])
if got != magic {
t.Fatalf("server: got %q want %q", got, magic)
}
n, err = c.Extended(1).Read(buf[:])
if err != nil {
t.Fatalf("server Read: %v", err)
}
got = string(buf[:n])
if got != magicExt {
t.Fatalf("server: got %q want %q", got, magic)
}
}
func TestMuxChannelOverflow(t *testing.T) {
reader, writer, mux := channelPair(t)
defer reader.Close()
defer writer.Close()
defer mux.Close()
wDone := make(chan int, 1)
go func() {
if _, err := writer.Write(make([]byte, channelWindowSize)); err != nil {
t.Errorf("could not fill window: %v", err)
}
writer.Write(make([]byte, 1))
wDone <- 1
}()
writer.remoteWin.waitWriterBlocked()
// Send 1 byte.
packet := make([]byte, 1+4+4+1)
packet[0] = msgChannelData
marshalUint32(packet[1:], writer.remoteId)
marshalUint32(packet[5:], uint32(1))
packet[9] = 42
if err := writer.mux.conn.writePacket(packet); err != nil {
t.Errorf("could not send packet")
}
if _, err := reader.SendRequest("hello", true, nil); err == nil {
t.Errorf("SendRequest succeeded.")
}
<-wDone
}
func TestMuxChannelCloseWriteUnblock(t *testing.T) {
reader, writer, mux := channelPair(t)
defer reader.Close()
defer writer.Close()
defer mux.Close()
wDone := make(chan int, 1)
go func() {
if _, err := writer.Write(make([]byte, channelWindowSize)); err != nil {
t.Errorf("could not fill window: %v", err)
}
if _, err := writer.Write(make([]byte, 1)); err != io.EOF {
t.Errorf("got %v, want EOF for unblock write", err)
}
wDone <- 1
}()
writer.remoteWin.waitWriterBlocked()
reader.Close()
<-wDone
}
func TestMuxConnectionCloseWriteUnblock(t *testing.T) {
reader, writer, mux := channelPair(t)
defer reader.Close()
defer writer.Close()
defer mux.Close()
wDone := make(chan int, 1)
go func() {
if _, err := writer.Write(make([]byte, channelWindowSize)); err != nil {
t.Errorf("could not fill window: %v", err)
}
if _, err := writer.Write(make([]byte, 1)); err != io.EOF {
t.Errorf("got %v, want EOF for unblock write", err)
}
wDone <- 1
}()
writer.remoteWin.waitWriterBlocked()
mux.Close()
<-wDone
}
func TestMuxReject(t *testing.T) {
client, server := muxPair()
defer server.Close()
defer client.Close()
go func() {
ch, ok := <-server.incomingChannels
if !ok {
t.Fatalf("Accept")
}
if ch.ChannelType() != "ch" || string(ch.ExtraData()) != "extra" {
t.Fatalf("unexpected channel: %q, %q", ch.ChannelType(), ch.ExtraData())
}
ch.Reject(RejectionReason(42), "message")
}()
ch, err := client.openChannel("ch", []byte("extra"))
if ch != nil {
t.Fatal("openChannel not rejected")
}
ocf, ok := err.(*OpenChannelError)
if !ok {
t.Errorf("got %#v want *OpenChannelError", err)
} else if ocf.Reason != 42 || ocf.Message != "message" {
t.Errorf("got %#v, want {Reason: 42, Message: %q}", ocf, "message")
}
want := "ssh: rejected: unknown reason 42 (message)"
if err.Error() != want {
t.Errorf("got %q, want %q", err.Error(), want)
}
}
func TestMuxChannelRequest(t *testing.T) {
client, server, mux := channelPair(t)
defer server.Close()
defer client.Close()
defer mux.Close()
var received int
var wg sync.WaitGroup
wg.Add(1)
go func() {
for r := range server.incomingRequests {
received++
r.Reply(r.Type == "yes", nil)
}
wg.Done()
}()
_, err := client.SendRequest("yes", false, nil)
if err != nil {
t.Fatalf("SendRequest: %v", err)
}
ok, err := client.SendRequest("yes", true, nil)
if err != nil {
t.Fatalf("SendRequest: %v", err)
}
if !ok {
t.Errorf("SendRequest(yes): %v", ok)
}
ok, err = client.SendRequest("no", true, nil)
if err != nil {
t.Fatalf("SendRequest: %v", err)
}
if ok {
t.Errorf("SendRequest(no): %v", ok)
}
client.Close()
wg.Wait()
if received != 3 {
t.Errorf("got %d requests, want %d", received, 3)
}
}
func TestMuxGlobalRequest(t *testing.T) {
clientMux, serverMux := muxPair()
defer serverMux.Close()
defer clientMux.Close()
var seen bool
go func() {
for r := range serverMux.incomingRequests {
seen = seen || r.Type == "peek"
if r.WantReply {
err := r.Reply(r.Type == "yes",
append([]byte(r.Type), r.Payload...))
if err != nil {
t.Errorf("AckRequest: %v", err)
}
}
}
}()
_, _, err := clientMux.SendRequest("peek", false, nil)
if err != nil {
t.Errorf("SendRequest: %v", err)
}
ok, data, err := clientMux.SendRequest("yes", true, []byte("a"))
if !ok || string(data) != "yesa" || err != nil {
t.Errorf("SendRequest(\"yes\", true, \"a\"): %v %v %v",
ok, data, err)
}
if ok, data, err := clientMux.SendRequest("yes", true, []byte("a")); !ok || string(data) != "yesa" || err != nil {
t.Errorf("SendRequest(\"yes\", true, \"a\"): %v %v %v",
ok, data, err)
}
if ok, data, err := clientMux.SendRequest("no", true, []byte("a")); ok || string(data) != "noa" || err != nil {
t.Errorf("SendRequest(\"no\", true, \"a\"): %v %v %v",
ok, data, err)
}
clientMux.Disconnect(0, "")
if !seen {
t.Errorf("never saw 'peek' request")
}
}
func TestMuxGlobalRequestUnblock(t *testing.T) {
clientMux, serverMux := muxPair()
defer serverMux.Close()
defer clientMux.Close()
result := make(chan error, 1)
go func() {
_, _, err := clientMux.SendRequest("hello", true, nil)
result <- err
}()
<-serverMux.incomingRequests
serverMux.conn.Close()
err := <-result
if err != io.EOF {
t.Errorf("want EOF, got %v", io.EOF)
}
}
func TestMuxChannelRequestUnblock(t *testing.T) {
a, b, connB := channelPair(t)
defer a.Close()
defer b.Close()
defer connB.Close()
result := make(chan error, 1)
go func() {
_, err := a.SendRequest("hello", true, nil)
result <- err
}()
<-b.incomingRequests
connB.conn.Close()
err := <-result
if err != io.EOF {
t.Errorf("want EOF, got %v", err)
}
}
func TestMuxDisconnect(t *testing.T) {
a, b := muxPair()
defer a.Close()
defer b.Close()
go func() {
for r := range b.incomingRequests {
r.Reply(true, nil)
}
}()
a.Disconnect(42, "whatever")
ok, _, err := a.SendRequest("hello", true, nil)
if ok || err == nil {
t.Errorf("got reply after disconnecting")
}
err = b.Wait()
if d, ok := err.(*disconnectMsg); !ok || d.Reason != 42 {
t.Errorf("got %#v, want disconnectMsg{Reason:42}", err)
}
}
func TestMuxCloseChannel(t *testing.T) {
r, w, mux := channelPair(t)
defer mux.Close()
defer r.Close()
defer w.Close()
result := make(chan error, 1)
go func() {
var b [1024]byte
_, err := r.Read(b[:])
result <- err
}()
if err := w.Close(); err != nil {
t.Errorf("w.Close: %v", err)
}
if _, err := w.Write([]byte("hello")); err != io.EOF {
t.Errorf("got err %v, want io.EOF after Close", err)
}
if err := <-result; err != io.EOF {
t.Errorf("got %v (%T), want io.EOF", err, err)
}
}
func TestMuxCloseWriteChannel(t *testing.T) {
r, w, mux := channelPair(t)
defer mux.Close()
result := make(chan error, 1)
go func() {
var b [1024]byte
_, err := r.Read(b[:])
result <- err
}()
if err := w.CloseWrite(); err != nil {
t.Errorf("w.CloseWrite: %v", err)
}
if _, err := w.Write([]byte("hello")); err != io.EOF {
t.Errorf("got err %v, want io.EOF after CloseWrite", err)
}
if err := <-result; err != io.EOF {
t.Errorf("got %v (%T), want io.EOF", err, err)
}
}
func TestMuxInvalidRecord(t *testing.T) {
a, b := muxPair()
defer a.Close()
defer b.Close()
packet := make([]byte, 1+4+4+1)
packet[0] = msgChannelData
marshalUint32(packet[1:], 29348723 /* invalid channel id */)
marshalUint32(packet[5:], 1)
packet[9] = 42
a.conn.writePacket(packet)
go a.SendRequest("hello", false, nil)
// 'a' wrote an invalid packet, so 'b' has exited.
req, ok := <-b.incomingRequests
if ok {
t.Errorf("got request %#v after receiving invalid packet", req)
}
}
func TestZeroWindowAdjust(t *testing.T) {
a, b, mux := channelPair(t)
defer a.Close()
defer b.Close()
defer mux.Close()
go func() {
io.WriteString(a, "hello")
// bogus adjust.
a.sendMessage(windowAdjustMsg{})
io.WriteString(a, "world")
a.Close()
}()
want := "helloworld"
c, _ := ioutil.ReadAll(b)
if string(c) != want {
t.Errorf("got %q want %q", c, want)
}
}
func TestMuxMaxPacketSize(t *testing.T) {
a, b, mux := channelPair(t)
defer a.Close()
defer b.Close()
defer mux.Close()
large := make([]byte, a.maxRemotePayload+1)
packet := make([]byte, 1+4+4+1+len(large))
packet[0] = msgChannelData
marshalUint32(packet[1:], a.remoteId)
marshalUint32(packet[5:], uint32(len(large)))
packet[9] = 42
if err := a.mux.conn.writePacket(packet); err != nil {
t.Errorf("could not send packet")
}
go a.SendRequest("hello", false, nil)
_, ok := <-b.incomingRequests
if ok {
t.Errorf("connection still alive after receiving large packet.")
}
}
// Don't ship code with debug=true.
func TestDebug(t *testing.T) {
if debugMux {
t.Error("mux debug switched on")
}
if debugHandshake {
t.Error("handshake debug switched on")
}
}
``` |
```c++
/*<-
(See accompanying file LICENSE.md or copy at path_to_url
->*/
//[ is_cv_member
#include <type_traits>
#include <boost/callable_traits/is_cv_member.hpp>
namespace ct = boost::callable_traits;
struct foo;
static_assert(ct::is_cv_member<int(foo::*)() const volatile>::value, "");
static_assert(!ct::is_cv_member<int(foo::*)()>::value, "");
static_assert(!ct::is_cv_member<int(foo::*)() const>::value, "");
static_assert(!ct::is_cv_member<int(foo::*)() volatile>::value, "");
int main() {}
//]
``` |
```javascript
// @flow
import fetch from './fetchClassic';
import pipelineStore from './PipelineStore';
import pipelineMetadataService from './PipelineMetadataService';
import type { PipelineInfo, StageInfo, StepInfo } from './PipelineStore';
import { convertInternalModelToJson } from './PipelineSyntaxConverter';
import { isObservableArray } from 'mobx';
import debounce from 'lodash.debounce';
const validationTimeout = 500;
export function isValidEnvironmentKey(key: string): boolean {
if (!key) {
return false;
}
if (/^[_$a-zA-Z\xA0-\uFFFF][_$a-zA-Z0-9\xA0-\uFFFF]*$/.test(key)) {
return true;
}
return false;
}
function _isArray(o) {
return o instanceof Array || typeof o === 'array' || isObservableArray(o);
}
function _hasValidationErrors(node) {
return node && node.validationErrors && node.validationErrors.length;
}
function _appendValidationError(node, message) {
if (_hasValidationErrors(node)) {
node.validationErrors.push(message);
} else {
node.validationErrors = [message];
}
}
function _validateAgentEntries(metadata, agent) {
if (!agent || agent.type === 'none' || agent.type === 'any') {
return;
}
let meta;
for (const m of metadata.agentMetadata) {
if (agent.type === m.symbol) {
meta = m;
break;
}
}
if (!meta) {
_appendValidationError(meta, 'Unknown agent type: ' + agent.type);
return;
}
meta.parameters.map(param => {
const arg = agent.arguments.filter(arg => arg.key === param.name)[0];
if (param.isRequired && (!arg || !arg.value || !arg.value.value)) {
_appendValidationError(agent, param.name + ' is required');
}
});
}
function _validateEnvironmentEntries(metadata, entries) {
for (const entry of entries) {
if (!_hasValidationErrors(entry) && !isValidEnvironmentKey(entry.key)) {
_appendValidationError(entry, 'Environment Name is not valid. Please ensure it is a valid Pipeline identifier.');
}
}
}
function _validateStepValues(metadata, steps) {
for (const step of steps) {
const meta = metadata.stepMetadata.find(step);
if (meta && meta.isRequired && !step.validationErrors && !step.value.value) {
_appendValidationError(entry, 'Required step value');
}
if (step.children) {
_validateStepValues(metadata, step.children);
}
}
}
function _addClientSideErrors(metadata, node) {
const parent = pipelineStore.findParentStage(node);
if (node.agent) {
_validateAgentEntries(metadata, node.agent);
}
if (node.environment) {
_validateEnvironmentEntries(metadata, node.environment);
}
if (node.steps) {
_validateStepValues(metadata, node.steps);
}
if (!node.children || !node.children.length) {
if (parent && (!node.steps || !node.steps.length)) {
// For this one particular error, just replace it
//node.validationErrors = [];
//node.steps.validationErrors = [ 'At least one step is required' ];
node.validationErrors = ['At least one step is required'];
}
if (node === pipelineStore.pipeline) {
// override default message
node.validationErrors = ['A stage is required'];
}
} else {
node.children.map(child => _addClientSideErrors(metadata, child));
}
}
export class PipelineValidator {
lastPipelineValidated: string;
validatePipeline(pipeline: PipelineInfo, handler: ValidationResult) {
const json = convertInternalModelToJson(pipeline);
fetch(
'/pipeline-model-converter/validateJson',
'json=' + encodeURIComponent(JSON.stringify(json)),
data => {
if (!data.result && data.errors) {
if (window.isDevelopmentMode) console.error(data);
}
handler(data);
},
{ disableLoadingIndicator: true }
);
}
/**
* Indicates this node or any child node has a validation error
*/
hasValidationErrors(node: Object, visited: any[] = []): boolean {
if (visited.indexOf(node) >= 0) {
return false;
}
visited.push(node);
if (_hasValidationErrors(node)) {
return true;
}
// if this is a parallel, check the parent stage for errors
const parent = pipelineStore.findParentStage(node);
if (parent && pipelineStore.pipeline !== parent && parent.validationErrors) {
return true;
}
for (const key of Object.keys(node)) {
const val = node[key];
if (val instanceof Object) {
if (this.hasValidationErrors(val, visited)) {
return true;
}
}
}
return false;
}
/**
* Gets the validation errors for the specific node
*/
getNodeValidationErrors(node: Object, visited: any[] = []): Object[] {
const validationErrors = node.validationErrors ? [...node.validationErrors] : [];
// if this is a parallel, check the parent stage for errors
const parent = pipelineStore.findParentStage(node);
if (parent && pipelineStore.pipeline !== parent && parent.validationErrors) {
validationErrors.push.apply(validationErrors, parent.validationErrors);
}
return validationErrors.length ? validationErrors : null;
}
/**
* Gets all validation errors for the node and all child nodes
*/
getAllValidationErrors(node: Object, visited: any[] = []): Object[] {
if (visited.indexOf(node) >= 0) {
return null;
}
visited.push(node);
const validationErrors = [];
if (_hasValidationErrors(node)) {
validationErrors.push.apply(validationErrors, node.validationErrors);
}
if (node instanceof Array || typeof node === 'array') {
for (const v of node) {
const childErrors = this.getAllValidationErrors(v, visited);
if (childErrors) {
validationErrors.push.apply(validationErrors, childErrors);
}
}
} else if (node instanceof Object) {
for (const key of Object.keys(node)) {
const childErrors = this.getAllValidationErrors(node[key], visited);
if (childErrors) {
validationErrors.push.apply(validationErrors, childErrors);
}
}
}
return validationErrors.length ? validationErrors : null;
}
findNodeFromPath(pipeline: PipelineInfo, path: string[]): any {
// like: "pipeline"/"stages"/"0"/"branches"/"0"/"steps"
let node = pipeline;
for (let i = 0; i < path.length; i++) {
const part = path[i];
switch (part) {
case 'pipeline': {
break;
}
case 'stages': {
const idx = parseInt(path[++i]);
if (parseInt(idx) === idx) {
node = node.children[idx];
}
break;
}
case 'branches': {
const idx = parseInt(path[++i]);
// check if the 'default' single node path vs. parallel
if (!node.children || node.children.length == 0) {
// This probably in a parallel block, and is referencing the default branch, which is this node
} else {
node = node.children[idx];
}
break;
}
case 'parallel': {
const idx = parseInt(path[++i]);
if (!isNaN(idx)) {
node = node.children[idx];
}
break;
}
case 'steps': {
const idx = parseInt(path[++i]);
if (!isNaN(idx)) {
// it is actually the steps array, so just target the node
node = node.steps[idx];
}
break;
}
case 'arguments': {
const idx = parseInt(path[++i]);
if (!isNaN(idx)) {
// it is actually the arguments array, so just target the node
// FIXME ehh, arguments are stored in 'data'
node = node.data;
}
break;
}
default: {
// if we have reached a key/value, just apply the error here
if (node && 'key' in node && 'value' in node) {
return node;
}
// some error with some unknown section, try to find it
// so we can at least display the error
node = node[part];
break;
}
}
}
if (!node) {
if (window.isDevelopmentMode) console.error('unable to find node for', path, 'in', pipeline);
return pipeline;
}
return node;
}
applyValidationMarkers(metadata, pipeline: PipelineInfo, validation: Object): void {
// just make sure nothing is hanging around
this.clearValidationMarkers(pipeline);
if (validation.result == 'failure') {
for (const error of validation.errors) {
if (error.location) {
const node = this.findNodeFromPath(pipeline, error.location);
if (node) {
// ignore errors for nodes that are 'pristine'
if (!node.pristine) {
_appendValidationError(node, error.error);
}
error.applied = true;
}
} else if (error.jenkinsfileErrors) {
for (const globalError of error.jenkinsfileErrors.errors) {
if (_isArray(globalError.error)) {
for (const errorText of globalError.error) {
_appendValidationError(pipeline, errorText);
error.applied = true;
}
} else {
_appendValidationError(pipeline, globalError.error);
error.applied = true;
}
}
}
}
for (const error of validation.errors) {
if (!error.applied) {
if (window.developmentMode) console.error(error);
// surface in the UI
_appendValidationError(pipeline, error.error);
}
}
}
_addClientSideErrors(metadata, pipeline);
}
clearValidationMarkers(node: Object, visited: any[] = []): void {
if (visited.indexOf(node) >= 0) {
return;
}
visited.push(node);
if (node.validationErrors) {
delete node.validationErrors;
}
if (_isArray(node)) {
for (const v of node) {
this.clearValidationMarkers(v, visited);
}
} else if (node instanceof Object) {
for (const key of Object.keys(node)) {
const val = node[key];
if (val instanceof Object) {
this.clearValidationMarkers(val, visited);
}
}
}
}
hasPristineEdits(node: Object, visited: any[] = []) {
if (visited.indexOf(node) >= 0) {
return false;
}
visited.push(node);
if (node.pristine) {
return true;
}
for (const key of Object.keys(node)) {
const val = node[key];
if (val instanceof Object) {
if (this.hasPristineEdits(val, visited)) {
return true;
}
}
}
return false;
}
validateNow(onComplete) {
const pipeline = pipelineStore.pipeline;
const json = JSON.stringify(convertInternalModelToJson(pipeline));
this.lastPipelineValidated = json + (this.hasPristineEdits(pipeline) ? '.' : '');
pipelineMetadataService.getStepListing(stepMetadata => {
pipelineMetadataService.getAgentListing(agentMetadata => {
this.validatePipeline(pipeline, validationResult => {
this.applyValidationMarkers({ stepMetadata, agentMetadata }, pipeline, validationResult);
pipelineStore.setPipeline(pipeline); // notify listeners to re-render
if (onComplete) onComplete();
});
});
});
}
delayedValidate = debounce(() => {
this.validateNow();
}, validationTimeout);
validate(onComplete) {
const json = JSON.stringify(convertInternalModelToJson(pipelineStore.pipeline));
if (this.lastPipelineValidated === json) {
if (onComplete) onComplete();
return;
}
if (!this.lastPipelineValidate) {
this.validateNow(onComplete);
} else {
this.delayedValidate();
}
}
}
const pipelineValidator = new PipelineValidator();
export default pipelineValidator;
``` |
```html+erb
<%= decidim_modal id: "conference-registration-confirm-#{model.id}", class: "conference__registration-modal" do %>
<div class="flex items-center gap-2">
<%= icon "ticket-line", class: "w-6 h-6 text-gray fill-current flex-none" %>
<div class="font-semibold text-black text-2xl" id="dialog-title-conference-registration-confirm-<%= model.id %>"><%= I18n.t("registration", scope: "decidim.conferences.conference.show") %></div>
</div>
<div id="dialog-desc-conference-registration-confirm-<%= model.id %>" class="text-gray-2 text-xl mt-9">
<%= decidim_sanitize_editor translated_attribute(conference.registration_terms) %>
</div>
<div class="flex justify-between mt-16">
<button class="button button__lg button__transparent-secondary" data-dialog-close="<%= model.id %>"><%= t("cancel", scope: "decidim.conferences.conference.registration_confirm") %></button>
<%= button_to t("confirm", scope: "decidim.conferences.conference.registration_confirm"), conference_registration_type_conference_registration_path(conference, model), class: "button button__lg button__secondary" %>
</div>
<% end %>
``` |
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.rocketmq.store;
import org.apache.rocketmq.common.UtilAll;
import org.apache.rocketmq.common.message.Message;
import org.apache.rocketmq.common.message.MessageDecoder;
import org.apache.rocketmq.common.message.MessageExtBatch;
import org.junit.After;
import java.io.File;
import java.net.InetAddress;
import java.net.InetSocketAddress;
import java.net.SocketAddress;
import java.net.UnknownHostException;
import java.util.*;
import java.util.concurrent.atomic.AtomicInteger;
public class StoreTestBase {
private int QUEUE_TOTAL = 100;
private AtomicInteger QueueId = new AtomicInteger(0);
private SocketAddress BornHost = new InetSocketAddress("127.0.0.1", 8123);
private SocketAddress StoreHost = BornHost;
private byte[] MessageBody = new byte[1024];
protected Set<String> baseDirs = new HashSet<>();
private static AtomicInteger port = new AtomicInteger(30000);
public static synchronized int nextPort() {
return port.addAndGet(5);
}
protected MessageExtBatch buildBatchMessage(int size) {
MessageExtBatch messageExtBatch = new MessageExtBatch();
messageExtBatch.setTopic("StoreTest");
messageExtBatch.setTags("TAG1");
messageExtBatch.setKeys("Hello");
messageExtBatch.setQueueId(Math.abs(QueueId.getAndIncrement()) % QUEUE_TOTAL);
messageExtBatch.setSysFlag(0);
messageExtBatch.setBornTimestamp(System.currentTimeMillis());
messageExtBatch.setBornHost(BornHost);
messageExtBatch.setStoreHost(StoreHost);
List<Message> messageList = new ArrayList<>(size);
for (int i = 0; i < size; i++) {
messageList.add(buildMessage());
}
messageExtBatch.setBody(MessageDecoder.encodeMessages(messageList));
return messageExtBatch;
}
protected MessageExtBrokerInner buildMessage() {
MessageExtBrokerInner msg = new MessageExtBrokerInner();
msg.setTopic("StoreTest");
msg.setTags("TAG1");
msg.setKeys("Hello");
msg.setBody(MessageBody);
msg.setKeys(String.valueOf(System.currentTimeMillis()));
msg.setQueueId(Math.abs(QueueId.getAndIncrement()) % QUEUE_TOTAL);
msg.setSysFlag(0);
msg.setBornTimestamp(System.currentTimeMillis());
msg.setStoreHost(StoreHost);
msg.setBornHost(BornHost);
return msg;
}
protected MessageExtBatch buildIPv6HostBatchMessage(int size) {
MessageExtBatch messageExtBatch = new MessageExtBatch();
messageExtBatch.setTopic("StoreTest");
messageExtBatch.setTags("TAG1");
messageExtBatch.setKeys("Hello");
messageExtBatch.setBody(MessageBody);
messageExtBatch.setMsgId("24084004018081003FAA1DDE2B3F898A00002A9F0000000000000CA0");
messageExtBatch.setKeys(String.valueOf(System.currentTimeMillis()));
messageExtBatch.setQueueId(Math.abs(QueueId.getAndIncrement()) % QUEUE_TOTAL);
messageExtBatch.setSysFlag(0);
messageExtBatch.setBornHostV6Flag();
messageExtBatch.setStoreHostAddressV6Flag();
messageExtBatch.setBornTimestamp(System.currentTimeMillis());
try {
messageExtBatch.setBornHost(new InetSocketAddress(InetAddress.getByName("1050:0000:0000:0000:0005:0600:300c:326b"), 8123));
} catch (UnknownHostException e) {
e.printStackTrace();
}
try {
messageExtBatch.setStoreHost(new InetSocketAddress(InetAddress.getByName("::1"), 8123));
} catch (UnknownHostException e) {
e.printStackTrace();
}
List<Message> messageList = new ArrayList<>(size);
for (int i = 0; i < size; i++) {
messageList.add(buildIPv6HostMessage());
}
messageExtBatch.setBody(MessageDecoder.encodeMessages(messageList));
return messageExtBatch;
}
protected MessageExtBrokerInner buildIPv6HostMessage() {
MessageExtBrokerInner msg = new MessageExtBrokerInner();
msg.setTopic("StoreTest");
msg.setTags("TAG1");
msg.setKeys("Hello");
msg.setBody(MessageBody);
msg.setMsgId("24084004018081003FAA1DDE2B3F898A00002A9F0000000000000CA0");
msg.setKeys(String.valueOf(System.currentTimeMillis()));
msg.setQueueId(Math.abs(QueueId.getAndIncrement()) % QUEUE_TOTAL);
msg.setSysFlag(0);
msg.setBornHostV6Flag();
msg.setStoreHostAddressV6Flag();
msg.setBornTimestamp(System.currentTimeMillis());
try {
msg.setBornHost(new InetSocketAddress(InetAddress.getByName("1050:0000:0000:0000:0005:0600:300c:326b"), 8123));
} catch (UnknownHostException e) {
e.printStackTrace();
}
try {
msg.setStoreHost(new InetSocketAddress(InetAddress.getByName("::1"), 8123));
} catch (UnknownHostException e) {
e.printStackTrace();
}
return msg;
}
public static String createBaseDir() {
String baseDir = System.getProperty("user.home") + File.separator + "unitteststore" + File.separator + UUID.randomUUID();
final File file = new File(baseDir);
if (file.exists()) {
System.exit(1);
}
return baseDir;
}
public static boolean makeSureFileExists(String fileName) throws Exception {
File file = new File(fileName);
MappedFile.ensureDirOK(file.getParent());
return file.createNewFile();
}
public static void deleteFile(String fileName) {
deleteFile(new File(fileName));
}
public static void deleteFile(File file) {
UtilAll.deleteFile(file);
}
@After
public void clear() {
for (String baseDir : baseDirs) {
deleteFile(baseDir);
}
}
}
``` |
```haskell
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE ViewPatterns #-}
module Cardano.Wallet.Types.UtxoStatistics
( -- * Types
UtxoStatistics
, BoundType
, UtxoStatisticsError(..)
-- * Constructing 'UtxoStatistics'
, computeUtxoStatistics
-- * Constructing 'BoundType'
, log10
) where
import Universum
import Control.Lens (at, (?~))
import Data.Aeson (FromJSON (..), Object, ToJSON (..), Value (..),
genericParseJSON, genericToJSON, object, withObject, (.:),
(.=))
import Data.Aeson.Types (Parser)
import Data.Swagger (NamedSchema (..), Referenced (..),
SwaggerType (..), ToSchema (..), declareSchemaRef,
genericDeclareNamedSchema, minimum_, properties, required,
type_)
import Data.Word (Word64)
import Formatting (bprint, build, (%))
import Serokell.Util (listJson)
import Test.QuickCheck (Arbitrary (..), arbitrary, choose, elements,
infiniteListOf, shuffle)
import Cardano.Wallet.API.V1.Swagger.Example (Example)
import Cardano.Wallet.Util (eitherToParser)
import Pos.Chain.Txp (TxOut (..), TxOutAux (..), Utxo)
import Pos.Core.Common (Coin (..))
import Pos.Infra.Util.LogSafe (BuildableSafeGen (..),
deriveSafeBuildable)
import qualified Control.Foldl as L
import qualified Data.Aeson as Aeson
import qualified Data.HashMap.Strict as HMS
import qualified Data.List.NonEmpty as NL
import qualified Data.Map.Strict as Map
import qualified Data.Swagger as Swagger
import qualified Formatting.Buildable
--
-- TYPES
--
data UtxoStatistics = UtxoStatistics
{ theHistogram :: ![HistogramBar]
, theAllStakes :: !Word64
} deriving (Show, Generic, Ord)
data UtxoStatisticsError
= ErrEmptyHistogram
| ErrInvalidBounds !Text
| ErrInvalidTotalStakes !Text
deriving (Eq, Show, Read, Generic)
-- Buckets boundaries can be constructed in different ways
data BoundType = Log10 deriving (Eq, Show, Read, Generic)
instance ToJSON BoundType where
toJSON = genericToJSON aesonEnumOpts
instance FromJSON BoundType where
parseJSON = genericParseJSON aesonEnumOpts
instance ToSchema BoundType where
declareNamedSchema = genericDeclareNamedSchema Swagger.defaultSchemaOptions
instance Buildable UtxoStatisticsError where
build = \case
ErrEmptyHistogram ->
bprint "Utxo statistics histogram cannot be empty."
ErrInvalidBounds err ->
bprint ("Utxo statistics have invalid bounds: "%build%".") err
ErrInvalidTotalStakes err ->
bprint ("Utxo statistics have invalid total stakes: "%build%".") err
instance Eq UtxoStatistics where
(UtxoStatistics h s) == (UtxoStatistics h' s') =
s == s' && sorted h == sorted h'
where
sorted :: [HistogramBar] -> [HistogramBar]
sorted = sortOn (\(HistogramBarCount key _) -> key)
instance ToJSON UtxoStatistics where
toJSON (UtxoStatistics bars allStakes) =
let
histogramObject =
Object . HMS.fromList . map extractBarKey
extractBarKey (HistogramBarCount bound stake) =
show bound .= stake
in
object
[ "histogram" .= histogramObject bars
, "allStakes" .= allStakes
, "boundType" .= log10
]
instance FromJSON UtxoStatistics where
parseJSON = withObject "UtxoStatistics" parseUtxoStatistics
where
parseUtxoStatistics :: Object -> Parser UtxoStatistics
parseUtxoStatistics o =
eitherToParser =<< mkUtxoStatistics
<$> (o .: "boundType")
<*> (o .: "histogram")
<*> (o .: "allStakes")
instance Arbitrary UtxoStatistics where
arbitrary = do
upperBounds <- shuffle (NL.toList $ generateBounds Log10)
counts <- infiniteListOf arbitrary
let histogram = zip upperBounds counts
let histoBars = map (uncurry HistogramBarCount) histogram
allStakes <- choose (getPossibleBounds $ Map.fromList histogram)
return $ UtxoStatistics histoBars allStakes
instance BuildableSafeGen UtxoStatistics where
buildSafeGen _ UtxoStatistics{..} = bprint ("{"
%" histogram="%build
%" allStakes="%build
%" }")
theHistogram
theAllStakes
instance Example UtxoStatistics
instance ToSchema UtxoStatistics where
declareNamedSchema _ = do
wordRef <- declareSchemaRef (Proxy :: Proxy Word64)
btypeRef <- declareSchemaRef (Proxy :: Proxy BoundType)
pure $ NamedSchema (Just "UtxoStatistics") $ mempty
& type_ ?~ SwaggerObject
& required .~ ["histogram", "allStakes"]
& properties .~ (mempty
& at "boundType" ?~ btypeRef
& at "allStakes" ?~ (Inline $ mempty
& type_ ?~ SwaggerNumber
& minimum_ .~ Just 0
)
& at "histogram" ?~ Inline (mempty
& type_ ?~ SwaggerObject
& properties .~ (mempty
& at "10" ?~ wordRef
& at "100" ?~ wordRef
& at "1000" ?~ wordRef
& at "10000" ?~ wordRef
& at "100000" ?~ wordRef
& at "1000000" ?~ wordRef
& at "10000000" ?~ wordRef
& at "100000000" ?~ wordRef
& at "1000000000" ?~ wordRef
& at "10000000000" ?~ wordRef
& at "100000000000" ?~ wordRef
& at "1000000000000" ?~ wordRef
& at "10000000000000" ?~ wordRef
& at "100000000000000" ?~ wordRef
& at "1000000000000000" ?~ wordRef
& at "10000000000000000" ?~ wordRef
& at "45000000000000000" ?~ wordRef
)
)
)
--
-- CONSTRUCTING
--
-- | Smart-constructor to create bounds using a log-10 scale
log10 :: BoundType
log10 = Log10
{-# INLINE log10 #-}
-- | Compute UtxoStatistics from a bunch of UTXOs
computeUtxoStatistics :: BoundType -> [Utxo] -> UtxoStatistics
computeUtxoStatistics btype =
L.fold foldStatistics . concatMap getCoins
where
getCoins :: Utxo -> [Word64]
getCoins =
map (getCoin . txOutValue . toaOut) . Map.elems
foldStatistics :: L.Fold Word64 UtxoStatistics
foldStatistics = UtxoStatistics
<$> foldBuckets (generateBounds btype)
<*> L.sum
foldBuckets :: NonEmpty Word64 -> L.Fold Word64 [HistogramBar]
foldBuckets bounds =
let
step :: Map Word64 Word64 -> Word64 -> Map Word64 Word64
step x a =
case Map.lookupGE a x of
Just (k, v) -> Map.insert k (v+1) x
Nothing -> Map.adjust (+1) (head bounds) x
initial :: Map Word64 Word64
initial =
Map.fromList $ zip (NL.toList bounds) (repeat 0)
extract :: Map Word64 Word64 -> [HistogramBar]
extract =
map (uncurry HistogramBarCount) . Map.toList
in
L.Fold step initial extract
--
-- INTERNALS
--
-- Utxo statistics for the wallet.
-- Histogram is composed of bars that represent the bucket. The bucket is tagged by upper bound of a given bucket.
-- The bar value corresponds to the number of stakes
-- In the future the bar value could be different things:
-- (a) sum of stakes in a bucket
-- (b) avg or std of stake in a bucket
-- (c) topN buckets
-- to name a few
data HistogramBar = HistogramBarCount
{ bucketUpperBound :: !Word64
, bucketCount :: !Word64
} deriving (Show, Eq, Ord, Generic)
instance Example HistogramBar
instance Arbitrary HistogramBar where
arbitrary = do
upperBound <- elements (NL.toList $ generateBounds log10)
count <- arbitrary
pure (HistogramBarCount upperBound count)
instance Buildable [HistogramBar] where
build =
bprint listJson
instance BuildableSafeGen HistogramBar where
buildSafeGen _ HistogramBarCount{..} =
bprint ("{"
%" upperBound="%build
%" count="%build
%" }")
bucketUpperBound
bucketCount
mkUtxoStatistics
:: BoundType
-> Map Word64 Word64
-> Word64
-> Either UtxoStatisticsError UtxoStatistics
mkUtxoStatistics btype histogram allStakes = do
let (histoKeys, histoElems) = (Map.keys histogram, Map.elems histogram)
let acceptedKeys = NL.toList $ generateBounds btype
let (minPossibleValue, maxPossibleValue) = getPossibleBounds histogram
let constructHistogram = uncurry HistogramBarCount
let histoBars = map constructHistogram $ Map.toList histogram
when (length histoKeys <= 0) $
Left ErrEmptyHistogram
when (any (`notElem` acceptedKeys) histoKeys) $
Left $ ErrInvalidBounds $ "given bounds are incompatible with bound type (" <> show btype <> ")"
when (any (< 0) histoElems) $
Left $ ErrInvalidBounds "encountered negative bound"
when (allStakes < 0) $
Left $ ErrInvalidTotalStakes "total stakes is negative"
when (allStakes < minPossibleValue && allStakes > maxPossibleValue) $
Left $ ErrInvalidTotalStakes "inconsistent total stakes & histogram"
pure UtxoStatistics
{ theHistogram = histoBars
, theAllStakes = allStakes
}
generateBounds :: BoundType -> NonEmpty Word64
generateBounds bType =
let (^!) :: Word64 -> Word64 -> Word64
(^!) = (^)
in case bType of
Log10 -> NL.fromList $ map (\toPower -> 10 ^! toPower) [1..16] ++ [45 * (10 ^! 15)]
getPossibleBounds :: Map Word64 Word64 -> (Word64, Word64)
getPossibleBounds histogram =
(calculatePossibleBound fst, calculatePossibleBound snd)
where
createBracketPairs :: Num a => [a] -> [(a,a)]
createBracketPairs (reverse -> (x:xs)) = zip (map (+1) $ reverse (xs ++ [0])) (reverse (x:xs))
createBracketPairs _ = []
matching fromPair (key,value) =
map ( (*value) . fromPair ) . filter (\(_,upper) -> key == upper)
acceptedKeys = NL.toList $ generateBounds log10
calculatePossibleBound fromPair =
sum .
concatMap (\pair -> matching fromPair pair $ createBracketPairs acceptedKeys) $
Map.toList histogram
aesonEnumOpts :: Aeson.Options
aesonEnumOpts = Aeson.defaultOptions
{ Aeson.tagSingleConstructors = True
}
-- | TH at the end because it needs mostly everything to be declared first
deriveSafeBuildable ''UtxoStatistics
deriveSafeBuildable ''HistogramBar
``` |
```vue
<example src="./examples/PositionDirection.vue" />
<example src="./examples/AnimationTypes.vue" />
<example src="./examples/EventTriggers.vue" />
<example src="./examples/MorphingIcon.vue" />
<template>
<page-container centered :title="$t('pages.speedDial.title')">
<div class="page-container-section">
<p>Floating Action Buttons can show related actions upon hovering or pressing. The button should remain on screen after the menu is invoked.</p>
<p>Speed dial component is pretty flexible and have many options to make it easy to suit all your needs. You can apply different positions, work with a couple of events to trigger the content and also have a awesome morph effect on your main action.</p>
<p>The component is divided in 3 parts: The <code>md-speed-dial</code>, which is the container that control all children, <code>md-speed-dial-content</code> which is the content to be displayed (a.k.a buttons) and <code>md-speed-dial-trigger</code> who is responsible for triggering the content exhibition. Take a look at this following example:</p>
</div>
<div class="page-container-section">
<h2 id="speedpositions">Speed Dial positions</h2>
<p>You can specify any position that you want for you Speed Dial component. They can be top and bottom, and combined with left, center or right:</p>
<code-example title="Positions and directions" :component="examples['position-direction']" />
<note-block tip>Prefer the FAB on bottom left position for your main action on scrollable contents. Always use a <code>md-direction</code> equals to <code>bottom</code> when using top position.</note-block>
</div>
<div class="page-container-section">
<h2 id="effects">Effects</h2>
<p>The component can be displayed different animations for each scenario that you might want:</p>
<code-example title="Animations types" :component="examples['animation-types']" />
</div>
<div class="page-container-section">
<h2 id="triggers">Triggers</h2>
<p>You can trigger the speed dial content using hover or click. Using this allows you to have a open/close feature or to hold a main action:</p>
<code-example title="Event triggers" :component="examples['event-triggers']" />
<note-block tip>For desktop environments it's better to have a hover effect. On mobile you can toggle the property to use click instead.</note-block>
<api-item title="API - md-speed-dial">
<api-table :headings="props.headings" :props="props.props" slot="props" />
<api-table :headings="classes.headings" :props="classes.props" slot="classes" />
</api-item>
</div>
<div class="page-container-section">
<h2 id="iconMorph">Icon Morph</h2>
<p>Sometimes you want the speed dial to have a cross icon to represent your close action after showing the content. This can be easily achieved with the morph icons.</p>
<p>To create that, create two <code>md-icon</code> components inside the trigger and add a <code>md-morph-initial</code> in the one you would like it to be the initial state (or an open state) and a <code>md-morph-final</code> on the close state:</p>
<code-example title="Morphing Icons" :component="examples['morphing-icon']" />
</div>
<div class="page-container-section">
<h3>Components</h3>
<api-item title="API - md-speed-dial-content">
<p>This component does not have any extra option.</p>
</api-item>
<api-item title="API - md-speed-dial-trigger">
<p>This component is just an alias of <code>md-button</code> with <code>md-fab</code> class. So every option of <router-link to="/components/button">Buttons</router-link> can be applied here, even the Vue Router options...</p>
</api-item>
</div>
</page-container>
</template>
<script>
import examples from 'docs-mixins/docsExample'
export default {
name: 'DocSpeedDial',
mixins: [examples],
data: () => ({
props: {
headings: ['Name', 'Description', 'Default'],
props: [
{
name: 'md-direction',
type: 'String',
description: 'Applies the style to show the content below or above the trigger',
defaults: 'top'
}, {
offset: true,
name: 'md-direction="top"',
type: 'String',
description: 'Sets the direction of the animation effect to top. This is the default value of md-direction. You don\'t have to pass it unless you want to reset it\'s default value',
defaults: '-'
},
{
offset: true,
name: 'md-direction="bottom"',
type: 'String',
description: 'Sets the direction of the animation effect to bottom.',
defaults: '-'
},
{
name: 'md-effect',
type: 'Boolean',
description: 'Enables/Disables the ripple effect.',
defaults: 'fling'
},
{
offset: true,
name: 'md-effect="fling"',
type: 'String',
description: 'Applies a reveal effect combining both opacity and scale. This is the default behaviour in most of applications using FAB.',
defaults: '-'
},
{
offset: true,
name: 'md-effect="scale"',
type: 'String',
description: 'Applies a reveal effect using scale only.',
defaults: '-'
},
{
offset: true,
name: 'md-effect="opacity"',
type: 'String',
description: 'Applies a reveal effect using opacity only.',
defaults: '-'
},
{
name: 'md-event',
type: 'String',
description: 'Specifies the event who triggers the content',
defaults: 'hover'
},
{
offset: true,
name: 'md-event="hover"',
type: 'String',
description: 'Opens the content on hover.',
defaults: '-'
},
{
offset: true,
name: 'md-event="click"',
type: 'String',
description: 'Opens the content on click.',
defaults: '-'
}
]
},
classes: {
headings: ['Name', 'Description'],
props: [
{
name: 'md-top-right',
description: 'Positions the Speed Dial on the top right of the nearest relative parent'
},
{
name: 'md-top-center',
description: 'Positions the Speed Dial on the top center of the nearest relative parent'
},
{
name: 'md-top-left',
description: 'Positions the Speed Dial on the top left of the nearest relative parent'
},
{
name: 'md-bottom-right',
description: 'Positions the Speed Dial on the bottom right of the nearest relative parent'
},
{
name: 'md-bottom-center',
description: 'Positions the Speed Dial on the bottom center of the nearest relative parent'
},
{
name: 'md-bottom-left',
description: 'Positions the Speed Dial on the bottom left of the nearest relative parent'
},
{
name: 'md-fixed',
description: 'Applies css "position: fixed" to Speed Dial. Better used with the 4 position coordinates above'
}
]
}
})
}
</script>
``` |
The Man Within (1929) is the first novel by author Graham Greene. It tells the story of Francis Andrews, a reluctant smuggler, who betrays his colleagues, and the aftermath of his betrayal. It is Greene's first published novel. (Two earlier attempts at writing novels were never published, but a book of poetry, Babbling April, was published in 1925, while Greene was a student at Balliol College, Oxford).
The title is taken from a sentence in Thomas Browne's Religio Medici: 'There's another man within me that's angry with me.'
Greene, in his preface to the Penguin paperback edition of the book, derides the book as hopelessly romantic.
Characters
The central characters are Francis Andrews; Elizabeth, a girl he meets shortly after the man she lives with dies; and Carlyon, the captain of the smuggling boat whom Andrews has betrayed by writing a letter informing the customs officers of the time that the boat will land.
Themes
The key themes in the novel are betrayal and a Freudian relationship between the protagonist Andrews and his deceased father.
Plot summary
The story begins with Andrews fleeing his fellow smugglers after a battle with the customs officials that ended with one of the customs officials dead. He stumbles upon an isolated cottage which is the home of Elizabeth. The man whom she lived with has recently died. Andrews helps protect Elizabeth from the neighbors who consider her to be a woman of loose moral character (the novel is silent about whether their view is justified or not). After encountering Carlyon, the head of the smugglers, in the fog, Andrews returns to the cottage where Elizabeth persuades him that he should testify at the trial of the smugglers at the Assizes in Lewes.
Andrews travels to Lewes and gives his testimony in court despite being scorned by the other witnesses for the prosecution as a Judas figure. The trial ends with the smugglers being acquitted and their pledging to revenge themselves on Andrews by hurting Elizabeth.
Andrews returns to Elizabeth's cottage, tells her of the danger. She sends him to the well to fetch water, and while he is gone, he discovers that one of the smugglers has come to the cottage. He runs to get help, but when he returns, he discovers that Elizabeth has killed herself while being attacked by one of the smugglers. Carlyon is sitting waiting for him. After realizing that the only way to betray his father is to hurt himself, Andrews tells Carlyon to leave and that he will take the blame for Elizabeth's death.
Film, TV or theatrical adaptations
In 1947, a film version, The Man Within, was made of the novel (called The Smugglers in the United States) starring Ronald Shiner, Michael Redgrave as Carlyon and Richard Attenborough as Andrews.
External links
Novels by Graham Greene
British novels adapted into films
1929 British novels
Novels set in Sussex
Heinemann (publisher) books
1929 debut novels |
Marbin is a jazz rock band formed by two musicians from Israel.
History
Markovitch and Rabin met shortly after Markovitch completed his military service as an infantry sergeant and Rabin had graduated from Berklee College of Music in Boston.
In 2007, Marbin was founded by saxophonist Danny Markovitch and guitarist Dani Rabin in Israel. After moving to Chicago, they released their first album in 2009. They were asked to join a band led by Paul Wertico, a drummer from Chicago who had been a member of the Pat Metheny Group. Paul introduced Marbin to bassist Steve Rodby, who had also been a member of the Pat Metheny Group, and together they recorded Breaking the Cycle (Moonjune, 2011). Wertico and Rodby appeared as guests on Marbin's next album, Last Chapter of Dreaming (Moonjune, 2013), which was recorded by Markovitch, Rabin, Jae Gentile, and Justyn Lawrence. The same members released a live album, The Third Set (Moonjune, 2014), but the membership changed for Aggressive Hippies (Moonjune, 2014), with Markovitch and Rabin joined by Greg Essig and John Lauler. The band's current line up consists of bassist Jon Nadel and drummer Everette A. Benton, Jr. Marbin released two albums with its prior line up that included drummer Blake Jiracek: Goatman and the House of the Dead (2016) and Israeli Jazz (2018). A new album with the current lineup, Strong Thing, was released on December 1, 2019.
Performing
In addition to their regular schedule playing in top venues and festivals in the U.S., (The Jazz Showcase, Frozen Dead Guy Days, Magic Bag, Gilly's, Andy's Jazz Club, Green Mill, Chicago Jazz Festival), in September 2011, Marbin toured with fusion super group Scott Henderson, Mike Clark, and Jeff Berlin on the east coast and the midwest. In March 2012, Marbin toured with Allan Holdsworth's trio that included Jimmy Haslip of the Yellowjackets and drummer Virgil Donati. In 2013 Marbin played with Wayne Krantz, Tim Lefebvre, and Nate Wood.
Discography
Marbin (self-released, 2009)
Breaking the Cycle (Moonjune, 2011)
Last Chapter of Dreaming (Moonjune, 2013)
The Third Set (Moonjune, 2014)
Aggressive Hippies (self-released, 2015)
Goatman and the House of the Dead (self-released, 2016)
Israeli Jazz (self-released, 2018)
Strong Thing (self-released, December 1, 2019)
Shreddin at Sweetwater (Live) (self-released, February 5, 2021)
Fernweh (self-released, July 2, 2021)
See also
Music of Israel
References
External links
Marbin's Official Website
American jazz ensembles
Musical groups from Chicago
Progressive rock musical groups from Illinois
Jazz musicians from Illinois |
Simon Morris (ca 1780 – 1857) was an Irish-born politician in Newfoundland. He represented Placentia and St. Mary's in the Newfoundland House of Assembly from 1842 to 1848.
He was born in Waterford and came to Newfoundland in 1828 to join his brother Patrick, who was operating a trading firm. Morris also worked as cashier (general manager) for the Newfoundland Savings Bank.
His son Edward served in the Newfoundland legislative council.
References
Year of birth uncertain
1857 deaths
Members of the Newfoundland and Labrador House of Assembly
Politicians from Waterford (city)
Irish emigrants to pre-Confederation Newfoundland
Newfoundland Colony people |
Insecticide is a story-driven action-adventure game by Crackpot Entertainment and published by Gamecock Media Group for the Nintendo DS and Microsoft Windows.
Gameplay
The game's genre was described as an action-adventure "in the truest sense of the word," with an alternation between action levels focused on platforming and shooting mechanics, and detective levels characterized by interrogation and puzzle-solving.
Plot
The game takes place in the crime-ridden city of Troi in a world where insects have evolved into the dominant life form and humans have degenerated into "hominids." The story follows two police officers from the Insecticide Division (a pun on homicide) as they try to solve a murder at the Nectarola soft drink company.
Development and release
The game was the brainchild of Mike Levine and Larry Ahern, two former and longtime employees of LucasArts best known for their contributions to that company's library of classic graphic adventure titles. They are among many LucasArts adventure alumni, including artists, designers, sound engineers and composers, that comprise the game's team. The LucasArts legacy is evident in Insecticide'''s detective missions, which are designed as miniature graphic adventures complete with inventory puzzles and dialog trees. Much of the writing and design for these segments of the game are credited to Josh Mandel, veteran of Sierra Entertainment who worked on the King's Quest, Police Quest, and Leisure Suit Larry series among others.
The PC version was to be released as two downloadable episodes with a retail version following soon afterward, but the second episode never materialized due to Gamecock being acquired by SouthPeak Games in 2008 and the latter deciding to cancel the inherited title. Part 1 had by this time been released by Gamecock through digital distribution channels like Steam, Gametap and Direct2Drive, with Part 2 in production. Southpeak itself published a retail version of the first episode as part of their "PC Classics" budget line in early 2010 without any explanation about the story's unfinished state. Ahern revealed in a 2012 interview that Part 2 was cancelled due to "a whole host of complicated financial, technical, and marketing issues," and the fact the game did not sell well.
By comparison to the heavily scaled down Nintendo DS port, the Windows version features full in-game voice acting and all of the full motion video cinematics, some of which had to be transformed into a captioned "slide show" format or removed altogether for the handheld counterpart. In order to complete the story for Windows gamers, Crackpot expressed a desire to upload the cinematics for Part 2 (as well as Part 1) on their official YouTube page, an effort that at length came to fruition. In 2012, Levine posted the entire Insecticide cinematics on his personal YouTube account.
Both Ahern and Levine currently own the rights to Insecticide. Prior to the game's troubled release, Crackpot stated that they were interested in developing a sequel and even expanding the Insecticide franchise to another medium. An animated series was considered, with Levine and Ahern putting together a series bible and shopping it to various networks without success. In 2012, Mike Levine publicly solicited fans for feedback on the possibility of a follow-up to Insecticide'', one potentially designed as a pure graphic adventure game in the traditional style, and speculated on the possibility of raising money for the project via Kickstarter.
References
External links
Official website
2008 video games
Action-adventure games
Nintendo DS games
Single-player video games
Video games about insects
Video games about police officers
Video games developed in the United States
Video games featuring female protagonists
Video games scored by Peter McConnell
Windows games
3D platform games
Gamecock Media Group games
Creat Studios games |
Ted Woodward (born November 28, 1963) is an American former college basketball coach. He served as the head men's basketball coach at the University of Maine. He took over the position vacated by John Giannini in 2004, and compiled a 117–178 in 10 seasons at the helm. He has two children with his wife, Linda. He currently serves as the Associate Director of Development for Athletics at the University of Connecticut.
Head coaching record
References
External links
Maine profile
1963 births
Living people
American men's basketball coaches
Basketball coaches from New York (state)
Bucknell University alumni
Central Connecticut Blue Devils men's basketball coaches
Maine Black Bears men's golf coaches
College men's basketball head coaches in the United States
UConn Huskies men's basketball coaches
Harvard Crimson men's basketball coaches
Maine Black Bears men's basketball coaches
People from Suffern, New York
Sportspeople from Rockland County, New York |
```shell
#! /usr/bin/env bats
load '/bats-support/load.bash'
load '/bats-assert/load.bash'
load '/getssl/test/test_helper.bash'
# This is run for every test
teardown() {
[ -n "$BATS_TEST_COMPLETED" ] || touch $BATS_RUN_TMPDIR/failed.skip
}
setup() {
[ ! -f $BATS_RUN_TMPDIR/failed.skip ] || skip "skipping tests after first failure"
export CURL_CA_BUNDLE=/root/pebble-ca-bundle.crt
}
@test "Create dual certificates using HTTP-01 verification" {
if [ -n "$STAGING" ]; then
skip "Using staging server, skipping internal test"
fi
check_nginx
if [ "$OLD_NGINX" = "false" ]; then
CONFIG_FILE="getssl-http01-dual-rsa-ecdsa.cfg"
else
CONFIG_FILE="getssl-http01-dual-rsa-ecdsa-old-nginx.cfg"
fi
setup_environment
init_getssl
create_certificate
assert_success
check_output_for_errors
check_certificates
assert [ -e "${INSTALL_DIR}/.getssl/${GETSSL_CMD_HOST}/chain.ec.crt" ]
assert [ -e "${INSTALL_DIR}/.getssl/${GETSSL_CMD_HOST}/fullchain.ec.crt" ]
assert [ -e "${INSTALL_DIR}/.getssl/${GETSSL_CMD_HOST}/${GETSSL_CMD_HOST}.ec.crt" ]
}
@test "Check renewal test works for dual certificates using HTTP-01" {
if [ -n "$STAGING" ]; then
skip "Using staging server, skipping internal test"
fi
check_nginx
run ${CODE_DIR}/getssl -U -d $GETSSL_HOST
if [ "$OLD_NGINX" = "false" ]; then
assert_line --partial "certificate on server is same as the local cert"
else
assert_line --partial "certificate is valid for more than 30 days"
fi
assert_success
}
@test "Force renewal of dual certificates using HTTP-01" {
if [ -n "$STAGING" ]; then
skip "Using staging server, skipping internal test"
fi
run ${CODE_DIR}/getssl -U -f $GETSSL_HOST
assert_success
check_output_for_errors
}
@test "Create dual certificates using DNS-01 verification" {
if [ -n "$STAGING" ]; then
skip "Using staging server, skipping internal test"
fi
check_nginx
if [ "$OLD_NGINX" = "false" ]; then
CONFIG_FILE="getssl-dns01-dual-rsa-ecdsa.cfg"
else
CONFIG_FILE="getssl-dns01-dual-rsa-ecdsa-old-nginx.cfg"
fi
setup_environment
init_getssl
create_certificate
assert_success
check_output_for_errors
check_certificates
assert [ -e "${INSTALL_DIR}/.getssl/${GETSSL_CMD_HOST}/chain.ec.crt" ]
assert [ -e "${INSTALL_DIR}/.getssl/${GETSSL_CMD_HOST}/fullchain.ec.crt" ]
assert [ -e "${INSTALL_DIR}/.getssl/${GETSSL_CMD_HOST}/${GETSSL_CMD_HOST}.ec.crt" ]
}
@test "Force renewal of dual certificates using DNS-01" {
if [ -n "$STAGING" ]; then
skip "Using staging server, skipping internal test"
fi
run ${CODE_DIR}/getssl -U -f $GETSSL_HOST
assert_success
check_output_for_errors
cleanup_environment
}
``` |
```c
/*
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are
* permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of
* conditions and the following disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to
* endorse or promote products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
int add(int first, int second) {
first = first + 2;
return first + second;
}
int main() {
return add(1, add(3, add(4, 5)));
}
``` |
Argonium (also called the argon hydride cation, the hydridoargon(1+) ion, or protonated argon; chemical formula ArH+) is a cation combining a proton and an argon atom. It can be made in an electric discharge, and was the first noble gas molecular ion to be found in interstellar space.
Properties
Argonium is isoelectronic with hydrogen chloride. Its dipole moment is 2.18 D for the ground state. The binding energy is 369 kJ mol−1 (2.9 eV). This is smaller than that of and many other protonated species, but more than that of .
Rotationless radiative lifetimes of different vibrational states vary with isotope and become shorter for the more rapid high-energy vibrations:
{|class="wikitable"
|+Lifetimes (ms)
!v !!ArH+ !!ArD+
|-
|1 ||2.28 ||9.09
|-
|2 ||1.20 ||4.71
|-
|3 ||0.85 ||3.27
|-
|4 ||0.64 ||2.55
|-
|5 ||0.46 ||2.11
|}
The force constant in the bond is calculated at 3.88 mdyne/Å2.
Reactions
ArH+ + H2 → Ar +
ArH+ + C → Ar + CH+
ArH+ + N → Ar + NH+
ArH+ + O → Ar + OH+
ArH+ + CO → Ar + COH+
But the reverse reaction happens:
Ar + → ArH+ + H.
Ar + → *ArH+ + H2
Ar+ + H2 has a cross section of 10−18 m2 for low energy. It has a steep drop off for energies over 100 eV
Ar + has a cross sectional area of for low energy , but when the energy exceeds 10 eV yield reduces, and more Ar+ and H2 is produced instead.
Ar + has a maximum yield of ArH+ for energies between 0.75 and 1 eV with a cross section of . 0.6 eV is needed to make the reaction proceed forward. Over 4 eV more Ar+ and H starts to appear.
Argonium is also produced from Ar+ ions produced by cosmic rays and X-rays from neutral argon.
Ar+ + H2 → *ArH+ + H 1.49 eV
When ArH+ encounters an electron, dissociative recombination can occur, but it is extremely slow for lower energy electrons, allowing ArH+ to survive for a much longer time than many other similar protonated cations.
ArH+ + e− → Ar + H
Because ionisation potential of argon atoms is lower than that of the hydrogen molecule (in contrast to that of helium or neon), the argon ion reacts with molecular hydrogen, but for helium and neon ions, they will strip an electron from a hydrogen molecule.
Ar+ + H2 → ArH+ + H
Ne+ + H2 → Ne + H+ + H (dissociative charge transfer)
He+ + H2 → He + H+ + H
Spectrum
Artificial ArH+ made from earthly argon contains mostly the isotope 40Ar rather than the cosmically abundant 36Ar. Artificially it is made by an electric discharge through an argon–hydrogen mixture. Brault and Davis were the first to detect the molecule using infrared spectroscopy to observe vibration–rotation bands.
The UV spectrum has two absorption points resulting in the ion breaking up. The 11.2 eV conversion to the B1Π state has a low dipole and so does not absorb much. A 15.8 eV to a repulsive A1Σ+ state is at a shorter wavelength than the Lyman limit, and so there are very few photons around to do this in space.
Natural occurrence
ArH+ occurs in interstellar diffuse atomic hydrogen gas. For argonium to form, the fraction of molecular hydrogen H2 must be in the range 0.0001 to 0.001. Different molecular ions form in correlation with different concentrations of H2. Argonium is detected by its absorption lines at 617.525 GHz (J = 1→0), and 1234.602 GHz (J = 2→1). These lines are due to the isotopolog 36Ar1H+ undergoing rotational transitions. The lines have been detected in the direction of the galactic centre SgrB2(M) and SgrB2(N), G34.26+0.15, W31C (G10.62−0.39), W49(N), and W51e, however where absorption lines are observed, argonium is not likely to be in the microwave source, but instead in the gas in front of it. Emission lines are found in the Crab Nebula.
In the Crab Nebula ArH+ occurs in several spots revealed by emission lines. The strongest place is in the Southern Filament. This is also the place with the strongest concentration of Ar+ and Ar2+ ions. The column density of ArH+ in the Crab Nebula is between 1012 and 1013 atoms per square centimeter. Possible the energy required to excite the ions so that then can emit comes from collisions with electrons or hydrogen molecules. Towards the Milky Way centre the column density of ArH+ is around .
Two isotopologs of argonium 36ArH+ and 38ArH+ are known to be in a distant unnamed galaxy with a redshift of z = 0.88582 (7.5 billion light years away) which is on the line of sight to the blazar PKS 1830−211.
Electron neutralization and destruction of argonium outcompletes the formation rate in space if the H2 concentration is below 1 in 10−4.
History
Using the McMath solar Fourier transform spectrometer at Kitt Peak National Observatory, James W. Brault and Sumner P. Davis observed ArH+ vibration-rotation infrared lines for the first time. J. W. C. Johns also observed the infrared spectrum.
Use
Argon facilitates the reaction of tritium (T2) with double bonds in fatty acids by forming an ArT+ (tritium argonium) intermediate. When gold is sputtered with an argon-hydrogen plasma, the actual displacement of gold is done by ArH+.
References
Argon compounds |
```objective-c
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#pragma once
#include "paddle/phi/core/dense_tensor.h"
namespace phi {
template <typename T, typename Context>
void CummaxGradKernel(const Context& dev_ctx,
const DenseTensor& x,
const DenseTensor& indices,
const DenseTensor& out_grad,
int axis,
DataType dtype,
DenseTensor* x_grad);
template <typename T, typename Context>
void CumminGradKernel(const Context& dev_ctx,
const DenseTensor& x,
const DenseTensor& indices,
const DenseTensor& out_grad,
int axis,
DataType dtype,
DenseTensor* x_grad);
} // namespace phi
``` |
```html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "path_to_url">
<html xmlns="path_to_url">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
<title>MEGA 2.0</title>
<meta http-equiv="X-UA-Compatible" content="IE=Edge" />
<link rel="stylesheet" type="text/css" href="css/style.css" />
<link rel="stylesheet" type="text/css" href="css/style.css" />
<script type="text/javascript" src="js/jquery-1.8.1.js"></script>
<script type="text/javascript" src="js/jquery.jscrollpane.js"></script>
<script type="text/javascript" src="js/jquery.mousewheel.js"></script>
<script type="text/javascript">
$(document).ready(function() {
function initMainScroll()
{
$('.main-scroll-block').jScrollPane({enableKeyboardNavigation:false,showArrows:true, arrowSize:5,animateScroll: true});
}
initMainScroll();
$(window).bind('resize', function ()
{
initMainScroll();
});
$('.login-register-input input').unbind('focus');
$('.login-register-input input').bind('focus',function(e)
{
$(this).parent().addClass('focused');
});
$('.login-register-input input').unbind('blur');
$('.login-register-input input').bind('blur',function(e)
{
$(this).parent().removeClass('focused');
});
});
</script>
</head>
<body id="bodyel" class="bottom-pages">
<div id="startholder" class="fmholder" style="display: block;">
<div class="widget-block hidden">
<div class="widget-circle percents-0">
<div class="widget-arrows">
<div class="widget-tooltip">
<div class="widget-icon uploading hidden"> <span class="widget-txt">Uploading</span> <span class="widget-speed-block ulspeed"> KB/s </span> </div>
<div class="widget-icon downloading hidden"> <span class="widget-txt">Downloading</span> <span class="widget-speed-block dlspeed"> KB/s </span> </div>
</div>
<div class="widget-arrow"></div>
</div>
</div>
</div>
<div class="main-scroll-block">
<div class="main-pad-block">
<div class="top-head"> <a class="logo"></a> <a class="top-menu-icon">Menu</a>
<a class="create-account-button hidden"> Create Account </a> <a class="top-login-button hidden"> Login </a>
<a class="fm-avatar" style="display: block;"><img alt="" src="blob:path_to_url"></a>
<div class="activity-status-block" style="display: none;">
<div class="activity-status online" style="display: none;"></div>
</div>
<div class="top-search-bl">
<div class="top-search-clear">
<div class="top-clear-button"></div>
<input type="text" value="Search" class="top-search-input">
</div>
</div>
</div>
<!-- Recover-page step2 !-->
<div class="main-mid-pad backup-recover">
<div class="main-left-block">
<h3 class="main-italic-header">Account recovery</h3>
<div class="register-st2-txt-block">
<p>
Your password is also your encryption key, so when you lose it you risk losing access to your data.</span>
</p>
<h5 class="main-italic-header">
<span class="red">Download to your computer</span>
</h5>
<!-- Add class "uploading" to show percents !-->
<div class="recover-upload-block">
<div class="restore-upload-percents">
100%
</div>
<div class="backup-file-info">
<!-- please hide 2 spans if its needed. Please add "success" or "fail" classnames according uploading status. !-->
<span class="restore-uploading-status-icon success"> </span>
<span class="tranfer-filetype-txt">README.txt</span>
</div>
<div class="backup-download-button">
Upload
</div>
</div>
<!-- Please add "fail" class to add fail icon !-->
<div class="login-register-input">
<div class="backup-input-button">Verify</div>
<input type="text" name="key-input2" id="key-input2" value="Your Key">
</div>
</div>
</div>
<!-- Remove "hidden" class if upload is succes !-->
<div class="main-right-block recover-block">
<h3 class="main-italic-header"><span class="green">Congratulations!</span></h3>
<div class="register-st2-txt-block">
<p>
You were able to regain access to your account. Please choose a new password below:
</p>
<div class="login-register-input password first">
<div class="top-login-input-tooltip">
<div class="top-login-tooltip-arrow">
<div class="top-loginp-tooltip-txt password">
Invalid password.
<div class="white-txt password">Please strengthen your password.</div>
</div>
</div>
</div>
<div class="password-status-icon">
<div class="password-status-warning hidden">
</div>
</div>
<div class="register-loading-icon"><img alt="" src="path_to_url"></div>
<input type="text" name="login-password" id="register-password" value="Password">
</div>
<div class="new-registration good2">
<div class="register-pass-status-line1"></div>
<div class="register-pass-status-line2"></div>
<div class="register-pass-status-line3"></div>
<div class="register-pass-status-line4"></div>
<div class="register-pass-status-line5"></div>
<div class="password-stutus-txt hidden">
<div class="new-reg-status-pad">
<strong>Strength:</strong>
Password status
</div>
<div class="new-reg-status-description">
Your password is easily guessed. Try making your password longer. Combine uppercase & lowercase letters. Add special characters. Do not use names or dictionary words.
</div>
</div>
</div>
<div class="login-register-input password confirm">
<div class="top-login-input-tooltip">
<div class="top-login-tooltip-arrow">
<div class="top-loginp-tooltip-txt">
Passwords do not match.
<div class="white-txt">Please try again</div>
</div>
</div>
</div>
<input type="text" name="login-password2" id="register-password2" value="Retype Password">
</div>
<div class="restore-verify-button active">
Validate password
</div>
<div class="clear"></div>
</div>
</div>
<!-- Remove "hidden" class if user clicked "No" !-->
<div class="main-right-block recover-block hidden">
<h3 class="main-italic-header"><span class="red">Oops.</span></h3>
<div class="register-st2-txt-block">
<p>
Something went wrong. Either this key is not associated with your account, or is a wrong file.
</p>
<p>
The file where your key is stored should be in plain text format, with the name Document_name.txt.
</p>
<p>
If you're sure that you uploaded the correct file, please <a href="">contact support</a>.
</p>
</div>
</div>
<div class="clear"></div>
</div>
<!-- end !-->
<div class="nw-bottom-block en">
<div class="nw-bottom-pad">
<div class="nw-bottom-column">
<div class="nw-bottom-header">MEGA</div>
<a href="#privacycompany" class="nw-bottom-link">The Privacy Company</a> <a href="#about" class="nw-bottom-link">About us</a> <a href="#credits" class="nw-bottom-link">Credits</a> <a href="#blog" class="nw-bottom-link">Blog</a> </div>
<div class="nw-bottom-column">
<div class="nw-bottom-header">Apps</div>
<a href="#mobile" class="nw-bottom-link">Mobile Apps</a> <a href="#sync" class="nw-bottom-link">Sync Client</a> <a href="#chrome" class="nw-bottom-link">Chrome App</a> <a href="#firefox" class="nw-bottom-link">Firefox App</a> </div>
<div class="nw-bottom-column">
<div class="nw-bottom-header">Support</div>
<a href="#help" class="nw-bottom-link">Help Centre</a> <a href="#contact" class="nw-bottom-link">Contact Us</a> <a href="#resellers" class="nw-bottom-link">Resellers</a> </div>
<div class="nw-bottom-column">
<div class="nw-bottom-header">Developers</div>
<a href="#dev" class="nw-bottom-link">SDK</a> <a href="#doc" class="nw-bottom-link">Documentation</a> <a href="#affiliates" class="nw-bottom-link">Affiliate Program</a> </div>
<div class="nw-bottom-column">
<div class="nw-bottom-header">Legal & policies</div>
<div class="nw-start-nz"></div>
<div class="clear"></div>
</div>
<div class="nw-bottom-pad-with-border">
<div class="nw-bottom-copyrights"> Mega Limited 2014 <span>All rights reserved</span> </div>
<a href="path_to_url" target="_blank" class="nw-bottom-social facebook"></a> <a href="path_to_url" target="_blank" class="nw-bottom-social twitter"></a>
<div class="clear"></div>
</div>
</div>
</div>
</div>
</div>
</div>
<div class="fm-dialog-overlay hidden"></div>
<div class="fm-dialog restore-success hidden">
<div class="reg-success-icon"></div>
<div class="reg-success-header">Awesome!</div>
<div class="reg-success-txt"> You successfully changed your password.</div>
<div class="restore-close-button">
<div class="fm-dialog-button browsers-button active">Close</div>
</div>
</div>
</body>
</html>
``` |
```objective-c
/*
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
#include <string>
#ifndef RTC_BASE_PROTOBUF_UTILS_H_
#define RTC_BASE_PROTOBUF_UTILS_H_
#if WEBRTC_ENABLE_PROTOBUF
#include "third_party/protobuf/src/google/protobuf/message_lite.h"
#include "third_party/protobuf/src/google/protobuf/repeated_field.h"
namespace webrtc {
using google::protobuf::MessageLite;
using google::protobuf::RepeatedPtrField;
} // namespace webrtc
#endif // WEBRTC_ENABLE_PROTOBUF
#endif // RTC_BASE_PROTOBUF_UTILS_H_
``` |
Dezak-e Sofla (, also Romanized as Dezak-e Soflá; also known as Dezdak Pā’īn, Dozdak-e Pā’īn, and Dozdak-e Soflá) is a village in Doab Rural District, Bazoft District, Kuhrang County, Chaharmahal and Bakhtiari Province, Iran. At the 2006 census, its population was 251, in 41 families. The village is populated by Lurs.
References
Populated places in Kuhrang County
Luri settlements in Chaharmahal and Bakhtiari Province |
```javascript
'use strict';
const nestedValue = require('../helpers/nestedValue');
module.exports = function whereNotBetween(key, values) {
return this.filter(item => (
nestedValue(item, key) < values[0] || nestedValue(item, key) > values[values.length - 1]
));
};
``` |
Megan Ann Moroney (born October 9, 1997) is an American country music singer. She charted her first single, "Tennessee Orange", in 2022.
Biography
Moroney was born October 9, 1997, in Savannah, Georgia.
She began listening to country music in her childhood and learned to play piano. While attending the University of Georgia, she opened at a concert for Chase Rice, as well as interned for Kristian Bush of Sugarland. At the university, she was in Kappa Delta sorority. After completing her degree, she moved to Nashville, Tennessee, in 2020 to begin a music career. She kept in contact with Bush, which led to him introducing her to other songwriters. She released her first single "Wonder" in 2021, which in turn led to her releasing an extended play titled Pistol Made of Roses. Her next single release was "Tennessee Orange" in 2022, a track on which Bush served as producer.
After the song's release, Moroney received attention on social media for wearing a Tennessee Volunteers shirt belonging to Morgan Wallen; it led to rumors that she was dating him, but Moroney remained neutral when asked if the two were in a relationship. After the song became popular through online streaming, Moroney signed with Arista Nashville.
In late 2022, "Tennessee Orange" debuted at number 94 on the Billboard Hot 100, giving Moroney her first chart entry. At the time, the song also charted on Billboard Hot Country Songs and Country Airplay. Arista Nashville closed while the song was climbing the charts, and as a result, Moroney was transferred to Columbia Records Nashville.
Discography
Albums
Extended plays
Singles
Concert tours
Pistol Made of Roses Tour (2023)
The Lucky Tour (2023)
Awards and nominations
Notes
References
Living people
1997 births
American women country singers
Columbia Records artists
Country musicians from Georgia (U.S. state)
Musicians from Savannah, Georgia
21st-century American singers
Arista Nashville artists |
```shell
Using tags for version control
How to set your username and email
Remote repositories: viewing, editing and deleting
Remote repositories: fetching and pushing
Dates in git
``` |
Johann Amman, Johannes Amman or Иоганн Амман (22 December 1707 in Schaffhausen – 14 December 1741 in St Petersburg) was a Swiss-Russian botanist, a member of the Royal Society and professor of botany at the Russian Academy of Sciences at St Petersburg.
Notable work
He is best known for his Stirpium Rariorum in Imperio Rutheno Sponte Provenientium Icones et Descriptiones published in 1739 with descriptions of some 285 plants from Eastern Europe and Ruthenia (now Ukraine). The plates are unsigned, though an engraving on the dedicatory leaf of the work is signed "Philipp Georg Mattarnovy", a Swiss-Italian engraver, Filippo Giorgio Mattarnovi (1716–1742), who worked at the St. Petersburg Academy.
Life
Amman was a student of Herman Boerhaave at Leyden from where he graduated as a physician in 1729. He came from Schaffhausen in Switzerland in 1729 to help Hans Sloane curate his natural history collection. Sloane was founder of the Chelsea Physic Garden and originator of the British Museum. Amman went on to St Petersburg at the invitation of Johann Georg Gmelin (1709–1755) and became a member of the Russian Academy of Sciences, regularly sending interesting plants, such as Gypsophila paniculata, back to Sloane. Linnaeus maintained a lively correspondence with Amman between 1736 and 1740.
Amman founded the Botanical Garden of the Academy of Sciences on Vasilyevsky Island in St Petersburg in 1735. In 1739 he married Elisabetha Schumacher, daughter of Johann Daniel Schumacher, the court librarian in St Petersburg.
Naming
Ammannia of the Lythraceae was named not for Johann Amman, but for Paul Amman (1634–1691), botanist, physiologist and director of the Hortus Medicus at the University of Leipzig and who published work on Materia medica in 1675.
Johann Amman is denoted by the author abbreviation Amman when citing a botanical name.
Notes
External links
Linnaeus.c18.net: Johann Amman correspondence with Carl Linnaeus
Botanists from the Russian Empire
Ukrainian botanists
1707 births
1741 deaths
Fellows of the Royal Society
Leiden University alumni
People from Schaffhausen
Botanists with author abbreviations
18th-century Swiss botanists |
Doris Allen may refer to:
Doris Twitchell Allen (1901–2002), American psychologist and founder of Children's International Summer Villages
Doris Allen (politician) (1936–1999), California politician
Doris Allen (singer), 1950s and 1960s American singer |
Rhabdophis siamensis is a keelback snake in the family Colubridae found in Thailand, Vietnam and China.
References
Rhabdophis
Snakes of Southeast Asia
Reptiles of Vietnam
Reptiles described in 1931 |
```javascript
import * as lib from './lib'
console.log(lib.cat)
``` |
```chuck
/*++
version 3. Alternative licensing terms are available. Contact
info@minocacorp.com for details. See the LICENSE file at the root of this
project for complete licensing information.
Module Name:
Broadcom 2709 PWM Audio
Abstract:
This module implements Broadcom 2709 PWM Audio support.
Author:
Chris Stevens 2-May-2017
Environment:
Kernel
--*/
from menv import driver;
function build() {
var drv;
var dynlibs;
var entries;
var name = "bc27pwma";
var sources;
sources = [
"pwma.c",
];
dynlibs = [
"drivers/sound/core:sound"
];
drv = {
"label": name,
"inputs": sources + dynlibs,
};
entries = driver(drv);
return entries;
}
``` |
```objective-c
// [AsmJit]
// Complete JIT Assembler for C++ Language.
//
// Zlib - See COPYING file in this package.
// [Guard]
#ifndef _ASMJIT_CORE_ASSEMBLER_H
#define _ASMJIT_CORE_ASSEMBLER_H
// [Dependencies - AsmJit]
#include "../core/buffer.h"
#include "../core/context.h"
#include "../core/defs.h"
#include "../core/logger.h"
#include "../core/podvector.h"
#include "../core/zonememory.h"
// [Api-Begin]
#include "../core/apibegin.h"
namespace AsmJit {
//! @addtogroup AsmJit_Core
//! @{
// ============================================================================
// [AsmJit::Assembler]
// ============================================================================
//! @brief Base class for @ref Assembler.
//!
//! This class implements core setialization API only. The platform specific
//! methods and intrinsics is implemented by derived classes.
//!
//! @sa @c Assembler.
struct Assembler
{
// your_sha256_hash----------
// [Construction / Destruction]
// your_sha256_hash----------
//! @brief Creates Assembler instance.
ASMJIT_API Assembler(Context* context);
//! @brief Destroys Assembler instance
ASMJIT_API virtual ~Assembler();
// your_sha256_hash----------
// [LabelLink]
// your_sha256_hash----------
//! @brief Data structure used to link linked-labels.
struct LabelLink
{
//! @brief Previous link.
LabelLink* prev;
//! @brief Offset.
sysint_t offset;
//! @brief Inlined displacement.
sysint_t displacement;
//! @brief RelocId if link must be absolute when relocated.
sysint_t relocId;
};
// your_sha256_hash----------
// [LabelData]
// your_sha256_hash----------
//! @brief Label data.
struct LabelData
{
//! @brief Label offset.
sysint_t offset;
//! @brief Label links chain.
LabelLink* links;
};
// your_sha256_hash----------
// [RelocData]
// your_sha256_hash----------
// X86 architecture uses 32-bit absolute addressing model by memory operands,
// but 64-bit mode uses relative addressing model (RIP + displacement). In
// code we are always using relative addressing model for referencing labels
// and embedded data. In 32-bit mode we must patch all references to absolute
// address before we can call generated function. We are patching only memory
// operands.
//! @brief Code relocation data (relative vs absolute addresses).
struct RelocData
{
//! @brief Type of relocation.
uint32_t type;
//! @brief Size of relocation (4 or 8 bytes).
uint32_t size;
//! @brief Offset from code begin address.
sysint_t offset;
//! @brief Relative displacement or absolute address.
union
{
//! @brief Relative displacement from code begin address (not to @c offset).
sysint_t destination;
//! @brief Absolute address where to jump;
void* address;
};
};
// your_sha256_hash----------
// [Context]
// your_sha256_hash----------
//! @brief Get code generator.
inline Context* getContext() const
{ return _context; }
// your_sha256_hash----------
// [Memory Management]
// your_sha256_hash----------
//! @brief Get zone memory manager.
inline ZoneMemory* getZoneMemory() const
{ return const_cast<ZoneMemory*>(&_zoneMemory); }
// your_sha256_hash----------
// [Logging]
// your_sha256_hash----------
//! @brief Get logger.
inline Logger* getLogger() const
{ return _logger; }
//! @brief Set logger to @a logger.
ASMJIT_API virtual void setLogger(Logger* logger);
// your_sha256_hash----------
// [Error Handling]
// your_sha256_hash----------
//! @brief Get error code.
inline uint32_t getError() const
{ return _error; }
//! @brief Set error code.
//!
//! This method is virtual, because higher classes can use it to catch all
//! errors.
ASMJIT_API virtual void setError(uint32_t error);
// your_sha256_hash----------
// [Properties]
// your_sha256_hash----------
//! @brief Get assembler property.
ASMJIT_API virtual uint32_t getProperty(uint32_t propertyId) const;
//! @brief Set assembler property.
ASMJIT_API virtual void setProperty(uint32_t propertyId, uint32_t value);
// your_sha256_hash----------
// [Capacity]
// your_sha256_hash----------
//! @brief Get capacity of internal code buffer.
inline size_t getCapacity() const
{ return _buffer.getCapacity(); }
// your_sha256_hash----------
// [Offset]
// your_sha256_hash----------
//! @brief Return current offset in buffer.
inline size_t getOffset() const
{ return _buffer.getOffset(); }
//! @brief Set offset to @a o and returns previous offset.
//!
//! This method can be used to truncate code (previous offset is not
//! recorded) or to overwrite instruction stream at position @a o.
//!
//! @return Previous offset value that can be uset to set offset back later.
inline size_t toOffset(size_t o)
{ return _buffer.toOffset(o); }
// your_sha256_hash----------
// [GetCode / GetCodeSize]
// your_sha256_hash----------
//! @brief Return start of assembler code buffer.
//!
//! Note that buffer address can change if you emit instruction or something
//! else. Use this pointer only when you finished or make sure you do not
//! use returned pointer after emitting.
inline uint8_t* getCode() const
{ return _buffer.getData(); }
//! @brief Return current offset in buffer (same as <code>getOffset() + getTramplineSize()</code>).
inline size_t getCodeSize() const
{ return _buffer.getOffset() + getTrampolineSize(); }
// your_sha256_hash----------
// [TakeCode]
// your_sha256_hash----------
//! @brief Take internal code buffer and NULL all pointers (you take the ownership).
ASMJIT_API uint8_t* takeCode();
// your_sha256_hash----------
// [Clear / Reset]
// your_sha256_hash----------
//! @brief Clear everything, but not deallocate buffers.
ASMJIT_API void clear();
//! @brief Reset everything (means also to free all buffers).
ASMJIT_API void reset();
//! @brief Called by clear() and reset() to clear all data related to derived
//! class implementation.
ASMJIT_API virtual void _purge();
// your_sha256_hash----------
// [EnsureSpace]
// your_sha256_hash----------
//! @brief Ensure space for next instruction.
//!
//! Note that this method can return false. It's rare and probably you never
//! get this, but in some situations it's still possible.
inline bool ensureSpace()
{ return _buffer.ensureSpace(); }
// your_sha256_hash----------
// [GetTrampolineSize]
// your_sha256_hash----------
//! @brief Get size of all possible trampolines needed to successfuly generate
//! relative jumps to absolute addresses. This value is only non-zero if jmp
//! of call instructions were used with immediate operand (this means jump or
//! call absolute address directly).
//!
//! Currently only _emitJmpOrCallReloc() method can increase trampoline size
//! value.
inline size_t getTrampolineSize() const
{ return _trampolineSize; }
// your_sha256_hash----------
// [Buffer - Getters]
// your_sha256_hash----------
//! @brief Get byte at position @a pos.
inline uint8_t getByteAt(size_t pos) const
{ return _buffer.getByteAt(pos); }
//! @brief Get word at position @a pos.
inline uint16_t getWordAt(size_t pos) const
{ return _buffer.getWordAt(pos); }
//! @brief Get dword at position @a pos.
inline uint32_t getDWordAt(size_t pos) const
{ return _buffer.getDWordAt(pos); }
//! @brief Get qword at position @a pos.
inline uint64_t getQWordAt(size_t pos) const
{ return _buffer.getQWordAt(pos); }
//! @brief Get int32_t at position @a pos.
inline int32_t getInt32At(size_t pos) const
{ return (int32_t)_buffer.getDWordAt(pos); }
//! @brief Get int64_t at position @a pos.
inline int64_t getInt64At(size_t pos) const
{ return (int64_t)_buffer.getQWordAt(pos); }
//! @brief Get intptr_t at position @a pos.
inline intptr_t getIntPtrTAt(size_t pos) const
{ return _buffer.getIntPtrTAt(pos); }
//! @brief Get uintptr_t at position @a pos.
inline uintptr_t getUIntPtrTAt(size_t pos) const
{ return _buffer.getUIntPtrTAt(pos); }
//! @brief Get uintptr_t at position @a pos.
inline size_t getSizeTAt(size_t pos) const
{ return _buffer.getSizeTAt(pos); }
// your_sha256_hash----------
// [Buffer - Setters]
// your_sha256_hash----------
//! @brief Set byte at position @a pos.
inline void setByteAt(size_t pos, uint8_t x)
{ _buffer.setByteAt(pos, x); }
//! @brief Set word at position @a pos.
inline void setWordAt(size_t pos, uint16_t x)
{ _buffer.setWordAt(pos, x); }
//! @brief Set dword at position @a pos.
inline void setDWordAt(size_t pos, uint32_t x)
{ _buffer.setDWordAt(pos, x); }
//! @brief Set qword at position @a pos.
inline void setQWordAt(size_t pos, uint64_t x)
{ _buffer.setQWordAt(pos, x); }
//! @brief Set int32_t at position @a pos.
inline void setInt32At(size_t pos, int32_t x)
{ _buffer.setDWordAt(pos, (uint32_t)x); }
//! @brief Set int64_t at position @a pos.
inline void setInt64At(size_t pos, int64_t x)
{ _buffer.setQWordAt(pos, (uint64_t)x); }
//! @brief Set intptr_t at position @a pos.
inline void setIntPtrTAt(size_t pos, intptr_t x)
{ _buffer.setIntPtrTAt(pos, x); }
//! @brief Set uintptr_t at position @a pos.
inline void setUInt64At(size_t pos, uintptr_t x)
{ _buffer.setUIntPtrTAt(pos, x); }
//! @brief Set size_t at position @a pos.
inline void setSizeTAt(size_t pos, size_t x)
{ _buffer.setSizeTAt(pos, x); }
// your_sha256_hash----------
// [CanEmit]
// your_sha256_hash----------
//! @brief Get whether the instruction can be emitted.
//!
//! This function behaves like @c ensureSpace(), but it also checks if
//! assembler is in error state and in that case it returns @c false.
//! Assembler internally always uses this function before new instruction is
//! emitted.
//!
//! It's implemented like:
//! <code>return ensureSpace() && !getError();</code>
inline bool canEmit()
{
// If there is an error, we can't emit another instruction until last error
// is cleared by calling @c setError(kErrorOk). If something caused the
// error while generating code it's probably fatal in all cases. You can't
// use generated code anymore, because you are not sure about the status.
if (_error)
return false;
// The ensureSpace() method returns true on success and false on failure. We
// are catching return value and setting error code here.
if (ensureSpace())
return true;
// If we are here, there is memory allocation error. Note that this is HEAP
// allocation error, virtual allocation error can be caused only by
// AsmJit::VirtualMemory class!
setError(kErrorNoHeapMemory);
return false;
}
// your_sha256_hash----------
// [Emit]
//
// These functions are not protected against buffer overrun. Each place of
// code which calls these functions ensures that there is some space using
// canEmit() method. Emitters are internally protected in AsmJit::Buffer,
// but only in debug builds.
// your_sha256_hash----------
//! @brief Emit Byte to internal buffer.
inline void _emitByte(uint8_t x)
{ _buffer.emitByte(x); }
//! @brief Emit word (2 bytes) to internal buffer.
inline void _emitWord(uint16_t x)
{ _buffer.emitWord(x); }
//! @brief Emit dword (4 bytes) to internal buffer.
inline void _emitDWord(uint32_t x)
{ _buffer.emitDWord(x); }
//! @brief Emit qword (8 bytes) to internal buffer.
inline void _emitQWord(uint64_t x)
{ _buffer.emitQWord(x); }
//! @brief Emit Int32 (4 bytes) to internal buffer.
inline void _emitInt32(int32_t x)
{ _buffer.emitDWord((uint32_t)x); }
//! @brief Emit Int64 (8 bytes) to internal buffer.
inline void _emitInt64(int64_t x)
{ _buffer.emitQWord((uint64_t)x); }
//! @brief Emit intptr_t (4 or 8 bytes) to internal buffer.
inline void _emitIntPtrT(intptr_t x)
{ _buffer.emitIntPtrT(x); }
//! @brief Emit uintptr_t (4 or 8 bytes) to internal buffer.
inline void _emitUIntPtrT(uintptr_t x)
{ _buffer.emitUIntPtrT(x); }
//! @brief Emit size_t (4 or 8 bytes) to internal buffer.
inline void _emitSizeT(size_t x)
{ _buffer.emitSizeT(x); }
//! @brief Embed data into instruction stream.
ASMJIT_API void embed(const void* data, size_t len);
// your_sha256_hash----------
// [Reloc]
// your_sha256_hash----------
//! @brief Relocate code to a given address @a dst.
//!
//! @param dst Where the relocated code should me stored. The pointer can be
//! address returned by virtual memory allocator or your own address if you
//! want only to store the code for later reuse (or load, etc...).
//! @param addressBase Base address used for relocation. When using JIT code
//! generation, this will be the same as @a dst, only casted to system
//! integer type. But when generating code for remote process then the value
//! can be different.
//!
//! @retval The bytes used. Code-generator can create trampolines which are
//! used when calling other functions inside the JIT code. However, these
//! trampolines can be unused so the relocCode() returns the exact size needed
//! for the function.
//!
//! A given buffer will be overwritten, to get number of bytes required use
//! @c getCodeSize().
virtual size_t relocCode(void* dst, sysuint_t addressBase) const = 0;
//! @brief Simplifed version of @c relocCode() method designed for JIT.
//!
//! @overload
inline size_t relocCode(void* dst) const
{ return relocCode(dst, (uintptr_t)dst); }
// your_sha256_hash----------
// [Make]
// your_sha256_hash----------
//! @brief Make is convenience method to make currently serialized code and
//! return pointer to generated function.
//!
//! What you need is only to cast this pointer to your function type and call
//! it. Note that if there was an error and calling @c getError() method not
//! returns @c kErrorOk (zero) then this function always return @c NULL and
//! error value remains the same.
virtual void* make() = 0;
// your_sha256_hash----------
// [Helpers]
// your_sha256_hash----------
ASMJIT_API LabelLink* _newLabelLink();
// your_sha256_hash----------
// [Members]
// your_sha256_hash----------
//! @brief ZoneMemory management.
ZoneMemory _zoneMemory;
//! @brief Binary code buffer.
Buffer _buffer;
//! @brief Context (for example @ref JitContext).
Context* _context;
//! @brief Logger.
Logger* _logger;
//! @brief Error code.
uint32_t _error;
//! @brief Properties.
uint32_t _properties;
//! @brief Emit flags for next instruction (cleared after emit).
uint32_t _emitOptions;
//! @brief Size of possible trampolines.
uint32_t _trampolineSize;
//! @brief Inline comment that will be logged by the next instruction and
//! set to NULL.
const char* _inlineComment;
//! @brief Linked list of unused links (@c LabelLink* structures)
LabelLink* _unusedLinks;
//! @brief Labels data.
PodVector<LabelData> _labels;
//! @brief Relocations data.
PodVector<RelocData> _relocData;
};
//! @}
} // AsmJit namespace
// [Api-End]
#include "../core/apiend.h"
// [Guard]
#endif // _ASMJIT_CORE_ASSEMBLER_H
``` |
Frisk Asker Ishockey, commonly known as Frisk Asker, is a Norwegian ice hockey club based in Asker, Norway. The team is currently a member of the highest Norwegian ice hockey league, Fjordkraft-Ligaen. They are based in the municipality of Asker, around 20 km from Oslo, and play their home games in Varner Arena. The team colours are orange, black and white.
Frisk Asker is the ice hockey division of the Norwegian sports club IF Frisk Asker, founded in 1922. The ice hockey division was started in 1935. Having merged with IK Tigrene in 1969, Frisk became one of the strongest teams in Norwegian ice hockey, winning two national championships and four regular season titles during the 1970s. In the 2000s, the club won another two titles, one regular season title and one national championship, while competing as the Frisk Tigers.
History
Frisk is one of the oldest ice hockey clubs in Norway, dating back to 1935. For most of the early years the club did alright, playing mostly in the lower regional leagues. In 1968 the club was set for a great new era. Farmer Bjørn Mortensen wished to give something back to the community by building an indoor ice rink in Asker. It was the first of its kind in the Oslo area, and gave the club a tremendous lift.
Askerhallen was opened on 31 August 1969, and led to a series of events that would bring Frisk to the pinnacle of Norwegian Ice Hockey in only a few years. In Asker the facilities was first class, but playing material scarce. In Oslo, a club called Tigrene, had the exact opposite problems, so the two clubs decided to merge. Frisk immediately rose to become one of the top teams in the league.
In May 1972 disaster struck, as the Askerhallen was badly damaged in a fire. Mortensen however wished to continue his commitment, and have the arena rebuilt. The new Askerhallen was opened in 1973.
The seventies proved to be the most successful years for Frisk. Winning the Norwegian championships in 1975 and 1979.
Through the eighties Frisk stayed in the top flight, and excelled at producing talented hockey-players. Led by inspirational coach Barry Smith they made a new appearance in the play off finals in 1986. On the most however they failed to make any real impact and economical problems led the club into recession and finally relegation in the mid nineties. A merger with local club Holmen, under the name of Asker Hockey proved unsuccessful and in 1995 Frisk was back in the top league on their own feet.
The turn of the millennium saw Frisk Asker stabilized as a strong team in the top flight. In 2002, Frisk could finally celebrate their third Norwegian championship, after beating the Storhamar Dragons in a dramatic final.
Frisk won their fourth Norwegian championship in 2019.
Season-by-season results
This is a partial list of the last ten seasons completed by Frisk Asker. For the full season-by-season history, see List of Frisk Asker Ishockey seasons.
Source:
Retired numbers
Records and statistics
Statistics for regular season and playoffs.
– current active player
Scoring leaders
Most league matches
Last updated: 28 May 2018Source: www.friskasker.no
Leaders
Head coaches
Barry Smith 1984–1986
Henry Hamberg 1996–1998
Serge Boisvert 1998–2003
Ulf Weinstock 2003–2004
Michael A. L. Tipson 20/20
Jan Votruba 2004–2005
Esa Tikkanen 2005–2006
Patrik Christer Ross 2006–2007
Sune Bergman 2007–2010
Mats Lusth 2010–2012
Sune Bergman 2012–2018
Scott Hillman 2018–
Notes
References
External links
Official website
1922 establishments in Norway
Eliteserien (ice hockey) teams
Ice hockey teams in Norway
Organisations based in Asker
Sport in Asker
Ice hockey clubs established in 1935
1935 establishments in Norway |
KIEM-TV (channel 3) is a television station in Eureka, California, United States, affiliated with NBC. It is owned by Imagicomm Communications alongside low-power CBS affiliate KVIQ-LD (channel 14). Both stations share studios on South Broadway in Spruce Point near the southwestern corner of Eureka, while KIEM-TV's transmitter is located along Kneeland Road southeast of the city.
History
KIEM-TV signed on the air as Eureka's first television station on October 25, 1953. The station was started by William B. Smullin and his company, California Oregon Broadcasting, Inc., who also started (and still owns) KOBI-TV in Medford, Oregon. The station call sign KIEM-TV was a counterpart to the company's AM radio station, KIEM — which stood for "Keep Informed Every Minute". The FM part of a broadcast trio was KRED. (Soon after KIEM-TV began broadcasting, the first stereo broadcast in Humboldt County used the AM station to broadcast the right channel and the FM station to broadcast the left channel.)
KIEM-TV was initially affiliated with CBS; however, as the only station in the market in its early years, it also provided programs from NBC, ABC, and DuMont (which folded in 1955). After KVIQ signed on in 1958 and became the NBC affiliate, both stations offered some ABC programming on a part-time basis. Full-time NBC coverage was provided by San Francisco's then-NBC affiliate KRON on area cable systems.
As NBC became the number 1 rated network in the mid-1980s, both KVIQ and KIEM increased the amount of programming aired from the work. At the same time, there were proposals for KREQ-TV (channel 23, now KAEF-TV) to launch as a new station in the Eureka market. In 1985, KIEM signed an exclusive affiliation contract with NBC, and KVIQ affiliated with CBS, while both carried ABC programming on a secondary basis until KREQ signed on. KIEM's NBC affiliation commenced on December 30. Another commercial station, KREQ-TV, signed on the air in 1987 as a Fox affiliate. When channel 23 became an ABC affiliate two years later, both KVIQ and KIEM ceased offering ABC programs on a part-time basis.
Pollack/Belz Broadcasting, who purchased the station in 1996, agreed to sell KIEM-TV to Lost Coast Broadcasting on March 13, 2017. Lost Coast, in turn, assigned its right to acquire the station to Redwood Television Partners, a subsidiary of Northwest Broadcasting, on August 15. Northwest would at that time sell its existing Eureka station, KVIQ. The sale was completed on December 1.
In February 2019, Reuters reported that Apollo Global Management had agreed to acquire the entirety of Brian Brady's television portfolio, which it intends to merge with Cox Media Group (which Apollo is acquiring at the same time) and stations spun off from Nexstar Media Group's purchase of Tribune Broadcasting, once the purchases are approved by the FCC. In March 2019 filings with the FCC, Apollo confirmed that its newly formed broadcasting group, Terrier Media, would acquire Northwest Broadcasting, with Brian Brady holding an unspecified minority interest in Terrier. In June 2019, it was announced that Terrier Media would instead operate as Cox Media Group, as Apollo had reached a deal to also acquire Cox's radio and advertising businesses. The transaction was completed on December 17.
On March 29, 2022, Cox Media Group announced it would sell KIEM-TV, KVIQ-LD and 16 other stations to Imagicomm Communications, an affiliate of the parent company of the INSP cable channel, for $488 million; the sale was completed on August 1.
Sign-off
As of November 2013, KIEM signed off every Sunday morning at 1:00 a.m., and Monday morning at 12:35 a.m., and resumes broadcast at 5:00 a.m. During sign-off and sign-on, KIEM broadcast a classic sequence, which includes the old blue "3" logo with the NBC peacock logo and the station ID, which is licensed to the city. These were shown before and after the test pattern with SMPTE color bars and the News Channel 3 logo with the current gold "3" and NBC peacock logo with the station ID. This was its current digital ID as KIEM-DT, with the call letters used until the US Digital Transition in 2009 and its slogan as "The Spirit of the North Coast" on the bottom of the pattern. KIEM did not play the national anthem at sign-off or sign-on.
As of April 2020, they are now 24/7, running infomercials and similar programming during late night hours on weekends.
News operation
KIEM produces a total of 13½ hours of local news each week, with 2½ hours each weekday and one hour on Saturdays and Sundays. Following an hour-long newscast at 6 a.m., the station provides brief news updates during the Today Show. KIEM is currently the only station within the Eureka market to provide newscasts on weekend evenings, as competitors KAEF and KBVU only broadcast weekday newscasts. In addition, the weeknight newscasts are simulcast on KVIQ-LD while the morning and weekend newscasts are only seen on KIEM. KIEM may also provide breaking news coverage for floods or other emergency coverage when warranted.
In 2017, KIEM introduced a major update to their graphics with HD capabilities.
In early 2022, John Kennedy O'Connor joined the station as the lead news anchor.
Notable former on-air staff
Marc Brown – (1984; now at KABC-TV in Los Angeles)
Technical information
Subchannels
The station's digital signal is multiplexed:
Analog-to-digital conversion
KIEM-TV shut down its analog signal, over VHF channel 3, on June 12, 2009, the official date on which full-power television stations in the United States transitioned from analog to digital broadcasts under federal mandate. The station's digital signal relocated from its pre-transition UHF channel 16 to VHF channel 3 for post-transition operations.
Translators
Satellite availability
The Eureka television market, one of the smallest in the country, was the only TV market in California not available on Dish Network until June 3, 2010, at which time it became available. Since November 2, 2011, KIEM has also been available on DirecTV.
References
External links
Official website
NBC network affiliates
Ion Television affiliates
IEM-TV
Television channels and stations established in 1953
1953 establishments in California
Imagicomm Communications
2022 mergers and acquisitions |
The system of industrial rights in Japan celebrated 100 years of existence in 1985. In celebration of the 100th anniversary of the Japanese system of industrial property rights, the Japan Patent Office selected ten great inventors whose contributions were particularly memorable and of historical significance in the industrial development of Japan.
Reliefs of these inventors were created and presented in the lobby of the Japan Patent Office to commemorate their achievements and introduce them to Japanese people.
The inventors
The ten inventors are:
Sakichi Toyoda Patent Number 1195, Wooden Weaving Machine Driven by Human Power
Kōkichi Mikimoto Patent Number 2670, Cultured pearl
Jōkichi Takamine Patent Number 4785, Adrenaline
Kikunae Ikeda Patent Number 14805, Sodium Glutamate
Umetaro Suzuki Patent Number 20785, Vitamin B1
Kyota Sugimoto Patent Number 27877, Japanese typewriter
Kotaro Honda Patent Number 32234, KS Steel
Hidetsugu Yagi Patent Number 69115, Yagi Antenna
Yasujiro Niwa Patent Number 84722, Phototelegraphic Method
Tokushichi Mishima Patent Number 96371, MKM steel
See also
List of inventors
List of Japanese inventions
References
Japanese inventors
1985 in Japan
Japanese patent law |
Jaime Lee Kirchner (born August 23, 1981) is an American actress, dancer and singer, known for her roles on television.
Life and career
Kirchner was born in Nuremberg, Germany but was raised in Clarksville, Tennessee. She attended New York University's Tisch School of the Arts in New York. She made her stage debut in the role of Mimi Marquez in the international and Broadway productions of musical Rent in 2005. Before acting, she appeared as a dancer in Beyoncé's "Work It Out" music video.
Kirchner is best known for her performances on television. She starred opposite Don Johnson in the short-lived The WB comedy-drama, Just Legal in 2005. The series was canceled after only three episodes had been aired. She later starred as one of leads alongside Taylor Schilling and Michelle Trachtenberg in the NBC medical drama Mercy from 2009 to 2010. The series also was canceled after single season. She also guest-starred on Rescue Me, CSI: Crime Scene Investigation, and Dollhouse, and had a recurring role in the USA Network comedy-drama, Necessary Roughness. In 2012, Kirchner was regular cast member of Fox series, The Mob Doctor.
In 2014, Kirchner was cast in the ABC primetime soap opera, Members Only created by Susannah Grant, but the series never aired. In 2016, she was cast in the role of Investigator Danny James on the CBS legal drama Bull.
Filmography
References
External links
American film actresses
American television actresses
Living people
1981 births
American soap opera actresses
American stage actresses
Tisch School of the Arts alumni
21st-century American actresses |
```javascript
!function(e){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{var f;"undefined"!=typeof window?f=window:"undefined"!=typeof global?f=global:"undefined"!=typeof self&&(f=self),f.Slideout=e()}}(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
'use strict';
/**
* Module dependencies
*/
var decouple = require('decouple');
var Emitter = require('emitter');
/**
* Privates
*/
var scrollTimeout;
var scrolling = false;
var doc = window.document;
var html = doc.documentElement;
var msPointerSupported = window.navigator.msPointerEnabled;
var touch = {
'start': msPointerSupported ? 'MSPointerDown' : 'touchstart',
'move': msPointerSupported ? 'MSPointerMove' : 'touchmove',
'end': msPointerSupported ? 'MSPointerUp' : 'touchend'
};
var prefix = (function prefix() {
var regex = /^(Webkit|Khtml|Moz|ms|O)(?=[A-Z])/;
var styleDeclaration = doc.getElementsByTagName('script')[0].style;
for (var prop in styleDeclaration) {
if (regex.test(prop)) {
return '-' + prop.match(regex)[0].toLowerCase() + '-';
}
}
// Nothing found so far? Webkit does not enumerate over the CSS properties of the style object.
// However (prop in style) returns the correct value, so we'll have to test for
// the precence of a specific property
if ('WebkitOpacity' in styleDeclaration) { return '-webkit-'; }
if ('KhtmlOpacity' in styleDeclaration) { return '-khtml-'; }
return '';
}());
function extend(destination, from) {
for (var prop in from) {
if (from[prop]) {
destination[prop] = from[prop];
}
}
return destination;
}
function inherits(child, uber) {
child.prototype = extend(child.prototype || {}, uber.prototype);
}
function hasIgnoredElements(el) {
while (el.parentNode) {
if (el.getAttribute('data-slideout-ignore') !== null) {
return el;
}
el = el.parentNode;
}
return null;
}
/**
* Slideout constructor
*/
function Slideout(options) {
options = options || {};
// Sets default values
this._startOffsetX = 0;
this._currentOffsetX = 0;
this._opening = false;
this._moved = false;
this._opened = false;
this._preventOpen = false;
this._touch = options.touch === undefined ? true : options.touch && true;
this._side = options.side || 'left';
// Sets panel
this.panel = options.panel;
this.menu = options.menu;
// Sets classnames
if (!this.panel.classList.contains('slideout-panel')) {
this.panel.classList.add('slideout-panel');
}
if (!this.panel.classList.contains('slideout-panel-' + this._side)) {
this.panel.classList.add('slideout-panel-' + this._side);
}
if (!this.menu.classList.contains('slideout-menu')) {
this.menu.classList.add('slideout-menu');
}
if (!this.menu.classList.contains('slideout-menu-' + this._side)) {
this.menu.classList.add('slideout-menu-' + this._side);
}
// Sets options
this._fx = options.fx || 'ease';
this._duration = parseInt(options.duration, 10) || 300;
this._tolerance = parseInt(options.tolerance, 10) || 70;
this._padding = this._translateTo = parseInt(options.padding, 10) || 256;
this._orientation = this._side === 'right' ? -1 : 1;
this._translateTo *= this._orientation;
// Init touch events
if (this._touch) {
this._initTouchEvents();
}
}
/**
* Inherits from Emitter
*/
inherits(Slideout, Emitter);
/**
* Opens the slideout menu.
*/
Slideout.prototype.open = function() {
var self = this;
this.emit('beforeopen');
if (!html.classList.contains('slideout-open')) {
html.classList.add('slideout-open');
}
this._setTransition();
this._translateXTo(this._translateTo);
this._opened = true;
setTimeout(function() {
self.panel.style.transition = self.panel.style['-webkit-transition'] = '';
self.emit('open');
}, this._duration + 50);
return this;
};
/**
* Closes slideout menu.
*/
Slideout.prototype.close = function() {
var self = this;
if (!this.isOpen() && !this._opening) {
return this;
}
this.emit('beforeclose');
this._setTransition();
this._translateXTo(0);
this._opened = false;
setTimeout(function() {
html.classList.remove('slideout-open');
self.panel.style.transition = self.panel.style['-webkit-transition'] = self.panel.style[prefix + 'transform'] = self.panel.style.transform = '';
self.emit('close');
}, this._duration + 50);
return this;
};
/**
* Toggles (open/close) slideout menu.
*/
Slideout.prototype.toggle = function() {
return this.isOpen() ? this.close() : this.open();
};
/**
* Returns true if the slideout is currently open, and false if it is closed.
*/
Slideout.prototype.isOpen = function() {
return this._opened;
};
/**
* Translates panel and updates currentOffset with a given X point
*/
Slideout.prototype._translateXTo = function(translateX) {
this._currentOffsetX = translateX;
this.panel.style[prefix + 'transform'] = this.panel.style.transform = 'translateX(' + translateX + 'px)';
return this;
};
/**
* Set transition properties
*/
Slideout.prototype._setTransition = function() {
this.panel.style[prefix + 'transition'] = this.panel.style.transition = prefix + 'transform ' + this._duration + 'ms ' + this._fx;
return this;
};
/**
* Initializes touch event
*/
Slideout.prototype._initTouchEvents = function() {
var self = this;
/**
* Decouple scroll event
*/
this._onScrollFn = decouple(doc, 'scroll', function() {
if (!self._moved) {
clearTimeout(scrollTimeout);
scrolling = true;
scrollTimeout = setTimeout(function() {
scrolling = false;
}, 250);
}
});
/**
* Prevents touchmove event if slideout is moving
*/
this._preventMove = function(eve) {
if (self._moved) {
eve.preventDefault();
}
};
doc.addEventListener(touch.move, this._preventMove);
/**
* Resets values on touchstart
*/
this._resetTouchFn = function(eve) {
if (typeof eve.touches === 'undefined') {
return;
}
self._moved = false;
self._opening = false;
self._startOffsetX = eve.touches[0].pageX;
self._preventOpen = (!self._touch || (!self.isOpen() && self.menu.clientWidth !== 0));
};
this.panel.addEventListener(touch.start, this._resetTouchFn);
/**
* Resets values on touchcancel
*/
this._onTouchCancelFn = function() {
self._moved = false;
self._opening = false;
};
this.panel.addEventListener('touchcancel', this._onTouchCancelFn);
/**
* Toggles slideout on touchend
*/
this._onTouchEndFn = function() {
if (self._moved) {
self.emit('translateend');
(self._opening && Math.abs(self._currentOffsetX) > self._tolerance) ? self.open() : self.close();
}
self._moved = false;
};
this.panel.addEventListener(touch.end, this._onTouchEndFn);
/**
* Translates panel on touchmove
*/
this._onTouchMoveFn = function(eve) {
if (
scrolling ||
self._preventOpen ||
typeof eve.touches === 'undefined' ||
hasIgnoredElements(eve.target)
) {
return;
}
var dif_x = eve.touches[0].clientX - self._startOffsetX;
var translateX = self._currentOffsetX = dif_x;
if (Math.abs(translateX) > self._padding) {
return;
}
if (Math.abs(dif_x) > 20) {
self._opening = true;
var oriented_dif_x = dif_x * self._orientation;
if (self._opened && oriented_dif_x > 0 || !self._opened && oriented_dif_x < 0) {
return;
}
if (!self._moved) {
self.emit('translatestart');
}
if (oriented_dif_x <= 0) {
translateX = dif_x + self._padding * self._orientation;
self._opening = false;
}
if (!(self._moved && html.classList.contains('slideout-open'))) {
html.classList.add('slideout-open');
}
self.panel.style[prefix + 'transform'] = self.panel.style.transform = 'translateX(' + translateX + 'px)';
self.emit('translate', translateX);
self._moved = true;
}
};
this.panel.addEventListener(touch.move, this._onTouchMoveFn);
return this;
};
/**
* Enable opening the slideout via touch events.
*/
Slideout.prototype.enableTouch = function() {
this._touch = true;
return this;
};
/**
* Disable opening the slideout via touch events.
*/
Slideout.prototype.disableTouch = function() {
this._touch = false;
return this;
};
/**
* Destroy an instance of slideout.
*/
Slideout.prototype.destroy = function() {
// Close before clean
this.close();
// Remove event listeners
doc.removeEventListener(touch.move, this._preventMove);
this.panel.removeEventListener(touch.start, this._resetTouchFn);
this.panel.removeEventListener('touchcancel', this._onTouchCancelFn);
this.panel.removeEventListener(touch.end, this._onTouchEndFn);
this.panel.removeEventListener(touch.move, this._onTouchMoveFn);
doc.removeEventListener('scroll', this._onScrollFn);
// Remove methods
this.open = this.close = function() {};
// Return the instance so it can be easily dereferenced
return this;
};
/**
* Expose Slideout
*/
module.exports = Slideout;
},{"decouple":2,"emitter":3}],2:[function(require,module,exports){
'use strict';
var requestAnimFrame = (function() {
return window.requestAnimationFrame ||
window.webkitRequestAnimationFrame ||
function (callback) {
window.setTimeout(callback, 1000 / 60);
};
}());
function decouple(node, event, fn) {
var eve,
tracking = false;
function captureEvent(e) {
eve = e;
track();
}
function track() {
if (!tracking) {
requestAnimFrame(update);
tracking = true;
}
}
function update() {
fn.call(node, eve);
tracking = false;
}
node.addEventListener(event, captureEvent, false);
return captureEvent;
}
/**
* Expose decouple
*/
module.exports = decouple;
},{}],3:[function(require,module,exports){
"use strict";
var _classCallCheck = function (instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } };
exports.__esModule = true;
/**
* Creates a new instance of Emitter.
* @class
* @returns {Object} Returns a new instance of Emitter.
* @example
* // Creates a new instance of Emitter.
* var Emitter = require('emitter');
*
* var emitter = new Emitter();
*/
var Emitter = (function () {
function Emitter() {
_classCallCheck(this, Emitter);
}
/**
* Adds a listener to the collection for the specified event.
* @memberof! Emitter.prototype
* @function
* @param {String} event - The event name.
* @param {Function} listener - A listener function to add.
* @returns {Object} Returns an instance of Emitter.
* @example
* // Add an event listener to "foo" event.
* emitter.on('foo', listener);
*/
Emitter.prototype.on = function on(event, listener) {
// Use the current collection or create it.
this._eventCollection = this._eventCollection || {};
// Use the current collection of an event or create it.
this._eventCollection[event] = this._eventCollection[event] || [];
// Appends the listener into the collection of the given event
this._eventCollection[event].push(listener);
return this;
};
/**
* Adds a listener to the collection for the specified event that will be called only once.
* @memberof! Emitter.prototype
* @function
* @param {String} event - The event name.
* @param {Function} listener - A listener function to add.
* @returns {Object} Returns an instance of Emitter.
* @example
* // Will add an event handler to "foo" event once.
* emitter.once('foo', listener);
*/
Emitter.prototype.once = function once(event, listener) {
var self = this;
function fn() {
self.off(event, fn);
listener.apply(this, arguments);
}
fn.listener = listener;
this.on(event, fn);
return this;
};
/**
* Removes a listener from the collection for the specified event.
* @memberof! Emitter.prototype
* @function
* @param {String} event - The event name.
* @param {Function} listener - A listener function to remove.
* @returns {Object} Returns an instance of Emitter.
* @example
* // Remove a given listener.
* emitter.off('foo', listener);
*/
Emitter.prototype.off = function off(event, listener) {
var listeners = undefined;
// Defines listeners value.
if (!this._eventCollection || !(listeners = this._eventCollection[event])) {
return this;
}
listeners.forEach(function (fn, i) {
if (fn === listener || fn.listener === listener) {
// Removes the given listener.
listeners.splice(i, 1);
}
});
// Removes an empty event collection.
if (listeners.length === 0) {
delete this._eventCollection[event];
}
return this;
};
/**
* Execute each item in the listener collection in order with the specified data.
* @memberof! Emitter.prototype
* @function
* @param {String} event - The name of the event you want to emit.
* @param {...Object} data - Data to pass to the listeners.
* @returns {Object} Returns an instance of Emitter.
* @example
* // Emits the "foo" event with 'param1' and 'param2' as arguments.
* emitter.emit('foo', 'param1', 'param2');
*/
Emitter.prototype.emit = function emit(event) {
var _this = this;
for (var _len = arguments.length, args = Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
args[_key - 1] = arguments[_key];
}
var listeners = undefined;
// Defines listeners value.
if (!this._eventCollection || !(listeners = this._eventCollection[event])) {
return this;
}
// Clone listeners
listeners = listeners.slice(0);
listeners.forEach(function (fn) {
return fn.apply(_this, args);
});
return this;
};
return Emitter;
})();
/**
* Exports Emitter
*/
exports["default"] = Emitter;
module.exports = exports["default"];
},{}]},{},[1])(1)
});
//# sourceMappingURL=data:application/json;base64,your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashclN1cHBvcnRlZCA/your_sha256_hashyour_sha256_hashbiAgJ2VuZCc6IG1zUG9pbnRlclN1cHBvcnRlZCA/your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashLy8gTm90aGluZyBmb3VuZCBzbyBmYXI/your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashc09wZW4oKSA/your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashdGguYWJzKHNlbGYuX2N1cnJlbnRPZmZzZXRYKSA+your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashaWZfeCA+your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashZmF1bHRcIl07Il19
``` |
```go
//go:build ee
/*
Version 1.0 ("KERO-1.0)
1. You may only view, read and display for studying purposes the source
code of the software licensed under this license, and, to the extent
explicitly provided under this license, the binary code.
2. Any use of the software which exceeds the foregoing right, including,
without limitation, its execution, compilation, copying, modification
and distribution, is expressly prohibited.
3. THE SOFTWARE IS PROVIDED AS IS, WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
END OF TERMS AND CONDITIONS
*/
package seedcontroller
import (
"context"
"testing"
kubermaticv1 "k8c.io/kubermatic/v2/pkg/apis/kubermatic/v1"
kubermaticlog "k8c.io/kubermatic/v2/pkg/log"
"k8c.io/kubermatic/v2/pkg/test/diff"
"k8c.io/kubermatic/v2/pkg/test/fake"
"k8s.io/apimachinery/pkg/api/resource"
"k8s.io/apimachinery/pkg/types"
"k8s.io/client-go/tools/record"
ctrlruntimeclient "sigs.k8s.io/controller-runtime/pkg/client"
"sigs.k8s.io/controller-runtime/pkg/reconcile"
)
const rqName = "resourceQuota"
const projectId = "project1"
func TestReconcile(t *testing.T) {
testCases := []struct {
name string
requestName string
resourceQuota *kubermaticv1.ResourceQuota
seedClient ctrlruntimeclient.Client
expectedUsage kubermaticv1.ResourceDetails
}{
{
name: "scenario 1: calculate rq local usage",
requestName: rqName,
resourceQuota: genResourceQuota(rqName),
seedClient: fake.
NewClientBuilder().
WithObjects(genResourceQuota(rqName),
genCluster("c1", projectId, "2", "5G", "10G"),
genCluster("c2", projectId, "5", "2G", "8G"),
genCluster("notSameProjectCluster", "impostor", "3", "3G", "3G")).
Build(),
expectedUsage: *genResourceDetails("7", "7G", "18G"),
},
}
for _, tc := range testCases {
t.Run(tc.name, func(t *testing.T) {
ctx := context.Background()
r := &reconciler{
log: kubermaticlog.Logger,
recorder: &record.FakeRecorder{},
seedClient: tc.seedClient,
}
request := reconcile.Request{NamespacedName: types.NamespacedName{Name: tc.requestName}}
if _, err := r.Reconcile(ctx, request); err != nil {
t.Fatalf("reconciling failed: %v", err)
}
rq := &kubermaticv1.ResourceQuota{}
err := tc.seedClient.Get(ctx, request.NamespacedName, rq)
if err != nil {
t.Fatalf("failed to get resource quota: %v", err)
}
if !diff.SemanticallyEqual(tc.expectedUsage, rq.Status.LocalUsage) {
t.Fatalf("Objects differ:\n%v", diff.ObjectDiff(tc.expectedUsage, rq.Status.LocalUsage))
}
})
}
}
func genResourceQuota(name string) *kubermaticv1.ResourceQuota {
rq := &kubermaticv1.ResourceQuota{}
rq.Name = name
rq.Spec = kubermaticv1.ResourceQuotaSpec{
Subject: kubermaticv1.Subject{
Name: projectId,
Kind: kubermaticv1.ProjectSubjectKind,
},
}
return rq
}
func genResourceDetails(cpu, mem, storage string) *kubermaticv1.ResourceDetails {
return kubermaticv1.NewResourceDetails(resource.MustParse(cpu), resource.MustParse(mem), resource.MustParse(storage))
}
func genCluster(name, projectId, cpu, mem, storage string) *kubermaticv1.Cluster {
cluster := &kubermaticv1.Cluster{}
cluster.Name = name
cluster.Labels = map[string]string{kubermaticv1.ProjectIDLabelKey: projectId}
cluster.Status.ResourceUsage = genResourceDetails(cpu, mem, storage)
return cluster
}
``` |
In the mathematical study of functional analysis, the Banach–Mazur distance is a way to define a distance on the set of -dimensional normed spaces. With this distance, the set of isometry classes of -dimensional normed spaces becomes a compact metric space, called the Banach–Mazur compactum.
Definitions
If and are two finite-dimensional normed spaces with the same dimension, let denote the collection of all linear isomorphisms Denote by the operator norm of such a linear map — the maximum factor by which it "lengthens" vectors. The Banach–Mazur distance between and is defined by
We have if and only if the spaces and are isometrically isomorphic. Equipped with the metric δ, the space of isometry classes of -dimensional normed spaces becomes a compact metric space, called the Banach–Mazur compactum.
Many authors prefer to work with the multiplicative Banach–Mazur distance
for which and
Properties
F. John's theorem on the maximal ellipsoid contained in a convex body gives the estimate:
where denotes with the Euclidean norm (see the article on spaces).
From this it follows that for all However, for the classical spaces, this upper bound for the diameter of is far from being approached. For example, the distance between and is (only) of order (up to a multiplicative constant independent from the dimension ).
A major achievement in the direction of estimating the diameter of is due to E. Gluskin, who proved in 1981 that the (multiplicative) diameter of the Banach–Mazur compactum is bounded below by for some universal
Gluskin's method introduces a class of random symmetric polytopes in and the normed spaces having as unit ball (the vector space is and the norm is the gauge of ). The proof consists in showing that the required estimate is true with large probability for two independent copies of the normed space
is an absolute extensor. On the other hand, is not homeomorphic to a Hilbert cube.
See also
Notes
References
https://planetmath.org/BanachMazurCompactum
A note on the Banach-Mazur distance to the cube
The Banach-Mazur compactum is the Alexandroff compactification of a Hilbert cube manifold
Functional analysis
Metric geometry
Metric spaces |
the People's Republic of China Marriage Certificate () is a legal document issued by the Chinese marriage registration authority to prove the valid establishment of a marriage relationship. There are two official marriage certificates, one for each man and woman.
Look
The format of the marriage certificate is uniformly formulated by the Civil Affairs Bureau. The marriage certificate must be affixed with a photo of both men and women, and stamped with a special stamp for marriage registration. After the founding of China, marriage certificates became smaller. About the size of a palm. The content is only the name, place of origin, signature, age and signature of witnesses of the person who registered the marriage. No other decorative patterns. The cover color of the certificate is purplish red.
History
In the early years, the textures of marriage books were rice paper, hard books, silk noodles, and rough edged paper, and most of them were handwritten. The first year of the Republic of China began to use ink printing.
Before 1980
Chinese marriage certificates have a long history, but the marriage certificates of various dynasties in history were privately made by the people. According to records, the earliest official marriage certificate in China appeared in the Qing Dynasty.It's called "LongFengTie".Seven to 10 days after the engagement, both parties go to the local government to collect the marriage certificate and pay taxes as required. Later, during the Taiping Heavenly Kingdom period, there was a marriage certificate called "Hehui" (合挥), which was similar to the Qing Dynasty.During the period of the Republic of China, the marriage certificate was issued by the local government, and the content and form were also different.
After the founding of the People's Republic of China, the Marriage Law of the People's Republic of China was implemented on May 1, 1950.Among them, Article 6 stipulates:"Both parties to the marriage should go to the local (district, township) people's government to register in person. For marriages that comply with the provisions of this law, the local people's government shall immediately issue a marriage certificate.Any marriage not in conformity with the provisions of this law shall not be registered."After the divorce, if both the man and the woman voluntarily restore the marital relationship, they should register with the district people's government for restoration of marriage.The district people's government shall register and issue a resumed marriage certificate.
Approved by the State Council of the People's Republic of China on May 20, 1955, on June 1, 1955, the Ministry of Internal Affairs of the People's Republic of China promulgated the "Marriage Registration Measures", which stipulated in detail the specific methods of marriage registration. It stipulates:
After the promulgation of the "Marriage Registration Measures" in 1955, marriage certificates have always been printed by the county and city governments, so there is no uniform standard for the form and specification of marriage certificates, and most of them are in the form of certificates of merit. Marriage certificates in the 1950s ranged from larger ones to as small as two palms. From the 1950s to the 1970s, the decorative patterns on marriage certificates included traditional auspicious patterns such as mandarin ducks playing in the water and plum blossoms, as well as new patterns such as rice ears, cotton, and doves of peace. Slogans are often printed on marriage certificates, such as "voluntary" in the 1950s, "diligence and thrift, family planning" in the 1970s and 1980s, and so on.During the Cultural Revolution, some marriage certificates were also printed with Chairman Mao's portrait, Chairman Mao's quotations and so on. After the reform and opening up, with the gradual improvement of China's legal system, the legal document nature of the marriage certificate has gradually strengthened, and the form of the marriage certificate has gradually transitioned from the certificate type to the passport type.
From 1980 to 1986
On November 11, 1980, the Ministry of Civil Affairs of the People's Republic of China officially abolished the "Marriage Registration Measures" promulgated by the Ministry of Internal Affairs on June 1, 1955, and issued and implemented the "Marriage Registration Measures" at the same time. The new "Marriage Registration Measures" stipulates:
The new "Marriage Registration Measures" changed the unified printing of marriage certificates by counties and cities to the unified printing by the people's governments of provinces, autonomous regions and municipalities directly under the Central Government, which improved the standardization of marriage certificates.
From 1986 to 1994
On December 31, 1985, it was approved by the State Council of the People's Republic of China. On March 15, 1986, the Ministry of Civil Affairs of the People's Republic of China issued and implemented the "Marriage Registration Measures". The "Marriage Registration Measures" issued on November 11, 1980, were repealed at the same time. The new "Marriage Registration Measures" stipulates:
On May 10, 1986, the "Letter of the General Office of the Ministry of Civil Affairs on Making and Issuing the "Marriage Certificate" and Other Uniform Patterns" was issued, which stated that "According to the "Marriage Registration Measures" approved by the State Council on December 31, 1985 "" Article 11, on the basis of soliciting the opinions of the civil affairs departments (bureaus) and relevant departments of all provinces, autonomous regions, and municipalities directly under the Central Government, our ministry has designed and formulated the "Marriage Certificate", "Divorce Certificate", "Conjugal Relationship Certificate", The format of the "Certificate of Dissolution of Marriage".Also designed the "Marriage Registration Application", "Divorce Registration Application", "Application for Issuance of Marital Relationship Certificate" and "Application for Issuance of Marital Relationship Certificate". "Require all localities" to arrange printing according to the requirements of the attached "Explanation on Style". "In order to avoid waste, the "Marriage Certificate", "Divorce Certificate", "Marriage Registration Application" and "Divorce Registration Application" originally used in various places can continue to be used, and new certificates will be replaced after they are used up. The time for the replacement of the new certificate shall be determined by the province, autonomous region or municipality directly under the Central Government according to the actual situation, and shall be reported to the Civil Affairs Department of the Ministry of Civil Affairs for the record. "
Therefore, since 1986, the Ministry of Civil Affairs of the People's Republic of China has formulated the format of the marriage certificate, and each province, autonomous region, and municipality directly under the Central Government has printed it separately.
From 1994 to 2003
Approved by the State Council on January 12, 1994, issued by the Ministry of Civil Affairs Order No. 1 on February 1, 1994 and implemented the "Regulations on the Administration of Marriage Registration", approved by the State Council on December 31, 1985, and promulgated by the Ministry of Civil Affairs on March 15, 1986, The "Marriage Registration Measures" shall be repealed at the same time. The "Regulations on the Administration of Marriage Registration" stipulates that:
In 1994, the People's Republic of China began to print a unified marriage certificate, which was supervised by the Ministry of Civil Affairs of the People's Republic of China and stamped with the "Special Seal for the Administration of Marriage Certificates of the Ministry of Civil Affairs of the People's Republic of China". The marriage certificate is similar in shape to a passport, with gold letters on a red background.
Since 2003
On July 30, 2003, the State Council executive meeting passed, and on August 8, 2003, the State Council Order No. 387 promulgated the "Regulations on Marriage Registration", which came into force on October 1, 2003. The "Regulations on the Administration of Marriage Registration" approved by the State Council on January 12, 1994, and issued by the Ministry of Civil Affairs on February 1, 1994, shall be repealed at the same time. The Marriage Registration Ordinance states:
On July 1, 2004, the People's Republic of China launched a new version of the marriage certificate. The covers of the new version of the marriage certificate and divorce certificate are all jujube red, which changed the situation that the cover of the marriage certificate was red and the cover of the divorce certificate was green since 1994. The cover of the marriage certificate is gilded, and the cover of the divorce certificate is gilded. Both certificates are supervised by the Ministry of Civil Affairs of the People's Republic of China.In order to facilitate computer printing, the old version of vertical layout has been changed to horizontal layout. The inner core of the card uses the national flower peony as the shading, and adopts the special technology of printing money, which greatly improves the anti-counterfeiting performance. The new certificate has a unified logo and a unified color, but only a small hot color treatment, which does not highlight the difference between the two.
After 2004, the Ministry of Civil Affairs of the People's Republic of China started to promote the networking of marriage registration systems across the country. In early 2010, pilot marriage registration networking was started in Sichuan and Shaanxi provinces. In June 2010, Shandong Province uniformly used the new version of the marriage certificate and upgraded the marriage registration system throughout the province, in preparation for the marriage registration network in Shandong Province in September of the same year. The new version of the marriage certificate number is composed of the area code of the registered party, the year, and the ranking serial number. In addition, the new marriage registration number stipulates that starting with 'J' for marriage, starting with 'L' for divorce, starting with 'BJ' for re-issued marriage certificate, and starting with 'BL' for re-issue of divorce certificate. The last six digits of the letter are the area code, the middle four digits are the year, and the last six digits are the ranking number.
On September 28, 2018, the electronic marriage certificate function was launched in version 2.0 of the "Jiangsu Government Affairs" applet in cooperation with Alipay.
On August 6, 2019, Alipay announced that five provinces and cities in Fujian, Jiangxi, Jiangsu, Zhejiang, and Chongqing have launched electronic marriage certificates.
Pick up requirements
Statutory conditions for obtaining a marriage certificate: Both parties are voluntary, have no spouse, the male is over 22 years old and the female is over 20 years old, both parties are not lineal blood relatives, not collateral blood relatives within the third generation, and there is no disease that medically believes should not be married.
my country's "Marriage Law" advocates the freedom of marriage. It stands to reason that everyone has the right to marry. In fact, this is not the case. According to our country's laws and regulations, at least the following types of people are not eligible for marriage:
Process
Both men and women comply with the provisions of the Marriage Law, and the procedures for obtaining a marriage certificate can be divided into three steps: application, review and registration:
(1) Application. Both men and women who want to get married must hold their household registration certificate, resident ID card, and a signed statement that they have no spouse and no direct blood relatives or collateral blood relatives within three generations of the other party. Apply for marriage registration at the marriage registration office where one party's household registration is located. Both men and women must be present when applying for registration. If you are divorced, you should also hold a divorce certificate. In the place where prenuptial examination is carried out, the certificate of prenuptial examination from the hospital should also be held.
(2) Review. The registration authority may, when necessary, require the parties to provide relevant certification materials, conduct necessary investigations, or designate items for medical identification when examining the marriage applications of both parties.
(3) Registration. After examination, the marriage registration authority shall approve the registration and issue a marriage certificate if it considers that the marriage conditions are met. If the marriage registration authority refuses to register, it shall issue a written statement explaining the reasons for the refusal.
References
Marriage in Chinese culture
Marriage law
Identity documents |
Wiley Young Daniel (September 10, 1946 – May 10, 2019) was a United States district judge of the United States District Court for the District of Colorado.
Early education and career
Born in Louisville, Kentucky, Daniel received a Bachelor of Arts degree from Howard University in 1968 and a Juris Doctor from Howard University School of Law in 1971. He was in private practice in Detroit, Michigan from 1971 to 1977, and was also a director of Wayne County Neighborhood Legal Services from 1974 to 1976, and an adjunct professor at the Detroit College of Law from 1974 to 1977. In 1977, he moved his private practice to Denver, Colorado, and became an adjunct professor at the University of Colorado School of Law, where he continued teaching until 1980. He was also a director of Colorado's Personnel Services Board from 1979 to 1983, and was a director and vice-chair of the Iliff School of Theology in 1983.
Federal judicial service
On March 31, 1995, Daniel was nominated by President Bill Clinton to a seat on the United States District Court for the District of Colorado vacated by Sherman Glenn Finesilver. Daniel was confirmed by the United States Senate on June 30, 1995, and received his commission the same day. He served as chief judge from 2008 to 2013. He took senior status on January 1, 2013, and died on May 10, 2019.
See also
List of African-American federal judges
List of African-American jurists
List of first minority male lawyers and judges in Colorado
References
External links
1946 births
2019 deaths
Judges of the United States District Court for the District of Colorado
United States district court judges appointed by Bill Clinton
African-American judges
Howard University alumni
Howard University School of Law alumni
Lawyers from Denver
Lawyers from Detroit
Lawyers from Louisville, Kentucky
Detroit College of Law faculty
University of Colorado faculty
University of Colorado Law School faculty
20th-century American judges
21st-century American judges |
Roger Doucet, (21 April 1919 – 19 July 1981) was a Canadian tenor best known for singing the Canadian national anthem, "O Canada", on televised games of the Montreal Canadiens, Montreal Alouettes, and Montreal Expos during the 1970s. He was particularly known for his bilingual version of the anthem, which began in French and ended in English, in recognition of the two languages of Canada.
Career
Doucet's first performance of the national anthem at a Canadiens game was on 13 October 1970. Author Andrew Podnieks noted that Doucet "belted the anthem with an enthusiasm that energized the crowd as much as any Lafleur slapper or Robinson hip check."
During the inaugural Canada Cup tournament, Doucet was scheduled to sing the national anthems at a game between Czechoslovakia and the Soviet Union on 3 September 1976. However, the lyrics for "Hymn of the Soviet Union" were omitted since the mid-1950s due to their Stalinist content. Doucet consulted with the Université de Montréal's Russian department staff who provided a modified anthem to sing at the game.
Doucet also changed the way Canadians sing their anthem. Before Doucet, the final "we stand on guard for Thee" was universally sung the way it was written: fa-mi-re-soh-ti-doh, with the 'ti' and the 'doh' falling. Doucet sang the final 'ti-doh' by raising these notes an octave above their traditional pitch. The audience of CBC's Hockey Night in Canada was so vast, and his rendition so powerful, that within a few years Doucet's version became—and remains—the accepted way to conclude O Canada.
In 1980, he was made a Member of the Order of Canada, Canada's highest civilian honour, "in recognition for the feeling of pride he has instilled in his fellow citizens".
Roger Doucet died in Montreal on 19 July 1981 after sustaining a brain tumour.
Legacy
American sportswriter Paul Zimmerman (Dr. Z) remembered as a highlight of his coverage of Canadiens games that Doucet "[b]rought the house down. I mean, people would cry when he finished that song. And it never ran longer than 47 or 48 seconds."
In the Montreal Canadiens home opener for the 2020–21 NHL season, the Canadiens put together a compilation of some of the famous anthem singers they have had starting with Roger Doucet and ending with Ginette Reno.
References
External links
Roger Doucet tribute at NHL Network
May 1979 performance of US and Canadian anthems by Roger Doucet in the Montreal Forum
1919 births
1981 deaths
Canadian operatic tenors
Members of the Order of Canada
Musicians from Montreal
Deaths from brain cancer in Canada
20th-century Canadian male opera singers |
```kotlin
package mega.privacy.android.domain.usecase.backup
import com.google.common.truth.Truth
import kotlinx.coroutines.ExperimentalCoroutinesApi
import kotlinx.coroutines.test.runTest
import mega.privacy.android.domain.repository.BackupRepository
import org.junit.jupiter.api.BeforeAll
import org.junit.jupiter.api.BeforeEach
import org.junit.jupiter.api.TestInstance
import org.junit.jupiter.params.ParameterizedTest
import org.junit.jupiter.params.provider.NullAndEmptySource
import org.junit.jupiter.params.provider.ValueSource
import org.mockito.kotlin.any
import org.mockito.kotlin.mock
import org.mockito.kotlin.reset
import org.mockito.kotlin.whenever
/**
* Test class for [GetDeviceNameUseCase]
*/
@ExperimentalCoroutinesApi
@TestInstance(TestInstance.Lifecycle.PER_CLASS)
internal class GetDeviceNameUseCaseTest {
private lateinit var underTest: GetDeviceNameUseCase
private val backupRepository = mock<BackupRepository>()
@BeforeAll
fun setUp() {
underTest = GetDeviceNameUseCase(backupRepository)
}
@BeforeEach
fun resetMocks() {
reset(backupRepository)
}
@ParameterizedTest(name = "returns {0}")
@NullAndEmptySource
@ValueSource(strings = ["Samsung S23 Ultra"])
fun `test that when invoked device name is returned`(deviceName: String?) = runTest {
whenever(backupRepository.getDeviceName(any())).thenReturn(deviceName)
val actual = underTest("abcd")
Truth.assertThat(actual).isEqualTo(deviceName)
}
}
``` |
MSC Messina is a Liberian-flagged container ship. The ship is operated by Mediterranean Shipping Company which is the second largest container operator in the world. It was built in 1995.
Fire
On 24 June 2021, the ship caught fire in the midway of the Indian Ocean halfway between Sri Lanka and Malacca Strait. The fire broke in the engine room of the ship, at some away from the Great Basses Reef Lighthouse, Kirinda. The fire in incident took place when the ship departed from the Colombo Port to Singapore with around 28 crew members on board. It was revealed that the ship arrived to Sri Lanka on 22 June 2021. On 26 June 2021, the fire was brought under control by the crew members of the ship by using carbon dioxide to douse the fire. The Indian Coast Guard came to the rescue immediately as it deployed one of its ships and aircraft to provide assistance to the container ship during the rescue operations. At least one crew member was reportedly missing during the fire incident and search operations began. On 27 June 2021, the ship departed to Singapore once the fire was successful extinguished from the engine room.
References
Maritime incidents in 2021
Container ships
2021 in Sri Lanka
June 2021 events in Asia
Environmental disasters in Asia
Ship fires
Shipwrecks in the Indian Ocean
2021 fires in Asia
2021 disasters in Asia
1995 ships |
The central sterile services department (CSSD), also called sterile processing department (SPD), sterile processing, central supply department (CSD), or central supply, is an integrated place in hospitals and other health care facilities that performs sterilization and other actions on medical devices, equipment and consumables; for subsequent use by health workers in the operating theatre of the hospital and also for other aseptic procedures, e.g. catheterization, wound stitching and bandaging in a medical, surgical, maternity or paediatric ward.
Background
The operations of a sterile services department usually consist of the cleaning, disinfection, and sterilization of reusable medical equipment. Reusable medical equipment, or RME, can consist of any medical equipment from stainless steel surgical instrumentation, to IV pumps and crash carts. RME is separated into three classes: non-critical, semi-critical, and critical, with each class requiring a minimum level of reprocessing.
Non-critical items, such as IV poles and pumps, require a minimum of intermediate level disinfection which can be accomplished with most hospital disinfectants.
Semi-critical items are items that are expected to have contact with what an intact mucous membrane, and normally consists of endoscopes like those used in colonoscopies.
These items require high level disinfectants such as glutaraldehyde solution, peracetic acid, or hydrogen peroxide plasma.
Critical items, which include any instrument which will be introduced into a patient blood stream or in a normally sterile area of the body, require sterilization.
Sterilization methods in use
Sterilization is the process of destroying all living organisms on an item and is the main task of most sterile services departments. Items to be sterilized must first be cleaned in a separate decontamination room and inspected for effectiveness, cleanliness and damage. There are multiple methods of sterilization, and which one is used is dependent on many factors including: operational cost, potential hazards to workers, efficacy, time, and composition of the materials being sterilized.
In the US, one of the cheapest and easiest methods is steam sterilization, where instrumentation trays and packages are placed in a chamber which is them filled with steam, killing all microorganisms.
Sterilization can also be achieved using ethylene oxide (ETO) gas. This process was created in the 1950s by the US military and is used on items that cannot withstand the high temperatures of steam sterilization. ETO sterilization takes far longer than steam sterilization and is hazardous to workers, so alternative methods were created in the 1990s. The most common method for sterilizing at low temperatures today is by using hydrogen peroxide plasma, which has near zero risk to workers and cycles take a fraction of the time of ETO sterilization.
Depending on the healthcare facility's policy, there will be either an event related or time related sterile storage policy. If the policy is time related, an expiration date is placed on the sterile package, before being supplied to the end-user as a sterile product. If along the supply route, the sealed package got damaged or opened by a health worker, it needs to be returned to the CSSD for re-sterilization. If the healthcare facility's policy is event related, the package is considered sterile until an event occurs to compromise its sterility (e.g. opened, dropped package, high humidity conditions, etc.)
Decontamination is the most important step in the sterilization process beginning with point of use cleaning in the operating room. Items must be cleaned according to the manufacturer's instructions for use (IFU's). These must be followed for each item processed. Failure to properly clean a device will prevent sterilization from occurring. There are several factors that contribute to having a properly functioning decontamination area: [1] there must be proper dilution of detergents or damage to instruments will occur to include rusting and discoloration, [2] lumens are a big issue so there must be an assortment of brushes with varying lengths and diameters to thoroughly clean inside lumened instruments, [3] SPD staff need to be competent in the use of all processing equipment, [4] monthly in-service should be recurring and completed by the manufacturer's representative, [5] efficacy testing of the equipment should be completed and documented ensuring equipment is functioning as intended.
Sterile processing technician
A sterile processing technician is someone who cleans and sterilizes used surgical instruments and other medical supplies so that they can be safely redistributed and reused on future patients. This work is usually centralized in a special department of the medical facility.Job titles include the following:
Sterile processing and distribution technician (SPD tech or CPD tech)
Central sterile supply technician (CSS tech)
Central processing technician (CPT)
Central service technician (CST)
Certified Sterile Science Technician (CSST)
Sterile Science Associate (SSA) - degree
Sterile Scientist (SS)- degree
Master of Sterile Sciences (MSS) - degree
Operation Theatre Technology (OTT)- degree/diploma
Divisions
Sterile processing departments are typically divided into four major areas to accomplish the functions of decontamination, assembly and sterile processing, sterile storage, and distribution.
Decontamination
Disassembly & decontaminating used surgical instruments and other medical devices
Operating and maintaining special decontamination equipment like automatic washers/disinfectants, ultrasonic cleaners
Inspecting decontaminated items to make sure they are clean
Assembly
Utilize PPE's to protect self from acquiring harmful microorganisms
Sterilization and storage
Assembly & wrapping of cleaned and decontaminated instruments
Sterilizing assembled trays of instruments in appropriate sterilizers
Precisely operating and monitoring special sterilization equipment like autoclaves
Keeping detailed records of number of sterilized items, including Autoclave cycle numbers, lot/batch numbers, expiration dates for future tracking of items that has been sterilized, and stored
Distribution
Stocking crash carts
Organizing sterilized medical supplies
Ensuring that sterile supplies do not become outdated / preventing event related sterility issues
Delivering sterile supplies where they are needed and picking up dirty ones
See also
Autoclave
Sterilization (microbiology)
References
Hospital departments
Medical hygiene organizations |
Samanea Yangon Market is a wholesale and retail market located between corner of Bago River Road and Yadana in Dagon Seikkan Township, Yangon, Myanmar. It is currently managed and owned by Samanea Group.
History
The wholesale market was developed by Singapore-based Samanea Group and Myanmar-based EI Company Limited, with the permission of Myanmar Investment Commission (MIC) and Yangon City Development Committee (YCDC). Samanea invested more than into the project. Samanea Yangon Market is referred to as Phase I of the development, and construction began in 2019. Construction of the market completed in June 2020.
The market started trial operations in August 2020 and officially opened later in November. All 732 shops in the Samanea Yangon Market are fully leased by December 2020.
Phase II (staff apartments, boutique apartments, tenant warehouses, etc.) is set to begin construction on a nearby plot of land in 2021.
Overview
Samanea Yangon Market: covering a total area of 329,000 m2, with a planned gross floor area of 880,000 m2, the development is planned to be carried out in four phases.
Phase I: The market opened in 2021 officially, with a total gross floor area of 48,600 m2 and 732 shops.
Phase II project: the main body of the market will have a planned gross floor area of 79,900 m2.
Phase III Project: The main body of the market will have a total planned gross floor area of 105,000 m2.
Phase IV Project: The total planned gross floor area of the main body of the market is 100,000 m2.
Commercial facilities: In order to meet the requirements of customers, SAMANEA Yangon market is planning to build a number of supporting businesses: office buildings, commercial hotels, logistics warehouses, exhibition centres and other comprehensive facilities.
Accessibility
Samanea Yangon is located at the intersection of Bago River Road and Yadanar Road in the new development area in Dagon Seikkan Township. It is 15 km from downtown Yangon, 16 km from Yangon Port International Terminal, and 18 km from Yangon International Airport.
Opening Hours
Samanea Yangon Market is usually open from 9:00 to 18:00.
Goods
At present, the first phase of the Market is occupied by a wide range of industries. The first phase of the project is occupied by a wide range of industries with rich categories, covering twenty-one major categories such as industrial electrical, hardware and tools, digital home appliances, clothing, shoes and hats, and daily-use department stores.
References
Retail markets
Buildings and structures in Yangon Region
2018 establishments in Myanmar
Buildings and structures completed in 2020 |
```javascript
// Load modules
var Code = require('code');
var Cryptiles = require('..');
var Lab = require('lab');
// Declare internals
var internals = {};
// Test shortcuts
var lab = exports.lab = Lab.script();
var describe = lab.describe;
var it = lab.it;
var expect = Code.expect;
describe('randomString()', function () {
it('should generate the right length string', function (done) {
for (var i = 1; i <= 1000; ++i) {
expect(Cryptiles.randomString(i).length).to.equal(i);
}
done();
});
it('returns an error on invalid bits size', function (done) {
expect(Cryptiles.randomString(99999999999999999999).message).to.match(/Failed generating random bits/);
done();
});
});
describe('randomBits()', function () {
it('returns an error on invalid input', function (done) {
expect(Cryptiles.randomBits(0).message).to.equal('Invalid random bits count');
done();
});
});
describe('fixedTimeComparison()', function () {
var a = Cryptiles.randomString(50000);
var b = Cryptiles.randomString(150000);
it('should take the same amount of time comparing different string sizes', function (done) {
var now = Date.now();
Cryptiles.fixedTimeComparison(b, a);
var t1 = Date.now() - now;
now = Date.now();
Cryptiles.fixedTimeComparison(b, b);
var t2 = Date.now() - now;
expect(t2 - t1).to.be.within(-20, 20);
done();
});
it('should return true for equal strings', function (done) {
expect(Cryptiles.fixedTimeComparison(a, a)).to.equal(true);
done();
});
it('should return false for different strings (size, a < b)', function (done) {
expect(Cryptiles.fixedTimeComparison(a, a + 'x')).to.equal(false);
done();
});
it('should return false for different strings (size, a > b)', function (done) {
expect(Cryptiles.fixedTimeComparison(a + 'x', a)).to.equal(false);
done();
});
it('should return false for different strings (size, a = b)', function (done) {
expect(Cryptiles.fixedTimeComparison(a + 'x', a + 'y')).to.equal(false);
done();
});
it('should return false when not a string', function (done) {
expect(Cryptiles.fixedTimeComparison('x', null)).to.equal(false);
done();
});
it('should return false when not a string (left)', function (done) {
expect(Cryptiles.fixedTimeComparison(null, 'x')).to.equal(false);
done();
});
});
``` |
Odontellidae is a family of springtails in the order Poduromorpha. There are about 9 genera and more than 50 described species in Odontellidae.
Genera
These nine genera belong to the family Odontellidae:
Austrodontella Ellis & Bellinger, 1973
Axenyllodes Stach, 1949
Odontella Schäffer, 1897
Odontellina Deharveng, 1981
Pseudostachia Arlé, 1968
Pseudoxenyllodes Kuznetsova & Potapov, 1988
Stachia Folsom, 1932
Superodontella
Xenyllodes Axelson, 1903
References
Further reading
External links
Collembola
Articles created by Qbugbot
Arthropod families |
Montague Alfred Noble (28 January 1873 – 22 June 1940) was an Australian cricketer who played for New South Wales and Australia. A right-hand batsman, right-handed bowler who could deliver both medium pace and off-break bowling, capable fieldsman and tactically sound captain, Noble is considered one of the great Australian all-rounders. He scored 13,975 first class runs between 1893 and 1920 and took 624 wickets. He made 37 centuries – including a best of 284 in 1902 – and set several partnership and high-score records for his State team.
He played 42 Tests for his country, and captained the team for 15 of these between 1903 and 1909. Only the 12th captain of his country, he won eight of these games, lost five and drew two. Between his first Test in January 1898 and his last in August 1909, he scored 1,997 runs at 30.25 and took 121 wickets at 25.00. He complemented his only century, 133 in 1903, by scoring 16 half-centuries. Noble played 39 of his 42 Tests against England, and the other three against South Africa.
In later life, he coached and played for club level teams, including Paddington Cricket Club with which he had a long-standing connection throughout his career. He moved from banking to dentistry, and published his exegesis on cricket, Gilligan's Men. His elder brother, Ted Noble, also played briefly for New South Wales.
In 2006, he was inducted into the Cricket Hall of Fame by the CA. In June 2021, he was inducted into the ICC Cricket Hall of Fame as one of the special inductees to mark the inaugural edition of the ICC World Test Championship final.
Career
Noble was born in Sydney on 28 January 1873. He was the youngest of eight sons of Joseph and Maria Noble, who emigrated from Egham, Surrey, England. He "made a name" for himself in grade cricket with the Paddington club and first played for New South Wales (NSW) as a teenager. He toured New Zealand with NSW in 1893/94, and in 1894/95 scored a 152* against an England touring team under Andrew Stoddart which drew English attention to his batting. This cemented his place in the state side, and he was a significant contributor to NSW's consecutive Sheffield Shield victories in 1895–96 and 1896–97.
Over the summer of 1897/98, Stoddart returned with another England team and were defeated in four of the five Ashes Test matches. Noble, whose first-class form had earned him selection, scored 17 in Australia's only innings of 520, then took one wicket as England stumbled to 315 all out. Following on Noble routed the tourists with 6/49. He ended the series with the best bowling averages for both teams. Australia returned to England in 1899, and Noble experienced his first overseas tour. He scored 116 in a warm-up match and "impressed English critics chiefly by his patience and defence." He played in all five Tests, scoring 367 runs at 52.42, with four half centuries, and took 13 wickets at 31.23. At Manchester he scored 60 and 89, withstanding English bowling for eight and a half hours. Wisden would later record on his death that "his patience equalled his skill in defence, while at times he used his height and reach with full effect in driving, pulling, forcing the ball off his legs, and cutting either square or late – a batsman of rare style and execution without any sign of weakness." He was in particular noted for his ability to cater his technique to English conditions. He was named Wisden Cricketer of the Year for 1900.
Noble faced England in Australia over the winter of 1901/02, scoring 138 runs at 15.33, and taking 32 wickets at 19.00. He then returned to England in 1902 as "the best all-rounder" under Joe Darling. In a warm-up match at Hove against Sussex, he scored his career-best 284 in a then world-record partnership of 428 with Warwick Armstrong. He scored 1,416 runs across the tour, at 32.93, and took 98 wickets, though in the Test series he scored only 129 of these runs at 18.42. 1902/03 saw a further 92 runs at 23.00, including another half-century, and took six wickets.
Noble was elected to the Australian captaincy for the 1903/04 Ashes series, however England were victorious. In 1905 the leadership reverted to Joe Darling for the tour of England, but Australian again lost the rubber. Noble nevertheless scored 2,084 runs at 44.34 across the entire tour. His bowling was viewed as weaker than normal, however Wisden credited his innovative captaincy and field settings. He led his team to England once more in 1909, and reversed a hitherto unsuccessful tour for Australia with innovative captaincy and bowling. In his final Test at The Oval on 9 August 1909, he scored two and 55, though he went wicketless.
Noble returned to State cricket, where in 1908 a testimonial match at the Sydney Cricket Ground had earned him £2,000. He continued at New South Wales until 1920, however with seasonal returns of 23, 54, 201, 80 and 13 runs and wicket totals that surpassed two per season only twice in the years either side of World War I, Noble was past his prime. He retired in 1920 and moved into banking, and then dentistry. He wrote and published several works on cricket: Gilligan's Men (1925), The Game's the Thing (1926), Those Ashes (1927), and The Fight for the Ashes (1929) and also became a noted commentator and broadcaster. He continued his association with Paddington Cricket Club, and worked for a time coaching junior cricket teams. Noble unsuccessfully stood for preselection as the Nationalist Party candidate at the 1931 East Sydney by-election. He died in Sydney on 22 June 1940, survived by his brother who died a year later. He was also a church bell ringer, and reportedly visited many towers in England while on cricket tours.
References
External links
1873 births
1940 deaths
Australian Cricket Hall of Fame inductees
Australia Test cricketers
Australia Test cricket captains
New South Wales cricketers
Cricketers from Sydney
Wisden Cricketers of the Year
Wisden Leading Cricketers in the World
Australian cricketers
Cricketers who have taken five wickets on Test debut
Sport Australia Hall of Fame inductees |
Hasne Aur Hasaane Ka Tonic – Ladies Special is an Indian stand-up comedy show for ladies. It started on 18 July 2009 on Zee TV.
Concept
Hasne Aur Hasaane Ka Tonic - Ladies Special is a new standup comedy show on Zee TV that provides women a platform to project their point of view through the medium of humor. Audience has always seen women cry on screen; this time they will see them make everyone laugh.
Ladies Special is the search for ‘India’s Funniest Female Stand-Up Comedian’ and has eight contestants and three challengers.
The contestants find try to find humor in mundane stories from daily life and present a unique perspective on domestic issues, saas-bahu relationships, cricket and politics.
The contestants hail from all parts of India and are between 16 and 60 years of age. Their only qualifying criterion being their ability to evoke laughter and fun.
Format
One of the 8 contestants gets eliminated every week depending on the judges’ scores. Challengers are then called into the competition. After 8 weeks of competition, one woman will emerge as ‘India’s Funniest Woman’.
Jury
Swapnil Joshi ... Host
Tabassum ... Judge
Baba Sehgal ... Judge
References
External links
Official Site on Zee TV India
Zee TV original programming
Indian reality television series
2009 Indian television series debuts
2009 Indian television series endings |
```glsl
module Fable.Tests.Convert
open System
open System.Globalization
open Util.Testing
open Fable.Tests.Util
//-------------------------------------
// Parse and TryParse
//-------------------------------------
let tryParse f initial (value: string) =
let res = ref initial
#if FABLE_COMPILER
let success = f(value, res)
#else
let success = f(value, NumberStyles.Number, CultureInfo("en-US"), res)
#endif
(success, !res)
let parse f (a: string) =
#if FABLE_COMPILER
f(a)
#else
f(a, CultureInfo("en-US"))
#endif
let tests =
testList "Convert" [
testCase "System.Double.Parse works" <| fun () ->
parse Double.Parse "1.5" |> equal 1.5
testCase "System.Double.TryParse works" <| fun () ->
tryParse Double.TryParse 0.0 "1" |> equal (true, 1.0)
tryParse Double.TryParse 0.0 " 1 " |> equal (true, 1.0)
tryParse Double.TryParse 0.0 "1.5" |> equal (true, 1.5)
tryParse Double.TryParse 0.0 " 1.5 " |> equal (true, 1.5)
tryParse Double.TryParse 0.0 "foo" |> equal (false, 0.0)
tryParse Double.TryParse 0.0 "" |> equal (false, 0.0)
tryParse Double.TryParse 0.0 " " |> equal (false, 0.0)
tryParse Double.TryParse 0.0 "9X" |> equal (false, 0.0)
tryParse Double.TryParse 0.0 "X9" |> equal (false, 0.0)
tryParse Double.TryParse 0.0 "X9TRE34" |> equal (false, 0.0)
tryParse Double.TryParse 0.0 "9SayWhat12Huh" |> equal (false, 0.0)
tryParse Double.TryParse 0.0 "-1.5" |> equal (true, -1.5)
testCase "System.Decimal.Parse works" <| fun () ->
parse Decimal.Parse "1.5" |> equal 1.5M
testCase "System.Decimal.TryParse works" <| fun () ->
let equal expected (success, actual) =
match expected with
| Some expected -> equal true success; equal expected actual
| None -> equal false success
tryParse Decimal.TryParse 0.0M "1" |> equal (Some 1.0M)
tryParse Decimal.TryParse 0.0M " 1 " |> equal (Some 1.0M)
tryParse Decimal.TryParse 0.0M "1.5" |> equal (Some 1.5M)
tryParse Decimal.TryParse 0.0M " 1.5 " |> equal (Some 1.5M)
tryParse Decimal.TryParse 0.0M "foo" |> equal None
tryParse Decimal.TryParse 0.0M "9X" |> equal None
tryParse Decimal.TryParse 0.0M "X9" |> equal None
tryParse Decimal.TryParse 0.0M "X9TRE34" |> equal None
tryParse Decimal.TryParse 0.0M "9SayWhat12Huh" |> equal None
tryParse Decimal.TryParse 0.0M "-1.5" |> equal (Some -1.5M)
testCase "System.Single.Parse works" <| fun () ->
parse Single.Parse "1.5" |> equal 1.5f
testCase "System.Single.TryParse works" <| fun () ->
tryParse Single.TryParse 0.0f "1" |> equal (true, 1.0f)
tryParse Single.TryParse 0.0f " 1 " |> equal (true, 1.0f)
tryParse Single.TryParse 0.0f "1.5" |> equal (true, 1.5f)
tryParse Single.TryParse 0.0f " 1.5 " |> equal (true, 1.5f)
tryParse Single.TryParse 0.0f "foo" |> equal (false, 0.0f)
tryParse Single.TryParse 0.0f "9X" |> equal (false, 0.0f)
tryParse Single.TryParse 0.0f "X9" |> equal (false, 0.0f)
tryParse Single.TryParse 0.0f "X9TRE34" |> equal (false, 0.0f)
tryParse Single.TryParse 0.0f "9SayWhat12Huh" |> equal (false, 0.0f)
tryParse Single.TryParse 0.0f "-1.5" |> equal (true, -1.5f)
testCase "System.Boolean.Parse works" <| fun () ->
Boolean.Parse "true" |> equal true
Boolean.Parse "True" |> equal true
Boolean.Parse " true " |> equal true
Boolean.Parse "false" |> equal false
Boolean.Parse "False" |> equal false
Boolean.Parse " false " |> equal false
throwsAnyError (fun () -> Boolean.Parse "tru")
throwsAnyError (fun () -> Boolean.Parse "falsee")
testCase "System.Boolean.TryParse works" <| fun () ->
// expect parse success
Boolean.TryParse "true" |> equal (true, true)
Boolean.TryParse "True" |> equal (true, true)
Boolean.TryParse " true " |> equal (true, true)
Boolean.TryParse "false" |> equal (true, false)
Boolean.TryParse "False" |> equal (true, false)
Boolean.TryParse " false " |> equal (true, false)
// expect parse failure
Boolean.TryParse "tru" |> equal (false, false)
Boolean.TryParse "falsee" |> equal (false, false)
Boolean.TryParse "0" |> equal (false, false)
Boolean.TryParse "" |> equal (false, false)
Boolean.TryParse "1" |> equal (false, false)
Boolean.TryParse null |> equal (false, false)
testCase "System.SByte.Parse works" <| fun () ->
SByte.Parse("5") |> equal 5y
SByte.Parse("-5") |> equal -5y
SByte.Parse("-128") |> equal -128y
(fun () -> SByte.Parse("128")) |> throwsError ""
(fun () -> SByte.Parse("5f")) |> throwsError ""
(fun () -> SByte.Parse("F")) |> throwsError ""
(fun () -> SByte.Parse("5o")) |> throwsError ""
testCase "System.SByte.Parse with hex works" <| fun () ->
SByte.Parse("55", System.Globalization.NumberStyles.HexNumber) |> equal 85y
SByte.Parse("5f", System.Globalization.NumberStyles.HexNumber) |> equal 95y
SByte.Parse("FF", System.Globalization.NumberStyles.HexNumber) |> equal -1y
(fun () -> SByte.Parse("1FF", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
(fun () -> SByte.Parse("5o", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
(fun () -> SByte.Parse("o5", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
testCase "System.Int16.Parse works" <| fun () ->
Int16.Parse("5") |> equal 5s
Int16.Parse("-5") |> equal -5s
Int16.Parse("-32768") |> equal -32768s
(fun () -> Int16.Parse("32768")) |> throwsError ""
(fun () -> Int16.Parse("5f")) |> throwsError ""
(fun () -> Int16.Parse("FFF")) |> throwsError ""
(fun () -> Int16.Parse("5fo0")) |> throwsError ""
testCase "System.Int16.Parse with hex works" <| fun () ->
Int16.Parse("5555", System.Globalization.NumberStyles.HexNumber) |> equal 21845s
Int16.Parse("5f", System.Globalization.NumberStyles.HexNumber) |> equal 95s
Int16.Parse("FFFF", System.Globalization.NumberStyles.HexNumber) |> equal -1s
(fun () -> Int16.Parse("1FFFF", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
(fun () -> Int16.Parse("5foo", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
(fun () -> Int16.Parse("foo5", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
testCase "System.Int32.Parse works" <| fun () ->
Int32.Parse("5") |> equal 5
Int32.Parse("-5") |> equal -5
Int32.Parse("-2147483648") |> equal -2147483648
(fun () -> Int32.Parse("2147483648")) |> throwsError ""
(fun () -> Int32.Parse("5f")) |> throwsError ""
(fun () -> Int32.Parse("f5")) |> throwsError ""
(fun () -> Int32.Parse("foo")) |> throwsError ""
testCase "System.Int32.Parse with hex works" <| fun () ->
Int32.Parse("555555", System.Globalization.NumberStyles.HexNumber) |> equal 5592405
Int32.Parse("5f", System.Globalization.NumberStyles.HexNumber) |> equal 95
Int32.Parse("FFFFFFFF", System.Globalization.NumberStyles.HexNumber) |> equal -1
(fun () -> Int32.Parse("1FFFFFFFF", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
(fun () -> Int32.Parse("5foo", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
(fun () -> Int32.Parse("foo5", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
testCase "System.Int64.Parse works" <| fun () ->
Int64.Parse("5") |> equal 5L
Int64.Parse("-5") |> equal -5L
Int64.Parse("-9223372036854775808") |> equal -9223372036854775808L
(fun () -> Int64.Parse("9223372036854775808")) |> throwsError ""
(fun () -> Int64.Parse("5f")) |> throwsError ""
(fun () -> Int64.Parse("f5")) |> throwsError ""
(fun () -> Int64.Parse("foo")) |> throwsError ""
testCase "System.Int64.Parse with hex works" <| fun () ->
Int64.Parse("555555", System.Globalization.NumberStyles.HexNumber) |> equal 5592405L
Int64.Parse("5f", System.Globalization.NumberStyles.HexNumber) |> equal 95L
Int64.Parse("FFFFFFFFFFFFFFFF", System.Globalization.NumberStyles.HexNumber) |> equal -1L
(fun () -> Int64.Parse("1FFFFFFFFFFFFFFFF", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
(fun () -> Int64.Parse("5foo", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
(fun () -> Int64.Parse("foo5", System.Globalization.NumberStyles.HexNumber)) |> throwsError ""
testCase "System.Int64.TryParse works" <| fun () ->
tryParse Int64.TryParse 0L "99" |> equal (true, 99L)
tryParse Int64.TryParse 0L "foo" |> equal (false, 0L)
testCase "System.UInt32.TryParse works" <| fun () ->
tryParse UInt32.TryParse 0u "99" |> equal (true, 99u)
tryParse UInt32.TryParse 0u "foo" |> equal (false, 0u)
testCase "System.UInt64.TryParse works" <| fun () ->
tryParse UInt64.TryParse 0UL "99" |> equal (true, 99UL)
tryParse UInt64.TryParse 0UL "foo" |> equal (false, 0UL)
testCase "Parsing integers with different radices works" <| fun () ->
equal 11 (int "11")
equal 17 (int "0x11")
equal 9 (int "0o11")
equal 3 (int "0b11")
testCase "System.Int32.TryParse works" <| fun () ->
tryParse Int32.TryParse 0 "1" |> equal (true, 1)
tryParse Int32.TryParse 0 " 1 " |> equal (true, 1)
tryParse Int32.TryParse 0 "1.5" |> equal (false, 0)
tryParse Int32.TryParse 0 " 1.5 " |> equal (false, 0)
tryParse Int32.TryParse 0 "foo" |> equal (false, 0)
tryParse Int32.TryParse 0 "9X" |> equal (false, 0)
tryParse Int32.TryParse 0 "X9" |> equal (false, 0)
tryParse Int32.TryParse 0 "X9TRE34" |> equal (false, 0)
tryParse Int32.TryParse 0 "9SayWhat12Huh" |> equal (false, 0)
tryParse Int32.TryParse 0 "-1" |> equal (true, -1)
testCase "BigInt.TryParse works" <| fun () ->
tryParse bigint.TryParse 0I "4234523548923954" |> equal (true, 4234523548923954I)
tryParse bigint.TryParse 0I "9SayWhat12Huh" |> equal (false, 0I)
testCase "System.Int32.ToString works" <| fun () ->
(5592405).ToString() |> equal "5592405"
testCase "System.Int32.ToString 'd' works" <| fun () ->
(5592405).ToString("d") |> equal "5592405"
(5592405).ToString("d10") |> equal "0005592405"
testCase "System.Int32.ToString 'x' works" <| fun () ->
(5592405).ToString("x") |> equal "555555"
(5592405).ToString("x10") |> equal "0000555555"
testCase "System.Int64.ToString works" <| fun () ->
(5592405L).ToString() |> equal "5592405"
testCase "System.Int64.ToString 'd' works" <| fun () ->
(5592405L).ToString("d") |> equal "5592405"
(5592405L).ToString("d10") |> equal "0005592405"
testCase "System.Int64.ToString 'x' works" <| fun () ->
(5592405L).ToString("x") |> equal "555555"
(5592405L).ToString("x10") |> equal "0000555555"
testCase "System.BigInt.ToString works" <| fun () ->
(5592405I).ToString() |> equal "5592405"
testCase "System.Decimal.ToString works" <| fun () ->
(5592405M).ToString() |> equal "5592405"
//-------------------------------------
// System.Convert
//-------------------------------------
testCase "System.Convert.ToSByte works" <| fun () ->
let x = 1y
sbyte(1y) |> equal x
sbyte(1uy) |> equal x
sbyte(257s) |> equal x
sbyte(257) |> equal x
sbyte(257L) |> equal x
sbyte(257u) |> equal x
sbyte(257us) |> equal x
sbyte(257ul) |> equal x
sbyte(257uL) |> equal x
sbyte(1.f) |> equal x
sbyte(1.) |> equal x
sbyte(1.4) |> equal x
sbyte(1.5) |> equal x
sbyte(1.6) |> equal x
sbyte(1.m) |> equal x
sbyte("1") |> equal x
(fun () -> sbyte("1.4")) |> throwsError ""
(fun () -> sbyte("foo")) |> throwsError ""
Convert.ToSByte(1y) |> equal x
Convert.ToSByte(1uy) |> equal x
Convert.ToSByte(1s) |> equal x
Convert.ToSByte(1) |> equal x
Convert.ToSByte(1L) |> equal x
Convert.ToSByte(1u) |> equal x
Convert.ToSByte(1us) |> equal x
Convert.ToSByte(1ul) |> equal x
Convert.ToSByte(1uL) |> equal x
Convert.ToSByte(1.f) |> equal x
Convert.ToSByte(1.) |> equal x
Convert.ToSByte(1.m) |> equal x
Convert.ToSByte(1.4) |> equal x
Convert.ToSByte(1.5) |> equal (x+x)
Convert.ToSByte(1.6) |> equal (x+x)
Convert.ToSByte(2.5) |> equal (x+x)
Convert.ToSByte(2.6) |> equal (x+x+x)
Convert.ToSByte(3.5) |> equal (x+x+x+x)
Convert.ToSByte("1") |> equal x
Convert.ToSByte('a') |> equal 97y
(fun () -> Convert.ToSByte("1.4")) |> throwsError ""
(fun () -> Convert.ToSByte("foo")) |> throwsError ""
testCase "System.Convert.ToInt16 works" <| fun () ->
let x = 1s
int16(1y) |> equal x
int16(1uy) |> equal x
int16(1s) |> equal x
int16(65537) |> equal x
int16(65537L) |> equal x
int16(65537u) |> equal x
int16(1us) |> equal x
int16(65537ul) |> equal x
int16(65537uL) |> equal x
int16(1.f) |> equal x
int16(1.) |> equal x
int16(1.4) |> equal x
int16(1.5) |> equal x
int16(1.6) |> equal x
int16(1.m) |> equal x
int16("1") |> equal x
(fun () -> int16("1.4")) |> throwsError ""
(fun () -> int16("foo")) |> throwsError ""
Convert.ToInt16(1y) |> equal x
Convert.ToInt16(1uy) |> equal x
Convert.ToInt16(1s) |> equal x
Convert.ToInt16(1) |> equal x
Convert.ToInt16(1L) |> equal x
Convert.ToInt16(1u) |> equal x
Convert.ToInt16(1us) |> equal x
Convert.ToInt16(1ul) |> equal x
Convert.ToInt16(1uL) |> equal x
Convert.ToInt16(1.f) |> equal x
Convert.ToInt16(1.) |> equal x
Convert.ToInt16(1.m) |> equal x
Convert.ToInt16(1.4) |> equal x
Convert.ToInt16(1.5) |> equal (x+x)
Convert.ToInt16(1.6) |> equal (x+x)
Convert.ToInt16(2.5) |> equal (x+x)
Convert.ToInt16(2.6) |> equal (x+x+x)
Convert.ToInt16(3.5) |> equal (x+x+x+x)
Convert.ToInt16("1") |> equal x
Convert.ToInt16('a') |> equal 97s
(fun () -> Convert.ToInt16("1.4")) |> throwsError ""
(fun () -> Convert.ToInt16("foo")) |> throwsError ""
testCase "System.Convert.ToInt32 works" <| fun () ->
let x = 1
int(1y) |> equal x
int(1uy) |> equal x
int(1s) |> equal x
int(1) |> equal x
int(1L) |> equal x
int(1u) |> equal x
int(1us) |> equal x
int(1ul) |> equal x
int(1uL) |> equal x
int(1.f) |> equal x
int(1.) |> equal x
int(1.4) |> equal x
int(1.5) |> equal x
int(1.6) |> equal x
int(1.m) |> equal x
int("1") |> equal x
(fun () -> int("1.4")) |> throwsError ""
(fun () -> int("foo")) |> throwsError ""
Convert.ToInt32(1y) |> equal x
Convert.ToInt32(1uy) |> equal x
Convert.ToInt32(1s) |> equal x
Convert.ToInt32(1) |> equal x
Convert.ToInt32(1L) |> equal x
Convert.ToInt32(1u) |> equal x
Convert.ToInt32(1us) |> equal x
Convert.ToInt32(1ul) |> equal x
Convert.ToInt32(1uL) |> equal x
Convert.ToInt32(1.f) |> equal x
Convert.ToInt32(1.) |> equal x
Convert.ToInt32(1.m) |> equal x
Convert.ToInt32(1.4) |> equal x
Convert.ToInt32(1.5) |> equal (x+x)
Convert.ToInt32(1.6) |> equal (x+x)
Convert.ToInt32(2.5) |> equal (x+x)
Convert.ToInt32(2.6) |> equal (x+x+x)
Convert.ToInt32(3.5) |> equal (x+x+x+x)
Convert.ToInt32("1") |> equal x
Convert.ToInt32('a') |> equal 97
(fun () -> Convert.ToInt32("1.4")) |> throwsError ""
(fun () -> Convert.ToInt32("foo")) |> throwsError ""
testCase "Special cases conversion to/from Int64 work" <| fun () ->
let xn = -1L
let xnu = 0xFFFFFFFFFFFFFFFFuL
-1 |> uint64 |> equal xnu
0xFFFFFFFFu |> int64 |> equal 0xFFFFFFFFL
xn |> uint64 |> equal xnu
xnu |> int64 |> equal -1L
xn |> int32 |> equal -1
xn |> uint32 |> equal 0xFFFFFFFFu
xnu |> int32 |> equal -1
xnu |> uint32 |> equal 0xFFFFFFFFu
testCase "Special cases conversion to UInt64 work" <| fun () -> // See #1880
uint64 "0x9fffffffffffffff" |> equal 11529215046068469759UL
uint64 "0xafffffffffffffff" |> equal 12682136550675316735UL
uint64 "0xAFFFFFFFFFFFFFFF" |> equal 12682136550675316735UL
uint64 "0x9fffffff_ffffffff" |> equal 11529215046068469759UL
uint64 "0x9fff_ffff_ffff_ffff" |> equal 11529215046068469759UL
testCase "System.Convert.ToInt64 works" <| fun () ->
let x = 1L
int64(1y) |> equal x
int64(1uy) |> equal x
int64(1s) |> equal x
int64(1) |> equal x
int64(1L) |> equal x
int64(1u) |> equal x
int64(1us) |> equal x
int64(1ul) |> equal x
int64(1uL) |> equal x
int64(1.f) |> equal x
int64(1.) |> equal x
int64(1.4) |> equal x
int64(1.5) |> equal x
int64(1.6) |> equal x
int64(1.m) |> equal x
int64("1") |> equal x
(fun () -> int64("1.4")) |> throwsError ""
(fun () -> int64("foo")) |> throwsError ""
Convert.ToInt64(1y) |> equal x
Convert.ToInt64(1uy) |> equal x
Convert.ToInt64(1s) |> equal x
Convert.ToInt64(1) |> equal x
Convert.ToInt64(1L) |> equal x
Convert.ToInt64(1u) |> equal x
Convert.ToInt64(1us) |> equal x
Convert.ToInt64(1ul) |> equal x
Convert.ToInt64(1uL) |> equal x
Convert.ToInt64(1.f) |> equal x
Convert.ToInt64(1.) |> equal x
Convert.ToInt64(1.m) |> equal x
Convert.ToInt64(1.4) |> equal x
Convert.ToInt64(1.5) |> equal (x+x)
Convert.ToInt64(1.6) |> equal (x+x)
Convert.ToInt64(2.5) |> equal (x+x)
Convert.ToInt64(2.6) |> equal (x+x+x)
Convert.ToInt64(3.5) |> equal (x+x+x+x)
Convert.ToInt64("1") |> equal x
Convert.ToInt64('a') |> equal 97L
(fun () -> Convert.ToInt64("1.4")) |> throwsError ""
(fun () -> Convert.ToInt64("foo")) |> throwsError ""
testCase "System.Convert.ToByte works" <| fun () ->
let x = 1uy
byte(1y) |> equal x
byte(1uy) |> equal x
byte(257s) |> equal x
byte(257) |> equal x
byte(257L) |> equal x
byte(257u) |> equal x
byte(257us) |> equal x
byte(257ul) |> equal x
byte(257uL) |> equal x
byte(1.f) |> equal x
byte(1.) |> equal x
byte(1.4) |> equal x
byte(1.5) |> equal x
byte(1.6) |> equal x
byte(1.m) |> equal x
byte("1") |> equal x
(fun () -> byte("1.4")) |> throwsError ""
(fun () -> byte("foo")) |> throwsError ""
Convert.ToByte(1y) |> equal x
Convert.ToByte(1uy) |> equal x
Convert.ToByte(1s) |> equal x
Convert.ToByte(1) |> equal x
Convert.ToByte(1L) |> equal x
Convert.ToByte(1u) |> equal x
Convert.ToByte(1us) |> equal x
Convert.ToByte(1ul) |> equal x
Convert.ToByte(1uL) |> equal x
Convert.ToByte(1.f) |> equal x
Convert.ToByte(1.) |> equal x
Convert.ToByte(1.m) |> equal x
Convert.ToByte(1.4) |> equal x
Convert.ToByte(1.5) |> equal (x+x)
Convert.ToByte(1.6) |> equal (x+x)
Convert.ToByte(2.5) |> equal (x+x)
Convert.ToByte(2.6) |> equal (x+x+x)
Convert.ToByte(3.5) |> equal (x+x+x+x)
Convert.ToByte("1") |> equal x
Convert.ToByte('a') |> equal 97uy
(fun () -> Convert.ToByte("1.4")) |> throwsError ""
(fun () -> Convert.ToByte("foo")) |> throwsError ""
testCase "System.Convert.ToUInt16 works" <| fun () ->
let x = 1us
uint16(1y) |> equal x
uint16(1uy) |> equal x
uint16(1s) |> equal x
uint16(65537) |> equal x
uint16(65537L) |> equal x
uint16(65537u) |> equal x
uint16(1us) |> equal x
uint16(65537ul) |> equal x
uint16(65537uL) |> equal x
uint16(1.f) |> equal x
uint16(1.) |> equal x
uint16(1.4) |> equal x
uint16(1.5) |> equal x
uint16(1.6) |> equal x
uint16(1.m) |> equal x
uint16("1") |> equal x
(fun () -> uint16("1.4")) |> throwsError ""
(fun () -> uint16("foo")) |> throwsError ""
Convert.ToUInt16(1y) |> equal x
Convert.ToUInt16(1uy) |> equal x
Convert.ToUInt16(1s) |> equal x
Convert.ToUInt16(1) |> equal x
Convert.ToUInt16(1L) |> equal x
Convert.ToUInt16(1u) |> equal x
Convert.ToUInt16(1us) |> equal x
Convert.ToUInt16(1ul) |> equal x
Convert.ToUInt16(1uL) |> equal x
Convert.ToUInt16(1.f) |> equal x
Convert.ToUInt16(1.) |> equal x
Convert.ToUInt16(1.m) |> equal x
Convert.ToUInt16(1.4) |> equal x
Convert.ToUInt16(1.5) |> equal (x+x)
Convert.ToUInt16(1.6) |> equal (x+x)
Convert.ToUInt16(2.5) |> equal (x+x)
Convert.ToUInt16(2.6) |> equal (x+x+x)
Convert.ToUInt16(3.5) |> equal (x+x+x+x)
Convert.ToUInt16("1") |> equal x
Convert.ToUInt16('a') |> equal 97us
(fun () -> Convert.ToUInt16("1.4")) |> throwsError ""
(fun () -> Convert.ToUInt16("foo")) |> throwsError ""
testCase "System.Convert.ToUInt32 works" <| fun () ->
let x = 1u
uint32(1y) |> equal x
uint32(1uy) |> equal x
uint32(1s) |> equal x
uint32(1) |> equal x
uint32(1L) |> equal x
uint32(1u) |> equal x
uint32(1us) |> equal x
uint32(1ul) |> equal x
uint32(1uL) |> equal x
uint32(1.f) |> equal x
uint32(1.) |> equal x
uint32(1.4) |> equal x
uint32(1.5) |> equal x
uint32(1.6) |> equal x
uint32(1.m) |> equal x
uint32("1") |> equal x
(fun () -> uint32("1.4")) |> throwsError ""
(fun () -> uint32("foo")) |> throwsError ""
Convert.ToUInt32(1y) |> equal x
Convert.ToUInt32(1uy) |> equal x
Convert.ToUInt32(1s) |> equal x
Convert.ToUInt32(1) |> equal x
Convert.ToUInt32(1L) |> equal x
Convert.ToUInt32(1u) |> equal x
Convert.ToUInt32(1us) |> equal x
Convert.ToUInt32(1ul) |> equal x
Convert.ToUInt32(1uL) |> equal x
Convert.ToUInt32(1.f) |> equal x
Convert.ToUInt32(1.) |> equal x
Convert.ToUInt32(1.m) |> equal x
Convert.ToUInt32(1.4) |> equal x
Convert.ToUInt32(1.5) |> equal (x+x)
Convert.ToUInt32(1.6) |> equal (x+x)
Convert.ToUInt32(2.5) |> equal (x+x)
Convert.ToUInt32(2.6) |> equal (x+x+x)
Convert.ToUInt32(3.5) |> equal (x+x+x+x)
Convert.ToUInt32("1") |> equal x
Convert.ToUInt32('a') |> equal 97u
(fun () -> Convert.ToUInt32("1.4")) |> throwsError ""
(fun () -> Convert.ToUInt32("foo")) |> throwsError ""
testCase "System.Convert.ToUInt64 works" <| fun () ->
let x = 1uL
uint64(1y) |> equal x
uint64(1uy) |> equal x
uint64(1s) |> equal x
uint64(1) |> equal x
uint64(1L) |> equal x
uint64(1u) |> equal x
uint64(1us) |> equal x
uint64(1ul) |> equal x
uint64(1uL) |> equal x
uint64(1.f) |> equal x
uint64(1.) |> equal x
uint64(1.4) |> equal x
uint64(1.5) |> equal x
uint64(1.6) |> equal x
uint64(1.m) |> equal x
uint64("1") |> equal x
(fun () -> uint64("1.4")) |> throwsError ""
(fun () -> uint64("foo")) |> throwsError ""
Convert.ToUInt64(1y) |> equal x
Convert.ToUInt64(1uy) |> equal x
Convert.ToUInt64(1s) |> equal x
Convert.ToUInt64(1) |> equal x
Convert.ToUInt64(1L) |> equal x
Convert.ToUInt64(1u) |> equal x
Convert.ToUInt64(1us) |> equal x
Convert.ToUInt64(1ul) |> equal x
Convert.ToUInt64(1uL) |> equal x
Convert.ToUInt64(1.f) |> equal x
Convert.ToUInt64(1.) |> equal x
Convert.ToUInt64(1.m) |> equal x
Convert.ToUInt64(1.4) |> equal x
Convert.ToUInt64(1.5) |> equal (x+x)
Convert.ToUInt64(1.6) |> equal (x+x)
Convert.ToUInt64(2.5) |> equal (x+x)
Convert.ToUInt64(2.6) |> equal (x+x+x)
Convert.ToUInt64(3.5) |> equal (x+x+x+x)
Convert.ToUInt64("1") |> equal x
Convert.ToUInt64('a') |> equal 97UL
(fun () -> Convert.ToUInt64("1.4")) |> throwsError ""
(fun () -> Convert.ToUInt64("foo")) |> throwsError ""
testCase "Convert between (un)signed long" <| fun () -> // See #1485
int64 System.UInt64.MaxValue |> equal -1L
uint64 -1L |> equal System.UInt64.MaxValue
testCase "int64 can parse signed longs" <| fun () -> // See #1586
let a = int64 "5"
let b = int64 "-5"
let c = int64 "+5"
equal 5L a
equal -5L b
a = b |> equal false
a = c |> equal true
testCase "System.Convert.ToSingle works" <| fun () ->
let x = 1.f
float32(1y) |> equal x
float32(1uy) |> equal x
float32(1s) |> equal x
float32(1) |> equal x
float32(1L) |> equal x
float32(1u) |> equal x
float32(1us) |> equal x
float32(1ul) |> equal x
float32(1uL) |> equal x
float32(1.f) |> equal x
float32(1.) |> equal x
float32(1.m) |> equal x
float32("1.") |> equal x
(fun () -> float32("foo")) |> throwsError ""
Convert.ToSingle(1y) |> equal x
Convert.ToSingle(1uy) |> equal x
Convert.ToSingle(1s) |> equal x
Convert.ToSingle(1) |> equal x
Convert.ToSingle(1L) |> equal x
Convert.ToSingle(1u) |> equal x
Convert.ToSingle(1us) |> equal x
Convert.ToSingle(1ul) |> equal x
Convert.ToSingle(1uL) |> equal x
Convert.ToSingle(1.f) |> equal x
Convert.ToSingle(1.) |> equal x
Convert.ToSingle(1.m) |> equal x
parse Convert.ToSingle "1." |> equal x
(fun () -> Convert.ToSingle("foo")) |> throwsError ""
testCase "System.Convert.ToDouble works" <| fun () ->
let x = 1.
float(1y) |> equal x
float(1uy) |> equal x
float(1s) |> equal x
float(1) |> equal x
float(1L) |> equal x
float(1u) |> equal x
float(1us) |> equal x
float(1ul) |> equal x
float(1uL) |> equal x
float(1.f) |> equal x
float(1.) |> equal x
float(1.m) |> equal x
float("1.") |> equal x
(fun () -> float("foo")) |> throwsError ""
Convert.ToDouble(1y) |> equal x
Convert.ToDouble(1uy) |> equal x
Convert.ToDouble(1s) |> equal x
Convert.ToDouble(1) |> equal x
Convert.ToDouble(1L) |> equal x
Convert.ToDouble(1u) |> equal x
Convert.ToDouble(1us) |> equal x
Convert.ToDouble(1ul) |> equal x
Convert.ToDouble(1uL) |> equal x
Convert.ToDouble(1.f) |> equal x
Convert.ToDouble(1.) |> equal x
Convert.ToDouble(1.m) |> equal x
parse Convert.ToDouble "1." |> equal x
(fun () -> Convert.ToDouble("foo")) |> throwsError ""
testCase "System.Convert.ToDecimal works" <| fun () ->
let x = 1.m
decimal(1y) |> equal x
decimal(1uy) |> equal x
decimal(1s) |> equal x
decimal(1) |> equal x
decimal(1L) |> equal x
decimal(1u) |> equal x
decimal(1us) |> equal x
decimal(1ul) |> equal x
decimal(1.f) |> equal x
decimal(1.) |> equal x
decimal(1.m) |> equal x
decimal("1.") |> equal x
(fun () -> decimal("foo")) |> throwsError ""
Convert.ToDecimal(1y) |> equal x
Convert.ToDecimal(1uy) |> equal x
Convert.ToDecimal(1s) |> equal x
Convert.ToDecimal(1) |> equal x
Convert.ToDecimal(1L) |> equal x
Convert.ToDecimal(1u) |> equal x
Convert.ToDecimal(1us) |> equal x
Convert.ToDecimal(1ul) |> equal x
Convert.ToDecimal(1uL) |> equal x
Convert.ToDecimal(1.f) |> equal x
Convert.ToDecimal(1.) |> equal x
Convert.ToDecimal(1.m) |> equal x
parse Convert.ToDecimal "1." |> equal x
(fun () -> Convert.ToDecimal("foo")) |> throwsError ""
// String to number convertions (with base)
testCase "System.Convert.ToSByte with base works" <| fun () ->
let x = "101"
Convert.ToSByte(x) |> equal 101y
Convert.ToSByte(x, 2) |> equal 5y
Convert.ToSByte(x, 8) |> equal 65y
Convert.ToSByte(x, 10) |> equal 101y
#if FABLE_COMPILER
(fun () -> Convert.ToSByte("255", 2)) |> throwsError ""
#else
(fun () -> Convert.ToSByte("255", 2)) |> throwsError "Could not find any recognizable digits."
#endif
testCase "System.Convert.ToInt16 with base works" <| fun () ->
let x = "101"
Convert.ToInt16(x) |> equal 101s
Convert.ToInt16(x, 2) |> equal 5s
Convert.ToInt16(x, 8) |> equal 65s
Convert.ToInt16(x, 10) |> equal 101s
Convert.ToInt16(x, 16) |> equal 257s
#if FABLE_COMPILER
(fun () -> Convert.ToInt16("255", 2)) |> throwsError ""
#else
(fun () -> Convert.ToInt16("255", 2)) |> throwsError "Could not find any recognizable digits."
#endif
testCase "System.Convert.ToInt32 with base works" <| fun () ->
let x = "101"
Convert.ToInt32(x) |> equal 101
Convert.ToInt32(x, 2) |> equal 5
Convert.ToInt32(x, 8) |> equal 65
Convert.ToInt32(x, 10) |> equal 101
Convert.ToInt32(x, 16) |> equal 257
#if FABLE_COMPILER
(fun () -> Convert.ToInt32("255", 2)) |> throwsError ""
#else
(fun () -> Convert.ToInt32("255", 2)) |> throwsError "Could not find any recognizable digits."
#endif
testCase "System.Convert.ToInt64 with base works" <| fun () ->
let x = "101"
Convert.ToInt64(x) |> equal 101L
Convert.ToInt64(x, 2) |> equal 5L
Convert.ToInt64(x, 8) |> equal 65L
Convert.ToInt64(x, 10) |> equal 101L
Convert.ToInt64(x, 16) |> equal 257L
#if FABLE_COMPILER
(fun () -> Convert.ToInt64("255", 2)) |> throwsError ""
#else
(fun () -> Convert.ToInt64("255", 2)) |> throwsError "Could not find any recognizable digits."
#endif
testCase "System.Convert.ToByte with base works" <| fun () ->
let x = "101"
Convert.ToByte(x) |> equal 101uy
Convert.ToByte(x, 2) |> equal 5uy
Convert.ToByte(x, 8) |> equal 65uy
Convert.ToByte(x, 10) |> equal 101uy
#if FABLE_COMPILER
(fun () -> Convert.ToByte("255", 2)) |> throwsError ""
#else
(fun () -> Convert.ToByte("255", 2)) |> throwsError "Could not find any recognizable digits."
#endif
testCase "System.Convert.ToUInt16 with base works" <| fun () ->
let x = "101"
Convert.ToUInt16(x) |> equal 101us
Convert.ToUInt16(x, 2) |> equal 5us
Convert.ToUInt16(x, 8) |> equal 65us
Convert.ToUInt16(x, 10) |> equal 101us
Convert.ToUInt16(x, 16) |> equal 257us
#if FABLE_COMPILER
(fun () -> Convert.ToUInt16("255", 2)) |> throwsError ""
#else
(fun () -> Convert.ToUInt16("255", 2)) |> throwsError "Could not find any recognizable digits."
#endif
testCase "System.Convert.ToUInt32 with base works" <| fun () ->
let x = "101"
Convert.ToUInt32(x) |> equal 101u
Convert.ToUInt32(x, 2) |> equal 5u
Convert.ToUInt32(x, 8) |> equal 65u
Convert.ToUInt32(x, 10) |> equal 101u
Convert.ToUInt32(x, 16) |> equal 257u
#if FABLE_COMPILER
(fun () -> Convert.ToUInt32("255", 2)) |> throwsError ""
#else
(fun () -> Convert.ToUInt32("255", 2)) |> throwsError "Could not find any recognizable digits."
#endif
testCase "System.Convert.ToUInt64 with base works" <| fun () ->
let x = "101"
Convert.ToUInt64(x) |> equal 101uL
Convert.ToUInt64(x, 2) |> equal 5uL
Convert.ToUInt64(x, 8) |> equal 65uL
Convert.ToUInt64(x, 10) |> equal 101uL
Convert.ToUInt64(x, 16) |> equal 257uL
#if FABLE_COMPILER
(fun () -> Convert.ToUInt64("255", 2)) |> throwsError ""
#else
(fun () -> Convert.ToUInt64("255", 2)) |> throwsError "Could not find any recognizable digits."
#endif
// Number to string convertions (with base)
testCase "System.Convert.ToString with base works" <| fun () ->
Convert.ToString(Byte.MaxValue,2) |> equal "11111111"
Convert.ToString(Int16.MaxValue,2) |> equal "111111111111111"
Convert.ToString(Int32.MaxValue,2) |> equal "1111111111111111111111111111111"
Convert.ToString(Int64.MaxValue,2) |> equal "111111111111111111111111111111111111111111111111111111111111111"
testCase "System.Convert.ToString SByte works" <| fun () ->
let x = "101"
Convert.ToString(101y) |> equal x
testCase "System.Convert.ToString Int16 works" <| fun () ->
let x = "101"
Convert.ToString(101s) |> equal x
Convert.ToString(5s, 2) |> equal x
Convert.ToString(65s, 8) |> equal x
Convert.ToString(101s, 10) |> equal x
Convert.ToString(257s, 16) |> equal x
Convert.ToString(-5s, 16) |> equal "fffb"
testCase "System.Convert.ToString Int32 works" <| fun () ->
let x = "101"
Convert.ToString(101) |> equal x
Convert.ToString(5, 2) |> equal x
Convert.ToString(65, 8) |> equal x
Convert.ToString(101, 10) |> equal x
Convert.ToString(257, 16) |> equal x
Convert.ToString(-5, 16) |> equal "fffffffb"
testCase "System.Convert.ToString Int64 works" <| fun () ->
let x = "101"
Convert.ToString(101L) |> equal x
Convert.ToString(5L, 2) |> equal x
Convert.ToString(65L, 8) |> equal x
Convert.ToString(101L, 10) |> equal x
Convert.ToString(257L, 16) |> equal x
// TODO long.js lib always use negative sign to convert negative longs to strings
// Convert.ToString(-5L, 16) |> equal "fffffffffffffffb"
testCase "System.Convert.ToString Byte works" <| fun () ->
let x = "101"
Convert.ToString(101uy) |> equal x
Convert.ToString(5uy, 2) |> equal x
Convert.ToString(65uy, 8) |> equal x
Convert.ToString(101uy, 10) |> equal x
testCase "System.Convert.ToString UInt16 works" <| fun () ->
let x = "101"
Convert.ToString(101us) |> equal x
testCase "System.Convert.ToString UInt32 works" <| fun () ->
let x = "101"
Convert.ToString(101u) |> equal x
testCase "System.Convert.ToString UInt64 works" <| fun () ->
let x = "101"
Convert.ToString(101uL) |> equal x
testCase "System.Convert.ToString Single works" <| fun () ->
let x = "101"
Convert.ToString(101.f) |> equal x
testCase "System.Convert.ToString Double works" <| fun () ->
let x = "101"
Convert.ToString(101.) |> equal x
testCase "System.Convert.ToString Decimal works" <| fun () ->
let x = "101"
Convert.ToString(101.m) |> equal x
testCase "FSharp.Core type converters can combined via the >> operator" <| fun () ->
"1" |> (sbyte >> Ok) |> equal (Ok 1y)
"1" |> (int16 >> Ok) |> equal (Ok 1s)
"1" |> (int >> Ok) |> equal (Ok 1)
"1" |> (int64 >> Ok) |> equal (Ok 1L)
"1" |> (byte >> Ok) |> equal (Ok 1uy)
"1" |> (uint16 >> Ok) |> equal (Ok 1us)
"1" |> (uint32 >> Ok) |> equal (Ok 1u)
"1" |> (uint64 >> Ok) |> equal (Ok 1uL)
"1" |> (float32 >> Ok) |> equal (Ok 1.f)
"1" |> (float >> Ok) |> equal (Ok 1.)
"1" |> (double >> Ok) |> equal (Ok 1.)
"1" |> (decimal >> Ok) |> equal (Ok 1.m)
//-------------------------------------
// System.BitConverter
//-------------------------------------
testCase "BitConverter.IsLittleEndian works" <| fun () ->
BitConverter.IsLittleEndian |> equal true
testCase "BitConverter.GetBytes Boolean works" <| fun () ->
let value = true
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 1uy |]
testCase "BitConverter.GetBytes Char works" <| fun () ->
let value = 'A'
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 65uy; 0uy |]
testCase "BitConverter.GetBytes Int16 works" <| fun () ->
let value = 0x0102s
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 2uy; 1uy |]
testCase "BitConverter.GetBytes Int32 works" <| fun () ->
let value = 0x01020304
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 4uy; 3uy; 2uy; 1uy |]
testCase "BitConverter.GetBytes Int64 works" <| fun () ->
let value = 0x0102030405060708L
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 8uy; 7uy; 6uy; 5uy; 4uy; 3uy; 2uy; 1uy |]
testCase "BitConverter.GetBytes UInt16 works" <| fun () ->
let value = 0xFF02us
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 2uy; 255uy |]
testCase "BitConverter.GetBytes UInt32 works" <| fun () ->
let value = 0xFF020304u
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 4uy; 3uy; 2uy; 255uy |]
testCase "BitConverter.GetBytes UInt64 works" <| fun () ->
let value = 0xFF02030405060708UL
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 8uy; 7uy; 6uy; 5uy; 4uy; 3uy; 2uy; 255uy |]
testCase "BitConverter.GetBytes Single works" <| fun () ->
let value = 1.0f
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 0uy; 0uy; 128uy; 63uy |]
testCase "BitConverter.GetBytes Double works" <| fun () ->
let value = 1.0
let bytes = BitConverter.GetBytes(value)
bytes |> equal [| 0uy; 0uy; 0uy; 0uy; 0uy; 0uy; 240uy; 63uy |]
testCase "BitConverter.Int64BitsToDouble works" <| fun () ->
let f = BitConverter.Int64BitsToDouble(1L)
f |> equal 4.9406564584124654E-324
testCase "BitConverter.DoubleToInt64Bits works" <| fun () ->
let i = BitConverter.DoubleToInt64Bits(1.0)
i |> equal 4607182418800017408L
testCase "BitConverter.ToBoolean works" <| fun () ->
let value = true
let bytes = BitConverter.GetBytes(value)
BitConverter.ToBoolean(bytes, 0) |> equal value
testCase "BitConverter.ToChar works" <| fun () ->
let value = 'A'
let bytes = BitConverter.GetBytes(value)
BitConverter.ToChar(bytes, 0) |> equal value
testCase "BitConverter.ToInt16 works" <| fun () ->
let value = 0x0102s
let bytes = BitConverter.GetBytes(value)
BitConverter.ToInt16(bytes, 0) |> equal value
testCase "BitConverter.ToInt32 works" <| fun () ->
let value = 0x01020304
let bytes = BitConverter.GetBytes(value)
BitConverter.ToInt32(bytes, 0) |> equal value
testCase "BitConverter.ToInt64 works" <| fun () ->
let value = 0x0102030405060708L
let bytes = BitConverter.GetBytes(value)
BitConverter.ToInt64(bytes, 0) |> equal value
testCase "BitConverter.ToUInt16 works" <| fun () ->
let value = 0xFF02us
let bytes = BitConverter.GetBytes(value)
BitConverter.ToUInt16(bytes, 0) |> equal value
testCase "BitConverter.ToUInt32 works" <| fun () ->
let value = 0xFF020304u
let bytes = BitConverter.GetBytes(value)
BitConverter.ToUInt32(bytes, 0) |> equal value
testCase "BitConverter.ToUInt64 works" <| fun () ->
let value = 0xFF02030405060708UL
let bytes = BitConverter.GetBytes(value)
BitConverter.ToUInt64(bytes, 0) |> equal value
testCase "BitConverter.ToSingle works" <| fun () ->
let value = 1.0f
let bytes = BitConverter.GetBytes(value)
BitConverter.ToSingle(bytes, 0) |> equal value
testCase "BitConverter.ToDouble works" <| fun () ->
let value = 1.0
let bytes = BitConverter.GetBytes(value)
BitConverter.ToDouble(bytes, 0) |> equal value
testCase "BitConverter.ToString works" <| fun () ->
let value = 0x01020304
let bytes = BitConverter.GetBytes(value)
BitConverter.ToString(bytes) |> equal "04-03-02-01"
testCase "BitConverter.ToString 2 works" <| fun () ->
let value = 0x01020304
let bytes = BitConverter.GetBytes(value)
BitConverter.ToString(bytes, 1) |> equal "03-02-01"
testCase "BitConverter.ToString 3 works" <| fun () ->
let value = 0x01020304
let bytes = BitConverter.GetBytes(value)
BitConverter.ToString(bytes, 1, 2) |> equal "03-02"
//-------------------------------------
// System.Numerics.BigInteger
//-------------------------------------
testCase "BigInt from uint32 works" <| fun () ->
bigint System.UInt32.MaxValue |> equal 4294967295I
testCase "BigInt ToSByte works" <| fun () ->
let value = 0x02y
sbyte (bigint (int32 value)) |> equal value
testCase "BigInt ToInt16 works" <| fun () ->
let value = 0x0102s
int16 (bigint (int32 value)) |> equal value
testCase "BigInt ToInt32 works" <| fun () ->
let value = 0x01020304
int32 (bigint value) |> equal value
testCase "BigInt ToInt64 works" <| fun () ->
let value = 0x0102030405060708L
int64 (bigint value) |> equal value
testCase "BigInt ToByte works" <| fun () ->
let value = 0x02uy
byte (bigint (uint32 value)) |> equal value
testCase "BigInt ToUInt16 works" <| fun () ->
let value = 0xFF02us
uint16 (bigint (uint32 value)) |> equal value
testCase "BigInt ToUInt32 works" <| fun () ->
//let value = 0xFF020304u //TODO: BigInt.FromUInt32 not implemented yet, so this will fail
let value = 0x1F020304u
uint32 (bigint value) |> equal value
testCase "BigInt ToUInt64 works" <| fun () ->
let value = 0xFF02030405060708UL
uint64 (bigint value) |> equal value
testCase "BigInt ToSingle works" <| fun () ->
let value = 1.0f
single (bigint value) |> equal value
testCase "BigInt ToDouble works" <| fun () ->
let value = -1.0
double (bigint value) |> equal value
testCase "BigInt ToDecimal works" <| fun () ->
let value = 1.0m
decimal (bigint value) |> equal value
testCase "BigInt ToDecimal with Decimal.MinValue works" <| fun () ->
let value = Decimal.MinValue
decimal (bigint value) |> equal value
testCase "BigInt ToDecimal with Decimal.MaxValue works" <| fun () ->
let value = Decimal.MaxValue
decimal (bigint value) |> equal value
testCase "BigInt ToString works" <| fun () ->
let value = 1234567890
string (bigint value) |> equal "1234567890"
testCase "Convert.ToBase64String works" <| fun () ->
let bytes = [| 2uy; 4uy; 6uy; 8uy; 10uy; 12uy; 14uy; 16uy; 18uy; 20uy |]
Convert.ToBase64String(bytes)
|> equal "AgQGCAoMDhASFA=="
testCase "Convert.FromBase64String works" <| fun () ->
Convert.FromBase64String("AgQGCAoMDhASFA==")
|> equal [| 2uy; 4uy; 6uy; 8uy; 10uy; 12uy; 14uy; 16uy; 18uy; 20uy |]
// id is prefixed for guid creation as we check at compile time (if able) to create a string const
testCase "Guid.Parse works" <| fun () ->
let guids = [
Guid.Parse("96258006-c4ba-4a7f-80c4-de7f2b2898c5")
Guid.Parse(id "96258006-c4ba-4a7f-80c4-de7f2b2898c5")
Guid.Parse("96258006c4ba4a7f80c4de7f2b2898c5")
Guid.Parse(id "96258006c4ba4a7f80c4de7f2b2898c5")
Guid.Parse("{96258006-c4ba-4a7f-80c4-de7f2b2898c5}")
Guid.Parse(id "{96258006-c4ba-4a7f-80c4-de7f2b2898c5}")
Guid.Parse("(96258006-c4ba-4a7f-80c4-de7f2b2898c5)")
Guid.Parse(id "(96258006-c4ba-4a7f-80c4-de7f2b2898c5)")
Guid.Parse("{0x96258006,0xc4ba,0x4a7f,{0x80,0xc4,0xde,0x7f,0x2b,0x28,0x98,0xc5}}")
Guid.Parse(id "{0x96258006,0xc4ba,0x4a7f,{0x80,0xc4,0xde,0x7f,0x2b,0x28,0x98,0xc5}}")
Guid("96258006-c4ba-4a7f-80c4-de7f2b2898c5")
Guid(id "96258006-c4ba-4a7f-80c4-de7f2b2898c5")
Guid("96258006c4ba4a7f80c4de7f2b2898c5")
Guid(id "96258006c4ba4a7f80c4de7f2b2898c5")
Guid("{96258006-c4ba-4a7f-80c4-de7f2b2898c5}")
Guid(id "{96258006-c4ba-4a7f-80c4-de7f2b2898c5}")
Guid("(96258006-c4ba-4a7f-80c4-de7f2b2898c5)")
Guid(id "(96258006-c4ba-4a7f-80c4-de7f2b2898c5)")
Guid("{0x96258006,0xc4ba,0x4a7f,{0x80,0xc4,0xde,0x7f,0x2b,0x28,0x98,0xc5}}")
Guid(id "{0x96258006,0xc4ba,0x4a7f,{0x80,0xc4,0xde,0x7f,0x2b,0x28,0x98,0xc5}}")
]
guids
|> List.iter (fun g -> g.ToString() |> equal "96258006-c4ba-4a7f-80c4-de7f2b2898c5")
// testCase "Guid.Parse fails if string is not well formed" <| fun () ->
// let success =
// try
// let g1 = Guid.Parse(id "foo")
// true
// with _ -> false
// equal false success
testCase "Guid.TryParse works" <| fun () ->
let successGuids = [
Guid.TryParse("96258006-c4ba-4a7f-80c4-de7f2b2898c5")
Guid.TryParse(id "96258006-c4ba-4a7f-80c4-de7f2b2898c5")
Guid.TryParse("96258006c4ba4a7f80c4de7f2b2898c5")
Guid.TryParse(id "96258006c4ba4a7f80c4de7f2b2898c5")
Guid.TryParse("{96258006-c4ba-4a7f-80c4-de7f2b2898c5}")
Guid.TryParse(id "{96258006-c4ba-4a7f-80c4-de7f2b2898c5}")
Guid.TryParse("(96258006-c4ba-4a7f-80c4-de7f2b2898c5)")
Guid.TryParse(id "(96258006-c4ba-4a7f-80c4-de7f2b2898c5)")
Guid.TryParse("{0x96258006,0xc4ba,0x4a7f,{0x80,0xc4,0xde,0x7f,0x2b,0x28,0x98,0xc5}}")
Guid.TryParse(id "{0x96258006,0xc4ba,0x4a7f,{0x80,0xc4,0xde,0x7f,0x2b,0x28,0x98,0xc5}}")
]
let failGuids = [
Guid.TryParse("96258006-c4ba-4a7f-80c4")
Guid.TryParse(id "96258006-c4ba-4a7f-80c4")
Guid.TryParse("96258007f80c4de7f2b2898c5")
Guid.TryParse(id "96258007f80c4de7f2b2898c5")
Guid.TryParse("{96258006-c4ba-4a7f-80c4}")
Guid.TryParse(id "{96258006-c4ba-4a7f-80c4}")
Guid.TryParse("(96258006-c4ba-80c4-de7f2b2898c5)")
Guid.TryParse(id "(96258006-c4ba-80c4-de7f2b2898c5)")
Guid.TryParse("{0x96258006,0xc4ba,{0x80,0xc4,0xde,0x7f,0x28,0x98,0xc5}}")
Guid.TryParse(id "{0x96258006,0xc4ba,{0x80,0xc4,0xde,0x7f,0x28,0x98,0xc5}}")
]
successGuids
|> List.iter (fst >> (equal true))
failGuids
|> List.iter (fst >> (equal false))
testCase "Parsed guids with different case are considered the same" <| fun () -> // See #1718
let aGuid = Guid.NewGuid()
let lower = aGuid.ToString().ToLower()
let upper = aGuid.ToString().ToUpper()
lower = upper |> equal false
let lowerGuid = Guid.Parse lower
let upperGuid = Guid.Parse upper
lowerGuid = upperGuid |> equal true
testCase "Convert Guid to byte array works" <| fun () ->
let g = Guid.Parse("96258006-c4ba-4a7f-80c4-de7f2b2898c5")
let g2 = Guid.Parse(id "96258006-c4ba-4a7f-80c4-de7f2b2898c5")
g.ToByteArray() |> equal [|6uy; 128uy; 37uy; 150uy; 186uy; 196uy; 127uy; 74uy; 128uy; 196uy; 222uy; 127uy; 43uy; 40uy; 152uy; 197uy|]
g2.ToByteArray() |> equal [|6uy; 128uy; 37uy; 150uy; 186uy; 196uy; 127uy; 74uy; 128uy; 196uy; 222uy; 127uy; 43uy; 40uy; 152uy; 197uy|]
testCase "Convert byte array to Guid works" <| fun () ->
let g = Guid [|6uy; 128uy; 37uy; 150uy; 186uy; 196uy; 127uy; 74uy; 128uy; 196uy; 222uy; 127uy; 43uy; 40uy; 152uy; 197uy|]
g.ToString() |> equal "96258006-c4ba-4a7f-80c4-de7f2b2898c5"
testCase "Guid.ToString works with formats" <| fun () ->
let g = Guid.Parse("96258006-c4ba-4a7f-80c4-de7f2b2898c5")
let g2 = Guid.Parse(id "96258006-c4ba-4a7f-80c4-de7f2b2898c5")
let testGuid (g: Guid) =
g.ToString() |> equal "96258006-c4ba-4a7f-80c4-de7f2b2898c5"
g.ToString("N") |> equal "96258006c4ba4a7f80c4de7f2b2898c5"
g.ToString("D") |> equal "96258006-c4ba-4a7f-80c4-de7f2b2898c5"
g.ToString("B") |> equal "{96258006-c4ba-4a7f-80c4-de7f2b2898c5}"
g.ToString("P") |> equal "(96258006-c4ba-4a7f-80c4-de7f2b2898c5)"
g.ToString("X") |> equal "{0x96258006,0xc4ba,0x4a7f,{0x80,0xc4,0xde,0x7f,0x2b,0x28,0x98,0xc5}}"
testGuid g
testGuid g2
//-------------------------------------
// System.Text.Encoding
//-------------------------------------
testCase "Encoding.Unicode.GetBytes works" <| fun () ->
System.Text.Encoding.Unicode.GetBytes("za\u0306\u01FD\u03B2\uD8FF\uDCFF")
|> equal [| 0x7Auy; 0x00uy; 0x61uy; 0x00uy; 0x06uy; 0x03uy; 0xFDuy; 0x01uy; 0xB2uy; 0x03uy; 0xFFuy; 0xD8uy; 0xFFuy; 0xDCuy |]
testCase "Encoding.Unicode.GetBytes for range works" <| fun () ->
System.Text.Encoding.Unicode.GetBytes("za\u0306\u01FD\u03B2\uD8FF\uDCFF".ToCharArray(), 4, 3)
|> equal [| 0xB2uy; 0x03uy; 0xFFuy; 0xD8uy; 0xFFuy; 0xDCuy |]
testCase "Encoding.Unicode.GetString works" <| fun () ->
let bytes = [| 0x7Auy; 0x00uy; 0x61uy; 0x00uy; 0x06uy; 0x03uy; 0xFDuy; 0x01uy; 0xB2uy; 0x03uy; 0xFFuy; 0xD8uy; 0xFFuy; 0xDCuy |]
System.Text.Encoding.Unicode.GetString(bytes)
|> equal "za\u0306\u01FD\u03B2\uD8FF\uDCFF"
testCase "Encoding.Unicode.GetString for range works" <| fun () ->
let bytes = [| 0x7Auy; 0x00uy; 0x61uy; 0x00uy; 0x06uy; 0x03uy; 0xFDuy; 0x01uy; 0xB2uy; 0x03uy; 0xFFuy; 0xD8uy; 0xFFuy; 0xDCuy |]
System.Text.Encoding.Unicode.GetString(bytes, 8, 6)
|> equal "\u03B2\uD8FF\uDCFF"
testCase "Encoding.UTF8.GetBytes works" <| fun () ->
System.Text.Encoding.UTF8.GetBytes("za\u0306\u01FD\u03B2\uD8FF\uDCFF")
|> equal [| 0x7Auy; 0x61uy; 0xCCuy; 0x86uy; 0xC7uy; 0xBDuy; 0xCEuy; 0xB2uy; 0xF1uy; 0x8Fuy; 0xB3uy; 0xBFuy |]
testCase "Encoding.UTF8.GetBytes for range works" <| fun () ->
System.Text.Encoding.UTF8.GetBytes("za\u0306\u01FD\u03B2\uD8FF\uDCFF".ToCharArray(), 4, 3)
|> equal [| 0xCEuy; 0xB2uy; 0xF1uy; 0x8Fuy; 0xB3uy; 0xBFuy |]
testCase "Encoding.UTF8.GetString works" <| fun () ->
let bytes = [| 0x7Auy; 0x61uy; 0xCCuy; 0x86uy; 0xC7uy; 0xBDuy; 0xCEuy; 0xB2uy; 0xF1uy; 0x8Fuy; 0xB3uy; 0xBFuy |]
System.Text.Encoding.UTF8.GetString(bytes)
|> equal "za\u0306\u01FD\u03B2\uD8FF\uDCFF"
testCase "Encoding.UTF8.GetString for range works" <| fun () ->
let bytes = [| 0x7Auy; 0x61uy; 0xCCuy; 0x86uy; 0xC7uy; 0xBDuy; 0xCEuy; 0xB2uy; 0xF1uy; 0x8Fuy; 0xB3uy; 0xBFuy |]
System.Text.Encoding.UTF8.GetString(bytes, 6, 6)
|> equal "\u03B2\uD8FF\uDCFF"
]
``` |
Keçe Ursaq () is a rural locality (a selo) in Qaybıç District, Tatarstan. The population was 111 as of 2010.
Geography
Keçe Ursaq is located 9 km southeast of Olı Qaуbıç, district's administrative centre, and 113 km southwest of Qazаn, republic's capital, by road.
History
The village was established in the 18th century.
From 18th to the first half of the 19th centuries village's residents belonged to the social estate of state peasants.
By the beginning of the twentieth century, village had a mosque, a madrasa, 3 watermills and 3 small shops.
Before the creation of the Tatar ASSR in 1920 was a part of Zöyä Uyezd of Qazan Governorate. Since 1920 was a part of Zöyä Canton; after the creation of districts in Tatar ASSR (Tatarstan) in Qaybıç (Ölcän) in 1927 (1927–1963), Bua (1963–1964), Apas (1964–1991) and Qaybıç districts.
References
External links
Rural localities in Kaybitsky District |
Sir Thomas Hanbury (21 June 18329 March 1907) was an English businessman, gardener and philanthropist. He built the Giardini Botanici Hanbury, or Hanbury botanical gardens, at Mortola, between Ventimiglia and Menton, on the coast of Italy near to the border with France.
Early life
Thomas Hanbury was born on 21 June 1832 at Bedford Road, Clapham, Surrey. He was the fourth child and third son of a pharmaceutical chemist, Daniel Bell Hanbury (1794–1882), and his wife Rachel, née Christy, (c. 1802–1876). His eldest brother was the botanist and pharmacognosist Daniel Hanbury (1825–1875). The Hanburys were Quakers, and members of the family had been members of the Society of Friends since its beginnings in the seventeenth century. His great-aunt was the philanthropist and centenarian Elizabeth Hanbury. Thomas Hanbury was sent to predominantly Quaker schools, first in Croydon, and then in Epping. He remained a Friend all his life.
China
From 1849 Hanbury worked for the tea brokers William James Thompson & Sons in Mincing Lane, London. In 1853 he travelled to Shanghai, which had opened to foreign commerce in 1843. With three partners and with the financial backing of his uncle, he started Hanbury & Co., merchants in silk and tea. The partnership dissolved in 1857, and Hanbury and Frederick Bower entered into a new one, Bower, Hanbury & Co., which diversified into currency trading and cotton broking. Hanbury became extremely wealthy, and was the largest holder of property in Shanghai.
Hanbury arrived in China at a time of widespread civil unrest. In 1854 there were five separate rebellions within the country: the Nien Rebellion, the Red Turban Rebellion (1854–1856), the Miao Rebellion, the Small Knife Society and the vast Taiping Rebellion (1850–64), which has been described as the "most gigantic man-made disaster" of the nineteenth century. The Taiping rebels had taken Shanghai in 1851, but lost it to Qing dynasty forces in January 1853. The Small Knife Society occupied old Shanghai and many surrounding villages from 1854 to February 1855.
The European residents of Shanghai lived in self-governing settlements or concessions outside the city walls, in physical and social isolation from the local population. Hanbury took the unusual step of learning Mandarin Chinese. He travelled within the country, and was soon trusted and respected by local people. When he finally left Shanghai in 1871, his Chinese acquaintances and friends brought him so many parting gifts that he begged them to stop.
Hanbury was a member of the Anglo-American Municipal Council of Shanghai, and helped set up a hospital and plant gardens in the concession. He was a director of the first railway line to be built in China, the short-lived Woosung Railway. The first telegraph message from Shanghai to Hong Kong was sent from his office.
Hanbury financed the Eurasia School in the 1880s and later renamed it the Hanbury Schools for Boys and Girls, which were precursors to Shanghai Shixi High School.
La Mortola
Hanbury visited Europe between 1866 and 1869, and in 1867 travelled on the Côte d'Azur. He saw and purchased the abandoned villa of the Orengo di Roccasterone family at Mortola, where he planned to make a botanical garden with the help of his brother Daniel.
Hanbury married Katharine Aldham Pease (1842–1920) of Westbury-on-Trym, now a suburb of Bristol, in 1868. They travelled to China in 1869, where Hanbury wound up his business, and returned to live at La Mortola in 1871. The Orengo villa was restored, and Daniel had already begun planting the gardens, which eventually extended over 18 of the 45 hectares of the estate, and came to be known as the Giardini Botanici Hanbury. The couple had four children: Cecil, Horace, Daniel and Hilda.
The Giardini Botanici Hanbury
In December 1868 Hanbury employed as head gardener the botanist and garden designer Ludwig Winter, then 22 years old, who remained at La Mortola until 20 June 1875. From 1873 Hanbury also employed a curator of the gardens. The first of these was Gustave Rutschi, from 1873 to 1876. He was followed by Gustav Cronemeyer, compiler of the first published catalogue of 1889, curator from 1883 to 1892. When Cronemeyer died in 1892, Kurt Dinter took over and remained until his departure for German South-West Africa in 1897. From then until the outbreak of the First World War in 1914, Alwin Berger was curator.
The gardens received many visitors. Among these was Queen Victoria, in 1882; others included her son Prince Arthur, Duke of Connaught with his wife Princess Louise Margaret of Prussia; his brother Prince Leopold, Duke of Albany; his sister Princess Beatrice; Princess Eugenie; King Albert of Saxony and Queen Carola; Prince Ernest of Saxe-Coburg; the then Prince of Naples; and Kuo Sung Tao, the first Qing dynasty minister to be accredited in Europe.
Death
Hanbury died at La Mortola on 9 March 1907. He was buried in the gardens under a pavilion in moresco style.
References
19th-century Quakers
1832 births
1907 deaths
British philanthropists
British gardeners
Recipients of the Order of Saints Maurice and Lazarus
Fellows of the Linnean Society of London
English Quakers
19th-century English businesspeople |
Take It Like a Man is an autobiography written by English singer and songwriter Boy George. The book was published in 1995 around the same time as George's solo album Cheapness and Beauty.
References
Autobiographies
LGBT autobiographies
1995 non-fiction books
Sidgwick & Jackson books
LGBT literature in the United Kingdom |
Louise Kathrine Dedichen (born 1964) is a Norwegian vice-admiral who in June 2019 was appointed head of Norway's military mission in Brussels, becoming Norway's representative on the NATO Military Committee. She is the first woman to serve on the committee. From 2008, she headed the Norwegian Defence University College.
Early life and education
Born in 1964 in Fredrikstad in south-eastern Norway, Dedichen completed her school education in Christianslund in 1982. She then attended Norway's Naval College (1983–1987). She later spent a year at the College interarmées de defense in Paris (2002–2003) and studied culture and conflict at the University of Oslo (2005), completing her education at the Norwegian Defence University College in Oslo (2006).
Career
She first served as quartermaster on KNM Stavanger and KNM Trondheim (1987–1989). She then served on the Naval Supply Command before serving as deputy head of Norway's military mission in Brussels (1995–1998). Dedichen then joined the Armed Forces Command as press assistant and project coordinator (1998–2000). From 2003, she took up an appointment at the Defence University College, first as head teacher in economics, then as head of department for logistics, management and method. In 2008, as a rear admiral, she served as head of the Defence College.
Her appointment as head of the Norwegian Defense University College was challenged by another of the candidates, Brigadier Øyvind Kirsebom Strandman, who alleged that Dedichen had been appointed because she was a woman. The case went to the Norwegian Supreme Court who ruled by four to one in 2014 that she had been appointed not because she was a woman but because she was the most qualified applicant.
In June 2019, she was appointed head of Norway's military mission in Brussels, becoming the first woman to serve on the NATO Military Committee.
References
1964 births
Living people
People from Fredrikstad
Royal Norwegian Navy admirals
Norwegian educators
Norwegian women educators
Norwegian female military personnel |
```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 operator
import (
"testing"
)
type ImageSpec struct {
SpecImage string
Image string
Version string
Tag string
SHA string
}
func TestBuildImagePath(t *testing.T) {
defaultImageSpec := &ImageSpec{
Image: "foo.com/bar",
Version: "0.0.1",
}
// imageWithoutVersion := "myrepo/myimage:123"
// imageWithVersion := "myhost:9090/myrepo/myimage:0.2"
// imageWithTag := "myhost:9090/myrepo/myimage:latest"
// imageWithSHA := "foo/bar@sha256:12345"
cases := []struct {
spec *ImageSpec
expected string
}{
{
spec: &ImageSpec{},
expected: "",
},
{
spec: defaultImageSpec,
expected: defaultImageSpec.Image + ":" + defaultImageSpec.Version,
},
{
spec: &ImageSpec{"", "myrepo.com/foo", "1.0", "", ""},
expected: "myrepo.com/foo:1.0",
},
{
spec: &ImageSpec{"", "myrepo.com/foo", "1.0", "latest", ""},
expected: "myrepo.com/foo:latest",
},
{
spec: &ImageSpec{"", "myrepo.com/foo", "1.0", "latest", "abcd1234"},
expected: "myrepo.com/foo@sha256:abcd1234",
},
{
spec: &ImageSpec{"myspecrepo.com/myimage", "myrepo.com/foo", "1.0", "latest", "abcd1234"},
expected: "myspecrepo.com/myimage",
},
}
for i, c := range cases {
result, _ := BuildImagePath(c.spec.SpecImage, c.spec.Image, c.spec.Version, c.spec.Tag, c.spec.SHA)
if c.expected != result {
t.Errorf("expected test case %d to be %q but got %q", i, c.expected, result)
}
}
}
``` |
The 1916 Kerry Senior Football Championship was the 23rd staging of the Kerry Senior Football Championship since its establishment by the Kerry County Board in 1889. The championship began in October 1916 but was suspended without a conclusion on 27 January 1917.
Dr Crokes entered the championship as the defending champions
Suspension
The championship was curtailed when the Great Southern and Western Railway cancelled all train arrangements for matches due to be played on 19 November 1916. A number of matches had already been played, including a drawn encounter between Laune Rangers and Killarney Crokes. A County Board meeting decided to postpone some games, however, a subsequent meeting on 27 January 1917 carried a motion "that, in consequence of the suspension of Sunday railway facilities, we hereby discontinue the 1916 Co. Hurling and Football Championships".
References
Kerry Senior Football Championship
1916 in Gaelic football |
Kenneth Iverson may refer to:
Kenneth E. Iverson (1920–2004), developer of the APL programming language
F. Kenneth Iverson (1925–2002), former CEO of Nucor |
Frank Stallworth Lockhart (March 5, 1903 or March 8, 1903 – April 25, 1928) was an American racecar driver active in the 1920s, considered by many historians to be a legend in the sport on par with Jim Clark, 1960s British World Drivers' Champion. During a "remarkable if all too short" career, Lockhart won numerous races on both dirt and board tracks, and the 1926 Indianapolis 500. In all, he scored nine AAA championship race wins and two vice-championships in two years of competition. Having set a world land speed record at the Muroc dry lake in April 1927, Lockhart was killed during another speed record attempt at Daytona Beach a year later.
Driving career
Lockhart was raised in Southern California. He had a strong engineering and motor building ability that he used to build custom cars throughout his career.
Lockhart began his career in Frontenac-prepared Fords (Fronty Fords) at dirt track events, where he showed remarkable speed against the dominating Duesenbergs and Millers for two seasons.
1926
Lockhart's big break came when he was signed as a relief driver for Pete Kreis's eight-cylinder supercharged Miller at the 1926 Indianapolis 500. He convinced Kreis to allow him to take some "warm up" laps, and he clocked quicker times than Kreis (}). He set a new unofficial track record on his first official qualifying lap (a three-lap average was used to set a track record). He cut down a tire and crashed on the second qualifying lap. He also had mechanical problems on his second attempt. He slowed down on his third and final attempt, and qualified 20th overall with a speed of . On race day, he moved from 20th to fifth by Lap 5, having passed 14 cars on that lap alone. He moved up to second on Lap 16. Lockhart took the lead from Dave Lewis shortly after a rain delay on Lap 72. Lewis and Lockhart battled for the lead for the next 20 laps, until Lewis dropped out. Lockhart nearly stretched out a two-lap lead before rain ended the race on Lap 160, becoming the fourth rookie to win the Indianapolis 500.
Lockhart bought the car. He later bought a second Miller car, and he set track records almost everywhere he went. He won four more AAA championship races in 1926, and finished second in the standings.
1927
Lockhart's car was the first car equipped with an intercooler. The intercooler added to his speed at his first race at Culver City in March with Lockhart finishing fourth after starting from the pole position.
Lockhart qualified on the pole for the 1927 Indianapolis 500 in his Perfect Circle Miller. He led the opening 81 laps, and a full 107 before his car broke a connecting rod, setting an opening lap-leader record that stood for 64 years. He won four AAA championship races in 1927, and repeated the vice-championship.
Championship car career summary
In his racing career Lockhart set the all-time qualifying speed record at the Atlantic City Speedway, a record first exceeded at Indianapolis in 1960.
He competed in 22 board track races in his career, with eight wins and fourteen Top 5 finishes, and is 25th on the all-time lap leader board at Indianapolis.
Land speed record and death
On April 11, 1927, Lockhart took one of his tiny 91 cubic inch (1491 cc) supercharged, intercooled Millers out at the Muroc dry lake and set a land speed record of for a two-way average in the mile (1.6 km), with a peak speed of .
Backed by Stutz Motor Company, Lockhart combined two supercharged 91 ci (1.5 L) DOHC Miller motors, producing about , the smallest-displacement car ever to make the attempt, to set a new land speed record in the 122–183 cubic inch (2–3 litre) class at Daytona Beach. On April 25, 1928, Lockhart's Stutz Black Hawk Special streamliner (named for the Indiana town that was home to Stutz's factory) turned a warmup run of , with his first official pass at , well below the mark set earlier in the year by Ray Keech in his 81-litre (4178 ci) Triplex Special. On Lockhart's return pass the Black Hawk Special right rear tire exploded due to a blister which had formed during his first pass at speed, went out of control and tumbled violently across the sand, throwing Lockhart from the car and killing him instantly.
Awards and honors
Lockhart has been inducted into the following halls of fame:
Auto Racing Hall of Fame (1965)
National Sprint Car Hall of Fame (1990)
Motorsports Hall of Fame of America (1999)
Motorsports career results
Indianapolis 500 results
References
External links
Frank Lockhart - ChampCarStats.com
Frank Lockhart - Motorsport Memorial
Frank Stallworth Lockhart - stutzblackhawk.tripod.com
It's A Bird, It's A Plane, No It's, It's, Frank Lockhart??? - Dick Ralstin
1903 births
1928 deaths
Racing drivers from Dayton, Ohio
Racing drivers from Los Angeles
Indianapolis 500 drivers
Indianapolis 500 polesitters
Indianapolis 500 winners
AAA Championship Car drivers
Land speed record people
Racing drivers who died while racing
Sports deaths in Florida
Filmed deaths in motorsport
National Sprint Car Hall of Fame inductees |
Sir Henry Jebb (died 1811) was the president of the Royal College of Surgeons in Ireland (RCSI) in 1800.
Henry Jebb set up practice as a surgeon and man-midwife in 1777 in Dublin. For services of an obstetric nature, rendered in Dublin Castle, he received in 1782 the honour of knighthood from the Lord Lieutenant. Jebb was one of the original members of the Dublin Surgeons' Society, and was elected a member of the Royal College of Surgeons in Ireland at their first meeting. For many years he was a surgeon to Mercer's Hospital. He rivalled Surgeon Hume as a builder, having erected a large number of houses in North Frederick-street, winch he named after his son. The latter part of Jebb's life was chiefly spent in a house in Grafton-street. He died in 1811, at Dromartin House, which he had built, near Dundrum, County of Dublin, and was buried in the little churchyard at Glasnevin Village, County of Dublin.
References
Presidents of the Royal College of Surgeons in Ireland
Irish surgeons
1811 deaths
Year of birth unknown
Irish knights
Physician-accoucheurs
Medical doctors from Dublin (city) |
```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 cobra is a commander providing a simple interface to create powerful modern CLI interfaces.
// In addition to providing an interface, Cobra simultaneously provides a controller to organize your application code.
package cobra
import (
"bytes"
"context"
"fmt"
"io"
"os"
"path/filepath"
"sort"
"strings"
flag "github.com/spf13/pflag"
)
// FParseErrWhitelist configures Flag parse errors to be ignored
type FParseErrWhitelist flag.ParseErrorsWhitelist
// Command is just that, a command for your application.
// E.g. 'go run ...' - 'run' is the command. Cobra requires
// you to define the usage and description as part of your command
// definition to ensure usability.
type Command struct {
// Use is the one-line usage message.
Use string
// Aliases is an array of aliases that can be used instead of the first word in Use.
Aliases []string
// SuggestFor is an array of command names for which this command will be suggested -
// similar to aliases but only suggests.
SuggestFor []string
// Short is the short description shown in the 'help' output.
Short string
// Long is the long message shown in the 'help <this-command>' output.
Long string
// Example is examples of how to use the command.
Example string
// ValidArgs is list of all valid non-flag arguments that are accepted in bash completions
ValidArgs []string
// ValidArgsFunction is an optional function that provides valid non-flag arguments for bash completion.
// It is a dynamic version of using ValidArgs.
// Only one of ValidArgs and ValidArgsFunction can be used for a command.
ValidArgsFunction func(cmd *Command, args []string, toComplete string) ([]string, ShellCompDirective)
// Expected arguments
Args PositionalArgs
// ArgAliases is List of aliases for ValidArgs.
// These are not suggested to the user in the bash completion,
// but accepted if entered manually.
ArgAliases []string
// BashCompletionFunction is custom functions used by the bash autocompletion generator.
BashCompletionFunction string
// Deprecated defines, if this command is deprecated and should print this string when used.
Deprecated string
// Hidden defines, if this command is hidden and should NOT show up in the list of available commands.
Hidden bool
// Annotations are key/value pairs that can be used by applications to identify or
// group commands.
Annotations map[string]string
// Version defines the version for this command. If this value is non-empty and the command does not
// define a "version" flag, a "version" boolean flag will be added to the command and, if specified,
// will print content of the "Version" variable. A shorthand "v" flag will also be added if the
// command does not define one.
Version string
// The *Run functions are executed in the following order:
// * PersistentPreRun()
// * PreRun()
// * Run()
// * PostRun()
// * PersistentPostRun()
// All functions get the same args, the arguments after the command name.
//
// PersistentPreRun: children of this command will inherit and execute.
PersistentPreRun func(cmd *Command, args []string)
// PersistentPreRunE: PersistentPreRun but returns an error.
PersistentPreRunE func(cmd *Command, args []string) error
// PreRun: children of this command will not inherit.
PreRun func(cmd *Command, args []string)
// PreRunE: PreRun but returns an error.
PreRunE func(cmd *Command, args []string) error
// Run: Typically the actual work function. Most commands will only implement this.
Run func(cmd *Command, args []string)
// RunE: Run but returns an error.
RunE func(cmd *Command, args []string) error
// PostRun: run after the Run command.
PostRun func(cmd *Command, args []string)
// PostRunE: PostRun but returns an error.
PostRunE func(cmd *Command, args []string) error
// PersistentPostRun: children of this command will inherit and execute after PostRun.
PersistentPostRun func(cmd *Command, args []string)
// PersistentPostRunE: PersistentPostRun but returns an error.
PersistentPostRunE func(cmd *Command, args []string) error
// SilenceErrors is an option to quiet errors down stream.
SilenceErrors bool
// SilenceUsage is an option to silence usage when an error occurs.
SilenceUsage bool
// DisableFlagParsing disables the flag parsing.
// If this is true all flags will be passed to the command as arguments.
DisableFlagParsing bool
// DisableAutoGenTag defines, if gen tag ("Auto generated by spf13/cobra...")
// will be printed by generating docs for this command.
DisableAutoGenTag bool
// DisableFlagsInUseLine will disable the addition of [flags] to the usage
// line of a command when printing help or generating docs
DisableFlagsInUseLine bool
// DisableSuggestions disables the suggestions based on Levenshtein distance
// that go along with 'unknown command' messages.
DisableSuggestions bool
// SuggestionsMinimumDistance defines minimum levenshtein distance to display suggestions.
// Must be > 0.
SuggestionsMinimumDistance int
// TraverseChildren parses flags on all parents before executing child command.
TraverseChildren bool
// FParseErrWhitelist flag parse errors to be ignored
FParseErrWhitelist FParseErrWhitelist
ctx context.Context
// commands is the list of commands supported by this program.
commands []*Command
// parent is a parent command for this command.
parent *Command
// Max lengths of commands' string lengths for use in padding.
commandsMaxUseLen int
commandsMaxCommandPathLen int
commandsMaxNameLen int
// commandsAreSorted defines, if command slice are sorted or not.
commandsAreSorted bool
// commandCalledAs is the name or alias value used to call this command.
commandCalledAs struct {
name string
called bool
}
// args is actual args parsed from flags.
args []string
// flagErrorBuf contains all error messages from pflag.
flagErrorBuf *bytes.Buffer
// flags is full set of flags.
flags *flag.FlagSet
// pflags contains persistent flags.
pflags *flag.FlagSet
// lflags contains local flags.
lflags *flag.FlagSet
// iflags contains inherited flags.
iflags *flag.FlagSet
// parentsPflags is all persistent flags of cmd's parents.
parentsPflags *flag.FlagSet
// globNormFunc is the global normalization function
// that we can use on every pflag set and children commands
globNormFunc func(f *flag.FlagSet, name string) flag.NormalizedName
// usageFunc is usage func defined by user.
usageFunc func(*Command) error
// usageTemplate is usage template defined by user.
usageTemplate string
// flagErrorFunc is func defined by user and it's called when the parsing of
// flags returns an error.
flagErrorFunc func(*Command, error) error
// helpTemplate is help template defined by user.
helpTemplate string
// helpFunc is help func defined by user.
helpFunc func(*Command, []string)
// helpCommand is command with usage 'help'. If it's not defined by user,
// cobra uses default help command.
helpCommand *Command
// versionTemplate is the version template defined by user.
versionTemplate string
// inReader is a reader defined by the user that replaces stdin
inReader io.Reader
// outWriter is a writer defined by the user that replaces stdout
outWriter io.Writer
// errWriter is a writer defined by the user that replaces stderr
errWriter io.Writer
}
// Context returns underlying command context. If command wasn't
// executed with ExecuteContext Context returns Background context.
func (c *Command) Context() context.Context {
return c.ctx
}
// SetArgs sets arguments for the command. It is set to os.Args[1:] by default, if desired, can be overridden
// particularly useful when testing.
func (c *Command) SetArgs(a []string) {
c.args = a
}
// SetOutput sets the destination for usage and error messages.
// If output is nil, os.Stderr is used.
// Deprecated: Use SetOut and/or SetErr instead
func (c *Command) SetOutput(output io.Writer) {
c.outWriter = output
c.errWriter = output
}
// SetOut sets the destination for usage messages.
// If newOut is nil, os.Stdout is used.
func (c *Command) SetOut(newOut io.Writer) {
c.outWriter = newOut
}
// SetErr sets the destination for error messages.
// If newErr is nil, os.Stderr is used.
func (c *Command) SetErr(newErr io.Writer) {
c.errWriter = newErr
}
// SetIn sets the source for input data
// If newIn is nil, os.Stdin is used.
func (c *Command) SetIn(newIn io.Reader) {
c.inReader = newIn
}
// SetUsageFunc sets usage function. Usage can be defined by application.
func (c *Command) SetUsageFunc(f func(*Command) error) {
c.usageFunc = f
}
// SetUsageTemplate sets usage template. Can be defined by Application.
func (c *Command) SetUsageTemplate(s string) {
c.usageTemplate = s
}
// SetFlagErrorFunc sets a function to generate an error when flag parsing
// fails.
func (c *Command) SetFlagErrorFunc(f func(*Command, error) error) {
c.flagErrorFunc = f
}
// SetHelpFunc sets help function. Can be defined by Application.
func (c *Command) SetHelpFunc(f func(*Command, []string)) {
c.helpFunc = f
}
// SetHelpCommand sets help command.
func (c *Command) SetHelpCommand(cmd *Command) {
c.helpCommand = cmd
}
// SetHelpTemplate sets help template to be used. Application can use it to set custom template.
func (c *Command) SetHelpTemplate(s string) {
c.helpTemplate = s
}
// SetVersionTemplate sets version template to be used. Application can use it to set custom template.
func (c *Command) SetVersionTemplate(s string) {
c.versionTemplate = s
}
// SetGlobalNormalizationFunc sets a normalization function to all flag sets and also to child commands.
// The user should not have a cyclic dependency on commands.
func (c *Command) SetGlobalNormalizationFunc(n func(f *flag.FlagSet, name string) flag.NormalizedName) {
c.Flags().SetNormalizeFunc(n)
c.PersistentFlags().SetNormalizeFunc(n)
c.globNormFunc = n
for _, command := range c.commands {
command.SetGlobalNormalizationFunc(n)
}
}
// OutOrStdout returns output to stdout.
func (c *Command) OutOrStdout() io.Writer {
return c.getOut(os.Stdout)
}
// OutOrStderr returns output to stderr
func (c *Command) OutOrStderr() io.Writer {
return c.getOut(os.Stderr)
}
// ErrOrStderr returns output to stderr
func (c *Command) ErrOrStderr() io.Writer {
return c.getErr(os.Stderr)
}
// InOrStdin returns input to stdin
func (c *Command) InOrStdin() io.Reader {
return c.getIn(os.Stdin)
}
func (c *Command) getOut(def io.Writer) io.Writer {
if c.outWriter != nil {
return c.outWriter
}
if c.HasParent() {
return c.parent.getOut(def)
}
return def
}
func (c *Command) getErr(def io.Writer) io.Writer {
if c.errWriter != nil {
return c.errWriter
}
if c.HasParent() {
return c.parent.getErr(def)
}
return def
}
func (c *Command) getIn(def io.Reader) io.Reader {
if c.inReader != nil {
return c.inReader
}
if c.HasParent() {
return c.parent.getIn(def)
}
return def
}
// UsageFunc returns either the function set by SetUsageFunc for this command
// or a parent, or it returns a default usage function.
func (c *Command) UsageFunc() (f func(*Command) error) {
if c.usageFunc != nil {
return c.usageFunc
}
if c.HasParent() {
return c.Parent().UsageFunc()
}
return func(c *Command) error {
c.mergePersistentFlags()
err := tmpl(c.OutOrStderr(), c.UsageTemplate(), c)
if err != nil {
c.Println(err)
}
return err
}
}
// Usage puts out the usage for the command.
// Used when a user provides invalid input.
// Can be defined by user by overriding UsageFunc.
func (c *Command) Usage() error {
return c.UsageFunc()(c)
}
// HelpFunc returns either the function set by SetHelpFunc for this command
// or a parent, or it returns a function with default help behavior.
func (c *Command) HelpFunc() func(*Command, []string) {
if c.helpFunc != nil {
return c.helpFunc
}
if c.HasParent() {
return c.Parent().HelpFunc()
}
return func(c *Command, a []string) {
c.mergePersistentFlags()
// The help should be sent to stdout
// See path_to_url
err := tmpl(c.OutOrStdout(), c.HelpTemplate(), c)
if err != nil {
c.Println(err)
}
}
}
// Help puts out the help for the command.
// Used when a user calls help [command].
// Can be defined by user by overriding HelpFunc.
func (c *Command) Help() error {
c.HelpFunc()(c, []string{})
return nil
}
// UsageString returns usage string.
func (c *Command) UsageString() string {
// Storing normal writers
tmpOutput := c.outWriter
tmpErr := c.errWriter
bb := new(bytes.Buffer)
c.outWriter = bb
c.errWriter = bb
c.Usage()
// Setting things back to normal
c.outWriter = tmpOutput
c.errWriter = tmpErr
return bb.String()
}
// FlagErrorFunc returns either the function set by SetFlagErrorFunc for this
// command or a parent, or it returns a function which returns the original
// error.
func (c *Command) FlagErrorFunc() (f func(*Command, error) error) {
if c.flagErrorFunc != nil {
return c.flagErrorFunc
}
if c.HasParent() {
return c.parent.FlagErrorFunc()
}
return func(c *Command, err error) error {
return err
}
}
var minUsagePadding = 25
// UsagePadding return padding for the usage.
func (c *Command) UsagePadding() int {
if c.parent == nil || minUsagePadding > c.parent.commandsMaxUseLen {
return minUsagePadding
}
return c.parent.commandsMaxUseLen
}
var minCommandPathPadding = 11
// CommandPathPadding return padding for the command path.
func (c *Command) CommandPathPadding() int {
if c.parent == nil || minCommandPathPadding > c.parent.commandsMaxCommandPathLen {
return minCommandPathPadding
}
return c.parent.commandsMaxCommandPathLen
}
var minNamePadding = 11
// NamePadding returns padding for the name.
func (c *Command) NamePadding() int {
if c.parent == nil || minNamePadding > c.parent.commandsMaxNameLen {
return minNamePadding
}
return c.parent.commandsMaxNameLen
}
// UsageTemplate returns usage template for the command.
func (c *Command) UsageTemplate() string {
if c.usageTemplate != "" {
return c.usageTemplate
}
if c.HasParent() {
return c.parent.UsageTemplate()
}
return `Usage:{{if .Runnable}}
{{.UseLine}}{{end}}{{if .HasAvailableSubCommands}}
{{.CommandPath}} [command]{{end}}{{if gt (len .Aliases) 0}}
Aliases:
{{.NameAndAliases}}{{end}}{{if .HasExample}}
Examples:
{{.Example}}{{end}}{{if .HasAvailableSubCommands}}
Available Commands:{{range .Commands}}{{if (or .IsAvailableCommand (eq .Name "help"))}}
{{rpad .Name .NamePadding }} {{.Short}}{{end}}{{end}}{{end}}{{if .HasAvailableLocalFlags}}
Flags:
{{.LocalFlags.FlagUsages | trimTrailingWhitespaces}}{{end}}{{if .HasAvailableInheritedFlags}}
Global Flags:
{{.InheritedFlags.FlagUsages | trimTrailingWhitespaces}}{{end}}{{if .HasHelpSubCommands}}
Additional help topics:{{range .Commands}}{{if .IsAdditionalHelpTopicCommand}}
{{rpad .CommandPath .CommandPathPadding}} {{.Short}}{{end}}{{end}}{{end}}{{if .HasAvailableSubCommands}}
Use "{{.CommandPath}} [command] --help" for more information about a command.{{end}}
`
}
// HelpTemplate return help template for the command.
func (c *Command) HelpTemplate() string {
if c.helpTemplate != "" {
return c.helpTemplate
}
if c.HasParent() {
return c.parent.HelpTemplate()
}
return `{{with (or .Long .Short)}}{{. | trimTrailingWhitespaces}}
{{end}}{{if or .Runnable .HasSubCommands}}{{.UsageString}}{{end}}`
}
// VersionTemplate return version template for the command.
func (c *Command) VersionTemplate() string {
if c.versionTemplate != "" {
return c.versionTemplate
}
if c.HasParent() {
return c.parent.VersionTemplate()
}
return `{{with .Name}}{{printf "%s " .}}{{end}}{{printf "version %s" .Version}}
`
}
func hasNoOptDefVal(name string, fs *flag.FlagSet) bool {
flag := fs.Lookup(name)
if flag == nil {
return false
}
return flag.NoOptDefVal != ""
}
func shortHasNoOptDefVal(name string, fs *flag.FlagSet) bool {
if len(name) == 0 {
return false
}
flag := fs.ShorthandLookup(name[:1])
if flag == nil {
return false
}
return flag.NoOptDefVal != ""
}
func stripFlags(args []string, c *Command) []string {
if len(args) == 0 {
return args
}
c.mergePersistentFlags()
commands := []string{}
flags := c.Flags()
Loop:
for len(args) > 0 {
s := args[0]
args = args[1:]
switch {
case s == "--":
// "--" terminates the flags
break Loop
case strings.HasPrefix(s, "--") && !strings.Contains(s, "=") && !hasNoOptDefVal(s[2:], flags):
// If '--flag arg' then
// delete arg from args.
fallthrough // (do the same as below)
case strings.HasPrefix(s, "-") && !strings.Contains(s, "=") && len(s) == 2 && !shortHasNoOptDefVal(s[1:], flags):
// If '-f arg' then
// delete 'arg' from args or break the loop if len(args) <= 1.
if len(args) <= 1 {
break Loop
} else {
args = args[1:]
continue
}
case s != "" && !strings.HasPrefix(s, "-"):
commands = append(commands, s)
}
}
return commands
}
// argsMinusFirstX removes only the first x from args. Otherwise, commands that look like
// openshift admin policy add-role-to-user admin my-user, lose the admin argument (arg[4]).
func argsMinusFirstX(args []string, x string) []string {
for i, y := range args {
if x == y {
ret := []string{}
ret = append(ret, args[:i]...)
ret = append(ret, args[i+1:]...)
return ret
}
}
return args
}
func isFlagArg(arg string) bool {
return ((len(arg) >= 3 && arg[1] == '-') ||
(len(arg) >= 2 && arg[0] == '-' && arg[1] != '-'))
}
// Find the target command given the args and command tree
// Meant to be run on the highest node. Only searches down.
func (c *Command) Find(args []string) (*Command, []string, error) {
var innerfind func(*Command, []string) (*Command, []string)
innerfind = func(c *Command, innerArgs []string) (*Command, []string) {
argsWOflags := stripFlags(innerArgs, c)
if len(argsWOflags) == 0 {
return c, innerArgs
}
nextSubCmd := argsWOflags[0]
cmd := c.findNext(nextSubCmd)
if cmd != nil {
return innerfind(cmd, argsMinusFirstX(innerArgs, nextSubCmd))
}
return c, innerArgs
}
commandFound, a := innerfind(c, args)
if commandFound.Args == nil {
return commandFound, a, legacyArgs(commandFound, stripFlags(a, commandFound))
}
return commandFound, a, nil
}
func (c *Command) findSuggestions(arg string) string {
if c.DisableSuggestions {
return ""
}
if c.SuggestionsMinimumDistance <= 0 {
c.SuggestionsMinimumDistance = 2
}
suggestionsString := ""
if suggestions := c.SuggestionsFor(arg); len(suggestions) > 0 {
suggestionsString += "\n\nDid you mean this?\n"
for _, s := range suggestions {
suggestionsString += fmt.Sprintf("\t%v\n", s)
}
}
return suggestionsString
}
func (c *Command) findNext(next string) *Command {
matches := make([]*Command, 0)
for _, cmd := range c.commands {
if cmd.Name() == next || cmd.HasAlias(next) {
cmd.commandCalledAs.name = next
return cmd
}
if EnablePrefixMatching && cmd.hasNameOrAliasPrefix(next) {
matches = append(matches, cmd)
}
}
if len(matches) == 1 {
return matches[0]
}
return nil
}
// Traverse the command tree to find the command, and parse args for
// each parent.
func (c *Command) Traverse(args []string) (*Command, []string, error) {
flags := []string{}
inFlag := false
for i, arg := range args {
switch {
// A long flag with a space separated value
case strings.HasPrefix(arg, "--") && !strings.Contains(arg, "="):
// TODO: this isn't quite right, we should really check ahead for 'true' or 'false'
inFlag = !hasNoOptDefVal(arg[2:], c.Flags())
flags = append(flags, arg)
continue
// A short flag with a space separated value
case strings.HasPrefix(arg, "-") && !strings.Contains(arg, "=") && len(arg) == 2 && !shortHasNoOptDefVal(arg[1:], c.Flags()):
inFlag = true
flags = append(flags, arg)
continue
// The value for a flag
case inFlag:
inFlag = false
flags = append(flags, arg)
continue
// A flag without a value, or with an `=` separated value
case isFlagArg(arg):
flags = append(flags, arg)
continue
}
cmd := c.findNext(arg)
if cmd == nil {
return c, args, nil
}
if err := c.ParseFlags(flags); err != nil {
return nil, args, err
}
return cmd.Traverse(args[i+1:])
}
return c, args, nil
}
// SuggestionsFor provides suggestions for the typedName.
func (c *Command) SuggestionsFor(typedName string) []string {
suggestions := []string{}
for _, cmd := range c.commands {
if cmd.IsAvailableCommand() {
levenshteinDistance := ld(typedName, cmd.Name(), true)
suggestByLevenshtein := levenshteinDistance <= c.SuggestionsMinimumDistance
suggestByPrefix := strings.HasPrefix(strings.ToLower(cmd.Name()), strings.ToLower(typedName))
if suggestByLevenshtein || suggestByPrefix {
suggestions = append(suggestions, cmd.Name())
}
for _, explicitSuggestion := range cmd.SuggestFor {
if strings.EqualFold(typedName, explicitSuggestion) {
suggestions = append(suggestions, cmd.Name())
}
}
}
}
return suggestions
}
// VisitParents visits all parents of the command and invokes fn on each parent.
func (c *Command) VisitParents(fn func(*Command)) {
if c.HasParent() {
fn(c.Parent())
c.Parent().VisitParents(fn)
}
}
// Root finds root command.
func (c *Command) Root() *Command {
if c.HasParent() {
return c.Parent().Root()
}
return c
}
// ArgsLenAtDash will return the length of c.Flags().Args at the moment
// when a -- was found during args parsing.
func (c *Command) ArgsLenAtDash() int {
return c.Flags().ArgsLenAtDash()
}
func (c *Command) execute(a []string) (err error) {
if c == nil {
return fmt.Errorf("Called Execute() on a nil Command")
}
if len(c.Deprecated) > 0 {
c.Printf("Command %q is deprecated, %s\n", c.Name(), c.Deprecated)
}
// initialize help and version flag at the last point possible to allow for user
// overriding
c.InitDefaultHelpFlag()
c.InitDefaultVersionFlag()
err = c.ParseFlags(a)
if err != nil {
return c.FlagErrorFunc()(c, err)
}
// If help is called, regardless of other flags, return we want help.
// Also say we need help if the command isn't runnable.
helpVal, err := c.Flags().GetBool("help")
if err != nil {
// should be impossible to get here as we always declare a help
// flag in InitDefaultHelpFlag()
c.Println("\"help\" flag declared as non-bool. Please correct your code")
return err
}
if helpVal {
return flag.ErrHelp
}
// for back-compat, only add version flag behavior if version is defined
if c.Version != "" {
versionVal, err := c.Flags().GetBool("version")
if err != nil {
c.Println("\"version\" flag declared as non-bool. Please correct your code")
return err
}
if versionVal {
err := tmpl(c.OutOrStdout(), c.VersionTemplate(), c)
if err != nil {
c.Println(err)
}
return err
}
}
if !c.Runnable() {
return flag.ErrHelp
}
c.preRun()
argWoFlags := c.Flags().Args()
if c.DisableFlagParsing {
argWoFlags = a
}
if err := c.ValidateArgs(argWoFlags); err != nil {
return err
}
for p := c; p != nil; p = p.Parent() {
if p.PersistentPreRunE != nil {
if err := p.PersistentPreRunE(c, argWoFlags); err != nil {
return err
}
break
} else if p.PersistentPreRun != nil {
p.PersistentPreRun(c, argWoFlags)
break
}
}
if c.PreRunE != nil {
if err := c.PreRunE(c, argWoFlags); err != nil {
return err
}
} else if c.PreRun != nil {
c.PreRun(c, argWoFlags)
}
if err := c.validateRequiredFlags(); err != nil {
return err
}
if c.RunE != nil {
if err := c.RunE(c, argWoFlags); err != nil {
return err
}
} else {
c.Run(c, argWoFlags)
}
if c.PostRunE != nil {
if err := c.PostRunE(c, argWoFlags); err != nil {
return err
}
} else if c.PostRun != nil {
c.PostRun(c, argWoFlags)
}
for p := c; p != nil; p = p.Parent() {
if p.PersistentPostRunE != nil {
if err := p.PersistentPostRunE(c, argWoFlags); err != nil {
return err
}
break
} else if p.PersistentPostRun != nil {
p.PersistentPostRun(c, argWoFlags)
break
}
}
return nil
}
func (c *Command) preRun() {
for _, x := range initializers {
x()
}
}
// ExecuteContext is the same as Execute(), but sets the ctx on the command.
// Retrieve ctx by calling cmd.Context() inside your *Run lifecycle functions.
func (c *Command) ExecuteContext(ctx context.Context) error {
c.ctx = ctx
return c.Execute()
}
// Execute uses the args (os.Args[1:] by default)
// and run through the command tree finding appropriate matches
// for commands and then corresponding flags.
func (c *Command) Execute() error {
_, err := c.ExecuteC()
return err
}
// ExecuteC executes the command.
func (c *Command) ExecuteC() (cmd *Command, err error) {
if c.ctx == nil {
c.ctx = context.Background()
}
// Regardless of what command execute is called on, run on Root only
if c.HasParent() {
return c.Root().ExecuteC()
}
// windows hook
if preExecHookFn != nil {
preExecHookFn(c)
}
// initialize help as the last point possible to allow for user
// overriding
c.InitDefaultHelpCmd()
args := c.args
// Workaround FAIL with "go test -v" or "cobra.test -test.v", see #155
if c.args == nil && filepath.Base(os.Args[0]) != "cobra.test" {
args = os.Args[1:]
}
// initialize the hidden command to be used for bash completion
c.initCompleteCmd(args)
var flags []string
if c.TraverseChildren {
cmd, flags, err = c.Traverse(args)
} else {
cmd, flags, err = c.Find(args)
}
if err != nil {
// If found parse to a subcommand and then failed, talk about the subcommand
if cmd != nil {
c = cmd
}
if !c.SilenceErrors {
c.Println("Error:", err.Error())
c.Printf("Run '%v --help' for usage.\n", c.CommandPath())
}
return c, err
}
cmd.commandCalledAs.called = true
if cmd.commandCalledAs.name == "" {
cmd.commandCalledAs.name = cmd.Name()
}
// We have to pass global context to children command
// if context is present on the parent command.
if cmd.ctx == nil {
cmd.ctx = c.ctx
}
err = cmd.execute(flags)
if err != nil {
// Always show help if requested, even if SilenceErrors is in
// effect
if err == flag.ErrHelp {
cmd.HelpFunc()(cmd, args)
return cmd, nil
}
// If root command has SilentErrors flagged,
// all subcommands should respect it
if !cmd.SilenceErrors && !c.SilenceErrors {
c.Println("Error:", err.Error())
}
// If root command has SilentUsage flagged,
// all subcommands should respect it
if !cmd.SilenceUsage && !c.SilenceUsage {
c.Println(cmd.UsageString())
}
}
return cmd, err
}
func (c *Command) ValidateArgs(args []string) error {
if c.Args == nil {
return nil
}
return c.Args(c, args)
}
func (c *Command) validateRequiredFlags() error {
flags := c.Flags()
missingFlagNames := []string{}
flags.VisitAll(func(pflag *flag.Flag) {
requiredAnnotation, found := pflag.Annotations[BashCompOneRequiredFlag]
if !found {
return
}
if (requiredAnnotation[0] == "true") && !pflag.Changed {
missingFlagNames = append(missingFlagNames, pflag.Name)
}
})
if len(missingFlagNames) > 0 {
return fmt.Errorf(`required flag(s) "%s" not set`, strings.Join(missingFlagNames, `", "`))
}
return nil
}
// InitDefaultHelpFlag adds default help flag to c.
// It is called automatically by executing the c or by calling help and usage.
// If c already has help flag, it will do nothing.
func (c *Command) InitDefaultHelpFlag() {
c.mergePersistentFlags()
if c.Flags().Lookup("help") == nil {
usage := "help for "
if c.Name() == "" {
usage += "this command"
} else {
usage += c.Name()
}
c.Flags().BoolP("help", "h", false, usage)
}
}
// InitDefaultVersionFlag adds default version flag to c.
// It is called automatically by executing the c.
// If c already has a version flag, it will do nothing.
// If c.Version is empty, it will do nothing.
func (c *Command) InitDefaultVersionFlag() {
if c.Version == "" {
return
}
c.mergePersistentFlags()
if c.Flags().Lookup("version") == nil {
usage := "version for "
if c.Name() == "" {
usage += "this command"
} else {
usage += c.Name()
}
if c.Flags().ShorthandLookup("v") == nil {
c.Flags().BoolP("version", "v", false, usage)
} else {
c.Flags().Bool("version", false, usage)
}
}
}
// InitDefaultHelpCmd adds default help command to c.
// It is called automatically by executing the c or by calling help and usage.
// If c already has help command or c has no subcommands, it will do nothing.
func (c *Command) InitDefaultHelpCmd() {
if !c.HasSubCommands() {
return
}
if c.helpCommand == nil {
c.helpCommand = &Command{
Use: "help [command]",
Short: "Help about any command",
Long: `Help provides help for any command in the application.
Simply type ` + c.Name() + ` help [path to command] for full details.`,
Run: func(c *Command, args []string) {
cmd, _, e := c.Root().Find(args)
if cmd == nil || e != nil {
c.Printf("Unknown help topic %#q\n", args)
c.Root().Usage()
} else {
cmd.InitDefaultHelpFlag() // make possible 'help' flag to be shown
cmd.Help()
}
},
}
}
c.RemoveCommand(c.helpCommand)
c.AddCommand(c.helpCommand)
}
// ResetCommands delete parent, subcommand and help command from c.
func (c *Command) ResetCommands() {
c.parent = nil
c.commands = nil
c.helpCommand = nil
c.parentsPflags = nil
}
// Sorts commands by their names.
type commandSorterByName []*Command
func (c commandSorterByName) Len() int { return len(c) }
func (c commandSorterByName) Swap(i, j int) { c[i], c[j] = c[j], c[i] }
func (c commandSorterByName) Less(i, j int) bool { return c[i].Name() < c[j].Name() }
// Commands returns a sorted slice of child commands.
func (c *Command) Commands() []*Command {
// do not sort commands if it already sorted or sorting was disabled
if EnableCommandSorting && !c.commandsAreSorted {
sort.Sort(commandSorterByName(c.commands))
c.commandsAreSorted = true
}
return c.commands
}
// AddCommand adds one or more commands to this parent command.
func (c *Command) AddCommand(cmds ...*Command) {
for i, x := range cmds {
if cmds[i] == c {
panic("Command can't be a child of itself")
}
cmds[i].parent = c
// update max lengths
usageLen := len(x.Use)
if usageLen > c.commandsMaxUseLen {
c.commandsMaxUseLen = usageLen
}
commandPathLen := len(x.CommandPath())
if commandPathLen > c.commandsMaxCommandPathLen {
c.commandsMaxCommandPathLen = commandPathLen
}
nameLen := len(x.Name())
if nameLen > c.commandsMaxNameLen {
c.commandsMaxNameLen = nameLen
}
// If global normalization function exists, update all children
if c.globNormFunc != nil {
x.SetGlobalNormalizationFunc(c.globNormFunc)
}
c.commands = append(c.commands, x)
c.commandsAreSorted = false
}
}
// RemoveCommand removes one or more commands from a parent command.
func (c *Command) RemoveCommand(cmds ...*Command) {
commands := []*Command{}
main:
for _, command := range c.commands {
for _, cmd := range cmds {
if command == cmd {
command.parent = nil
continue main
}
}
commands = append(commands, command)
}
c.commands = commands
// recompute all lengths
c.commandsMaxUseLen = 0
c.commandsMaxCommandPathLen = 0
c.commandsMaxNameLen = 0
for _, command := range c.commands {
usageLen := len(command.Use)
if usageLen > c.commandsMaxUseLen {
c.commandsMaxUseLen = usageLen
}
commandPathLen := len(command.CommandPath())
if commandPathLen > c.commandsMaxCommandPathLen {
c.commandsMaxCommandPathLen = commandPathLen
}
nameLen := len(command.Name())
if nameLen > c.commandsMaxNameLen {
c.commandsMaxNameLen = nameLen
}
}
}
// Print is a convenience method to Print to the defined output, fallback to Stderr if not set.
func (c *Command) Print(i ...interface{}) {
fmt.Fprint(c.OutOrStderr(), i...)
}
// Println is a convenience method to Println to the defined output, fallback to Stderr if not set.
func (c *Command) Println(i ...interface{}) {
c.Print(fmt.Sprintln(i...))
}
// Printf is a convenience method to Printf to the defined output, fallback to Stderr if not set.
func (c *Command) Printf(format string, i ...interface{}) {
c.Print(fmt.Sprintf(format, i...))
}
// PrintErr is a convenience method to Print to the defined Err output, fallback to Stderr if not set.
func (c *Command) PrintErr(i ...interface{}) {
fmt.Fprint(c.ErrOrStderr(), i...)
}
// PrintErrln is a convenience method to Println to the defined Err output, fallback to Stderr if not set.
func (c *Command) PrintErrln(i ...interface{}) {
c.Print(fmt.Sprintln(i...))
}
// PrintErrf is a convenience method to Printf to the defined Err output, fallback to Stderr if not set.
func (c *Command) PrintErrf(format string, i ...interface{}) {
c.Print(fmt.Sprintf(format, i...))
}
// CommandPath returns the full path to this command.
func (c *Command) CommandPath() string {
if c.HasParent() {
return c.Parent().CommandPath() + " " + c.Name()
}
return c.Name()
}
// UseLine puts out the full usage for a given command (including parents).
func (c *Command) UseLine() string {
var useline string
if c.HasParent() {
useline = c.parent.CommandPath() + " " + c.Use
} else {
useline = c.Use
}
if c.DisableFlagsInUseLine {
return useline
}
if c.HasAvailableFlags() && !strings.Contains(useline, "[flags]") {
useline += " [flags]"
}
return useline
}
// DebugFlags used to determine which flags have been assigned to which commands
// and which persist.
func (c *Command) DebugFlags() {
c.Println("DebugFlags called on", c.Name())
var debugflags func(*Command)
debugflags = func(x *Command) {
if x.HasFlags() || x.HasPersistentFlags() {
c.Println(x.Name())
}
if x.HasFlags() {
x.flags.VisitAll(func(f *flag.Flag) {
if x.HasPersistentFlags() && x.persistentFlag(f.Name) != nil {
c.Println(" -"+f.Shorthand+",", "--"+f.Name, "["+f.DefValue+"]", "", f.Value, " [LP]")
} else {
c.Println(" -"+f.Shorthand+",", "--"+f.Name, "["+f.DefValue+"]", "", f.Value, " [L]")
}
})
}
if x.HasPersistentFlags() {
x.pflags.VisitAll(func(f *flag.Flag) {
if x.HasFlags() {
if x.flags.Lookup(f.Name) == nil {
c.Println(" -"+f.Shorthand+",", "--"+f.Name, "["+f.DefValue+"]", "", f.Value, " [P]")
}
} else {
c.Println(" -"+f.Shorthand+",", "--"+f.Name, "["+f.DefValue+"]", "", f.Value, " [P]")
}
})
}
c.Println(x.flagErrorBuf)
if x.HasSubCommands() {
for _, y := range x.commands {
debugflags(y)
}
}
}
debugflags(c)
}
// Name returns the command's name: the first word in the use line.
func (c *Command) Name() string {
name := c.Use
i := strings.Index(name, " ")
if i >= 0 {
name = name[:i]
}
return name
}
// HasAlias determines if a given string is an alias of the command.
func (c *Command) HasAlias(s string) bool {
for _, a := range c.Aliases {
if a == s {
return true
}
}
return false
}
// CalledAs returns the command name or alias that was used to invoke
// this command or an empty string if the command has not been called.
func (c *Command) CalledAs() string {
if c.commandCalledAs.called {
return c.commandCalledAs.name
}
return ""
}
// hasNameOrAliasPrefix returns true if the Name or any of aliases start
// with prefix
func (c *Command) hasNameOrAliasPrefix(prefix string) bool {
if strings.HasPrefix(c.Name(), prefix) {
c.commandCalledAs.name = c.Name()
return true
}
for _, alias := range c.Aliases {
if strings.HasPrefix(alias, prefix) {
c.commandCalledAs.name = alias
return true
}
}
return false
}
// NameAndAliases returns a list of the command name and all aliases
func (c *Command) NameAndAliases() string {
return strings.Join(append([]string{c.Name()}, c.Aliases...), ", ")
}
// HasExample determines if the command has example.
func (c *Command) HasExample() bool {
return len(c.Example) > 0
}
// Runnable determines if the command is itself runnable.
func (c *Command) Runnable() bool {
return c.Run != nil || c.RunE != nil
}
// HasSubCommands determines if the command has children commands.
func (c *Command) HasSubCommands() bool {
return len(c.commands) > 0
}
// IsAvailableCommand determines if a command is available as a non-help command
// (this includes all non deprecated/hidden commands).
func (c *Command) IsAvailableCommand() bool {
if len(c.Deprecated) != 0 || c.Hidden {
return false
}
if c.HasParent() && c.Parent().helpCommand == c {
return false
}
if c.Runnable() || c.HasAvailableSubCommands() {
return true
}
return false
}
// IsAdditionalHelpTopicCommand determines if a command is an additional
// help topic command; additional help topic command is determined by the
// fact that it is NOT runnable/hidden/deprecated, and has no sub commands that
// are runnable/hidden/deprecated.
// Concrete example: path_to_url#issuecomment-282741924.
func (c *Command) IsAdditionalHelpTopicCommand() bool {
// if a command is runnable, deprecated, or hidden it is not a 'help' command
if c.Runnable() || len(c.Deprecated) != 0 || c.Hidden {
return false
}
// if any non-help sub commands are found, the command is not a 'help' command
for _, sub := range c.commands {
if !sub.IsAdditionalHelpTopicCommand() {
return false
}
}
// the command either has no sub commands, or no non-help sub commands
return true
}
// HasHelpSubCommands determines if a command has any available 'help' sub commands
// that need to be shown in the usage/help default template under 'additional help
// topics'.
func (c *Command) HasHelpSubCommands() bool {
// return true on the first found available 'help' sub command
for _, sub := range c.commands {
if sub.IsAdditionalHelpTopicCommand() {
return true
}
}
// the command either has no sub commands, or no available 'help' sub commands
return false
}
// HasAvailableSubCommands determines if a command has available sub commands that
// need to be shown in the usage/help default template under 'available commands'.
func (c *Command) HasAvailableSubCommands() bool {
// return true on the first found available (non deprecated/help/hidden)
// sub command
for _, sub := range c.commands {
if sub.IsAvailableCommand() {
return true
}
}
// the command either has no sub commands, or no available (non deprecated/help/hidden)
// sub commands
return false
}
// HasParent determines if the command is a child command.
func (c *Command) HasParent() bool {
return c.parent != nil
}
// GlobalNormalizationFunc returns the global normalization function or nil if it doesn't exist.
func (c *Command) GlobalNormalizationFunc() func(f *flag.FlagSet, name string) flag.NormalizedName {
return c.globNormFunc
}
// Flags returns the complete FlagSet that applies
// to this command (local and persistent declared here and by all parents).
func (c *Command) Flags() *flag.FlagSet {
if c.flags == nil {
c.flags = flag.NewFlagSet(c.Name(), flag.ContinueOnError)
if c.flagErrorBuf == nil {
c.flagErrorBuf = new(bytes.Buffer)
}
c.flags.SetOutput(c.flagErrorBuf)
}
return c.flags
}
// LocalNonPersistentFlags are flags specific to this command which will NOT persist to subcommands.
func (c *Command) LocalNonPersistentFlags() *flag.FlagSet {
persistentFlags := c.PersistentFlags()
out := flag.NewFlagSet(c.Name(), flag.ContinueOnError)
c.LocalFlags().VisitAll(func(f *flag.Flag) {
if persistentFlags.Lookup(f.Name) == nil {
out.AddFlag(f)
}
})
return out
}
// LocalFlags returns the local FlagSet specifically set in the current command.
func (c *Command) LocalFlags() *flag.FlagSet {
c.mergePersistentFlags()
if c.lflags == nil {
c.lflags = flag.NewFlagSet(c.Name(), flag.ContinueOnError)
if c.flagErrorBuf == nil {
c.flagErrorBuf = new(bytes.Buffer)
}
c.lflags.SetOutput(c.flagErrorBuf)
}
c.lflags.SortFlags = c.Flags().SortFlags
if c.globNormFunc != nil {
c.lflags.SetNormalizeFunc(c.globNormFunc)
}
addToLocal := func(f *flag.Flag) {
if c.lflags.Lookup(f.Name) == nil && c.parentsPflags.Lookup(f.Name) == nil {
c.lflags.AddFlag(f)
}
}
c.Flags().VisitAll(addToLocal)
c.PersistentFlags().VisitAll(addToLocal)
return c.lflags
}
// InheritedFlags returns all flags which were inherited from parent commands.
func (c *Command) InheritedFlags() *flag.FlagSet {
c.mergePersistentFlags()
if c.iflags == nil {
c.iflags = flag.NewFlagSet(c.Name(), flag.ContinueOnError)
if c.flagErrorBuf == nil {
c.flagErrorBuf = new(bytes.Buffer)
}
c.iflags.SetOutput(c.flagErrorBuf)
}
local := c.LocalFlags()
if c.globNormFunc != nil {
c.iflags.SetNormalizeFunc(c.globNormFunc)
}
c.parentsPflags.VisitAll(func(f *flag.Flag) {
if c.iflags.Lookup(f.Name) == nil && local.Lookup(f.Name) == nil {
c.iflags.AddFlag(f)
}
})
return c.iflags
}
// NonInheritedFlags returns all flags which were not inherited from parent commands.
func (c *Command) NonInheritedFlags() *flag.FlagSet {
return c.LocalFlags()
}
// PersistentFlags returns the persistent FlagSet specifically set in the current command.
func (c *Command) PersistentFlags() *flag.FlagSet {
if c.pflags == nil {
c.pflags = flag.NewFlagSet(c.Name(), flag.ContinueOnError)
if c.flagErrorBuf == nil {
c.flagErrorBuf = new(bytes.Buffer)
}
c.pflags.SetOutput(c.flagErrorBuf)
}
return c.pflags
}
// ResetFlags deletes all flags from command.
func (c *Command) ResetFlags() {
c.flagErrorBuf = new(bytes.Buffer)
c.flagErrorBuf.Reset()
c.flags = flag.NewFlagSet(c.Name(), flag.ContinueOnError)
c.flags.SetOutput(c.flagErrorBuf)
c.pflags = flag.NewFlagSet(c.Name(), flag.ContinueOnError)
c.pflags.SetOutput(c.flagErrorBuf)
c.lflags = nil
c.iflags = nil
c.parentsPflags = nil
}
// HasFlags checks if the command contains any flags (local plus persistent from the entire structure).
func (c *Command) HasFlags() bool {
return c.Flags().HasFlags()
}
// HasPersistentFlags checks if the command contains persistent flags.
func (c *Command) HasPersistentFlags() bool {
return c.PersistentFlags().HasFlags()
}
// HasLocalFlags checks if the command has flags specifically declared locally.
func (c *Command) HasLocalFlags() bool {
return c.LocalFlags().HasFlags()
}
// HasInheritedFlags checks if the command has flags inherited from its parent command.
func (c *Command) HasInheritedFlags() bool {
return c.InheritedFlags().HasFlags()
}
// HasAvailableFlags checks if the command contains any flags (local plus persistent from the entire
// structure) which are not hidden or deprecated.
func (c *Command) HasAvailableFlags() bool {
return c.Flags().HasAvailableFlags()
}
// HasAvailablePersistentFlags checks if the command contains persistent flags which are not hidden or deprecated.
func (c *Command) HasAvailablePersistentFlags() bool {
return c.PersistentFlags().HasAvailableFlags()
}
// HasAvailableLocalFlags checks if the command has flags specifically declared locally which are not hidden
// or deprecated.
func (c *Command) HasAvailableLocalFlags() bool {
return c.LocalFlags().HasAvailableFlags()
}
// HasAvailableInheritedFlags checks if the command has flags inherited from its parent command which are
// not hidden or deprecated.
func (c *Command) HasAvailableInheritedFlags() bool {
return c.InheritedFlags().HasAvailableFlags()
}
// Flag climbs up the command tree looking for matching flag.
func (c *Command) Flag(name string) (flag *flag.Flag) {
flag = c.Flags().Lookup(name)
if flag == nil {
flag = c.persistentFlag(name)
}
return
}
// Recursively find matching persistent flag.
func (c *Command) persistentFlag(name string) (flag *flag.Flag) {
if c.HasPersistentFlags() {
flag = c.PersistentFlags().Lookup(name)
}
if flag == nil {
c.updateParentsPflags()
flag = c.parentsPflags.Lookup(name)
}
return
}
// ParseFlags parses persistent flag tree and local flags.
func (c *Command) ParseFlags(args []string) error {
if c.DisableFlagParsing {
return nil
}
if c.flagErrorBuf == nil {
c.flagErrorBuf = new(bytes.Buffer)
}
beforeErrorBufLen := c.flagErrorBuf.Len()
c.mergePersistentFlags()
// do it here after merging all flags and just before parse
c.Flags().ParseErrorsWhitelist = flag.ParseErrorsWhitelist(c.FParseErrWhitelist)
err := c.Flags().Parse(args)
// Print warnings if they occurred (e.g. deprecated flag messages).
if c.flagErrorBuf.Len()-beforeErrorBufLen > 0 && err == nil {
c.Print(c.flagErrorBuf.String())
}
return err
}
// Parent returns a commands parent command.
func (c *Command) Parent() *Command {
return c.parent
}
// mergePersistentFlags merges c.PersistentFlags() to c.Flags()
// and adds missing persistent flags of all parents.
func (c *Command) mergePersistentFlags() {
c.updateParentsPflags()
c.Flags().AddFlagSet(c.PersistentFlags())
c.Flags().AddFlagSet(c.parentsPflags)
}
// updateParentsPflags updates c.parentsPflags by adding
// new persistent flags of all parents.
// If c.parentsPflags == nil, it makes new.
func (c *Command) updateParentsPflags() {
if c.parentsPflags == nil {
c.parentsPflags = flag.NewFlagSet(c.Name(), flag.ContinueOnError)
c.parentsPflags.SetOutput(c.flagErrorBuf)
c.parentsPflags.SortFlags = false
}
if c.globNormFunc != nil {
c.parentsPflags.SetNormalizeFunc(c.globNormFunc)
}
c.Root().PersistentFlags().AddFlagSet(flag.CommandLine)
c.VisitParents(func(parent *Command) {
c.parentsPflags.AddFlagSet(parent.PersistentFlags())
})
}
``` |
Naval Academy is a census-designated place (CDP) in Anne Arundel County, Maryland, United States, which covers the campus of the United States Naval Academy. The population was 4,802 at the 2010 census.
Geography
According to the United States Census Bureau, the CDP has a total area of , of which is land and , or 36.85%, is water.
Demographics
As of the census of 2000, there were 4,264 people, 249 households, and 225 families living in the CDP. The population density was . There were 263 housing units at an average density of . The racial makeup of the CDP was 87.10% White, 5.49% African American, 0.33% Native American, 2.95% Asian, 0.12% Pacific Islander, 1.83% from other races, and 2.18% from two or more races. Hispanic or Latino of any race were 6.94% of the population.
There were 249 households, out of which 65.1% had children under the age of 18 living with them, 87.1% were married couples living together, 2.4% had a female householder with no husband present, and 9.6% were non-families. 7.2% of all households were made up of individuals, and 1.2% had someone living alone who was 65 years of age or older. The average household size was 3.37 and the average family size was 3.56.
In the CDP, the population was spread out, with 8.0% under the age of 18, 80.5% from 18 to 24, 8.8% from 25 to 44, 2.4% from 45 to 64, and 0.3% who were 65 years of age or older. The median age was 21 years. For every 100 females, there were 373.3 males. For every 100 females age 18 and over, there were 436.8 males.
The median income for a household in the CDP was $63,333, and the median income for a family was $63,750. Males had a median income of $6,536 versus $6,585 for females. The per capita income for the CDP was $11,491. None of the population or families were below the poverty line.
References
Census-designated places in Anne Arundel County, Maryland
Census-designated places in Maryland |
```xml
/**
* @file App entry
* @module app/main
* @author Surmon <path_to_url
*/
import helmet from 'helmet'
import passport from 'passport'
import bodyParser from 'body-parser'
import cookieParser from 'cookie-parser'
import compression from 'compression'
import { NestFactory } from '@nestjs/core'
import { AppModule } from '@app/app.module'
import { HttpExceptionFilter } from '@app/filters/error.filter'
import { TransformInterceptor } from '@app/interceptors/transform.interceptor'
import { LoggingInterceptor } from '@app/interceptors/logging.interceptor'
import { ErrorInterceptor } from '@app/interceptors/error.interceptor'
import { environment, isProdEnv } from '@app/app.environment'
import logger from '@app/utils/logger'
import * as APP_CONFIG from '@app/app.config'
async function bootstrap() {
// MARK: keep logger enabled on dev env
const app = await NestFactory.create(AppModule, isProdEnv ? { logger: false } : {})
app.use(helmet())
app.use(compression())
app.use(cookieParser())
app.use(bodyParser.json({ limit: '1mb' }))
app.use(bodyParser.urlencoded({ extended: true }))
// MARK: Beware of upgrades!
// path_to_url#changed
app.use(passport.initialize())
app.useGlobalFilters(new HttpExceptionFilter())
app.useGlobalInterceptors(new TransformInterceptor(), new ErrorInterceptor(), new LoggingInterceptor())
// path_to_url#issuecomment-403212561
// path_to_url
// MARK: can't used!
// useContainer(app.select(AppModule), { fallbackOnErrors: true, fallback: true })
return await app.listen(APP_CONFIG.APP.PORT)
}
bootstrap().then(() => {
logger.success(
`${APP_CONFIG.APP.NAME} app is running!`,
`| env: ${environment}`,
`| port: ${APP_CONFIG.APP.PORT}`,
`| ${new Date().toLocaleString()}`
)
})
``` |
Forest Lake State High School (FLSHS) is a secondary state school located in Forest Lake, Queensland, Australia.
History
The school was opened in 2001, with only year 8. Year levels increased each year with the first cohort of year 12 students finishing their secondary education in 2005. FLSHS is an enrolment-managed school which means students, and their parents, must live in the school's catchment area to be eligible for enrolment. FLSHS has developed a strong reputation for academic and sporting excellence. In 2011, the school has about 1280 students enrolled in years 8–12.
Campus
The FLSHS campus consists of both indoor and outdoor sporting facilities, extensive computer laboratories and a high-class resource center that was built in partnership with the St. Johns Anglican College.
School system
To maintain a small school feel and provide opportunities to develop strong relationships between students and staff, the school operates as a separate middle school (years 7, 8 and 9) and senior school (years 10, 11 and 12). There are 3 deputy principals (middle school, senior school and operations) and a student coordinator in both the middle and senior school. 10 heads of department lead, manage and supervise the curriculum in their respective areas. The head of special education services and specially trained special education teachers develop and provide programs and services for the students with a disability who are enrolled at the school. There is also an Academic Program of Excellence program for students who pass testing during their last year of primary school (year 6).
Sport
The school has had numerous achievements in the sport at inter-school, district and Gala Day competitions. The school is known for its success in rugby league, soccer, volleyball, touch football, rugby union and netball. The school has also achieved awards in the annual cross country and athletics carnivals.
Notable alumni
Matt Srama, NRL rugby player
Anthony Milford, NRL rugby player
Joe Ofahengaue, NRL rugby player for the Brisbane Broncos
See also
List of schools in Queensland
References
External links
Official website
Public high schools in Brisbane
Educational institutions established in 2001
2001 establishments in Australia |
The George Brinton House, also known as Wawassan and Roundelay, is an historic home which is located in Birmingham Township, Chester County, Pennsylvania.
It was added to the National Register of Historic Places in 1990.
History and architectural features
Built circa 1830, the George Brinton House is a two-and-one-half-story, five-bay, double pile, late Federal-style fieldstone dwelling with a gable roof. Also located on the property are a contributing carriage barn with stables, small carriage house, and the ruins of a large stone bank barn.
During the Battle of Brandywine in September 1777, the property was the site where American gunners held an artillery position on high ground south of the house and exchanged fire with Hessian gunners across the Brandywine Creek.
It was added to the National Register of Historic Places in 1990.
References
Houses on the National Register of Historic Places in Pennsylvania
Federal architecture in Pennsylvania
Houses completed in 1830
Houses in Chester County, Pennsylvania
1830 establishments in Pennsylvania
National Register of Historic Places in Chester County, Pennsylvania |
The African smoky mouse or smokey heimyscus (Heimyscus fumosus) is a species of rodent in the family Muridae. It is the only species in the genus Heimyscus.
It is native to Central Africa, where it occurs in Cameroon, Central African Republic, Republic of the Congo, Democratic Republic of the Congo, Equatorial Guinea, and Gabon. It is a habitat specialist, living only in primary lowland forest. It is threatened by deforestation.
Notes
References
Old World rats and mice
Rodents of Africa
Mammals described in 1965
Taxonomy articles created by Polbot
Taxa named by Henri Heim de Balsac |
```kotlin
package mega.privacy.android.app.constants
class IntentConstants {
// Intent's Extras
companion object {
const val EXTRA_ACCOUNT_TYPE = "EXTRA_ACCOUNT_TYPE"
const val EXTRA_ASK_PERMISSIONS = "EXTRA_ASK_PERMISSIONS"
const val EXTRA_FIRST_LOGIN = "EXTRA_FIRST_LOGIN"
const val EXTRA_NEW_ACCOUNT = "EXTRA_NEW_ACCOUNT"
const val EXTRA_UPGRADE_ACCOUNT = "EXTRA_UPGRADE_ACCOUNT"
const val EXTRA_MASTER_KEY = "EXTRA_MASTER_KEY"
const val ACTION_OPEN_ACHIEVEMENTS = "ACTION_OPEN_ACHIEVEMENTS"
}
}
``` |
The faint young Sun paradox or faint young Sun problem describes the apparent contradiction between observations of liquid water early in Earth's history and the astrophysical expectation that the Sun's output would be only 70 percent as intense during that epoch as it is during the modern epoch. The paradox is this: with the young sun's output at only 70 percent of its current output, early Earth would be expected to be completely frozenbut early Earth seems to have had liquid water and supported life.
The issue was raised by astronomers Carl Sagan and George Mullen in 1972.
Proposed resolutions of this paradox have taken into account greenhouse effects, changes to planetary albedo, astrophysical influences, or combinations of these suggestions. It turned out that the greenhouse gas carbon dioxide contributed most.
Solar evolution
Models of stellar structure, esp. the standard solar model were already sufficiently evolved at that time to predict a brightening: It is due to the decrease in the number of particles per unit mass due to nuclear fusion in the Sun's core, from four protons and electrons each to one helium nucleus and two electrons. Fewer particles would exert less pressure. A collapse under the enormous gravity is prevented by an increase in temperature, which is both cause and effect of a higher rate of nuclear fusion. More recent modeling studies have shown that the Sun is currently 1.4 times brighter today than it was 4.6 billion years ago (Ga), and that the brightening has accelerated considerably. At the surface of the Sun, more fusion power means a higher solar luminosity (via slight increases in temperature and radius), which on Earth is termed radiative forcing.
Greenhouse gas solutions
Ammonia as a greenhouse gas
Sagan and Mullen even suggested during their descriptions of the paradox that it might be solved by high concentrations of ammonia gas, NH3. However, it has since been shown that while ammonia is an effective greenhouse gas, it is easily destroyed photochemically in the atmosphere and converted to nitrogen (N2) and hydrogen (H2) gases. It was suggested (again by Sagan) that a photochemical haze could have prevented this destruction of ammonia and allowed it to continue acting as a greenhouse gas during this time, however by 2001 this idea was tested using a photochemical model and discounted. Furthermore, such a haze is thought to have cooled Earth's surface beneath it and counteracted the greenhouse effect. Around 2010 scholars at the University of Colorado revived the idea, arguing that the ammonia hypothesis is a viable contributor if the haze formed a fractal pattern.
Carbon dioxide as a greenhouse gas
It is now thought that carbon dioxide was present in higher concentrations during this period of lower solar radiation. It was first proposed and tested as part of Earth's atmospheric evolution in the late 1970s. An atmosphere that contained about 1000 times the Present Atmospheric Level (or PAL) was found to be consistent with the evolutionary path of Earth's carbon cycle and solar evolution.
The primary mechanism for attaining such high CO2 concentrations is the carbon cycle. On large timescales, the inorganic branch of the carbon cycle, which is known as the carbonate–silicate cycle is responsible for determining the partitioning of CO2 between the atmosphere and the surface of Earth. In particular, during a time of low surface temperatures, rainfall and weathering rates would be reduced, allowing for the build-up of carbon dioxide in the atmosphere on timescales of 0.5 million years (Myr).
Specifically, using 1-D models, which represent Earth as a single point (instead of something that varies across 3 dimensions) scientists have determined that at 4.5 Ga, with a 30% dimmer Sun, a minimum partial pressure of 0.1 bar of CO2 is required to maintain an above-freezing surface temperature. At a maximum, 10 bar of CO2 has been suggested as a plausible upper limit.
The exact amount of carbon dioxide levels is still under debate, however. In 2001, Sleep and Zahnle suggested that increased weathering on the seafloor on a young, tectonically active Earth could have reduced carbon dioxide levels. Then in 2010, Rosing et al. analyzed marine sediments called banded iron formations (BIFs), and found large amounts of various iron-rich minerals, including magnetite (Fe3O4), an oxidized mineral alongside siderite (FeCO3), a reduced mineral and saw that they formed during the first half of Earth's history (and not afterward). The minerals' relative coexistence suggested an analogous balance between CO2 and H2. In the analysis, Rosing et al. connected the atmospheric H2 concentrations with regulation by biotic methanogenesis. Anaerobic, single-celled organisms that produced methane (CH4) may therefore have contributed to the warming in addition to carbon dioxide.
Other proposed explanations
Tidal heating
The moon was originally much closer to the Earth, which rotated faster than it does today, resulting in greater tidal heating than experienced today. Original estimates found that even early tidal heating would be minimal, perhaps 0.02 watts per square meter. (For comparison, the solar energy incident on the Earth's atmosphere is on the order of 1000 watts per square meter.) However, around 2021, a team led by René Heller in Germany argued that such estimates were simplistic, and that in some plausible models tidal heating might have contributed on the order of ten watts per square meter and increased the equilibrium temperature by up to five degrees Celsius on a timescale of a hundred million years. Such a contribution would partially resolve the paradox, but is insufficient to solve the faint young paradox on its own without additional factors such as greenhouse heating. The underlying assumption of Moon's formation just outside of the Roche limit is not certain, however: A magnetized disk of debris could have transported angular momentum leading to a less massive Moon in a higher orbit.
Cosmic rays
A minority view, propounded by the Israeli-American physicist Nir Shaviv, uses climatological influences of solar wind, combined with a hypothesis of Danish physicist Henrik Svensmark for a cooling effect of cosmic rays, to explain the paradox. According to Shaviv, the early Sun had emitted a stronger solar wind that produced a protective effect against cosmic rays. In that early age, a moderate greenhouse effect comparable to today's would have been sufficient to explain an ice-free Earth. Evidence for a more active early Sun has been found in meteorites.
The temperature minimum around 2.4 billion years goes along with a cosmic ray flux modulation by a variable star formation rate in the Milky Way. The reduced solar impact later results in a stronger impact of cosmic ray flux, which is hypothesized to lead to a relationship with climatological variations.
Mass loss from Sun
It has been proposed several times that mass loss from the faint young Sun in the form of stronger solar winds could have compensated for the low temperatures from greenhouse gas forcing. In this framework, the early Sun underwent an extended period of higher solar wind output. Based on exoplanetary data, this caused a mass loss from the Sun of 5−6 percent over its lifetime, resulting in a more consistent level of solar luminosity (as the early Sun had more mass, resulting in more energy output than was predicted). In order to explain the warm conditions in the Archean era, this mass loss must have occurred over an interval of about one billion years. Records of ion implantation from meteorites and lunar samples show that the elevated rate of solar wind flux only lasted for a period of 0.1 billion years. Observations of the young Sun-like star π1 Ursae Majoris match this rate of decline in the stellar wind output, suggesting that a higher mass loss rate can not by itself resolve the paradox.
Changes in clouds
If greenhouse gas concentrations did not compensate completely for the fainter sun, the moderate temperature range may be explained by a lower surface albedo. At the time, a smaller area of exposed continental land would have resulted in fewer cloud condensation nuclei both in the form of wind-blown dust and biogenic sources. A lower albedo allows a higher fraction of solar radiation to penetrate to the surface. Goldblatt and Zahnle (2011) investigated whether a change in cloud fraction could have been sufficiently warming and found that the net effect was equally as likely to have been negative as positive. At most the effect could have raised surface temperatures to just above freezing on average.
Another proposed mechanism of cloud cover reduction relates a decrease in cosmic rays during this time to reduced cloud fraction. However, this mechanism does not work for several reasons, including the fact that ions do not limit cloud formation as much as CCN, and cosmic rays have been found to have little impact on global mean temperature.
Clouds continue to be the dominant source of uncertainty in 3-D global climate models, and a consensus has yet to be reached on exactly how changes in cloud spatial patterns and cloud type may have affected Earth's climate during this time.
Local Hubble expansion
Although both simulations and direct measurements of effects of Hubble's law on gravitationally bound systems are returning inconclusive results as of 2022, it was noted that orbital expansion with a fraction of local Hubble expansion rate may explain the observed anomalies in orbital evolution, including a faint young Sun paradox.
Gaia hypothesis
The Gaia hypothesis holds that biological processes work to maintain a stable surface climate on Earth to maintain habitability through various negative feedback mechanisms. While organic processes, such as the organic carbon cycle, work to regulate dramatic climate changes, and that the surface of Earth has presumably remained habitable, this hypothesis has been criticized as intractable. Furthermore, life has existed on the surface of Earth through dramatic changes in climate, including Snowball Earth episodes. There are also strong and weak versions of the Gaia hypothesis, which has caused some tension in this research area.
On other planets
Mars
Mars has its own version of the faint young Sun paradox. Martian terrains show clear signs of past liquid water on the surface, including outflow channels, gullies, modified craters, and valley networks. These geomorphic features suggest Mars had an ocean on its surface and river networks that resemble current Earth's during the late Noachian (4.1–3.7 Ga). It is unclear how Mars's orbital pattern, which places it even further from the Sun, and the faintness of the young Sun could have produced what is thought to have been a very warm and wet climate on Mars. Scientists debate over which geomorphological features can be attributed to shorelines or other water flow markers and which can be ascribed to other mechanisms. Nevertheless, the geologic evidence, including observations of widespread fluvial erosion in the southern highlands, are generally consistent with an early warm and semi-arid climate.
Given the orbital and solar conditions of early Mars, a greenhouse effect would have been necessary to increase surface temperatures at least 65 K in order for these surface features to have been carved by flowing water. A much denser, CO2-dominated atmosphere has been proposed as a way to produce such a temperature increase. This would depend upon the carbon cycle and the rate of volcanism throughout the pre-Noachian and Noachian, which is not well known. Volatile outgassing is thought to have occurred during these periods.
One way to ascertain whether Mars possessed a thick CO2-rich atmosphere is to examine carbonate deposits. A primary sink for carbon in Earth's atmosphere is the carbonate–silicate cycle. However it would have been difficult for CO2 to have accumulated in the Martian atmosphere in this way because the greenhouse effect would have been outstripped by CO2 condensation.
A volcanically-outgassed CO2-H2 greenhouse is a plausible scenario suggested recently for early Mars. Intermittent bursts of methane may have been another possibility. Such greenhouse gas combinations appear necessary because carbon dioxide alone, even at pressures exceeding a few bar, cannot explain the temperatures required for the presence of surface liquid water on early Mars.
Venus
Venus's atmosphere is composed of 96% carbon dioxide, and during this time, billions of years ago, when the Sun was 25 to 30% dimmer, Venus's surface temperature could have been much cooler, and its climate could have resembled current Earth's, complete with a hydrological cycle – before it experienced a runaway greenhouse effect.
See also
Cool early Earth
Effective temperature – of a planet, dependent on reflectivity of its surface and clouds.
Isua Greenstone Belt
Paleoclimatology
Snowball Earth
Carbonate–silicate cycle
Gaia hypothesis
References
Further reading
Sun
Climate history
Paradoxes
1972 in science
Unsolved problems in astronomy |
The Jessica Simpson Collection is a fashion line of clothing and other items for women and juniors. Besides clothing, the brand also includes accessories, shoes, perfume and luggage. The brand initially launched in 2005 as a shoe collaboration with Nine West co-founder Vince Camuto. Due to the success that followed, Simpson began adding on, which resulted in the brand's current 22 different licenses.
As of December 2010, the brand is carried in 650 department stores across the United States, including upscale Lord & Taylor and Belk as well as Macy's and Dillard's. The collection earned $750 million in 2010, making it the top selling celebrity clothing empire. Simpson told New York magazine in February 2011, the reason her brand is so successful is because "When it comes to other celebrity brands, I think a lot of people do a great job, but it can't be all about them. Everybody doesn't want to just look like the celebrity, because they can't. They just want one element of that style." In 2015, the brand reached total sales of $1 billion.
On August 31, 2021, Jessica Simpson's parent company, Sequential Brands, filed for Chapter 11 bankruptcy protection.
References
External links
Jessica Simpson Collection Official Website
Clothing brands of the United States
2000s fashion
2010s fashion
American companies established in 2005
Clothing companies established in 2005
Companies that filed for Chapter 11 bankruptcy in 2021
Companies based in Los Angeles
Jessica Simpson |
Paul Haynes (born 1982) is an American former professional basketball player. After a six-year career spanning from 2004 to 2010, Haynes retired from the sport to pursue business in the Detroit, Michigan area.
Playing career
After graduating from Pontiac Northern High School in Pontiac, Michigan in 2000, Haynes attended Grambling State University to play for the Tigers. Haynes made an immediate impact as he averaged 13.9 points and 5.8 rebounds per game and was named the Southwestern Athletic Conference (SWAC) Freshman of the Year in 2001. His sophomore season in 2001–02 was his most successful. That year, he averaged career highs in points (20.2) and rebounds (8.4), finished first in the SWAC in scoring, first in double-doubles (10), second in rebounding, scored a career-high 40 points in a game and also recorded at least 20 points in 15 games. He was named the SWAC Player of the Year and became just the third Grambling State player to be honored as such. Although he never repeated as the conference's player of the year, Haynes did manage to become a three-time All-SWAC First Team member from 2002 through 2004. He finished his collegiate career with 1,958 points and 849 rebounds.
Haynes went undrafted in the 2004 NBA draft. From 2004 through 2010 he found himself playing for various semi-professional and professional basketball leagues. Haynes played in the Continental Basketball Association (Great Lakes Storm), International Basketball League (Marysville Meteors), Premier Basketball League (Detroit Panthers and Lake Michigan Admirals) as well as for TSV Troester Breitenguessbach in Germany.
References
1982 births
Living people
American expatriate basketball people in Germany
Forwards (basketball)
Grambling State Tigers men's basketball players
Sportspeople from Pontiac, Michigan
Basketball players from Oakland County, Michigan
People from Auburn Hills, Michigan
American men's basketball players |
Shockwave is a family of two jet-powered American trucks: Shockwave, a 1984 Peterbilt 359 truck tractor, and Super Shockwave, a 1957 Chevy truck. The original Shockwave truck was destroyed in a 2022 crash; the Super Shockwave truck continues to be used in performances under a different name.
Shockwave
"Shockwave" was the first of the Shockwave family of trucks. It still holds the world record for jet-powered full-sized trucks at .
The truck had three Westinghouse J34-48 jet engines, with a total output of , which allowed the truck to complete the quarter-mile in 6.63 seconds. Shockwave was driven by Chris Darnell, who used the truck to compete against planes going in a rolling drag race at airshows, often winning. It consumed fuel at a rate equal to 400 gallons per mile (940 liters per km), even more when the afterburners were activated. To slow the truck down at the end of a race, it needed two aircraft parachutes.
Crash
On July 2, 2022, at 1:10 p.m. EDT at the Battle Creek Field of Flight and Balloon Festival at Battle Creek Executive Airport in Battle Creek, Michigan, the Shockwave Jet Truck experienced a catastrophic rollover event following a mechanical failure, killing the driver Chris Darnell and destroying the truck. The performance involved Darnell racing against two inverted aircraft from a standing start while driving by a large pyrotechnic display, and had been successfully demonstrated by Darnell numerous times in the past. Video of the performance showed Darnell's truck outpacing one of the airplanes overhead and about to overtake another when his truck caught fire and appeared to roll. Darnell Motorsports owner and co-driver Neal Darnell, also father of Chris, attributed his son's crash to a mechanical failure, he said in a Facebook post that evening. Battle Creek police identified a blown tire as the likely cause of the crash.
Super Shockwave
"Super Shockwave" is the more recent of the Shockwave trucks. It has two Westinghouse J34-48 jet engines. The truck is built on a 1957 Chevy truck cab. In the full mile, the truck is able to reach .
Renaming
Super Shockwave was purchased from the Shockley family by Hayden Proffitt Racing and renamed "Hot Streak II". Les Shockley had obtained his start in racing through crewing for Hayden Proffitt, whose first jet car was named "Hot Streak I".
Gallery
References
External links
Trucks
Jet cars |
Ana Matnadze (; born 20 February 1983) is a Georgian-Spanish chess player. FIDE awarded her the titles Woman Grandmaster (WGM), in 2002, and International Master (IM), in 2006. Matnadze was European and world girls champion in her age category.
Chess career
Matnadze was introduced to chess at the age of four by her mother. She was trained by Grandmaster Nona Gaprindashvili, amongst others. She won the Georgian girls' championship in her age group four times (in 1992, 1993, 1994 and 1998). She won the European Youth Chess Championships in her age girls group five times, in Băile Herculane 1994, Verdun 1995, Tallinn 1997, Mureck 1998, and Litochoro 1999. Matnadze also won the World Youth Chess Championships twice, in the Girls U10 category in 1993 and in the Girls U14 in 1997.
Matnadze finished second, behind Regina Pokorná, in the European Junior Girls Championship in Patras 1999, and third, behind Jovanka Houska and Viktorija Cmilyte, in Avilés 2000. She jointly won the Black Sea Countries Women's Championship in Batumi 2000. Together with Maia Lomineishvili, Matnadze jointly won the Georgian Women's Championship in April 2002. In the same year, she won the European Women's Blitz Chess Championship in Antalya.
She played for Georgian teams NTN Tbilisi and Energy-Investi Sakartvelo in the European Club Cup for Women five times from 2002 to 2006. During that time she won two team gold medals and two individual silver (in İzmir 2004 and Saint-Vincent 2005), two team silver (in Rethymno 2003 and Fügen 2006), and the team bronze in Antalya 2002.
In June 2004, she and Lela Javakhishvili published a letter to FIDE, in which they criticized various aspects of the Women's World Chess Championship 2004, leading to a hostile dispute with FIDE Vice-President Zurab Azmaiparashvili. After initially cancelling her participation, Matnadze was later convinced to play in the event, but was eliminated by Olga Alexandrova in round one.
Matnadze moved to Barcelona and won the Catalan Women's Championship in Balaguer in 2006. She has been the women's champion of the Catalan Chess Circuit in 2008, 2009, 2010, and 2011. She won international tournaments in Mondariz-Balneario 2007, Las Palmas 2009, Tancat Sabadell (Women) 2010, and Benidorm (Women) 2011.
In March 2012, Matnadze transferred national federations to represent Spain. Since then she has played on the Spanish team in the Women's Chess Olympiad and in the Women's European Team Chess Championship. In 2018, she won an individual bronze medal playing board three in the Women's Olympiad in Batumi. Matnadze also won individual medals at the Women's European Team Championship in 2013 (silver on board three) and 2017 (bronze on board three).
She is a trainer at the chess club Associació d'Escacs Rubinenca in Barcelona, and in the InterAjedrez Academia. She plays in the teams Peona i Peó in Spain, Annemasse in France, Volksbank Halle in the German Bundesliga, and Ankara Demirspor Kulübü in Turkey. She is also involved in other chess activities in Catalonia.
Personal life
In 2003, Matnadze graduated from the Tbilisi Ivane Javakhishvili State University, Foreign Language and literature department, with a degree in philology (German language and literature). She knows seven languages, Georgian, Spanish, German, English, Russian, Portuguese, and Catalan.
She received the Grantee of the Foundation of the President of Georgia award in 1998 and 2003, and she was a holder of the scholarship stipend established by the President of Georgia in 2001.
Matnadze is dedicated to the support of international charities. she participated in events such as the chess tournament in Tbilisi to help flood victims in Western Georgia (2005), the charity tournament Chess Against Drugs in Tbilisi (2006), the exchange program Chess and Friendship in Georgia and Spain (2006), the exchange program Chess for peace and understanding in Georgia and Spain (2007), and the chess project We Play For Peace in Las Palmas de Gran Canaria (2009). Since 2005, she has been the President of the International Charity Movement Chess – A Peace Ambassador, a non-profit organisation which has already conducted many international chess and charity events.
Matnadze has a fascination with Vampires and is the main character in a book by Miguel Alvarez Morales, AnnA La Vampiresa (Spanish Edition) (2012, ).
She currently lives in Barcelona, Spain.
References
External links
1983 births
Living people
Chess International Masters
Chess woman grandmasters
Spanish chess players
Spanish female chess players
Female chess players from Georgia (country)
Chess players from Georgia (country)
Chess Olympiad competitors
People from Telavi
Tbilisi State University alumni
Expatriate sportspeople from Georgia (country) in Spain
World Youth Chess Champions
Emigrants from Georgia (country) to Spain
Naturalised citizens of Spain |
Italy competed at the 2011 World Aquatics Championships in Shanghai, China between July 16 and 31, 2011.
Medalists
Diving
Italy has qualified 9 athletes in diving.
Men
Women
Open water swimming
Men
Women
Mixed
Swimming
Italy qualified 26 swimmers.
Men
Women
Synchronised swimming
Italy has qualified 12 athletes in synchronised swimming.
Women
Water polo
Men
Team Roster
Stefano Tempesti – Captain
Amaurys Perez
Niccolo Gitto
Pietro Figlioli
Alex Giorgetti
Maurizio Felugo
Niccolo Figari
Valentino Gallo
Christian Presciutti
Deni Fiorentini
Matteo Aicardi
Arnaldo Deserti
Giacomo Pastorino
Group D
Quarterfinals
Semifinals
Gold medal game
Women
Team Roster
Giulia Gorlero
Simona Abbate
Elisa Casanova – Captain
Francesca Pomeri
Martina Savioli
Allegra Lapi
Marta Colaiocco
Roberta Bianconi
Giulia Enrica Emmolo
Giulia Rambaldi Guidasci
Aleksandra Cotti
Teresa Frassinetti
Elena Gigli
Group D
Quarterfinals
Semifinals
Bronze medal game
References
Nations at the 2011 World Aquatics Championships
World Aquatics
2011 |
Francis James Spaniel, Jr. (May 21, 1928 – October 25, 1994) was an American football halfback in the National Football League (NFL) for the Baltimore Colts and the Washington Redskins. He played college football at the University of Notre Dame and was drafted in the fifth round of the 1950 NFL Draft.
1928 births
1994 deaths
American football halfbacks
Baltimore Colts (1947–1950) players
Notre Dame Fighting Irish football players
Players of American football from Westmoreland County, Pennsylvania
Washington Redskins players |
```batchfile
"C:\Program Files\Unity\Editor\Unity.exe" -batchmode -quit -nographics -executeMethod "Batchmode.AndroidBuildTaiGuoWithGM" -logFile "d:\buildLog.txt" -projectPath "E:\HL_1.0.10Thailand"
``` |
E3 ubiquitin-protein ligase RING1 is an enzyme that in humans is encoded by the RING1 gene.
Function
This gene belongs to the RING finger family, members of which encode proteins characterized by a RING domain, a zinc-binding motif related to the zinc finger domain. The gene product can bind DNA and can act as a transcriptional repressor. It is associated with the multimeric polycomb group protein complex. The gene product interacts with the polycomb group proteins BMI1, EDR1, and CBX4, and colocalizes with these proteins in large nuclear domains. It interacts with the CBX4 protein via its glycine-rich C-terminal domain. The gene maps to the HLA class II region, where it is contiguous with the RING finger genes FABGL and HKE4.
Interactions
RING1 has been shown to interact with CBX8, BMI1 and RYBP.
References
Further reading
External links
Transcription factors |
Vladimir Tošić (also spelled Vladimir Tosic) (born 1949 in Belgrade, Yugoslavia) is a Serbian composer and visual artist. His works are generally composed according to very stringent minimal principles, which he refers to as "reductionist principles of composing."
Tošić teaches at the Faculty of Music in Belgrade, teaching counterpoint, harmony, and musical forms. He graduated with a composition degree from the same faculty, studying with Vasilije Mokranjac.
External links
1949 births
Living people
20th-century classical composers
Serbian composers
Academic staff of the University of Arts in Belgrade
University of Arts in Belgrade alumni
Male classical composers
20th-century male musicians |
Irina Ivanova (born 19 April 1996) is a Russian athlete. She competed in the women's pole vault event at the 2019 World Athletics Championships.
References
External links
1996 births
Living people
Russian female pole vaulters
Place of birth missing (living people)
Authorised Neutral Athletes at the World Athletics Championships
21st-century Russian women |
Just right may refer to:
"Just right", a repeated observation by Goldilocks in "Goldilocks and the Three Bears"
Just Right, a breakfast cereal brand
Just Right (EP), by Got7, 2015
"Just Right", a song by Raheem DeVaughn, 2019
See also
Special Times Just Right (1997–2012), a prize-winning Bichon Frise
Volume III: Just Right, a 1992 album by Soul II Soul |
Oriyan Thoonda Oriyagapuji is an Indian Tulu-language comedy film directed by H.S. Rajshekhar starring Arjun Kapikad, Prajwal Pooviah in the lead roles and Bhojaraj Vamanjoor, Aravind Bolar, Rekhadas, Mitra, Chethan Rai, Sunder Rai, Saikrishna in supporting roles. Oriyan Thoonda Oriyagapuji is produced by Gangadhar Shetty and Ashok Kumar under the banner of Sri Mangala Ganesh Combines. The movie was released on 15 May 2015.
Cast
Arjun Kapikad
Prajwal Pooviah
Bhojaraj Vamanjoor
Aravind Bolar
Rekhadas
Mitra
Chethan Rai
Sunder Rai
Saikrishna
Soundtrack
The soundtracks of the film were composed by V.Manohar
List of Tulu Movies
List of tulu films of 2015
List of Tulu films of 2014
List of Released Tulu films
Tulu cinema
References
External links
2015 films |
The 2005 UEFA Cup Final was the final match of the 2004–05 UEFA Cup, the 34th season of the UEFA Cup, UEFA's second-tier club football tournament. The match was contested by Sporting CP and CSKA Moscow; CSKA won the match 3–1. Sporting CP opened the scoring in the first half from full-back Rogério, before Aleksei Berezutskiy equalised in the second half. Yuri Zhirkov would give the Russian side the lead nine minutes after CSKA's equalising goal, and the Moscow outfit would close out the scoring 15 minutes from the end after a quick CSKA counterattack saw Vágner Love become the youngest player to score in a UEFA Cup final at the age of , firing the ball past Sporting goalkeeper Ricardo to give the Russian side a first UEFA Cup trophy.
The match was played at the Estádio José Alvalade – home ground of finalists Sporting CP – in Lisbon, Portugal, on 18 May 2005. Until then, it was the third European football final to be held in Portugal, after the 1967 European Cup Final, which was held in another Lisbon venue, the Estádio Nacional, and the 1992 European Cup Winners' Cup Final, which was held at the Estádio da Luz.
Venue
José Alvalade Stadium was announced as the final venue on 5 February 2004, following the decision of the UEFA Executive Committee meeting in Nyon, Switzerland.
Route to the final
Match
Details
See also
2004–05 UEFA Cup
2004–05 UEFA Champions League
2005 UEFA Champions League Final
2005 UEFA Super Cup
PFC CSKA Moscow in European football
Sporting CP in European football
References
External links
2004–05 season at UEFA.com
Final
International club association football competitions hosted by Portugal
UEFA Cup Final 2005
UEFA Cup Final 2005
UEFA Cup Final 2005
2005
Uefa
2004–05 in Portuguese football
2000s in Lisbon
May 2005 sports events in Europe |
The Green and Red of Mayo is a song by the Saw Doctors. It first appeared on the album All the Way from Tuam in 1992.
It is an unofficial ballad of Mayo county football team supporters.
See also
Mayo GAA
The Saw Doctors
References
1992 songs
Mayo GAA |
The Ria Bridge is a rigid frame bridge with V-shaped legs and a box girder road bridge that crosses the Ria de Pontevedra in the city of Pontevedra, Spain. It is part of the AP-9 motorway and was opened in 1992.
Location
The bridge is located between the Mollavao neighbourhood in Pontevedra and the place called A Puntada (in the neighbouring municipality of Poio). It is located in the western part of the city, which opens onto the sea, in the estuary formed by the mouth of the Lérez river in the ria de Pontevedra.
History
Work on the bridge began on 21 December 1989 for the AP-9 motorway and as part of the city's western bypass.
It was designed by the engineers Leonardo Fernández Troyano, Javier Manterola Armisén and Amando López Padilla. Construction began with the central pier (the bridge's reference pier) and a construction method based on cantilever construction using temporary cable-stays. The bridge was inaugurated on 25 March 1992.
The construction and opening of the bridge was controversial because of its impact on the landscape and the significant change in the city's views to the sea. The name "Ria Bridge" was given to it by Audasa, the concessionary company of the AP-9 motorway.
Description
It is a 700-metre long bridge with two independent carriageways, made of prestressed concrete for the deck and reinforced concrete for the piers and abutments.
It is a motorway bridge with twin V-shaped piers as the only intermediate support in its central part, whose foundations lie in the centre of the bed of the Ria de Pontevedra. It is divided into three different sections. The intermediate section has two main spans of 120 m in length with a box girder of variable depth. A seagull solution was adopted for the shape of the deck: it has a maximum flange on the central pier, which decreases towards the side piers of the 120-metre spans, reaching the minimum flange near them. The side spans of the bridge are 40 m long with a constant depth box girder. The spans at both ends of the bridge form the bridge access viaducts. The piers of the southern section of the viaduct pass over a small section of the Pontevedra seafront promenade.
The Ría bridge is toll-free and serves as a western bypass between the north and south of the city of Pontevedra, in the section between the O Pino neighbourhood and the fire station. Around 50,000 vehicles cross the bridge every day.
Gallery
References
See also
Bibliography
Related articles
Barca Bridge
Currents Bridge
Burgo Bridge
Santiago Bridge
Tirantes Bridge
External links
Ponte da Ria on the website Structurae
Road bridges in Spain
Bridges completed in 1992
Bridges in Spain by river
Box girder bridges
Bridges in Pontevedra
Buildings and structures in Pontevedra
Bridges over the Lérez River
Transport in Galicia (Spain) |
Biagio Abrate, Knight Grand Cross (born 8 November 1949) is a retired Italian general who served as Chief of Defence Staff.
Life and career
Born in Sant'Albano Stura, he was admitted at Military Academy of Modena and he graduated with the rank of tenente in 1974.
From 1975 to 1979 he held the posts of platoon and company commander in various battalion of mountain infantry, from 1979 he held a position at the Alpini Formation Center in Aosta.
From 1987 to 1990 he had his staff assignment and from 1990 to 1992 he led Bassano alpine infantry battalion in Innichen. After other staff duties he led Alpine Brigade Taurinense from 1998 to 2000, from July to November 2000 he led Multinational Brigade West in Kosovo.
From 2001 to 2007 he led the staff of Italian Minister of Defence serving under 3 different ministers. In 2007 he was named head of the Italian procurement defence agency. In 2010 the Italian president Giorgio Napolitano following the advice of the council of ministers named Abrate Chief of the Defence Staff.
Honour
: Knight Grand Cross of the Order of Merit of the Italian Republic (10 february 2010)
References
|-
Italian generals
1949 births
Living people
Chiefs of Defence Staff (Italy)
People from the Province of Cuneo
Knights Grand Cross of the Order of Merit of the Italian Republic |
James Deon Lamont, also credited as J.D. Lamont, (born 15 June 1982) is a BAFTA and EMMY winning British screenwriter and producer known for his frequent writing collaborations with Jon Foster. and for writing the 'Paddington meets the Queen' sketch for the Platinum Jubilee
Career
Television & film work
James Lamont and Jon Foster are currently writing Paddington 3, after having worked on the two previous movies Paddington and Paddington 2.
In 2021 Lamont and Foster worked with Jimmy Fallon on the NBC special '5 More Sleeps 'Till Christmas' which was an adaptation of Fallon's book of the same title.
Alongside writing partner Foster, Lamont wrote the Cartoon Network animated series The Amazing World of Gumball' for which he won a BAFTA Children's Award in 2011 and 2012. '. They left the show shortly into the third season.
In 2019, he co-developed the animated television series The Adventures of Paddington along with Foster for which the pair won an EMMY. The show premiered on Gulli, M6, and Piwi+ in France, Nick Jr. in the UK, and Nickelodeon internationally and he will direct the third film with Foster.
In 2016 the pair wrote and created their own E4 sitcom 'WASTED' featuring Sean Bean
Lamont and Foster wrote episodes for 'Cuckoo' a BBC sitcom featuring Greg Davies.
In 2013 the pair wrote The Harry Hill Movie'', along with Harry Hill.
Online
Lamont has written and performed for various online productions such as "Ted or Dead" for Channel Flip, "Dom Jolly's Joy Stick", Dawn Porter's Bad Girls Guides, "Ashen's Tech Dump", "Normal Activity", "Sleep Terrorist" and "Big Noises". He worked on a 30-minute webisode for Kit Kat Chunky in 2012.
Awards
Lamont, along with Jon Foster, won the 2011 and 2012 British Academy Children's Award for writing on The Amazing world of Gumball.
They also won the EMMY for The Adventures of Paddington
References
External links
1982 births
Living people
English writers
English television writers
English screenwriters
English male screenwriters
British male television writers |
```c
/*
===========================================================================
This file is part of Quake III Arena source code.
Quake III Arena source code is free software; you can redistribute it
or (at your option) any later version.
Quake III Arena source code is distributed in the hope that it will be
useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with Quake III Arena source code; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
===========================================================================
*/
//
//
// g_mem.c
//
#include "g_local.h"
#define POOLSIZE (256 * 1024)
static char memoryPool[POOLSIZE];
static int allocPoint;
void *G_Alloc( int size ) {
char *p;
if ( g_debugAlloc.integer ) {
G_Printf( "G_Alloc of %i bytes (%i left)\n", size, POOLSIZE - allocPoint - ( ( size + 31 ) & ~31 ) );
}
if ( allocPoint + size > POOLSIZE ) {
G_Error( "G_Alloc: failed on allocation of %i bytes", size );
return NULL;
}
p = &memoryPool[allocPoint];
allocPoint += ( size + 31 ) & ~31;
return p;
}
void G_InitMemory( void ) {
allocPoint = 0;
}
void Svcmd_GameMem_f( void ) {
G_Printf( "Game memory status: %i out of %i bytes allocated\n", allocPoint, POOLSIZE );
}
``` |
Cheuk Yuen Victoria Poon (Chinese name 潘卓源) (born October 12, 1984) is a Canadian competitive swimmer who specialises in freestyle events. She was born in Hong Kong. She moved to Canada when she was 11 years old. She lives in the LaSalle borough of Montreal, Quebec. She is the former national record holder in the women's 50m freestyle, with a time of 24.75s.
Career
Poon's long time swim club has been the Club de natation Calac de LaSalle.
In 2005, Poon set the Canadian national record for women's 50-metre freestyle, at 25.52 seconds.
Poon competed at the 2006 Commonwealth Games, and won a bronze with the Canadian team in the women's 4x100-metre freestyle relay.
In the April 2008 Canadian Olympic Trials, Poon lowered her Canadian record for women's 50-metre freestyle to 25.47 seconds, which she has set in 2005. At the 2008 Canadian Summer Open Nationals, she finished 3rd in the women's 50m freestyle event, behind Jennifer Carroll (2nd) and Jen Beckberger (1st).
Poon competed at the 2008 Summer Olympics and finished 30th in the women's 50-metre freestyle event.
In 2009, Poon set the women's 50-metre freestyle Canadian record at 24.75 seconds.
On 19 June 2009, Poon set a new Canadian record for the women's 50m butterfly, of 26.71s, at the Canada Cup of swimming; besting the record set Shona Kitson in 2000 of 27.17s. At that time, Poon was coached by Benoît Lebrun, of the Club de natation des piscines du Parc olympique (CNPPO; literally, Olympic Park Swimming Pools Swim Club).
At the 2010 Canada Cup of Swimming, short course, Poon won gold for the women's 100-metre freestyle, and 50-metre butterfly. At the time, she was also the Canadian national record holder for those two events.
At the 2010 World Swimming Championships, short course, Poon set and then bettered the Canadian national record for women's 100-metre freestyle. She set a new record on 16 December 2010 of 52.76 seconds in the semi-finals. On December 17, 2010, in the finals, she reset it to 52.51 seconds, and managed to finish fifth. In the 50m freestyle, she lowered her own Canadian record to 29.14s. She ended with a 7th-place ranking.
In the March 2011 Canadian World Championship Trials, Poon finished second, behind Julia Wilkinson, in the women's 100m freestyle race.
Poon competed at the 2012 Summer Olympics and finished 16th in the women's 50-metre freestyle event.
Personal bests
See also
List of World Aquatics Championships medalists in swimming (women)
List of Commonwealth Games medallists in swimming (women)
World record progression 4 × 100 metres medley relay
References
1984 births
Living people
Canadian female freestyle swimmers
Hong Kong emigrants to Canada
Olympic swimmers for Canada
People from LaSalle, Quebec
Swimmers from Montreal
Swimmers at the 2006 Commonwealth Games
Swimmers at the 2008 Summer Olympics
Swimmers at the 2012 Summer Olympics
Swimmers at the 2014 Commonwealth Games
World Aquatics Championships medalists in swimming
Commonwealth Games bronze medallists for Canada
Commonwealth Games medallists in swimming
Medallists at the 2006 Commonwealth Games
Medallists at the 2014 Commonwealth Games |
Bealiba is a town in the Australian state of Victoria. The town is located in the Central Goldfields Shire local government area, north-west of the state capital, Melbourne, and from the regional city of Bendigo. At the , Bealiba and the surrounding area had a population of 300.
The first Europeans in the Bealiba area were drovers in the 1840s and in 1845 George Coutts was the first European permanent settler. In the midst of the Victorian gold rush, gold was discovered in Bealiba in 1856 and for 18 months the town grew to a population of 18,000. After the rush subsided, the area was opened up for selection by farmers.
Facilities in Bealiba include a post office and general store. The town is home to many historic buildings including the pub (built in 1857) and the Town Hall (built in 1879). However, the pub was closed in 2016 by new owners after 12 months ownership.
Bealiba railway station, on the Mildura railway line opened in 1878. It closed in 1981 under the New Deal reorganisation of country rail services.
The Bealiba Court of Petty Sessions closed on 1 August 1968.
Bealiba shares an Australian rules football team with nearby Natte Yallock—the Natte Bealiba Swans—who compete in the Maryborough Castlemaine District Football League.
References
External links
Towns in Victoria (state) |
Gregorio Fontana-Rava (fl. 1830s) was an Italian expatriate supporter of the Risorgimento.
Little is known of his life but he ran a bookshop in Antwerp as a meeting place for Italian patriots. His visit to England in 1833, during which he lectured, in association with Gioacchino Prati, caused some public alarm at his radical views.
Bibliography
Robson, A. P. & Robson, J. M. (eds) (1986) The Collected Works of John Stuart Mill, Volume XXIII - Newspaper Writings August 1831 - October 1834 Part II, Toronto: London: Routledge and Kegan Paul, "234. 'Fontana and Prati's St. Simonism in London', Examiner, 2 Feb., 1834, pp68-9"
Italian revolutionaries
Year of birth unknown
Year of death unknown |
Arvelia Myers (25 February 1927 – October 25, 2017) was an American tennis player, wife, mother, coach, entrepreneur, and activist. After excelling in the sport, she founded Pyramid Tennis, the first female-owned, African-American tennis program, in Harlem which served youth for over forty years. She was known in her community as the "mother of Harlem tennis" and was often referred to as a pioneer and activist because of the measures she took to protect her program.
Early life
Arvelia Myers was born February 25, 1927, in Sunflower, Mississippi to Alexander Cage, a preacher, and Irene (née Fields). Mrs Cage, a widow, relocated the family to Memphis, Tennessee when Arvelia was seven-years-old. Eight years later, at fifteen, Arvelia married Willie Calvin Cole, and from that union, Olivia Cole was born (who rose to become an Emmy Award-winning actress for her role in "Roots"). In 1944, seventeen-year-old Arvelia moved to the Bronx, New York with her two-year-old daughter. An aunt who already lived there helped her with living arrangements in the Bronx.[2] However, she did not stay there long. Despite family members' objections, Arvelia relocated to Harlem and never left. She chose Mount Morris Presbyterian as her church home, where she served as an usher. There she found babysitting support and more. Arvelia told a tennis historian, "A young man whom I met at the Mt. Morris Church introduced me to tennis." That man, Raymond Mitchell, became her husband, in 1956, and both of them were often seen on community tennis courts perfecting their game.
In 1972, at 45-years-old, Arvelia attained a General Equivalency Diploma. Twelve years later, in 1984, at 57-years-old, she graduated from Columbia University School of General Studies with a B.A. degree in English.
Tennis career
During Arvelia's tennis playing days, Jim Crow laws prohibited Blacks from competing in the United States Tennis Lawn Association tournaments, so they played on the American Tennis Association (ATA) circuit, "the only game in town," according to Arthur Ashe. Arvelia traveled on weekends to ATA tournaments on Black college campuses such as Hampton University in Virginia, Central State University in Ohio, or the Shady Rest Country Club in New Jersey. On the ATA circuit in the 1960s, Olivia was ranked as high as number three as a singles player and won doubles championship honors.
Entrepreneurship
After having worked with Claude Cargill's and Bill Brown's Harlem Junior Tennis and Education Program (HJTEP) at the Harlem Armory, in 1973, Arvelia founded Pyramid Tennis, the first black female-owned tennis and education program in Harlem. Through this program, she provided tennis instruction, tennis balls, rackets, court time, and entry fees for tournaments. She recognized that for many the cost of each item was an impediment to participating in the sport. Her program eliminated that obstacle widening accessibility to a broader audience. During the summers, Pyramid Tennis conducted an outdoor junior tennis program at Fred Johnson's Park in Manhattan (150th Street and Seventh Avenue) and during the winters, an indoor program at the 369th Armory in Harlem (2366 5th Avenue).
Through her program, participants learned the game and the discipline required for success on the court, the classroom, and in life.
Besides the above, Arvelia partnered with City College and Columbia University as coach of their respective tennis teams and with Riverbank State Park as a youth tennis instructor. The United States Tennis Association Eastern New York Division acknowledged Myers as a "gamechanger" who promoted tennis throughout the region.
Activism
The HJTEP converted the drill floor of the 369 Regiment Armory (142nd Street and 5th Avenue in Harlem) into eight tennis courts serving a wide range of sports enthusiasts. Myers regularly reserved four of those courts to conduct her Pyramid program. In 1985, when the homeless population rose in New York City, and officials decided the drill floor at the armory was the solution, Arvelia's program was in jeopardy. She appealed to the governor and city officials to devise an alternate solution, but that did not occur until David Dinkins was elected mayor. She was forced into activist mode again when the leadership at the armory decided they could increase their revenue by renting the armory to a concessionaire who could generate more funds, again jeopardizing Pyramid Tennis and other tennis programs at the site. Myers organized a coalition named the Friends of Harlem Tennis, educated the community, and pressured politicians and other stakeholders to award the contract to organizations more tennis-friendly.
The American Tennis Association (ATA) existed because no other tennis community welcomed early players of the game and thrived in this environment. Althea Gibson, Arthur Ashe, and Bob Ryland are among the notable few who honed their game on the ATA circuit.
Arvelia Myers was another player who competed under the banner of the ATA and elevated her game as a ranked competitor. She maintained her connection to the group and served as a member of the Board of Directors after her competitive days ended.
She grew to become protective of the organization and strove to ensure the ATA maintained its vision, value, and commitment to developing junior tennis players.
Although Myers was a stalwart of the ATA, she was also a staunch supporter of the United States Tennis Association (USTA). She received numerous awards for her voluntary service at the US Open and as secretary of the USTA Eastern Division. However, she always maintained that they were distinct brands. "It's like Avis and Hertz. You should never put the two together," she often said.
Death
On October 25, 2017, Arvelia Myers died while in Jacobs Nursing Home in The Bronx, New York.
Awards and acknowledgements
Myers was listed in Columbia University's 'Unsung Heroes' in their Legacy of Leadership bulletin because she made "a difference in New York City, going about [her] important work each day with little publicity". Some did notice her work, however, as her numerous awards for dedication and service prove: Harlem Junior Tennis Program Appreciation Award, USTA Community Service Award, Arthur Ashe Special Service Award, ATA Outstanding Service Award, No Ad Pioneer Award, Harlem Week/Greater Harlem Chamber of Commerce-Community Service Award, the USTA 10-year Volunteer Service Award, the ETA Louise Cilla Award, the Arvelia Myers service award, and others. She was inducted into the Black Tennis Hall of Fame posthumously on June 22, 2019.
References
1927 births
2017 deaths
African-American female tennis players
People from Sunflower, Mississippi
20th-century African-American sportspeople
21st-century African-American people
20th-century African-American women
20th-century African-American people
21st-century African-American women |
```smalltalk
using Microsoft.Xna.Framework.Graphics;
using Microsoft.Xna.Framework;
namespace Nez
{
public class WaterReflectionEffect : ReflectionEffect
{
/// <summary>
/// defaults to 0.015. Waves are calculated by sampling the normal map twice. Any values generated that are sparkleIntensity greater
/// than the actual uv value at the place of sampling will be colored sparkleColor.
/// </summary>
/// <value>The sparkle intensity.</value>
public float SparkleIntensity
{
set => _sparkleIntensityParam.SetValue(value);
}
/// <summary>
/// the color for the sparkly wave peaks
/// </summary>
/// <value>The color of the sparkle.</value>
public Vector3 SparkleColor
{
set => _sparkleColorParam.SetValue(value);
}
/// <summary>
/// position in screen space of the top of the water plane
/// </summary>
/// <value>The screen space vertical offset.</value>
public float ScreenSpaceVerticalOffset
{
set => _screenSpaceVerticalOffsetParam.SetValue(Mathf.Map(value, 0, 1, -1, 1));
}
/// <summary>
/// defaults to 0.3. intensity of the perspective correction
/// </summary>
/// <value>The perspective correction intensity.</value>
public float PerspectiveCorrectionIntensity
{
set => _perspectiveCorrectionIntensityParam.SetValue(value);
}
/// <summary>
/// defaults to 2. speed that the first displacment/normal uv is scrolled
/// </summary>
/// <value>The first displacement speed.</value>
public float FirstDisplacementSpeed
{
set => _firstDisplacementSpeedParam.SetValue(value / 100);
}
/// <summary>
/// defaults to 6. speed that the second displacment/normal uv is scrolled
/// </summary>
/// <value>The second displacement speed.</value>
public float SecondDisplacementSpeed
{
set => _secondDisplacementSpeedParam.SetValue(value / 100);
}
/// <summary>
/// defaults to 3. the normal map is sampled twice then combined. The 2nd sampling is scaled by this value.
/// </summary>
/// <value>The second displacement scale.</value>
public float SecondDisplacementScale
{
set => _secondDisplacementScaleParam.SetValue(value);
}
const float _sparkleIntensity = 0.015f;
const float _perspectiveCorrectionIntensity = 0.3f;
const float _reflectionIntensity = 0.85f;
const float _normalMagnitude = 0.03f;
const float _firstDisplacementSpeed = 6f;
const float _secondDisplacementSpeed = 2f;
const float _secondDisplacementScale = 3f;
EffectParameter _timeParam;
EffectParameter _sparkleIntensityParam;
EffectParameter _sparkleColorParam;
EffectParameter _screenSpaceVerticalOffsetParam;
EffectParameter _perspectiveCorrectionIntensityParam;
EffectParameter _firstDisplacementSpeedParam;
EffectParameter _secondDisplacementSpeedParam;
EffectParameter _secondDisplacementScaleParam;
public WaterReflectionEffect() : base()
{
CurrentTechnique = Techniques["WaterReflectionTechnique"];
_timeParam = Parameters["_time"];
_sparkleIntensityParam = Parameters["_sparkleIntensity"];
_sparkleColorParam = Parameters["_sparkleColor"];
_screenSpaceVerticalOffsetParam = Parameters["_screenSpaceVerticalOffset"];
_perspectiveCorrectionIntensityParam = Parameters["_perspectiveCorrectionIntensity"];
_firstDisplacementSpeedParam = Parameters["_firstDisplacementSpeed"];
_secondDisplacementSpeedParam = Parameters["_secondDisplacementSpeed"];
_secondDisplacementScaleParam = Parameters["_secondDisplacementScale"];
_sparkleIntensityParam.SetValue(_sparkleIntensity);
_sparkleColorParam.SetValue(Vector3.One);
_perspectiveCorrectionIntensityParam.SetValue(_perspectiveCorrectionIntensity);
FirstDisplacementSpeed = _firstDisplacementSpeed;
SecondDisplacementSpeed = _secondDisplacementSpeed;
_secondDisplacementScaleParam.SetValue(_secondDisplacementScale);
// override some defaults from the ReflectionEffect
ReflectionIntensity = _reflectionIntensity;
NormalMagnitude = _normalMagnitude;
}
protected override void OnApply()
{
_timeParam.SetValue(Time.TotalTime);
}
}
}
``` |
Dread is a horror RPG designed by Epidiah Ravachol and Nathaniel Barmore, and published by The Impossible Dream. The game uses a Jenga tower for action resolution.
The game
Dread is a horror game, commonly played as a one-shot at conventions. It can also be used for ongoing gaming, though in practice this is less common. In order to play you need:
One Jenga tower or equivalent
3-6 players
3–5 hours (can be extended to multiple sessions of similar length)
A prepared adventure and character sheets
The setting
Dread has no fixed setting - instead you can use it for any horror setting where it is expected that most of the characters will not survive through the session. The examples in the Dread rulebook are Beneath A Full Moon - survival horror, Beneath A Metal Sky - sci-fi, and Beneath The Mask - based on a slasher film and in which not even the GM knows which of the PCs is the killer at the start (they all have reasons to not know they are).
Character creation involves each character in the game being assigned a part (in Beneath the Mask there are the Jock, the Head Cheerleader, the Nerd, the Slacker, the Rich Kid, and the Best Friend) and each part coming with about a dozen questions, the final one being "What is your name?" Most of the questions are deliberately loaded, for example "Why do you intend to convince the others to split up whenever the opportunity arises, despite the recent events?"
System
When you try to take a challenging action, pull one or more blocks from the tower, as dictated by the Gamemaster. If you pull and succeed, you succeed in your action. If you knock the tower over, your player character is out of the game, usually due to dying. If there is no sensible narrative way for that to happen (for instance a knock over by spilling your drink) they are the "walking dead," unable to pull any more blocks and subject to death or removal at the next plausible or dramatic opportunity. Removing more blocks makes actions more difficult to perform, which causes a feeling of suspense.
Reception
Dread was the winner of the 2006 ENNIE Awards for Innovation as well as being nominated for Best Game and Best Rules.
In May 2015, Dread was featured as a two-part episode on TableTop. Wil Wheaton praised Dread's "very innovative device to build up tension and really put the scare in players". In March 2019, Dread and its co-creator Epidiah Ravachol were featured on the ProudGamers podcast, The ProudTable, and Epidiah spoke about his inspirations behind the game.
Dread’s use of a Jenga tower to heighten narrative tension in a role-playing game later inspired the same game mechanic in the romance game Star Crossed by Alex Roberts (game designer), which won a Diana Jones Award.
Reviews of the game praise the "lethal suspense" of the game and its innovation, but note that it's useful only for horror gaming and one shot games.
Charlie Hall for Polygon pointed out similar rising tension in Dread and Ten Candles.
References
External links
ENnies winners
Horror role-playing games
Indie role-playing games
Open-source tabletop games
Role-playing games introduced in 2005 |
```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.
*/
package org.flowable.cmmn.converter.export;
import javax.xml.stream.XMLStreamWriter;
import org.apache.commons.lang3.StringUtils;
import org.flowable.cmmn.converter.CmmnXmlConstants;
import org.flowable.cmmn.model.CmmnModel;
import org.flowable.cmmn.model.ReactivateEventListener;
import org.flowable.cmmn.model.ReactivationRule;
/**
* Exports a reactivation event listener and all of its attributes and elements.
*
* @author Micha Kiener
*/
public class ReactivationEventListenerExport extends AbstractPlanItemDefinitionExport<ReactivateEventListener> {
@Override
protected Class<? extends ReactivateEventListener> getExportablePlanItemDefinitionClass() {
return ReactivateEventListener.class;
}
@Override
protected String getPlanItemDefinitionXmlElementValue(ReactivateEventListener reactivationEventListener) {
return ELEMENT_GENERIC_EVENT_LISTENER;
}
@Override
protected void writePlanItemDefinitionSpecificAttributes(ReactivateEventListener reactivationEventListener, XMLStreamWriter xtw) throws Exception {
super.writePlanItemDefinitionSpecificAttributes(reactivationEventListener, xtw);
xtw.writeAttribute(FLOWABLE_EXTENSIONS_NAMESPACE, CmmnXmlConstants.ATTRIBUTE_EVENT_LISTENER_TYPE, "reactivate");
if (StringUtils.isNotEmpty(reactivationEventListener.getAvailableConditionExpression())) {
xtw.writeAttribute(FLOWABLE_EXTENSIONS_NAMESPACE,
CmmnXmlConstants.ATTRIBUTE_EVENT_LISTENER_AVAILABLE_CONDITION,
reactivationEventListener.getAvailableConditionExpression());
}
}
@Override
protected boolean writePlanItemDefinitionExtensionElements(CmmnModel model, ReactivateEventListener reactivationEventListener, boolean didWriteExtensionElement, XMLStreamWriter xtw) throws Exception {
boolean extensionElementsWritten = super.writePlanItemDefinitionExtensionElements(model, reactivationEventListener, didWriteExtensionElement, xtw);
ReactivationRule reactivationRule = reactivationEventListener.getDefaultReactivationRule();
if (reactivationRule != null) {
if (!extensionElementsWritten) {
xtw.writeStartElement(CmmnXmlConstants.ELEMENT_EXTENSION_ELEMENTS);
extensionElementsWritten = true;
}
xtw.writeStartElement(FLOWABLE_EXTENSIONS_PREFIX, ELEMENT_DEFAULT_REACTIVATION_RULE, FLOWABLE_EXTENSIONS_NAMESPACE);
PlanItemControlExport.writeReactivationRuleAttributes(reactivationRule, xtw);
xtw.writeEndElement();
}
return extensionElementsWritten;
}
}
``` |
Piesienica is a village in the administrative district of Gmina Zblewo, within Starogard County, Pomeranian Voivodeship, in northern Poland. It lies approximately north-east of Zblewo, west of Starogard Gdański, and south of the regional capital Gdańsk.
For details of the history of the region, see History of Pomerania.
References
Piesienica |
Henry Lascelles Carr (1841 – 5 October 1902), known as Lascelles Carr, was a British newspaper proprietor and businessman. Born in Yorkshire, Carr relocated to South Wales where he became a journalist. Carr became editor of the Western Mail and later its owner, before buying the London-based News of the World. Carr was also the Chairman of the Cardiff-based Royal Hotel Company and was a city councillor.
Career
Carr was born in the town of Knottingley, Yorkshire in 1841 a son of Reverend James B. Carr, a Wesleyan minister. He was educated at Kingswood School in Bath, and as an adult trained firstly as an accountant before spending a single year at Richmond College where he served as the editor of the college magazine. From Richmond he entered St Aidan's Anglican training College, but upon graduating Carr decided to follow a path as a journalist rather than entering the priesthood. He then worked for a few years as a journalist for the Liverpool Daily Post. By 1869 Carr was living in Wales, and when John Crichton-Stuart, 3rd Marquess of Bute founded the Western Mail in Cardiff that year, he made Carr its first sub-editor. The 1871 Census records Carr as living in Roath while married to Mary Ann Carr, who had been born in County Westmeath, Ireland; they had a single child, Loftus Lascelles, a son aged six, who had been born in Dublin.
In 1877 Lord Bute sold the Western Mail to Carr and Daniel Owen. By 1881, Carr had remarried, to Helen sister of Sir Charles James Jackson, and the 1881 Census records that they had three daughters. In 1884, Carr and Owen formed the Daniel Owen and Co. Ltd as a joint stock company.
As well as his work in the press, Carr served as a town councillor of Cardiff (for the West ward) and as a Justice of the Peace.
In 1891 Carr, as part of a syndicate, bought the London Sunday paper, News of the World and placed his nephew Emsley Carr as its editor. Emsley would later marry Carr's eldest daughter, Jenny. Around this period Carr branched into the hotel business, becoming Chairman of the Royal Hotel Company, which owned the Royal Hotel on St Mary's Street in the centre of Cardiff.
On the night of Saturday 3 June 1893 the premises of the Western Mail burnt to the ground, but Carr managed to set up and office and printing presses overnight in nearby Newport, which allowed the paper to report its own fire in the Monday morning edition.
Ill health caused Carr to retire as editor of the Western Mail in 1901. He died on 5 October 1902 aged 62 while staying in Hyères in the south of France.
Notes
1841 births
1902 deaths
People educated at Kingswood School, Bath
British newspaper publishers (people)
Journalists from Cardiff
People from Knottingley
Councillors in Cardiff
19th-century British businesspeople |
Death on a Factory Farm is a 2009 television documentary film concerning the animal rights abuses at the Wiles hog farm, and the subsequent investigation and trial.
Synopsis
Death on a Factory Farm follows the undercover investigation of Wiles Hog Farm by the animal rights group The Humane Farming Association (HFA), and the resulting court case against it. The organization received a tip from an employee at the farm that animals were being abused, including a claim that hogs were being hung by chains and strangled to death as a form of euthanasia. HFA then turned to an undercover investigator using the name "Pete". The investigator wore a hidden camera while he worked undercover as a farmhand at Wiles.
Over the course of six weeks, the investigator secretly filmed numerous incriminating scenes, including piglets being tossed into crates from across a room, impregnated sows held in pens impeded their ability to move, an unhealthy piglet being hit against a wall to euthanize it, and a sick sow being hung by a chain from a forklift until it choked to death. Having obtained this evidence, Pete concluded the investigation and quit the job at the farm.
HFA brought Pete's footage to the Wayne County Sheriff's Department, which then raided the farm. Prosecutors filed ten criminal charges of animal cruelty against the farm's owners, and a farm employee who participated in hanging the sow.
In the subsequent trial, the prosecutors and the defense fought about the legality and morality of these practices, described by the presiding judge as "distasteful and offensive". However, the judge defended these practices as the reality of producing pork for consumption.
References
External links
Review from Nytimes.com
2009 television films
2009 films
American documentary television films
2009 documentary films
Documentary films about animal rights
2000s English-language films
2000s American films |
"The Last Time" is a song co-written and recorded by Canadian country music artist Tenille Townes. She wrote the song with Ben Goldsmith and producer Gordie Sampson. The track was released to Canadian country radio and peaked at number 5, becoming her seventh top 10 single in the country.
Background
Townes stated that she "wanted to write a song that captured that sentimental reality, with nostalgia in the fabric of the music," adding that it reminds her "to stop and take in the moments that are happening right now." She remarked that when writing the song, she was "thinking about how we put a frame around the memory of a first time … and how sometimes the last time can sneak up on us."
Critical reception
Nick Cantwell of Belles and Gals described "The Last Time" as "a heartbreaking song which will no doubt be very relatable to most, describing the feeling of nostalgia you get once you realise a regular occurrence in your life won’t be happening again for whatever reason." An uncredited review in Today's Country Magazine stated that the song "makes you think, it makes you feel, and it makes you want to hear it again and again". Melody Lau of CBC Music framed the song as an "emotional gut punch" that adds "to Townes' growing discography of moving anthems."
Live performance
Townes performed "The Last Time" at the 2022 Canadian Country Music Awards at the Scotiabank Saddledome in Calgary, Alberta on September 11, 2022. The award show was broadcast live on Global in Canada, while a video of her performance was uploaded to YouTube on October 4, 2022.
Charts
References
2022 songs
2022 singles
Tenille Townes songs
Songs written by Tenille Townes
Songs written by Gordie Sampson
Columbia Nashville Records singles |
Neuhausen (Central Bavarian: Neihausn) and Nymphenburg were boroughs of Munich, the capital of the German state of Bavaria. They were merged into the borough 09 - Neuhausen-Nymphenburg () in 1992. For further information on the Munich boroughs, see: Boroughs of Munich.
Location
Nymphenburg borders Obermenzing in the north-west, Pasing in the south-west, Moosach in the north and Neuhausen in the south-east.
The borough 09 ranges from the Mars-field at the inner edge of town to the Nymphenburg Palace in the west and extends from the south part of the Olympic Park (including the Tollwood Summer festival area and the East-West Peace Church) over the villa colony in Gern to the railway tracks.
History and description
Neuhausen is a very quiet and calm residential area. It counts as one of the most exclusive and expensive boroughs in Munich.
Typical of the borough is its mix of different urban areas. Around the end of the 19th Century a prestigious residential neighborhood was built in the palace's vicinity, where numerous examples of late nineteenth century architecture, like the villa colonies Neuwittelsbach and Gern can be found.
In 1890 the borough Neuhausen was unincorporated, which had already been a prosperous district. It was dominated by residential and office houses in a closed, dense block-building style. Along the Arnulfroad and its side streets, these are often cooperative apartment buildings such as the partly under preservation attempt-settlement of the Bavarian Post and Telegraph Association and the village of Neuhausen. In the north of the Rotkreuzplatz there are more villas and town houses of the early days.
In the south along the railway tracks there are partly dominating large-scale commercial used buildings. Center and urban hub of the neighborhood of the Rotkreuzplatz. Some well-preserved buildings from the founder and inter-war period with the rich variety of green spaces give Neuhausen a high quality of living. While the old quarters in the vicinity of Nymphenburgerstreet and Blutenburgstreet are home to upper middle class for some time, the sometimes less sumptuously executed turn of the century buildings offer in the vicinity of Schulstreet and Donnersbergerstreet housing for various population groups. But has also kept the so-called gentrification catchment by road trains and remodeled buildings were renovated. In addition, there were numerous conversions take place in condominiums and shops were once easy to architectural firms, alternative shops, bars and restaurants. For this reason, the City Council in 2006 extended the statute for preservation of this neighborhood, to counteract the displacement of ancestral inhabitants.
On 1 January 1891 the independent municipality Nymphenburg was incorporated to the city of Munich.
It is named after the Nymphenburg Palace, former summer residence of the Bavarian kings. Today the castle along with the Nymphenburg Palace Park is one of the most popular sights of Munich.
The in 1747 by Elector Max III. Joseph founded Nymphenburg Porcelain Manufactory, the Royal Stables Museum of Nymphenburg and the Museum of Man and Nature is located next to the palace. On the Nymphenburg Palace Park also borders the Botanical Garden, which entrance is near the Bavarian State Office of Weights and Measures. The Hirschgarten and the Olympic Park complement the diverse range of parks and recreational areas. Because the borough is connected by the motorway A8 and the ring road it is charged by high traffic volumes. Neuhausen-Nymphenburg has about 90,000 inhabitants, according to Ramersdorf-Perlach the second highest population of the boroughs of Munich. In the north of Neuhausen, between the borough is Gern and Moosach-Nederling, in the northeastern the borough of Ebenau.
The jobs of the district are in addition to trade and service sector largely in the public sector. Apart from the branch of Deutsche Bahn, the Bundeswehr's administrative center, the Bavarian State Criminal Police Office, and numerous hospitals, such as the Red Cross Hospital, the German Heart Center, the Brothers of Mercy Hospital and the Third Order Hospital there are also major social institutions in the borough.
The proportion of foreigners Nymphenburg is low, in Neuhausen it is average. Regarding the age distribution Neuhausen is the younger of the two districts.
Gallery
Statistics
(As of each 31 December, residents whose main residence)
Education and culture
Blutenburg-Theatre, Blutenburgstraße 35
History Workshop Neuhausen e. V., Neuhauser Trafo, Nymphenburger Str. 171a
Maxim (Cinema), Landshuter Allee 33
Munich College, Außenstelle Neuhausen, Neuhauser Trafo, Nymphenburger Str. 171a
Munich Library, Borough-Library, Neuhauser Trafo, Nymphenburger Str. 171a
Nymphenburger Schools, School-Center, Sadelerstraße 10
Pathos Transportation Theatre, Dachauer Straße 110d
Summer Tollwood Festival
Politics
In Munich each borough has a Borough Committee (Bezirksausschuss BA). The Borough Committees are elected by local citizens in municipal elections. The Borough Committee consists 39 members. The election of the Borough Committee of 2 March 2008 yielded the following results:
SPD 16 seats – 41,4%
CSU 10 seats – 26,6%
Bündnis 90/Die Grünen 9 seats – 20,1%
FDP 3 seats – 7,6%
David contra Goliath/ÖDP 2 seats – 4,3%
Chairman of the BA is Ingeborg Staudenmeyer (SPD). The Vice-Chairmen are Roland Zintl (Greens) and Immoi Scheibel (CSU). The Greens and the ÖDP provide a common fraction.
The municipality is represented in the City Council by Oliver Belik (SPD) and Councilwoman Elizabeth Schmucker (CSU).
Celebrities
According to legend, Neuhausen was christianised by in the 8th century.
Author Alfred Andersch
Author
Historian Karl Bosl
Architect
Toolmaker Anton Drexler
Actor Helmut Fischer
Landscape painter Max Haushofer (1811–1866)
Ellis Kaut, developer of Pumuckl
Oskar von Miller, founder of Deutschen Museums
Sculptor
Soccer-player Philipp Lahm (born 1983)
Composer Carl Orff (1895–1982)
Journalist
Lilo Ramdohr (born 1913), who lived as Lilo Berndl from 1941 until 1944 in Nymphenburg, where in May 1942 cartoons with leaflets of the White Rose had been highjacked by Alexander Schmorell
Poet Eugen Roth
Author Augustin Souchy
Operatic baritone and voice teacher Hermann Wiedemann (1879–1944)
References
External links
Neuhausen at muenchen.de
Nymphenburg at muenchen.de
Bezirksausschuss 9 Neuhausen-Nymphenburg
Geschichte des Stadtteils
KulturGeschichtsPfad Neuhausen-Nymphenburg
Literatur zu Neuhausen-Nymphenburg
Boroughs of Munich |
T. Alan Hatton is the Ralph Landau Professor and the Director of the David H. Koch School of Chemical Engineering Practice at Massachusetts Institute of Technology. As part of the MIT Energy Initiative, he co-directs the Center for Carbon Capture, Utilization and Storage. His work focuses on the development of purification technologies of various kinds for use with air, water, and other substances.
Early life and education
Trevor Alan Hatton was born in Durban, South Africa.
He earned his B.Sc. Eng. (1972) and M.Sc. Eng. (1976) degrees at the University of Natal, Durban. He then worked for the Council for Scientific and Industrial Research in Pretoria for three years. Hatton earned his Ph.D. from the University of Wisconsin–Madison, in 1981, working with Edwin N. Lightfoot.
Career
Hatton joined the Massachusetts Institute of Technology (MIT) in 1982. For several years he and his wife Marianne were faculty residents, living at MacGregor House until 1986.
In 1995, Ralph Landau established a new chair at MIT: the Ralph Landau Professorship of Chemical Engineering Practice, to be held by the Director of the David H. Koch School of Chemical Engineering Practice.
T. Alan Hatton became the first Ralph Landau Professor of the Practice School in 1996.
At the Practice School, students complete placements at industrial projects with international host companies, as well as taking on-campus academic courses.
Hatton has been the program director of the Practice School for over 28 years.
Beginning in 2015, the MIT Energy Initiative has established eight low-carbon energy centers focusing on technical advancements in areas critical for climate change. Hatton co-directs the Center for Carbon Capture, Utilization and Storage.
Hatton holds an honorary professorship at the University of Melbourne and is an adjunct professor at Curtin University in Perth, Australia.
He has served as a co-editor of Colloids and Surfaces, and is on the
international advisory board of the Chinese Journal of Chemical Engineering.
In 1990, he chaired the Gordon Research Conference on Separation and Purification.
In 1999, he co-chaired the 73rd Colloid and Surface Science Symposium, held at MIT, with Paul E. Labinis.
Research
Hatton has published widely on colloidal phenomena and their applications in chemical processing. His research interests include
responsive surfactants and gels obtained by colloidal self-assembly,
stimuli-responsive materials,
chemically reactive fibers and fabrics,
metal-organic frameworks for separations and catalysis,
and synthesis and functionalization of magnetic nanoparticles and clusters.
Much of his work focuses on the development of purification technologies of various kinds. In the 1980s, he studied the effects of metal ions, clays, and minerals on sorption capacities.
In the 1990s, Hatton worked to develop solvents for chemical synthesis, separation and cleaning that were less volatile and less water-soluble. This decreased the potential for undesirable air emissions or aqueous discharge.
Hatton has done considerable work on the use of magnetically sensitive nanoparticles for separation of liquids. Nanoparticles can be designed with a distinctive protein signature that will attract and attach a desired target protein. The nanoparticles can then be added to a suspension, where they will attach the target molecules. By subjecting the liquid to a magnetic field, the nanoparticles with their attached targets can be removed from the suspension. Finally the nanoparticles and proteins can be separated, recovering the nanoparticles for reuse. Hatton has used this type of technique for the separation of oil from water. He hopes it may be used eventually for the cleaning up of oil spills.
As of 2012, Hatton worked on electrochemically mediated methods of carbon capture and conversion which could be used to reduce emissions from power plants and industry and decrease greenhouse gases. The researchers are studying magnesium oxide-based materials, coating particles of MgO with alkali metal nitrates. The resulting materials can capture more than ten times as much carbon dioxide () as other materials being investigated, at lower temperatures.
As of 2015, T. Alan Hatton and Aly Eltayeb received funding to develop a commercial prototype for carbon capture and storage from the smokestacks of industrial and power plants that burn fossil fuels. First, flue gases are passed through a liquid containing amines, which attract carbon dioxide. Then, building on the work of Michael Stern, the prototype passes the resulting solution through an electrochemical cell containing two electrically charged copper plates. This causes the amines to release the carbon dioxide, which can be sequestered or reused. The approach would remove carbon from the atmosphere, while using less electricity than current amine scrubber technology.
As of 2016, Yogesh Surendranath and T. Alan Hatton received a Seed Fund Grant from the MIT Energy Initiative to investigate the possible cycling of carbon dioxide () emissions into chemical fuel.
With Xiao Su and others, Hatton has developed new methods of removing unwanted substances such as chemical waste, pesticides, and pharmaceuticals from water supplies. Both positive and negative electrodes or plates can be coated with Faradaic materials, which are chemically "functionalized" to react with specific molecules. As water flows between the plates, electricity is applied causing the active groups on the plates to combine with desired molecules. This process can work even with very small trace concentrations of target particles, present at parts-per-million. For their work on water purification, researchers won the 2016 Water Innovation Prize.
By better understanding fundamental mechanisms involved in electrosorption, they are attempting to design more effective novel electrode materials.
Awards
2016, Water Innovation Prize, MIT
1985, Presidential Young Investigator Award, NSF
1983, Everett Moore Baker Award for Excellence in Undergraduate Teaching, MIT
References
Living people
Year of birth missing (living people)
MIT School of Engineering faculty
University of Wisconsin–Madison alumni
University of Natal alumni |
Bryan Richard Cullen is a James B. Duke Professor of Molecular Genetics and Microbiology at Duke University Medical Center in Durham, North Carolina. Cullen was the Founding Director of the Duke University Center for Virology.
Early life and education
Cullen was born in December 1951 in Bradford, England, where he graduated head of his class from Thornton Grammar School in 1970. In 1973, he received a B.Sc. in biochemistry from Warwick University, England and in 1974, he received an M.Sc. in virology from Birmingham University, England. Dr. Cullen emigrated to the US in 1974, where he received a Ph.D. in microbiology from Rutgers University, New Jersey, in 1984. He became a US citizen in 1992.
Research
Cullen and his laboratory are currently studying the regulation of viral mRNA expression by epitranscriptomic modifications and the use of CRISPR/Cas as a potential approach to the treatment of chronic diseases caused by DNA viruses.
Cullen discovered the phenomenon of “transcriptional interference” in retroviruses and showed that this explained why proviral 5’LTRs are active while 3’ LTRs are silenced. After starting his own research group in 1984, he demonstrated that the HIV-1 Tat protein activates viral transcription and that the HIV-1 Rev protein induces viral RNA nuclear export. He demonstrated that HIV-1 readily infects non-dividing cells, an unexpected result that overturned then prevalent dogma, and showed that a single variable loop in the Envelope protein, the V3 loop, controls HIV-1 tissue tropism.
His laboratory was the first to express and functionally characterize microRNAs in mammalian cells and the first to identify and functionally characterize the microRNAs encoded by the herpesviruses KHSV, EBV and HSV-1.
Recently, his laboratory was the first to report that several distinct epitranscriptomic modifications added to viral mRNAs promote viral gene expression and replication.
Controversy
On May 24, 2022, Cullen replied-all to a department-wide email about an inclusivity module by claiming that it is a "left-wing Maoist political propaganda workshop" and that he will refuse to engage in it "as a tenured faculty". He was widely criticized in the same email chain, where he was also perceived to be transphobic.
Awards and honors
Cullen was the recipient of the 1989 Ely Lilly Molecular Biology Award. He was awarded a distinguished fellowship by Durham University, UK in 2007. He is a Fellow of the American Academy of Microbiology since 2009 and of the American Association for the Advancement of Science since 2011. He was named one of the top peer reviewers by the Journal of Virology in 2009 and 2011 and has been identified as a highly cited scientist by both Clarivate Analytics at Web of Science and by Thomson Reuters annually since 2001. He was awarded an honorary doctorate of science (D.Sc.) degree by Warwick University in 2016.
Key publications
Cullen, Bryan R., Lomedico, Peter T. and Ju, Grace. (1984) Transcriptional Interference in Avian Retroviruses-Implications for the Promoter Insertion Model of Leukaemogenesis. Nature 307, 241–245.
Cullen, Bryan R. (1986) Trans-activation of Human Immunodeficiency Virus Occurs Via a Bimodal Mechanism. Cell 46, 973–982.
Malim, Michael H., Hauber, Joachim, Le, Shu-Yun, Maizel, Jacob V. and Cullen, Bryan R. (1989) The HIV-1 Rev Trans-activator Acts Through a Structured Target Sequence to Activate Nuclear Export of Unspliced Viral mRNA. Nature 338, 254–257.
Malim, Michael H., Böhnlein, Sabine, Hauber, Joachim and Cullen, Bryan R. (1989) Functional Dissection of the HIV-1 Rev Trans-activator – Derivation of a Trans-dominant Repressor of Rev Function. Cell 58, 205–214.
Malim, Michael H., Tiley, Laurence S., McCarn, David F., Rusche, James R., Hauber, Joachim and Cullen, Bryan R. (1990) HIV-1 Structural Gene Expression Requires Binding of the Rev Trans-activator to its RNA Target Sequence. Cell 60, 675–683.
Hwang, Stephen S., Boyle, Terence J., Lyerly, H. Kim and Cullen, Bryan. R. (1991) Identification of the Envelope V3 Loop as the Primary Determinant of Cell Tropism in HIV-1. Science 253, 71–74.
Weinberg, J. Brice, Matthews, Thomas J., Cullen, Bryan R. and Malim, Michael H. (1991) Productive HIV-1Ba-L Infection of Nonproliferating Human Monocytes. The Journal of Experimental Medicine 174, 1477–1482.
Courtney, David G., Kennedy, Edward M., Dumm, Rebekah E., Bogerd, Hal P., Tsai, Kevin, Heaton, Nicholas S. and Cullen, Bryan R. (2017) Epitranscriptomic enhancement of influenza A virus gene expression and replication. Cell Host & Microbe, 22: 377–386.e5.
Editorship
Dr. Cullen has served as an Associate Editor for Cell, and PLoS Pathogens. He has also served as an editorial board member for several major journals.
External links
Google Scholar
References
1951 births
Living people
Alumni of the University of Birmingham
Alumni of the University of Warwick
British microbiologists
Duke University faculty
Fellows of the American Academy of Microbiology
Rutgers University alumni |
Night Melody is the fourth studio album by British electronic musician Ryan Lee West, performing under his stage name Rival Consoles. It was released on 5 August 2016, Erased Tapes Records.
Production
Writing for Night Melody began in late-2015, at the same time West's third album Howl was released. West had just come out of a 13-year relationship, inspiring the release of his fourth studio album. In response to the release, West said: "I’ve been working on the mini album for four or five months straight. And I don’t mean that in the glamorous way. It’s been destroying my brain; there’s been a lot of problem solving. The ideas themselves always come quickly, it’s more the second stage of making things better and solving problems."
Critical reception
Night Melody was met with "generally favorable" reviews from critics. At Metacritic, which assigns a weighted average rating out of 100 to reviews from mainstream publications, this release received an average score of 75, based on 6 reviews. Aggregator Album of the Year gave the release a 72 out of 100 based on a critical consensus of 7 reviews.
Writing for AllMusic, Paul Simpson said "The short album is relatively straightforward, with six tracks of subdued, atmospheric techno -- no filler, no beating around the bush. The album isn't quite as dark or sad as one might expect, given the context. It seems like a logical extension of the path he's been taking with his previous few recordings." Stephen Proski of Drowned in Sound wrote "Night Melody was developed as a result of the incarcerated experience of working in abject environments with digital technology: the haunting yet comforting background noise of a hard drive humming. West, when left alone to his devices, is able to transform emotion into the esoteric, colluding synthesis into vibrant, organic swaths of sound." The staff at Mixmag praised West for a richer and more complex sound than his previous releases.
Track listing
Charts
References
2016 albums
Erased Tapes Records albums |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.