text stringlengths 1 22.8M |
|---|
USS LST-23 was a United States Navy used exclusively in the Asiatic-Pacific Theater during World War II and staffed by a United States Coast Guard crew. Like many of her class, she was not named and is properly referred to by her hull designation.
Construction
LST-23 was laid down on 27 October 1942, at Pittsburgh, Pennsylvania, by the Dravo Corporation; launched on 29 March 1943; sponsored by Mrs. Mary H. Miller. She was floated down the Ohio and Mississippi rivers to the Naval Section Base, Algiers, Louisiana, in March 1943. She was commissioned on 22 May 1943.
Service history
On 10 June 1943, she departed Algiers, in convoy for San Francisco, via the Panama Canal. She arrived at San Diego on 1 July 1943, and at [[Mare Island
Navy Yard]] on 3 July 1943. She left San Francisco, on 17 July 1943, with the destroyer escorting her and five other LSTs for Alaskan waters. They arrived safely at the Naval Air Station, Woman's Bay, Kodiak, Alaska on 25 July 1943. The convoy and escort departed on 27 July, with an additional LST and two more escorts for Kuluk Harbor, Adak, Aleutian Islands, arriving there on 1 August 1943. Here she disembarked troops and equipment and beached to unload Army equipment. With two escorts and three other LSTs and a Navy tug she departed Kiska, on 27 August 1943, for Kuluk Harbor, Adak. On 31 August, LST-23 and five other LSTs departed Adak for San Francisco with two escorts, one of which left the group to escort LST-19, which was suffering engine trouble, back to Adak Island.
LST-23 participated in the Gilbert Islands operation from the end of November until the beginning of December 1943 and the occupation of Kwajalein and Majuro Atolls at the beginning of February 1944.
On 4 April 1944, she was in the Marshall Islands en route to Pearl Harbor which she reached on 24 April, remaining there until 15 June 1944. On 23 May 1944, the
officers and men were recommended for consideration for awards for bravery and meritorious performance of duty. LST-23 moved to the Marianas next so she could take part in the Battle of Saipan from mid June until the end of July 1944, along with the Battle of Tinian at the end of July 1944. She proceeding to Eniwetok on 3 July 1944. From around the middle of September until the middle of October she participated in the Battle of Peleliu. On 12 October 1944, she was at Espiritu Santo.
On 16 October 1944, her medical officer, Lieutenant junior grade A. R. M. Sears, USNR, wrote to the Force Surgeon of the South Pacific Area regarding the morale on board LST-23 and it provides a unique insight into life aboard a Coast Guard-staffed LST in the Pacific during this point in the war:
1. The morale of the personnel of this vessel is suffering considerable hardship and measures to remedy the situation have failed thus far. The men most affected are those aboard who have been on constant duty on this vessel since before it went into commission in May 1943. However, there are other men aboard who have been overseas up to twenty seven months and they likewise are suffering.
2. The present medical officer has been aboard in excess of four months and has been able to observe the various officers and members of the crew and to evaluate their mental condition. Some of these men have grown so irritable that they are easily excited and often are called before Captain's Mast for acts committed because of the irritability acquired from their prolonged service aboard this ship. One signalman in particular had his rate taken away from him for an act against a senior petty officer, the whole of which, it is believed, arose from the irritability and mental fatigue from their long tour of duty.
3. These men do not have opportunity for liberty for long periods of time and seeing the same faces month after month, being unable to move in more than the small confines of the ship, has made many of them tired of each other, even suspicious and afraid of one another.
4. The ship has participated in action with the enemy and has been in extreme danger on numerous occasions. Some of its personnel have been wounded by enemy action. Many of the original members of the crew as well as some of those more recently assigned have developed extreme nervousness under danger due to their repeated subjection to shellfire and nearness to explosions of bombs with no means of protection other than the projectiles from their own guns.
5. This vessel is a U.S. Navy ship staffed by U.S. Coast Guard personnel which seems to make it difficult to obtain replacement personnel. The morale of the ship falls even lower when in port for the men find that Navy ships of the same class are sending men back to the states for leave and reassignment after eighteen months, twelve months, and even shorter periods.
6. We are hopeful that the Force Surgeon may be able to take some action which will result in the relief of the immediate situation and also establish some means by which personnel may be replaced after the specified eighteen months of sea duty in order to prevent any more permanent damage to the minds and morale of these men.
LT Sears letter did indeed stimulate some action. A 26 October 1944, memo to the Commandant (P), noted that 29 enlisted men were sent to LST-23 to relieve an equal number of her crew. Three officers were also sent as relief.
On 5 December 1944, while returning from a supply trip, LST-23, while in North Surigao Straits, was hit a glancing blow by a plane causing a fire and extensive damage. After being repaired LST-23 moved to the Philippines to finish out her combat career participating in General Douglas MacArthur's promised liberation of the islands from the Japanese occupation in the Battle of Luzon Lingayen Gulf landings on 9 January 1945, after which she returned to San Diego, California. Departing San Diego on 17 February 1945, she proceeded to Guam via Pearl Harbor, arriving there on 2 April 1945, and returning to San Francisco on 6 May 1945.
Postwar career
Her next trip took her to Sasebo, Japan. Leaving Pearl Harbor on 3 September 1945, after the end of the war, she arrived in Sasebo. On 15 September 1945, she was redesignated Landing Ship, Tank (Hospital), LST(H). She departed Sasebo on 28 September for Lingayen and Manila. She left Manila on 10 October for Wakayama, Japan, via Lingayen, arriving there on 22 October. She returned to San Francisco on 2 February 1946, via Okinawa, Sasebo, Saipan, and Pearl Harbor. When she returned to the United States and was decommissioned on 24 May 1946. She was struck from the Navy list on 3 July 1946 and was sold to the Kaiser Company, Inc., Seattle, Washington, on 6 April 1948 for scrapping.
Awards
LST-23 earned six battle stars for her World War II service.
References
Bibliography
External links
LST-1-class tank landing ships of the United States Navy
World War II amphibious warfare vessels of the United States
Ships built in Pittsburgh
1943 ships
United States Navy ships crewed by the United States Coast Guard
Ships built by Dravo Corporation |
```xml
<resources>
<string name="topCenterTextMessage">Place the tag under the phone</string>
<string name="warn_key_download">Do NOT load keys from Download folder.</string>
<string name="fixed_key_found">«locked-secret» stored / loaded.</string>
<string name="fixed_key_missing">«locked-secret» missing!</string>
<string name="unfixed_key_found">«unfixed-info» stored / loaded.</string>
<string name="unfixed_key_missing">«unfixed-info» missing!</string>
<string name="nfc_unsupported">NFC support was not found!</string>
<string name="nfc_disabled">NFC is currently disabled!</string>
<string name="nfc_available">NFC is currently disabled. Enable NFC?</string>
<string name="no_decrypt_key">Decryption keys not imported</string>
<string name="filter">amiibo Filters</string>
<string name="sorting">Sorting Options</string>
<string name="display_options">Display Options</string>
<string name="amiibo_id">ID</string>
<string name="amiibo_name">Name</string>
<string name="amiibo_titles">Game Usage</string>
<string name="amiibo_game">Game Series</string>
<string name="amiibo_character">Character</string>
<string name="amiibo_series">amiibo Series</string>
<string name="amiibo_type">amiibo Type</string>
<string name="amiibo_path">File Path</string>
<string name="pref_amiibo_characters">Characters</string>
<string name="pref_amiibo_types">Amiibo Types</string>
<string name="pref_amiibo_titles">Enabled Games</string>
<string name="amiibo_name_caps">NAME</string>
<string name="amiibo_id_caps">TAGID</string>
<string name="amiibo_type_caps">AMIIBO TYPE</string>
<string name="amiibo_titles_caps">GAME USAGE</string>
<string name="amiibo_game_caps">GAME SERIES</string>
<string name="amiibo_series_caps">AMIIBO SERIES</string>
<string name="amiibo_character_caps">CHARACTER</string>
<string name="amiibo_path_caps">PATH</string>
<string name="recursive_folders">Recursive Search</string>
<string name="compact">Snappy Cards</string>
<string name="large">Banner Cards</string>
<string name="image">Icon Tile Grid</string>
<string name="decryption_keys">Decryption Keys</string>
<string name="yes">Yes</string>
<string name="no">No</string>
<string name="search">Search</string>
<string name="refresh">Refresh</string>
<string name="close">Close</string>
<string name="view">View</string>
<string name="proceed">Continue</string>
<string name="unlock">Unlock</string>
<string name="scan">Scan</string>
<string name="qr_code">QR Code</string>
<string name="upload">GATT</string>
<string name="browser">Browser</string>
<string name="retry">Retry</string>
<string name="save">Save</string>
<string name="edit">Edit</string>
<string name="export">Export</string>
<string name="cache">Cache</string>
<string name="write">Write</string>
<string name="erase">Erase</string>
<string name="cancel">Cancel</string>
<string name="dismiss">Dismiss</string>
<string name="accept">Accept</string>
<string name="submit">Submit</string>
<string name="deny">Deny</string>
<string name="start">Start</string>
<string name="delete">Delete</string>
<string name="activate">Activate</string>
<string name="download">Download</string>
<string name="parent">Parent</string>
<string name="unknown">Unknown</string>
<string name="invalid">Invalid</string>
<string name="unspecified">Unspecified</string>
<string name="install">Install</string>
<string name="sync">Sync</string>
<string name="enable">Enable</string>
<string name="replace">Replace</string>
<string name="update">Update</string>
<string name="error_caps">ERROR</string>
<string name="uid" translatable="false">UID</string>
<string name="country_code">Country Code</string>
<string name="init_date">Initialized Date</string>
<string name="mod_date">Modified Date</string>
<string name="nickname">Nickname</string>
<string name="write_count">Write Count</string>
<string name="mod_serial">Serial Number</string>
<string name="view_hex">View Hex Code</string>
<string name="hex_code">Hex Code</string>
<string name="share_qr">Share QR Code</string>
<string name="edit_props">Edit Properties</string>
<string name="bin_random">Bin Randomizer</string>
<string name="download_slot">Download Slot</string>
<string name="share_export">Share / Export</string>
<string name="flipper_save">Save as Flipper</string>
<string name="delete_binary">Delete Tag File</string>
<string name="ignore_tag_id">Ignore Tag ID #</string>
<string name="random_serial">Random Serial Number</string>
<string name="inject_game_data">Inject Save Data</string>
<string name="unlock_sparkle_cards">Unlock Sparkle Cards</string>
<string name="export_app_data">Export</string>
<string name="import_app_data">Import</string>
<string name="format_app_data">Format</string>
<string name="game_titles_view">View Compatible Games</string>
<string name="game_titles_hide">Hide Compatible Games</string>
<string name="export_flipper_files">Export as Flipper Files</string>
<string name="games_ds">3DS Compatibility</string>
<string name="games_wiiu">WiiU Compatibility</string>
<string name="games_nx">Switch Compatibility</string>
<string name="no_games_ds">No 3DS compatibility</string>
<string name="no_games_wiiu">No WiiU compatibility</string>
<string name="no_games_nx">No Switch compatibility</string>
<string name="properties">Properties</string>
<string name="mii" translatable="false">Mii</string>
<string name="mii_name">Mii Name</string>
<string name="mii_author">Mii Author</string>
<string name="app">Application</string>
<string name="app_id">App ID</string>
<string name="app_data">App Data</string>
<string name="hearts">Hearts</string>
<string name="level">Level</string>
<string name="level_cpu">CPU Level</string>
<string name="appearance">Appearance</string>
<string name="gifts">Gifts</string>
<string name="special_neutral">Special Neutral</string>
<string name="special_side">Special Side</string>
<string name="special_up">Special Up</string>
<string name="special_down">Special Down</string>
<string name="attack">Attack</string>
<string name="defense">Defense</string>
<string name="speed">Speed</string>
<string name="bonus_one">Bonus Effect 1</string>
<string name="bonus_two">Bonus Effect 2</string>
<string name="bonus_three">Bonus Effect 2</string>
<string name="report_problem">Report Problem</string>
<string name="logcat_crash">ERROR! Submit a log?</string>
<string name="send_donation">Send a Donation</string>
<string name="settings_donate">Support development with a donation</string>
<string name="google_link">Donate with Google Play</string>
<string name="sponsor_link">Sponsor on GitHub</string>
<string name="paypal_link">Donate with PayPal</string>
<string name="cancel_link">Cancel Subscription</string>
<string name="subscription_terms">By subscribing to monthly donations, a special banner will appear in settings for the duration of your subscription.\n\nYou may cancel your subscription at any time by using the button on this donation page or through Google Play.</string>
<string name="clear_foomiibo_set">Clear Foomiibo</string>
<string name="build_foomiibo_set">Build Foomiibo</string>
<string name="foomiibo_progress">Building %1$s…</string>
<string name="foomiibo_removing">Clearing %1$s…</string>
<string name="wrote_file">%1$s saved!</string>
<string name="wrote_foomiibo">%1$s Foomiibo saved!</string>
<string name="delete_file">%1$s deleted!</string>
<string name="delete_foomiibo">%1$s Foomiibo deleted!</string>
<string name="nfc_tag">NFC tag</string>
<string name="tag_detected">%1$s detected…</string>
<string name="tag_scanning">%1$s scanning…</string>
<string name="bank_writing">Writing bank %1$d of %2$d…</string>
<string name="bank_erasing">Erasing bank %1$d of %2$d…</string>
<string name="bank_select">Selecting a destination bank…</string>
<string name="chibi_robo">Chibi-Robo! Zip Lash</string>
<string name="zelda_twilight">The Legend of Zelda: Twilight Princess HD</string>
<string name="mh_stories">Monster Hunter Stories</string>
<string name="ml_paper_jam">Mario & Luigi: Paper Jam</string>
<string name="ml_superstar_saga">Mario & Luigi: Superstar Saga</string>
<string name="ms_superstars">Mario Sports Superstars</string>
<string name="mario_party_ten">Mario Party 10</string>
<string name="mario_tennis">Mario Tennis</string>
<string name="pikmin">Pikmin</string>
<string name="splatoon">Splatoon (1 & 2)</string>
<string name="splatoon_three">Splatoon 3</string>
<string name="super_smash">Super Smash Bros. (Wii U / 3DS)</string>
<string name="smash_ultimate">Super Smash Bros. Ultimate</string>
<string name="unknown_type">Unverified Tag</string>
<string name="write_raw">Write to Tag (Raw)</string>
<string name="write_auto">Write to Tag (Auto)</string>
<string name="update_tag">Update a Tag</string>
<string name="scan_tag">Scan an NFC Tag</string>
<string name="scan_data">Scan from Tag</string>
<string name="gatt_share">Upload to GATT</string>
<string name="lock_elite">Lock N2 Elite</string>
<string name="unlock_elite">Unlock N2 Elite</string>
<string name="scan_bank_no">Scan Bank %1$d</string>
<string name="scan_bank">Scan Bank %1$s</string>
<string name="scan_elite">Scan N2 Elite</string>
<string name="erase_bank">Erase Bank Tag</string>
<string name="activate_bank">Activate Bank</string>
<string name="amiibo_backup">Create Backup</string>
<string name="validate_data">Validate NTAG</string>
<string name="set_bank_count">Set Bank Count</string>
<string name="lock_amiibo">Lock N2 Elite</string>
<string name="write_collection">Write Collection</string>
<string name="erase_collection">Erase Collection</string>
<string name="feature_unavailable">Feature not implemented!</string>
<string name="activity_unavailable">Please try again later.</string>
<string name="storage_unavailable">Device storage inaccessible!</string>
<string name="guide_suggested">View the guide for more help</string>
<string name="allow">Allow</string>
<string name="camera">Camera</string>
<string name="gallery">Gallery</string>
<string name="qr_type">QR Format</string>
<string name="qr_raw">QR Text</string>
<string name="qr_bytes">QR Data</string>
<string name="qr_mii">Mii Data</string>
<string name="qr_amiibo">amiibo QR</string>
<string name="qr_invalid">Input null or invalid</string>
<string name="settings">Settings</string>
<string name="guides">Guides</string>
<string name="about">About</string>
<string name="donate">Donate</string>
<string name="menu_amiibo">Backup Browser</string>
<string name="menu_foomiibo">Foomiibo Panel</string>
<string name="menu_elite">N2 Elite Connect</string>
<string name="menu_gatt">Bluetooth Connect</string>
<string name="menu_qr_code">QR Code Toolkit</string>
<string name="menu_guides">Guides and Help</string>
<string name="menu_settings">TagMo Settings</string>
<string name="tagmo_update">TagMo Update</string>
<string name="pref_menu_return">Return to main menu</string>
<string name="prefs_configuration">Configuration</string>
<string name="pref_import_keys">Import amitool keys</string>
<string name="image_loading_details">Image data access</string>
<string name="enable_tag_validation">NTAG215 validation</string>
<string name="tag_validation_details">Not all NFC chipsets correctly verify tags.\nDisable to bypass tag compatibility checks.</string>
<string name="enable_automatic_scan">Automatic NFC Scan</string>
<string name="automatic_scan_details">Disable to prevent unexpected scans.</string>
<string name="tag_devices">Tag Devices</string>
<string name="enable_power_tag">Power Tag support</string>
<string name="power_tag_details">See Github for limitations and use.</string>
<string name="enable_elite">N2 Elite support</string>
<string name="elite_details">See Github for limitations and use.</string>
<string name="lock_elite_details">The active bank will emulate a retail statue.\nOther features will be disabled until unlocked.</string>
<string name="lock_elite_warning">Lock N2 Elite Hardware?</string>
<string name="unlock_elite_warning">Unlock N2 Elite Hardware</string>
<string name="elite_signature">N2 Elite ID: %1$s</string>
<string name="prefs_game_compat">Game Compatibility</string>
<string name="enable_ds_compat">Show 3DS Games</string>
<string name="enable_wii_compat">Show Wii U Games</string>
<string name="enable_nx_compat">Show Switch Games</string>
<string name="amiibo_info">amiibo Database</string>
<string name="pref_database_source">Preferred AmiiboAPI Database</string>
<string name="sync_amiibo_info">Sync database with AmiiboAPI</string>
<string name="import_json_details">Load amiibo database (JSON)</string>
<string name="reset_amiibo_info">Reset amiibo database cache</string>
<string name="database_stats">Database Statistics</string>
<string name="number_character">%1$d Character(s)</string>
<string name="number_type">%1$d amiibo Type(s)</string>
<string name="number_titles">%1$d Enabled Game(s)</string>
<string name="pref_advanced">Advanced</string>
<string name="pref_tagmo_theme">TagMo System Theme</string>
<string name="tagmo_theme_details">Change local theme independent of system theme settings</string>
<string name="pref_disable_debug">Disable Debug Logger</string>
<string name="disable_debug_details">May improve performance, but limits most diagnostic details</string>
<string name="pref_disclaimer">Disclaimers</string>
<string name="amiibo_info_updated">Updated amiibo database!</string>
<string name="sync_amiibo_process">Syncing with AmiiboAPI…</string>
<string name="sync_amiibo_complete">AmiiboAPI sync success!</string>
<string name="sync_amiibo_failed">AmiiboAPI sync failure!</string>
<string name="removing_amiibo_info">Clearing database cache…</string>
<string name="update_amiibo_api">AmiiboAPI database updated!</string>
<string name="locating_keys">Locating amitool Keys…</string>
<string name="refreshing_list">Searching for amiibo…</string>
<string name="device_not_found">No device or tags available!</string>
<string name="files_displayed">%1$d Files: ? / ? amiibo</string>
<string name="amiibo_collected">%1$d Files: %2$d / %3$d amiibo</string>
<string name="view_device_options">Switch to Device Options</string>
<string name="view_amiibo_details">Switch to amiibo Details</string>
<string name="write_banks">Write %1$d banks</string>
<string name="erase_banks">Erase %1$d banks</string>
<string name="edit_bank_count">Edit Bank Count for N2 Elite</string>
<string name="bank_stats">Bank %1$d Active, %2$d Banks Enabled</string>
<string name="bank_number">Bank %1$d</string>
<string name="bank_select_details">Set Bank Number</string>
<string name="elite_write_confirm">Write selections to N2 Elite?</string>
<string name="elite_erase_confirm">Erase all banks from N2 Elite?</string>
<string name="warn_delete_file">%1$s\nwill be deleted. Are you sure?</string>
<string name="delete_missing">Cannot delete a scanned tag!</string>
<string name="delete_virtual">Cannot delete a virtual tag!</string>
<string name="erase_active">Cannot erase the active bank!</string>
<string name="document_storage_root">Update Document Storage</string>
<string name="emulated_storage_root">Browse Emulated Storage</string>
<string name="physical_storage_root">Browse Physical Storage</string>
<string name="grant_file_permission">Enable "All Files" Manager</string>
<string name="force_document_storage">Enable Document Storage</string>
<string name="storage_setup">Please configure a root folder</string>
<string name="unzip_archive">Extract bins from zip file</string>
<string name="refresh_browser">Refresh Browser</string>
<string name="hint_filename">Set Binary File Name</string>
<string name="key_hex_entry">Input Hexidecimal Key</string>
<string name="save_image">Set Image File Name</string>
<string name="key_input_method">Select an input method</string>
<string name="key_input_hex">Hex Code</string>
<string name="key_input_bin">Bin File</string>
<string name="prepare_unlock">Once the N2 is scanned, it cannot be removed from the NFC field until the operation is complete.</string>
<string name="progress_unlock">Press and hold the N2 button without disconnecting from NFC.</string>
<string name="prepare_blank">N2 Elite fails verification with an empty active bank.</string>
<string name="possible_lock">Is this N2 Elite locked?</string>
<string name="possible_blank">Scanning an N2 Elite?</string>
<string name="tag_update_only">Previously written tags require \"Update\"</string>
<string name="power_tag_reset">Power Tags last used with PowerSaves require a reset.</string>
<string name="encryption_fault">This file may be corrupt or was improperly created.</string>
<string name="custom_tab_back">Back to TagMo</string>
<string name="shop_hardware">Shop amiibo hardware</string>
<string name="gatt_missing">No nearby GATT devices found!</string>
<string name="gatt_connect_fail">Failed to connect GATT service!</string>
<string name="gatt_services_null">%1$s services not found!</string>
<string name="characteristic_null">Characteristic not found!</string>
<string name="xor_invalid">Empty collection can\'t be reduced</string>
<string name="connect_device">Connect device</string>
<string name="gatt_scanning">Scanning for Bluetooth GATT…</string>
<string name="gatt_located">Connecting to Bluetooth GATT…</string>
<string name="gatt_disconnect">GATT device connection lost!</string>
<string name="gatt_count">Slot %1$s Active, %2$d Slots Occupied</string>
<string name="write_slot_file">Upload binary to GATT device</string>
<string name="write_slots">Write %1$d slots</string>
<string name="erase_slots">Erase %1$d slots</string>
<string name="slots_full">Device full</string>
<string name="slots_empty">Device empty</string>
<string name="create_blank">Create blank virtual NFC tag</string>
<string name="reset_device">Factory reset current device</string>
<string name="gatt_erase_confirm">Erase all slots from %1$s?</string>
<string name="gatt_write_confirm">Write selections to %1$s?</string>
<string name="gatt_upload">Uploading binary…</string>
<string name="gatt_remove">Wiping slot data…</string>
<string name="gatt_create">Creating blank tag…</string>
<string name="gatt_format">Formatting device…</string>
<string name="fail_bluetooth_adapter">Bluetooth adapter unavailable!</string>
<string name="fail_no_device">No GATT device connected!</string>
<string name="tiramisu_bluetooth">Android 13 requires manually enabling Bluetooth. Open Settings to enable Bluetooth?</string>
<string name="fail_permissions">Required permission denied by user!</string>
<string name="location_disclosure">Location is required for Bluetooth LE scan. In accordance with Google Play policy, TagMo is required to notify you that location data may be collected in the background. TagMo does not read, store, or share location data. As such, this notice is strictly a formality.</string>
<string name="sort_mode_set">Set device mode</string>
<string name="paired_devices">Paired Bluetooth Devices</string>
<string name="device_address">MAC: %1$s</string>
<string name="device_services">UUID: %1$s</string>
<string name="switch_devices">Switch / disconnect device</string>
<string name="clone_random">Clone with random serial</string>
<string name="data_write">Wrote main data</string>
<string name="password_write">Wrote password</string>
<string name="lock_write">Wrote lock info</string>
<string name="lock_skipped">Lock info skipped</string>
<string name="auth_response">Auth response %1$s</string>
<string name="password">Password: %1$s</string>
<string name="validation_success">Data validation successful!</string>
<string name="no_source_data">Cannot validate: No data to compare.</string>
<string name="error_no_data">No data to write</string>
<string name="error_tag_protocol">NTAG215 required, found %1$s!</string>
<string name="error_tag_unavailable">NTAG215 connection cannot be established!</string>
<string name="error_state">State error. Invalid action: %1$s</string>
<string name="error_length">Must be 8 characters</string>
<string name="error_input">Invalid input</string>
<string name="error_min_max">Must be between %1$d and %2$d</string>
<string name="error_data_write">Error while writing main data (stage 1)</string>
<string name="error_password_write">Error while setting password (stage 2)</string>
<string name="error_lock_write">Error while setting lock info (stage 3)</string>
<string name="error_tag_rewrite">Tag already an amiibo</string>
<string name="error_tag_specs">Tag is not an NTAG215</string>
<string name="error_tag_version">Tag version error</string>
<string name="error_tag_faulty">NFC tag may be corrupt.\nPlease try different tags.</string>
<string name="error_version">Version information error</string>
<string name="error_amiibo_parse">amiibo info parse error</string>
<string name="error_powertag_key">Power Tag keys not loaded</string>
<string name="error_elite_write">Error while writing data to N2 Elite</string>
<string name="error_elite_auth">Error while authenticating N2 Elite</string>
<string name="error_amiitool_init">Failed to initialize amiitool</string>
<string name="error_auth_null">Auth result was null</string>
<string name="error_archive_format">Zip encoding not supported</string>
<string name="error_archive_invalid">Archive extraction failed!</string>
<string name="error_uri_unknown">Invalid or empty file selected!</string>
<string name="error_uri_size">File is not a key or valid bin!</string>
<string name="error_unknown">An unknown error has occurred.</string>
<string name="error_tag_format">Mifare Classic 1K required!</string>
<string name="error_nxp_required">NXP chipset is required!</string>
<string name="fail_update_git">Unable to contact update server!</string>
<string name="fail_update_url">Update invalid! Please try again.</string>
<string name="fail_ssl_update">OpenSSL security provider obsolete!</string>
<string name="fail_save_file">Failed writing tag to file</string>
<string name="fail_save_data">Failed to save tag data</string>
<string name="fail_read_size">Read failed! Unexpected read size.</string>
<string name="fail_read_uid">Could not read old UID</string>
<string name="fail_mismatch_uid">Source UID does not match the target!</string>
<string name="fail_uid_invalid">Invalid UID (%1$d byte hex)</string>
<string name="fail_primary_key">Sector 0 authentication failed!</string>
<string name="fail_sector_invalid">Invalid sector (0 15)</string>
<string name="fail_invalid_size">Invalid read result size</string>
<string name="fail_powertag_keys">Failed to load Power Tag keys</string>
<string name="fail_bank_oob">Selected bank exceeds count!</string>
<string name="fail_active_oob">Active bank beyond new count!</string>
<string name="fail_parse_banks">Failed to parse banks!</string>
<string name="fail_read_amiibo">Reading amiibo data failed!</string>
<string name="fail_early_remove">amiibo removed too early!</string>
<string name="fail_amiibo_null">Please scan the amiibo again</string>
<string name="fail_read">Read failed</string>
<string name="fail_auth">Authentication failed</string>
<string name="fail_decrypt_null">Cannot decrypt empty data.</string>
<string name="fail_decrypt">Failed to decrypt tag data</string>
<string name="fail_encrypt">Failed to encrypt tag data</string>
<string name="fail_display">Failed to display tag data</string>
<string name="fail_lock">Cannot lock a blank bank!</string>
<string name="fail_unlock">Failed to prepare unlock!</string>
<string name="fail_logcat">Failed to prepare logcat!</string>
<string name="fail_bitmap">Failed to generate bitmap!</string>
<string name="fail_bank_data">Binary data empty!\nSkipping bank %1$d…</string>
<string name="fail_randomize">Randomizer failed to duplicate data!</string>
<string name="fail_firmware_api">API disabled by firmware!</string>
<string name="no_tag_loaded"><No Tag Loaded></string>
<string name="read_error"><Error Reading Tag></string>
<string name="empty_tag"><Empty Tag></string>
<string name="blank_tag"><Blank Tag></string>
<string name="blank_bank">%1$s: <Blank Bank></string>
<string name="key_not_present">Key files not loaded!</string>
<string name="key_size_error">Key file size does not match.</string>
<string name="key_size_invalid">Invalid key file size</string>
<string name="key_signature_error">Key file signature does not match.</string>
<string name="invalid_key_error">No valid key in file.</string>
<string name="key_read_error">Error reading key from storage</string>
<string name="invalid_data_null">Cannot verify empty data.</string>
<string name="invalid_tag_prefix">Data must start with 0x04.</string>
<string name="invalid_tag_lock">Lock signature mismatch.</string>
<string name="invalid_tag_cc">CC signature mismatch.</string>
<string name="invalid_tag_dynamic">Dynamic lock signature mismatch.</string>
<string name="invalid_tag_cfg_zero">CFG0 signature mismatch.</string>
<string name="invalid_tag_cfg_one">CFG1 signature mismatch.</string>
<string name="invalid_uid_length">Invalid UID length</string>
<string name="invalid_file_size">%1$s size: %2$d, Expected: %3$d</string>
<string name="invalid_data_size">Tag size: %1$d, Expected: %2$d</string>
<string name="invalid_tag_key">Key file detected. Tag skipped.</string>
<string name="invalid_app_data">Invalid app data</string>
<string name="invalid_read_result">Invalid read result size</string>
<string name="uid_key_missing">No available key for UID</string>
<string name="p10_key_missing">No available key for P10_ID</string>
<string name="power_tag_verify">Power Tag identified: %1$s</string>
<string name="amiibo_info_parse_error">Unable to parse amiibo database</string>
<string name="amiibo_info_not_loaded">amiibo database not loaded</string>
<string name="amiibo_failure_load">Failed to load amiibo database</string>
<string name="amiibo_failure_parse">Failed to parse amiibo database</string>
<string name="amiibo_failure_read">Failed to read amiibo database</string>
<string name="amiibo_failure_update">Failed to update amiibo database</string>
<string name="amiibo_failure_server">Unable to contact database server</string>
<string name="amiibo_failure_parse_default">Failed to parse default amiibo database</string>
<string name="firmware_update">N2 Elite Firmware Updated!</string>
<string name="firmware_failed">Firmware update failed. Please try again! (%1$d)</string>
<string name="firmware_obsolete">Firmware update required!</string>
<string name="speed_scan">Lift tag slightly to complete scan</string>
<string name="tag_disconnect">Tag was removed too early!</string>
<string name="unzip_item">Unzipping %1$s…</string>
<string name="mkdir_failed">Mkdir ’%1$s’ failed!</string>
<string name="downloads_hidden">Downloads are currently hidden!</string>
<string name="controller_pro" translatable="false">Pro Controller</string>
<string name="controller_rjc" translatable="false">Right Joy-Con</string>
<string name="no_controllers">No connected controller found!</string>
<string name="sub_button">%1$s Monthly Donation</string>
<string name="iap_button">%1$s One-Time Donation</string>
<string name="donation_thanks">Thanks for supporting TagMo!</string>
<string name="settings_banner">TagMo Donation Subscriber</string>
<string name="external_search">Search Amiibo</string>
<string name="conversion_title">TagMo Critical Update</string>
<string name="conversion_message">GitHub and Google Play builds are now universal.\nPlease click continue to resolve installation conflicts.</string>
<string name="disclaimer_general">No statues were harmed in making this product.</string>
<string name="duplicate_reports">Duplicate bug reports are not required</string>
</resources>
``` |
```c
/* Testcase for PR c/1501. */
double __complex__
f (void)
{
return ~(1.0 + 2.0i);
}
``` |
```shell
# $OpenBSD: putty-ciphers.sh,v 1.13 2024/02/09 08:56:59 dtucker Exp $
# Placed in the Public Domain.
tid="putty ciphers"
puttysetup
cp ${OBJ}/sshd_proxy ${OBJ}/sshd_proxy_bak
# Since there doesn't seem to be a way to set MACs on the PuTTY client side,
# we force each in turn on the server side, omitting the ones PuTTY doesn't
# support. Grepping the binary is pretty janky, but AFAIK there's no way to
# query for supported algos.
macs=""
for m in `${SSH} -Q MACs`; do
if strings "${PLINK}" | grep -E "^${m}$" >/dev/null; then
macs="${macs} ${m}"
else
trace "omitting unsupported MAC ${m}"
fi
done
ciphers=""
for c in `${SSH} -Q Ciphers`; do
if strings "${PLINK}" | grep -E "^${c}$" >/dev/null; then
ciphers="${ciphers} ${c}"
else
trace "omitting unsupported cipher ${c}"
fi
done
for c in default $ciphers; do
for m in default ${macs}; do
verbose "$tid: cipher $c mac $m"
cp ${OBJ}/.putty/sessions/localhost_proxy \
${OBJ}/.putty/sessions/cipher_$c
if [ "${c}" != "default" ]; then
echo "Cipher=$c" >> ${OBJ}/.putty/sessions/cipher_$c
fi
cp ${OBJ}/sshd_proxy_bak ${OBJ}/sshd_proxy
if [ "${m}" != "default" ]; then
echo "MACs $m" >> ${OBJ}/sshd_proxy
fi
rm -f ${COPY}
env HOME=$PWD ${PLINK} -load cipher_$c -batch -i ${OBJ}/putty.rsa2 \
cat ${DATA} > ${COPY}
if [ $? -ne 0 ]; then
fail "ssh cat $DATA failed"
fi
cmp ${DATA} ${COPY} || fail "corrupted copy"
done
done
rm -f ${COPY}
``` |
```shell
Let's play the blame game
Cache your authentication details to save time
Specify a commit by its ancestry
Interactive staging
Debug using binary search
``` |
Seth Wescott (born June 28, 1976) is an American snowboarder. He is a two-time Olympic champion in the snowboard cross.
Life and career
Wescott was born in Durham, North Carolina, and lives in Whistler, British Columbia. Growing up, Wescott went to Mount Blue regional school district in Farmington, Maine. His father Jim Wescott was the Track and Cross Country coach at Colby College. He began snowboarding at age 10, but had also grown up skiing. In 1989, after competing in both sports for a few years, he stopped skiing to focus mainly on snowboarding. Wescott attended Carrabassett Valley Academy where he studied and trained with fellow Olympians Bode Miller, Jeff Greenwood, Kirsten Clark and Emily Cook. He started out at Sugarloaf in Carrabassett Valley, Maine.
In his Olympic debut, at the 2006 Winter Olympics in Torino, Italy, Wescott won gold in the snowboard cross as the first Olympic champion in the event. Having won gold, Wescott was invited to meet president George W. Bush, but turned down the offer, citing his opposition to Bush's foreign and domestic policies. At the 2010 Winter Olympics in Vancouver, British Columbia, Canada, Wescott successfully defended his Olympic gold. Wescott, who started off the race in fourth, slowly advanced throughout the field until the end, when he narrowly defeated hometown favorite Mike Robertson on the final jump.
Wescott co-owns The Rack, a restaurant and bar near Sugarloaf that caters food and drinks to skiers and snowboarders.
On February 25, 2010, Wescott appeared on The Colbert Report. In 2012, he participated in Fox's dating game show The Choice.
Wescott attended Western State College in Gunnison, CO.
References
External links
NBC Olympics
Official website
1976 births
American male snowboarders
Living people
Olympic gold medalists for the United States in snowboarding
Sportspeople from Durham, North Carolina
People from Franklin County, Maine
Snowboarders at the 2006 Winter Olympics
Snowboarders at the 2010 Winter Olympics
X Games athletes
Olympic medalists in snowboarding
Medalists at the 2010 Winter Olympics
Medalists at the 2006 Winter Olympics
Participants in American reality television series
Sportspeople from Maine
20th-century American people
21st-century American people |
HJIM van Gasteren is the pseudonym of Henriëtte Johanna Ignatia Maria van Gasteren (Sevenum, 9 September 1964), a Dutch multimedia artist, known for her, sometimes controversial, self-portraits. She was formerly known as Lilith Love but she changed her artist name in 2020. Recurring themes in her work are: identity, femininity, female archetypes, gender bending, freedom and equality.
Early life
Henriëtte is the youngest in a family of four. Her father was a clog maker and mailman. Since her childhood she has been writing, drawing and cooking. She attended the Schoevers Academy in Nijmegen and worked as an executive secretary from 1983 till 2000.
Writer to photographer
In 2005 Henriëtte resumed writing. Her culinary erotic story Kalfsbraadstuk op tagliatelle met een zachte saus van witte port en kaas (Veal roast on tagliatelle with a smooth sauce of white port and cheese) was published in: Raadselige Roos 2005, a collection of stories that had entered the competition for prose and poetry of the Literary Cafe for the Venray-region.
To illustrate the blogs that she posted online, she started to make self-portraits to go with the stories. At first she used a webcam, then she switched to a simple compact camera. In 2006 the self-portraits almost completely replaced the stories and from that moment on she tells her life story with photos, using a single-lens reflex camera, tripod and remote control.
Controversy
Henriëtte's work has caused controversy on several occasions. She has also been censored during an exhibition in the Euregio-Haus in Mönchengladbach, Germany and during an exhibition in the convention center (and former seminary) Rolduc in Kerkrade, The Netherlands. Her self-portrait Forgive me, Father, for... from the religious series I could’ve had religion made the front page of the Dutch newspaper Sp!ts because of it.
In 2012 she was one of the ten leading artists from Limburg who were exhibited at the Pulchri Studio in The Hague, together with Ted Noten, Charles Eyck and Lei Molin. In the same year her work was also shown in the USA for the first time. During Photoville in Brooklyn Bridge Park, New York City her work could be seen at two exhibitions: The Wonder of Woman and FotoFestival Naarden.
Photo documentary
In 2012 she started her project A house is not a home, in which the houses of complete strangers are the setting for her self-portraits. That same year she also started the photo documentary Risja, a story by Lilith - This is bugging me, about Risja Steeghs a girl who lives in her village and who suffers from a severe form of Lyme disease. The 'Huis voor de Kunsten Limburg' in Roermond, The Netherlands, financially supported the travelling exhibition and the publication of a photo book with the same name. The proceeds from the book sales go to TeekOnMe, a foundation that supports the research of Lyme disease.
Private
Partner Henk Temming.
Books
2012: Risja, a story by Lilith - This is bugging me
2013: A house is not a home
2015: Over hoeren & madonna’s (met sonnetten van Paul Sterk)
2016: Skinny dipping
2020: HJIM, Greatest hits
Museums
Museum van Bommel van Dam (dutch), Venlo NL
Museum for modern art IKOB (dutch), Eupen B
Limburgs Museum (dutch), Venlo NL
Gemeentemuseum W: (dutch), Weert NL
CODA museum (dutch), Apeldoorn NL
Joods Cultureel Kwartier (dutch), Amsterdam NL
w:nl:Fotomuseum aan het Vrijthof, Maastricht NL
Museum Aktfotoart Dresden (german), Dresden DE
References
External links
Official website
Interview with GrungeCake Magazine
Article in Aorta Mag
Interview with Kaltblut
1964 births
Living people
21st-century Dutch artists
Dutch women photographers
People from Horst aan de Maas
21st-century Dutch photographers
21st-century women photographers |
Espérance Hippolyte Lassagne (c. 1786 – 1854) was a French chansonnier and playwright during the first half of the 19th century.
Biography
An employee at the Palais-Royal (1823) in the administration of the Duke of Orleans (Louis Philippe I) in Paris, he had under him Alexandre Dumas then hired as a copyist, whom he introduced into the literary life. He wrote with him the play La Noce et l'Enterrement which would be presented at the Théâtre de la Porte-Saint-Martin in 1826.
His plays were presented on the most significant Parisian stages of his fifetime: Théâtre du Vaudeville, Théâtre de l'Odéon, Théâtre des Variétés etc.
Works
1824: La Pièce de circonstance, ou le Théâtre dans la caserne, à-propos-vaudeville
1824: La Rue du Carrousel, ou le Musée en boutique, vaudeville in 1 act, with Théodore Anne
1825: Dansera-t-on ? ou les Deux adjoints, à-propos vaudeville in 1 act, with Paul Ledoux
1825: Les Singes, ou la Parade dans le salon, vaudeville in 1 act, with Rochefort and Brisset
1826: La pêche de Vulcain, ou L'île des fleuves, à-propos mingled with vaudeville, with Mathurin-Joseph Brisset and Edmond Rochefort
1826: Le Prologue impromptu, ou les Acteurs en retard, à propos in 1 act and in vaudevilles, with Marc-Antoine Désaugiers
1826: La Noce et l'Enterrement, play, with Alexandre Dumas and Gustave Vulpian
1828: Le Farceur de société, ou les Suites d'une parade, play in 2 acts, mingled with couplets, with Rochefort
1828: Les Omnibus, ou la Revue en voiture, vaudeville en 4 tableaux, with Frédéric de Courcy and Charles Dupeuty
1828: Le Restaurant, ou le Quart d'heure de Rabelais, tableau-vaudeville in 1 act, with de Courcy
undated; Le Retour du guernadier, song
References
19th-century French dramatists and playwrights
French chansonniers
1854 deaths
Alexandre Dumas
Year of birth uncertain |
René Anthony Rougeau (born March 25, 1986) is an American professional basketball player for Helsinki Seagulls of the Korisliiga. He played college basketball for the University of Nevada, Las Vegas where he starred in his four seasons with the Runnin' Rebels.
Professional career
Early years (2009–2010)
Following graduating from UNLV, Rougeau joined the Nevada Pride of the International Basketball League before going undrafted in the 2009 NBA draft. He then joined the Clayton Showtime of the American Basketball Association in December 2009.
On February 12, 2010, Rougeau signed with the Southland Sharks for the 2010 New Zealand NBL season. He went on to be named in the All-Star Five after averaging 16.2 points, 9.2 rebounds, 2.1 assists, 3.7 steals and 1.5 blocks in 19 games.
Mexico (2010–2014)
Following a promising first outing with the Sharks, Rougeau moved to Mexico where he began what would end up being a four-year stint in the country. From 2010 to 2014, he played for Toros de Nuevo Laredo of the Liga Nacional de Baloncesto Profesional where he won two championships (2011 and 2013) and earned two All-Star nods (2012 and 2014). He also played for Caballeros de Culiacán of the CIBACOPA during the 2011, 2012 and 2014 LNBP off-seasons. He also played for Mineros de Cananea of the CIBACOPA and the Venice Beach Warriors of the WCBL in 2013, and for Bucaneros de La Guaira of Venezuela in 2014.
Israel (2014–2016)
On July 3, 2014, Rougeau signed a two-year deal with Maccabi Haifa of the Israeli Basketball Premier League.
Later career (2016–present)
Rougeau signed in Finland with Kauhajoen Karhu in 2017. During the 2018-19 season, he averaged 15.8 points, 8.0 rebounds, 3.5 assists, 1.8 steals and 1.5 blocks per game, and was named the league's Foreign MVP. In July 2019, Rougeau signed with Hermine Nantes Basket of the French LNB Pro B. After earning Eurobasket.com All-French ProB 2nd Team honors, he re-signed with the team on June 8, 2020.
Personal
Rougeau is a devout Christian. He reads the Bible in the locker room before every game.
References
External links
UNLV bio
Eurobasket.com profile
RealGM profile
1986 births
Living people
African-American basketball players
American expatriate basketball people in Finland
American expatriate basketball people in France
American expatriate basketball people in Israel
American expatriate basketball people in Mexico
American expatriate basketball people in New Zealand
American expatriate basketball people in Venezuela
American men's basketball players
Basketball players from Sacramento, California
Caballeros de Culiacán players
Hermine Nantes Basket players
Kauhajoen Karhu players
Maccabi Haifa B.C. players
Sportspeople from Rancho Cucamonga, California
Shooting guards
Small forwards
Southland Sharks players
Basketball players from San Bernardino County, California
Toros de Nuevo Laredo players
UNLV Runnin' Rebels basketball players
21st-century African-American sportspeople
Etiwanda High School alumni |
Liszna is a village in the administrative district of Gmina Sanok, within Sanok County, Subcarpathian Voivodeship, in south-eastern Poland. It lies approximately north-east of Sanok and south of the regional capital Rzeszów.
References
Liszna |
```xml
import { Route, Routes, useLocation, useParams } from 'react-router-dom';
import React from 'react';
import asyncComponent from '@erxes/ui/src/components/AsyncComponent';
import queryString from 'query-string';
const CompanyDetails = asyncComponent(
() =>
import(
/* webpackChunkName: "CompanyDetail" */ './containers/detail/CompanyDetails'
),
);
const CompaniesList = asyncComponent(
() =>
import(
/* webpackChunkName: "CompaniesList" */ './containers/CompaniesList'
),
);
const Details = () => {
const { id = '' } = useParams();
return <CompanyDetails id={id} />;
};
const List = () => {
const location = useLocation();
const queryParams = queryString.parse(location.search);
localStorage.setItem('erxes_contact_url', 'companies');
return <CompaniesList queryParams={queryParams} />;
};
const routes = () => {
return (
<Routes>
<Route
path="/companies/details/:id"
key="/companies/details/:id"
element={<Details />}
/>
<Route path="/companies" key="/companies" element={<List />} />
</Routes>
);
};
export default routes;
``` |
```shell
#!/bin/bash -e
$(dirname "$0")/install.sh
HOMEBREW_NO_INSTALL_CLEANUP=1 HOMEBREW_NO_AUTO_UPDATE=1 brew install ruby
export PATH="/usr/local/opt/ruby/bin:$PATH"
gem install xcpretty
export CODE_SIGNING_REQUIRED=NO
HOMEBREW_NO_INSTALL_CLEANUP=1 HOMEBREW_NO_AUTO_UPDATE=1 brew tap wix/brew
HOMEBREW_NO_INSTALL_CLEANUP=1 HOMEBREW_NO_AUTO_UPDATE=1 brew install applesimutils
echo 'export PATH=$PATH' >> $BASH_ENV
``` |
Tjiuee Uanivi (born 31 December 1990) is a Namibian rugby union player that normally plays as a lock or flanker. He currently plays for US Montauban in the ProD2.
Early life
Uanivi was born in Otijwarongo and grew up in Windhoek. He first picked up a rugby ball whilst attending Pioneerspark Primary school before moving on to Academia High School where he was more interested in football than rugby, but picked it up again after school and joined United Rugby Club. He studied at the University of Namibia.
Rugby Union career
Amateur career
When not involved with the Glasgow Warriors, Uanivi played for the Glasgow Hawks.
Professional career
Whilst playing for the Namibian tertiary institutes rugby team at the 2013 World Student Games he was spotted by a coach from Top14 side Brive who offered him a place at the club's academy. He debuted against Toulon in the same year and continued to play for them until 2015 having been offered a professional contract in his second season. After the 2015 Rugby World Cup, he moved to South Africa to join the; he was also included in the squad for the 2016 Super Rugby season.
He played five times for a in the 2016 Currie Cup qualification series – and returned to the northern hemisphere, signing for Scottish Pro12 side Glasgow Warriors for the 2016–2017 season.
Uanivi made his debut for the Warriors in the pre-season match against Harlequins on 20 August 2016.
On 4 May 2017 it was announced that Uanivi would leave the Warriors at the end of the season. He played 5 times for the Glasgow club.
On 13 July 2017 it was announced that Uanivi had signed for London Scottish.
He left London Scottish after the 2018/19 season to join RC Massy in the Federale 1. He spent two seasons with the French third division club.
On 9 March 2021 it was announced that Uanivi had signed for French ProD2 side US Montauban for the 2021/22 season.
International career
He made his debut for Namibia in 2014 against Germany, and was a member of their 2015 Rugby World Cup squad. He was selected for the 2019 Rugby World Cup and was selected to start all four games, captaining the team against eventual winners South Africa and Italy.
References
1990 births
Living people
CA Brive players
Rugby union flankers
Rugby union locks
Namibian rugby union players
Namibia international rugby union players
People from Otjiwarongo
Sportspeople from Otjozondjupa Region
Glasgow Warriors players
Glasgow Hawks players
London Scottish F.C. players
US Montauban players
2015 Rugby World Cup players
2019 Rugby World Cup players
2023 Rugby World Cup players |
Ed Miliband became Leader of the Labour Party and Leader of the Opposition upon being elected to the former post on 25 September 2010. The election was triggered by Gordon Brown's resignation following the party's fall from power at the 2010 general election, which yielded a Conservative–Liberal Democrat Coalition. Miliband appointed his first Shadow Cabinet in October 2010, following the Labour Party Shadow Cabinet elections. These elections were the last such elections before they were abolished in 2011.
Miliband conducted two major reshuffles in 2011 and 2013, with a number of minor changes throughout his term.
Following the 2015 general election and Miliband's resignation, acting leader Harriet Harman announced a new shadow cabinet to last until the election of a new party leader in September 2015.
Shadow Cabinet from 2010 to 2015
Initial Shadow Cabinet
Miliband announced his first Shadow Cabinet on 8 October 2010 following the 2010 Shadow Cabinet elections. Under the party rules, as amended in 2010, the Shadow Cabinet comprised the Leader, the Deputy Leader, the Leader of the Labour Peers, the Chief Whips in both houses, and 19 MPs elected by the Parliamentary Labour Party.
Ed Miliband – Leader of Her Majesty's Most Loyal Opposition and Leader of the Labour Party
Harriet Harman – Shadow Deputy Prime Minister, Deputy Leader of the Opposition, Deputy Leader of the Labour Party and Shadow Secretary of State for International Development
Alan Johnson – Shadow Chancellor of the Exchequer
Yvette Cooper – Shadow Foreign Secretary and Shadow Minister for Women and Equalities
Ed Balls – Shadow Home Secretary
Rosie Winterton – Opposition Chief Whip in the House of Commons
Andy Burnham – Shadow Secretary of State for Education and Election Coordinator
Sadiq Khan – Shadow Lord Chancellor and Shadow Secretary of State for Justice (with responsibility for political and constitutional reform)
Liam Byrne – Shadow Secretary of State for Work and Pensions
John Denham – Shadow Secretary of State for Business, Innovation and Skills
John Healey – Shadow Secretary of State for Health
Caroline Flint – Shadow Secretary of State for Communities and Local Government
Jim Murphy – Shadow Secretary of State for Defence
Meg Hillier – Shadow Secretary of State for Energy and Climate Change
Hilary Benn – Shadow Leader of the House of Commons and Shadow Lord Privy Seal
Maria Eagle – Shadow Secretary of State for Transport
Mary Creagh – Shadow Secretary of State for Environment, Food and Rural Affairs
Angela Eagle – Shadow Chief Secretary to the Treasury
Shaun Woodward – Shadow Secretary of State for Northern Ireland
Ann McKechin – Shadow Secretary of State for Scotland
Peter Hain – Shadow Secretary of State for Wales
Ivan Lewis – Shadow Secretary of State for Culture, Media and Sport
Janet Baroness Royall of Blaisdon – Leader of the Opposition in the House of Lords
Liam Byrne – Shadow Minister for the Cabinet Office
Tessa Jowell – Shadow Minister for the Olympics
Steve Lord Bassam of Brighton – Opposition Chief Whip in the House of Lords
Patricia Scotland – Shadow Attorney General
Also attending Shadow Cabinet meetings:
Jon Trickett – Shadow Minister of State for the Cabinet Office
Subsequent changes
20 January 2011: Johnson resigned as Shadow Chancellor and was replaced by Ed Balls, who was replaced by Cooper as Shadow Home Secretary. She (while remaining Shadow Equalities Minister) was succeeded as Shadow Foreign Secretary by Alexander, whom Byrne replaced as Shadow Work and Pensions Secretary. Jowell took Byrne's role as Shadow Minister for the Cabinet Office, while retaining her role as Shadow Olympics Minister.
2011 reshuffle
On 7 October 2011, Miliband conducted a major reshuffle of his Shadow Cabinet. This followed the Labour Party Conference at which delegates voted to allow the party leader to choose the membership of the Shadow Cabinet, eliminating elections by MPs. Healey chose to stand down from frontline politics and was replaced as Shadow Health Secretary by Andy Burnham, whose Education portfolio went to Stephen Twigg, a newcomer to the Shadow Cabinet, and whose responsibilities as Election Co-ordinator went to Tom Watson, also new to the Shadow Cabinet and who also was given the title "Deputy Chair of the Labour Party". Denham chose to stand down from the Business portfolio, becoming Miliband's Parliamentary Private Secretary. He was replaced by new Shadow Minister of State for Small Business, Chuka Umunna.
Harman and Lewis swapped substantive portfolios (International Development to Lewis and Culture to Harman). Trickett took primary responsibility for shadowing the Cabinet Office from Jowell. The latter retained her position in the Shadow Cabinet as well as her roles as Shadow Minister for London and for the Olympics. Woodward (Northern Ireland) and McKechin (Scotland) were both left out of the Shadow Cabinet, being replaced by newcomers: Vernon Coaker and Margaret Curran, respectively.
Hillier left the Shadow Cabinet, and was replaced at the Energy portfolio by Flint. She was in turn replaced at Communities and Local Government by Benn, whose role as Shadow Leader of the House went to Angela Eagle. She was replaced as Shadow Chief Secretary to the Treasury by Rachel Reeves, who was new to the Shadow Cabinet. Hain retained his responsibilities and was named Chair of the National Policy Forum. Byrne likewise retained his portfolio and added "Policy Review Co-ordinator", reflecting work he had already taken on.
Additionally, Emily Thornberry replaced Patricia Scotland as Shadow Attorney General, with the right to attend Shadow Cabinet, but not full membership. Three others obtained the right to attend Shadow Cabinet: Stewart Lord Wood of Anfield retained his role as a Shadow Minister without Portfolio on the Shadow Cabinet Office team (i.e., the Opposition equivalent of the Cabinet Office). Michael Dugher also became a Shadow Minister without Portfolio with the right to attend Shadow Cabinet meetings. Liz Kendall was appointed Shadow Minister for Care and Older People with the right to attend Shadow Cabinet.
Finally, the Shadow Cabinet list announced on the day of the reshuffle did not note Khan, the Shadow Justice Secretary, as having "responsibility for political and constitutional reform" as it previously had. It is not clear whether he retained this responsibility or it transferred to Harman, whose title has been listed as "Shadow Deputy Prime Minister" instead of "Deputy Leader of the Opposition"; Nick Clegg, the Deputy Prime Minister, was the Government minister with responsibility for political and constitutional reform.
Ed Miliband – Leader of Her Majesty's Most Loyal Opposition and Leader of the Labour Party
Harriet Harman – Shadow Deputy Prime Minister, Deputy Leader of the Opposition, Shadow Secretary of State for Culture, Media and Sport, Deputy Leader of the Labour Party and Labour Party Chair
Ed Balls – Shadow Chancellor of the Exchequer
Douglas Alexander – Shadow Foreign Secretary
Yvette Cooper – Shadow Home Secretary and Shadow Minister for Women and Equalities
Sadiq Khan – Shadow Lord Chancellor and Shadow Secretary of State for Justice
Rosie Winterton – Opposition Chief Whip in the House of Commons
Andy Burnham – Shadow Secretary of State for Health
Stephen Twigg – Shadow Secretary of State for Education
Chuka Umunna – Shadow Secretary of State for Business, Innovation and Skills
Jim Murphy – Shadow Secretary of State for Defence
Hilary Benn – Shadow Secretary of State for Communities and Local Government
Angela Eagle – Shadow Leader of the House of Commons
Rachel Reeves – Shadow Chief Secretary to the Treasury
Caroline Flint – Shadow Secretary of State for Energy and Climate Change
Tessa Jowell – Shadow Minister for London and Shadow Minister for the Olympics
Maria Eagle – Shadow Secretary of State for Transport
Liam Byrne – Shadow Secretary of State for Work and Pensions and Policy Review Co-ordinator
Ivan Lewis – Shadow Secretary of State for International Development
Mary Creagh – Shadow Secretary of State for Environment, Food and Rural Affairs
Jon Trickett – Shadow Minister for the Cabinet Office
Tom Watson – Deputy Chair of the Labour Party and Campaign Coordinator
Vernon Coaker – Shadow Secretary of State for Northern Ireland
Margaret Curran – Shadow Secretary of State for Scotland
Peter Hain – Shadow Secretary of State for Wales and Chair of the National Policy Forum
Janet Baroness Royall of Blaisdon – Leader of the Opposition in the House of Lords
Steve Lord Bassam of Brighton – Opposition Chief Whip in the House of Lords
Also attending Shadow Cabinet meetings:
Liz Kendall – Shadow Minister for Care and Older People
Michael Dugher – Shadow Minister without Portfolio
Emily Thornberry – Shadow Attorney General
Stewart Lord Wood of Anfield – Shadow Minister without Portfolio
Subsequent changes
On 15 May 2012, following the resignation of Peter Hain as Shadow Welsh Secretary, Miliband conducted a mini-reshuffle: Owen Smith was appointed to replace Hain, while Jon Cruddas replaced Liam Byrne as Policy Review Co-ordinator.
On 11 September 2012, Dame Tessa Jowell left the shadow cabinet, after saying she planned to retire from frontline politics.
2013 reshuffle
On 7 October 2013, Ed Miliband carried out a reshuffle of his front bench team. The moves included demotions of prominent Blairites including Jim Murphy, who went from Defence to International Development, and Ivan Lewis who moved from International Development to the shadow Northern Ireland portfolio. Also, Liam Byrne and Stephen Twigg moved respectively from Work and Pensions and from Education to junior shadow ministerial positions at Business and Education. Prominent promotions included Tristram Hunt to Education, Rachel Reeves to Work and Pensions, Vernon Coaker to Defence, and Chris Leslie to Shadow Chief Secretary to the Treasury. Douglas Alexander was appointed Chair of General Election Strategy and Planning.
Ed Miliband – Leader of Her Majesty's Most Loyal Opposition and Leader of the Labour Party
Harriet Harman – Shadow Deputy Prime Minister, Deputy Leader of the Opposition, Shadow Secretary of State for Culture, Media and Sport, Deputy Leader of the Labour Party and Labour Party Chair
Ed Balls – Shadow Chancellor of the Exchequer
Douglas Alexander – Shadow Foreign Secretary and Chair of the General Election Strategy and Planning
Yvette Cooper – Shadow Home Secretary and Shadow Minister for Women and Equalities
Sadiq Khan – Shadow Lord Chancellor and Shadow Secretary of State for Justice
Rosie Winterton – Opposition Chief Whip in the House of Commons
Andy Burnham – Shadow Secretary of State for Health
Tristram Hunt – Shadow Secretary of State for Education
Chuka Umunna – Shadow Secretary of State for Business, Innovation and Skills
Vernon Coaker – Shadow Secretary of State for Defence
Jim Murphy – Shadow Secretary of State for International Development
Hilary Benn – Shadow Secretary of State for Communities and Local Government
Angela Eagle – Shadow Leader of the House of Commons
Rachel Reeves – Shadow Secretary of State for Work and Pensions
Caroline Flint – Shadow Secretary of State for Energy and Climate Change
Mary Creagh – Shadow Secretary of State for Transport
Maria Eagle – Shadow Secretary of State for Environment, Food and Rural Affairs
Chris Leslie – Shadow Chief Secretary to the Treasury
Margaret Curran – Shadow Secretary of State for Scotland
Ivan Lewis – Shadow Secretary of State for Northern Ireland
Owen Smith – Shadow Secretary of State for Wales
Gloria De Piero – Shadow Minister for Women and Equalities
Michael Dugher – Shadow Minister for the Cabinet Office and Head of Communications
Jon Trickett – Shadow Minister without Portfolio and Deputy Party Chair
Janet Baroness Royall of Blaisdon – Shadow Leader of the House of Lords
Also attending Shadow Cabinet meetings:
Emma Reynolds – Shadow Minister for Housing
Liz Kendall – Shadow Minister for Care and Older People
Emily Thornberry – Shadow Attorney General
Jon Cruddas – Chair of the Labour Party Policy Review
Stewart Lord Wood of Anfield – Shadow Minister without Portfolio
Steve Lord Bassam of Brighton – Labour Chief Whip in the House of Lords
Glenis Willmott - Leader of the EPLP
Subsequent changes
On 2 November 2014, Jim Murphy resigned as Shadow International Development Secretary to campaign for the leadership of the Scottish Labour Party. Subsequently, on 5 November, a number of changes to the composition of the shadow cabinet were announced: Shadow Transport Secretary Mary Creagh replaced Murphy at International Development, who was replaced by Michael Dugher, hitherto the Shadow Minister for the Cabinet Office; he was in turn replaced by Lucy Powell.
On 20 November 2014, Emily Thornberry resigned as Shadow Attorney General following a backlash resulting from her sending of a controversial tweet. Willy Lord Bach was named as her replacement on 3 December.
See also
Official Opposition (United Kingdom)
Official Opposition frontbench
Cabinet of the United Kingdom
British Government frontbench
Liberal Democrat frontbench team
Labour Party Shadow Cabinet election, 2010
References
External links
Ed Miliband
Miliband
Official Opposition (United Kingdom)
2010 establishments in the United Kingdom
British shadow cabinets
2010 in British politics
2015 disestablishments in the United Kingdom |
The 2023 Madrid Open (sponsored by Mutua) was a professional tennis tournament played on outdoor clay courts at the Park Manzanares in Madrid, Spain from 25 April to 7 May 2023. It was the 21st edition of the event on the ATP Tour and 14th on the WTA Tour. It is classified as an ATP Tour Masters 1000 event on the 2023 ATP Tour and a WTA 1000 event on the 2023 WTA Tour.
This is the first year that the men's tournament was expanded to two weeks and the men's and women's singles draws were expanded to 96 players.
Champions
Men's singles
Carlos Alcaraz def. Jan-Lennard Struff 6–4, 3–6, 6–3
It was Alcaraz's fourth title of the year and 10th of his career. It was his 4th Masters title and his 2nd win at Madrid, also winning in 2022.
Women's singles
Aryna Sabalenka def. Iga Świątek 6–3, 3–6, 6–3
Men's doubles
Karen Khachanov / Andrey Rublev def. Rohan Bopanna / Matthew Ebden 6–3, 3–6, [10–3]
Women's doubles
Victoria Azarenka / Beatriz Haddad Maia def. Coco Gauff / Jessica Pegula 6–1, 6–4
Points and prize money
Point distribution
* Players with byes receive first round points.
Prize money
The ATP and WTA will each play for a share of €7,705,780.
*per team
References
External links
Official website
(ATP) tournament profile |
Blick Mead is a chalkland spring in Wiltshire, England, separated by the River Avon from the northwest edge of the town of Amesbury. It is close to an Iron Age hillfort known as Vespasian's Camp and about a mile east of the Stonehenge ancient monument. Evidence from archaeology excavation at the site since 2005 indicates that there was continuous human habitation from 10,000 BP (8,000 BCE) to 6,000 BP (4,000 BCE).
35,000 worked flints and 2400 animal bones, some cooked, mostly from aurochsen, have been found at the site. There is also the remains of a pit dwelling. A few finds have been used to radiocarbon date the time of settlement. It is thought that the site would have been an attractive place to camp or dwell, with a spring that never freezes over; the issuing water has a constant temperature of around .
Oxygen isotope analysis of a single canine premolar found at Blick Mead has been interpreted as evidence that people had travelled a long way to get there and that this was associated with its proximity to Stonehenge. However, this is inconclusive as, while the isotope values are not consistent with the dog originating at the site, it represents the only example of a dietary isotope profile for a tooth from the Mesolithic, from any species.
A rare algae called Hildenbrandia lives in the spring and causes stones taken from it to turn bright red on exposure to air in a matter of hours. In Mesolithic times this could have given the place a magical significance. Its closeness to Stonehenge has led to theories that it is the attraction that first brought hunters to the area, with the colour-changing stones giving the place a spiritual significance.
References
Further reading
Amesbury
Archaeological sites in Wiltshire
Sites associated with Stonehenge
Springs of England |
Eugenia (minor planet designation: 45 Eugenia) is a large asteroid of the asteroid belt. It is famed as one of the first asteroids to be found to have a moon orbiting it. It was also the second triple asteroid to be discovered, after 87 Sylvia.
Discovery
Eugenia was discovered on 27 June 1857 by the Franco-German amateur astronomer Hermann Goldschmidt. His instrument of discovery was a 4-inch aperture telescope located in his sixth floor apartment in the 6th Arrondissement of Paris. It was the forty-fifth minor planet to be discovered. The preliminary orbital elements were computed by Wilhelm Forster in Berlin, based on three observations in July, 1857.
The asteroid was named by its discoverer after Empress Eugenia di Montijo, the wife of Napoleon III. It was the first asteroid to be definitely named after a real person, rather than a figure from classical legend.
Physical characteristics
Eugenia is a large asteroid, with a diameter of 214 km. It is an F-type asteroid, which means that it is very dark in colouring (darker than soot) with a carbonaceous composition. Like Mathilde, its density appears to be unusually low, indicating that it may be a loosely packed rubble pile, not a monolithic object. Eugenia appears to be almost anhydrous. Lightcurve analysis indicates that Eugenia's pole most likely points towards ecliptic coordinates (β, λ) = (-30°, 124°) with a 10° uncertainty, which gives it an axial tilt of 117°. Eugenia's rotation is then retrograde, rotating backward to its orbital plane.
Satellite system
Petit-Prince
In November 1998, astronomers at the Canada-France-Hawaii Telescope on Mauna Kea, Hawaii, discovered a small moon orbiting Eugenia. This was the first time an asteroid moon had been discovered by a ground-based telescope. The moon is much smaller than Eugenia, about 13 km in diameter, and takes five days to complete an orbit around it.
The discoverers chose the name "Petit-Prince" (formally "(45) Eugenia I Petit-Prince"). This name refers to Empress Eugenia's son, the Prince Imperial. However, the discoverers also intended an allusion to the children's novella The Little Prince by Antoine de Saint-Exupéry, which is about a young prince who lives on an asteroid.
S/2004 (45) 1
A second, smaller (estimated diameter of 6 km) satellite that orbits closer to Eugenia than Petit-Prince has since been discovered and provisionally named S/2004 (45) 1. It was discovered by analyses of three images acquired in February 2004 from the 8.2 m VLT "Yepun" at the European Southern Observatory (ESO) Cerro Paranal, in Chile. The discovery was announced in IAUC 8817, on 7 March 2007 by Franck Marchis and his IMCCE collaborators. It orbits the asteroid at about ~700 km, with an orbital period of 4.7 days.
See also
Dactyl and Ida, another asteroid and asteroid moon system catalogued by astronomers
Florence, another dual-moon asteroid confirmed only in September 2017.
References
External links
Johnston Archive data
Astronomical Picture of Day 14 October 1999
SwRI Press Release
Orbit of Petit-Prince, companion of Eugenia
Shape model derived from lightcurve (on page 17)
14 frames of (45) Eugenia primary taken with the Keck II AO from Dec 2003 to Nov 2011 (Franck Marchis)
000045
Discoveries by Hermann Goldschmidt
Named minor planets
45 Eugenia
45 Eugenia
000045
000045
000045
18570627 |
The Old Willis Place: A Ghost Story is a children's novel written by Mary Downing Hahn. It was first published in 2004 and is found in 9001 libraries.
Synopsis
Diana and her younger brother Georgie live in the woods near Oak Hill Manor, known locally as the Old Willis Place after its last inhabitant, a cruel old woman named Lilian Willis. Diana and Georgie have many rules they must follow, including never going beyond the property's boundaries, never speaking to anyone, and never allowing themselves to be seen. The county hires caretakers to live in a mobile home on the Willis property; however, Diana and Georgie always manage to drive them away with their childish pranks.
Diana is excited to see that the latest caretaker has a daughter named Lissa, a lonely, imaginative girl whose mother died when she was five. Diana imagines becoming friends with Lissa, even though the rules forbid it. Soon after her arrival, Lissa goes exploring and is the verge of entering the house when Diana steps out of the woods to stop her. Diana is so filthy and ragged that Lissa mistakes her for a monster and flees.
Upset by Lissa's reaction, Diana writes an apology for frightening Lissa and asks if they can be friends. Lissa confides that she plans to sneak into the house and explore while her father is away, inviting Diana to go with her. Diana is wary, as entering the house is against the rules, but she is so desperate to have Lissa for a friend that she agrees. The following day, Diana and Lissa enter the Old Willis Place, where Lissa feels compelled to see the locked parlor where Lilian Willis died. In spite of Diana's attempts to stop her, she opens the parlor door, freeing Miss Lilian's malevolent spirit.
Knowing that Miss Lilian will come after them, Diana and Georgie finally admit to Lissa that they themselves are ghosts. Sixty years ago, Miss Lilian caught them playing in her cellar and locked them in as punishment, intending to free them later that day when their parents returned. Before she could do so, Miss Lilian suffered a stroke and was taken to hospital, leaving the children trapped. Paralyzed by the stroke, Miss Lilian was unable to tell anyone what she had done, and by the time she recovered, several weeks had passed and the children had starved to death. Miss Lilian left the bodies hidden in the cellar and pretended to have no knowledge of what became of the missing children. For decades afterwards, the children's ghosts tormented Miss Lilian until she, too, died and became a ghost who pursued and tormented the children who once tormented her. The children managed to trap her ghost in the parlor and made strict rules to prevent her from ever being freed.
Lissa tells her father to search the cellar, where he finds Diana and Georgie's bodies. The bodies are at last given proper burials, while Diana and Georgie wonder what will become of them now. They are soon found by Miss Lilian, who wants to punish them for revealing her secret. Diana realizes that all of them are bound to the Old Willis Place by the terrible grudges they hold for things that happened long ago and that unless they can forgive one another, none of them will ever leave. The children forgive Miss Lilian for leaving them to die and apologize for tormenting her in her final years, while Miss Lilian, in turn, expresses remorse for her role in the children's deaths. A beautiful silver light descends, and from it, the ghosts of the children's parents arrive to take them into the afterlife. The children's forgiveness allows Miss Lilian to join them there.
Lissa, witnessing the whole scene in secret, is happy for her friends and takes comfort in the idea that her mother also resides within the beautiful light, waiting to reunite with Lissa once again.
References
2004 American novels
2004 children's books
Children's fantasy novels
American children's novels
Ghost novels
Children's books about ghosts |
```go
// Package suffix contains a kio.Filter implementation of the kustomize
// SuffixTransformer.
package suffix
``` |
```objective-c
#import "RNNComponentViewController+Utils.h"
#import "RNNTestRootViewCreator.h"
@implementation RNNComponentViewController (Utils)
+ (RNNComponentViewController *)createWithComponentId:(NSString *)componentId
initialOptions:(RNNNavigationOptions *)initialOptions {
RNNLayoutInfo *layoutInfo = [[RNNLayoutInfo alloc] init];
layoutInfo.componentId = componentId;
RNNButtonsPresenter *buttonsPresenter =
[[RNNButtonsPresenter alloc] initWithComponentRegistry:nil eventEmitter:nil];
RNNComponentViewController *component = [[RNNComponentViewController alloc]
initWithLayoutInfo:layoutInfo
rootViewCreator:[[RNNTestRootViewCreator alloc] init]
eventEmitter:nil
presenter:[[RNNComponentPresenter alloc]
initWithComponentRegistry:nil
defaultOptions:nil
buttonsPresenter:buttonsPresenter]
options:initialOptions
defaultOptions:nil];
[buttonsPresenter bindViewController:component];
return component;
}
+ (RNNComponentViewController *)createWithComponentId:(NSString *)componentId {
return [self createWithComponentId:componentId
initialOptions:RNNNavigationOptions.emptyOptions];
}
@end
``` |
```java
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* 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.beam.sdk.extensions.avro.io;
import static org.apache.beam.sdk.transforms.display.DisplayDataMatchers.hasDisplayItem;
import static org.hamcrest.MatcherAssert.assertThat;
import static org.hamcrest.Matchers.containsInAnyOrder;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertSame;
import static org.junit.Assert.assertTrue;
import java.io.File;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Random;
import java.util.stream.Collectors;
import org.apache.avro.Schema;
import org.apache.avro.file.CodecFactory;
import org.apache.avro.file.DataFileConstants;
import org.apache.avro.file.DataFileWriter;
import org.apache.avro.generic.GenericDatumReader;
import org.apache.avro.generic.GenericDatumWriter;
import org.apache.avro.generic.GenericRecord;
import org.apache.avro.io.DatumWriter;
import org.apache.avro.io.Decoder;
import org.apache.avro.reflect.AvroDefault;
import org.apache.avro.reflect.ReflectData;
import org.apache.avro.reflect.ReflectDatumWriter;
import org.apache.beam.sdk.coders.DefaultCoder;
import org.apache.beam.sdk.extensions.avro.coders.AvroCoder;
import org.apache.beam.sdk.io.BlockBasedSource;
import org.apache.beam.sdk.io.BlockBasedSource.BlockBasedReader;
import org.apache.beam.sdk.io.BoundedSource;
import org.apache.beam.sdk.io.BoundedSource.BoundedReader;
import org.apache.beam.sdk.io.FileBasedSource;
import org.apache.beam.sdk.io.FileSystems;
import org.apache.beam.sdk.io.fs.MatchResult.Metadata;
import org.apache.beam.sdk.options.PipelineOptions;
import org.apache.beam.sdk.options.PipelineOptionsFactory;
import org.apache.beam.sdk.testing.SourceTestUtils;
import org.apache.beam.sdk.transforms.display.DisplayData;
import org.apache.beam.sdk.util.SerializableUtils;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.base.MoreObjects;
import org.checkerframework.checker.nullness.qual.Nullable;
import org.hamcrest.Matchers;
import org.junit.Rule;
import org.junit.Test;
import org.junit.rules.ExpectedException;
import org.junit.rules.TemporaryFolder;
import org.junit.runner.RunWith;
import org.junit.runners.JUnit4;
/** Tests for AvroSource. */
@RunWith(JUnit4.class)
public class AvroSourceTest {
private static final String VERSION_AVRO =
org.apache.avro.Schema.class.getPackage().getImplementationVersion();
@Rule public TemporaryFolder tmpFolder = new TemporaryFolder();
@Rule public ExpectedException expectedException = ExpectedException.none();
private enum SyncBehavior {
SYNC_REGULAR, // Sync at regular, user defined intervals
SYNC_RANDOM, // Sync at random intervals
SYNC_DEFAULT // Sync at default intervals (i.e., no manual syncing).
}
private static final int DEFAULT_RECORD_COUNT = 1000;
private Iterable<String> avroSupportedCodec() {
List<String> codecs = new ArrayList<>();
codecs.add(DataFileConstants.NULL_CODEC);
codecs.add(DataFileConstants.BZIP2_CODEC);
codecs.add(DataFileConstants.DEFLATE_CODEC);
codecs.add(DataFileConstants.SNAPPY_CODEC);
codecs.add(DataFileConstants.XZ_CODEC);
if (!VERSION_AVRO.equals("1.8.2")) {
codecs.add("zstandard");
}
return codecs;
}
/**
* Generates an input Avro file containing the given records in the temporary directory and
* returns the full path of the file.
*/
private <T> String generateTestFile(
String filename,
List<T> elems,
SyncBehavior syncBehavior,
int syncInterval,
AvroCoder<T> coder,
String codec)
throws IOException {
Random random = new Random(0);
File tmpFile = tmpFolder.newFile(filename);
String path = tmpFile.toString();
FileOutputStream os = new FileOutputStream(tmpFile);
DatumWriter<T> datumWriter =
coder.getType().equals(GenericRecord.class)
? new GenericDatumWriter<>(coder.getSchema())
: new ReflectDatumWriter<>(coder.getSchema());
try (DataFileWriter<T> writer = new DataFileWriter<>(datumWriter)) {
writer.setCodec(CodecFactory.fromString(codec));
writer.create(coder.getSchema(), os);
int recordIndex = 0;
int syncIndex = syncBehavior == SyncBehavior.SYNC_RANDOM ? random.nextInt(syncInterval) : 0;
for (T elem : elems) {
writer.append(elem);
recordIndex++;
switch (syncBehavior) {
case SYNC_REGULAR:
if (recordIndex == syncInterval) {
recordIndex = 0;
writer.sync();
}
break;
case SYNC_RANDOM:
if (recordIndex == syncIndex) {
recordIndex = 0;
writer.sync();
syncIndex = random.nextInt(syncInterval);
}
break;
case SYNC_DEFAULT:
default:
}
}
}
return path;
}
@Test
public void testReadWithDifferentCodecs() throws Exception {
// As Avro's default block size is 64KB, write 64K records to ensure at least one full block.
// We could make this smaller than 64KB assuming each record is at least B bytes, but then the
// test could silently stop testing the failure condition from BEAM-422.
List<Bird> expected = createRandomRecords(1 << 16);
// Test reading files generated using all codecs.
for (String codec : avroSupportedCodec()) {
String filename =
generateTestFile(
codec, expected, SyncBehavior.SYNC_DEFAULT, 0, AvroCoder.of(Bird.class), codec);
AvroSource<Bird> source = AvroSource.from(filename).withSchema(Bird.class);
List<Bird> actual = SourceTestUtils.readFromSource(source, null);
assertThat(expected, containsInAnyOrder(actual.toArray()));
}
}
@Test
public void testSplitAtFraction() throws Exception {
// A reduced dataset is enough here.
List<FixedRecord> expected = createFixedRecords(DEFAULT_RECORD_COUNT);
// Create an AvroSource where each block is 1/10th of the total set of records.
String filename =
generateTestFile(
"tmp.avro",
expected,
SyncBehavior.SYNC_REGULAR,
DEFAULT_RECORD_COUNT / 10 /* max records per block */,
AvroCoder.of(FixedRecord.class),
DataFileConstants.NULL_CODEC);
File file = new File(filename);
AvroSource<FixedRecord> source = AvroSource.from(filename).withSchema(FixedRecord.class);
List<? extends BoundedSource<FixedRecord>> splits = source.split(file.length() / 3, null);
for (BoundedSource<FixedRecord> subSource : splits) {
int items = SourceTestUtils.readFromSource(subSource, null).size();
// Shouldn't split while unstarted.
SourceTestUtils.assertSplitAtFractionFails(subSource, 0, 0.0, null);
SourceTestUtils.assertSplitAtFractionFails(subSource, 0, 0.7, null);
SourceTestUtils.assertSplitAtFractionSucceedsAndConsistent(subSource, 1, 0.7, null);
SourceTestUtils.assertSplitAtFractionSucceedsAndConsistent(
subSource, DEFAULT_RECORD_COUNT / 100, 0.7, null);
SourceTestUtils.assertSplitAtFractionSucceedsAndConsistent(
subSource, DEFAULT_RECORD_COUNT / 10, 0.1, null);
SourceTestUtils.assertSplitAtFractionFails(
subSource, DEFAULT_RECORD_COUNT / 10 + 1, 0.1, null);
SourceTestUtils.assertSplitAtFractionFails(subSource, DEFAULT_RECORD_COUNT / 3, 0.3, null);
SourceTestUtils.assertSplitAtFractionFails(subSource, items, 0.9, null);
SourceTestUtils.assertSplitAtFractionFails(subSource, items, 1.0, null);
SourceTestUtils.assertSplitAtFractionSucceedsAndConsistent(subSource, items, 0.999, null);
}
}
@Test
public void testGetProgressFromUnstartedReader() throws Exception {
List<FixedRecord> records = createFixedRecords(DEFAULT_RECORD_COUNT);
String filename =
generateTestFile(
"tmp.avro",
records,
SyncBehavior.SYNC_DEFAULT,
1000,
AvroCoder.of(FixedRecord.class),
DataFileConstants.NULL_CODEC);
File file = new File(filename);
AvroSource<FixedRecord> source = AvroSource.from(filename).withSchema(FixedRecord.class);
try (BoundedReader<FixedRecord> reader = source.createReader(null)) {
assertEquals(Double.valueOf(0.0), reader.getFractionConsumed());
}
List<? extends BoundedSource<FixedRecord>> splits = source.split(file.length() / 3, null);
for (BoundedSource<FixedRecord> subSource : splits) {
try (BoundedReader<FixedRecord> reader = subSource.createReader(null)) {
assertEquals(Double.valueOf(0.0), reader.getFractionConsumed());
}
}
}
@Test
public void testProgress() throws Exception {
// 5 records, 2 per block.
List<FixedRecord> records = createFixedRecords(5);
String filename =
generateTestFile(
"tmp.avro",
records,
SyncBehavior.SYNC_REGULAR,
2,
AvroCoder.of(FixedRecord.class),
DataFileConstants.NULL_CODEC);
AvroSource<FixedRecord> source = AvroSource.from(filename).withSchema(FixedRecord.class);
try (BoundedReader<FixedRecord> readerOrig = source.createReader(null)) {
assertThat(readerOrig, Matchers.instanceOf(BlockBasedReader.class));
BlockBasedReader<FixedRecord> reader = (BlockBasedReader<FixedRecord>) readerOrig;
// Before starting
assertEquals(0.0, reader.getFractionConsumed(), 1e-6);
assertEquals(0, reader.getSplitPointsConsumed());
assertEquals(BoundedReader.SPLIT_POINTS_UNKNOWN, reader.getSplitPointsRemaining());
// First 2 records are in the same block.
assertTrue(reader.start());
assertTrue(reader.isAtSplitPoint());
assertEquals(0, reader.getSplitPointsConsumed());
assertEquals(BoundedReader.SPLIT_POINTS_UNKNOWN, reader.getSplitPointsRemaining());
// continued
assertTrue(reader.advance());
assertFalse(reader.isAtSplitPoint());
assertEquals(0, reader.getSplitPointsConsumed());
assertEquals(BoundedReader.SPLIT_POINTS_UNKNOWN, reader.getSplitPointsRemaining());
// Second block -> parallelism consumed becomes 1.
assertTrue(reader.advance());
assertTrue(reader.isAtSplitPoint());
assertEquals(1, reader.getSplitPointsConsumed());
assertEquals(BoundedReader.SPLIT_POINTS_UNKNOWN, reader.getSplitPointsRemaining());
// continued
assertTrue(reader.advance());
assertFalse(reader.isAtSplitPoint());
assertEquals(1, reader.getSplitPointsConsumed());
assertEquals(BoundedReader.SPLIT_POINTS_UNKNOWN, reader.getSplitPointsRemaining());
// Third and final block -> parallelism consumed becomes 2, remaining becomes 1.
assertTrue(reader.advance());
assertTrue(reader.isAtSplitPoint());
assertEquals(2, reader.getSplitPointsConsumed());
assertEquals(1, reader.getSplitPointsRemaining());
// Done
assertFalse(reader.advance());
assertEquals(3, reader.getSplitPointsConsumed());
assertEquals(0, reader.getSplitPointsRemaining());
assertEquals(1.0, reader.getFractionConsumed(), 1e-6);
}
}
@Test
public void testProgressEmptySource() throws Exception {
// 0 records, 20 per block.
List<FixedRecord> records = Collections.emptyList();
String filename =
generateTestFile(
"tmp.avro",
records,
SyncBehavior.SYNC_REGULAR,
2,
AvroCoder.of(FixedRecord.class),
DataFileConstants.NULL_CODEC);
AvroSource<FixedRecord> source = AvroSource.from(filename).withSchema(FixedRecord.class);
try (BoundedReader<FixedRecord> readerOrig = source.createReader(null)) {
assertThat(readerOrig, Matchers.instanceOf(BlockBasedReader.class));
BlockBasedReader<FixedRecord> reader = (BlockBasedReader<FixedRecord>) readerOrig;
// before starting
assertEquals(0.0, reader.getFractionConsumed(), 1e-6);
assertEquals(0, reader.getSplitPointsConsumed());
assertEquals(BoundedReader.SPLIT_POINTS_UNKNOWN, reader.getSplitPointsRemaining());
// confirm empty
assertFalse(reader.start());
// after reading empty source
assertEquals(0, reader.getSplitPointsConsumed());
assertEquals(0, reader.getSplitPointsRemaining());
assertEquals(1.0, reader.getFractionConsumed(), 1e-6);
}
}
@Test
public void testGetCurrentFromUnstartedReader() throws Exception {
List<FixedRecord> records = createFixedRecords(DEFAULT_RECORD_COUNT);
String filename =
generateTestFile(
"tmp.avro",
records,
SyncBehavior.SYNC_DEFAULT,
1000,
AvroCoder.of(FixedRecord.class),
DataFileConstants.NULL_CODEC);
AvroSource<FixedRecord> source = AvroSource.from(filename).withSchema(FixedRecord.class);
try (BlockBasedSource.BlockBasedReader<FixedRecord> reader =
(BlockBasedSource.BlockBasedReader<FixedRecord>) source.createReader(null)) {
assertEquals(null, reader.getCurrentBlock());
expectedException.expect(NoSuchElementException.class);
expectedException.expectMessage("No block has been successfully read from");
reader.getCurrent();
}
}
@Test
public void testSplitAtFractionExhaustive() throws Exception {
// A small-sized input is sufficient, because the test verifies that splitting is non-vacuous.
List<FixedRecord> expected = createFixedRecords(20);
String filename =
generateTestFile(
"tmp.avro",
expected,
SyncBehavior.SYNC_REGULAR,
5,
AvroCoder.of(FixedRecord.class),
DataFileConstants.NULL_CODEC);
AvroSource<FixedRecord> source = AvroSource.from(filename).withSchema(FixedRecord.class);
SourceTestUtils.assertSplitAtFractionExhaustive(source, null);
}
@Test
public void testSplitsWithSmallBlocks() throws Exception {
PipelineOptions options = PipelineOptionsFactory.create();
// Test reading from an object file with many small random-sized blocks.
// The file itself doesn't have to be big; we can use a decreased record count.
List<Bird> expected = createRandomRecords(DEFAULT_RECORD_COUNT);
String filename =
generateTestFile(
"tmp.avro",
expected,
SyncBehavior.SYNC_RANDOM,
DEFAULT_RECORD_COUNT / 20 /* max records/block */,
AvroCoder.of(Bird.class),
DataFileConstants.NULL_CODEC);
File file = new File(filename);
// Small minimum bundle size
AvroSource<Bird> source =
AvroSource.from(filename).withSchema(Bird.class).withMinBundleSize(100L);
// Assert that the source produces the expected records
assertEquals(expected, SourceTestUtils.readFromSource(source, options));
List<? extends BoundedSource<Bird>> splits;
int nonEmptySplits;
// Split with the minimum bundle size
splits = source.split(100L, options);
assertTrue(splits.size() > 2);
SourceTestUtils.assertSourcesEqualReferenceSource(source, splits, options);
nonEmptySplits = 0;
for (BoundedSource<Bird> subSource : splits) {
if (SourceTestUtils.readFromSource(subSource, options).size() > 0) {
nonEmptySplits += 1;
}
}
assertTrue(nonEmptySplits > 2);
// Split with larger bundle size
splits = source.split(file.length() / 4, options);
assertTrue(splits.size() > 2);
SourceTestUtils.assertSourcesEqualReferenceSource(source, splits, options);
nonEmptySplits = 0;
for (BoundedSource<Bird> subSource : splits) {
if (SourceTestUtils.readFromSource(subSource, options).size() > 0) {
nonEmptySplits += 1;
}
}
assertTrue(nonEmptySplits > 2);
// Split with the file length
splits = source.split(file.length(), options);
assertTrue(splits.size() == 1);
SourceTestUtils.assertSourcesEqualReferenceSource(source, splits, options);
}
@Test
public void testMultipleFiles() throws Exception {
String baseName = "tmp-";
List<Bird> expected = new ArrayList<>();
for (int i = 0; i < 10; i++) {
List<Bird> contents = createRandomRecords(DEFAULT_RECORD_COUNT / 10);
expected.addAll(contents);
generateTestFile(
baseName + i,
contents,
SyncBehavior.SYNC_DEFAULT,
0,
AvroCoder.of(Bird.class),
DataFileConstants.NULL_CODEC);
}
AvroSource<Bird> source =
AvroSource.from(new File(tmpFolder.getRoot().toString(), baseName + "*").toString())
.withSchema(Bird.class);
List<Bird> actual = SourceTestUtils.readFromSource(source, null);
assertThat(actual, containsInAnyOrder(expected.toArray()));
}
@Test
public void testCreationWithSchema() throws Exception {
List<Bird> expected = createRandomRecords(100);
String filename =
generateTestFile(
"tmp.avro",
expected,
SyncBehavior.SYNC_DEFAULT,
0,
AvroCoder.of(Bird.class),
DataFileConstants.NULL_CODEC);
// Create a source with a schema object
Schema schema = ReflectData.get().getSchema(Bird.class);
AvroSource<GenericRecord> source = AvroSource.from(filename).withSchema(schema);
List<GenericRecord> records = SourceTestUtils.readFromSource(source, null);
assertEqualsWithGeneric(expected, records);
// Create a source with a JSON schema
String schemaString = ReflectData.get().getSchema(Bird.class).toString();
source = AvroSource.from(filename).withSchema(schemaString);
records = SourceTestUtils.readFromSource(source, null);
assertEqualsWithGeneric(expected, records);
}
@Test
public void testSchemaUpdate() throws Exception {
List<Bird> birds = createRandomRecords(100);
String filename =
generateTestFile(
"tmp.avro",
birds,
SyncBehavior.SYNC_DEFAULT,
0,
AvroCoder.of(Bird.class),
DataFileConstants.NULL_CODEC);
AvroSource<FancyBird> source = AvroSource.from(filename).withSchema(FancyBird.class);
List<FancyBird> actual = SourceTestUtils.readFromSource(source, null);
List<FancyBird> expected = new ArrayList<>();
for (Bird bird : birds) {
expected.add(
new FancyBird(
bird.number, bird.species, bird.quality, bird.quantity, null, "MAXIMUM OVERDRIVE"));
}
assertThat(actual, containsInAnyOrder(expected.toArray()));
}
@Test
public void testSchemaStringIsInterned() throws Exception {
List<Bird> birds = createRandomRecords(100);
String filename =
generateTestFile(
"tmp.avro",
birds,
SyncBehavior.SYNC_DEFAULT,
0,
AvroCoder.of(Bird.class),
DataFileConstants.NULL_CODEC);
Metadata fileMetadata = FileSystems.matchSingleFileSpec(filename);
String schema = AvroSource.readMetadataFromFile(fileMetadata.resourceId()).getSchemaString();
// Add "" to the schema to make sure it is not interned.
AvroSource<GenericRecord> sourceA = AvroSource.from(filename).withSchema("" + schema);
AvroSource<GenericRecord> sourceB = AvroSource.from(filename).withSchema("" + schema);
assertSame(sourceA.getReaderSchemaString(), sourceB.getReaderSchemaString());
// Ensure that deserialization still goes through interning
AvroSource<GenericRecord> sourceC = SerializableUtils.clone(sourceB);
assertSame(sourceA.getReaderSchemaString(), sourceC.getReaderSchemaString());
}
@Test
public void testParseFn() throws Exception {
List<Bird> expected = createRandomRecords(100);
String filename =
generateTestFile(
"tmp.avro",
expected,
SyncBehavior.SYNC_DEFAULT,
0,
AvroCoder.of(Bird.class),
DataFileConstants.NULL_CODEC);
AvroSource<Bird> source =
AvroSource.from(filename)
.withParseFn(
input ->
new Bird(
(long) input.get("number"),
input.get("species").toString(),
input.get("quality").toString(),
(long) input.get("quantity")),
AvroCoder.of(Bird.class));
List<Bird> actual = SourceTestUtils.readFromSource(source, null);
assertThat(actual, containsInAnyOrder(expected.toArray()));
}
@Test
public void testDatumReaderFactoryWithGenericRecord() throws Exception {
List<Bird> inputBirds = createRandomRecords(100);
String filename =
generateTestFile(
"tmp.avro",
inputBirds,
SyncBehavior.SYNC_DEFAULT,
0,
AvroCoder.of(Bird.class),
DataFileConstants.NULL_CODEC);
AvroSource.DatumReaderFactory<GenericRecord> factory =
(writer, reader) ->
new GenericDatumReader<GenericRecord>(writer, reader) {
@Override
protected Object readString(Object old, Decoder in) throws IOException {
return super.readString(old, in) + "_custom";
}
};
AvroSource<Bird> source =
AvroSource.from(filename)
.withParseFn(
input ->
new Bird(
(long) input.get("number"),
input.get("species").toString(),
input.get("quality").toString(),
(long) input.get("quantity")),
AvroCoder.of(Bird.class))
.withDatumReaderFactory(factory);
List<Bird> actual = SourceTestUtils.readFromSource(source, null);
List<Bird> expected =
inputBirds.stream()
.map(b -> new Bird(b.number, b.species + "_custom", b.quality + "_custom", b.quantity))
.collect(Collectors.toList());
assertThat(actual, containsInAnyOrder(expected.toArray()));
}
private void assertEqualsWithGeneric(List<Bird> expected, List<GenericRecord> actual) {
assertEquals(expected.size(), actual.size());
for (int i = 0; i < expected.size(); i++) {
Bird fixed = expected.get(i);
GenericRecord generic = actual.get(i);
assertEquals(fixed.number, generic.get("number"));
assertEquals(fixed.quality, generic.get("quality").toString()); // From Avro util.Utf8
assertEquals(fixed.quantity, generic.get("quantity"));
assertEquals(fixed.species, generic.get("species").toString());
}
}
@Test
public void testDisplayData() {
AvroSource<Bird> source =
AvroSource.from("foobar.txt").withSchema(Bird.class).withMinBundleSize(1234);
DisplayData displayData = DisplayData.from(source);
assertThat(displayData, hasDisplayItem("filePattern", "foobar.txt"));
assertThat(displayData, hasDisplayItem("minBundleSize", 1234));
}
@Test
public void testReadMetadataWithCodecs() throws Exception {
List<Bird> expected = createRandomRecords(DEFAULT_RECORD_COUNT);
// Test reading files generated using all codecs.
for (String codec : avroSupportedCodec()) {
String filename =
generateTestFile(
codec, expected, SyncBehavior.SYNC_DEFAULT, 0, AvroCoder.of(Bird.class), codec);
Metadata fileMeta = FileSystems.matchSingleFileSpec(filename);
AvroSource.AvroMetadata metadata = AvroSource.readMetadataFromFile(fileMeta.resourceId());
assertEquals(codec, metadata.getCodec());
}
}
@Test
public void testReadSchemaString() throws Exception {
List<Bird> expected = createRandomRecords(DEFAULT_RECORD_COUNT);
String codec = DataFileConstants.NULL_CODEC;
String filename =
generateTestFile(
codec, expected, SyncBehavior.SYNC_DEFAULT, 0, AvroCoder.of(Bird.class), codec);
Metadata fileMeta = FileSystems.matchSingleFileSpec(filename);
AvroSource.AvroMetadata metadata = AvroSource.readMetadataFromFile(fileMeta.resourceId());
// By default, parse validates the schema, which is what we want.
Schema schema = new Schema.Parser().parse(metadata.getSchemaString());
assertEquals(4, schema.getFields().size());
}
@Test
public void testCreateFromMetadata() throws Exception {
List<Bird> expected = createRandomRecords(DEFAULT_RECORD_COUNT);
String codec = DataFileConstants.NULL_CODEC;
String filename =
generateTestFile(
codec, expected, SyncBehavior.SYNC_DEFAULT, 0, AvroCoder.of(Bird.class), codec);
Metadata fileMeta = FileSystems.matchSingleFileSpec(filename);
AvroSource<GenericRecord> source = AvroSource.from(fileMeta);
AvroSource<Bird> sourceWithSchema = source.withSchema(Bird.class);
AvroSource<Bird> sourceWithSchemaWithMinBundleSize = sourceWithSchema.withMinBundleSize(1234);
assertEquals(FileBasedSource.Mode.SINGLE_FILE_OR_SUBRANGE, source.getMode());
assertEquals(FileBasedSource.Mode.SINGLE_FILE_OR_SUBRANGE, sourceWithSchema.getMode());
assertEquals(
FileBasedSource.Mode.SINGLE_FILE_OR_SUBRANGE, sourceWithSchemaWithMinBundleSize.getMode());
}
/**
* Class that will encode to a fixed size: 16 bytes.
*
* <p>Each object has a 15-byte array. Avro encodes an object of this type as a byte array, so
* each encoded object will consist of 1 byte that encodes the length of the array, followed by 15
* bytes.
*/
@DefaultCoder(AvroCoder.class)
public static class FixedRecord {
private byte[] value = new byte[15];
public FixedRecord() {
this(0);
}
public FixedRecord(int i) {
value[0] = (byte) i;
value[1] = (byte) (i >> 8);
value[2] = (byte) (i >> 16);
value[3] = (byte) (i >> 24);
}
public int asInt() {
return value[0] | (value[1] << 8) | (value[2] << 16) | (value[3] << 24);
}
@Override
public boolean equals(@Nullable Object o) {
if (o instanceof FixedRecord) {
FixedRecord other = (FixedRecord) o;
return this.asInt() == other.asInt();
}
return false;
}
@Override
public int hashCode() {
return toString().hashCode();
}
@Override
public String toString() {
return Integer.toString(this.asInt());
}
}
/** Create a list of count 16-byte records. */
private static List<FixedRecord> createFixedRecords(int count) {
List<FixedRecord> records = new ArrayList<>();
for (int i = 0; i < count; i++) {
records.add(new FixedRecord(i));
}
return records;
}
/** Class used as the record type in tests. */
@DefaultCoder(AvroCoder.class)
static class Bird {
long number;
String species;
String quality;
long quantity;
public Bird() {}
public Bird(long number, String species, String quality, long quantity) {
this.number = number;
this.species = species;
this.quality = quality;
this.quantity = quantity;
}
@Override
public String toString() {
return MoreObjects.toStringHelper(Bird.class)
.addValue(number)
.addValue(species)
.addValue(quantity)
.addValue(quality)
.toString();
}
@Override
public boolean equals(@Nullable Object obj) {
if (obj instanceof Bird) {
Bird other = (Bird) obj;
return Objects.equals(species, other.species)
&& Objects.equals(quality, other.quality)
&& quantity == other.quantity
&& number == other.number;
}
return false;
}
@Override
public int hashCode() {
return Objects.hash(number, species, quality, quantity);
}
}
/**
* Class used as the record type in tests.
*
* <p>Contains nullable fields and fields with default values. Can be read using a file written
* with the Bird schema.
*/
@DefaultCoder(AvroCoder.class)
public static class FancyBird {
long number;
String species;
String quality;
long quantity;
@org.apache.avro.reflect.Nullable String habitat;
@AvroDefault("\"MAXIMUM OVERDRIVE\"")
String fancinessLevel;
public FancyBird() {}
public FancyBird(
long number,
String species,
String quality,
long quantity,
String habitat,
String fancinessLevel) {
this.number = number;
this.species = species;
this.quality = quality;
this.quantity = quantity;
this.habitat = habitat;
this.fancinessLevel = fancinessLevel;
}
@Override
public String toString() {
return MoreObjects.toStringHelper(FancyBird.class)
.addValue(number)
.addValue(species)
.addValue(quality)
.addValue(quantity)
.addValue(habitat)
.addValue(fancinessLevel)
.toString();
}
@Override
public boolean equals(@Nullable Object obj) {
if (obj instanceof FancyBird) {
FancyBird other = (FancyBird) obj;
return Objects.equals(species, other.species)
&& Objects.equals(quality, other.quality)
&& quantity == other.quantity
&& number == other.number
&& Objects.equals(fancinessLevel, other.fancinessLevel)
&& Objects.equals(habitat, other.habitat);
}
return false;
}
@Override
public int hashCode() {
return Objects.hash(number, species, quality, quantity, habitat, fancinessLevel);
}
}
/** Create a list of n random records. */
private static List<Bird> createRandomRecords(long n) {
String[] qualities = {
"miserable", "forelorn", "fidgity", "squirrelly", "fanciful", "chipper", "lazy"
};
String[] species = {"pigeons", "owls", "gulls", "hawks", "robins", "jays"};
Random random = new Random(0);
List<Bird> records = new ArrayList<>();
for (long i = 0; i < n; i++) {
Bird bird = new Bird();
bird.quality = qualities[random.nextInt(qualities.length)];
bird.species = species[random.nextInt(species.length)];
bird.number = i;
bird.quantity = random.nextLong();
records.add(bird);
}
return records;
}
}
``` |
```xml
import { provideUnits } from './provideUnits';
describe('provideUnits', () => {
it('can provide units', () => {
['left', 'right', 'top', 'bottom', 'borderWidth'].forEach((property: string) => {
const testSet: (string | number)[] = [property, 1];
provideUnits(testSet, 0);
expect(testSet).toEqual([property, '1px']);
});
});
it('ignores css variables', () => {
const testSet: (string | number)[] = ['--button-fontWeight', 600];
provideUnits(testSet, 0);
expect(testSet).toEqual(['--button-fontWeight', '600']);
});
it('can provide units for directional props', () => {
['padding', 'margin', 'border'].forEach((property: string) => {
const testSet: (string | number)[] = [
property,
1,
property + 'Left',
1,
property + 'Right',
1,
property + 'Top',
1,
property + 'Bottom',
1,
];
provideUnits(testSet, 0);
provideUnits(testSet, 2);
provideUnits(testSet, 4);
provideUnits(testSet, 6);
provideUnits(testSet, 8);
expect(testSet).toEqual([
property,
'1px',
property + 'Left',
'1px',
property + 'Right',
'1px',
property + 'Top',
'1px',
property + 'Bottom',
'1px',
]);
});
});
it('ignores opacity', () => {
const testSet = ['opacity', 0];
provideUnits(testSet, 0);
expect(testSet).toEqual(['opacity', '0']);
});
});
``` |
Sir Arthur O'Neill or Sir Art O'Neill (died 1600) was an Irish soldier and landowner. He was part of the O'Neill dynasty, which was the most powerful Gaelic family in Ireland at the time. He was the son of Turlough Luineach O'Neill, the head of the O'Neill dynasty until 1595. He was the second son of Turlough, but his eldest brother Henry O'Neill died in 1578. At times he had a strained relationship with his father, and offered his support to Turlough's rival Hugh O'Neill, Earl of Tyrone. When Tyrone succeeded Turlough as head of the O'Neills and began Tyrone's Rebellion, Arthur offered tacit support to his distant cousin.
In 1600, however, he made contact with the Crown shortly before an Anglo-Irish force of government troops had landed at Derry and made preparations to change sides and bring his warriors with him. He offered important assistance to the English commander at Derry, Sir Henry Docwra and took part in a force that captured the strategic settlement of Dunnalong. He was also present at the Battle of Lifford, where an important victory was won over the rebel leader Red Hugh O'Donnell. He is also credited with saving Docwra from disaster by exposing an ambush plot by Rory O'Cahan.
Arthur was promised that he would be made Earl of Tyrone, following the attainder of Hugh O'Neill for his rebellion. This would have brought him control over vast swathes of central Ulster, but he died suddenly in late October 1600. His death is generally attributed to heavy drinking at his wedding day celebrations, but he may have been a victim of a fever raging through the army camp. His brother Cormac O'Neill attempted to claim that he was Arthur's successor, but the government rejected this and acknowledged Arthur's eldest son Turlough O'Neill as his heir.
References
Bibliography
Bardon, Jonathan. The Plantation of Ulster. Gill & MacMillan, 2012.
McGurk, John. Sir Henry Docwra, 1564-1631: Derry's Second Founder. Four Courts Press, Dublin, 2006.
Morgan, Hiram. Tyrone's Rebellion. Boydell Press, 1999.
16th-century Irish landowners
17th-century Irish landowners
Irish soldiers
Irish knights
People of Elizabethan Ireland
People from County Tyrone
Year of birth unknown
1600 deaths
16th-century Irish military personnel
17th-century Irish military personnel |
164 (one hundred [and] sixty-four) is the natural number following 163 and preceding 165.
In mathematics
164 is a zero of the Mertens function.
In base 10, 164 is the smallest number that can be expressed as a concatenation of two squares in two different ways: as 1 concatenate 64 or 16 concatenate 4.
In astronomy
164P/Christensen is a comet in the Solar System
164 Eva is a large and dark Main belt asteroid
In geography
Chaplin no. 164, Saskatchewan in Saskatchewan, Canada
In the military
was a cargo vessel during World War II
was a T2 tanker during World War II
was a Barracuda-class submarine during World War II
was an Alamosa-class cargo ship during World War II
was an Admirable-class minesweeper during World War II
was a Trefoil-class concrete barge during World War II
was a during World War II
was a during World War II
was a yacht during World War I
was a during World War II
In sports
Baseball Talk was a set of 164 talking baseball cards released by Topps Baseball Card Company in 1989
In transportation
Caproni Ca.164 was a training biplane produced in Italy prior to World War II
The Alfa Romeo 164 car produced from 1988 to 1997
The Volvo 164 car produced from 1968 to 1975
List of highways numbered 164
Is a London Transport bus route running between Sutton and Wimbledon
In other fields
164 is also:
The year AD 164 or 164 BC
164 AH is a year in the Islamic calendar that corresponds to 780 – 781 CE
The Scrabble board, a 15-by-15 grid, includes 164 squares that have neither word nor letter multiplier. The remainder have attributes such as double letter, triple letter, double word, and triple word
The atomic number of an element temporarily called Unhexquadium
Solvent Red 164 is a synthetic red diazo dye
E.164 is an ITU-T recommendation defines public telecommunication numbering plan used in the PSTN and data networks
See also
United States Supreme Court cases, Volume 164
United Nations Security Council Resolution 164
External links
Number Facts and Trivia: 164
The Number 164
The Positive Integer 164
Integers |
```css
Use `text-transform` to avoid screen-reader pronunciation errors
Use ```list-style-type``` to change the marker type in lists
Use `em` instead of `px` for sizes
Comma-separated lists
``` |
George Holloway may refer to:
Bud Holloway (born 1988), Canadian ice hockey player
Lofty Holloway, fictional character from EastEnders
George Holloway (politician) (1825–1892), British Member of Parliament for Stroud
George Holloway (cricketer) (1884–1966), English cricketer |
Lance B. Becker is an American physician and academic, specializing in emergency medicine and treatment for cardiac arrest, currently at Northwell Health. He is the chairman of the department of emergency medicine at North Shore University Hospital, as well as chair and professor of emergency medicine at Hofstra Northwell School of Medicine.
Career
Becker received his M.D. from the University of Illinois College of Medicine, and completed his residency in internal medicine at the Michael Reese Hospital and Medical Center. Prior to joining Northwell, he founded and directed of the Center for Resuscitation Science at the University of Pennsylvania, and the Emergency Resuscitation Center at the University of Chicago.
Research
Becker is the author and co-author of more than 290 scientific publications. His research has been focused on extending the time between cardiac arrest, or clinical death, and the time when a person is brain dead and can no longer be revived by emergency care. Historically, there was a "standard four-minute time limit", but this can now be extended to fifteen or even thirty minutes through better medical practices. Becker has worked to convince other doctors that "death doesn’t mean what they learned in their med school textbooks: 10 minutes without oxygen equals gone".
Becker discovered that re-introduction of oxygen, rather than loss of oxygen, was primarily responsible for cell death. Cell death can be delayed or stopped through the application of therapeutic hypothermia. In the case of Swedish skier Anna Bågenholm, who fell through ice into freezing water, the cold protected her from brain damage despite being without oxygen for over an hour.
As of 2014, further research is planned where a patient's blood is replaced with a cold saline solution, and a state of "profound hypothermia" is then medically induced, at temperatures as low as 50 F (10 C). According to Becker, "draining the blood out and rapidly cooling a person to a deep level—we try to do it every day, and it’s just doggone hard to do... But I would say it’s very likely that the idea is correct." Becker believes that long-term suspended animation, where a person is kept cold for years, will eventually be possible, although "we’re quite a distance" from that with current technology.
Becker leads the MTV-CPR (Mechanical, Team-Focused, Video-Reviewed Cardiopulmonary Resuscitation) project, based on video-feedback of cardiopulmonary resuscitation cases at the North Shore University Hospital. In 2020 Becker's team published a 2-year study showing improvements in return of spontaneous circulation in cardiac arrest patients from 26% to 41% in non-intervention vs intervention groups, respectively. Becker and Miyara published the first case report of a transplant renal artery pseudoaneurysm that due to retroperitoneal bleeding caused uretero-vesical anastomosis dehiscence, hematuria, hemorrhagic shock, pulmonary embolism and cardiac arrest. This is the first known survivor who presented those clinical and pathological characteristics.
Awards
Becker is a member of the US National Academy of Sciences, as well as the National Academy of Medicine.
References
External links
Personal page at Hofstra School of Medicine
Year of birth missing (living people)
Living people
American emergency physicians
Hofstra University faculty
Northwell Health
Members of the National Academy of Medicine
Members of the United States National Academy of Sciences
University of Illinois College of Medicine alumni |
```objective-c
#ifndef CONFLUO_TYPES_ARITHMETIC_OPS_H_
#define CONFLUO_TYPES_ARITHMETIC_OPS_H_
#include <vector>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include "exceptions.h"
#include "raw_data.h"
namespace confluo {
/**
* Unary arithmetic/bitwise operators
*/
enum unary_op_id
: uint8_t {
ASSIGN = 0, //!< ASSIGN (=)
NEGATIVE = 1, //!< NEGATIVE (-)
POSITIVE = 2, //!< POSITIVE (+)
BW_NOT = 3 //!< BW_NOT (~)
};
/**
* Binary arithmetic/bitwise operators
*/
enum binary_op_id
: uint8_t {
ADD = 0, //!< ADD (+)
SUBTRACT = 1, //!< SUBTRACT (-)
MULTIPLY = 2, //!< MULTIPLY (*)
DIVIDE = 3, //!< DIVIDE (/)
MODULO = 4, //!< MODULO (%)
BW_AND = 5, //!< BW_AND (&)
BW_OR = 6, //!< BW_OR (|)
BW_XOR = 7, //!< BW_XOR (^)
BW_LSHIFT = 8, //!< BW_LSHIFT (<<)
BW_RSHIFT = 9 //!< BW_RSHIFT (>>)
};
/** Function pointer for a unary operator */
typedef void (*unary_op_t)(void *res, const immutable_raw_data &v);
/** Function pointer for a binary operator */
typedef void (*binary_op_t)(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2);
/** List of unary operators */
typedef std::vector<unary_op_t> unary_ops_t;
/** List of binary operators */
typedef std::vector<binary_op_t> binary_ops_t;
// Unary arithmetic operators
/**
* Assigns the value of the raw immutable data to the result pointer
* @tparam T The type of data
* @param res The pointer to the resultant data
* @param v The raw immutable data to assign to the result pointer
*/
template<typename T>
inline void assign(void *res, const immutable_raw_data &v) {
*(reinterpret_cast<T *>(res)) = v.as<T>();
}
/**
* Assigns the value of the raw immutable data to the result pointer for
* string types
*
* @param res The result pointer to initialize
* @param v The value of the raw immutable data to copy
*/
template<>
inline void assign<std::string>(void *res, const immutable_raw_data &v) {
memcpy(res, v.ptr, v.size);
}
/**
* Assigns the value of the raw immutable data to the result pointer for
* void types
*
* @param res The result pointer to initialize
* @param v The raw immutable data to copy
*/
template<>
inline void assign<void>(void *, const immutable_raw_data &v) {
return;
}
/**
* Negates the raw immutable data and stores it in the result pointer
*
* @tparam T The type of data
* @param res The result pointer which will contain the negated value
* @param v The immutable raw data to negate
*/
template<typename T>
inline void negative(void *res, const immutable_raw_data &v) {
*(reinterpret_cast<T *>(res)) = -v.as<T>();
}
/**
* Negates the raw immutable data and has result pointer point
* to the negated value for the string type
*
* @param res The result pointer that will point to the negated value
* @param v The immutable raw data to be negated
*
* @throw unsupported_exception
*/
template<>
inline void negative<std::string>(void *, const immutable_raw_data &v) {
THROW(unsupported_exception, "- not supported for string type");
}
/**
* Negates the raw immutable data and has the result pointer point to the
* negated value for the none type
*
* @param res The result pointer that will point to the negated value
* @param v The immutable raw data to be negated
*
* @throw unsupported_exception
*/
template<>
inline void negative<void>(void *, const immutable_raw_data &v) {
THROW(unsupported_exception, "- not supported for none type");
}
/**
* Has the result pointer point to the value of the raw immutable data
*
* @tparam T The type of data
* @param res The result pointer that points to the value
* @param v The raw immutable data that contains the value
*/
template<typename T>
inline void positive(void *res, const immutable_raw_data &v) {
*(reinterpret_cast<T *>(res)) = +v.as<T>();
}
/**
* Has the result pointer point to the value of the raw immutable data
* for the string type
*
* @tparam T The type of data
* @param res The result pointer that points to the value
* @param v The raw immutable data that contains the value
* @throw unsupported_exception
*/
template<>
inline void positive<std::string>(void *, const immutable_raw_data &v) {
THROW(unsupported_exception, "+ not supported for string type");
}
/**
* Has the result pointer point to the value of the raw immutable data
* for the void type
*
* @tparam T The type of data
* @param res The result pointer that points to the value
* @param v The raw immutable data that contains the value
* @throw unsupported_exception
*/
template<>
inline void positive<void>(void *, const immutable_raw_data &v) {
THROW(unsupported_exception, "+ not supported for none type");
}
// Binary arithmetic operators
/**
* Performs binary addition and stores the result in the result pointer
*
* @tparam T The data type of the operands
* @param res The result of the addition
* @param v1 The first operand of the addition expression
* @param v2 The second operand of the addition expression
*/
template<typename T>
inline void add(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>() + v2.as<T>();
}
/**
* Performs binary addition and stores the result in the result pointer
* for the string type
*
* @param res The result of the addition
* @param v1 The first operand of the addition expression
* @param v2 The second operand of the addition expression
*/
template<>
inline void add<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "+ not supported for string type");
}
/**
* Performs binary addition and stores the result in the result pointer
* for the none type
*
* @param res The result of the addition
* @param v1 The first operand of the addition expression
* @param v2 The second operand of the addition expression
* @throw unsupported_exception
*/
template<>
inline void add<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "+ not supported for none type");
}
/**
* Performs binary subtraction and stores the result in the result pointer
*
* @tparam The data type
* @param res The result of the subtraction
* @param v1 The first operand of the subtraction expression
* @param v2 The second operand of the subtraction expression
*/
template<typename T>
inline void subtract(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>() - v2.as<T>();
}
/**
* Performs binary subtraction and stores the result in the result pointer
* for strings
*
* @param res The result of the subtraction
* @param v1 The first operand of the subtraction expression
* @param v2 The second operand of the subtraction expression
* @throw unsupported_exception
*/
template<>
inline void subtract<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "- not supported for string type");
}
/**
* Performs binary subtraction and stores the result in the result pointer
* for none type
*
* @param res The result of the subtraction
* @param v1 The first operand of the subtraction expression
* @param v2 The second operand of the subtraction expression
* @throw unsupported_exception
*/
template<>
inline void subtract<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "- not supported for none type");
}
/**
* Performs binary multiplication and stores the result in the
* result pointer
*
* @tparam T The data type of the immutable values
* @param res The result of the multiplication
* @param v1 The first operand of the multiplication expression
* @param v2 The second operand of the multiplication expression
*/
template<typename T>
inline void multiply(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>() * v2.as<T>();
}
/**
* Performs binary multiplication and stores the result in the
* result pointer
*
* @tparam T The data type of the immutable values
* @param res The result of the multiplication
* @param v1 The first operand of the multiplication expression
* @param v2 The second operand of the multiplication expression
*/
template<>
inline void multiply<bool>(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<bool *>(res)) = v1.as<bool>() && v2.as<bool>();
}
/**
* Performs binary multiplication and stores the result in the
* result pointer for strings
*
* @param res The result of the multiplication
* @param v1 The first operand of the multiplication expression
* @param v2 The second operand of the multiplication expression
* @throw unsupported_exception
*/
template<>
inline void multiply<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "* not supported for string type");
}
/**
* Performs binary multiplication and stores the result in the
* result pointer for the none type
*
* @param res The result of the addition
* @param v1 The first operand of the multiplication expression
* @param v2 The second operand of the multiplication expression
* @throw unsupported_exception
*/
template<>
inline void multiply<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "* not supported for none type");
}
/**
* Performs binary division and stores the result in the
* result pointer
*
* @tparam The data type of the immutable values
* @param res The result of the division
* @param v1 The immutable value containing the dividend
* @param v2 The immutable value containing the divisor
*/
template<typename T>
inline void divide(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>() / v2.as<T>();
}
/**
* Performs binary division and stores the result in the
* result pointer for strings
*
* @param res The result of the division
* @param v1 The immutable value containing the dividend
* @param v2 The immutable value containing the divisor
* @throw unsupported_exception
*/
template<>
inline void divide<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "/ not supported for string type");
}
/**
* Performs binary division and stores the result in the
* result pointer for the none type
*
* @param res The result of the division
* @param v1 The immutable value containing the dividend
* @param v2 The immutable value containing the divisor
* @throw unsupported_exception
*/
template<>
inline void divide<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "/ not supported for none type");
}
/**
* Performs binary division and stores the remainder in the
* result pointer
*
* @tparam The data type of the immutable values
* @param res The remainder of the division
* @param v1 The immutable value containing the dividend
* @param v2 The immutable value containing the divisor
*/
template<typename T>
inline void modulo(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>() % v2.as<T>();
}
/**
* Performs binary division and stores the remainder in the
* result pointer for strings
*
* @param res The remainder of the division
* @param v1 The immutable value containing the dividend
* @param v2 The immutable value containing the divisor
* @throw unsupported_exception
*/
template<>
inline void modulo<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "% not supported for string type");
}
/**
* Performs binary division and stores the remainder in the
* result pointer for the none type
*
* @param res The remainder of the division
* @param v1 The immutable value containing the dividend
* @param v2 The immutable value containing the divisor
* @throw unsupported_exception
*/
template<>
inline void modulo<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "% not supported for none type");
}
/**
* Performs binary division and stores the remainder in the
* result pointer for the float type
*
* @param res The remainder of the division
* @param v1 The immutable value containing the dividend
* @param v2 The immutable value containing the divisor
* @throw unsupported_exception
*/
template<>
inline void modulo<float>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "% not supported for float type");
}
/**
* Performs binary division and stores the remainder in the
* result pointer for the double type
*
* @param res The remainder of the division
* @param v1 The immutable value containing the dividend
* @param v2 The immutable value containing the divisor
* @throw unsupported_exception
*/
template<>
inline void modulo<double>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "% not supported for double type");
}
// Bitwise operators
/**
* Performs bitwise not operation and stores the result in the
* result pointer
*
* @tparam T The type of data the immutable value contains
* @param res The result of the bitwise not operation
* @param v1 The immutable value that the operator is applied to
*/
template<typename T>
inline void bw_not(void *res, const immutable_raw_data &v) {
*(reinterpret_cast<T *>(res)) = ~v.as<T>();
}
/**
* Performs bitwise not operation and stores the result in the
* result pointer
*
* @tparam T The type of data the immutable value contains
* @param res The result of the bitwise not operation
* @param v1 The immutable value that the operator is applied to
*/
template<>
inline void bw_not<bool>(void *res, const immutable_raw_data &v) {
*(reinterpret_cast<bool *>(res)) = !v.as<bool>();
}
/**
* Performs bitwise not operation and stores the result in the
* result pointer for strings
*
* @param res The result of the bitwise not operation
* @param v1 The immutable value that the operator is applied to
* @throw unsupported_exception
*/
template<>
inline void bw_not<std::string>(void *, const immutable_raw_data &v) {
THROW(unsupported_exception, "~ not supported for string type");
}
/**
* Performs bitwise not operation and stores the result in the
* result pointer for the void type
*
* @param res The result of the bitwise not operation
* @param v1 The immutable value that the operator is applied to
* @throw unsupported_exception
*/
template<>
inline void bw_not<void>(void *, const immutable_raw_data &v) {
THROW(unsupported_exception, "~ not supported for none type");
}
/**
* Performs bitwise not operation and stores the result in the
* result pointer for the float type
*
* @param res The result of the bitwise not operation
* @param v1 The immutable value that the operator is applied to
* @throw unsupported_exception
*/
template<>
inline void bw_not<float>(void *, const immutable_raw_data &v) {
THROW(unsupported_exception, "~ not supported for float type");
}
/**
* Performs bitwise not operation and stores the result in the
* result pointer for the double type
*
* @param res The result of the bitwise not operation
* @param v1 The immutable value that the operator is applied to
* @throw unsupported_exception
*/
template<>
inline void bw_not<double>(void *, const immutable_raw_data &v) {
THROW(unsupported_exception, "~ not supported for double type");
}
/**
* Performs bitwise and operation and stores the result in the
* result pointer
*
* @tparam T The data type of the immutable data values
* @param res The result of the bitwise and operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
*/
template<typename T>
inline void bw_and(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>() & v2.as<T>();
}
/**
* Performs bitwise and operation and stores the result in the
* result pointer for strings
*
* @param res The result of the bitwise and operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_and<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "& not supported for string type");
}
/**
* Performs bitwise and operation and stores the result in the
* result pointer for the none type
*
* @param res The result of the bitwise and operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_and<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "& not supported for none type");
}
/**
* Performs bitwise and operation and stores the result in the
* result pointer for floats
*
* @param res The result of the bitwise and operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_and<float>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "& not supported for float type");
}
/**
* Performs bitwise and operation and stores the result in the
* result pointer for doubles
*
* @param res The result of the bitwise and operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_and<double>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "& not supported for double type");
}
/**
* Performs bitwise or operation and stores the result in the
* result pointer
*
* @tparam T The type of data of the immutable values
* @param res The result of the bitwise or operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
*/
template<typename T>
inline void bw_or(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>() | v2.as<T>();
}
/**
* Performs bitwise or operation and stores the result in the
* result pointer for strings
*
* @param res The result of the bitwise or operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_or<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "| not supported for string type");
}
/**
* Performs bitwise or operation and stores the result in the
* result pointer for the none type
*
* @param res The result of the bitwise or operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_or<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "| not supported for none type");
}
/**
* Performs bitwise or operation and stores the result in the
* result pointer for the float type
*
* @param res The result of the bitwise or operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_or<float>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "| not supported for float type");
}
/**
* Performs bitwise or operation and stores the result in the
* result pointer for the double type
*
* @param res The result of the bitwise or operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_or<double>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "| not supported for double type");
}
/**
* Performs bitwise xor operation and stores the result in the
* result pointer
*
* @tparam T the type of the immutable raw data
* @param res The result of the bitwise xor operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
*/
template<typename T>
inline void bw_xor(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>()
^ v2.as<T>();
}
/**
* Performs bitwise xor operation and stores the result in the
* result pointer for strings
*
* @param res The result of the bitwise xor operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_xor<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "^ not supported for string type");
}
/**
* Performs bitwise xor operation and stores the result in the
* result pointer for the none type
*
* @param res The result of the bitwise xor operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_xor<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "^ not supported for none type");
}
/**
* Performs bitwise xor operation and stores the result in the
* result pointer for floats
*
* @param res The result of the bitwise xor operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_xor<float>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "^ not supported for float type");
}
/**
* Performs bitwise xor operation and stores the result in the
* result pointer for doubles
*
* @param res The result of the bitwise xor operation
* @param v1 The first immutable value in the expression
* @param v2 The second immutable value in the expression
* @throw unsupported_exception
*/
template<>
inline void bw_xor<double>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "^ not supported for double type");
}
/**
* Performs bitwise left shift operation and stores the result in the
* result pointer
*
* @tparam T The data type of the immutable raw data
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
*/
template<typename T>
inline void bw_lshift(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>() << v2.as<T>();
}
/**
* Performs bitwise left shift operation and stores the result in the
* result pointer for strings
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_lshift<bool>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "<< not supported for bool type");
}
/**
* Performs bitwise left shift operation and stores the result in the
* result pointer for strings
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_lshift<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "<< not supported for string type");
}
/**
* Performs bitwise left shift operation and stores the result in the
* result pointer for the none type
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_lshift<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "<< not supported for none type");
}
/**
* Performs bitwise left shift operation and stores the result in the
* result pointer for floats
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_lshift<float>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "<< not supported for float type");
}
/**
* Performs bitwise left shift operation and stores the result in the
* result pointer for doubles
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_lshift<double>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, "<< not supported for double type");
}
/**
* Performs bitwise right shift operation and stores the result in the
* result pointer
*
* @tparam T The data type of the immutable raw data values
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
*/
template<typename T>
inline void bw_rshift(void *res, const immutable_raw_data &v1, const immutable_raw_data &v2) {
*(reinterpret_cast<T *>(res)) = v1.as<T>() >> v2.as<T>();
}
/**
* Performs bitwise right shift operation and stores the result in the
* result pointer for bools
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_rshift<bool>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, ">> not supported for bool type");
}
/**
* Performs bitwise right shift operation and stores the result in the
* result pointer for strings
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_rshift<std::string>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, ">> not supported for string type");
}
/**
* Performs bitwise right shift operation and stores the result in the
* result pointer for the none type
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_rshift<void>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, ">> not supported for none type");
}
/**
* Performs bitwise right shift operation and stores the result in the
* result pointer for floats
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_rshift<float>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, ">> not supported for float type");
}
/**
* Performs bitwise right shift operation and stores the result in the
* result pointer for doubles
*
* @param res The result of the bitwise xor operation
* @param v1 The value to shift
* @param v2 The amount to shift by
* @throw unsupported_exception
*/
template<>
inline void bw_rshift<double>(void *, const immutable_raw_data &v1, const immutable_raw_data &v2) {
THROW(unsupported_exception, ">> not supported for double type");
}
/**
* Gets a list of the unary operators for the given type
*
* @tparam T The data type the operators act on
*
* @return A vector containing the unary operator functions
*/
template<typename T>
inline unary_ops_t init_unaryops() {
return {assign<T>, negative<T>, positive<T>, bw_not<T>};
}
/**
* Gets a list of binary operators for the given type
*
* @tparam T The data type the operators act on
*
* @return A vector containing the binary operator functions
*/
template<typename T>
inline binary_ops_t init_binaryops() {
return {add<T>, subtract<T>, multiply<T>, divide<T>, modulo<T>, bw_and<T>, bw_or<T>, bw_xor<T>, bw_lshift<T>,
bw_rshift<T>};
}
}
#endif /* CONFLUO_TYPES_ARITHMETIC_OPS_H_ */
``` |
```xml
<?xml version="1.0" encoding="UTF-8"?>
<definitions xmlns="path_to_url" xmlns:xsi="path_to_url" xmlns:xsd="path_to_url" xmlns:flowable="path_to_url" xmlns:bpmndi="path_to_url" xmlns:omgdc="path_to_url" xmlns:omgdi="path_to_url" typeLanguage="path_to_url" expressionLanguage="path_to_url" targetNamespace="path_to_url">
<process id="dogeProcess" name="DogeProcess" isExecutable="true">
<startEvent id="startEvent1"></startEvent>
<subProcess id="sid-1AA38D08-310B-4BFE-A6AD-F32488643000" name="subProcess">
<multiInstanceLoopCharacteristics isSequential="true" flowable:collection="photos" flowable:elementVariable="photo"></multiInstanceLoopCharacteristics>
<serviceTask id="sid-FCFA0F9D-8796-43E2-ACFD-13AF3465F929" name="Send to photo processing service" flowable:expression="${photoService.processPhoto(photo.id)}"></serviceTask>
<startEvent id="sid-821438D0-CD00-43F1-A847-42112E44BA12"></startEvent>
<receiveTask id="wait" name="Wait for completion"></receiveTask>
<endEvent id="sid-9BDA1151-ECDE-472B-A9E8-4F6A0E5C2901"></endEvent>
<sequenceFlow id="sid-4B4908D7-A6A3-45B6-9267-D3C355154510" sourceRef="sid-821438D0-CD00-43F1-A847-42112E44BA12" targetRef="sid-FCFA0F9D-8796-43E2-ACFD-13AF3465F929"></sequenceFlow>
<sequenceFlow id="sid-3667040B-ED6C-424E-BFAD-69718B40FD1C" sourceRef="sid-FCFA0F9D-8796-43E2-ACFD-13AF3465F929" targetRef="wait"></sequenceFlow>
<sequenceFlow id="sid-518F987E-BBEE-4565-BC94-00E02430E81A" sourceRef="wait" targetRef="sid-9BDA1151-ECDE-472B-A9E8-4F6A0E5C2901"></sequenceFlow>
</subProcess>
<sequenceFlow id="sid-13DC3678-E57E-4E0B-9F80-55E11BF7304F" sourceRef="startEvent1" targetRef="sid-1AA38D08-310B-4BFE-A6AD-F32488643000"></sequenceFlow>
<boundaryEvent id="sid-CF518067-8143-4CC3-AE33-C3FE326E9EC3" attachedToRef="sid-1AA38D08-310B-4BFE-A6AD-F32488643000" cancelActivity="true">
<timerEventDefinition>
<timeDuration>PT10M</timeDuration>
</timerEventDefinition>
</boundaryEvent>
<userTask id="sid-A51C2956-123E-44AD-9548-0239C6164596" name="Process photos manually" flowable:assignee="$INITIATOR">
<extensionElements>
<modeler:initiator-can-complete xmlns:modeler="path_to_url"><![CDATA[true]]></modeler:initiator-can-complete>
</extensionElements>
</userTask>
<sequenceFlow id="sid-F7745084-E689-431F-8F78-0FCAFE376EAE" sourceRef="sid-CF518067-8143-4CC3-AE33-C3FE326E9EC3" targetRef="sid-A51C2956-123E-44AD-9548-0239C6164596"></sequenceFlow>
<endEvent id="sid-463B9727-4C0A-4C1A-BE84-09D6842D3AF7"></endEvent>
<sequenceFlow id="sid-ECF49058-5E5D-49BB-804E-BFD9FED4D035" sourceRef="sid-A51C2956-123E-44AD-9548-0239C6164596" targetRef="sid-463B9727-4C0A-4C1A-BE84-09D6842D3AF7"></sequenceFlow>
<userTask id="sid-8E972729-8F07-4413-86A9-392A34D949EF" name="Review result" flowable:assignee="$INITIATOR">
<extensionElements>
<modeler:initiator-can-complete xmlns:modeler="path_to_url"><![CDATA[true]]></modeler:initiator-can-complete>
</extensionElements>
</userTask>
<sequenceFlow id="sid-0F909E8C-17D2-468B-8780-6DFF2C539369" sourceRef="sid-1AA38D08-310B-4BFE-A6AD-F32488643000" targetRef="sid-8E972729-8F07-4413-86A9-392A34D949EF"></sequenceFlow>
<exclusiveGateway id="sid-CC2BFD5B-E700-4C3A-BB7D-EC47A6BA7C0B" default="sid-733ED6FC-9CF7-485B-A67E-B6BF8D1F90DA"></exclusiveGateway>
<sequenceFlow id="sid-952ED7E5-9F9B-42E8-9212-DECA33D7A6D2" sourceRef="sid-8E972729-8F07-4413-86A9-392A34D949EF" targetRef="sid-CC2BFD5B-E700-4C3A-BB7D-EC47A6BA7C0B"></sequenceFlow>
<endEvent id="sid-DA92F2D8-10E6-4CFD-B44C-81998A8D6FAB"></endEvent>
<sequenceFlow id="sid-733ED6FC-9CF7-485B-A67E-B6BF8D1F90DA" sourceRef="sid-CC2BFD5B-E700-4C3A-BB7D-EC47A6BA7C0B" targetRef="sid-DA92F2D8-10E6-4CFD-B44C-81998A8D6FAB"></sequenceFlow>
<sequenceFlow id="sid-CCE52848-81CA-478A-B0E1-B4A55D419439" sourceRef="sid-CC2BFD5B-E700-4C3A-BB7D-EC47A6BA7C0B" targetRef="sid-58F18100-CA85-4D93-85F6-D61058913735">
<conditionExpression xsi:type="tFormalExpression"><![CDATA[${!approved}]]></conditionExpression>
</sequenceFlow>
<serviceTask id="sid-58F18100-CA85-4D93-85F6-D61058913735" name="Send failure email" flowable:type="mail">
<extensionElements>
<flowable:field name="to">
<flowable:string><![CDATA[test@blah.com]]></flowable:string>
</flowable:field>
<flowable:field name="from">
<flowable:string><![CDATA[no-reply@activiti.com]]></flowable:string>
</flowable:field>
<flowable:field name="html">
<flowable:string><![CDATA[Sorry, it didn't work out]]></flowable:string>
</flowable:field>
</extensionElements>
</serviceTask>
<endEvent id="sid-4A0917CE-835E-4D99-B771-8D02346009D3"></endEvent>
<sequenceFlow id="sid-D1A2FE7F-69A7-4712-9D72-4D52335388BE" sourceRef="sid-58F18100-CA85-4D93-85F6-D61058913735" targetRef="sid-4A0917CE-835E-4D99-B771-8D02346009D3"></sequenceFlow>
</process>
<bpmndi:BPMNDiagram id="BPMNDiagram_dogeProcess">
<bpmndi:BPMNPlane bpmnElement="dogeProcess" id="BPMNPlane_dogeProcess">
<bpmndi:BPMNShape bpmnElement="startEvent1" id="BPMNShape_startEvent1">
<omgdc:Bounds height="30.0" width="30.0" x="60.0" y="225.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-1AA38D08-310B-4BFE-A6AD-F32488643000" id="BPMNShape_sid-1AA38D08-310B-4BFE-A6AD-F32488643000">
<omgdc:Bounds height="268.0" width="387.0" x="167.0" y="106.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-FCFA0F9D-8796-43E2-ACFD-13AF3465F929" id="BPMNShape_sid-FCFA0F9D-8796-43E2-ACFD-13AF3465F929">
<omgdc:Bounds height="80.0" width="100.0" x="240.0" y="199.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-821438D0-CD00-43F1-A847-42112E44BA12" id="BPMNShape_sid-821438D0-CD00-43F1-A847-42112E44BA12">
<omgdc:Bounds height="30.0" width="30.0" x="180.0" y="224.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="wait" id="BPMNShape_wait">
<omgdc:Bounds height="80.0" width="100.0" x="375.0" y="199.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-9BDA1151-ECDE-472B-A9E8-4F6A0E5C2901" id="BPMNShape_sid-9BDA1151-ECDE-472B-A9E8-4F6A0E5C2901">
<omgdc:Bounds height="28.0" width="28.0" x="510.0" y="225.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-CF518067-8143-4CC3-AE33-C3FE326E9EC3" id="BPMNShape_sid-CF518067-8143-4CC3-AE33-C3FE326E9EC3">
<omgdc:Bounds height="31.0" width="31.0" x="434.49292161701123" y="359.2036040120936"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-A51C2956-123E-44AD-9548-0239C6164596" id="BPMNShape_sid-A51C2956-123E-44AD-9548-0239C6164596">
<omgdc:Bounds height="80.0" width="100.0" x="515.6531252612749" y="405.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-463B9727-4C0A-4C1A-BE84-09D6842D3AF7" id="BPMNShape_sid-463B9727-4C0A-4C1A-BE84-09D6842D3AF7">
<omgdc:Bounds height="28.0" width="28.0" x="660.6531252612749" y="431.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-8E972729-8F07-4413-86A9-392A34D949EF" id="BPMNShape_sid-8E972729-8F07-4413-86A9-392A34D949EF">
<omgdc:Bounds height="80.0" width="100.0" x="599.0" y="200.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-CC2BFD5B-E700-4C3A-BB7D-EC47A6BA7C0B" id="BPMNShape_sid-CC2BFD5B-E700-4C3A-BB7D-EC47A6BA7C0B">
<omgdc:Bounds height="40.0" width="40.0" x="744.0" y="220.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-DA92F2D8-10E6-4CFD-B44C-81998A8D6FAB" id="BPMNShape_sid-DA92F2D8-10E6-4CFD-B44C-81998A8D6FAB">
<omgdc:Bounds height="28.0" width="28.0" x="829.0" y="226.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-58F18100-CA85-4D93-85F6-D61058913735" id="BPMNShape_sid-58F18100-CA85-4D93-85F6-D61058913735">
<omgdc:Bounds height="80.0" width="100.0" x="829.0" y="90.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNShape bpmnElement="sid-4A0917CE-835E-4D99-B771-8D02346009D3" id="BPMNShape_sid-4A0917CE-835E-4D99-B771-8D02346009D3">
<omgdc:Bounds height="28.0" width="28.0" x="974.0" y="116.0"></omgdc:Bounds>
</bpmndi:BPMNShape>
<bpmndi:BPMNEdge bpmnElement="sid-733ED6FC-9CF7-485B-A67E-B6BF8D1F90DA" id="BPMNEdge_sid-733ED6FC-9CF7-485B-A67E-B6BF8D1F90DA">
<omgdi:waypoint x="784.0" y="240.0"></omgdi:waypoint>
<omgdi:waypoint x="829.0" y="240.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-518F987E-BBEE-4565-BC94-00E02430E81A" id="BPMNEdge_sid-518F987E-BBEE-4565-BC94-00E02430E81A">
<omgdi:waypoint x="475.0" y="239.0"></omgdi:waypoint>
<omgdi:waypoint x="510.0" y="239.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-4B4908D7-A6A3-45B6-9267-D3C355154510" id="BPMNEdge_sid-4B4908D7-A6A3-45B6-9267-D3C355154510">
<omgdi:waypoint x="210.0" y="239.0"></omgdi:waypoint>
<omgdi:waypoint x="240.0" y="239.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-D1A2FE7F-69A7-4712-9D72-4D52335388BE" id="BPMNEdge_sid-D1A2FE7F-69A7-4712-9D72-4D52335388BE">
<omgdi:waypoint x="929.0" y="130.0"></omgdi:waypoint>
<omgdi:waypoint x="974.0" y="130.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-ECF49058-5E5D-49BB-804E-BFD9FED4D035" id="BPMNEdge_sid-ECF49058-5E5D-49BB-804E-BFD9FED4D035">
<omgdi:waypoint x="615.6531252612749" y="445.0"></omgdi:waypoint>
<omgdi:waypoint x="660.6531252612749" y="445.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-0F909E8C-17D2-468B-8780-6DFF2C539369" id="BPMNEdge_sid-0F909E8C-17D2-468B-8780-6DFF2C539369">
<omgdi:waypoint x="554.0" y="240.0"></omgdi:waypoint>
<omgdi:waypoint x="599.0" y="240.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-CCE52848-81CA-478A-B0E1-B4A55D419439" id="BPMNEdge_sid-CCE52848-81CA-478A-B0E1-B4A55D419439">
<omgdi:waypoint x="764.0" y="220.0"></omgdi:waypoint>
<omgdi:waypoint x="764.0" y="130.0"></omgdi:waypoint>
<omgdi:waypoint x="829.0" y="130.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-3667040B-ED6C-424E-BFAD-69718B40FD1C" id="BPMNEdge_sid-3667040B-ED6C-424E-BFAD-69718B40FD1C">
<omgdi:waypoint x="340.0" y="239.0"></omgdi:waypoint>
<omgdi:waypoint x="375.0" y="239.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-952ED7E5-9F9B-42E8-9212-DECA33D7A6D2" id="BPMNEdge_sid-952ED7E5-9F9B-42E8-9212-DECA33D7A6D2">
<omgdi:waypoint x="699.0" y="240.0"></omgdi:waypoint>
<omgdi:waypoint x="744.0" y="240.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-F7745084-E689-431F-8F78-0FCAFE376EAE" id="BPMNEdge_sid-F7745084-E689-431F-8F78-0FCAFE376EAE">
<omgdi:waypoint x="451.094167074073" y="390.1644338230481"></omgdi:waypoint>
<omgdi:waypoint x="455.0" y="445.0"></omgdi:waypoint>
<omgdi:waypoint x="515.6531252612749" y="445.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
<bpmndi:BPMNEdge bpmnElement="sid-13DC3678-E57E-4E0B-9F80-55E11BF7304F" id="BPMNEdge_sid-13DC3678-E57E-4E0B-9F80-55E11BF7304F">
<omgdi:waypoint x="90.0" y="240.0"></omgdi:waypoint>
<omgdi:waypoint x="167.0" y="240.0"></omgdi:waypoint>
</bpmndi:BPMNEdge>
</bpmndi:BPMNPlane>
</bpmndi:BPMNDiagram>
</definitions>
``` |
James Jardine may refer to:
James Jardine (engineer) (1776–1858), Scottish civil engineer, mathematician and geologist
James Jardine (cricketer, born 1794) (1794–1872), English cricketer
James Jardine (judge) (1846–1909), English cricketer, academic, barrister and judge
James Jardine (Medal of Honor) (1837–1922), Union Army soldier and Medal of Honor recipient
James Bruce Jardine (1870–1955), British soldier and diplomat
James Willoughby Jardine (1879–1945), British judge and politician |
```python
def test_get_store(client, created_store_id):
response = client.get(
f"/store/{created_store_id}",
)
assert response.status_code == 200
assert response.json == {
"id": 1,
"name": "Test Store",
"items": [],
"tags": [],
}
def test_get_store_not_found(client):
response = client.get(
"/store/1",
)
assert response.status_code == 404
assert response.json == {"code": 404, "status": "Not Found"}
def test_get_store_with_item(client, created_store_id):
client.post(
"/item",
json={"name": "Test Item", "price": 10.5, "store_id": created_store_id},
)
response = client.get(
f"/store/{created_store_id}",
)
assert response.status_code == 200
assert response.json["items"] == [
{
"id": 1,
"name": "Test Item",
"price": 10.5,
}
]
def test_get_store_with_tag(client, created_store_id):
client.post(
f"/store/{created_store_id}/tag",
json={"name": "Test Tag"},
)
response = client.get(
f"/store/{created_store_id}",
)
assert response.status_code == 200
assert response.json["tags"] == [{"id": 1, "name": "Test Tag"}]
def test_create_store(client):
response = client.post(
"/store",
json={"name": "Test Store"},
)
assert response.status_code == 201
assert response.json["name"] == "Test Store"
def test_create_store_with_items(client, created_store_id):
client.post(
"/item",
json={"name": "Test Item", "price": 10.5, "store_id": 1},
)
# Get the store with id 1 and check the items contains the newly created item
response = client.get(
f"/store/{created_store_id}",
)
assert response.status_code == 200
assert response.json["items"] == [
{
"id": 1,
"name": "Test Item",
"price": 10.5,
}
]
def test_delete_store(client, created_store_id):
response = client.delete(
f"/store/{created_store_id}",
)
assert response.status_code == 200
assert response.json == {"message": "Store deleted"}
def test_delete_store_doesnt_exist(client):
response = client.delete(
"/store/1",
)
assert response.status_code == 404
assert response.json == {"code": 404, "status": "Not Found"}
def test_get_store_list_empty(client):
response = client.get(
"/store",
)
assert response.status_code == 200
assert response.json == []
def test_get_store_list_single(client):
client.post(
"/store",
json={"name": "Test Store"},
)
response = client.get(
"/store",
)
assert response.status_code == 200
assert response.json == [{"id": 1, "name": "Test Store", "items": [], "tags": []}]
def test_get_store_list_multiple(client):
client.post(
"/store",
json={"name": "Test Store"},
)
client.post(
"/store",
json={"name": "Test Store 2"},
)
response = client.get(
"/store",
)
assert response.status_code == 200
assert response.json == [
{"id": 1, "name": "Test Store", "items": [], "tags": []},
{"id": 2, "name": "Test Store 2", "items": [], "tags": []},
]
def test_get_store_list_with_items(client):
client.post(
"/store",
json={"name": "Test Store"},
)
client.post(
"/item",
json={"name": "Test Item", "price": 10.5, "store_id": 1},
)
response = client.get(
"/store",
)
assert response.status_code == 200
assert response.json == [
{
"id": 1,
"name": "Test Store",
"items": [
{
"id": 1,
"name": "Test Item",
"price": 10.5,
}
],
"tags": [],
}
]
def test_get_store_list_with_tags(client):
resp = client.post(
"/store",
json={"name": "Test Store"},
)
client.post(
f"/store/{resp.json['id']}/tag",
json={"name": "Test Tag"},
)
response = client.get(
"/store",
)
assert response.status_code == 200
assert response.json == [
{
"id": 1,
"name": "Test Store",
"items": [],
"tags": [{"id": 1, "name": "Test Tag"}],
}
]
def test_create_store_duplicate_name(client):
client.post(
"/store",
json={"name": "Test Store"},
)
response = client.post(
"/store",
json={"name": "Test Store"},
)
assert response.status_code == 400
assert response.json["message"] == "A store with that name already exists."
``` |
Wrząca is a village in the administrative district of Gmina Lutomiersk, within Pabianice County, Łódź Voivodeship, in central Poland. It lies approximately east of Lutomiersk, north-west of Pabianice, and west of the regional capital Łódź.
References
Villages in Pabianice County |
This page is a glossary of Bowls terminology.
This page explains commonly used terms in the sport of bowls, which includes variations of outdoor bowls also known as Lawn Bowls, Crown Green Bowls, Indoor Bowls and Carpet Bowls.
1–9
A game of bowls where the object is to reach a score of 100 shots. Usually used in games based on a proportional scoring system.
The furthermost position that the jack can be placed following the lead bowler rolling the jack at the start of an end. If the jack is rolled past this point, and remains within the rink boundaries, the jack is spotted on the designated mark, positioned 2 metres back from the ditch .
A game of bowls where the object is to be the first to reach a score of 21 shots.
A game of bowls where the object is to be the first to reach a score of 25 shots.
In some pennant games, the controlling body awards an 8 badge to members of a fours rink where a full count of eight shots is achieved in a single end.
A
the bowl closest to the jack, often in relation to other bowls surrounding the head, also referred to as the "absolute shot"
name of an Australian-based bowls manufacturer.
bowls surface made of man made materials, as compared to grass greens.
B
a bowl place behind the head, positioned so that if the opposition trails the jack from its current position towards the back of the rink, the back bowl may become shot or reduce the number of shots that the opposition may have if moved to this part of the rink.
The ditch at the end of the green which is directly behind a player when they stand on the mat.
For a right handed player, delivering a bowl to the left hand side of the rink, with the bias facing the centre line of the rink. For a left handed player, delivering a bowl to the right hand side of the rink, with the bias facing the centre line of the rink.
the area on the outer edge of the green, beyond the ditch.
reserve players who have not been selected to play in a competitive game. On competition days, those players not selected to play may have a practice game at the same time that the competition is in progress. In the past the term also described those players watching and critiquing the game from the bank, and an obsolete meaning, spelt "banckers", referred to skilful bowlers who lured unsuspecting amateurs to play them for money or other prizes In Australia, the origin of the name may also stem from a sponsorship of a bank who provided prizes or other financial support to clubs.
A type of grass (botanical name: agrostis stolonifera) used for the construction of lawn bowls greens. Known for its carpet like cover, and the ability to successfully cultivate in a wide variety of climates.
the natural curve built into a bowl, creating an arc from the point of releasing the bowl to the point it stops.
a call made when determining which player will deliver the first bowl at the start of a game. One player will roll a bowl end over end, and calling "bigs" refers to the bowl stopping with the side where the larger rings are facing upward. See also smalls.
A bowl positioned on the green such that it would stop an opponents bowl from reaching a defined point, usually the jack, based on its regular line.
: the biased ball used in the game of bowls. The side of the bowl that is biased can be identified by the smaller engraved concentric rings seen, compared to the outer (non biased) side of the bowl.
a device that enables players, who have an inability to bend as part of a standard delivery action, to bowl in an upright position. Bowling arms are normally licensed or approved by the and also require the bowler to have a medical certificate to verify the need for use.
official name of the sport, as defined by World Bowls.
: a piece of cloth used by bowlers to cleant and/or polish a bowl during a game. They are made of various materials, with the most popular being cotton cloth, or a chamois for wet conditions.
a marker placed on the bank to indicate the outside boundary of a rink. If a bowl finishes completely outside the boundary it is a dead bowl. If the jack is rolled outside the boundary when first delivered, it is returned to the mat for the opposition player to roll the jack. If the jack is moved outside the boundary after being placed on the centre line, the end is declared a dead end and is replayed, unless the competition has a local rule to spot the jack in such situations.
during a game, a planned stop in play, usually an afternoon tea break. In some competitions, local regulations allow the managers to determine if a break is taken or if the teams play straight through to completion.
C
a piece of equipment used by an umpire or a player, to judge the relative distance between the jack and one or more bowls, at the conclusion of an end, which will determine the number of shots held by a player or team.
(a.k.a. (indoor bowls)) a variation of outdoor bowls, played on a rectangular piece of carpet that is laid out on the floor, and can be rolled up a stored away between games. Carpet bowls have different types of bowls, which are smaller than an outdoor bowl, and the rules that govern play are unique to this particular form of the game.
represents the midpoint of a rink between the boundary pegs. Some greens will have centre lines drawn on the rink from the 2 metre mark towards the middle of the green at both ends, extending for a few metres. The jack is aligned with the centre line after being rolled by a player at the start of an end.
used to indicate a bowl that has touched the jack as part of its initial delivery during an end. A player in charge of the head will use a piece of chalk, or chalk spray, to place a mark, which must be done before the next bowl comes to a rest, and must be removed before the bowl is delivered in the next end.
once all bowls have been delivered by players standing at the mat end of the rink, they will move to the other end of the rink. See also crossover.
following your own bowl down the green after delivery. If permitted by the rules of the competition, the player is expected to be positioned behind the head on or before the bowl comes to rest. See also riding.
a piece of material placed under a bowl to hold it in place on the green. When a measure is called for, and a bowl is leaning on another bowl, it is sometimes necessary to chock the bowl so that one bowl can be removed without changing the position of the other. Materials used include rubber and foam wedges, or short lengths of rope.
short hand term describing the material used to manufacture a bowl. Most modern bowls are made of a hardened composite plastic material. Before composite plastic was used, bowls were made from a hardwood material, usually lignum vitae. See also wood.
the organisation with immediate control over the conditions of play of any given bowls competition.
a method of holding the bowl in your hand, where the running surface of the bowl sits along the fingers of the hand, with the thumb held at or near the top of the bowl as a balancing mechanism. cradle grip.
the number of shots received by a player or team at the conclusion of an end.
a bowl that is closer to the jack than an opponents nearest bowl is considered a "counter". See also count.
a description of the weight required to complete an ideal shot. The objective is to play the bowl such that it gently hits the target and moves it slightly, or has a flow on impact to move a bowl or jack that is touching the target.
a method of holding the bowl in your hand, where the running surface of the bowl sits cradled between the fingers of the hand, and the palm, with the thumb positioned alongside the fingers in a cupping style. See also claw grip.
in a team game, when all players at the mat end of the rink have delivered their bowls, they will move to the opposite end of the rink, and the player in charge of the head, usually the skip, crosses over to the mat end to deliver their bowls.
describes a variation of outdoor bowls, which is played on greens that have an undulating surface, with a peak in the middle. Play also differs as there are no rink boundaries, and the jack also has a bias. See Crown Green Bowls.
refers to the official laws of the Sport of Bowls.
D
after a bowl has been delivered and comes to rest, if it finishes in the ditch, or outside the rink boundary, it is considered a dead bowl, and is removed from play. However, if the bowl has touched the jack, it remains a live bowl even if in the ditch, as long as it is within the boundary of the rink.
a bowl that becomes the shot bowl (closest to the jack) without touching any other bowl during its delivery.
a partially completed end that has to be replayed, by reason of the jack going outside the rink or green boundaries, or an umpire ruling that due to an action, the head cannot be returned to its previous state. See also re-spot.
See slow green.
an expression advising that the last player on the mat is not going to deliver his last bowl. It is called for if the player or team is holding shot, or that there is significant danger of changing the head to the detriment of the player/team if the last bowl were the change the current situation.
the action performed by a player to propel the bowl from the mat end of the rink to the head at the other end of the rink .
in team based competitions, players on the same team will apply a unique ring shaped decal to both sides of the bowl so that they are easily distinguishable from the opposition's bowls. See also rings.
play a bowl with sufficient weight to alter the position of bowls and/or the jack in the head. A request of the skip called for usually when the team is not holding shot, or is blocked from playing a preferred shot by bowls in the way of the objective (usually the jack).
the area surrounding a green, usually identifiable as a shallow trench at the edges of the green. Some ditches are a natural surround formed by mounds and trenches of soil, whilst other greens have a man made ditch comprising wooden formwork, plinth, rubber sheets, and filled with a sand or artificial materials. Also see front ditch and back ditch
a rink that runs parallel to the ditch along its length.
to play a bowl with sufficient weight to reach the ditch at the other end of the rink, or the ditch nearest the head in Crown Green bowls.
in pennant games, associations may create tiered competition made up of separate divisions of teams. Often there are multiple sections to form part of a division. Section winners then play against other section winners in that division to determine the overall division champion.
expression to confirm if your opponent has one or more bowls closest to the jack. If a marker is providing this information in a singles game, the marker can also indicate this status by holding a clenched fist downwards towards the ground.
name of an England-based bowls manufacturer.
*# (bowl) a bowl delivered to finishes closest to the jack, without the need to move or touch other bowls in the head.
(competition) a schedule of matches showing the teams or players and their opponents in each round of the competition.
at the conclusion of an end if the closest bowl of each player or team is judged to be the same distance away from the jack, no score is recorded, but the end counts for games that are based on playing a number of ends.
a bowl delivered with the maximum force that a player can exert, the aim being to kill the end, disturb the head, or hit opposition bowls out of the head.
a bowl delivered from above the green so that it bounces on the turf when it first leaves the hand. Dumping a bowl is an indication of poor technique, or may indicate the player has an injury or disability that does not enable the bowl to be let go of parallel to the ground.
E
Describes the direction of play for the rink s, which run in parallel with each other on any given day. Most bowling rinks are built to accommodate play alternately in a north–south, or east–west direction. Green keepers and Greens Directors will alter the direction of play to assist in managing the quality of the greens over a season. Most competitions play north–south, to avoid players looking directly into the sun. East-west play is often used for social games. This does not apply to the Crown Green game of bowls which utilises the entire green surface and is not divided into rinks.
When a bowler delivers a bowl, he can choose to play either a forehandor backhand shot. During play the person in charge of the head may advise the player on the mat that he can play "either hand" rather than directing a particular hand to play.
the playing of the jack and all the bowls of all players (or teams) once in a single direction, resulting in either a number of shots for one of the teams, a dead end, or a drawn end. Some forms of the game have a set number of ends played, others play an unlimited number of ends until a particular score is reached or exceeded.
F
(bowl) if a bowl is delivered and finishes past the intended target, it is said to have been a "fast bowl".
(green) (a.k.a. quick green) a green is described as quick when the bowls travel at a faster further over the surface compared to a slow green relative to the same amount of effort required when delivering a bowl.
Used by an umpire or third to judge the distance between the quickjack and one or more bowls, where a bowls measure is too large for use.
when preparing to deliver a bowl, the player positions their feet and legs, and then locks into this position, completing the delivery of the bowl with movement of the upper body only.
in games where a mat is used, players are required to keep at least one foot on or over the mat during the delivery. A foot fault occurs when this condition is not met. Depending on the rules of competition and the association running the competition, players can be warned, or their bowl can be declared a dead bowl.
For a right handed player, delivering a bowl to the right hand side of the rink, with the bias facing towards the centre line of the rink. For a left handed player, delivering a bowl to the left hand side of the rink, with the bias facing towards the centre line of the rink.
a team game where each team consists of four(4) players, a lead, second, third, and skip.
The traditional singles variation of the game. However, it can be played with a different number of woods, resulting in two wood singles.
The ditch at the end of the green which is directly in front of a player when they stand on the mat.
scoring the maximum number of possible shots in an end where every bowl from all players in the one team are closest to the jack than the nearest opposition bowl.
G
give away the mat: At the start of a game a toss of a coin or bowl is held. The winner of the toss has the option to play the first bowl, called keeping the mat, or letting the opposition have the first bowl, to "give away the mat", thus reserving the last bowl of the end for themselves. After the first end, the winner of the end automatically get the mat and the first bowl of the next end. Some controlling bodies have experimented with an additional rule allowing the winner of the end to decide if they keep the mat or give the mat away. Having the last bowl of an end is seen as an advantage, particularly at the highest levels of competition..
grass:
refers to the width of the bowl required to enable it to stop at a designated point within the rink. To take more grass is to bowl wider than your previous delivery.
a grass green refers to the type of playing surface that the green has manufactured from, as opposed to a synthetic or artificial green.
green:
alternative description to grass to describe the width of the bowlrequired to enable it to stop at a designated point within the rink. To take more green is to bowl wider than your previous delivery
The area of the playing surface containing one or more rinks, the perimeter of which is usually defined by a surrounding ditch.
green-keeper: common term for the staff who maintain bowling greens.
grip:
refers to the way a player holds the bowl in preparation for delivery. Two common grips are the "claw grip" and the "cradle grip".
a bowl that is manufactured with an inverted ridge or dimple around the outer edges of the side of the bowl is also referred to as a grip or "gripped" bowl
.
H
hand: the direction that a bowl is to be delivered in. See also forehand, backhand, either hand
handicap: In games of singles, some formats allow for a positive or negative handicap to be applied to players of different ability. For example, in a game of 25 Up, one player may start at +5 shots, and one at -5 shots, meaning the player with a +5 handicap need only score another 20 shots to win, whereas the player on -5 handicap must score 30 shots to win.
head: refers to the area of the rink where the jack, and any live bowls that have been delivered on any particular end.
heavy :
(weight) a bowl delivered with more force than required to deliver it to a desired position on the rink
(bowl) a relative description of the physical weight of the bowl, compared with a standard weight bowl, or an xtra heavy weight bowl
(green) a description of the relatively slow pace of the green, compared with a (quick) or (fast) green
Henselite: name of an Australian-based bowls manufacturer.
holding :
(bowl) indicates that your bowl is the closest to the jack - "we are holding shot"
(green) a relative description of the line a bowl is taking on the rink at a moment in time. A bowl that is holding its line is an indication that it is travelling a different line to that normally expected, due to either the condition of the green, the pace of the green, or the delivery action of the bowler.
honour board: lists of achievements that are placed on display, usually within a club house or an associations head office. Honour boards usually recognise office bearers, championship winners, and representative honours at region, county, state, national and international levels of competition.
I
indoor bowls:
a game of bowls that is played in an indoor arena, with the same equipment and field dimensions as for outdoor bowls
(a.k.a. (carpet bowls)) a variation of outdoor bowls, played on a rectangular piece of carpet that is laid out on the floor, and can be rolled up a stored away between games. Carpet bowls have different types of bowls, which are smaller than an outdoor bowl, and the rules that govern play are unique to this particular form of the game.
inner ring: on one side of a bowl, there are one or 2 small concentric circles, indicating that this is the biased side, or the side towards which the bowl will turn once delivered out of the hand. See also (outer ring).
J
jack: (a.k.a. (kitty)) is the small white ball that defined the target, or mark, for all other bowls to be played towards. In outdoor bowls the jack has no bias, but in Crown Green bowls, the jack has a bias similar to the bowl itself.
jack high: is a comparison of the position of a bowl in relation to the jack. A "jack high bowl" means a bowl whose front edge, which is closest to the bowler on the mat, is level with the front edge of the jack.
K
keep the mat: At the start of a game a toss of a coin or (bowl) is held. The winner of the toss has the option to play the first bowl, called keeping the mat, or letting the opposition have the first bowl, to "give away the mat", thus reserving the last bowl of the end for themselves. After the first (end), the winner of the end automatically get the mat and the first bowl of the next end. Some controlling bodies have experimented with an additional rule allowing the winner of the end to decide if the keep the mat or give the mat away. Having the last bowl of an end is seen as an advantage, particularly at the highest levels of competition.
kill: a bowl delivered in such a way that results in the jack falling outside the boundary of the rink. Once killed, an end is normally replayed, either from the same direction, or from the opposite end by agreement with the opposition. Some competitions require the jack to be spotted on a pre-arranged part of the green if the jack falls outside the rink boundaries, with play continuing with the remaining bowls after being spotted.
kiss: a bowl that glances either the jackor another bowl, resulting in a slight movement of the jack or bowl involved.
kitty: (a.k.a. jack) is the small white ball that defined the target, or mark, for all other bowls to be played towards. In outdoor bowls the kitty has no bias, but in Crown Green bowls, the kitty has a bias similar to the bowl itself.
knock-out: in a competition game, the winner progresses to the next round, however the loser is eliminated, thus being "knocked out" of, the competition.
L
lawn bowling: traditionally and historical, the game of Bowls was played on grass fields or greens, and thus was known as lawn bowls. With advances in construction techniques, and the introduction of artificial surfaces, in the evolution of the game it has become known as Bowls.
lead: in a team of 2 or more, the player who delivers his bowl first is known as the lead. The lead has specific duties, including rolling the jack when his team is the first to bowl on a particular end.
length: refers to the amount of force required when delivering a bowl to reach the desired target. For a draw bowl, the required force would result in the bowl stopping at a point parallel to the jack. See also line
lifter: a piece of equipment, usually made of metal, which enables a player to pick up a bowl from the green without the need to bend down. Often used by players with an injury or disability which prevents them from bending sufficient to reach the ground.
lignum vitae: refers to a type of natural hardwood material from a tree, used to make a bowl. Prior to the introduction of composite plastic materials, the predominant material for the manufacture of bowls today, lignum vitae was the dominant material used.
line: is the directional arc that the bowl travels along from the point of delivery to the point it stops. For a draw bowl, the player will identify an aiming point when letting go of the bowl, such that it will travel along a pathway to end up as close as possible to his target, usually the jack. The line of the bowl will vary depending on the prevailing conditions of the green (heavy, fast), the bias of the bowl, and the desired finishing position.
live bowl: after a bowl has been delivered and comes to rest, if it stops within the confines of the rink (or green for Crown Green bowls) it is considered live. if a bowl finishes in the ditch, or outside the rink boundary, it is considered a dead bowl . However, if the bowl has touched the jack, it remains a live bowl even if in the ditch, as long as it is within the boundary of the rink.
M
manager: in team games, a manager is appointed for each team, whose role is to fill in the scorecards, agree the match up of rinks between teams, tally the total scores of all rinks at the end of a game, and submit the result to the governing competition association. The manager may have other duties depending on the domestic regulations in place for a particular competition, and can include being the point of contact for a team in relation to decisions to stop play should adverse weather conditions affect play, but does not normally include adjudicating on the rules of bowls, which is handled by a designated umpire.
mark: is the target or object that bowls are aimed at. In bowls the mark is the jack (a.k.a. kitty)
marker: In a game of singles, a non playing bowler will assist the players by aligning the jack on the centre line after it has been rolled, answer questions asked by the players about the state of play, chalk bowls that become touchers, and keep the scorecard and scoreboard up to date during a game.
mat: a rectangular piece of material, which designates the point from which bowls must be delivered for a particular end.
matching bowl: a bowl that sits next to or near an opposition bowl in the head.
maximum length: the maximum distance possible between the mat and the end of the rink, designated by a spot or mark, usually the 2 metre mark.
measure:
(instrument) a small pocket sized hand held tape measure used to judge the distance between the jack and one or more bowls at the conclusion of an end, which will determine the number of shots held by a player or team.
(distance) if at the conclusion of an end of bowls, the number of shots held by a team or player cannot be determined by agreement, the designated measurer will use a tape measure to determine the result - "Call for a measure".
minimum length: the minimum distance allowed between the mat and the jack. In the crystal mark edition of rules, the minimum length of an end is 23 metres. Some domestic regulations can vary this minimum length. For example, in Australia, the minimum length is 21 metres. Most greens have a mark on the plinth of the ditch to indicate the minimum length point from the 2 metre mark.
mirror: a custom designed instrument, used by umpires to determine if a jack or bowl is within the boundary of the rink during play. Often used in conjunction with a scope when making judgements from one end of the rink to the other..
N
narrow:
(bias) a narrow bias describes the relatively narrow line that a bowl's arc takes from the point of delivery to the point at which it stops. Modern manufactured bowls are known as "narrow bias" bowls as they are designed to take a narrower line, compared to some older brands of bowls manufactured decades ago. Bowls must comply with minimum bias standards determined by World Bowls but vary to suit different styles of play and different playing conditions throughout the world.
(bowl) if a bowl is delivered and finishes to the inner side of the intended target, it is said to have been a "narrow bowl".
north–south: describes the direction of play for the rinks, which run in parallel with each other on any given day. Most bowls rinks are built to accommodate play alternately in a north–south, or east–west direction. Green keepers and Greens Directors will alter the direction of play to assist in managing the quality of the greens over a season. Most competitions play north–south, to avoid players looking directly into the sun. East-west play is often used for social games. This does not apply to the Crown Green game of bowls which utilises the entire green surface and is not divided into rinks.
no score: if at the completion of the end, a measure for the shot determines that both teams (or players) have one bowl of equal distance from the jack (or both have a bowl touching the jack), no score is recorded. For games that are based on a number of ends, the end still counts in the total number of ends to be played.
O
open hand: refers to the side of the rink that has the clearest path for a draw shot. See also forehand and backhand.
opening day: when a club holds its first event for the year or season. Often a club will hold a formal ceremony on this day, with the club champion and a local community representative, such as the mayor, councillor, or politician, invited to officially open the greens.
on the dot: refers to a position on the green which is designated as the furthermost distance on the rink where a jack is placed. If a lead rolls the jack, and it travels past this predetermined mark, the jack will be placed "on the dot" prior to the first bowl being delivered. In some jurisdictions this is known as the 2 metre mark.
outdoor bowls: refers to the variation of bowls which is governed by World Bowls and the crystal mark rules. Whilst using the term "outdoor" there are many venues where this variation of bowls is played in greens constructed within a covered building. See also indoor bowls carpet bowls.
outer ring: on one side of a bowl, there are one or 2 large concentric circles, indicating that this is the non biased side, or the side away from which the bowl will turn once delivered out of the hand. See also (inner ring).
P
pace: See speed.
pairs: a team game where each team consists of two(2) players, a lead, and a skip.
peg: See boundary peg.
pennant: a team based competition run at a county or state based level.
plinth: the vertical trim in a ditch, usually constructed of wood or concrete, and often has a covering of carpet or rubber to dampen the impact of bowls when they travel off the green into the ditch.
polish: a type of thick liquid compound applied to the surface of a bowl, which is then rubbed into the surface using a hand, cloth or polishing sleeve. The application of polish is designed to clean the surface of the bowl, provide a resistant surface to assist it travel more easily when a bowl is delivered, and provides additional grip between the bowl and the hand.
possession: the player or team whose turn it is to deliver a bowl is said to be in possession of the mat. Possession passes to the opposition when the bowl has come to rest after a delivery. Possession also includes the possession of the head, and opposition players should remain away from the head when not in possession of the mat.
practice end: (a.k.a. roll up) a warm up end, without scoring, to enable players to test their bowls in the conditions before a game starts.
proportional : (a.k.a. 100 up), where the score of bowl is proportional to the number of bowls you have closest to the jack, typically in a game where each player in a singles game has 4 bowls, the closest is worth 4 points, the next closest 3 points and so on.
put it in your pocket: an expression advising the last player on the mat to not deliver his bowl. It is called for if the player or team is holding shot, or that there is significant danger of changing the head to the detriment of the player/team if the bowl were the change the current situation.
Q
quick:
(bowl) if a bowl is delivered and finishes past the intended target, it is said to have been a "quick bowl".
(green) (a.k.a. fast green) a green is described as quick when the bowls travel at a faster further over the surface compared to a slow green relative to the same amount of effort required when delivering a bowl
R
raking: delivering an overweight bowl with the intent of disturbing the head. Often used as a derogatory term for players who are considered to have limited skills with imprecise bowling techniques, therefore often employing an overweight bowl with the hope of claiming the shot.
re-spot: if during play, the jack is out of bounds, some competitions have provision for placing the jack back within the confines of the rink on a predetermined place. The end then continues from that point with all other live bowls delivered remaining in place.
resting toucher: a bowl that remains in direct physical contact with the jack after being delivered.
riding: following a bowl after delivery down the green, often with visible expressions of hope, intent, or exasperation. It is considered poor etiquette to "ride" an opposition players bowl. See also chasing.
rings:
(bowl) bowls are manufactured with a set of rings on each side of the bowl. The smaller rings indicate the biased side of the bowl, and the outer rings the non biased side of the bowl.
(Stickers) in team based competitions, players on the same team will apply a unique ring shaped decal to both sides of the bowl so that they are easily distinguishable from the opposition's bowls. See also disc.
rink:
(playing area) the portion of the green which is in play for a particular game, usually marked with boundary pegs at either end of the green.
(team) in team based competitions, a group of players on the same team playing together as a unit can be described as "a rink".
roll up: (a.k.a. practice end) a warm up end, without scoring, to enable players to test their bowls in the conditions before a game starts.
rolling the jack: at the start of an end, the player in possession of the mat first rolls the jack along the rink or green to a preferred length, before delivering a bowl.
S
scope: a custom designed instrument, based on a telescope, used by umpires to determine if a jack or bowl is within the boundary (see boundary peg) of the rink during play. Often used in conjunction with a mirror when making judgements from one end of the rink to the other.
second: in a team of 3 or more, the player who delivers his bowl immediately after the lead is known as the second. The second has specific duties, including keeping score, updating the rink and overall scoreboards in a multi-rink team competition. In recent years, some associations have directed that the skip must keep the scorecard.
section: in pennant games, associations may create tiered competition made up of separate sections of teams. Often there are multiple sections to form part of a broader Division. Section winners then play against other section winners in that division to determine the overall division champion.
sectional play: a number of games where you play all other teams or players in a grouping, and the winner goes on to play other sectional winners. Group sizes will be variable, designed to ensure that the number of winners enable a play-off to reach a final of two section winners.
sets play: a game made up of 2 or more sets, with each set made up of a number of ends. World Bowls sets play format is two(2) sets of nine ends, with a 3 end tie break if drawn at 1 set all, but this can be varied by a local controlling body.
shaved: describes the result of a bowl delivered such that it touches the jack or another bowl without changing its current position.
short:
(bowl) a bowl that has stopped short of its intended target.
(end) describes a relative assessment of the length of the end in comparison with the maximum length end possible
(jack) a jack when delivered that stops at a point less than the minimum length allowed within the rules of competition for the game underway. Minimum lengths are varied by national associations as outlined in the crystal mark edition of the rules or World Bowls
shot: the bowl nearest the jack.
slow green: a green is described as slow when the bowls travel at a slower pace over the surface compared to a quick green relative to the amount of effort required when delivering a bowl.
side: a group of players that make up a team. In pennant play, a side will be made up of 12 to 16 players, divided up into groups of four, also known as a rink.
singles: a game played between two player.
skip: in a team of 3 or more, the player who delivers his bowl last is known as the skip. The skip has specific duties, including directing the headfor all other players in the team, and making decisions in co-operation with the opposition skip in the event of a dispute, and calling for an umpire if a dispute cannot be resolved within the teams.
smalls: a call made when determining which player will deliver the first bowl at the start of a game. One player will roll a bowl end over end, and calling "smalls" refers to the bowl stopping with the side where the smaller rings are facing upward. See also bigs.
spray chalk: used to indicate a bowl that has touched the jack as part of its initial delivery during an end. A player in charge of the head will use a pressurised can of chalk spray, to place a mark, which must be done before the next bowl comes to a rest, and must be removed before the bowl is delivered on the next end. See also chalk.
speed: a measurement, in seconds, of the time it takes for a bowl to come to a rest after being delivered by a player. See also timing the green.
spider: a one bowl competition where all participants are positioned at the edges of the green, and upon an agreed signal, all deliver a bowl towards a jack positioned in the centre of the green.
spot the jack: when the jack is rolled in a rink based game of bowls, if the bowl comes to rest beyond the 2 metre mark, but within the boundary of the rink, then it is moved to that mark, such that the front of the jack is aligned with the back of the mark.
stance: the position a player adopts in preparation for delivering the bowl. Some players adopt a fixed stance, where legs and feet are moved into position and then "locked", and the delivery is completed using upper body movement, whereas others will position their feet, then an action involving upper and lower body elements is commenced.
synthetic: see artificial.
T
table bowls: a game, designed to be played on a billiard/pool table, with miniaturised bowls, jack, and delivery ramp.
taking green: See line. If the resting place of a bowl is too wide, or particularly too narrow, to that intended, the director of the head may ask to "make sure you take your green", meaning adjust your line compared to your last bowl.
tape: a custom-designed tape measure used to judge the distance between the jack and one or more bowls at the conclusion of an end, which will determine the number of shots held by a player or team. A tape is used when a players measure is not long enough to reach the bowls in question. A longer tape is also used to measure if the jack has been delivered past the minimum length required.
Taylors: name of a Scotland-based bowls manufacturer.
testing: a service offered by bowls manufacturers to ensure bowls still meet manufacturer and World Bowls Ltd guidelines for the amount of bias that should be exhibited by the bowls. Some associations mandate bowls must be re-tested at a predetermined interval of years. In associations where testing is mandated, bowls that do not have a stamp indicating their status can be banned from use in competitions within that association.
testing table: a table used to check that a bowl or set of bowls conform to the bias requirements of the governing body of the sport, World Bowls. Manufacturers of bowls have testing tables, used both in the manufacturing process, and as a testing service to bowlers.
third: in a team of 4, the player who delivers his bowl after the lead and second have delivered their bowls is known as the third. The third has specific duties, including directing the head when it is the turn of the skip to deliver his bowls.
tickle the kitty: describes the result of a bowl delivered such that it moves the jack a slight distance from its current position.
tie break: at the end of a games scheduled number of ends, if the scores are level, a tie break end(s) will be played to determine a winner. In games where there is a set number of ends, one extra end is normally played. In sets play, a tie break, normally of three ends, is played if each player or side has won the same number of sets, after the designated number of sets have been played. An individual set does not have a tie break if the result is drawn at the end of that set.
tiff: a type of grass (also known as Titdwarf, a Bermuda grass hybrid) used for the construction of lawn bowls greens. Known for its turf quality, and ability to be mowed very low, well known in warmer climates, but increasingly hybrid varieties are being used in cool climate areas.
timing the green: in some competitions, an umpire will provide an indication of the speed of the green, by performing a test "timing of the green". It is determined either with a stop-watch, recording the result of the times of a number of bowls from the point of deliver to the point of coming to rest, or using a timing ramp. The result will be a time, in seconds, usually to 2 decimal places.
timing ramp: a custom designed piece of equipment that calculated the speed of the green. the ramp uses a ball, which is delivered down the ramp in several locations on the green, and a calculation table is then used to convert the results into a time, in seconds. The timing ramp tries to overcome the variances in manually timing a green using a stopwatch and delivery of a bowl by hand. See also timing the green
toss: a call made when determining which player or team will deliver the first bowl at the start of a game. One player will toss a coin end over end, and calling "heads" or "tails" refers to the coin stopping with the head or tail of the coin are facing upward.
toucher: a bowl that makes contact with the jack during its initial delivery.
trail: playing a bowl so that it moves the jack from its current position to a position further sideways or backwards along the rink.
triples: a team game where each team consists of three(3) players, a lead, second, and skip
trial end: (a.k.a. roll up) a warm up end, without scoring, to enable players to test their bowls in the conditions before a game starts..
U
umpire: An official nominated by the competition organiser to provide adjudication of the rules of competition, and to interpret the rules of bowls in the event of a dispute. Once an umpire is called, the decision of the umpire is final and binding on all players involved in the dispute.
unbiased: refers to a bowl or jack that has no bias. In most forms of the sport, the jack does not have a bias, and some indoor versions of the sport also have bowls with no bias. crown green Bowls have both a biased jack and bowl.
up: expression to confirm if you or your team have one or more bowls closest to the jack. If a marker is providing this information in a singles game, the marker can also indicate this status by holding a clenched fist upwards towards the sky.
V
W
walkover: where a player or team is unable to contest a pre-arranged game, either through non arrival, late arrival, or not having sufficient players to constitute a team, a win is awarded to the opposition. Rules governing walkovers are usually defined by the competition, and vary across county, state, national, and international competitions.
wedge: see chock.
weight:
(bowl) the physical weight of the bowl. See also heavy; xtra Heavy
(delivery) the relative effort required to ensure a bowl, when delivered, reaches its intended target.
wick: when a bowl is deflected during its progress after delivery. In most cases, this will be from contacting a bowl or jack. After the "wick", the direction of the bowl is altered away from its regular arc implied by the bias.
wide:
(bowl) if a bowl is delivered and finishes to the outer side of the intended target, it is said to have been a "wide bowl".
(hand) a comparative assessment between the two sides of a bowl rink, either side of the bowlcentre line. If due to prevailing weather or green conditions (usually wind) a bowler must aim his bowl further away from the target(jack, bowl or other position on the green), on a particular side of the rink, it is known as the "wide hand"
wood: alternative name for a bowl. Derived from the fact that bowls were once made using a dense hardwood, lignum vitae.
wrong bias: a bowl delivered where the biased side of the bowl has been placed opposite to the desired position for a given delivery. If a right handed player plays a forehand delivery, but has the biased side of the bowl on the right, the bowls bias will take an arc away from the intended target, and in most cases, outside the rink boundary. As well as becoming a dead bowl, the person delivering the bowl is sometimes subjected to gentle "ridicule". Clubs may also have a "house rule" with a penalty for a witnessed "wrong bias" such as a fine into a charity jar, or buying a drink for your opponents.
X
xtra Heavy: describes the physical weight of the bowl compared to other bowls of the same size. Most bowls manufacturers provide 3 different weights for each bowl size, standard; heavy; and xtra heavy.
Y
yard on: deliver the bowl with sufficient weight to finish 1 yard past the objective (usually the jack, or another bowl within the rink)
Z
References
Bowls
Bowls
Wikipedia glossaries using description lists |
Carbrook is an industrial area of Sheffield, South Yorkshire, England to the south-east of Brightside. The suburb is named for the Carr Brook, which ran through the area until the late eighteenth century.
Carbrook borders the former industrial village of Tinsley and has preserved a few older buildings such as the Sheffield Bus Museum, historic Carbrook Hall (formerly a public house of the same name, now a Starbucks outlet), the stone-built Carbrook School and steelworks Tinsley Wire. In 1868, the Brightside and Carbrook Co-operative Society was founded in the suburb, an important step in the development of the co-operative society in the region, later becoming the Sheffield Co-operative Society.
From the mid-1990s to date, Carbrook has been continually redeveloped with a number of well-known companies attracted to the convenient location within a mile of the M1 motorway at junction 34. These include Abbey National, Freemans Plc and many retail outlets to include prestige marques such as BMW and Lexus. It is also the name of the local tram stop and contains Meadowhall Retail Park, an out of town retail park not to be confused with Meadowhall Shopping Centre which lies further north.
The main through route 'Attercliffe Road / Sheffield Road' is almost unrecognisable from its pre 1980s design where it offered a mix of old steelworks houses and the last remaining small independent retailers trading from quaint but aged terrace house sized shop fronts. One such shop was known as 'Ronnies barbers', a long established traditional barber who worked well into his 80th year.
Carbrook now boasts a 20-screen cinema, retail park, Sheffield Arena and the Don Valley Stadium, a major music venue and sports facility.
Carbrook is served by three stops on the yellow line of the Sheffield Supertram, Carbrook, Valley Centertainment and Arena / Don Valley.
In September 2017 Sheffield Council announced plans to create a flood alleviation programme on the Carr Brook, and nearby Kirkbridge Dyke.
References
External links
Sources for the history of Carbrook Produced by Sheffield City Council's Libraries and Archives
Areas of Sheffield |
Woodley station may refer to:
Woodley railway station, Stockport, England
Woodley station (Los Angeles Metro), Los Angeles |
Helianthus carnosus is a rare North American species of sunflower known by the common name lakeside sunflower. It is found only in the northeastern part of the state of Florida in the United States.
Helianthus carnosus is a perennial herb up to 60 cm (2 feet) tall. Most of the leaves are close to the base of the stem, each leaf hairless, evergreen, up to 25 cm (10 inches) long. There are only a few small leaves on the stem, the only species in Florida with that characteristic. One plant usually produces only one flower head, rarely 2 or 3. Each head has with 12-17 yellow ray florets surrounding 100 or more yellow disc florets. The plant grows in wet sites in prairies in coastal beach sands at low elevations.
References
External links
Native Florida Wildflowers: photos of Helianthus carnosus
carnosus
Endemic flora of Florida
Plants described in 1902
Taxa named by John Kunkel Small
Flora without expected TNC conservation status |
The Bohemian Girl is a 1936 comedic feature film version of the opera The Bohemian Girl by Michael William Balfe. Directed by James W. Horne and Charles Rogers, and it was produced at the Hal Roach Studios, and stars Laurel and Hardy, and Thelma Todd in her final film role. This was also the only appearance of Darla Hood in a full-length feature produced by Hal Roach.
Plot
A group of gypsy caravans set up on the edge of a wood. They realise they are camped on the estate of Count Arnheim who will not tolerate their presence. The gypsies sing and dance to entertain themselves.
Stanley Laurel and Oliver Hardy are the misfit pair of Gypsies in the group. When hen-pecked Oliver is out pickpocketing, fortune-telling or attending his zither lessons, his wife (Mae Busch) has an affair with Devilshoof (Antonio Moreno). A cruel nobleman, Count Arnheim (William P. Carleton), persecutes the Gypsies, who are forced to flee, but Mrs Hardy, in revenge for Devilshoof being lashed by the count's orders, kidnaps his daughter, Arline (Darla Hood), and Mrs. Hardy fools Hardy into thinking she is their daughter since he believes everything she tells him. She soon elopes with Devilshoof, and leaves Oliver and "Uncle" Stanley holding the toddler. Arline is too young to remember her old life.
Twelve years later, the Gypsies return to Arnheim's estate. When grown-up Arline (Jacqueline Wells) accidentally trespasses in Arnheim's garden, she recognises the place and Arnheim's voice, but is arrested by a constable (Jimmy Finlayson) and sentenced to a lashing. Stan and Oliver try to save her, but Stan is too drunk and both are arrested. Just as Arline is stripped in order to be lashed, she is rescued in time by Arnheim, who recognises a medallion she wears and a family birthmark, and both try to rescue Stan and Oliver. It is too late though: Laurel and Hardy had already been worked over in the torture chamber: Hardy emerges stretched to a height of eight feet, while Stan has been crushed to only a few feet tall and the constable just stands yelling and moaning.
Cast
Stan Laurel as Stan
Oliver Hardy as Ollie
Jacqueline Wells as Arline
Darla Hood as Arline as a child
Mae Busch as Mrs. Hardy
Antonio Moreno as Devilshoof, Mrs. Hardy's lover
William P. Carleton as Count of Arnheim
James Finlayson as Finn, Captain of the Guard
Zeffie Tilbury as old Gypsy Queen
Mitchell Lewis as Salinas, Gypsy Queen's advisor
Harry Bowen as Laurel and Hardy's first victim (the drunkard)
Sam Lufkin as Laurel and Hardy's second victim (the innkeeper)
Eddie Borden as Laurel and Hardy's third victim (the nobleman)
James C. Morton as the officer who arrests the nobleman
Harry Bernard as bell ringer
Thelma Todd as singer of "Heart of a Gypsy"
Felix Knight as singer of "Then You'll Remember Me"
Winter Hall as Servant (uncredited)
Howard C. Hickman as Dignified Captain (uncredited)
Casting and production details
Metro-Goldwyn-Mayer wanted to cast a talented newcomer as Arline. Hal Roach cast Darla Hood, who had just begun appearing in Roach's Our Gang comedies, as young Arline and Julie Bishop as adult Arline.
Rosina Lawrence dubs Jacqueline Wells's singing.
Paulette Goddard has a small uncredited role as a Gypsy.
Stan Laurel's pet myna, Yogi, appears in the film.
The Count was played by W.P. Carleton, who had played the role on stage over a number of decades.
Ban in Malaysia and Germany
The film was banned in Malaysia due to its depictions of Roma themes. It was also banned in Nazi Germany due to its positive depiction of gypsies, which Joseph Goebbels, the minister of propaganda for the regime, said "had no place" in the Third Reich.
References
External links
1936 films
1936 musical comedy films
American musical comedy films
American black-and-white films
Films about child abduction
Films based on operas
Films based on works by Miguel de Cervantes
Films directed by Charley Rogers
Films directed by James W. Horne
Films set in the 18th century
Bohemia in fiction
Laurel and Hardy (film series)
Metro-Goldwyn-Mayer films
Operetta films
Films based on Spanish novels
Films about Romani people
Works based on La gitanilla
1930s American films |
```python
# coding: utf-8
import logging
import os
import sys
import time
import traceback
import numpy as np
import pytest
import ray
import ray.cluster_utils
import ray.exceptions
import ray.experimental.channel as ray_channel
from ray.exceptions import RayChannelError, RayChannelTimeoutError
from ray.util.scheduling_strategies import NodeAffinitySchedulingStrategy
from ray.dag.compiled_dag_node import CompiledDAG
from ray._private.test_utils import get_actor_node_id
logger = logging.getLogger(__name__)
def create_driver_actor():
return CompiledDAG.DAGDriverProxyActor.options(
scheduling_strategy=NodeAffinitySchedulingStrategy(
ray.get_runtime_context().get_node_id(), soft=False
)
).remote()
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_put_local_get(ray_start_regular):
driver_actor = create_driver_actor()
chan = ray_channel.Channel(
None,
[
(driver_actor, get_actor_node_id(driver_actor)),
],
1000,
)
num_writes = 1000
for i in range(num_writes):
val = i.to_bytes(8, "little")
chan.write(val)
assert chan.read() == val
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_read_timeout(ray_start_regular):
driver_actor = create_driver_actor()
chan = ray_channel.Channel(
None,
[
(driver_actor, get_actor_node_id(driver_actor)),
],
1000,
)
with pytest.raises(RayChannelTimeoutError):
chan.read(timeout=1)
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_write_timeout(ray_start_regular):
driver_actor = create_driver_actor()
chan = ray_channel.Channel(
None,
[
(driver_actor, get_actor_node_id(driver_actor)),
],
1000,
)
val = 1
bytes = val.to_bytes(8, "little")
chan.write(bytes, timeout=1)
with pytest.raises(RayChannelTimeoutError):
chan.write(bytes, timeout=1)
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
@pytest.mark.parametrize("remote", [True, False])
def test_driver_as_reader(ray_start_cluster, remote):
cluster = ray_start_cluster
if remote:
# This node is for the driver. num_cpus is 1 because the
# CompiledDAG.DAGDriverProxyActor needs a place to run.
cluster.add_node(num_cpus=1)
ray.init(address=cluster.address)
# This node is for the writer actor.
cluster.add_node(num_cpus=1)
else:
# This node is for both the driver (including the
# CompiledDAG.DAGDriverProxyActor) and the writer actor.
cluster.add_node(num_cpus=2)
ray.init(address=cluster.address)
@ray.remote(num_cpus=1)
class Actor:
def setup(self, driver_actor):
self._channel = ray_channel.Channel(
ray.get_runtime_context().current_actor,
[(driver_actor, get_actor_node_id(driver_actor))],
1000,
)
def get_channel(self):
return self._channel
def write(self):
self._channel.write(b"x")
a = Actor.remote()
ray.get(a.setup.remote(create_driver_actor()))
chan = ray.get(a.get_channel.remote())
ray.get(a.write.remote())
assert chan.read() == b"x"
@pytest.mark.parametrize("remote", [True, False])
def test_driver_as_reader_with_resize(ray_start_cluster, remote):
cluster = ray_start_cluster
if remote:
# This node is for the driver. num_cpus is 1 because the
# CompiledDAG.DAGDriverProxyActor needs a place to run.
cluster.add_node(num_cpus=1)
ray.init(address=cluster.address)
# This node is for the writer actor.
cluster.add_node(num_cpus=1)
else:
# This node is for both the driver (including the
# CompiledDAG.DAGDriverProxyActor) and the writer actor.
cluster.add_node(num_cpus=2)
ray.init(address=cluster.address)
@ray.remote(num_cpus=1)
class Actor:
def setup(self, driver_actor):
self._channel = ray_channel.Channel(
ray.get_runtime_context().current_actor,
[(driver_actor, get_actor_node_id(driver_actor))],
1000,
)
def get_channel(self):
return self._channel
def write(self):
self._channel.write(b"x")
def write_large(self):
self._channel.write(b"x" * 2000)
a = Actor.remote()
ray.get(a.setup.remote(create_driver_actor()))
chan = ray.get(a.get_channel.remote())
ray.get(a.write.remote())
assert chan.read() == b"x"
ray.get(a.write_large.remote())
assert chan.read() == b"x" * 2000
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_set_error_before_read(ray_start_regular):
"""
Tests that if a channel is closed after a reader, a subsequent read does not block
forever.
"""
@ray.remote
class Actor:
def __init__(self):
self.arr = None
def create_channel(self, writer, reader_and_node_list):
self._channel = ray_channel.Channel(writer, reader_and_node_list, 1000)
return self._channel
def pass_channel(self, channel):
self._channel = channel
def close(self):
self._channel.close()
def write(self, arr):
self._channel.write(arr)
def read(self):
self.arr = self._channel.read()
# Keep self.arr in scope. While self.arr is in scope, its backing
# shared_ptr<MutableObjectBuffer> in C++ will also stay in scope.
# Under normal execution, this will block the next read() from
# returning, since we are still using the shared buffer.
# In this test we are checking that if the channel is closed, then
# the next read() will return an error immediately instead of
# blocking, even though we still have self.arr in scope.
return self.arr
for _ in range(10):
a = Actor.remote()
b = Actor.remote()
node_b = get_actor_node_id(b)
chan = ray.get(a.create_channel.remote(a, [(b, node_b)]))
ray.get(b.pass_channel.remote(chan))
# Use numpy to enable zero-copy deserialization.
arr = np.random.rand(100)
ray.get(a.write.remote(arr))
assert (arr == ray.get(b.read.remote())).all()
# Check that the thread does not block on the second call to read() below.
# read() acquires a lock, though if the lock is not released when
# read() fails (because the channel has been closed), then an additional
# call to read() *could* block.
# We wrap both calls to read() in pytest.raises() as both calls could
# trigger an RayChannelError exception if the channel has already been closed.
with pytest.raises(
ray.exceptions.RayTaskError, match=r"Channel closed"
) as exc_info:
ray.get([a.close.remote(), b.read.remote()])
assert isinstance(exc_info.value.as_instanceof_cause(), RayChannelError)
with pytest.raises(ray.exceptions.RayTaskError) as exc_info:
ray.get(b.read.remote())
assert isinstance(exc_info.value.as_instanceof_cause(), RayChannelError)
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_errors(ray_start_regular):
"""
Tests that an exception is thrown when there are more readers than specificed in the
channel constructor.
"""
@ray.remote
class Actor:
def make_chan(self, readers, do_write=True):
self.chan = ray_channel.Channel(
ray.get_runtime_context().current_actor, readers, 1000
)
if do_write:
self.chan.write(b"hello")
return self.chan
a = Actor.remote()
# Multiple consecutive reads from the same process are fine.
driver_actor = create_driver_actor()
chan = ray.get(
a.make_chan.remote(
[(driver_actor, get_actor_node_id(driver_actor))], do_write=True
)
)
assert chan.read() == b"hello"
@ray.remote
class Reader:
def __init__(self):
pass
def read(self, chan):
return chan.read()
readers = [Reader.remote(), Reader.remote()]
# Check that an exception is thrown when there are more readers than specificed in
# the channel constructor.
chan = ray.get(
a.make_chan.remote([(readers[0], get_actor_node_id(readers[0]))], do_write=True)
)
# At least 1 reader.
with pytest.raises(ray.exceptions.RayTaskError) as exc_info:
ray.get([reader.read.remote(chan) for reader in readers])
assert "ray.exceptions.RaySystemError" in str(exc_info.value)
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_put_different_meta(ray_start_regular):
driver_actor = create_driver_actor()
chan = ray_channel.Channel(
None, [(driver_actor, get_actor_node_id(driver_actor))], 1000
)
def _test(val):
chan.write(val)
read_val = chan.read()
if isinstance(val, np.ndarray):
assert np.array_equal(read_val, val)
else:
assert read_val == val
_test(b"hello")
_test("hello")
_test(1000)
_test(np.random.rand(10))
def test_multiple_channels_different_nodes(ray_start_cluster):
"""
Tests that multiple channels can be used at the same time between two nodes.
"""
cluster = ray_start_cluster
# This node is for the driver.
cluster.add_node(num_cpus=0)
ray.init(address=cluster.address)
# This node is for the Reader actors.
cluster.add_node(num_cpus=1)
@ray.remote(num_cpus=1)
class Actor:
def read(self, channel, val):
read_val = channel.read()
if isinstance(val, np.ndarray):
assert np.array_equal(read_val, val)
else:
assert read_val == val
a = Actor.remote()
node_a = get_actor_node_id(a)
chan_a = ray_channel.Channel(None, [(a, node_a)], 1000)
chan_b = ray_channel.Channel(None, [(a, node_a)], 1000)
channels = [chan_a, chan_b]
val = np.random.rand(5)
for i in range(10):
for channel in channels:
channel.write(val)
for channel in channels:
ray.get(a.read.remote(channel, val))
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_resize_channel_on_same_node(ray_start_regular):
"""
Tests that the channel backing store is automatically increased when a large object
is written to it. The writer and reader are on the same node.
"""
driver_actor = create_driver_actor()
chan = ray_channel.Channel(
None, [(driver_actor, get_actor_node_id(driver_actor))], 1000
)
def _test(val):
chan.write(val)
read_val = chan.read()
if isinstance(val, np.ndarray):
assert np.array_equal(read_val, val)
else:
assert read_val == val
# `np.random.rand(100)` requires more than 1000 bytes of storage. The channel is
# allocated above with a backing store size of 1000 bytes.
_test(np.random.rand(100))
# Check that another write still works.
_test(np.random.rand(5))
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_resize_channel_on_same_node_with_actor(ray_start_regular):
"""
Tests that the channel backing store is automatically increased when a large object
is written to it. The writer and reader are on the same node, and the reader is an
actor.
"""
@ray.remote
class Actor:
def __init__(self):
pass
def read(self, channel, val):
read_val = channel.read()
if isinstance(val, np.ndarray):
assert np.array_equal(read_val, val)
else:
assert read_val == val
def _test(channel, actor, val):
channel.write(val)
ray.get(actor.read.remote(channel, val))
a = Actor.remote()
node_a = get_actor_node_id(a)
chan = ray_channel.Channel(None, [(a, node_a)], 1000)
# `np.random.rand(100)` requires more than 1000 bytes of storage. The channel is
# allocated above with a backing store size of 1000 bytes.
_test(chan, a, np.random.rand(100))
# Check that another write still works.
_test(chan, a, np.random.rand(5))
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_resize_channel_on_different_nodes(ray_start_cluster):
"""
Tests that the channel backing store is automatically increased when a large object
is written to it. The writer and reader are on different nodes, and the reader is an
actor.
"""
cluster = ray_start_cluster
# This node is for the driver.
cluster.add_node(num_cpus=0)
ray.init(address=cluster.address)
# This node is for the Reader actors.
cluster.add_node(num_cpus=1)
@ray.remote(num_cpus=1)
class Actor:
def __init__(self):
pass
def read(self, channel, val):
read_val = channel.read()
if isinstance(val, np.ndarray):
assert np.array_equal(read_val, val)
else:
assert read_val == val
def _test(channel, actor, val):
channel.write(val)
ray.get(actor.read.remote(channel, val))
a = Actor.remote()
node_a = get_actor_node_id(a)
chan = ray_channel.Channel(None, [(a, node_a)], 1000)
# `np.random.rand(100)` requires more than 1000 bytes of storage. The channel is
# allocated above with a backing store size of 1000 bytes.
_test(chan, a, np.random.rand(100))
# Check that another write still works.
_test(chan, a, np.random.rand(5))
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
@pytest.mark.parametrize("num_readers", [1, 4])
def test_put_remote_get(ray_start_regular, num_readers):
"""
Tests that an actor can read objects/primitives of various types through a channel
when the reader is spawned with @ray.remote.
"""
@ray.remote(num_cpus=0)
class Reader:
def __init__(self):
pass
def read(self, chan, num_writes):
for i in range(num_writes):
val = i.to_bytes(8, "little")
assert chan.read() == val
for i in range(num_writes):
val = i.to_bytes(100, "little")
assert chan.read() == val
for val in [
b"hello world",
"hello again",
1000,
]:
assert chan.read() == val
num_writes = 1000
reader_and_node_list = []
for _ in range(num_readers):
handle = Reader.remote()
node = get_actor_node_id(handle)
reader_and_node_list.append((handle, node))
chan = ray_channel.Channel(None, reader_and_node_list, 1000)
chan.ensure_registered_as_writer()
done = [reader.read.remote(chan, num_writes) for reader, _ in reader_and_node_list]
for i in range(num_writes):
val = i.to_bytes(8, "little")
chan.write(val)
# Test different data size.
for i in range(num_writes):
val = i.to_bytes(100, "little")
chan.write(val)
# Test different metadata.
for val in [
b"hello world",
"hello again",
1000,
]:
chan.write(val)
ray.get(done)
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
@pytest.mark.parametrize("remote", [True, False])
def test_remote_reader(ray_start_cluster, remote):
"""
Tests that an actor can read objects/primitives of various types through a channel
when the reader and writer are on the (1) same node (remote=False) along with (2)
different nodes (remote=True).
"""
num_readers = 10
num_writes = 1000
num_iterations = 3
cluster = ray_start_cluster
if remote:
# This node is for the driver.
cluster.add_node(num_cpus=0)
ray.init(address=cluster.address)
# This node is for the Reader actors.
cluster.add_node(num_cpus=num_readers)
else:
# This node is for both the driver and the Reader actors.
cluster.add_node(num_cpus=num_readers)
ray.init(address=cluster.address)
@ray.remote(num_cpus=1)
class Reader:
def __init__(self):
pass
def get_node_id(self) -> str:
return ray.get_runtime_context().get_node_id()
def pass_channel(self, channel):
self._reader_chan = channel
def read(self, num_reads):
for i in range(num_reads):
self._reader_chan.read()
reader_and_node_list = []
for _ in range(num_readers):
handle = Reader.remote()
node = get_actor_node_id(handle)
reader_and_node_list.append((handle, node))
channel = ray_channel.Channel(None, reader_and_node_list, 1000)
# All readers have received the channel.
ray.get([reader.pass_channel.remote(channel) for reader, _ in reader_and_node_list])
for _ in range(num_iterations):
work = [reader.read.remote(num_writes) for reader, _ in reader_and_node_list]
start = time.perf_counter()
for i in range(num_writes):
channel.write(b"x")
end = time.perf_counter()
ray.get(work)
print(end - start, 10_000 / (end - start))
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
@pytest.mark.parametrize("remote", [True, False])
def test_remote_reader_close(ray_start_cluster, remote):
"""
Tests that readers do not block forever on read() when they close the channel.
Specifically, the following behavior should happen:
1. Each reader calls read() on one channel.
2. Each reader calls close() on the channel on a different thread.
3. Each reader should unblock and return from read().
Tests (1) the readers and writer on the same node (remote=False) along with
different nodes (remote=True).
"""
num_readers = 10
cluster = ray_start_cluster
if remote:
# This node is for the driver.
cluster.add_node(num_cpus=0)
ray.init(address=cluster.address)
# This node is for the Reader actors.
cluster.add_node(num_cpus=num_readers)
else:
# This node is for both the driver and the Reader actors.
cluster.add_node(num_cpus=num_readers)
ray.init(address=cluster.address)
@ray.remote(num_cpus=1)
class Reader:
def __init__(self):
pass
def get_node_id(self) -> str:
return ray.get_runtime_context().get_node_id()
def pass_channel(self, channel):
self._reader_chan = channel
def read(self):
try:
self._reader_chan.read()
except RayChannelError:
pass
def close(self):
self._reader_chan.close()
reader_and_node_list = []
for _ in range(num_readers):
handle = Reader.remote()
node = get_actor_node_id(handle)
reader_and_node_list.append((handle, node))
channel = ray_channel.Channel(None, reader_and_node_list, 1000)
# All readers have received the channel.
ray.get([reader.pass_channel.remote(channel) for reader, _ in reader_and_node_list])
reads = [
reader.read.options(concurrency_group="_ray_system").remote()
for reader, _ in reader_and_node_list
]
with pytest.raises(ray.exceptions.GetTimeoutError):
ray.get(reads, timeout=1.0)
ray.get([reader.close.remote() for reader, _ in reader_and_node_list])
ray.get(reads)
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_intra_process_channel_single_reader(ray_start_cluster):
"""
(1) Test whether an actor can read/write from an IntraProcessChannel.
(2) Test whether the _SerializationContext cleans up the
data after all readers have read it.
(3) Test whether the actor can write again after reading 1 time.
"""
# This node is for both the driver and the Reader actors.
cluster = ray_start_cluster
cluster.add_node(num_cpus=1)
ray.init(address=cluster.address)
@ray.remote(num_cpus=1)
class Actor:
def __init__(self):
pass
def pass_channel(self, channel):
self._chan = channel
def read(self):
return self._chan.read()
def write(self, value):
self._chan.write(value)
def get_ctx_buffer_size(self):
ctx = ray_channel.ChannelContext.get_current().serialization_context
return len(ctx.intra_process_channel_buffers)
actor = Actor.remote()
channel = ray_channel.IntraProcessChannel(num_readers=1)
ray.get(actor.pass_channel.remote(channel))
ray.get(actor.write.remote("hello"))
assert ray.get(actor.read.remote()) == "hello"
# The _SerializationContext should clean up the data after a read.
assert ray.get(actor.get_ctx_buffer_size.remote()) == 0
# Write again after reading num_readers times.
ray.get(actor.write.remote("world"))
assert ray.get(actor.read.remote()) == "world"
# The _SerializationContext should clean up the data after a read.
assert ray.get(actor.get_ctx_buffer_size.remote()) == 0
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_intra_process_channel_multi_readers(ray_start_cluster):
"""
(1) Test whether an actor can read/write from an IntraProcessChannel.
(2) Test whether the _SerializationContext cleans up the
data after all readers have read it.
(3) Test whether the actor can write again after reading num_readers times.
(4) Test whether an exception is raised when calling write() before all readers
have read the data.
"""
# This node is for both the driver and the Reader actors.
cluster = ray_start_cluster
cluster.add_node(num_cpus=1)
ray.init(address=cluster.address)
@ray.remote(num_cpus=1)
class Actor:
def __init__(self):
pass
def pass_channel(self, channel):
self._chan = channel
def read(self):
return self._chan.read()
def write(self, value):
self._chan.write(value)
def get_ctx_buffer_size(self):
ctx = ray_channel.ChannelContext.get_current().serialization_context
return len(ctx.intra_process_channel_buffers)
actor = Actor.remote()
channel = ray_channel.IntraProcessChannel(num_readers=2)
ray.get(actor.pass_channel.remote(channel))
ray.get(actor.write.remote("hello"))
# first read
assert ray.get(actor.read.remote()) == "hello"
assert ray.get(actor.get_ctx_buffer_size.remote()) == 1
# second read
assert ray.get(actor.read.remote()) == "hello"
assert ray.get(actor.get_ctx_buffer_size.remote()) == 0
# Write again after reading num_readers times.
ray.get(actor.write.remote("world"))
# first read
assert ray.get(actor.read.remote()) == "world"
assert ray.get(actor.get_ctx_buffer_size.remote()) == 1
# second read
assert ray.get(actor.read.remote()) == "world"
assert ray.get(actor.get_ctx_buffer_size.remote()) == 0
# Write again
ray.get(actor.write.remote("hello world"))
# first read
assert ray.get(actor.read.remote()) == "hello world"
assert ray.get(actor.get_ctx_buffer_size.remote()) == 1
with pytest.raises(ray.exceptions.RayTaskError):
ray.get(actor.write.remote("world hello"))
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_composite_channel_single_reader(ray_start_cluster):
"""
(1) The driver can write data to CompositeChannel and an actor can read it.
(2) An actor can write data to CompositeChannel and the actor itself can read it.
(3) An actor can write data to CompositeChannel and another actor can read it.
(4) An actor can write data to CompositeChannel and the driver can read it.
"""
# This node is for both the driver and the Reader actors.
cluster = ray_start_cluster
cluster.add_node(num_cpus=2)
ray.init(address=cluster.address)
@ray.remote(num_cpus=1)
class Actor:
def __init__(self):
pass
def pass_channel(self, channel):
self._chan = channel
def create_composite_channel(self, writer, reader_and_node_list):
self._chan = ray_channel.CompositeChannel(writer, reader_and_node_list)
return self._chan
def read(self):
return self._chan.read()
def write(self, value):
self._chan.write(value)
actor1 = Actor.remote()
actor2 = Actor.remote()
node1 = get_actor_node_id(actor1)
node2 = get_actor_node_id(actor2)
# Create a channel to communicate between driver process and actor1.
driver_to_actor1_channel = ray_channel.CompositeChannel(None, [(actor1, node1)])
ray.get(actor1.pass_channel.remote(driver_to_actor1_channel))
driver_to_actor1_channel.write("hello")
assert ray.get(actor1.read.remote()) == "hello"
# Create a channel to communicate between two tasks in actor1.
ray.get(actor1.create_composite_channel.remote(actor1, [(actor1, node1)]))
ray.get(actor1.write.remote("world"))
assert ray.get(actor1.read.remote()) == "world"
# Create a channel to communicate between actor1 and actor2.
actor1_to_actor2_channel = ray.get(
actor1.create_composite_channel.remote(actor1, [(actor2, node2)])
)
ray.get(actor2.pass_channel.remote(actor1_to_actor2_channel))
ray.get(actor1.write.remote("hello world"))
assert ray.get(actor2.read.remote()) == "hello world"
# Create a channel to communicate between actor2 and driver process.
driver_actor = create_driver_actor()
actor2_to_driver_channel = ray.get(
actor2.create_composite_channel.remote(
actor2, [(driver_actor, get_actor_node_id(driver_actor))]
)
)
ray.get(actor2.write.remote("world hello"))
assert actor2_to_driver_channel.read() == "world hello"
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_composite_channel_multiple_readers(ray_start_cluster):
"""
Test the behavior of CompositeChannel when there are multiple readers.
(1) The driver can write data to CompositeChannel and two actors can read it.
(2) An actor can write data to CompositeChannel and another actor, as well as
itself, can read it.
(3) An actor writes data to CompositeChannel and two Ray tasks on the same
actor read it. This is not supported and should raise an exception.
"""
# This node is for both the driver and the Reader actors.
cluster = ray_start_cluster
cluster.add_node(num_cpus=2)
ray.init(address=cluster.address)
@ray.remote(num_cpus=1)
class Actor:
def __init__(self):
pass
def pass_channel(self, channel):
self._chan = channel
def create_composite_channel(self, writer, reader_and_node_list):
self._chan = ray_channel.CompositeChannel(writer, reader_and_node_list)
return self._chan
def read(self):
return self._chan.read()
def write(self, value):
self._chan.write(value)
actor1 = Actor.remote()
actor2 = Actor.remote()
node1 = get_actor_node_id(actor1)
node2 = get_actor_node_id(actor2)
# The driver writes data to CompositeChannel and actor1 and actor2 read it.
driver_output_channel = ray_channel.CompositeChannel(
None, [(actor1, node1), (actor2, node2)]
)
ray.get(actor1.pass_channel.remote(driver_output_channel))
ray.get(actor2.pass_channel.remote(driver_output_channel))
driver_output_channel.write("hello")
assert ray.get([actor1.read.remote(), actor2.read.remote()]) == ["hello"] * 2
# actor1 writes data to CompositeChannel and actor1 and actor2 read it.
actor1_output_channel = ray.get(
actor1.create_composite_channel.remote(
actor1, [(actor1, node1), (actor2, node2)]
)
)
ray.get(actor2.pass_channel.remote(actor1_output_channel))
ray.get(actor1.write.remote("world"))
assert ray.get([actor1.read.remote(), actor2.read.remote()]) == ["world"] * 2
actor1_output_channel = ray.get(
actor1.create_composite_channel.remote(
actor1, [(actor1, node1), (actor1, node1)]
)
)
ray.get(actor1.write.remote("hello world"))
assert ray.get(actor1.read.remote()) == "hello world"
assert ray.get(actor1.read.remote()) == "hello world"
with pytest.raises(ray.exceptions.RayTaskError):
# actor1_output_channel has two readers, so it can only be read twice.
# The third read should raise an exception.
ray.get(actor1.read.remote())
"""
TODO (kevin85421): Add tests for the following cases:
(1) actor1 writes data to CompositeChannel and two Ray tasks on actor2 read it.
(2) actor1 writes data to CompositeChannel and actor2 and the driver reads it.
Currently, (1) is not supported, and (2) is blocked by the reference count issue.
"""
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_put_error(ray_start_cluster):
cluster = ray_start_cluster
# This node is for both the driver (including the CompiledDAG.DAGDriverProxyActor)
# and the writer actor.
cluster.add_node(num_cpus=2)
ray.init(address=cluster.address)
def _wrap_exception(exc):
backtrace = ray._private.utils.format_error_message(
"".join(traceback.format_exception(type(exc), exc, exc.__traceback__)),
task_exception=True,
)
wrapped = ray.exceptions.RayTaskError(
function_name="do_exec_tasks",
traceback_str=backtrace,
cause=exc,
)
return wrapped
@ray.remote(num_cpus=1)
class Actor:
def setup(self, reader_and_node_list):
self._channel = ray_channel.Channel(
ray.get_runtime_context().current_actor,
reader_and_node_list,
1000,
)
def get_channel(self):
return self._channel
def write(self, write_error):
if write_error:
try:
raise ValueError("")
except Exception as exc:
self._channel.write(_wrap_exception(exc))
else:
self._channel.write(b"x")
a = Actor.remote()
driver_actor = create_driver_actor()
ray.get(a.setup.remote([(driver_actor, get_actor_node_id(driver_actor))]))
chan = ray.get(a.get_channel.remote())
# Putting a bytes object multiple times is okay.
for _ in range(3):
ray.get(a.write.remote(write_error=False))
assert chan.read() == b"x"
# Putting an exception multiple times is okay.
for _ in range(3):
ray.get(a.write.remote(write_error=True))
try:
assert chan.read()
except Exception as exc:
assert isinstance(exc, ValueError)
assert isinstance(exc, ray.exceptions.RayTaskError)
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_payload_large(ray_start_cluster):
cluster = ray_start_cluster
# This node is for the driver.
first_node_handle = cluster.add_node(num_cpus=1)
# This node is for the reader.
second_node_handle = cluster.add_node(num_cpus=1)
ray.init(address=cluster.address)
cluster.wait_for_nodes()
nodes = [first_node_handle.node_id, second_node_handle.node_id]
# We want to check that there are two nodes. Thus, we convert `nodes` to a set and
# then back to a list to remove duplicates. Then we check that the length of `nodes`
# is 2.
nodes = list(set(nodes))
assert len(nodes) == 2
@ray.remote(num_cpus=1)
class Actor:
def get_node_id(self):
return ray.get_runtime_context().get_node_id()
def read(self, channel, val):
assert channel.read() == val
def create_actor(node):
return Actor.options(
scheduling_strategy=NodeAffinitySchedulingStrategy(node, soft=False)
).remote()
driver_node = ray.get_runtime_context().get_node_id()
actor_node = nodes[0] if nodes[0] != driver_node else nodes[1]
assert driver_node != actor_node
a = create_actor(actor_node)
node_a = ray.get(a.get_node_id.remote())
assert driver_node != ray.get(a.get_node_id.remote())
# Ray sets the gRPC payload max size to 512 MiB. We choose a size in this test that
# is a bit larger.
size = 1024 * 1024 * 600
ch = ray_channel.Channel(None, [(a, node_a)], size)
val = b"x" * size
ch.write(val)
ray.get(a.read.remote(ch, val))
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_payload_resize_large(ray_start_cluster):
cluster = ray_start_cluster
# This node is for the driver.
first_node_handle = cluster.add_node(num_cpus=1)
# This node is for the reader.
second_node_handle = cluster.add_node(num_cpus=1)
ray.init(address=cluster.address)
cluster.wait_for_nodes()
nodes = [first_node_handle.node_id, second_node_handle.node_id]
# We want to check that there are two nodes. Thus, we convert `nodes` to a set and
# then back to a list to remove duplicates. Then we check that the length of `nodes`
# is 2.
nodes = list(set(nodes))
assert len(nodes) == 2
@ray.remote(num_cpus=1)
class Actor:
def get_node_id(self):
return ray.get_runtime_context().get_node_id()
def read(self, channel, val):
assert channel.read() == val
def create_actor(node):
return Actor.options(
scheduling_strategy=NodeAffinitySchedulingStrategy(node, soft=False)
).remote()
driver_node = ray.get_runtime_context().get_node_id()
actor_node = nodes[0] if nodes[0] != driver_node else nodes[1]
assert driver_node != actor_node
a = create_actor(actor_node)
assert driver_node != ray.get(a.get_node_id.remote())
ch = ray_channel.Channel(None, [(a, actor_node)], 1000)
# Ray sets the gRPC payload max size to 512 MiB. We choose a size in this test that
# is a bit larger.
size = 1024 * 1024 * 600
val = b"x" * size
ch.write(val)
ray.get(a.read.remote(ch, val))
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_readers_on_different_nodes(ray_start_cluster):
cluster = ray_start_cluster
# This node is for the driver (including the CompiledDAG.DAGDriverProxyActor) and
# one of the readers.
first_node_handle = cluster.add_node(num_cpus=2)
# This node is for the other reader.
second_node_handle = cluster.add_node(num_cpus=1)
ray.init(address=cluster.address)
cluster.wait_for_nodes()
nodes = [first_node_handle.node_id, second_node_handle.node_id]
# We want to check that there are two nodes. Thus, we convert `nodes` to a set and
# then back to a list to remove duplicates. Then we check that the length of `nodes`
# is 2.
nodes = list(set(nodes))
assert len(nodes) == 2
@ray.remote(num_cpus=1)
class Actor:
def get_node_id(self):
return ray.get_runtime_context().get_node_id()
def create_actor(node):
return Actor.options(
scheduling_strategy=NodeAffinitySchedulingStrategy(node, soft=False)
).remote()
a = create_actor(nodes[0])
b = create_actor(nodes[1])
actors = [a, b]
nodes_check = ray.get([act.get_node_id.remote() for act in actors])
a_node = nodes_check[0]
b_node = nodes_check[1]
assert a_node != b_node
driver_actor = create_driver_actor()
driver_node = get_actor_node_id(driver_actor)
with pytest.raises(
ValueError, match="All reader actors must be on the same node.*"
):
ray_channel.Channel(
None, [(driver_actor, driver_node), (a, a_node), (b, b_node)], 1000
)
@pytest.mark.skipif(
sys.platform != "linux" and sys.platform != "darwin",
reason="Requires Linux or Mac.",
)
def test_bunch_readers_on_different_nodes(ray_start_cluster):
cluster = ray_start_cluster
# This node is for the driver (including the DriverHelperActor) and two of the
# readers.
first_node_handle = cluster.add_node(num_cpus=3)
# This node is for the other two readers.
second_node_handle = cluster.add_node(num_cpus=2)
ray.init(address=cluster.address)
cluster.wait_for_nodes()
nodes = [first_node_handle.node_id, second_node_handle.node_id]
# We want to check that the readers are on different nodes. Thus, we convert `nodes`
# to a set and then back to a list to remove duplicates. Then we check that the
# length of `nodes` is 2.
nodes = list(set(nodes))
assert len(nodes) == 2
@ray.remote(num_cpus=1)
class Actor:
def get_node_id(self):
return ray.get_runtime_context().get_node_id()
def create_actor(node):
return Actor.options(
scheduling_strategy=NodeAffinitySchedulingStrategy(node, soft=False)
).remote()
a = create_actor(nodes[0])
b = create_actor(nodes[0])
c = create_actor(nodes[1])
d = create_actor(nodes[1])
actors = [a, b, c, d]
nodes_check = ray.get([act.get_node_id.remote() for act in actors])
a_node = nodes_check[0]
b_node = nodes_check[1]
c_node = nodes_check[2]
d_node = nodes_check[3]
assert a_node == b_node
assert b_node != c_node
assert c_node == d_node
driver_actor = create_driver_actor()
driver_node = get_actor_node_id(driver_actor)
with pytest.raises(
ValueError, match="All reader actors must be on the same node.*"
):
ray_channel.Channel(
None,
[
(driver_actor, driver_node),
(a, a_node),
(b, b_node),
(c, c_node),
(d, d_node),
],
1000,
)
if __name__ == "__main__":
if os.environ.get("PARALLEL_CI"):
sys.exit(pytest.main(["-n", "auto", "--boxed", "-vs", __file__]))
else:
sys.exit(pytest.main(["-sv", __file__]))
``` |
"King Leer" is the sixteenth episode of the twenty-ninth season of the American animated television series The Simpsons, and the 634th episode of the series overall. The episode was directed by Chris Clements and written by Daniel Furlong and Zach Posner. It aired in the United States on Fox on April 15, 2018.
Plot
At school, Bart has to choose a new musical instrument. Bart learns from the music teacher that if he breaks it, Homer will have to pay for it. Bart begins to taunt Homer with the threat of breaking his violin. Homer saves it one more time, only to break his beer mug, go berserk and smash the violin.
Homer then goes to Moe's Tavern for a drink. Moe receives a phone call, rages at the caller, and angrily chases the customers out of the bar. Homer and Marge discover Moe leaving and follow him. They discover Moe fighting with his father, Morty Szyslak. Marge and Homer attempt to reunite the family by inviting Moe, his brother Marv, his sister Minnie, and his father over for dinner.
Before dinner, it is revealed that at one time Moe's family sold mattresses. Moe screwed it up when his father told him to sabotage their rival's store. Moe refused, and was tricked by the rival store, who sabotaged his family's stores with bed bugs, ultimately leaving them with three locations.
At dinner, things are tense between Moe and his family members, so Marge and Homer bring a television into the dining room to show the Szyslayks the good times they had together. After seeing themselves together in a mattress commercial with a Christmas theme, they reconcile. Morty gives keys to his stores to Marv, Minnie, and finally Moe.
Springfield's residents gather at Moe's store, where Moe shows them a mattress ad he made with his siblings. He soon realizes that his brother and sister's intent was to sabotage him and make his store look bad by saying that people have died on his mattresses, including fat people and prisoners.
The siblings begin to sabotage each other. Moe pops the tube man in front of one of their stores. Marv and Minnie retaliate by controlling the up and down button outside of the store, constantly torturing Hans Moleman as he is trying out a mattress. Moe then floods their store, flushing out the customers inside. Marv and Moe get into a sword fight using signs. Marv finally throws a sign at Moe before taking off.
Marge goes to tell Morty that his children are fighting with each other, and she needs his help. At first he refuses, but Marge persuades him.
Marge, Homer, and Morty arrive to see Moe announce that he will destroy his brother and sister's mattresses, and they can't destroy his, because his are in a secret place, which turns out to be the bar. Marge tells him that some families don't belong together. He accidentally breaks a jar of bugs and everyone flees the building, scratching themselves.
Production
This is the first episode written by Daniel Furlong and Zach Posner. Furlong reached out of fellow Oneida County native and executive producer John Frink for a job and was eventually promoted to writer's assistant on the show. Executive producer Matt Selman had a idea for an episode about Moe and offered Furlong and his writing partner Posner the job to develop the script. It was then handed over to the writer's room for refinement. Furlong added some references from where he grew up such as Utica Wild Thighs being a parody of Buffalo Wild Wings. Selman described the episode as a Shakespearean drama about a mattress store empire.
In February 2018, Entertainment Weekly reported that Ray Liotta was cast as Moe's father, Morty, who is a cunning evil version of Moe. Liotta stated that the experience was fun, and he was able to reunite with producer David Mirkin, who directed Liotta in the 2001 film Heartbreakers. Debi Mazar was cast as Moe's sister Minnie.
Cultural references
The credit scene is a recreation of the Mattress Man commercial from the 2002 film Punch-Drunk Love.
Reception
Dennis Perkins of The A.V. Club gave this episode a B−, stating, "Fox’s synergistic Simpsons programming saw FXX run a mini-marathon of Moe all Sunday leading up to this Moe-centric outing...and The Simpsons’ longevity means that there’s more mediocre Moe (and, well, everyone else), than certified Moe classics. But 'King Leer' manages to mine Springfield’s least-reputable barkeep for enough quality Moe to at least remind us why he’s always been one of the show’s most reliable side characters."
Tony Sokol of Den of Geek gave the episode 3.5 out of 5 stars. He called it a high point of the season because of the side gags.
On release, "King Leer" scored a 1.0 (nielsen) rating with a 4 share with an estimated watch of 2.26 million people, making it Fox's highest rated show of the night.
References
External links
2018 American television episodes
The Simpsons (season 29) episodes |
Judith Green (October 26, 1934 – September 14, 2001) was a New York City novelist, socialite and philanthropist.
Early life
Judith was born on October 26, 1934, and brought up in New York, at 101 Central Park West. She was the daughter of Arthur Stephen Heiman, a wealthy businessman, and Rose Boehm Heiman (d. 2002). She graduated from the Birch Wathen School and, later, Vassar College.
Career
From an early age she moved in social, publishing and showbusiness circles. Dorothy Fields, the Broadway lyricist, was a maternal relative. She was heralded as Andy Warhol's first muse by Baby Jane Holzer. Warhol not only did her photo portrait but she starred in his first movie, The Kiss, on permanent display at MOMA. She was also reportedly close to Frank Sinatra and Neil Sheehan, the Pulitzer Prize and National Book Award winning Vietnam War correspondent.
In 1962, she wrote and released The Young Marrieds, a novel published by Simon & Schuster, before she was married, which was turned into a daytime soap opera, The Young Marrieds.
After her marriage to Green, she went on to author three more books. Irving Lazar was her first agent. She also wrote Sometimes Paradise, which was about the anguish of country club acceptance, Winners, which was about the 1980s "salad days of this decade's glitzoid." In 1991, she released Unsuitable Company, which was "partly about a struggle to keep a Midwest-based manufacturing concern alive in the face of an eviscerating takeover attempt by a ruthless, greedy conglomerate pirate. Most of the story, however, turns on a cat fight between two desperate trophy wives over the purchase rights to an $11 million apartment at one of Fifth Avenue`s most prestigious addresses."
Personal life
In 1964, when she was in her late 20s, by which time she was already a published author, she married William John "Bill" Green (1915–1979), a businessman almost twice her age. Edgar M. Bronfman, president of Seagram Distillers, served as best man. Green was the founder and CEO of the Clevepak Corporation, a manufacturer of packaging and containers based in New York. Judy and Bill Green resided on Park Avenue. Before his death from a heart attack in Barbados in January 1979, the Greens had two children:
Christina Fields Green, who married Lloyd Harriman Gerry, the son of Robert Livingston Gerry III (b. 1937), in 2000. Gerry is a managing partner at Catalyst Partners LLC, a private investment management company in New York.
Nicholas Green.
She endured a 10-month-long battle with pancreatic cancer and died on September 14, 2001, at home, aged 66.
Residence
They also had had, at one time, a Mount Kisco estate, described as a "large, beautiful home with seven ponds, a pool and tennis court," that she listed for sale for $7.5 million in May 1980. They were known for their lavish entertaining for, among others, Frank and Barbara Sinatra, Ann and Morton Downey, Gregory and Veronique Peck, Kirk and Anne Douglass, Barbara Walters, Alan Greenspan, Peter Duchin, Jessica Tandy, Zoe Caldwell, Arlene Francis, Edgar Bronfman Sr., Joe Raposo, Mark Goodson, Mike Wallace, Bennett and Phyllis Cerf, Rosalind Russell and Freddie Brisson, Pamela and Leland Hayward, and Claudette Colbert.
Legacy
In 2006, several years after her death, the painting of her by Warhol sold for $2,144,000.
Published works
The Young Marrieds (1962), Simon & Schuster.
Winners (1980), Knopf.
Sometimes Paradise (1987), Knopf.
Unsuitable Company (1991), Bantam Books
External links
Site with photo of Judith Green
References
1934 births
2001 deaths
Vassar College alumni
20th-century American novelists
Philanthropists from New York (state)
American socialites
American women novelists
Deaths from cancer in New York (state)
Deaths from pancreatic cancer
People from the Upper West Side
People from Mount Kisco, New York
20th-century American women writers
Novelists from New York (state)
20th-century American philanthropists
Birch Wathen Lenox School alumni
20th-century American Jews |
The Swedish men's national under 20 ice hockey team, or Juniorkronorna (Junior Crowns in Swedish) as it is commonly called in Sweden, is the national under-20 ice hockey team in Sweden. The team represents Sweden at the International Ice Hockey Federation's World Junior Hockey Championship, held annually every December and January, and is affectionately known as The Junior Crowns, referencing the men's national team Three Crowns.
Sweden's roster for the 1981 World Junior Championships when they won gold included players such as Jan Erixon, Patrik and Peter Sundström, Håkan Nordin and Lars Eriksson.
World Junior Championship record
† Includes one win in extra time (in the preliminary round)
^ Includes one loss in extra time (in the preliminary round)
* Includes one win in extra time (in the playoff round)
+ Includes one loss in extra time (in the playoff round)
References
External links
Swedish men's national junior hockey team all-time statistical leaders - QuantHockey
I
Junior national ice hockey teams |
The Western Boone Junior-Senior High School, colloquially called WeBo, is a public high school located in Thorntown, Indiana.
History
The school was founded after the consolidation of five Boone County public schools: Dover, Pinnell, Thorntown, Washington, and Granville Wells. To represent the five schools, Orion the star was chosen to represent to newly founded school as its mascot.
Athletics
The Western Boone Stars are currently members of the Sagamore Conference. However, between the 2024–25 and 2026-27 school years, Western Boone will be leaving to form a new 6-School conference with Crawfordsville, Frankfort, North Montgomery, Southmont, and an unnamed sixth school. Student athletes at WeBo participate in the following Indiana High School Athletic Association (IHSAA) sanctioned sports are offered:
Baseball (Boys)
Basketball (Boys & Girls)
Cross Country (Boys & Girls)
Football (Boys)
Golf (Boys & Girls)
Soccer (Boys & Girls)
Softball (Girls)
Swimming (Boys & Girls)
Tennis (Boys & Girls)
Track & Field (Boys & Girls)
Vollyball (Girls)
Wrestling (Boys)
State Championships
Diving
1992 IHSAA One Meter Diving: Brian Carr
1993 IHSAA One Meter Diving: Brian Carr
Football
1988 IHSAA 2A Champions
2018 IHSAA 2A Champions
2019 IHSAA 2A Champions
2020 IHSAA 2A Champions
Track & Field
2019 IHSAA Boys High Jump: Logan Benson
Performing Arts
Imperial Star Command Band
Western Boone's marching band was founded in the summer of 1974 under the direction of Richard J. Gress, the former music teacher and band director of Thorntown High School. Continuing the tradition set by the Thorntown High School marching band, The Imperial Star Command Band participated in the summer marching events hosted by the Central Indiana Track Show Association (CITSA) from 1974-1979.
In 1977 Steven A. Meurer was hired as the school's new band director. Under new direction, the band began participating in the Indiana State School Music Association's (ISSMA) Fall marching in 1977. The Imperial Star Command Band would have their highest placement of 8th at the State Finals in 1983 under the direction of Dana H. Heidenreich. They continued to participate in ISSMA events until 1988, when the program took a five year absence until their return in 1994.
In 2006, Brad Hisey took over the program and continued to participate in ISSMA events until 2009. In 2010, the program returned to the Summer marching events hosted by CITSA and has continued to participate, most recently in the 2023 Indiana State Fair Band Day event. In the 2023 season, under the direction of Leslie Baker, the Imperial Star Command Band placed 11th place in the preliminary scoring. That placement allowed the band to participate in the Indiana State Fair Band Day Finals for the first time since 1979. The band competed in the finals in the following years (with finals score placements):
1974 (16th place)
1975 (16th place)
1976 (16th place)
1979 (14th place)
2023 (11th place)
See also
List of high schools in Indiana
Sagamore Conference
References
External links
Official Website
Public high schools in Indiana
Schools in Boone County, Indiana |
```xml
import React from 'react';
import './fast-refresh';
export declare function App(): React.JSX.Element;
//# sourceMappingURL=qualified-entry.d.ts.map
``` |
Francesco Camarda (born 10 March 2008) is an Italian footballer who plays as a forward for Italian club AC Milan U19.
Early life
Camarda was born in Milan, Italy. As a child he also took an interest in kickboxing.
Club career
Camarda started his career with G.S.D Afforese, a football school in Milan. During his time with Afforese, he trained with the academy of professional side AC Milan, and went on to join the club permanently in 2015, after just over a year with Afforese. In his first training session with AC Milan, he was deployed as a defender, but after continually dribbling through the opposition teams and scoring, he was moved up front to play as a striker.
During his time in the academy of AC Milan, Camarda established himself as a prolific goal-scorer; at an under-9 tournament in Vienna, Austria, he was taken off due to injury with his side 2–0 down to German opposition Bayern Munich. He asked his coach to return to the field, and went on to score two goals and provide an assist in the eventual 3–2 win. His prolific form continued as he progressed through the academy, and he went on to score twenty-two goals in twenty-four games for AC Milan's under-15 side, leading them to the under-15 Scudetto title.
Eventually, his goal-scoring feats drew the attention of international media, and he was lauded for having scored 485 goals in only 89 matches for AC Milan's academy, an average of 5.45 goals per game. He trained with AC Milan's under-19 side at the age of fourteen, and scored two goals for the side in a friendly win against Eccellenza team Solbiatese.
Camarda made his UEFA Youth League debut against Newcastle United on 19 September 2023, scoring a brace in a 4–0 victory. These goals made Camarda the second-youngest player to score a brace in the tournament and the youngest-ever Italian goalscorer at , breaking Fabrizio Caligara's record of .
International career
Camarda has represented Italy at under-15, under-16, and under-17 level.
References
External links
2008 births
Living people
Footballers from Milan
Italian men's footballers
Men's association football forwards
AC Milan players
Italy men's youth international footballers |
George Holland Sabine (9 December 1880 – 18 January 1961), popularly known as Sabine, was a professor of philosophy, dean of the graduate school and vice president of Cornell University. He is best known for his authoritative work A History of Political Theory, which traces the growth of political thought from the times of Plato to modern fascism and nazism. George Sabine was also a carpenter, a blacksmith, a cook, and a gardener and collected lithographs and etchings. In his review of A History of Political Theory, Leland Jenks noted, "Sabine is the only textbook writer who is abreast of recent Rousseau scholarship, as represented by Hoffding, Lanson, Cassirer, and Hendel."
Biography
He was born in Dayton, Ohio to Lorenzo D. Sabine and Eva Josephine Tucker.
Sabine entered Cornell University in 1899, received his A.B. in 1903 and Ph.D. in 1906. He taught at Stanford University from 1907 to 1914. That year, he was appointed professor of philosophy at University of Missouri. He continued teaching there until 1923 when he began at Ohio State University. In 1931, he returned to Cornell, where Henry W. Sage had endowed the Susan Linn Sage professorship. Beyond the classroom, Sabine served as Dean of Graduate School from 1940 to 1944, and as Vice President of Cornell from 1943 to 1946. He was affiliated with the Cornell Branch of the Telluride Association, where he resided in his final years.
He died in Washington, D.C.
Works
"A History of Political Theory" - first published on April 10, 1937
"What is Political Theory?", The Journal of Politics, Feb. 1939
"The Pragmatic Approach to Political Science", American Political Science Review, Nov. 1930
"Political Science and the Juristic Point of View", American Political Science Review, Aug. 1928
"Henry Adams and the Writing of History", University of California Chronicle, Jan. 1924
"Bosanquet's Theory of the Real Will", Philosophical Review, Nov. 1923
Introduction and translation of Hugo Krabbe's "The Modern Idea of the State" (New York: D. Appleton), 1922
"The Concept of the State as Power", Philosophical Review, July 1920
"Philosophical and Scientific Specialization", Philosophical Review, Jan. 1917
"Professor Bosanquet's Logic and the Concrete Universal", Philosophical Review, Sept. 1912
"Descriptive and Normative Sciences", Philosophical Review, July 1912
"The Material of Thought", Philosophical Review, May 1907
"The Concreteness of Thought", Philosophical Review, Mar. 1907
"Hume's Contribution to the Historical Method", Philosophical Review, Jan. 1906
"Radical Empiricism as a Logical Method", The Philosophical Review, Nov. 1905
Notes
References
Stuart Brown (1960,1) George Holland Sabine Proceedings and Addresses of the American Philosophical Association 34:98 from JSTOR.
George H. Sabine Papers, [ca. 1886 — 1960] #14–21–547 Division of Rare and Manuscript Collections, Cornell University Library.
American political scientists
Cornell University faculty
1880 births
1961 deaths
People from Dayton, Ohio
20th-century political scientists |
```objective-c
/*
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE COPYRIGHT HOLDER(S) OR AUTHOR(S) 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.
*
* Authors: AMD
*
*/
#ifndef __DAL_HW_FACTORY_DCN21_H__
#define __DAL_HW_FACTORY_DCN21_H__
/* Initialize HW factory function pointers and pin info */
void dal_hw_factory_dcn21_init(struct hw_factory *factory);
#endif /* __DAL_HW_FACTORY_DCN20_H__ */
``` |
Nikolai Lemtyugov (; born 15 January 1986) is a Russian former professional ice hockey player. His career, which lasted from 2004 to 2020, was mainly spent in the Russian Superleague and the Kontinental Hockey League.
Playing career
Lemtyugov was drafted 219th overall in the 2005 NHL Entry Draft by the St. Louis Blues. Nikolay spent time in the Russian Super League before coming to North America for the 2007–08 season and playing for the Peoria Rivermen, affiliate of the Blues. On December 15, 2008, it was reported that Lemtyugov had quit the Rivermen and was signed to a multi-year deal with Severstal Cherepovets.
In July 2019, Lemtyugov moved to the UK to sign for Sheffield Steelers, reuniting with his former coach Aaron Fox in the process.
Career statistics
Regular season and playoffs
International
References
External links
1986 births
Living people
Ak Bars Kazan players
Atlant Moscow Oblast players
Avangard Omsk players
HC CSKA Moscow players
HC Neftekhimik Nizhnekamsk players
HC Sibir Novosibirsk players
HC Spartak Moscow players
HC Yugra players
HL Anyang players
Metallurg Magnitogorsk players
People from Miass
Peoria Rivermen (AHL) players
Russian ice hockey left wingers
St. Louis Blues draft picks
Severstal Cherepovets players
Sheffield Steelers players
Sportspeople from Chelyabinsk Oblast
Traktor Chelyabinsk players |
Women have competed in artistic gymnastics at the Olympic Games since 1928. While many women artistic gymnasts have competed in multiple Olympic Games, only four have competed in at least four separate Games: Oksana Chusovitina (8), Daniele Hypólito (5), Olga Tass (4), and Vanessa Ferrari (4).
See also
List of Olympic medal leaders in women's gymnastics
List of top female medalists at major artistic gymnastics events
References
appearances
Lists of Olympic female gymnasts |
Seavus Project Viewer is a viewer for Microsoft Project files. It reads the native .mpp file format created in any Microsoft Project versions. As a project management software, it is designed to assist users (team members, team leads, project stakeholder and other project participant) to review their project assignments, print the project information and follow the overall project status. The application software shows critical path schedules and critical chain which are visualized in a Gantt chart.
Overview
When the project manager saves the project in an .mpp file, which is the native file format for Microsoft Project, the formatting information is stored along with the project information in the same file. Seavus Project Viewer reads this information when opening .mpp files, showing the same formatting and visual styles as in Microsoft Project.
The supported versions of the .mpp file format are Microsoft Project 2003, Microsoft Project 2007, Microsoft Project 2010, Microsoft Project 2013, and Microsoft Project 2016, Microsoft Project 2021.
Users can open Microsoft Project files hosted on the following cloud storages:
Microsoft SharePoint
Microsoft Project Server
OneDrive
Seavus Project Viewer is available for Microsoft Windows, Mac OS X, via the web with an online version, on the mobile iOS, Windows Phone and Android platforms and as well with applications for the Apple Watch.
Features
Seavus Project Viewer is a viewer for Microsoft Project files that provides a collaborative environment for project teams, without server installation. With the Task update functionality, teams can introduce a collaborative project environment, while the project manager will have up-to-date information about the current status of the project tasks and be able to track if all assignments in the project plan are finished on time.
Visual reports and dashboards or graphical reports allow team leads and project participants to view the health of the project plan. Users can view the status of the whole project, the work completion status, resources allocation status, and project and resources costs overview. The graphical reports can be customized according to the users′ preference, and monitor how a certain parameter changes throughout the lifespan of the project.
Seavus Project Viewer is fully integrated with most cloud storage providers. This allow users to open, view, and print Project Plans and Master Project Plans on a shared location, and every member to have access to the updated Microsoft Project plan. The complete SharePoint Integration enables users to manage all project plans directly from SharePoint hosted in-house, or to collaborate with team members using the Microsoft SharePoint in the cloud (SharePoint Online) included in Office 365 suite as well as OneDrive.
Seavus Project Viewer is fully integrated with Skype for Business to create a central application for meetings.
See also
List of project management software
Microsoft Project
References
External links
Project management software
Windows software
Classic Mac OS software
IOS software |
Foxit PDF Reader (formerly Foxit Reader) is a multilingual freemium PDF (Portable Document Format) tool that can create, view, edit, digitally sign, and print PDF files. Foxit Reader is developed by Fuzhou, China-based Foxit Software. Early versions of Foxit Reader were notable for startup performance and small file size. Foxit v3.0 was found to be comparable to Adobe Reader. The Windows version allows annotating and saving unfinished PDF forms, FDF import/export, converting to text, highlighting, and drawing. Until version 9.7.2 Foxit Reader had PDF creation features, including a "Foxit PDF Printer" for Windows, allowing all programs to "print" output to PDF; they were removed in May 2020 from later versions. Foxit PDF Reader also includes an Enterprise version, which requires a Foxit account.
Supported platforms
Foxit Software adds support for new platforms, and withdraws ones considered obsolete. Microsoft operating systems from Windows 95, Windows Mobile (CE), Windows RT, and Windows Phone were all supported, but have been discontinued. Systems currently supported are reported on the Foxit Web site, and include versions of Windows, Mac OS, and older versions of Linux. Mobile versions are available for telephones and tablets running Android and Apple iOS.
Issues
The Foxit installer was bundled with potentially unwanted programs like the Ask Toolbar and OpenCandy which installed the browser-hijacking malware Conduit.
In July 2014, the Internet Storm Center reported that the mobile version for iPhone was transmitting unencrypted telemetry and other data to remote servers located in China despite users attempting to opt out of such data collection.
Versions of Foxit Reader up to 9.7.2 added a "Foxit PDF printer" to Windows; this allowed any program to send its printable output to a PDF file. This was removed in later versions, an action much criticised by users. On 9 June 2021 Foxit said "Foxit PDF Printer will not be added in Foxit Reader in the foreseeable future", and suggested using Foxit PDF Editor for PDF creation. Ways to extract the PDF printer from an older version were published. Alternatively, Foxit PDF printer can also be installed directly from the link provided by Foxit Support.
See also
List of PDF software
References
External links
Freeware
PDF readers
Portable software
Technical communication tools
Windows text-related software
Software that uses Qt |
Divya Shakti () is a 1993 Indian Hindi-language action film directed and written by Sameer Malkan. The film stars Ajay Devgan, Raveena Tandon in lead roles.
Plot
Prashant Verma (Ajay Devgn) is a journalist and is in love with Priya (Raveena Tandon) He gets weary and tired of witnessing the reign of crime, police corruption and injustice in his city and decides to wage a one-man war against the psychotic king maker "Tau" (Amrish Puri). His journey costs him his limbs and loved ones as he goes on a vigilante style brute-fest right into the lair and dark world of the two-faced Tau and his cronies. Death and destruction follow the warpath.
Cast
Ajay Devgan as Prashant Verma
Raveena Tandon as Priya
Aloknath as Professor
Shakti Kapoor as Bharat Acharya
Amrish Puri as Tau
Satyendra Kapoor as Monto
Shafi Inamdar as ACP Anand Deshmukh
Natasha Sinha as Shalini Verma
Anjan Srivastav as Pandey
Dinesh Hingoo as Rustam
Pankaj Berry as Francis
Deep Dhillon as Lalla
Manohar Singh as Priya's Father
Khosrow Khaleghpanah as Fighter
Ragesh Asthana as Sunil Gupta only Photo in photo frame (uncredited)
Soundtrack
Sameer wrote the songs.
References
External links
1993 films
1990s Hindi-language films
1990s action drama films
Films scored by Nadeem–Shravan
Indian action drama films
Films about journalism
Films about journalists
Indian films about revenge |
Football Club Thy-Thisted Q is a Danish women's football club based in Thisted, Denmark. The club is currently playing in the Danish top division, the Elitedivisionen, and they play their home matches at the Sparekassen Thy Arena. The team was previously a part of Thisted FC.
FC Thy-Thisted Q is a superstructure between the following five clubs: Koldby Hørdum IF, Nors B, IF Nordthy, Frøstrup Hannæs IF and Thisted FC.
They promoted to the Danish League, Elitedivisionen, in 2018 and qualified for the Championship round, in their first season.
Honours
Danish Women's Cup:
Winner (1): 2021
Runners-up (1): 2020
Current squad
As of 5 July 2021
Notable former players
For more former players, see :Category:FC Thy-Thisted Q players.
References
External links
Official website
Thisted
Football clubs in Denmark
Women's football clubs in Denmark
Association football clubs established in 2017
2017 establishments in Denmark
Furesø Municipality |
P1Harmony (; Japanese: ; Acronym: P1H) is a South Korean boy band formed and managed by FNC Entertainment, consisting of Keeho, Theo, Jiung, Intak, Soul, and Jongseob. The group was introduced through the film P1H: The Beginning of a New World on August 27, 2020, and they officially debuted on October 28 with their first EP Disharmony: Stand Out.
Name
The team name, P1Harmony, is a combination of Plus, Number 1, and Harmony. Members of the group are all 'plus' (added) together to create 'one' group for archiving infinite possibilities for 'harmonies'.
The official fan club name of P1Harmony is P1ece () announced on April 20, 2021, meaning fans are indispensable pieces for P1Harmony.
History
Pre-debut
Prior to their debut, Jongseob was a contestant on the SBS reality program K-pop Star 6: The Last Chance as a member of Boyfriend. He won the program and then signed with YG Entertainment. Two years later, he joined the YG Survival show YG Treasure Box as a member of Group C but was eliminated in Episode 9. After leaving YG Entertainment, he moved to FNC Entertainment and eventually debuted with the group.
In 2018, Intak appeared as a guest on the 10th episode of the JTBC variety show I've Fallen For You.
2020: Debut and Disharmony: Stand Out
In August 2020, FNC Entertainment announced they were gearing up to debut a new boy group. On the 27th, the company released the teaser poster of the group's debut movie P1H: The Beginning of a New World, which they described as a fusion project combining K-pop and K-movie. This would be the first K-pop group to rather debut with a movie.On September 1, 2020, FNC Entertainment officially announced the name of their new boy group P1Harmony, followed by a Logo Performance video. On September 8, 2020, the main teaser was officially unveiled on P1Harmony's official YouTube account. On October 2, the group released team biography photos, and on October 8, the group's movie P1H: The Beginning of a New World, starring the entire group, premiered. The film describes how teenagers scattered in different dimensions try to save the ruined earth and locate the star of hope.
On October 28, 2020, the group debuted with their EP Disharmony: Stand Out and its lead single, "Siren". All group members contributed to all the lyrics for the album.
On December 29, 2020, the group participated in DAZED's "MIX HARMONY", an art collaboration project, and created a digital single " (Breakthrough) Full Ver." The song is based on P1Harmony's debut album Intro; () Breakthrough and expands the meaning of the lyrics. A visual interpretation of the song has been developed in collaboration with professional artists in the fields of fashion, dance, and art, including designer Yoon Kyung-deok, 1MILLION dance studio choreographers Choreo Lee Yoojung with Isabelle, and art director May Kim.
2021: Disharmony: Break Out
On April 20, 2021, the group made their first comeback with their second EP Disharmony: Break Out and its lead single " (Scared)". There was a six-fold increase in the album's first week compared to their debut.
With this album, P1Harmony states to convey a more positive message to the world. The title track 'Scared' incorporates both hip-hop and R&B styles. The song is intends to show the world the importance of eliminating the framework of inequality. 'Believe in yourself, don't be afraid, make your voice heard' is the theme behind the song. In addition, all members contributed lyrics to five of the songs (six in total), demonstrating the strength and ambition of the group as self-produced artists.
The group was nominated for Seoul Music Awards New Artist Award and MAMA Men's New Artist Award in 2021.
2022: Disharmony: Find Out, Gotta Get Back, Harmony: Zero In and Harmony: Set In
On January 3, 2022, the group released their third EP Disharmony: Find Out, and its lead single "Do It Like This". Its first-week sales exceeded 86,000 copies, more than triple those of its second mini album, demonstrating the team's ongoing growth. Nine regions of the iTunes world ranked it among the top three on the POP album chart. All the songs on the album have also charted on the iTunes KPOP chart in the United States. UK media The Sun and global streaming service TIDAL have covered this comeback.
On January 28, 2022, the group announced they would embark on their first overseas tour 2022 P1Harmony LIVE TOUR [P1ustage H: PEACE]. Their first stop was on February 26 in Seoul, and they visited eight cities in the United States starting March 11. The tour ended on May 18. On March 10, 2022, the group released a new song, "Do it Like This", the English version of its title track in EP Disharmony: Find Out.
On February 1, the group's EP came at number four on the Hanteo Chart's list of best-selling K-Pop albums for the month of January 2022 with 91,969 copies sold.
On May 26, 2022, the group released their digital single "Gotta Bet Back" in collaboration with American artist Pink Sweat$. The song was composed by Pink Sweat$, while members Intak and Jongseob directly participated in the lyrics.
On July 20, 2022, the group released their fourth EP Harmony: Zero In. The album contains six songs, including the title track " (Doom Du Doom)", and sold about 104,000 copies in the first week, which is the group's best first-week sales record.
On November 30, 2022, the group released their fifth EP Harmony: Set In and its lead single "Back Down". The group debuted their lead single performance on NBC's The Kelly Clarkson Show on the 29th; The EP sold 132,000 copies in its first week, setting a new career high.
2023–present: [P1ustage H : P1oneer] Live Tour
P1Harmony kicked off their 2023 P1Harmony Live Tour [P1ustage H: P1oneer] tour in January 2023. Starting January 14–15 in Seoul, the tour held performances in 12 cities across the United States. All tickets sold out within 30 minutes.
Before their concert in Huston on January 26, 2023, a live interview with P1Harmony aired on CBS's Great Day Huston, one of the area's most popular morning talk shows.
2023: Harmony: All In
On June 8, 2023, the group released their sixth EP Harmony: All In, and later on its English version of their title track "Jump". The album broke the group's record by accumulating over 251,576 units sold, in first-week sales.
Artistry
Disharmony () Series
The first three EPs released by P1Harmony incorporate the word Disharmony (). Jongseob describes that these albums involved understanding unreasonable things in the world and crushing them.
In their debut EP album Disharmony: Stand Out, P1Harmony shows the courage to be different from others and bravely say 'no' to the world in a society surrounded by disharmony.[2] They continued the theme with their second EP Disharmony: Break Out. According to a representative from FNC, P1Harmony recognized the disharmony of the world in their debut album, the second EP is attempting to break free of this world more actively. In the lead song, "Scared", the lyrics offer courage to those who have given up on the fight against inequality. Disharmony: Find Out is the final part in the series devoted to the previously discussed disharmony. According to FNC, the theme presented in this album is that P1Harmony becomes the master of a reimagined world, looks forward to the infinite possibilities inherent in dreaming, and searches for the path that leads from dissonance to harmony. "Do It Like This", the title track, conveys the idea of P1Harmony not hesitating but going ahead boldly into the new era.
Harmony () Series
After concluding the trilogy of Disharmony, P1Harmony started a new chapter with the theme of Harmony (). FNC Entertainment stated that the group is trying to convey a message of respect for freedom and individuality through those albums. Jongseob concluded those albums illustrate how members assist each other in moving towards harmony. The first chapter, Harmony: Zero In, shows how the members finally found the "+World" and started with nothing to construct a new world. According to P1Harmony's interview, the fifth EP, Harmony: Set In, represents the start of the journey. The album portrays trust and strong friendship among members with a range of values and steps towards true harmony. A powerful message of unity and advancement is conveyed in the album's title track, "Back Down": no matter where you are or when you are, do not back down from fear.
Philanthropy
Before debuting, P1Harmony volunteered to help Mongolian children and farmers in Jeju Island.
After their debut, they have been actively involved in the 'Watch and Donate V LIVE' event organized by LOVE FNC and Naver Happy Bean Donation. In this series of V LIVE, the goal is to raise awareness about the many groups and times in society that need to be addressed. P1Harmony's ENFPs, Keeho, Theo, and Intak, participated in their V LIVE to inform and emphasize the severity of the education gap, and how COVID-19 exacerbates the problem.
Members
Keeho () – leader, vocalist
Theo () – vocalist
Jiung () – vocalist, rapper, dancer
Intak () – rapper, dancer
Soul () – rapper, dancer
Jongseob () – rapper, dancer
Discography
Extended plays
Singles
Videography
Music videos
Other videos
Filmography
Movie
Concert & Tours
Showcase
Live Tour
2022 P1Harmony Live Tour [P1ustage H : Peace]
On March 20, the postponement of the show in Chicago was announced after several staff members tested positive for COVID-19. On March 21, it was reported that all of the members except Intak had tested positive for the virus. As a result, the rest of the tour's shows dating March 20–28 were rescheduled to May 8–18.
2023 P1Harmony Live Tour [P1ustage H : P1oneer]
Concert participations
Other concerts
Awards and nominations
References
External links
Official website
K-pop music groups
South Korean boy bands
South Korean dance music groups
Musical groups from Seoul
Musical groups established in 2020
2020 establishments in South Korea
South Korean pop music groups |
```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 model
import (
"encoding/json"
"fmt"
"sort"
"strconv"
"strings"
)
var (
// ZeroSample is the pseudo zero-value of Sample used to signal a
// non-existing sample. It is a Sample with timestamp Earliest, value 0.0,
// and metric nil. Note that the natural zero value of Sample has a timestamp
// of 0, which is possible to appear in a real Sample and thus not suitable
// to signal a non-existing Sample.
ZeroSample = Sample{Timestamp: Earliest}
)
// Sample is a sample pair associated with a metric. A single sample must either
// define Value or Histogram but not both. Histogram == nil implies the Value
// field is used, otherwise it should be ignored.
type Sample struct {
Metric Metric `json:"metric"`
Value SampleValue `json:"value"`
Timestamp Time `json:"timestamp"`
Histogram *SampleHistogram `json:"histogram"`
}
// Equal compares first the metrics, then the timestamp, then the value. The
// semantics of value equality is defined by SampleValue.Equal.
func (s *Sample) Equal(o *Sample) bool {
if s == o {
return true
}
if !s.Metric.Equal(o.Metric) {
return false
}
if !s.Timestamp.Equal(o.Timestamp) {
return false
}
if s.Histogram != nil {
return s.Histogram.Equal(o.Histogram)
}
return s.Value.Equal(o.Value)
}
func (s Sample) String() string {
if s.Histogram != nil {
return fmt.Sprintf("%s => %s", s.Metric, SampleHistogramPair{
Timestamp: s.Timestamp,
Histogram: s.Histogram,
})
}
return fmt.Sprintf("%s => %s", s.Metric, SamplePair{
Timestamp: s.Timestamp,
Value: s.Value,
})
}
// MarshalJSON implements json.Marshaler.
func (s Sample) MarshalJSON() ([]byte, error) {
if s.Histogram != nil {
v := struct {
Metric Metric `json:"metric"`
Histogram SampleHistogramPair `json:"histogram"`
}{
Metric: s.Metric,
Histogram: SampleHistogramPair{
Timestamp: s.Timestamp,
Histogram: s.Histogram,
},
}
return json.Marshal(&v)
}
v := struct {
Metric Metric `json:"metric"`
Value SamplePair `json:"value"`
}{
Metric: s.Metric,
Value: SamplePair{
Timestamp: s.Timestamp,
Value: s.Value,
},
}
return json.Marshal(&v)
}
// UnmarshalJSON implements json.Unmarshaler.
func (s *Sample) UnmarshalJSON(b []byte) error {
v := struct {
Metric Metric `json:"metric"`
Value SamplePair `json:"value"`
Histogram SampleHistogramPair `json:"histogram"`
}{
Metric: s.Metric,
Value: SamplePair{
Timestamp: s.Timestamp,
Value: s.Value,
},
Histogram: SampleHistogramPair{
Timestamp: s.Timestamp,
Histogram: s.Histogram,
},
}
if err := json.Unmarshal(b, &v); err != nil {
return err
}
s.Metric = v.Metric
if v.Histogram.Histogram != nil {
s.Timestamp = v.Histogram.Timestamp
s.Histogram = v.Histogram.Histogram
} else {
s.Timestamp = v.Value.Timestamp
s.Value = v.Value.Value
}
return nil
}
// Samples is a sortable Sample slice. It implements sort.Interface.
type Samples []*Sample
func (s Samples) Len() int {
return len(s)
}
// Less compares first the metrics, then the timestamp.
func (s Samples) Less(i, j int) bool {
switch {
case s[i].Metric.Before(s[j].Metric):
return true
case s[j].Metric.Before(s[i].Metric):
return false
case s[i].Timestamp.Before(s[j].Timestamp):
return true
default:
return false
}
}
func (s Samples) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
// Equal compares two sets of samples and returns true if they are equal.
func (s Samples) Equal(o Samples) bool {
if len(s) != len(o) {
return false
}
for i, sample := range s {
if !sample.Equal(o[i]) {
return false
}
}
return true
}
// SampleStream is a stream of Values belonging to an attached COWMetric.
type SampleStream struct {
Metric Metric `json:"metric"`
Values []SamplePair `json:"values"`
Histograms []SampleHistogramPair `json:"histograms"`
}
func (ss SampleStream) String() string {
valuesLength := len(ss.Values)
vals := make([]string, valuesLength+len(ss.Histograms))
for i, v := range ss.Values {
vals[i] = v.String()
}
for i, v := range ss.Histograms {
vals[i+valuesLength] = v.String()
}
return fmt.Sprintf("%s =>\n%s", ss.Metric, strings.Join(vals, "\n"))
}
func (ss SampleStream) MarshalJSON() ([]byte, error) {
if len(ss.Histograms) > 0 && len(ss.Values) > 0 {
v := struct {
Metric Metric `json:"metric"`
Values []SamplePair `json:"values"`
Histograms []SampleHistogramPair `json:"histograms"`
}{
Metric: ss.Metric,
Values: ss.Values,
Histograms: ss.Histograms,
}
return json.Marshal(&v)
} else if len(ss.Histograms) > 0 {
v := struct {
Metric Metric `json:"metric"`
Histograms []SampleHistogramPair `json:"histograms"`
}{
Metric: ss.Metric,
Histograms: ss.Histograms,
}
return json.Marshal(&v)
} else {
v := struct {
Metric Metric `json:"metric"`
Values []SamplePair `json:"values"`
}{
Metric: ss.Metric,
Values: ss.Values,
}
return json.Marshal(&v)
}
}
func (ss *SampleStream) UnmarshalJSON(b []byte) error {
v := struct {
Metric Metric `json:"metric"`
Values []SamplePair `json:"values"`
Histograms []SampleHistogramPair `json:"histograms"`
}{
Metric: ss.Metric,
Values: ss.Values,
Histograms: ss.Histograms,
}
if err := json.Unmarshal(b, &v); err != nil {
return err
}
ss.Metric = v.Metric
ss.Values = v.Values
ss.Histograms = v.Histograms
return nil
}
// Scalar is a scalar value evaluated at the set timestamp.
type Scalar struct {
Value SampleValue `json:"value"`
Timestamp Time `json:"timestamp"`
}
func (s Scalar) String() string {
return fmt.Sprintf("scalar: %v @[%v]", s.Value, s.Timestamp)
}
// MarshalJSON implements json.Marshaler.
func (s Scalar) MarshalJSON() ([]byte, error) {
v := strconv.FormatFloat(float64(s.Value), 'f', -1, 64)
return json.Marshal([...]interface{}{s.Timestamp, string(v)})
}
// UnmarshalJSON implements json.Unmarshaler.
func (s *Scalar) UnmarshalJSON(b []byte) error {
var f string
v := [...]interface{}{&s.Timestamp, &f}
if err := json.Unmarshal(b, &v); err != nil {
return err
}
value, err := strconv.ParseFloat(f, 64)
if err != nil {
return fmt.Errorf("error parsing sample value: %s", err)
}
s.Value = SampleValue(value)
return nil
}
// String is a string value evaluated at the set timestamp.
type String struct {
Value string `json:"value"`
Timestamp Time `json:"timestamp"`
}
func (s *String) String() string {
return s.Value
}
// MarshalJSON implements json.Marshaler.
func (s String) MarshalJSON() ([]byte, error) {
return json.Marshal([]interface{}{s.Timestamp, s.Value})
}
// UnmarshalJSON implements json.Unmarshaler.
func (s *String) UnmarshalJSON(b []byte) error {
v := [...]interface{}{&s.Timestamp, &s.Value}
return json.Unmarshal(b, &v)
}
// Vector is basically only an alias for Samples, but the
// contract is that in a Vector, all Samples have the same timestamp.
type Vector []*Sample
func (vec Vector) String() string {
entries := make([]string, len(vec))
for i, s := range vec {
entries[i] = s.String()
}
return strings.Join(entries, "\n")
}
func (vec Vector) Len() int { return len(vec) }
func (vec Vector) Swap(i, j int) { vec[i], vec[j] = vec[j], vec[i] }
// Less compares first the metrics, then the timestamp.
func (vec Vector) Less(i, j int) bool {
switch {
case vec[i].Metric.Before(vec[j].Metric):
return true
case vec[j].Metric.Before(vec[i].Metric):
return false
case vec[i].Timestamp.Before(vec[j].Timestamp):
return true
default:
return false
}
}
// Equal compares two sets of samples and returns true if they are equal.
func (vec Vector) Equal(o Vector) bool {
if len(vec) != len(o) {
return false
}
for i, sample := range vec {
if !sample.Equal(o[i]) {
return false
}
}
return true
}
// Matrix is a list of time series.
type Matrix []*SampleStream
func (m Matrix) Len() int { return len(m) }
func (m Matrix) Less(i, j int) bool { return m[i].Metric.Before(m[j].Metric) }
func (m Matrix) Swap(i, j int) { m[i], m[j] = m[j], m[i] }
func (mat Matrix) String() string {
matCp := make(Matrix, len(mat))
copy(matCp, mat)
sort.Sort(matCp)
strs := make([]string, len(matCp))
for i, ss := range matCp {
strs[i] = ss.String()
}
return strings.Join(strs, "\n")
}
``` |
```python
# This file is part of rdiff-backup.
#
# rdiff-backup is free software; you can redistribute it and/or modify
# option) any later version.
#
# rdiff-backup is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
#
# along with rdiff-backup; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
# 02110-1301, USA
"""Manage logging, displaying and recording messages with required verbosity"""
import datetime
import os # needed to grab verbosity as environment variable
import re
import shutil
import sys
import textwrap
import typing
import traceback
from rdiff_backup import Globals
LOGFILE_ENCODING = "utf-8"
# type definitions
Verbosity = typing.Literal[0, 1, 2, 3, 4, 5, 6, 7, 8, 9] # : typing.TypeAlias
InputVerbosity = typing.Union[int, str] # : typing.TypeAlias
# we need to define constants
NONE: Verbosity = 0 # are always output as-is on stdout
ERROR: Verbosity = 1
WARNING: Verbosity = 2
NOTE: Verbosity = 3
INFO: Verbosity = 5
DEBUG: Verbosity = 8
TIMESTAMP: Verbosity = 9 # for adding the timestamp
# mapping from severity to prefix (must be less than 9 characters)
_LOG_PREFIX: dict[Verbosity, str] = {
NONE: "",
ERROR: "ERROR:",
WARNING: "WARNING:",
NOTE: "NOTE:",
INFO: "*",
DEBUG: "DEBUG:",
}
class LoggerError(Exception):
pass
class Logger:
"""All functions which deal with logging"""
def __init__(self):
self.log_file_open = None
self.log_file_local = None
# if something wrong happens during initialization, we want to know
self.file_verbosity: Verbosity = NONE
self.term_verbosity: Verbosity = WARNING
def __call__(self, message, verbosity):
"""
Log message that has verbosity importance
message can be a string or bytes
"""
if verbosity > self.file_verbosity and verbosity > self.term_verbosity:
return
if not isinstance(message, (bytes, str)):
raise TypeError(
"You can only log bytes or str, and not {lt}".format(lt=type(message))
)
if verbosity <= self.file_verbosity:
self.log_to_file(message, verbosity)
if verbosity <= self.term_verbosity:
self.log_to_term(message, verbosity)
# @API(Log.log_to_file, 200)
def log_to_file(self, message, verbosity=None):
"""Write the message to the log file, if possible"""
if self.log_file_open:
if self.log_file_local:
tmpstr = self._format(message, self.file_verbosity, verbosity)
self.logfp.write(_to_bytes(tmpstr))
self.logfp.flush()
else:
self.log_file_conn.log.Log.log_to_file(message, verbosity)
def log_to_term(self, message, verbosity):
"""Write message to stdout/stderr"""
if verbosity in {ERROR, WARNING} or Globals.server:
termfp = sys.stderr
else:
termfp = sys.stdout
tmpstr = self._format(message, self.term_verbosity, verbosity)
# if the verbosity is below 9 and the string isn't deemed
# pre-formatted by newlines (we ignore the last character)
if self.file_verbosity <= DEBUG and "\n" not in tmpstr[:-1]:
termfp.write(
textwrap.fill(
tmpstr,
subsequent_indent=" " * 9,
break_long_words=False,
break_on_hyphens=False,
width=shutil.get_terminal_size().columns - 1,
)
+ "\n"
)
else:
termfp.write(tmpstr)
def conn(self, direction, result, req_num):
"""Log some data on the connection
The main worry with this function is that something in here
will create more network traffic, which will spiral to
infinite regress. So, for instance, logging must only be done
to the terminal, because otherwise the log file may be remote.
"""
if self.term_verbosity <= DEBUG:
return
if type(result) is bytes:
result_repr = repr(result)
else:
result_repr = str(result)
# shorten the result to a max size of 720 chars with ellipsis if needed
# result_repr = result_repr[:720] + (result_repr[720:] and '[...]') # noqa: E265
if Globals.server:
conn_str = "Server"
else:
conn_str = "Client"
self.log_to_term(
"{cs} {di} ({rn}): {rr}".format(
cs=conn_str, di=direction, rn=req_num, rr=result_repr
),
DEBUG,
)
def FatalError(self, message, return_code=1):
"""Log a fatal error and exit"""
self.log_to_term("Fatal Error: {em}".format(em=message), ERROR)
sys.exit(return_code)
def exception(self, only_terminal=0, verbosity=INFO):
"""Log an exception and traceback
If only_terminal is zero, log normally.
If it is 1, then only log to disk if log file is local
If it is 2, don't log to disk at all.
"""
assert only_terminal in (
0,
1,
2,
), "Variable only_terminal '{ot}' must be one of [012]".format(ot=only_terminal)
if only_terminal == 0 or (only_terminal == 1 and self.log_file_open):
logging_func = self.__call__
else:
logging_func = self.log_to_term
if verbosity >= self.term_verbosity:
return
exception_string = self._exception_to_string()
try:
logging_func(exception_string, verbosity)
except OSError:
print("OS error while trying to log exception!")
print(exception_string)
# @API(Log.set_verbosity, 300)
def set_verbosity(
self,
file_verbosity: InputVerbosity,
term_verbosity: typing.Union[InputVerbosity, None] = None,
) -> int:
"""
Set verbosity levels, logfile and terminal. Takes numbers or strings.
The function makes sure that verbosities are only modified if both
input values are correct.
If not provided, the terminal verbosity is set from the logfile one.
Returns an integer code.
"""
try:
# we set a temporary verbosity to make sure we overwrite the
# actual one only if both values are correct
tmp_verbosity: Verbosity = self.validate_verbosity(file_verbosity)
if term_verbosity is None:
self.term_verbosity = tmp_verbosity
else:
self.term_verbosity = self.validate_verbosity(term_verbosity)
except ValueError:
return Globals.RET_CODE_ERR
else:
self.file_verbosity = tmp_verbosity
return Globals.RET_CODE_OK
def open_logfile(self, log_rp):
"""Inform all connections of an open logfile.
log_rp.conn will write to the file, and the others will pass
write commands off to it.
"""
assert not self.log_file_open, "Can't open an already opened logfile"
log_rp.conn.log.Log.open_logfile_local(log_rp)
for conn in Globals.connections:
conn.log.Log.open_logfile_allconn(log_rp.conn)
# @API(Log.open_logfile_allconn, 200)
def open_logfile_allconn(self, log_file_conn):
"""Run on all connections to signal log file is open"""
self.log_file_open = 1
self.log_file_conn = log_file_conn
# @API(Log.open_logfile_local, 200)
def open_logfile_local(self, log_rp):
"""Open logfile locally - should only be run on one connection"""
assert (
log_rp.conn is Globals.local_connection
), "Action only foreseen locally and not over {conn}".format(conn=log_rp.conn)
try:
self.logfp = log_rp.open("ab")
except OSError as exc:
raise LoggerError(
"Unable to open logfile {lf} due to "
"exception '{ex}'".format(lf=log_rp, ex=exc)
)
self.log_file_local = 1
def close_logfile(self):
"""Close logfile and inform all connections"""
if self.log_file_open:
for conn in Globals.connections:
conn.log.Log.close_logfile_allconn()
self.log_file_conn.log.Log.close_logfile_local()
# @API(Log.close_logfile_allconn, 200)
def close_logfile_allconn(self):
"""Run on every connection"""
self.log_file_open = None
# @API(Log.close_logfile_local, 200)
def close_logfile_local(self):
"""Run by logging connection - close logfile"""
assert (
self.log_file_conn is Globals.local_connection
), "Action only foreseen locally and not over {lc}".format(
lc=self.log_file_conn
)
self.logfp.close()
self.log_file_local = None
def _exception_to_string(self):
"""Return string version of current exception"""
type, value, tb = sys.exc_info()
s = "Exception '%s' raised of class '%s':\n%s" % (
value,
type,
"".join(traceback.format_tb(tb)),
)
return s
def _format(self, message, verbosity, msg_verbosity):
"""Format the message, possibly adding date information"""
if verbosity <= DEBUG:
# pre-formatted informative messages are returned as such
if msg_verbosity in {NONE, INFO} and "\n" in message[:-1]:
return "{msg}\n".format(msg=message)
else:
return "{pre:<9}{msg}\n".format(
pre=_LOG_PREFIX[msg_verbosity], msg=message
)
else:
timestamp = (
datetime.datetime.now(datetime.timezone.utc)
.astimezone()
.strftime("%F %H:%M:%S.%f %z")
)
if Globals.server:
role = "SERVER"
else:
role = "CLIENT"
return "{time} <{role}-{pid}> {pre} {msg}\n".format(
time=timestamp,
role=role,
pid=os.getpid(),
pre=_LOG_PREFIX[msg_verbosity],
msg=message,
)
@classmethod
def validate_verbosity(cls, input_verbosity: InputVerbosity) -> Verbosity:
"""
Validate verbosity and returns its value as integer.
The input value can be a string or an integer, between 0 and 9.
Any wrong value raises a ValueError exception.
"""
try:
verbosity = int(input_verbosity)
except ValueError:
Log(
"Verbosity must be a number, received '{vb}' "
"instead".format(vb=input_verbosity),
ERROR,
)
raise ValueError
if verbosity in typing.get_args(Verbosity):
return typing.cast(Verbosity, verbosity)
else:
Log(
"Verbosity must be between 0 and 9, received '{vb}' "
"instead".format(vb=verbosity),
ERROR,
)
raise ValueError
Log = Logger()
class ErrorLog:
"""
Log each recoverable error in error_log file
There are three types of recoverable errors: ListError, which
happens trying to list a directory or stat a file, UpdateError,
which happen when trying to update a changed file, and
SpecialFileError, which happen when a special file cannot be
created. See the error policy file for more info.
"""
_log_fileobj = None
@classmethod
def open(cls, data_dir, time_string, compress=True):
"""Open the error log, prepare for writing"""
assert not cls._log_fileobj, "Log already open, can't be reopened"
base_rp = data_dir.append("error_log.%s.data" % time_string)
if compress: # FIXME extract MaybeGzip from rpath and make it utils?
from rdiff_backup import rpath
cls._log_fileobj = rpath.MaybeGzip(base_rp)
else:
cls._log_fileobj = base_rp.open("wb", compress=0)
@classmethod
# @API(ErrorLog.isopen, 200)
def isopen(cls):
"""True if the error log file is currently open"""
if Globals.isbackup_writer or not Globals.backup_writer:
return cls._log_fileobj is not None
else:
return Globals.backup_writer.log.ErrorLog.isopen()
@classmethod
# @API(ErrorLog.write_if_open, 200)
def write_if_open(cls, error_type, rp, exc):
"""Call cls._write(...) if error log open, only log otherwise"""
if not Globals.isbackup_writer and Globals.backup_writer:
return Globals.backup_writer.log.ErrorLog.write_if_open(error_type, rp, exc)
if cls.isopen():
cls._write(error_type, rp, exc)
else:
Log(cls._get_log_string(error_type, rp, exc), WARNING)
@classmethod
def close(cls):
"""Close the error log file"""
if cls.isopen():
cls._log_fileobj.close()
cls._log_fileobj = None
@classmethod
def _get_log_string(cls, error_type, rp, exc):
"""Return log string to put in error log"""
assert (
error_type == "ListError"
or error_type == "UpdateError"
or error_type == "SpecialFileError"
), "Unknown error type {et}".format(et=error_type)
return "{et}: '{rp}' {ex}".format(et=error_type, rp=rp, ex=exc)
@classmethod
def _write(cls, error_type, rp, exc):
"""Add line to log file indicating error exc with file rp"""
logstr = cls._get_log_string(error_type, rp, exc)
Log(logstr, WARNING)
if Globals.null_separator:
logstr += "\0"
else:
logstr = re.sub("\n", " ", logstr)
logstr += "\n"
cls._log_fileobj.write(_to_bytes(logstr))
def _to_bytes(logline, encoding=LOGFILE_ENCODING):
"""
Convert string into bytes for logging into file.
"""
assert logline, "There must be a text to encode"
assert isinstance(logline, str), "Text to encode must be str and not {lt}".format(
lt=type(logline)
)
return logline.encode(encoding, "backslashreplace")
``` |
Gold(III) oxide (Au2O3) is an inorganic compound of gold and oxygen with the formula Au2O3. It is a red-brown solid that decomposes at 298 °C.
According to X-ray crystallography, AuO features square planar gold centers with both 2- and 3-coordinated oxides. The four Au-O bond distances range from 193 to 207 picometers. The crystals can be prepared by heating amorphous hydrated gold(III) oxide with perchloric acid and an alkali metal perchlorate in a sealed quartz tube at a temperature of around 250 °C and a pressure of around 30 MPa.
References
External links
Gold(III) compounds
Sesquioxides
Transition metal oxides
Crystals in space group 43 |
Elf Cup may refer to:
Fungi
Sarcoscypha coccinea, a fungus also known as the "scarlet elf cup"
Geopyxis carbonaria, a fungus also known as the "charcoal loving elf-cup"
Helvella leucomelaena, a fungus commonly known as the "white-footed elf cup"
Other
Elf Cup, a character of Toad Patrol
ELF Cup, an international football tournament organized by Northern Cyprus Football Federation (KTFF)
See also
Fairy Cup (disambiguation)
Pixie cup |
The Duke William is a Grade II listed public house at 2 St John's Square, Stoke-on-Trent, Staffordshire, England, ST6 3AJ.
It was built in 1929, and Grade II listed in 2015 by Historic England.
References
Grade II listed pubs in Staffordshire |
Highway M10 is a Ukrainian international highway (M-highway) connecting Lviv to Krakovets on the border with Poland, where it continues as the A4 motorway.
There are plans to build a motorway along this route in the coming years. This was supposed to be done by a private investor but for the last 10 years these efforts did not succeed. Now the government of Ukraine will try to find the funding.
Route
See also
Roads in Ukraine
Ukraine Highways
International E-road network
Pan-European corridors
References
External links
International Roads in Ukraine in Russian
European Roads in Russian
Roads in Lviv Oblast
European route E40 |
Louis Armand de Bourbon (10 November 1695 – 4 May 1727) was Prince of Conti, from 1709 to his death, succeeding his father, François Louis de Bourbon. As a member of the reigning House of Bourbon, he was a Prince du Sang. His mother was Marie Thérèse de Bourbon, daughter of Henri Jules, Prince of Condé and granddaughter of Louis de Bourbon, le Grand Condé. He was nominated as the Prince of Orange by King Louis XIV of France in 1712.
His male line descendants died out in 1814; through his daughter, however, he is an ancestor of the present-day pretenders to the throne of France and Italy, the kings of Spain and Belgium and the Grand Duke of Luxemburg.
Biography
Born at the Palace of Versailles, he was one of seven children born to his parents, and their only son to live past the age of 5. At the age of 8, on 30 June 1704, he was baptised. Held at Versailles, King Louis XIV had Mary of Modena as the guest of honour at the ceremony; Mary was the widow of the exiled King James II of England.
Louis was often described as being "hideous"; he was humpbacked and very unattractive.
At the age of 13 his father died in Paris (22 February 1709) and Louis Armand succeeded to the Conti title and wealth, although there was no real principality. On 1 January 1711, Louis Armand was made a knight of the Order of the Holy Spirit.
On 9 July 1713, Louis Armand married his maternal first cousin, Louise Élisabeth de Bourbon, known as Mademoiselle de Bourbon. Another proposed bride was her sister, Louise Anne de Bourbon. Louise Élisabeth was the daughter of Louis III, Prince of Condé and Louise-Françoise de Bourbon, a legitimised daughter of King Louis XIV and his famous mistress, Madame de Montespan.
The event, also took place at Versailles and was part of a double marriage; on the same day, his oldest sister, Marie Anne de Bourbon, married Louis Henri I, Prince of Condé, known as the Duke of Bourbon.
In the end, Louise Élisabeth's brother Charles, Count of Charolais, even proposed to Charlotte Aglaé, who is said to have considered the proposal but refused. Charlotte Aglaé herself married the Duke of Modena in 1720, in the presence of Louis Armand and Louis Élisabeth.
The marriage of Louis Armand and Louise Élisabeth would later become stormy.
Louise Élisabeth was known to have been unfaithful to her husband, a liaison with the handsome Philippe Charles de La Fare was well known at court. In August 1716, Louis Armand caught Smallpox; it was Louise Élisabeth who would nurse him until his recovery. Louise Élisabeth later caught the illness herself but survived the disease.
It was at this time that Louis Armand found out about Louise Élisabeth's affair with Monsieur de La Fare. He is reported to have hurt his wife to the point that she had to see a doctor on two separate occasions. Louise Élisabeth stayed at the Palais Bourbon which was her mothers private home in Paris. She also stayed at a convent in the capital. At the birth of their second son in 1717, Louis Armand said to her that he did not care for the child as he could not have been his; in turn, the proud Louise Élisabeth replied that she did not care for the child either because he was his.
Louise Élisabeth and Louis Armand had to go to many court hearings in Paris. In 1725, she consented to return to the Prince of Conti, who had her confined to the Château de l'Isle-Adam. She was able later, however, to convince him to allow her to return to Paris in order to give birth to her daughter. It was while in Paris she gave birth to their only daughter Louise Henriette.
He was treated with great liberality by King Louis XIV, and also by the Regent, Philippe II, Duke of Orléans. Louis Armand was a prominent supporter of the financial schemes of John Law, by which he made large sums of money.
It was during the Regency of 1715–1723, Louis Armand was appointed a member of the Regency council itself as well as a member of the Council of War. In April 1717 he received the government of the Poitou region of France. This appointment came with a wage of 45,000 Livres.
He served under Marshal Villars in the War of the Spanish Succession, but he lacked the soldierly qualities of his father.
Louis Armand died at the Hôtel de Conti (quai Conti) in Paris due to a "chest swelling".
Issue
Ancestry
References
|-
1696 births
1727 deaths
House of Bourbon-Conti
Princes of Conti
Counts of La Marche
People from Versailles
18th-century French people
17th-century French people
People of the Regency of Philippe d'Orléans
People of the Ancien Régime
Princes of France (Bourbon)
Princes of Orange
French military personnel of the War of the Spanish Succession
French military personnel of the War of the Quadruple Alliance
18th-century peers of France
Dukes of Mercœur |
Meiliana Jauhari (born 7 May 1984) is a badminton player from Indonesia. She won the women's doubles title at the 2009 and 2013 Indonesian National Championships. Jauhari participated at the 2010 Asian Games and 2012 Summer Olympics.
Career
Jauhari trained at the Djarum badminton club, and has joined the club since 2002.
Jauhari competed in the women's doubles in the BWF Super Series at the 2008 Indonesia Super Series, the 2009 Malaysia Super Series, and the 2009 Korea Open Super Series with her partner, Shendy Puspa Irawati. She won a BWF Grand Prix title at the 2008 Vietnam Open.
Partnered with Greysia Polii in the women's doubles, surprisingly, the first time they played together, they beat Korean pair Ha Jung-eun and Lee Kyung-won, 21-14, 21-12. At the 2010 All England Super Series, they reached the quarterfinals after defeating 4th-seeded Malaysian pair Chin Eei Hui and Wong Pei Tty in straight sets. In the quarterfinals, they played a rubber set against Pan Pan and Tian Qing from China but lost 23-25, 21-17, 17-21. They played at the Uber Cup but they lost to Ma Jin and Wang Xiaoli of China in the semifinals. They were the runners-up of the 2010 Macau Open Grand Prix Gold after losing to Cheng Wen-hsing and Chien Yu-chin of Chinese Taipei in the rubber games.
At the 2012 Summer Olympics, Jauhari and her partner Polii, along with Jung Kyung-eun and Kim Ha-na, Ha Jung-eun and Kim Min-jung of South Korea, and Wang Xiaoli and Yu Yang of China were disqualified from the competition for "not using one's best efforts to win a match" and "conducting oneself in a manner that is clearly abusive or detrimental to the sport" following matches the previous evening during which they were accused of trying to lose in order to manipulate the draw. Jauhari and her partner Greysia Polii played against South Korea's Ha Jung-eun and Kim Min-jung. Indonesia filed an appeal to the case, but it was withdrawn.
Achievements
Southeast Asian Games
Women's doubles
BWF Grand Prix (2 titles, 8 runners-up)
The BWF Grand Prix had two levels, the Grand Prix and Grand Prix Gold. It was a series of badminton tournaments sanctioned by the Badminton World Federation (BWF) and played between 2007 and 2017. The World Badminton Grand Prix has been sanctioned by the International Badminton Federation from 1983 to 2006.
Women's doubles
BWF Grand Prix Gold tournament
BWF Grand Prix tournament
BWF International Challenge/Series (11 titles, 6 runners-up)
Women's doubles
Mixed doubles
BWF International Challenge tournament
BWF International Series tournament
Performance timeline
National team
Senior level
Individual competitions
Senior level
References
External links
1984 births
Living people
Badminton players from Jakarta
Indonesian female badminton players
Badminton players at the 2012 Summer Olympics
Olympic badminton players for Indonesia
Badminton players at the 2010 Asian Games
Asian Games bronze medalists for Indonesia
Asian Games medalists in badminton
Medalists at the 2010 Asian Games
Competitors at the 2009 SEA Games
SEA Games silver medalists for Indonesia
SEA Games bronze medalists for Indonesia
SEA Games medalists in badminton
21st-century Indonesian women |
```c++
#include <ATen/FunctionalTensorWrapper.h>
#include <ATen/FunctionalInverses.h>
#include <ATen/TensorUtils.h>
#include <ATen/WrapDimUtils.h>
#include <ATen/core/IListRef.h>
#include <ATen/core/LegacyTypeDispatch.h>
#include <c10/util/Exception.h>
#include <c10/util/irange.h>
#ifndef AT_PER_OPERATOR_HEADERS
#include <ATen/Functions.h>
#else
#include <ATen/ops/_propagate_xla_data.h>
#include <ATen/ops/_to_copy.h>
#endif
namespace at {
void FunctionalTensorWrapper::set_constructor_metadata() {
TORCH_INTERNAL_ASSERT(value_.defined());
// Note: "level" is a concept that we don't know how to compute in core.
// For now I'm retroactively setting this in functorch,
// but once Open Multiple Dispatch lands we should be able to calculate this in core.
level_ = -1;
// mirror all of the generic tensor metadata onto the wrapper
copy_generic_tensor_metadata(value_.getIntrusivePtr().get(), this);
refresh_numel();
refresh_contiguous();
storage_access_should_throw_ = false;
// In general, the sizes/stride metadata on a tensor can change as it is mutated,
// and these changes need to be reflected in the metadata of the wrapper.
set_allow_tensor_metadata_change(true);
key_set_ = c10::DispatchKeySet(c10::DispatchKey::Functionalize) | value_.key_set();
// All of the keys corresponding to functorch transforms should not be copied over.
// Functorch transforms all have their own wrapper tensors (e.g. BatchedTensorImpl) which expect
// to participate in the functorch transforms.
key_set_ = key_set_ - c10::functorch_transforms_ks - c10::python_ks;
// We override a bunch of _custom(), so make sure they get called
// TODO: metadata copying may not actually be necessary then
set_custom_sizes_strides(SizesStridesPolicy::CustomSizes);
set_custom_device(true);
// E.g. when running torch.compile under inference mode, we need to make sure that
// for any inputs that were created outside of inference mode (so they are not inference tensors),
// then the functional wrappers that we wrap them with should also not be inference tensors.
version_counter_ = value_.unsafeGetTensorImpl()->version_counter();
}
FunctionalTensorWrapper::FunctionalTensorWrapper(const Tensor& value)
: c10::TensorImpl(
c10::Storage(c10::make_intrusive<functionalization::FunctionalStorageImpl>(value)),
c10::DispatchKeySet(DispatchKey::Functionalize) | value.key_set(),
value.dtype()
),
value_(value)
{
TORCH_INTERNAL_ASSERT(!at::functionalization::impl::isFunctionalTensor(value_));
TORCH_INTERNAL_ASSERT(!value_.key_set().has(c10::DispatchKey::Functionalize));
set_constructor_metadata();
}
void FunctionalTensorWrapper::freeze_storage() const {
functional_storage_impl()->freeze();
}
// Note [Functionalization: Alias Removal]
// When someone calls a view() op during the functionalization pass, e.g. 'b = a.view(...)',
// we link `b` and `a` to a shared Alias object to preserve the aliasing relationship.
//
// How do we do that?
//
// Every FunctionalTensorWrapper contains a dummy FunctionalStorageImpl, which subclasses from c10::StorageImpl.
// It doesn't contain any data (similar to MetaTensor storage), but it contains an Alias object that knows about the base tensor.
// When a tensor is created through a view operation, both the new and old tensor point to the same FunctionalStorageImpl.
//
// As mutations are applied to any of the views, we also queue each mutation up on the Alias object, so we can replay them.
// When the user requests a tensor that's had a view taken, we check if it's up to date.
// If it's not up to date, we first replay all of the queued up mutations onto the alias, and then re-apply the current view
// on top of the newly updated alias.
//
// Why do we queue up and lazily run mutations on the alias, instead of updating the alias eagerly?
// This behavior was taken from pytorch/xla, which the alias-removal logic was inspired from.
// One benefit of the laziness is that we save work in the cases where a user has multiple views and mutates one of them,
// but never uses the other views later in the program (in which case we'll never update the alias).
// It also has downsides though: repeatedly applying mutations to the same view without syncing
// will silently use up more and more memory as more mutations are queued up.
//
// Corresponding diagram:
//
// b = a.view(...)
//
// a b
// | | If the user asks for b and its out of date,
// \/ \/ We regenerate b by replaying its views from the alias.
// . - - - - - - - - - - - - - . . - - - - - - - - - - - - - .
// | FunctionalTensorWrapper | | FunctionalTensorWrapper |
// . - - - - - - - - - - - - - . . - - - - - - - - - - - - - .
// | value | storage | | storage | Value |
// . - - - - - - - - - - - - - . . - - - - - - - - - - - - - .
// | \ / |
// | \ / |
// | . - - - - - - - - - - - - . |
// | | FunctionalStorageImpl | |
// | . - - - - - - - - - - - - . |
// | | Alias | |
// | . - - - - - - - - - - - - . |
// | / mutations to a or b |
// | / are queued onto Alias |
// | / |
// \/ / \/
// . - - - - - - - - - - - - - . . - - - - - - - - - - - - - - - .
// | TensorImpl | | TensorImpl |
// . - - - - - - - - - - - - - . . - - - - - - - - - - - - - - - .
// | value | storage | | storage | Value |
// . - - - - - - - - - - - - - . . - - - - - - - - - - - - - - - .
// | |
// | |
// | |
// | In this picture the two tensor views their own storages, |
// | have their own storages, but backends like functorch |
// \/ are allowed to re-alias underneath the pass \/
// . - - - - - - - - - - - - - . . - - - - - - - - - - - - - - - .
// | underyling_storage | | underyling_storage |
// . - - - - - - - - - - - - - . . - - - - - - - - - - - - - - - .
//
// This constructor is only used by view ops.
// - view_value: The output tensor that we need to wrap.
// - base: The "base" of the view that `view_value` was generated from.
// See Note [Functionalization: Alias Removal Part 2] for more details on the mutation replay logic.
FunctionalTensorWrapper::FunctionalTensorWrapper(const Tensor& view_value, const FunctionalTensorWrapper* base, const functionalization::ViewMeta& meta)
: c10::TensorImpl(
c10::DispatchKeySet(DispatchKey::Functionalize),
view_value.dtype(),
view_value.device()
),
value_(view_value),
is_multi_output_view_(base->is_multi_output_view_ || meta.is_multi_output),
was_storage_changed_(base->was_storage_changed_),
is_symbolic_(base->is_symbolic_)
{
TORCH_INTERNAL_ASSERT(!at::functionalization::impl::isFunctionalTensor(value_));
TORCH_INTERNAL_ASSERT(!value_.key_set().has(c10::DispatchKey::Functionalize));
set_constructor_metadata();
// Copy the original tensor's ViewMeta vector and push the current one.
if (!base->view_metas_.empty()) {
view_metas_ = base->view_metas_; // copy
}
view_metas_.push_back(meta);
maybe_mark_symbolic(meta);
storage_ = base->storage_; // alias this tensor's storage with the base tensor's
}
functionalization::FunctionalStorageImpl* FunctionalTensorWrapper::functional_storage_impl() const {
return static_cast<functionalization::FunctionalStorageImpl*>(storage_.unsafeGetStorageImpl());
}
void FunctionalTensorWrapper::commit_update() {
auto storage_impl = functional_storage_impl();
storage_impl->add_update(value_, view_metas_);
// As an optimization, we used to mark the tensor here as "up-to-date",
// That way, code like:
// x = torch.ones(1'000'000)
// x[0].add_(1)
// doesn't result in an unnecessary materialization of the base.
// This optimization results in the slice temporarily haven't incorrect
// stride/storage_offset though, and DCE should handle that optimization anyway.
// generation_ = storage_impl->generation();
}
bool FunctionalTensorWrapper::is_up_to_date() const {
auto alias_generation = functional_storage_impl()->generation();
return generation_ == alias_generation;
}
// See Note [Functionalization Pass - Inplace View Ops]
void FunctionalTensorWrapper::mutate_view_meta(const at::functionalization::ViewMeta& meta) {
view_metas_.push_back(meta);
// Manually track the fact that this tensor recieved a metadata mutation!
has_metadata_mutation_ = true;
// Mark this tensor as being symbolic if there are any symbolic inputs used by the view operation.
maybe_mark_symbolic(meta);
// Note [Functionalization Pass - Inplace View Ops]
// So, these ops are special - they're mutation AND view ops. They get special codegen.
// An example is transpose_, e.g. `a.transpose_()`
// Calling transpose_() should ensure that a gets an alias, and append the new ViewMeta to a's current list of ViewMetas.
at::AutoDispatchSkipFunctionalize guard;
value_ = meta.forward_fn(value_, meta.out_index);
TORCH_INTERNAL_ASSERT(!value_.key_set().has(c10::DispatchKey::Functionalize));
}
// Note [Functionalization: Mutation Removal]
// Mutation removal is used to take a program like this:
//
// a.add_(b)
//
// and replace it with a slightly different program that has the same semantics:
//
// tmp = a.add(b)
// a.replace_(tmp)
//
// Where the replace_() call is implemented directly in the functionalization pass, so it is transparent to the backend.
// This is useful for backends that aren't able to handle certain types of mutations, like functorch.
//
// Why do we need to wrap every tensor in a FunctionalTensorWrapper? Consider this program:
//
// Before:
// tensor.add_(batched_tensor)
//
// After:
// tmp = tensor.add(batched_tensor)
// tensor.replace_(tmp)
//
// In the above, tmp is a batched tensor (because adding a normal tensor to a batched tensor does broadcasting and creates a batched tensor).
// But we can't just replace the underlying memory backing `tensor` with `tmp` - a batched tensor takes up more space!
// Instead, every input, intermediate and output of the program is wrapped in a FunctionalTensorImpl, which wraps the underlying tensor.
void FunctionalTensorWrapper::replace_(const Tensor& other, bool from_lazy_regenerate) {
// TODO: going to need to change this if we want nested functionalize() transforms.
TORCH_INTERNAL_ASSERT(!at::functionalization::impl::isFunctionalTensor(other));
value_ = other;
TORCH_INTERNAL_ASSERT(!value_.key_set().has(c10::DispatchKey::Functionalize));
// out= ops are allowed to resize the output tensors, mutating both the data and metadata of the tensor.
// We need to propagate that metadata mutation to the wrapper (new size).
auto sizes_ = value_.sym_sizes();
auto strides_ = value_.sym_strides();
auto storage_offset_ = value_.sym_storage_offset();
set_sizes_and_strides(sizes_, strides_, storage_offset_);
if (dtype() != value_.unsafeGetTensorImpl()->dtype() || layout() != value_.unsafeGetTensorImpl()->layout()) {
// .to() should not re-entrantly go through functionalization.
at::AutoDispatchSkipFunctionalize guard;
// and we want _to_copy() to show up in the graph, not the composite .to() operator
// (this can happen if autograd has already run by the time we enter this code)
value_ = at::_to_copy(value_, c10::TensorOptions().dtype(dtype()).layout(layout()));
TORCH_INTERNAL_ASSERT(!value_.key_set().has(c10::DispatchKey::Functionalize));
}
// might not be until after the no_grad region is exited.
// Therefore, replace_() is not unconditionally safe to check the current no_grad state.
// If this is a lazy regeneration, then it is guaranteed that we have already
// done the mutation for the storage alias (when we originally performed the mutation),
// so no counter update may be needed.
// Example: if a mutation happens to a view under a no_grad,
// we won't call replace_() on the other alias until the alias is later used, which
if (!from_lazy_regenerate) {
mark_mutation();
if (!at::GradMode::is_enabled() || InferenceMode::is_enabled()) {
// This mutation happened under no_grad or inference_mode
mark_mutation_during_no_grad_or_inference_mode();
}
}
}
bool FunctionalTensorWrapper::has_data_mutation() {
// Current tensor's data was mutated if its storage saw any mutations.
return functional_storage_impl()->generation() > 0;
}
void FunctionalTensorWrapper::set__impl(const FunctionalTensorWrapper* other) {
// self.set_(src) will cause self to have all of the tensor properties of self.
value_ = other->value_;
generation_ = other->generation_;
view_metas_ = other->view_metas_;
is_symbolic_ = other->is_symbolic_;
// FREEZE the old storage, preventing mutations to it.
// this is a huge pain to handle properly in all cases, so we ban it.
functional_storage_impl()->freeze();
// Unsafely swap out the storage with other's storage,
// disconnecting `self` with its view chain
storage_ = other->storage_;
/// explicitly mark the tensor as having its storage changed from set_()
// Otherwise, we don't actually have a 100% accurate way to check this.
// (We could check if the updated value has a new storage than the original value,
// but this won't also let us uniquely determine if the tensor **also**
// experienced a data mutation).
was_storage_changed_ = true;
auto sizes_ = value_.sym_sizes();
auto strides_ = value_.sym_strides();
auto storage_offset_ = value_.sym_storage_offset();
set_sizes_and_strides(sizes_, strides_, storage_offset_);
}
void FunctionalTensorWrapper::storage_resize_(const c10::SymInt& new_size) {
auto curr_storage_size = value_.unsafeGetTensorImpl()->unsafe_storage().unsafeGetStorageImpl()->sym_nbytes();
// storage resizing is severely limited: we only support resizing either to zero, or from zero bytes.
TORCH_CHECK(new_size == 0 || curr_storage_size == 0, "new_size: ", new_size, ". curr_storage_size: ", curr_storage_size);
// The "functionalization rule" for storage resizing is a giant no-op, mainly because we don't want
// resize_() calls to actualy emit any ops in the functional graph.
// How does it work?
// Resizing up (old size == 0):
// We do nothing in this case.
// The expection is that for the user code to be valid, the next op that should run against the current tensor "x"
// will be a x.copy_(y) (or similar), that will fully overwrite the data of x.
// If there are any outstanding aliases of x, we expect them not to be used until after the copy_() call
// (otherwise the eager code would be invalid),
// and therefore functionalization will regenerate the aliases off of the result of `x.copy(y)`.
// Resizing down (new size == 0):
// We also do nothing in this case. The assumption is that after resizing a tensor down,
// it is fully unused in the program (unless it is later resized back up first, has data copied in)
// Although it might be saved for backward, which happens in FSDP.
// The expected pattern is that the param will then be resized back up from zero in the backward.
// Mark the tensor as having its storage resized.
// This is so we can detect it for inputs in AOTAutograd and error / emit
// an input mutation resize_() appropriately
functional_storage_impl()->mark_inductor_storage_resize(new_size);
}
void FunctionalTensorWrapper::maybe_replace_storage(const Tensor& other) {
// Note [resize_() in functionalization pass]
// resize_() is a special operator in functionalization because it can reallocate its underlying storage.
// This function is only ever called in the case that resize_() needs to reallocate its storage to a larger size.
//
// However, functionalization currently bans the following code:
// a = torch.ones(2)
// b = a.view(2)
// b.resize_(4) # b is a view tensor, that we are trying to increase the storage size of
//
// Why is this code difficult to handle?
// The functionalization pass currently keeps aliases in sync by making the following assumptions:
// - The base tensor always refers to all of the data
// - Whenever you have b = view_op(a), b should always refer to a subset of as memory.
//
// The code above breaks that assumption b.resize_(4) actually needs to update "a"
// to tell it that it is now actually some slice of a pre-existing larger storage.
// We're also no longer re-generate "b" fully from "a" anymore, since "a" refers to a slice of "b"'s data.
//
// This is probably fixable in theory, but:
// - the fix would likey complicated the functionalization logic quite a bit.
// - the primary use case for resize_() today is resizing zero-sized tensors in out= variants of operators
// - resize_() also can give you weird results today if you try to resize_() a weirdly strided tensor.
//
// Given all of the above, for now we're just banning the above usage.
TORCH_CHECK(storage().use_count() == 1, "Attempted to resize a view tensor to a larger size. This is not allowed in the functionalization pass");
TORCH_CHECK(view_metas_.empty(), "Attempted to resize a view tensor to a larger size. This is not allowed in the functionalization pass");
// If this tensor is not a view (and has no outstanding views taken out on it),
// Then it's safe to throw out the old storage and replace it with the new, larger one.
storage_ = c10::Storage(c10::make_intrusive<functionalization::FunctionalStorageImpl>(other));
value_ = other;
TORCH_INTERNAL_ASSERT(!value_.key_set().has(c10::DispatchKey::Functionalize));
generation_ = 0;
// And update the metadata on the wrapper to reflect the new sizes and strides
set_sizes_and_strides(value_.sizes(), value_.strides());
refresh_numel();
// (Technically we should be guaranteed that the tensor was already contiguous,
// since it's guaranteed not to have been a view. Doesnt hurt to run though)
refresh_contiguous();
// Swapping out the storage of a tensor (aka from a resize_() call) will update the sizes and strides of the tensor,
// so we need to record the fact that metadata was mutated.
has_metadata_mutation_ = true;
}
void FunctionalTensorWrapper::_unsafe_reset_storage() {
// Reset the storage with the current value_ tensor as the base
storage_ = c10::Storage(c10::make_intrusive<functionalization::FunctionalStorageImpl>(value_));
// Reset the generation so that it matches the new storage
generation_ = 0;
// Clear any pre-existing view metas so that base and value_ are semantically the same
view_metas_.clear();
}
void FunctionalTensorWrapper::sync_() {
if (is_up_to_date()) {
return;
}
apply_updates();
regenerate_from_base();
}
Tensor FunctionalTensorWrapper::apply_view_metas(const Tensor& base) {
auto t = base;
// Reapply views to get the viewed tensor from the base in alias_
for (auto& view_meta: view_metas_) {
t = view_meta.forward_fn(t, view_meta.out_index);
}
return t;
}
void FunctionalTensorWrapper::regenerate_from_base() {
at::AutoDispatchSkipFunctionalize guard;
auto storage_impl = functional_storage_impl();
auto t = storage_impl->base();
TORCH_INTERNAL_ASSERT(!at::functionalization::impl::isFunctionalTensor(t));
t = apply_view_metas(t);
TORCH_INTERNAL_ASSERT(!at::functionalization::impl::isFunctionalTensor(t));
replace_(t, /*from_lazy_regenerate=*/true);
generation_ = storage_impl->generation();
}
bool FunctionalTensorWrapper::apply_updates() {
// Apply all updates on alias_
auto storage_impl = functional_storage_impl();
return storage_impl->apply_updates();
}
const char* FunctionalTensorWrapper::tensorimpl_type_name() const {
return "FunctionalTensorWrapper";
}
void FunctionalTensorWrapper::copy_tensor_metadata(
const FunctionalTensorWrapper* src_impl,
FunctionalTensorWrapper* dest_impl,
const c10::VariableVersion& version_counter,
bool allow_tensor_metadata_change) {
TensorImpl::copy_tensor_metadata(
src_impl,
dest_impl,
version_counter,
allow_tensor_metadata_change);
// FunctionalTensorWrapper-specific fields.
dest_impl->value_ = src_impl->value_;
dest_impl->level_ = src_impl->level_;
dest_impl->has_metadata_mutation_ = src_impl->has_metadata_mutation_;
dest_impl->is_multi_output_view_ = src_impl->is_multi_output_view_;
dest_impl->was_storage_changed_ = src_impl->was_storage_changed_;
dest_impl->is_symbolic_ = src_impl->is_symbolic_;
dest_impl->generation_ = src_impl->generation_;
dest_impl->view_metas_ = src_impl->view_metas_;
}
void FunctionalTensorWrapper::copy_tensor_metadata_and_refresh(
const FunctionalTensorWrapper* src_impl,
FunctionalTensorWrapper* dest_impl,
const c10::VariableVersion& version_counter,
bool allow_tensor_metadata_change) const {
copy_tensor_metadata(src_impl, dest_impl, version_counter, allow_tensor_metadata_change);
dest_impl->refresh_numel();
dest_impl->refresh_contiguous();
}
template <typename VariableVersion>
c10::intrusive_ptr<TensorImpl> FunctionalTensorWrapper::shallow_copy_and_detach_core(
VariableVersion&& version_counter,
bool allow_tensor_metadata_change) const {
if (key_set_.has(DispatchKey::Python) &&
!c10::impl::tls_is_dispatch_key_excluded(DispatchKey::Python)) {
auto r = pyobj_slot_.load_pyobj_interpreter()->detach(this);
if (r) {
r->set_version_counter(std::forward<VariableVersion>(version_counter));
r->set_allow_tensor_metadata_change(allow_tensor_metadata_change);
return r;
}
}
auto impl = c10::make_intrusive<FunctionalTensorWrapper>(value_);
copy_tensor_metadata_and_refresh(
/*src_impl=*/this,
/*dest_impl=*/impl.get(),
/*version_counter=*/std::forward<VariableVersion>(version_counter),
/*allow_tensor_metadata_change=*/allow_tensor_metadata_change);
return impl;
}
c10::intrusive_ptr<TensorImpl> FunctionalTensorWrapper::shallow_copy_and_detach(
const c10::VariableVersion& version_counter,
bool allow_tensor_metadata_change) const {
return shallow_copy_and_detach_core(
version_counter, allow_tensor_metadata_change);
}
c10::intrusive_ptr<TensorImpl> FunctionalTensorWrapper::shallow_copy_and_detach(
c10::VariableVersion&& version_counter,
bool allow_tensor_metadata_change) const {
return shallow_copy_and_detach_core(
std::move(version_counter), allow_tensor_metadata_change);
}
void FunctionalTensorWrapper::shallow_copy_from(const c10::intrusive_ptr<TensorImpl>& impl) {
AT_ASSERT(has_compatible_shallow_copy_type(impl->key_set()));
auto functional_impl =
static_cast<FunctionalTensorWrapper*>(impl.get());
copy_tensor_metadata_and_refresh(
/*src_impl=*/functional_impl,
/*dest_impl=*/this,
/*version_counter=*/version_counter(),
/*allow_tensor_metadata_change=*/allow_tensor_metadata_change());
}
c10::Device FunctionalTensorWrapper::device_custom() const {
return value_.unsafeGetTensorImpl()->device();
}
at::IntArrayRef FunctionalTensorWrapper::sizes_custom() const {
return value_.unsafeGetTensorImpl()->sizes();
}
at::IntArrayRef FunctionalTensorWrapper::strides_custom() const {
return value_.unsafeGetTensorImpl()->strides();
}
int64_t FunctionalTensorWrapper::dim_custom() const {
return value_.unsafeGetTensorImpl()->dim();
}
int64_t FunctionalTensorWrapper::numel_custom() const {
return value_.unsafeGetTensorImpl()->numel();
}
bool FunctionalTensorWrapper::is_contiguous_custom(at::MemoryFormat memory_format) const {
return value_.unsafeGetTensorImpl()->is_contiguous(memory_format);
}
c10::SymIntArrayRef FunctionalTensorWrapper::sym_sizes_custom() const {
return value_.unsafeGetTensorImpl()->sym_sizes();
}
c10::SymIntArrayRef FunctionalTensorWrapper::sym_strides_custom() const {
return value_.unsafeGetTensorImpl()->sym_strides();
}
c10::SymInt FunctionalTensorWrapper::sym_size_custom(int64_t d) const {
return value_.unsafeGetTensorImpl()->sym_size(d);
}
c10::SymInt FunctionalTensorWrapper::sym_storage_offset_custom() const {
return value_.unsafeGetTensorImpl()->sym_storage_offset();
}
c10::Layout FunctionalTensorWrapper::layout_impl() const {
return value_.unsafeGetTensorImpl()->layout();
}
namespace functionalization {
namespace impl {
Tensor to_functional_tensor(const Tensor& tensor) {
// Note [Wrapped Numbers <> Functionalization]
if (tensor.unsafeGetTensorImpl()->is_wrapped_number()) {
return tensor;
}
TORCH_INTERNAL_ASSERT_DEBUG_ONLY(!isFunctionalTensor(tensor));
return at::detail::make_tensor<FunctionalTensorWrapper>(tensor);
}
std::optional<Tensor> to_functional_tensor(const std::optional<Tensor>& tensor) {
if (tensor.has_value()) {
return std::make_optional<Tensor>(to_functional_tensor(*tensor));
}
return std::nullopt;
}
c10::List<::std::optional<Tensor>> to_functional_tensor(const c10::List<::std::optional<Tensor>>& t_list) {
c10::List<::std::optional<Tensor>> outputs;
outputs.reserve(t_list.size());
for (const auto i : c10::irange(t_list.size())) {
outputs.push_back(to_functional_tensor(t_list[i]));
}
return outputs;
}
std::vector<Tensor> to_functional_tensor(ITensorListRef t_list) {
std::vector<Tensor> outputs;
outputs.reserve(t_list.size());
for (const auto& tensor : t_list) {
outputs.push_back(to_functional_tensor(tensor));
}
return outputs;
}
Tensor from_functional_tensor(const Tensor& tensor, bool assert_functional) {
// Note [Wrapped Numbers <> Functionalization]
if (!tensor.defined() || tensor.unsafeGetTensorImpl()->is_wrapped_number()) {
return tensor;
}
if (isFunctionalTensor(tensor)) {
auto impl = unsafeGetFunctionalWrapper(tensor);
return impl->value();
} else {
// If the current tensor is not functional, then raise an error
// if assert_functional is true. Otherwise, return the input.
TORCH_INTERNAL_ASSERT(!assert_functional)
return tensor;
}
}
std::optional<Tensor> from_functional_tensor(const std::optional<Tensor>& t, bool assert_functional) {
if (t.has_value()) {
return std::make_optional<Tensor>(from_functional_tensor(*t, assert_functional));
}
return std::nullopt;
}
std::vector<Tensor> from_functional_tensor(ITensorListRef t_list) {
std::vector<Tensor> outputs;
outputs.reserve(t_list.size());
for (const auto& tensor : t_list) {
// from_functional_tensor(Tensor) has asserts to make sure you don't accidentally call
// it on a non-functional input,
// but from_functional_tensor(TensorList) can recieve a list containing both
// functional and non-functional tensors.
// Example of when that can happen: torch.cat(function_input_tensor, global_state_tensor).
// When that happens, we're okay with only unwrapping the functional tensors.
outputs.push_back(from_functional_tensor(tensor, /*assert_functional=*/false));
}
return outputs;
}
c10::List<::std::optional<Tensor>> from_functional_tensor(const c10::List<::std::optional<Tensor>>& t_list) {
c10::List<::std::optional<Tensor>> outputs;
outputs.reserve(t_list.size());
for (const auto i : c10::irange(t_list.size())) {
outputs.push_back(from_functional_tensor(t_list[i], /*assert_functional=*/false));
}
return outputs;
}
void sync(const Tensor& t) {
if (t.unsafeGetTensorImpl()->is_wrapped_number()) {
// Note [Wrapped Numbers <> Functionalization]
// Unfortunately, we can't easily guarantee that wrapped numbers (scalar-tensors)
// get wrapped up in a FunctionalTensorWrapper object, since they skip the dispatcher.
// That shouldn't matter, since I don't think we're allowed to assign to wrapped numbers anyway.
return;
}
// Not every tensor that hits a functionalization kernel is necessarily a functional tensor.
// For example, xla_tensor.copy_(cpu_tensor) needs to hit the functionalization kernel
// to sync xla_tensor, but not cpu_tensor.
if (!at::functionalization::impl::isFunctionalTensor(t)) {
return;
}
auto functional_impl = at::functionalization::impl::unsafeGetFunctionalWrapper(t);
functional_impl->sync_();
}
void sync(const std::optional<Tensor>& t) {
if (t.has_value()) {
sync(*t);
}
}
void sync(ITensorListRef t_list) {
for (const auto& t : t_list) {
sync(t);
}
}
void sync(const c10::List<::std::optional<Tensor>>& t_list) {
for (const auto i : c10::irange(t_list.size())) {
sync(t_list[i]);
}
}
void replace_(const Tensor& functional_tensor, const Tensor& other) {
TORCH_INTERNAL_ASSERT_DEBUG_ONLY(isFunctionalTensor(functional_tensor));
unsafeGetFunctionalWrapper(functional_tensor)->replace_(other);
}
void replace_(const ITensorListRef functional_tensor, ITensorListRef other) {
TORCH_INTERNAL_ASSERT_DEBUG_ONLY(functional_tensor.size() == other.size());
auto functional_tensor_it = functional_tensor.begin();
auto other_it = other.begin();
for (C10_UNUSED const auto i : c10::irange(functional_tensor.size())) {
replace_(*functional_tensor_it++, *other_it++);
}
}
void propagate_xla_data(const Tensor& functional_tensor, const Tensor& other) {
TORCH_INTERNAL_ASSERT_DEBUG_ONLY(isFunctionalTensor(functional_tensor));
if (functional_tensor.key_set().has(c10::DispatchKey::XLA)) {
at::_propagate_xla_data(at::functionalization::impl::unsafeGetFunctionalWrapper(functional_tensor)
->value(), other);
}
}
void propagate_xla_data(const ITensorListRef functional_tensor, ITensorListRef other) {
TORCH_INTERNAL_ASSERT_DEBUG_ONLY(functional_tensor.size() == other.size());
auto functional_tensor_it = functional_tensor.begin();
auto other_it = other.begin();
for (C10_UNUSED const auto i : c10::irange(functional_tensor.size())) {
propagate_xla_data(*functional_tensor_it++, *other_it++);
}
}
void propagate_xla_data_direct(const Tensor& tensor, const Tensor& other) {
if (tensor.key_set().has(c10::DispatchKey::XLA)) {
at::_propagate_xla_data(tensor, other);
}
}
void propagate_xla_data_direct(const ITensorListRef tensor,
ITensorListRef other) {
auto tensor_it = tensor.begin();
auto other_it = other.begin();
for (C10_UNUSED const auto i : c10::irange(tensor.size())) {
propagate_xla_data_direct(*tensor_it++, *other_it++);
}
}
void commit_update(const Tensor& functional_tensor) {
TORCH_INTERNAL_ASSERT_DEBUG_ONLY(isFunctionalTensor(functional_tensor));
unsafeGetFunctionalWrapper(functional_tensor)->commit_update();
}
void commit_update(ITensorListRef functional_tensor) {
for (const auto& t : functional_tensor) {
commit_update(t);
}
}
void unsafe_reset_storage(const Tensor& functional_tensor) {
TORCH_INTERNAL_ASSERT_DEBUG_ONLY(isFunctionalTensor(functional_tensor));
unsafeGetFunctionalWrapper(functional_tensor)->_unsafe_reset_storage();
}
void mark_mutation_hidden_from_autograd(const Tensor& functional_tensor) {
TORCH_CHECK(isFunctionalTensor(functional_tensor));
unsafeGetFunctionalWrapper(functional_tensor)->mark_mutation_hidden_from_autograd();
}
bool are_all_mutations_hidden_from_autograd(const Tensor& functional_tensor) {
TORCH_CHECK(isFunctionalTensor(functional_tensor));
return unsafeGetFunctionalWrapper(functional_tensor)->are_all_mutations_hidden_from_autograd();
}
bool are_all_mutations_under_no_grad_or_inference_mode(const Tensor& functional_tensor) {
TORCH_CHECK(isFunctionalTensor(functional_tensor));
return unsafeGetFunctionalWrapper(functional_tensor)->are_all_mutations_under_no_grad_or_inference_mode();
}
bool isFunctionalTensor(const at::Tensor& tensor) {
return tensor.unsafeGetTensorImpl()->key_set().has(c10::DispatchKey::Functionalize);
}
bool isFunctionalTensor(const std::optional<Tensor>& t) {
if (t.has_value()) {
return isFunctionalTensor(*t);
} else {
return false;
}
}
bool isFunctionalTensor(const c10::List<::std::optional<Tensor>>& t_list) {
if (t_list.empty()) return false;
auto functional_count = 0;
for (const auto i : c10::irange(t_list.size())) {
if (!t_list[i].has_value() || !t_list[i]->defined()) continue;
if (isFunctionalTensor(t_list[i])) {
++functional_count;
}
}
return functional_count > 0;
}
template <typename T>
bool isFunctionalTensorIListRef(c10::IListRef<T> list) {
if (list.size() == 0) return false;
auto functional_count = 0;
for (const auto& tensor : list) {
if (!tensor.defined()) continue;
if (isFunctionalTensor(tensor)) {
++functional_count;
}
}
return functional_count > 0;
}
bool isFunctionalTensor(ITensorListRef list) {
return isFunctionalTensorIListRef(list);
}
void freeze_functional_tensor(const Tensor& tensor) {
TORCH_INTERNAL_ASSERT(at::functionalization::impl::isFunctionalTensor(tensor));
auto functional_base_impl = at::functionalization::impl::unsafeGetFunctionalWrapper(tensor);
functional_base_impl->freeze_storage();
}
Tensor create_functional_tensor_with_view_meta(const at::Tensor& view_to_wrap, const at::Tensor& base, functionalization::ViewMeta meta, int64_t out_idx) {
TORCH_INTERNAL_ASSERT(!at::functionalization::impl::isFunctionalTensor(view_to_wrap));
TORCH_INTERNAL_ASSERT(at::functionalization::impl::isFunctionalTensor(base));
auto functional_base_impl = at::functionalization::impl::unsafeGetFunctionalWrapper(base);
if (out_idx != 0) {
// Note [out_idx in ViewMeta]
// When a view op outputs multiple tensors, each output needs its own separate ViewMeta.
// Each ViewMeta also tracks the index of the particular output tensor, which is needed in the reverse function.
meta = meta.to_out_idx(out_idx);
}
return at::detail::make_tensor<FunctionalTensorWrapper>(view_to_wrap, functional_base_impl, meta);
}
std::vector<Tensor> create_functional_tensor_with_view_meta(ITensorListRef view_to_wrap, const at::Tensor& base, const functionalization::ViewMeta& meta) {
std::vector<Tensor> outputs(view_to_wrap.size());
int64_t i = 0;
for (const auto& tensor : view_to_wrap) {
outputs[i] = create_functional_tensor_with_view_meta(tensor, base, meta, i);
i++;
}
return outputs;
}
void mutate_view_meta(const at::Tensor& self, const functionalization::ViewMeta& meta) {
TORCH_INTERNAL_ASSERT(at::functionalization::impl::isFunctionalTensor(self));
auto self_impl = at::functionalization::impl::unsafeGetFunctionalWrapper(self);
self_impl->mutate_view_meta(meta);
}
// Note [Propagating strides in the functionalization pass]
// In order to properly compute stride information, the functionalization pass
// calls each {view} reference implementations with meta tensors.
// The output meta tensor's stride info serves as a reference for what the correct strides should be.
void set_sizes_strides_offset(const Tensor& out, const Tensor& reference_out) {
out.unsafeGetTensorImpl()->set_sizes_and_strides(reference_out.sym_sizes(), reference_out.sym_strides(), reference_out.sym_storage_offset());
}
void set_sizes_strides_offset(const std::vector<Tensor>& outs, const std::vector<Tensor>& reference_outs) {
TORCH_INTERNAL_ASSERT(outs.size() == reference_outs.size());
for (const auto i : c10::irange(reference_outs.size())) {
set_sizes_strides_offset(outs[i], reference_outs[i]);
}
}
thread_local bool _functionalizationReapplyViews;
bool getFunctionalizationReapplyViewsTLS() {
return _functionalizationReapplyViews;
}
void setFunctionalizationReapplyViewsTLS(bool reapply_views) {
_functionalizationReapplyViews = reapply_views;
}
} // namespace impl
// Given an **out-of-place** op that might internally call view/inplace ops,
// This function will "functionalize" it.
// That is, it will call the operator, but removing any intermediate views/mutations
// that are performed inside of it.
// This is useful for LTC/XLA, which would like to re-use some of our composite kernels
// from pytorch core but not have to worry about the view ops that they might call.
// e.g. at::block_diag
void functionalize_op_helper(const c10::OperatorHandle& op, torch::jit::Stack* stack) {
const auto& schema = op.schema();
const auto num_arguments = schema.arguments().size();
const auto arguments_begin = stack->size() - num_arguments;
auto arguments = torch::jit::last(stack, num_arguments);
// Wrap all tensor-like inputs into FunctionalTensorWrappers.
// When we re-invoke the dispatcher, this will automatically enable the functionalization pass.
for (uint64_t idx = 0; idx < num_arguments; ++idx) {
const auto& ivalue = arguments[idx];
if (ivalue.isTensor()) {
const auto& t = ivalue.toTensor();
if (t.defined()) {
TORCH_INTERNAL_ASSERT(!at::functionalization::impl::isFunctionalTensor(t),
"The composite op functionalization fallback expects its inputs all not to be functional tensors");
auto t_new = c10::IValue(at::functionalization::impl::to_functional_tensor(t));
(*stack)[arguments_begin + idx] = t_new;
}
} else if (ivalue.isTensorList()) {
auto tensors = ivalue.toTensorList();
TORCH_INTERNAL_ASSERT(!at::functionalization::impl::isFunctionalTensor(tensors),
"The composite op functionalization fallback expects its inputs all not to be functional tensors");
auto t_new = c10::IValue(at::functionalization::impl::to_functional_tensor(tensors));
(*stack)[arguments_begin + idx] = t_new;
} else if (ivalue.isOptionalTensorList()) {
auto opt_tensors = ivalue.toOptionalTensorList();
TORCH_INTERNAL_ASSERT(!at::functionalization::impl::isFunctionalTensor(opt_tensors),
"The composite op functionalization fallback expects its inputs all not to be functional tensors");
auto t_new = c10::IValue(at::functionalization::impl::to_functional_tensor(opt_tensors));
(*stack)[arguments_begin + idx] = t_new;
}
}
{
// Today when you call at::empty(device=lazy), the lazy backend decides whether or not to wrap
// the output in a functional tensor based on TLS.
// In this code, we're re-entrantly entering functionalization in the same call-stack,
// so we need to manually fix up TLS as if it hadn't already been called.
auto curr_tls = c10::impl::tls_local_dispatch_key_set();
auto tls_reenable_functionalize = c10::impl::PODLocalDispatchKeySet();
tls_reenable_functionalize.set_included(curr_tls.included_);
tls_reenable_functionalize.set_excluded(curr_tls.excluded_.remove(c10::DispatchKey::Functionalize));
c10::impl::ForceDispatchKeyGuard guard_(tls_reenable_functionalize);
// So, we should probably provide a way to directly call a kernel registered to
// the `CompositeExplicitAutograd` key.
// We can't do that today, so this should be a reasonably good proxy
// (It won't work in cases where an op has both a CompositeExplicitAutograd kernel
// AND a dedicated meta kernel, but that probably shouldn't ever happen).
op.redispatchBoxed(c10::DispatchKeySet(c10::DispatchKey::Meta), stack);
}
const auto num_returns = schema.returns().size();
const auto returns_begin = stack->size() - num_returns;
auto returns = torch::jit::last(stack, num_returns);
for (const auto idx : c10::irange(num_returns)) {
const auto& ivalue = returns[idx];
if (ivalue.isTensor()) {
const auto& t = ivalue.toTensor();
if (!t.defined()) continue;
at::functionalization::impl::sync(t);
auto t_new = c10::IValue(at::functionalization::impl::from_functional_tensor(t));
(*stack)[returns_begin + idx] = t_new;
} else if (ivalue.isTensorList()) {
auto tensors = ivalue.toTensorList();
at::functionalization::impl::sync(tensors);
auto t_new = c10::IValue(at::functionalization::impl::from_functional_tensor(tensors));
(*stack)[returns_begin + idx] = t_new;
} else if (ivalue.isOptionalTensorList()) {
auto opt_tensors = ivalue.toOptionalTensorList();
at::functionalization::impl::sync(opt_tensors);
auto t_new = c10::IValue(at::functionalization::impl::from_functional_tensor(opt_tensors));
(*stack)[returns_begin + idx] = t_new;
}
}
}
} // namespace functionalization
} // namespace at
``` |
```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 prometheus
import (
"context"
"fmt"
"reflect"
"strconv"
"strings"
"time"
"github.com/google/uuid"
appsv1 "k8s.io/api/apps/v1"
v1 "k8s.io/api/core/v1"
apierrors "k8s.io/apimachinery/pkg/api/errors"
metav1 "k8s.io/apimachinery/pkg/apis/meta/v1"
"k8s.io/client-go/kubernetes"
monitoringv1 "github.com/prometheus-operator/prometheus-operator/pkg/apis/monitoring/v1"
"github.com/prometheus-operator/prometheus-operator/pkg/informers"
"github.com/prometheus-operator/prometheus-operator/pkg/operator"
)
// Config defines the operator's parameters for the Prometheus controllers.
// Whenever the value of one of these parameters is changed, it triggers an
// update of the managed statefulsets.
type Config struct {
LocalHost string
ReloaderConfig operator.ContainerConfig
PrometheusDefaultBaseImage string
ThanosDefaultBaseImage string
Annotations operator.Map
Labels operator.Map
}
type StatusReporter struct {
Kclient kubernetes.Interface
Reconciliations *operator.ReconciliationTracker
SsetInfs *informers.ForResource
Rr *operator.ResourceReconciler
}
func KeyToStatefulSetKey(p monitoringv1.PrometheusInterface, key string, shard int) string {
keyParts := strings.Split(key, "/")
return fmt.Sprintf("%s/%s", keyParts[0], statefulSetNameFromPrometheusName(p, keyParts[1], shard))
}
func statefulSetNameFromPrometheusName(p monitoringv1.PrometheusInterface, name string, shard int) string {
if shard == 0 {
return fmt.Sprintf("%s-%s", Prefix(p), name)
}
return fmt.Sprintf("%s-%s-shard-%d", Prefix(p), name, shard)
}
func NewTLSAssetSecret(p monitoringv1.PrometheusInterface, config Config) *v1.Secret {
s := &v1.Secret{
Data: map[string][]byte{},
}
operator.UpdateObject(
s,
operator.WithLabels(config.Labels),
operator.WithAnnotations(config.Annotations),
operator.WithManagingOwner(p),
operator.WithName(TLSAssetsSecretName(p)),
operator.WithNamespace(p.GetObjectMeta().GetNamespace()),
)
return s
}
// ValidateRemoteWriteSpec checks that mutually exclusive configurations are not
// included in the Prometheus remoteWrite configuration section, while also validating
// the RemoteWriteSpec child fields.
// Reference:
// path_to_url#remote_write
func ValidateRemoteWriteSpec(spec monitoringv1.RemoteWriteSpec) error {
var nonNilFields []string
for k, v := range map[string]interface{}{
"basicAuth": spec.BasicAuth,
"oauth2": spec.OAuth2,
"authorization": spec.Authorization,
"sigv4": spec.Sigv4,
"azureAd": spec.AzureAD,
} {
if reflect.ValueOf(v).IsNil() {
continue
}
nonNilFields = append(nonNilFields, fmt.Sprintf("%q", k))
}
if len(nonNilFields) > 1 {
return fmt.Errorf("%s can't be set at the same time, at most one of them must be defined", strings.Join(nonNilFields, " and "))
}
if spec.AzureAD != nil {
if spec.AzureAD.ManagedIdentity == nil && spec.AzureAD.OAuth == nil && spec.AzureAD.SDK == nil {
return fmt.Errorf("must provide Azure Managed Identity or Azure OAuth or Azure SDK in the Azure AD config")
}
if spec.AzureAD.ManagedIdentity != nil && spec.AzureAD.OAuth != nil {
return fmt.Errorf("cannot provide both Azure Managed Identity and Azure OAuth in the Azure AD config")
}
if spec.AzureAD.OAuth != nil && spec.AzureAD.SDK != nil {
return fmt.Errorf("cannot provide both Azure OAuth and Azure SDK in the Azure AD config")
}
if spec.AzureAD.ManagedIdentity != nil && spec.AzureAD.SDK != nil {
return fmt.Errorf("cannot provide both Azure Managed Identity and Azure SDK in the Azure AD config")
}
if spec.AzureAD.OAuth != nil {
_, err := uuid.Parse(spec.AzureAD.OAuth.ClientID)
if err != nil {
return fmt.Errorf("the provided Azure OAuth clientId is invalid")
}
}
}
return nil
}
// Process will determine the Status of a Prometheus resource (server or agent) depending on its current state in the cluster.
func (sr *StatusReporter) Process(ctx context.Context, p monitoringv1.PrometheusInterface, key string) (*monitoringv1.PrometheusStatus, error) {
commonFields := p.GetCommonPrometheusFields()
pStatus := monitoringv1.PrometheusStatus{
Paused: commonFields.Paused,
}
var (
availableStatus monitoringv1.ConditionStatus = monitoringv1.ConditionTrue
availableReason string
availableCondition = monitoringv1.Condition{
Type: monitoringv1.Available,
LastTransitionTime: metav1.Time{
Time: time.Now().UTC(),
},
ObservedGeneration: p.GetObjectMeta().GetGeneration(),
}
messages []string
replicas = 1
)
if commonFields.Replicas != nil {
replicas = int(*commonFields.Replicas)
}
for shard := range ExpectedStatefulSetShardNames(p) {
ssetName := KeyToStatefulSetKey(p, key, shard)
obj, err := sr.SsetInfs.Get(ssetName)
if err != nil {
if apierrors.IsNotFound(err) {
// Statefulset hasn't been created or is already deleted.
availableStatus = monitoringv1.ConditionFalse
availableReason = "StatefulSetNotFound"
messages = append(messages, fmt.Sprintf("shard %d: statefulset %s not found", shard, ssetName))
pStatus.ShardStatuses = append(
pStatus.ShardStatuses,
monitoringv1.ShardStatus{
ShardID: strconv.Itoa(shard),
})
continue
}
return nil, fmt.Errorf("failed to retrieve statefulset: %w", err)
}
sset := obj.(*appsv1.StatefulSet).DeepCopy()
if sr.Rr.DeletionInProgress(sset) {
continue
}
stsReporter, err := operator.NewStatefulSetReporter(ctx, sr.Kclient, sset)
if err != nil {
return nil, fmt.Errorf("failed to retrieve statefulset state: %w", err)
}
pStatus.Replicas += int32(len(stsReporter.Pods))
pStatus.UpdatedReplicas += int32(len(stsReporter.UpdatedPods()))
pStatus.AvailableReplicas += int32(len(stsReporter.ReadyPods()))
pStatus.UnavailableReplicas += int32(len(stsReporter.Pods) - len(stsReporter.ReadyPods()))
pStatus.ShardStatuses = append(
pStatus.ShardStatuses,
monitoringv1.ShardStatus{
ShardID: strconv.Itoa(shard),
Replicas: int32(len(stsReporter.Pods)),
UpdatedReplicas: int32(len(stsReporter.UpdatedPods())),
AvailableReplicas: int32(len(stsReporter.ReadyPods())),
UnavailableReplicas: int32(len(stsReporter.Pods) - len(stsReporter.ReadyPods())),
},
)
if len(stsReporter.ReadyPods()) >= replicas {
// All pods are ready (or the desired number of replicas is zero).
continue
}
switch {
case len(stsReporter.ReadyPods()) == 0:
availableReason = "NoPodReady"
availableStatus = monitoringv1.ConditionFalse
case availableCondition.Status != monitoringv1.ConditionFalse:
availableReason = "SomePodsNotReady"
availableStatus = monitoringv1.ConditionDegraded
}
for _, p := range stsReporter.Pods {
if m := p.Message(); m != "" {
messages = append(messages, fmt.Sprintf("shard %d: pod %s: %s", shard, p.Name, m))
}
}
}
pStatus.Conditions = operator.UpdateConditions(
pStatus.Conditions,
monitoringv1.Condition{
Type: monitoringv1.Available,
Status: availableStatus,
Reason: availableReason,
Message: strings.Join(messages, "\n"),
LastTransitionTime: metav1.Time{
Time: time.Now().UTC(),
},
ObservedGeneration: p.GetObjectMeta().GetGeneration(),
},
sr.Reconciliations.GetCondition(key, p.GetObjectMeta().GetGeneration()),
)
return &pStatus, nil
}
``` |
```xml
import { graphql } from "react-relay";
import { Environment } from "relay-runtime";
import {
commitMutationPromiseNormalized,
createMutation,
MutationInput,
} from "coral-framework/lib/relay";
import { ChangeReportStatusMutation as MutationTypes } from "coral-admin/__generated__/ChangeReportStatusMutation.graphql";
let clientMutationId = 0;
const ChangeReportStatusMutation = createMutation(
"changeReportStatus",
(environment: Environment, input: MutationInput<MutationTypes>) => {
const result = commitMutationPromiseNormalized<MutationTypes>(environment, {
mutation: graphql`
mutation ChangeReportStatusMutation(
$input: ChangeDSAReportStatusInput!
) {
changeDSAReportStatus(input: $input) {
dsaReport {
id
status
history {
id
createdBy {
username
}
createdAt
body
type
status
}
}
clientMutationId
}
}
`,
variables: {
input: {
userID: input.userID,
reportID: input.reportID,
status: input.status,
clientMutationId: (clientMutationId++).toString(),
},
},
});
return result;
}
);
export default ChangeReportStatusMutation;
``` |
Athanasius I (Greek: Αθανάσιος Α'; 1230 – 28 October 1310) was the Ecumenical Patriarch of Constantinople for two terms, from 1289 to 1293 and 1303 to 1309. He was born in Adrianople and died in Constantinople. Chosen by the emperor Andronicus II Palaeologus as patriarch, he opposed the reunion of the Greek and Roman Churches and introduced an ecclesiastic reform that evoked opposition within the clergy. He resigned in 1293 and was restored in 1303 with popular support. The pro-Union clerical faction forced him into retirement in early 1310.
He is commemorated as a saint in the Orthodox Church with his feast day observed annually on 28 October.
References
Bibliography
Afentoulidou-Leitgeb, Еirini, Die Hymnen des Theoktistos Studites auf Athanasios I. von Konstantinopel. Einleitung, Edition, Kommentar (Wien, Verlag der Österreichischen Akademie der Wissenschaften, 2008) (Wiener Byzantinische Studien, 27).
Boojamra, John L. "Athanasios of Constantinople: A Study of Byzantine Reactions to Latin Religious Infiltration," Church History, 48 (1979), 27–48.
Boojamra, John L. Church Reform in the late Byzantine Empire: A study of the patriarchate of Athanasius of Constantinople, 1289-1293, 1303-1309 (Brookline, MA, Hellenic College Press, 1980).
Boojamra, John L. The Church and Social Reform: The policies of the Patriarch Athanasios of Constantinople (New York, Fordham University Press, 1993)
Mitsiou, Ekaterini, "Das Doppelkloster des Patriarchen Athanasios I. in Konstantinopel: Historisch-prosopographische und wirtschaftliche Beobachtungen," Jahrbuch der Österreichischen Byzantinistik, 58 (2008),
Talbot, Alice-Mary. "The Patriarch Athanasius (1289–1293; 1303–1309) and the Church," Dumbarton Oaks Papers, 27 (1973), 11–28.
Talbot Alice-Mary M. (ed., tr. and comm.), The Correspondence of Athanasius I, Patriarch of Constantinople: Letters to the Emperor Andronicus II, members of the imperial family, and officials (Washington, Dumbarton Oaks Center for Byzantine Studies, 1975).
Talbot, Alice-Mary M., Faith healing in late Byzantium: The posthumous miracles of the Patriarch Athanasios I of Constantinople by Theoktistos the Stoudite (Brookline, MA, Hellenic College Press, 1983) (Archbishop Iakovos library of ecclesiastical and historical sources, 8).
1230 births
1310 deaths
13th-century patriarchs of Constantinople
14th-century patriarchs of Constantinople
Byzantine saints of the Eastern Orthodox Church
People from Edirne |
Paolino Taddei (22 January 1860 – 15 October 1925) was an Italian politician and the last minister of Interior before the March on Rome.
Life
Born in Poggio a Caiano near Florence in 1911 he was named Prefetto of the Province of Ferrara where he worked as mediator in the contention between the local Trade Unions and the entrepreneurs, then he was named prefetto of Ancona and Turin.
On 1921 he was named as Senator of the Kingdom by king Victor Emmanuel III.
In August 1922 he was named Minister of Interior of the government headed by Luigi Facta. In the night between 27 October and 28 October 1922 he joined the decision to declare the State of Siege against the fascists, but the king refused to sign the order and Taddei resigned from his post like the whole Cabinet. He died in Florence in 1925.
References
1860 births
1925 deaths
Italian Ministers of the Interior
People from the Province of Florence
Members of the Senate of the Kingdom of Italy |
The year 1983 was the 12th year after the independence of Bangladesh. It was also the second year of the Government of Hussain Muhammad Ershad.
Incumbents
President: A. F. M. Ahsanuddin Chowdhury (until 10 December), Hussain Muhammad Ershad (starting 11 December)
Chief Justice: F.K.M. Munim
Demography
Climate
Economy
Note: For the year 1983 average official exchange rate for BDT was 24.62 per US$.
Events
14 February - At least 10 people, mostly students, were killed when police opened fire on the procession against the education policy, popularly known at that time as “Majid Khan Education Policy.” The incident marked the beginning of the anti-autocracy movement against the military regime of H. M. Ershad.
18 February - Over 2,000 people, mostly Muslims of Bangladeshi origin, are massacred in Assam, India, during the Assam agitation.
20 September - The Bangladesh National Museum (Jatiya Jadughar) ordinance came into effect.
2 October - Grameen Bank was established through a government ordinance.
11 December - Hussain Muhammad Ershad takes charge as the President of Bangladesh.
Awards and recognitions
Bangladeshi author Abdullah-Al-Muti won the UNESCO Kalinga Prize.
Independence Day Award
Ekushey Padak
Shawkat Osman (literature)
Sanaul Huq (literature)
Abdul Gaffar Chowdhury (literature)
M A Kuddus (education)
Shahidullah Kaisar (journalism)
Syed Nur Uddin (journalism)
Abu Jafar Shamsuddin (literature)
Mohammad Kibria (painting)
Barin Mazumder (music)
Muhammad Mansuruddin
Sports
Domestic football:
Abahani KC won Dhaka League title while Mohammedan SC became runner-up.
Mohammedan SC won the title of Bangladesh Federation Cup.
Births
11 April – Munem Wasif, photographer
28 May – Mamnun Hasan Emon, actor
Deaths
26 January – Selina Banu, freedom fighter and social activist (b. 1926)
12 February – Benajir Ahmed, author (b. 1903)
4 May – Abul Fazal, author (b. 1903)
28 August – MA Wadud, language activist (b. 1925)
22 October – Khondakar Abdul Hamid, journalist (b. 1918)
10 November – Manabendra Narayan Larma, human rights activist (b. 1939)
28 August – MA Wadud, language activist (b. 1925)
31 December – Mohammad Sultan, language activist (b. 1926)
See also
1980s in Bangladesh
Timeline of Bangladeshi history
References |
Manel Guillen I Sola (born 19 May 1967) is a Spanish businessman, lawyer and activist investor.
Manel Guillen received a J.D in Law from the Law School of the University of Barcelona in 1991 and an MBA from the IESE Business School, University of Navarra in 1995. He is an active member of the Illustre Collegi d'Advocats de Barcelona, member of the Loan Syndication and Trading Association, the Turnaround Management Association and a member of the Cercle d'Economia de Barcelona.
Guillen is the founder of the investment company Mediterranean Capital Management in 2005, acting as chief executive officer (CEO) since its creation. Currently, based in Barcelona and Madrid, Spain, he has developed his professional career in various senior management positions as CEO in several companies in Spain, the United States, Brazil, Mexico, Argentina, Iran, Germany, Austria and the United Kingdom.
Professional career
He developed his professional career in the German media corporation Bertelsmann Group, as sales and marketing deputy director in the book company Círculo de Lectores, a reference in the Spanish cultural world. In 1997, he became the managing director of Bertelsmann Online in Spain and Latin America, a joint venture created by Planeta Corporación and Bertelsmann Group, based in New York City, United States, and investment activities in all major Latin American countries. In 1999, he was appointed chief operating officer (COO) of Telefónica B2B Construction for Spain and Latin America in Telefónica, the main Spanish telecommunications provider and one of the largest telecoms companies in the world. He was also the CEO of BravoSolution España, part of the Italian multinational Italcementi Group.
In 2005, he founded the investment company Mediterranean Capital Management as its CEO. Based in Barcelona, the company is an active investor in the distressed debt market in Spain and Latin America, focusing its target investments in the distressed mortgage market and high yield corporate debt. As of April 2022, the firm had €300 million of assets under management.
Non-business activities
Guillen's career is also linked to Spanish basketball. He is a former player and professional basketball referee of Basketball Clubs Association (ACB), the men's professional basketball league in Spain. He has been a referee and executive member of the ACB, from 2001 to 2004 as chairman of the referees' committee and the referees' director of the ACB.
References
External links
Press article about on-line bookshops talking as Bertelsmann Online CEO
Press article about the largest Spanish online bookshop and its CEO, Manel Guillen
Official profile page as a ACB referee
Interview on the Spanish basketball referees web Silbanding (in Spanish)
Press article about non-verbal communication in refereeing as Chairman of the Referees Committee
Personal home page of Manel Guillen
Mediterranean Capital Management website
1967 births
Living people
Spanish businesspeople
20th-century Spanish lawyers |
Anthracus derogatus is an insect-eating ground beetle of the genus Anthracus. It was discovered in Sri Lanka.
References
derogatus
Beetles described in 1858 |
Tyrrelstown GAA (Irish: CLG Bhaile an Tirialaigh) is one of six Gaelic Athletic Association (GAA) clubs based in Dublin 15 and the youngest founded in 2008 [1](the others are Castleknock, Erin Go Bragh, Garda, St Brigid's, St Peregrines and Westmanstown Gaels). The club was officially launched in the GAA's 125th anniversary year, 2009 [3]. They field teams at juvenile level in football, hurling, and camogie from Under 8 through to Under 16. Their colours are navy, green and white.
Football
The Tyrrelstown GAA Social team played in the Dublin 15 Cross Community Integration Group Cup in 2009 against St. Peregrines GAA winning 3-4 to 2-6 winning the club's first trophy.[2] The club started competing for the first time at junior level in 2010 entering a team in the Junior E Championship and Division 11 North.[4] Their Junior football team reached their first Junior football championship final in 2011 losing to Geraldine P. Morans.
The junior football team played their home games in St. Catherines Park for the 2012 season. They co-organised a football tournament with St. Peregrines in August 2012. Also participating along with Tyrrelstown and St. Peregrines were fellow Dublin 15 club Erin Go Bragh and Croi Ro Naofa from Killinarden. Croi Ro Naofa beat Tyrrelstown in the cup final while St. Peregrines defeated Erin Go Bragh in the shield final.
Honours
Dublin 15 Cross Community Integration Group Cup: 2009 Winners [2]
Dublin Junior E Football Championship: 2011 Runners Up
References
External links
Official Club Website
Dublin Club GAA
Dublin GAA
Dublin 15 Cross Community Integration Group Cup
Gazette club launch GAA anniversary year
Hill 16 - fixtures and results
Gaelic games clubs in Fingal
Gaelic football clubs in Fingal |
Valley with Ploughman Seen from Above or Landscape with House and Ploughman (Dutch - Landschap met een huis en een ploeger in vogelvlucht gezien) is an 1889 oil on canvas painting by Vincent van Gogh, produced during the autumn of his stay in Saint-Rémy. Its catalogue numbers are F 727 and JH 1877. It is now in the Hermitage Museum.
During the 1920s it was in the collection of Otto Krebs (1873–1941), a German industrialist, but was considered lost until 1995, when it appeared in an exhibition of 74 artworks looted by the Soviet Union at the end of World War Two, also including three other van Goghs, six Monets, seven Cezannes, two Gauguins and other works by Degas, Toulouse-Lautrec and Picasso, all from pre-war German private collections, mainly that of Krebs. The work has been on display at the Hermitage since then, which since 1996 has begun regular publishing of material on looted works still in its collections.
See also
List of works by Vincent van Gogh
References
Paintings in the Hermitage Museum
Stolen works of art
1889 paintings
Paintings by Vincent van Gogh
Paintings of Saint-Rémy-de-Provence by Vincent van Gogh
Farming in art |
```xml
import { Token } from './token'
import { ValueToken } from './value-token'
import { TokenKind } from '../parser'
export class RangeToken extends Token {
constructor (
public input: string,
public begin: number,
public end: number,
public lhs: ValueToken,
public rhs: ValueToken,
public file?: string
) {
super(TokenKind.Range, input, begin, end, file)
}
}
``` |
Stigmella alikurokoi is a moth of the family Nepticulidae. It is only known from Kyushu in Japan.
There are three generations or more per year.
The larvae feed on Rubus buergeri, Rubus phoenicolasius and Rubus palmatus var. coptophyllus. They mine the leaves of their host plant. The mine consists of a linear, long and slender gallery on the upper surface of the leaf. It sometimes runs along the leaf margin and the mid rib. It is greenish brown to brown with a dark brown central line of frass.
External links
Japanese Species of the Genus Stigmella (Nepticulidae: Lepidoptera)
Nepticulidae
Moths of Japan |
Allan Nilsson (18 May 1899, Göteborg – 4 September 1949, Göteborg) was a Swedish chess master.
He was Swedish Champion in 1924-1929, and played four matches for the title, all in Gothenburg. He drew a match with Gustaf Nyholm (2.5 : 2.5) in 1921, won against Nyholm (3 : 1) in 1924, drew with Gösta Stoltz (2.5 : 2.5) in 1927, and lost to Gideon Ståhlberg (0 : 3) in 1929.
He tied for 2nd-3rd, behind Paul Johner, at Göteborg 1920, shared 1st with Anton Olson at Uppsala 1923, and took 3rd at Copenhagen 1924 (Nordic Championship, Aron Nimzowitsch won).
Nilsson represented Sweden in the 1st Chess Olympiad at London 1927, and tied for 9-11th in the Amateur World Championship (Max Euwe won), which took place during the 2nd Chess Olympiad at The Hague 1928.
References
1899 births
1949 deaths
Swedish chess players
Chess Olympiad competitors
20th-century chess players |
```objective-c
/**
*
*/
#pragma once
#include "soc.h"
#ifdef __cplusplus
extern "C" {
#endif
#define REG_TIMG_BASE(i) (DR_REG_TIMERGROUP0_BASE + i*0x1000)
#define TIMG_T0CONFIG_REG(i) (REG_TIMG_BASE(i) + 0x0000)
/* TIMG_T0_EN : R/W ;bitpos:[31] ;default: 1'h0 ; */
/*description: When set timer 0 time-base counter is enabled*/
#define TIMG_T0_EN (BIT(31))
#define TIMG_T0_EN_M (BIT(31))
#define TIMG_T0_EN_V 0x1
#define TIMG_T0_EN_S 31
/* TIMG_T0_INCREASE : R/W ;bitpos:[30] ;default: 1'h1 ; */
/*description: When set timer 0 time-base counter increment. When cleared timer
0 time-base counter decrement.*/
#define TIMG_T0_INCREASE (BIT(30))
#define TIMG_T0_INCREASE_M (BIT(30))
#define TIMG_T0_INCREASE_V 0x1
#define TIMG_T0_INCREASE_S 30
/* TIMG_T0_AUTORELOAD : R/W ;bitpos:[29] ;default: 1'h1 ; */
/*description: When set timer 0 auto-reload at alarming is enabled*/
#define TIMG_T0_AUTORELOAD (BIT(29))
#define TIMG_T0_AUTORELOAD_M (BIT(29))
#define TIMG_T0_AUTORELOAD_V 0x1
#define TIMG_T0_AUTORELOAD_S 29
/* TIMG_T0_DIVIDER : R/W ;bitpos:[28:13] ;default: 16'h1 ; */
/*description: Timer 0 clock (T0_clk) prescale value.*/
#define TIMG_T0_DIVIDER 0x0000FFFF
#define TIMG_T0_DIVIDER_M ((TIMG_T0_DIVIDER_V)<<(TIMG_T0_DIVIDER_S))
#define TIMG_T0_DIVIDER_V 0xFFFF
#define TIMG_T0_DIVIDER_S 13
/* TIMG_T0_EDGE_INT_EN : R/W ;bitpos:[12] ;default: 1'h0 ; */
/*description: When set edge type interrupt will be generated during alarm*/
#define TIMG_T0_EDGE_INT_EN (BIT(12))
#define TIMG_T0_EDGE_INT_EN_M (BIT(12))
#define TIMG_T0_EDGE_INT_EN_V 0x1
#define TIMG_T0_EDGE_INT_EN_S 12
/* TIMG_T0_LEVEL_INT_EN : R/W ;bitpos:[11] ;default: 1'h0 ; */
/*description: When set level type interrupt will be generated during alarm*/
#define TIMG_T0_LEVEL_INT_EN (BIT(11))
#define TIMG_T0_LEVEL_INT_EN_M (BIT(11))
#define TIMG_T0_LEVEL_INT_EN_V 0x1
#define TIMG_T0_LEVEL_INT_EN_S 11
/* TIMG_T0_ALARM_EN : R/W ;bitpos:[10] ;default: 1'h0 ; */
/*description: When set alarm is enabled*/
#define TIMG_T0_ALARM_EN (BIT(10))
#define TIMG_T0_ALARM_EN_M (BIT(10))
#define TIMG_T0_ALARM_EN_V 0x1
#define TIMG_T0_ALARM_EN_S 10
#define TIMG_T0LO_REG(i) (REG_TIMG_BASE(i) + 0x0004)
/* TIMG_T0_LO : RO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Register to store timer 0 time-base counter current value lower 32 bits.*/
#define TIMG_T0_LO 0xFFFFFFFF
#define TIMG_T0_LO_M ((TIMG_T0_LO_V)<<(TIMG_T0_LO_S))
#define TIMG_T0_LO_V 0xFFFFFFFF
#define TIMG_T0_LO_S 0
#define TIMG_T0HI_REG(i) (REG_TIMG_BASE(i) + 0x0008)
/* TIMG_T0_HI : RO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Register to store timer 0 time-base counter current value higher 32 bits.*/
#define TIMG_T0_HI 0xFFFFFFFF
#define TIMG_T0_HI_M ((TIMG_T0_HI_V)<<(TIMG_T0_HI_S))
#define TIMG_T0_HI_V 0xFFFFFFFF
#define TIMG_T0_HI_S 0
#define TIMG_T0UPDATE_REG(i) (REG_TIMG_BASE(i) + 0x000c)
/* TIMG_T0_UPDATE : WO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Write any value will trigger a timer 0 time-base counter value
update (timer 0 current value will be stored in registers above)*/
#define TIMG_T0_UPDATE 0xFFFFFFFF
#define TIMG_T0_UPDATE_M ((TIMG_T0_UPDATE_V)<<(TIMG_T0_UPDATE_S))
#define TIMG_T0_UPDATE_V 0xFFFFFFFF
#define TIMG_T0_UPDATE_S 0
#define TIMG_T0ALARMLO_REG(i) (REG_TIMG_BASE(i) + 0x0010)
/* TIMG_T0_ALARM_LO : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Timer 0 time-base counter value lower 32 bits that will trigger the alarm*/
#define TIMG_T0_ALARM_LO 0xFFFFFFFF
#define TIMG_T0_ALARM_LO_M ((TIMG_T0_ALARM_LO_V)<<(TIMG_T0_ALARM_LO_S))
#define TIMG_T0_ALARM_LO_V 0xFFFFFFFF
#define TIMG_T0_ALARM_LO_S 0
#define TIMG_T0ALARMHI_REG(i) (REG_TIMG_BASE(i) + 0x0014)
/* TIMG_T0_ALARM_HI : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Timer 0 time-base counter value higher 32 bits that will trigger the alarm*/
#define TIMG_T0_ALARM_HI 0xFFFFFFFF
#define TIMG_T0_ALARM_HI_M ((TIMG_T0_ALARM_HI_V)<<(TIMG_T0_ALARM_HI_S))
#define TIMG_T0_ALARM_HI_V 0xFFFFFFFF
#define TIMG_T0_ALARM_HI_S 0
#define TIMG_T0LOADLO_REG(i) (REG_TIMG_BASE(i) + 0x0018)
/* TIMG_T0_LOAD_LO : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Lower 32 bits of the value that will load into timer 0 time-base counter*/
#define TIMG_T0_LOAD_LO 0xFFFFFFFF
#define TIMG_T0_LOAD_LO_M ((TIMG_T0_LOAD_LO_V)<<(TIMG_T0_LOAD_LO_S))
#define TIMG_T0_LOAD_LO_V 0xFFFFFFFF
#define TIMG_T0_LOAD_LO_S 0
#define TIMG_T0LOADHI_REG(i) (REG_TIMG_BASE(i) + 0x001c)
/* TIMG_T0_LOAD_HI : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: higher 32 bits of the value that will load into timer 0 time-base counter*/
#define TIMG_T0_LOAD_HI 0xFFFFFFFF
#define TIMG_T0_LOAD_HI_M ((TIMG_T0_LOAD_HI_V)<<(TIMG_T0_LOAD_HI_S))
#define TIMG_T0_LOAD_HI_V 0xFFFFFFFF
#define TIMG_T0_LOAD_HI_S 0
#define TIMG_T0LOAD_REG(i) (REG_TIMG_BASE(i) + 0x0020)
/* TIMG_T0_LOAD : WO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Write any value will trigger timer 0 time-base counter reload*/
#define TIMG_T0_LOAD 0xFFFFFFFF
#define TIMG_T0_LOAD_M ((TIMG_T0_LOAD_V)<<(TIMG_T0_LOAD_S))
#define TIMG_T0_LOAD_V 0xFFFFFFFF
#define TIMG_T0_LOAD_S 0
#define TIMG_T1CONFIG_REG(i) (REG_TIMG_BASE(i) + 0x0024)
/* TIMG_T1_EN : R/W ;bitpos:[31] ;default: 1'h0 ; */
/*description: When set timer 1 time-base counter is enabled*/
#define TIMG_T1_EN (BIT(31))
#define TIMG_T1_EN_M (BIT(31))
#define TIMG_T1_EN_V 0x1
#define TIMG_T1_EN_S 31
/* TIMG_T1_INCREASE : R/W ;bitpos:[30] ;default: 1'h1 ; */
/*description: When set timer 1 time-base counter increment. When cleared timer
1 time-base counter decrement.*/
#define TIMG_T1_INCREASE (BIT(30))
#define TIMG_T1_INCREASE_M (BIT(30))
#define TIMG_T1_INCREASE_V 0x1
#define TIMG_T1_INCREASE_S 30
/* TIMG_T1_AUTORELOAD : R/W ;bitpos:[29] ;default: 1'h1 ; */
/*description: When set timer 1 auto-reload at alarming is enabled*/
#define TIMG_T1_AUTORELOAD (BIT(29))
#define TIMG_T1_AUTORELOAD_M (BIT(29))
#define TIMG_T1_AUTORELOAD_V 0x1
#define TIMG_T1_AUTORELOAD_S 29
/* TIMG_T1_DIVIDER : R/W ;bitpos:[28:13] ;default: 16'h1 ; */
/*description: Timer 1 clock (T1_clk) prescale value.*/
#define TIMG_T1_DIVIDER 0x0000FFFF
#define TIMG_T1_DIVIDER_M ((TIMG_T1_DIVIDER_V)<<(TIMG_T1_DIVIDER_S))
#define TIMG_T1_DIVIDER_V 0xFFFF
#define TIMG_T1_DIVIDER_S 13
/* TIMG_T1_EDGE_INT_EN : R/W ;bitpos:[12] ;default: 1'h0 ; */
/*description: When set edge type interrupt will be generated during alarm*/
#define TIMG_T1_EDGE_INT_EN (BIT(12))
#define TIMG_T1_EDGE_INT_EN_M (BIT(12))
#define TIMG_T1_EDGE_INT_EN_V 0x1
#define TIMG_T1_EDGE_INT_EN_S 12
/* TIMG_T1_LEVEL_INT_EN : R/W ;bitpos:[11] ;default: 1'h0 ; */
/*description: When set level type interrupt will be generated during alarm*/
#define TIMG_T1_LEVEL_INT_EN (BIT(11))
#define TIMG_T1_LEVEL_INT_EN_M (BIT(11))
#define TIMG_T1_LEVEL_INT_EN_V 0x1
#define TIMG_T1_LEVEL_INT_EN_S 11
/* TIMG_T1_ALARM_EN : R/W ;bitpos:[10] ;default: 1'h0 ; */
/*description: When set alarm is enabled*/
#define TIMG_T1_ALARM_EN (BIT(10))
#define TIMG_T1_ALARM_EN_M (BIT(10))
#define TIMG_T1_ALARM_EN_V 0x1
#define TIMG_T1_ALARM_EN_S 10
#define TIMG_T1LO_REG(i) (REG_TIMG_BASE(i) + 0x0028)
/* TIMG_T1_LO : RO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Register to store timer 1 time-base counter current value lower 32 bits.*/
#define TIMG_T1_LO 0xFFFFFFFF
#define TIMG_T1_LO_M ((TIMG_T1_LO_V)<<(TIMG_T1_LO_S))
#define TIMG_T1_LO_V 0xFFFFFFFF
#define TIMG_T1_LO_S 0
#define TIMG_T1HI_REG(i) (REG_TIMG_BASE(i) + 0x002c)
/* TIMG_T1_HI : RO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Register to store timer 1 time-base counter current value higher 32 bits.*/
#define TIMG_T1_HI 0xFFFFFFFF
#define TIMG_T1_HI_M ((TIMG_T1_HI_V)<<(TIMG_T1_HI_S))
#define TIMG_T1_HI_V 0xFFFFFFFF
#define TIMG_T1_HI_S 0
#define TIMG_T1UPDATE_REG(i) (REG_TIMG_BASE(i) + 0x0030)
/* TIMG_T1_UPDATE : WO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Write any value will trigger a timer 1 time-base counter value
update (timer 1 current value will be stored in registers above)*/
#define TIMG_T1_UPDATE 0xFFFFFFFF
#define TIMG_T1_UPDATE_M ((TIMG_T1_UPDATE_V)<<(TIMG_T1_UPDATE_S))
#define TIMG_T1_UPDATE_V 0xFFFFFFFF
#define TIMG_T1_UPDATE_S 0
#define TIMG_T1ALARMLO_REG(i) (REG_TIMG_BASE(i) + 0x0034)
/* TIMG_T1_ALARM_LO : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Timer 1 time-base counter value lower 32 bits that will trigger the alarm*/
#define TIMG_T1_ALARM_LO 0xFFFFFFFF
#define TIMG_T1_ALARM_LO_M ((TIMG_T1_ALARM_LO_V)<<(TIMG_T1_ALARM_LO_S))
#define TIMG_T1_ALARM_LO_V 0xFFFFFFFF
#define TIMG_T1_ALARM_LO_S 0
#define TIMG_T1ALARMHI_REG(i) (REG_TIMG_BASE(i) + 0x0038)
/* TIMG_T1_ALARM_HI : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Timer 1 time-base counter value higher 32 bits that will trigger the alarm*/
#define TIMG_T1_ALARM_HI 0xFFFFFFFF
#define TIMG_T1_ALARM_HI_M ((TIMG_T1_ALARM_HI_V)<<(TIMG_T1_ALARM_HI_S))
#define TIMG_T1_ALARM_HI_V 0xFFFFFFFF
#define TIMG_T1_ALARM_HI_S 0
#define TIMG_T1LOADLO_REG(i) (REG_TIMG_BASE(i) + 0x003c)
/* TIMG_T1_LOAD_LO : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Lower 32 bits of the value that will load into timer 1 time-base counter*/
#define TIMG_T1_LOAD_LO 0xFFFFFFFF
#define TIMG_T1_LOAD_LO_M ((TIMG_T1_LOAD_LO_V)<<(TIMG_T1_LOAD_LO_S))
#define TIMG_T1_LOAD_LO_V 0xFFFFFFFF
#define TIMG_T1_LOAD_LO_S 0
#define TIMG_T1LOADHI_REG(i) (REG_TIMG_BASE(i) + 0x0040)
/* TIMG_T1_LOAD_HI : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: higher 32 bits of the value that will load into timer 1 time-base counter*/
#define TIMG_T1_LOAD_HI 0xFFFFFFFF
#define TIMG_T1_LOAD_HI_M ((TIMG_T1_LOAD_HI_V)<<(TIMG_T1_LOAD_HI_S))
#define TIMG_T1_LOAD_HI_V 0xFFFFFFFF
#define TIMG_T1_LOAD_HI_S 0
#define TIMG_T1LOAD_REG(i) (REG_TIMG_BASE(i) + 0x0044)
/* TIMG_T1_LOAD : WO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Write any value will trigger timer 1 time-base counter reload*/
#define TIMG_T1_LOAD 0xFFFFFFFF
#define TIMG_T1_LOAD_M ((TIMG_T1_LOAD_V)<<(TIMG_T1_LOAD_S))
#define TIMG_T1_LOAD_V 0xFFFFFFFF
#define TIMG_T1_LOAD_S 0
#define TIMG_WDTCONFIG0_REG(i) (REG_TIMG_BASE(i) + 0x0048)
/* TIMG_WDT_EN : R/W ;bitpos:[31] ;default: 1'h0 ; */
/*description: When set SWDT is enabled*/
#define TIMG_WDT_EN (BIT(31))
#define TIMG_WDT_EN_M (BIT(31))
#define TIMG_WDT_EN_V 0x1
#define TIMG_WDT_EN_S 31
/* TIMG_WDT_STG0 : R/W ;bitpos:[30:29] ;default: 1'd0 ; */
/*description: Stage 0 configuration. 0: off 1: interrupt 2: reset CPU 3: reset system*/
#define TIMG_WDT_STG0 0x00000003
#define TIMG_WDT_STG0_M ((TIMG_WDT_STG0_V)<<(TIMG_WDT_STG0_S))
#define TIMG_WDT_STG0_V 0x3
#define TIMG_WDT_STG0_S 29
/* TIMG_WDT_STG1 : R/W ;bitpos:[28:27] ;default: 1'd0 ; */
/*description: Stage 1 configuration. 0: off 1: interrupt 2: reset CPU 3: reset system*/
#define TIMG_WDT_STG1 0x00000003
#define TIMG_WDT_STG1_M ((TIMG_WDT_STG1_V)<<(TIMG_WDT_STG1_S))
#define TIMG_WDT_STG1_V 0x3
#define TIMG_WDT_STG1_S 27
/* TIMG_WDT_STG2 : R/W ;bitpos:[26:25] ;default: 1'd0 ; */
/*description: Stage 2 configuration. 0: off 1: interrupt 2: reset CPU 3: reset system*/
#define TIMG_WDT_STG2 0x00000003
#define TIMG_WDT_STG2_M ((TIMG_WDT_STG2_V)<<(TIMG_WDT_STG2_S))
#define TIMG_WDT_STG2_V 0x3
#define TIMG_WDT_STG2_S 25
/* TIMG_WDT_STG3 : R/W ;bitpos:[24:23] ;default: 1'd0 ; */
/*description: Stage 3 configuration. 0: off 1: interrupt 2: reset CPU 3: reset system*/
#define TIMG_WDT_STG3 0x00000003
#define TIMG_WDT_STG3_M ((TIMG_WDT_STG3_V)<<(TIMG_WDT_STG3_S))
#define TIMG_WDT_STG3_V 0x3
#define TIMG_WDT_STG3_S 23
/* TIMG_WDT_EDGE_INT_EN : R/W ;bitpos:[22] ;default: 1'h0 ; */
/*description: When set edge type interrupt generation is enabled*/
#define TIMG_WDT_EDGE_INT_EN (BIT(22))
#define TIMG_WDT_EDGE_INT_EN_M (BIT(22))
#define TIMG_WDT_EDGE_INT_EN_V 0x1
#define TIMG_WDT_EDGE_INT_EN_S 22
/* TIMG_WDT_LEVEL_INT_EN : R/W ;bitpos:[21] ;default: 1'h0 ; */
/*description: When set level type interrupt generation is enabled*/
#define TIMG_WDT_LEVEL_INT_EN (BIT(21))
#define TIMG_WDT_LEVEL_INT_EN_M (BIT(21))
#define TIMG_WDT_LEVEL_INT_EN_V 0x1
#define TIMG_WDT_LEVEL_INT_EN_S 21
/* TIMG_WDT_CPU_RESET_LENGTH : R/W ;bitpos:[20:18] ;default: 3'h1 ; */
/*description: length of CPU reset selection. 0: 100ns 1: 200ns 2: 300ns
3: 400ns 4: 500ns 5: 800ns 6: 1.6us 7: 3.2us*/
#define TIMG_WDT_CPU_RESET_LENGTH 0x00000007
#define TIMG_WDT_CPU_RESET_LENGTH_M ((TIMG_WDT_CPU_RESET_LENGTH_V)<<(TIMG_WDT_CPU_RESET_LENGTH_S))
#define TIMG_WDT_CPU_RESET_LENGTH_V 0x7
#define TIMG_WDT_CPU_RESET_LENGTH_S 18
/* TIMG_WDT_SYS_RESET_LENGTH : R/W ;bitpos:[17:15] ;default: 3'h1 ; */
/*description: length of system reset selection. 0: 100ns 1: 200ns 2: 300ns
3: 400ns 4: 500ns 5: 800ns 6: 1.6us 7: 3.2us*/
#define TIMG_WDT_SYS_RESET_LENGTH 0x00000007
#define TIMG_WDT_SYS_RESET_LENGTH_M ((TIMG_WDT_SYS_RESET_LENGTH_V)<<(TIMG_WDT_SYS_RESET_LENGTH_S))
#define TIMG_WDT_SYS_RESET_LENGTH_V 0x7
#define TIMG_WDT_SYS_RESET_LENGTH_S 15
/* TIMG_WDT_FLASHBOOT_MOD_EN : R/W ;bitpos:[14] ;default: 1'h1 ; */
/*description: When set flash boot protection is enabled*/
#define TIMG_WDT_FLASHBOOT_MOD_EN (BIT(14))
#define TIMG_WDT_FLASHBOOT_MOD_EN_M (BIT(14))
#define TIMG_WDT_FLASHBOOT_MOD_EN_V 0x1
#define TIMG_WDT_FLASHBOOT_MOD_EN_S 14
#define TIMG_WDTCONFIG1_REG(i) (REG_TIMG_BASE(i) + 0x004c)
/* TIMG_WDT_CLK_PRESCALE : R/W ;bitpos:[31:16] ;default: 16'h1 ; */
/*description: SWDT clock prescale value. Period = 12.5ns * value stored in this register*/
#define TIMG_WDT_CLK_PRESCALE 0x0000FFFF
#define TIMG_WDT_CLK_PRESCALE_M ((TIMG_WDT_CLK_PRESCALE_V)<<(TIMG_WDT_CLK_PRESCALE_S))
#define TIMG_WDT_CLK_PRESCALE_V 0xFFFF
#define TIMG_WDT_CLK_PRESCALE_S 16
#define TIMG_WDTCONFIG2_REG(i) (REG_TIMG_BASE(i) + 0x0050)
/* TIMG_WDT_STG0_HOLD : R/W ;bitpos:[31:0] ;default: 32'd26000000 ; */
/*description: Stage 0 timeout value in SWDT clock cycles*/
#define TIMG_WDT_STG0_HOLD 0xFFFFFFFF
#define TIMG_WDT_STG0_HOLD_M ((TIMG_WDT_STG0_HOLD_V)<<(TIMG_WDT_STG0_HOLD_S))
#define TIMG_WDT_STG0_HOLD_V 0xFFFFFFFF
#define TIMG_WDT_STG0_HOLD_S 0
#define TIMG_WDTCONFIG3_REG(i) (REG_TIMG_BASE(i) + 0x0054)
/* TIMG_WDT_STG1_HOLD : R/W ;bitpos:[31:0] ;default: 32'h7ffffff ; */
/*description: Stage 1 timeout value in SWDT clock cycles*/
#define TIMG_WDT_STG1_HOLD 0xFFFFFFFF
#define TIMG_WDT_STG1_HOLD_M ((TIMG_WDT_STG1_HOLD_V)<<(TIMG_WDT_STG1_HOLD_S))
#define TIMG_WDT_STG1_HOLD_V 0xFFFFFFFF
#define TIMG_WDT_STG1_HOLD_S 0
#define TIMG_WDTCONFIG4_REG(i) (REG_TIMG_BASE(i) + 0x0058)
/* TIMG_WDT_STG2_HOLD : R/W ;bitpos:[31:0] ;default: 32'hfffff ; */
/*description: Stage 2 timeout value in SWDT clock cycles*/
#define TIMG_WDT_STG2_HOLD 0xFFFFFFFF
#define TIMG_WDT_STG2_HOLD_M ((TIMG_WDT_STG2_HOLD_V)<<(TIMG_WDT_STG2_HOLD_S))
#define TIMG_WDT_STG2_HOLD_V 0xFFFFFFFF
#define TIMG_WDT_STG2_HOLD_S 0
#define TIMG_WDTCONFIG5_REG(i) (REG_TIMG_BASE(i) + 0x005c)
/* TIMG_WDT_STG3_HOLD : R/W ;bitpos:[31:0] ;default: 32'hfffff ; */
/*description: Stage 3 timeout value in SWDT clock cycles*/
#define TIMG_WDT_STG3_HOLD 0xFFFFFFFF
#define TIMG_WDT_STG3_HOLD_M ((TIMG_WDT_STG3_HOLD_V)<<(TIMG_WDT_STG3_HOLD_S))
#define TIMG_WDT_STG3_HOLD_V 0xFFFFFFFF
#define TIMG_WDT_STG3_HOLD_S 0
#define TIMG_WDTFEED_REG(i) (REG_TIMG_BASE(i) + 0x0060)
/* TIMG_WDT_FEED : WO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: Write any value will feed SWDT*/
#define TIMG_WDT_FEED 0xFFFFFFFF
#define TIMG_WDT_FEED_M ((TIMG_WDT_FEED_V)<<(TIMG_WDT_FEED_S))
#define TIMG_WDT_FEED_V 0xFFFFFFFF
#define TIMG_WDT_FEED_S 0
#define TIMG_WDTWPROTECT_REG(i) (REG_TIMG_BASE(i) + 0x0064)
/* TIMG_WDT_WKEY : R/W ;bitpos:[31:0] ;default: 32'h50d83aa1 ; */
/*description: If change its value from default then write protection is on.*/
#define TIMG_WDT_WKEY 0xFFFFFFFF
#define TIMG_WDT_WKEY_M ((TIMG_WDT_WKEY_V)<<(TIMG_WDT_WKEY_S))
#define TIMG_WDT_WKEY_V 0xFFFFFFFF
#define TIMG_WDT_WKEY_S 0
#define TIMG_RTCCALICFG_REG(i) (REG_TIMG_BASE(i) + 0x0068)
/* TIMG_RTC_CALI_START : R/W ;bitpos:[31] ;default: 1'h0 ; */
/*description: */
#define TIMG_RTC_CALI_START (BIT(31))
#define TIMG_RTC_CALI_START_M (BIT(31))
#define TIMG_RTC_CALI_START_V 0x1
#define TIMG_RTC_CALI_START_S 31
/* TIMG_RTC_CALI_MAX : R/W ;bitpos:[30:16] ;default: 15'h1 ; */
/*description: */
#define TIMG_RTC_CALI_MAX 0x00007FFF
#define TIMG_RTC_CALI_MAX_M ((TIMG_RTC_CALI_MAX_V)<<(TIMG_RTC_CALI_MAX_S))
#define TIMG_RTC_CALI_MAX_V 0x7FFF
#define TIMG_RTC_CALI_MAX_S 16
/* TIMG_RTC_CALI_RDY : RO ;bitpos:[15] ;default: 1'h0 ; */
/*description: */
#define TIMG_RTC_CALI_RDY (BIT(15))
#define TIMG_RTC_CALI_RDY_M (BIT(15))
#define TIMG_RTC_CALI_RDY_V 0x1
#define TIMG_RTC_CALI_RDY_S 15
/* TIMG_RTC_CALI_CLK_SEL : R/W ;bitpos:[14:13] ;default: 2'h1 ; */
/*description: */
#define TIMG_RTC_CALI_CLK_SEL 0x00000003
#define TIMG_RTC_CALI_CLK_SEL_M ((TIMG_RTC_CALI_CLK_SEL_V)<<(TIMG_RTC_CALI_CLK_SEL_S))
#define TIMG_RTC_CALI_CLK_SEL_V 0x3
#define TIMG_RTC_CALI_CLK_SEL_S 13
/* TIMG_RTC_CALI_START_CYCLING : R/W ;bitpos:[12] ;default: 1'd1 ; */
/*description: */
#define TIMG_RTC_CALI_START_CYCLING (BIT(12))
#define TIMG_RTC_CALI_START_CYCLING_M (BIT(12))
#define TIMG_RTC_CALI_START_CYCLING_V 0x1
#define TIMG_RTC_CALI_START_CYCLING_S 12
#define TIMG_RTCCALICFG1_REG(i) (REG_TIMG_BASE(i) + 0x006c)
/* TIMG_RTC_CALI_VALUE : RO ;bitpos:[31:7] ;default: 25'h0 ; */
/*description: */
#define TIMG_RTC_CALI_VALUE 0x01FFFFFF
#define TIMG_RTC_CALI_VALUE_M ((TIMG_RTC_CALI_VALUE_V)<<(TIMG_RTC_CALI_VALUE_S))
#define TIMG_RTC_CALI_VALUE_V 0x1FFFFFF
#define TIMG_RTC_CALI_VALUE_S 7
#define TIMG_LACTCONFIG_REG(i) (REG_TIMG_BASE(i) + 0x0070)
/* TIMG_LACT_EN : R/W ;bitpos:[31] ;default: 1'h0 ; */
/*description: */
#define TIMG_LACT_EN (BIT(31))
#define TIMG_LACT_EN_M (BIT(31))
#define TIMG_LACT_EN_V 0x1
#define TIMG_LACT_EN_S 31
/* TIMG_LACT_INCREASE : R/W ;bitpos:[30] ;default: 1'h1 ; */
/*description: */
#define TIMG_LACT_INCREASE (BIT(30))
#define TIMG_LACT_INCREASE_M (BIT(30))
#define TIMG_LACT_INCREASE_V 0x1
#define TIMG_LACT_INCREASE_S 30
/* TIMG_LACT_AUTORELOAD : R/W ;bitpos:[29] ;default: 1'h1 ; */
/*description: */
#define TIMG_LACT_AUTORELOAD (BIT(29))
#define TIMG_LACT_AUTORELOAD_M (BIT(29))
#define TIMG_LACT_AUTORELOAD_V 0x1
#define TIMG_LACT_AUTORELOAD_S 29
/* TIMG_LACT_DIVIDER : R/W ;bitpos:[28:13] ;default: 16'h1 ; */
/*description: */
#define TIMG_LACT_DIVIDER 0x0000FFFF
#define TIMG_LACT_DIVIDER_M ((TIMG_LACT_DIVIDER_V)<<(TIMG_LACT_DIVIDER_S))
#define TIMG_LACT_DIVIDER_V 0xFFFF
#define TIMG_LACT_DIVIDER_S 13
/* TIMG_LACT_EDGE_INT_EN : R/W ;bitpos:[12] ;default: 1'h0 ; */
/*description: */
#define TIMG_LACT_EDGE_INT_EN (BIT(12))
#define TIMG_LACT_EDGE_INT_EN_M (BIT(12))
#define TIMG_LACT_EDGE_INT_EN_V 0x1
#define TIMG_LACT_EDGE_INT_EN_S 12
/* TIMG_LACT_LEVEL_INT_EN : R/W ;bitpos:[11] ;default: 1'h0 ; */
/*description: */
#define TIMG_LACT_LEVEL_INT_EN (BIT(11))
#define TIMG_LACT_LEVEL_INT_EN_M (BIT(11))
#define TIMG_LACT_LEVEL_INT_EN_V 0x1
#define TIMG_LACT_LEVEL_INT_EN_S 11
/* TIMG_LACT_ALARM_EN : R/W ;bitpos:[10] ;default: 1'h0 ; */
/*description: */
#define TIMG_LACT_ALARM_EN (BIT(10))
#define TIMG_LACT_ALARM_EN_M (BIT(10))
#define TIMG_LACT_ALARM_EN_V 0x1
#define TIMG_LACT_ALARM_EN_S 10
/* TIMG_LACT_LAC_EN : R/W ;bitpos:[9] ;default: 1'h1 ; */
/*description: */
#define TIMG_LACT_LAC_EN (BIT(9))
#define TIMG_LACT_LAC_EN_M (BIT(9))
#define TIMG_LACT_LAC_EN_V 0x1
#define TIMG_LACT_LAC_EN_S 9
/* TIMG_LACT_CPST_EN : R/W ;bitpos:[8] ;default: 1'h1 ; */
/*description: */
#define TIMG_LACT_CPST_EN (BIT(8))
#define TIMG_LACT_CPST_EN_M (BIT(8))
#define TIMG_LACT_CPST_EN_V 0x1
#define TIMG_LACT_CPST_EN_S 8
/* TIMG_LACT_RTC_ONLY : R/W ;bitpos:[7] ;default: 1'h0 ; */
/*description: */
#define TIMG_LACT_RTC_ONLY (BIT(7))
#define TIMG_LACT_RTC_ONLY_M (BIT(7))
#define TIMG_LACT_RTC_ONLY_V 0x1
#define TIMG_LACT_RTC_ONLY_S 7
#define TIMG_LACTRTC_REG(i) (REG_TIMG_BASE(i) + 0x0074)
/* TIMG_LACT_RTC_STEP_LEN : R/W ;bitpos:[31:6] ;default: 26'h0 ; */
/*description: */
#define TIMG_LACT_RTC_STEP_LEN 0x03FFFFFF
#define TIMG_LACT_RTC_STEP_LEN_M ((TIMG_LACT_RTC_STEP_LEN_V)<<(TIMG_LACT_RTC_STEP_LEN_S))
#define TIMG_LACT_RTC_STEP_LEN_V 0x3FFFFFF
#define TIMG_LACT_RTC_STEP_LEN_S 6
#define TIMG_LACTLO_REG(i) (REG_TIMG_BASE(i) + 0x0078)
/* TIMG_LACT_LO : RO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: */
#define TIMG_LACT_LO 0xFFFFFFFF
#define TIMG_LACT_LO_M ((TIMG_LACT_LO_V)<<(TIMG_LACT_LO_S))
#define TIMG_LACT_LO_V 0xFFFFFFFF
#define TIMG_LACT_LO_S 0
#define TIMG_LACTHI_REG(i) (REG_TIMG_BASE(i) + 0x007c)
/* TIMG_LACT_HI : RO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: */
#define TIMG_LACT_HI 0xFFFFFFFF
#define TIMG_LACT_HI_M ((TIMG_LACT_HI_V)<<(TIMG_LACT_HI_S))
#define TIMG_LACT_HI_V 0xFFFFFFFF
#define TIMG_LACT_HI_S 0
#define TIMG_LACTUPDATE_REG(i) (REG_TIMG_BASE(i) + 0x0080)
/* TIMG_LACT_UPDATE : WO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: */
#define TIMG_LACT_UPDATE 0xFFFFFFFF
#define TIMG_LACT_UPDATE_M ((TIMG_LACT_UPDATE_V)<<(TIMG_LACT_UPDATE_S))
#define TIMG_LACT_UPDATE_V 0xFFFFFFFF
#define TIMG_LACT_UPDATE_S 0
#define TIMG_LACTALARMLO_REG(i) (REG_TIMG_BASE(i) + 0x0084)
/* TIMG_LACT_ALARM_LO : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: */
#define TIMG_LACT_ALARM_LO 0xFFFFFFFF
#define TIMG_LACT_ALARM_LO_M ((TIMG_LACT_ALARM_LO_V)<<(TIMG_LACT_ALARM_LO_S))
#define TIMG_LACT_ALARM_LO_V 0xFFFFFFFF
#define TIMG_LACT_ALARM_LO_S 0
#define TIMG_LACTALARMHI_REG(i) (REG_TIMG_BASE(i) + 0x0088)
/* TIMG_LACT_ALARM_HI : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: */
#define TIMG_LACT_ALARM_HI 0xFFFFFFFF
#define TIMG_LACT_ALARM_HI_M ((TIMG_LACT_ALARM_HI_V)<<(TIMG_LACT_ALARM_HI_S))
#define TIMG_LACT_ALARM_HI_V 0xFFFFFFFF
#define TIMG_LACT_ALARM_HI_S 0
#define TIMG_LACTLOADLO_REG(i) (REG_TIMG_BASE(i) + 0x008c)
/* TIMG_LACT_LOAD_LO : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: */
#define TIMG_LACT_LOAD_LO 0xFFFFFFFF
#define TIMG_LACT_LOAD_LO_M ((TIMG_LACT_LOAD_LO_V)<<(TIMG_LACT_LOAD_LO_S))
#define TIMG_LACT_LOAD_LO_V 0xFFFFFFFF
#define TIMG_LACT_LOAD_LO_S 0
#define TIMG_LACTLOADHI_REG(i) (REG_TIMG_BASE(i) + 0x0090)
/* TIMG_LACT_LOAD_HI : R/W ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: */
#define TIMG_LACT_LOAD_HI 0xFFFFFFFF
#define TIMG_LACT_LOAD_HI_M ((TIMG_LACT_LOAD_HI_V)<<(TIMG_LACT_LOAD_HI_S))
#define TIMG_LACT_LOAD_HI_V 0xFFFFFFFF
#define TIMG_LACT_LOAD_HI_S 0
#define TIMG_LACTLOAD_REG(i) (REG_TIMG_BASE(i) + 0x0094)
/* TIMG_LACT_LOAD : WO ;bitpos:[31:0] ;default: 32'h0 ; */
/*description: */
#define TIMG_LACT_LOAD 0xFFFFFFFF
#define TIMG_LACT_LOAD_M ((TIMG_LACT_LOAD_V)<<(TIMG_LACT_LOAD_S))
#define TIMG_LACT_LOAD_V 0xFFFFFFFF
#define TIMG_LACT_LOAD_S 0
#define TIMG_INT_ENA_TIMERS_REG(i) (REG_TIMG_BASE(i) + 0x0098)
/* TIMG_LACT_INT_ENA : R/W ;bitpos:[3] ;default: 1'h0 ; */
/*description: */
#define TIMG_LACT_INT_ENA (BIT(3))
#define TIMG_LACT_INT_ENA_M (BIT(3))
#define TIMG_LACT_INT_ENA_V 0x1
#define TIMG_LACT_INT_ENA_S 3
/* TIMG_WDT_INT_ENA : R/W ;bitpos:[2] ;default: 1'h0 ; */
/*description: Interrupt when an interrupt stage timeout*/
#define TIMG_WDT_INT_ENA (BIT(2))
#define TIMG_WDT_INT_ENA_M (BIT(2))
#define TIMG_WDT_INT_ENA_V 0x1
#define TIMG_WDT_INT_ENA_S 2
/* TIMG_T1_INT_ENA : R/W ;bitpos:[1] ;default: 1'h0 ; */
/*description: interrupt when timer1 alarm*/
#define TIMG_T1_INT_ENA (BIT(1))
#define TIMG_T1_INT_ENA_M (BIT(1))
#define TIMG_T1_INT_ENA_V 0x1
#define TIMG_T1_INT_ENA_S 1
/* TIMG_T0_INT_ENA : R/W ;bitpos:[0] ;default: 1'h0 ; */
/*description: interrupt when timer0 alarm*/
#define TIMG_T0_INT_ENA (BIT(0))
#define TIMG_T0_INT_ENA_M (BIT(0))
#define TIMG_T0_INT_ENA_V 0x1
#define TIMG_T0_INT_ENA_S 0
#define TIMG_INT_RAW_TIMERS_REG(i) (REG_TIMG_BASE(i) + 0x009c)
/* TIMG_LACT_INT_RAW : RO ;bitpos:[3] ;default: 1'h0 ; */
/*description: */
#define TIMG_LACT_INT_RAW (BIT(3))
#define TIMG_LACT_INT_RAW_M (BIT(3))
#define TIMG_LACT_INT_RAW_V 0x1
#define TIMG_LACT_INT_RAW_S 3
/* TIMG_WDT_INT_RAW : RO ;bitpos:[2] ;default: 1'h0 ; */
/*description: Interrupt when an interrupt stage timeout*/
#define TIMG_WDT_INT_RAW (BIT(2))
#define TIMG_WDT_INT_RAW_M (BIT(2))
#define TIMG_WDT_INT_RAW_V 0x1
#define TIMG_WDT_INT_RAW_S 2
/* TIMG_T1_INT_RAW : RO ;bitpos:[1] ;default: 1'h0 ; */
/*description: interrupt when timer1 alarm*/
#define TIMG_T1_INT_RAW (BIT(1))
#define TIMG_T1_INT_RAW_M (BIT(1))
#define TIMG_T1_INT_RAW_V 0x1
#define TIMG_T1_INT_RAW_S 1
/* TIMG_T0_INT_RAW : RO ;bitpos:[0] ;default: 1'h0 ; */
/*description: interrupt when timer0 alarm*/
#define TIMG_T0_INT_RAW (BIT(0))
#define TIMG_T0_INT_RAW_M (BIT(0))
#define TIMG_T0_INT_RAW_V 0x1
#define TIMG_T0_INT_RAW_S 0
#define TIMG_INT_ST_TIMERS_REG(i) (REG_TIMG_BASE(i) + 0x00a0)
/* TIMG_LACT_INT_ST : RO ;bitpos:[3] ;default: 1'h0 ; */
/*description: */
#define TIMG_LACT_INT_ST (BIT(3))
#define TIMG_LACT_INT_ST_M (BIT(3))
#define TIMG_LACT_INT_ST_V 0x1
#define TIMG_LACT_INT_ST_S 3
/* TIMG_WDT_INT_ST : RO ;bitpos:[2] ;default: 1'h0 ; */
/*description: Interrupt when an interrupt stage timeout*/
#define TIMG_WDT_INT_ST (BIT(2))
#define TIMG_WDT_INT_ST_M (BIT(2))
#define TIMG_WDT_INT_ST_V 0x1
#define TIMG_WDT_INT_ST_S 2
/* TIMG_T1_INT_ST : RO ;bitpos:[1] ;default: 1'h0 ; */
/*description: interrupt when timer1 alarm*/
#define TIMG_T1_INT_ST (BIT(1))
#define TIMG_T1_INT_ST_M (BIT(1))
#define TIMG_T1_INT_ST_V 0x1
#define TIMG_T1_INT_ST_S 1
/* TIMG_T0_INT_ST : RO ;bitpos:[0] ;default: 1'h0 ; */
/*description: interrupt when timer0 alarm*/
#define TIMG_T0_INT_ST (BIT(0))
#define TIMG_T0_INT_ST_M (BIT(0))
#define TIMG_T0_INT_ST_V 0x1
#define TIMG_T0_INT_ST_S 0
#define TIMG_INT_CLR_TIMERS_REG(i) (REG_TIMG_BASE(i) + 0x00a4)
/* TIMG_LACT_INT_CLR : WO ;bitpos:[3] ;default: 1'h0 ; */
/*description: */
#define TIMG_LACT_INT_CLR (BIT(3))
#define TIMG_LACT_INT_CLR_M (BIT(3))
#define TIMG_LACT_INT_CLR_V 0x1
#define TIMG_LACT_INT_CLR_S 3
/* TIMG_WDT_INT_CLR : WO ;bitpos:[2] ;default: 1'h0 ; */
/*description: Interrupt when an interrupt stage timeout*/
#define TIMG_WDT_INT_CLR (BIT(2))
#define TIMG_WDT_INT_CLR_M (BIT(2))
#define TIMG_WDT_INT_CLR_V 0x1
#define TIMG_WDT_INT_CLR_S 2
/* TIMG_T1_INT_CLR : WO ;bitpos:[1] ;default: 1'h0 ; */
/*description: interrupt when timer1 alarm*/
#define TIMG_T1_INT_CLR (BIT(1))
#define TIMG_T1_INT_CLR_M (BIT(1))
#define TIMG_T1_INT_CLR_V 0x1
#define TIMG_T1_INT_CLR_S 1
/* TIMG_T0_INT_CLR : WO ;bitpos:[0] ;default: 1'h0 ; */
/*description: interrupt when timer0 alarm*/
#define TIMG_T0_INT_CLR (BIT(0))
#define TIMG_T0_INT_CLR_M (BIT(0))
#define TIMG_T0_INT_CLR_V 0x1
#define TIMG_T0_INT_CLR_S 0
#define TIMG_NTIMERS_DATE_REG(i) (REG_TIMG_BASE(i) + 0x00f8)
/* TIMG_NTIMERS_DATE : R/W ;bitpos:[27:0] ;default: 28'h1604290 ; */
/*description: Version of this regfile*/
#define TIMG_NTIMERS_DATE 0x0FFFFFFF
#define TIMG_NTIMERS_DATE_M ((TIMG_NTIMERS_DATE_V)<<(TIMG_NTIMERS_DATE_S))
#define TIMG_NTIMERS_DATE_V 0xFFFFFFF
#define TIMG_NTIMERS_DATE_S 0
#define TIMGCLK_REG(i) (REG_TIMG_BASE(i) + 0x00fc)
/* TIMG_CLK_EN : R/W ;bitpos:[31] ;default: 1'h0 ; */
/*description: Force clock enable for this regfile*/
#define TIMG_CLK_EN (BIT(31))
#define TIMG_CLK_EN_M (BIT(31))
#define TIMG_CLK_EN_V 0x1
#define TIMG_CLK_EN_S 31
#ifdef __cplusplus
}
#endif
``` |
Nell Hopman and Harry Hopman were the defending champions and second seeds, but they lost in the quarterfinals.
In an all-unseeded final Margaret Wilson and John Bromwich defeated Nancye Wynne and Colin Long 6–3, 6–2, to win the mixed doubles tennis title at the 1938 Australian Championships.
Seeds
Dorothy Bundy / Don Budge (quarterfinals)
Nell Hopman / Harry Hopman (quarterfinals)
Thelma Coyne / Jack Crawford (semifinals)
Dorothy Workman / Gene Mako (semifinals)
Draw
Finals
Earlier rounds
Top half
Bottom half
References
External links
Sources for seedings
1938 in Australian tennis
Mixed Doubles |
The O'Reilly Theatre is a flexible studio theatre located within Keble College, one of the University of Oxford colleges. The theatre was completed in 2002.
Seating capacity of the space ranges from 128 to 240, depending on the setup chosen. The standard configuration is end-on, but alternatives include traverse and in-the-round. The theatre is named after Tony O'Reilly, the billionaire Irish businessman and former international rugby union player, who contributed most of the funds.
Performances
The Theatre is managed by the Martin Esslin Society, who are responsible for choosing the productions staged in the theatre each term.
2020
The Entertainer - Febuary 6 - Febuary 10
2018
Twelth Night - January 17 - January 20
The 39 Steps - January 31 - Febuary 3
Oxford Alternotives - March 7
Other
More performances have occured but are not listed.
External links
O'Reilly Theatre - Keble College
Keble O'Reilly Website
Events
References
Theatres completed in 2002
Theatres in Oxford
Keble College, Oxford
Student theatre in the United Kingdom
Tony O'Reilly family
Studio theatres in Oxford
University and college theatres in Oxford
Buildings and structures of the University of Oxford
2002 establishments in England |
Jesse Michael Bering (born May 6, 1975) is an American psychologist, writer, and academic. He is a professor in Science Communication at the University of Otago (where he serves as Director of the Centre for Science Communication), as well as a frequent contributor to Scientific American, Slate, and Das Magazin (Switzerland). His work has also appeared in New York Magazine, The Guardian, and The New Republic, and has been featured on NPR, the BBC, Playboy Radio and elsewhere.
Early life and education
Bering was born in 1975 in New Jersey, the son of a secular Jewish mother and a non-religious Lutheran father. Having grown up in a highly conservative culture, he reports feeling anxiety about his sexual orientation during his childhood. This experience led to his interest in academic disciplines like human sexuality and the cognitive science of religion. He attended graduate school at the University of Louisiana at Lafayette where he earned his MA degree (1999) under Daniel J. Povinelli. He then transferred to Florida Atlantic University, where he obtained a PhD in developmental psychology (2002). His doctoral advisor was the David F. Bjorklund. Bering's formal academic research is in the area of the cognitive science of religion.
Career and views
Bering is the former director of the Institute of Cognition and Culture at Queen's University Belfast and began his career as a psychology professor at the University of Arkansas. After a period as a full-time writer and professor at Wells College, he took up a science communication post at the University of Otago in 2014.
Bering is notable for his frank and humorous handling of controversial issues in psychological science, especially those dealing with human sexuality. His Scientific American blog, Bering in Mind, was named a 2010 Webby Award Honoree for the Blog-Cultural category by members of The International Academy of Digital Arts and Sciences. He also received the 2010 "Scientist of the Year Award" from the National Organization of Gay and Lesbian Scientists and Technical Professionals (NOGLSTP), an affiliate of the American Association for the Advancement of Science.
He is also a Project Partner in the Oxford University-based 'Explaining Religion' project, a three-year, €2 million project funded by the European Commission.
In his book Perv: The Sexual Deviant in All of Us he argues that paraphilias (so-called "sexual perversions" or "deviancies") should be viewed objectively and judged by the harm they cause, not by moral disgust. His account, in a somewhat light-hearted manner, includes anecdotes of his own experiences as a gay teenager.
Works
The Belief Instinct: The Psychology of Souls, Destiny, and the Meaning of Life (W. W. Norton, 2011) – named one of the top 25 books of 2011 by the American Library Association.
Why is the Penis Shaped Like That? And Other Reflections on Being Human (Farrar, Straus & Giroux, 2012)
Perv: The Sexual Deviant in All of Us (Farrar, Straus & Giroux, 2013)
Suicidal: Why We Kill Ourselves (University of Chicago Press, 2018).
References
External links
University of Otago staff profile
1975 births
Living people
21st-century American psychologists
American science writers
Florida Atlantic University alumni
Evolutionary psychologists
University of Arkansas faculty
Gay Jews
American LGBT scientists
Jewish American academics
American gay writers
Cognitive science of religion
Gay scientists
Academic staff of the University of Otago
LGBT psychologists |
Jean Degros (born 18 November 1939) is a French basketball player. He competed in the men's tournament at the 1960 Summer Olympics.
References
External links
1939 births
Living people
French men's basketball players
1963 FIBA World Championship players
Olympic basketball players for France
Basketball players at the 1960 Summer Olympics
Sportspeople from Nord (French department) |
The 399th Tactical Missile Wing is an inactive United States Air Force unit. The unit was formed in 1985 by the consolidation of two inactive units.
The 399th Bombardment Group was activated in March 1943 and served as an Operational Training Unit, then as a Replacement Training Unit until it was disbanded in March 1944 when the Army Air Forces reorganized its training and support units in the United States.
The 589th Tactical Missile Group was a TM-61 Matador training unit, which served in Florida from 1957 through 1958.
History
Bombardment training
The wing's first predecessor was the 399th Bombardment Group, which was activated at Davis-Monthan Field, Arizona on 1 March 1943, but made two moves the following month, arriving at Wendover Field, Utah on 27 April. The group was composed of the 604th, 605th, 606th, and 607th Bombardment Squadrons. At Wendover, it served as an Operational Training Unit (OTU) for Consolidated B-24 Liberator units until August. The OTU program involved the use of an oversized parent unit to provide cadres to "satellite groups".
The group became a Replacement Training Unit (RTU). Like OTUs, RTUs were oversize units, however their mission was to train individual pilots and aircrews. Following this mission change, the 399th was reassigned from Second Air Force to Fourth Air Force, then moved to March Field, California in December.
However, the Army Air Forces was finding that standard military units like the 399th, which were assigned personnel and equipment based on relatively inflexible tables of organization were not proving well adapted to the training mission. Accordingly, it adopted a more functional system in which each base was organized into a separate numbered unit, which was manned and equipped based on the station's requirements. The 399th Group was disbanded, and along with its elements and supporting units at March was used to form the 420th AAF Base Unit (Bombardment Replacement Training Unit-Heavy).
Missile training
The second predecessor of the wing was the 589th Tactical Missile Group, which was activated at Orlando Air Force Base, Florida on 8 March 1957 as a training unit for the TM-61 Matador cruise missile. The group formed part of the 4504th Tactical Missile Wing. In April 1958, the group's missile squadron, the 24th Tactical Missile Squadron was transferred to the 588th Tactical Missile Group, when the 588th's 17th Tactical Missile Squadron deployed to Taiwan independently and plans were developed to deploy the 588th to Osan Air Base, South Korea. Although the 24th engaged in crew training at Orlando, it never received any missiles. The squadron did, however, deploy to Cape Canaveral Air Force Station, where it launched TM-61 Matador missiles under the guidance of the 6555th Guided Missile Squadron. The group was then inactivated on 8 June 58, when its training functions were assigned directly to the 4504th Wing's 4504th Missile Training Squadron.
The 399th Bombardment Group was reconstituted in July 1985 and consolidated with the 589th Tactical Missile Group as the 399th Tactical Missile Wing, but has not been active since.
Lineage
399th Bombardment Group
Constituted as 399th Bombardment Group (Heavy) on 15 February 1943
Activated on 1 March 1943
Disbanded on 31 March 1944
Reconstituted and consolidated with the 589th Tactical Missile Group as the 399th Tactical Missile Wing on 31 July 1985
399th Tactical Missile Wing
Constituted as the 589th Tactical Missile Group on 9 November 1956
Activated on 8 March 1957
Inactivated on 8 June 1958
Consolidated with the 399th Bombardment Group as the 399th Tactical Missile Wing on 31 July 1985
Assignments
II Bomber Command, 1 March 1943
Second Air Force, 6 October 1943
IV Bomber Command, 3 December 1943 – 31 March 1944
4504 Tactical Missile Wing, 8 March 1957 – 8 June 1958
Components
24th Tactical Missile Squadron: 15 March 1957 – 25 April 1958
589th Support Squadron: 15 March 1957 – 8 June 1958
604th Bombardment Squadron: 1 March 1943 – 31 March 1944
605th Bombardment Squadron: 1 March 1943 – 31 March 1944
606th Bombardment Squadron: 1 March 1943 – 31 March 1944
607th Bombardment Squadron: 1 March 1943 – 31 March 1944
Stations
Davis-Monthan Field, Arizona, 1 March 1943
Gowen Field, Idaho 10 April 1943
Wendover Field, Utah, 27 April 1943
March Field, California, 3 December 1943 – 31 March 1944
Orlando Air Force Base, Florida, 8 March 1957 – 8 June 1958
Aircraft and missiles
Consolidated B-24 Liberator, 1943–1944
Martin TM-61 Matador, 1957–1958
References
Notes
Bibliography
Military units and formations established in 1985
Missile wings of the United States Air Force
1985 establishments in the United States |
Lemuel Jackson Bowden (January 16, 1815January 2, 1864) was an American lawyer and politician from Williamsburg, Virginia.
Early life
Bowden was born in 1815 in Williamsburg, Virginia, and graduated from the College of William and Mary in 1831-1832.
Career
As an adult, Bowden settled in Williamsburg and practiced law there. He was elected to the Virginia House of Delegates three times, serving from 1841 to 1846.
In 1850, Lyons was elected to the Virginia Constitutional Convention of 1850. He was one of two delegates elected from the Tidewater delegate district made up of Essex, King and Queen, Middlesex and Mathews Counties.
In 1860, he was a presidential elector from his Congressional District.
During the American Civil War Bowden served as mayor of Williamsburg, Virginia from 1862 to 1863 in a region occupied by Federal troops. Following the creation of West Virginia organized by Unionist Virginians in 1863, the Restored Government of Virginia chose Bowden to represent Virginia in the United States Senate in 1863 as a member of the Unionist Party. There he served until his death.
Death and family
Bowden died on January 2, 1864, of smallpox while in office at Washington, D.C. and he is buried in the Congressional Cemetery there.
Bowden's son, Thomas Russell Bowden, served as Attorney General of Virginia in both the Restored Government and the post-war Reconstruction era government, and his nephew, George E. Bowden, represented Virginia's 2nd congressional district in the United States House of Representatives from 1887 to 1891.
See also
List of United States Congress members who died in office (1790–1899)
References
Bibliography
External links
Biographic sketch at U.S. Congress website
1815 births
1864 deaths
People from Williamsburg, Virginia
American people of French descent
Unionist Party United States senators from Virginia
Democratic Party United States senators from Virginia
Virginia Unionists
Mayors of Williamsburg, Virginia
Virginia lawyers
College of William & Mary alumni
People of Virginia in the American Civil War
Southern Unionists in the American Civil War
Deaths from smallpox
Burials at the Congressional Cemetery
United States senators who owned slaves |
The San Diego Film Critics Society Award for Best Actor is an award given by the San Diego Film Critics Society to honor the finest male acting achievementes in film-making.
Winners
1990s
2000s
2010s
2020s
References
San Diego Film Critics Society - Awards
Film awards for lead actor |
```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.
*
* Contributors:
* ohun@live.cn ()
*/
package com.mpush.api.common;
import java.util.concurrent.Executor;
/**
* Created by ohun on 2017/7/15.
*
* @author ohun@live.cn ()
*/
public interface Monitor {
void monitor(String name, Thread thread);
void monitor(String name, Executor executor);
}
``` |
"Succubus" is the third episode of the third season of the American animated television series South Park, and the 34th episode of the series overall. It originally aired on Comedy Central in the United States on April 21, 1999.
Plot
Eric Cartman must go to the local eye doctor, whom he hates because the doctor always makes fun of his obesity by referring to him as "Piggy". Cartman is told that he has bad vision and has his eyes dilated; he is later given a pair of thick-rimmed glasses which are then stapled to his head so that he cannot take them off. Later, he and the other boys discover that Chef has quit his job at South Park Elementary and has been replaced by Mr. Derp, a cliché cartoon character who tries (and fails) to win them over with his poor slapstick comedy gags.
They then find out that Chef has a new girlfriend, Veronica, (voiced by Michael Ann Young) who has caused his life to change from that of a free-spirited, soul-singing cafeteria chef to that of a mediocre office worker. She is also extremely fond of singing the love theme from The Poseidon Adventure, "The Morning After" at inappropriate times. The boys believe that she is trying to steal Chef away from them and are dismayed when they discover that the two are planning to get married.
Not wanting Chef to go too, the boys seek advice from Mr. Garrison, who suggests that Veronica is a succubus: a demoness sent from hell to prey on and suck the life out of men.
Meanwhile, a botched attempt at laser eye surgery leaves Cartman temporarily blinded. While the others mock him, Veronica comes to visit them. She manages to convince them that she is not a monster but, just as she is about to leave, suddenly takes on a demonic face, laughing maniacally and declaring that they cannot stop her from marrying Chef. The boys try to tell Chef of this at the rehearsal dinner, but he angrily shuts them out. They go back to Cartman's place to formulate a plan to stop the wedding.
The boys discover that a succubus controls the minds of men with a melody and that playing it backwards will vanquish it. They remember that Veronica always sings "The Morning After" and proceed to learn how to sing the song backwards. At the wedding, they play a tape of the song backwards while Stan and Kyle sing the words in reverse order. Veronica begins to lose her hold on her human form. When the tape gets jammed, she peels off her human disguise and reverts to her true shape—a bizarre, red-eyed, bat-winged, witch/hag-like monster—flying around and wrecking the church (and killing Kenny in the process). When the boys finish singing the song, Veronica is sucked back into Hell. Chef, no longer under her evil spell, apologizes to the boys for ignoring them and eventually returns to their school as the chef and as his old self.
Cartman returns to his optometrist, who tells him that, with eyes as bad as his, he will always have to wear glasses. He solves this problem by convincing the doctor to give him an eye transplant, using Kenny's frozen head as a donor. The optometrist then asks for $3.50, suggesting that Chef's parents' tales were not entirely fabricated.
Production
Parker and Stone say in the DVD commentary that the sketch involving the Loch Ness Monster was the inspiration for the character Chef. Originally Comedy Central wouldn't let the creators voice African-American characters on the show. The episode also introduces the word Derp. A television promo of the episode showed that the character Ms. Crabtree was originally Chef's replacement in the episode.
References
External links
"Succubus" Full Episode at South Park Studios
1999 American television episodes
South Park (season 3) episodes
Demons in television
Television episodes about weddings
Succubi in popular culture |
Bråstad Church () is a parish church of the Church of Norway in Gjøvik Municipality in Innlandet county, Norway. It is located in the village of Bråstad. It is the church for the Bråstad parish which is part of the Toten prosti (deanery) in the Diocese of Hamar. The brown, wooden church was built in a long church design in 1963 using plans drawn up by the architect Per Nordan. The church seats about 200 people.
History
The earliest existing historical records of the church date back to the year 1365, but the church was not built that year. The first church in Bråstad was a wooden stave church that was likely built during the 13th century. This church was built on a site about to the southeast of the present church site. Historically, the name was spelled Brodstadt. In 1664, the old church was torn down and a new timber-framed long church was built on the same site. Some of the interior furnishings from the old church were reused in the new church, including the pulpit. In 1694, a new sacristy was constructed on the north side of the chancel. In the early 1800s, the parish decided to close down the Bråstad Church and the Old Hunn Church and to replace both of them with a new Gjøvik Church which would be built a short distance away in a new location inside the borders of the growing town. In 1821, the new church opened and soon afterwards, the old Bråstad Church was closed and torn down.
During World War II, the people of the Bråstad area began pushing for a chapel to be built in their area once again. Land was donated by Sverre Braastad for the purposes of building a chapel and graveyard. The new chapel was designed by architect Per Nordan. The new Bråstad Chapel (as it was originally titled) was consecrated on 29 December 1963 by Bishop Kristian Schjelderup. Today, the building is a parish church so it is now titled as a church rather than a chapel.
See also
List of churches in Hamar
References
Gjøvik
Churches in Innlandet
Churches in Toten Deanery
Long churches in Norway
Wooden churches in Norway
20th-century Church of Norway church buildings
Churches completed in 1963
1963 establishments in Norway |
Pequeñas coincidencias () is a Spanish romantic comedy television series created by Javier Veiga starring Marta Hazas and Veiga himself. Its three seasons were released on Amazon Prime Video between 2018 and 2021.
Premise
The fiction focuses on the ups and downs of the relationship between Javi (Javier Veiga) and Marta (Marta Hazas).
Cast
Marta Hazas as Marta Valdivia.
as Javier Rubirosa.
Mariano Peña as Joaquín.
as Nacho.
Alicia Rubio as Elisa.
Marta Castellote as Carla.
Alosian Vivancos as Diego.
Juan López-Tagle as Giovanni.
Lucía Balas as Niña.
Álvaro Balas as Niño.
Unax Ugalde as Mario.
as Rafa.
Tomás Pozzi as David.
José Troncoso as Josemi.
Production and release
Created by Javier Veiga, the series was produced by Amazon Prime Video together with Atresmedia Studio, Onza Entertainment and MedioLimón. Together with Veiga, the scripwriting team of the first season was formed by Marta G. De Vega, Abraham Sastre, María Miranda, Germán Aparicio, Alonso Laporta, Daniel Monedero, Jorge López, Gerald Fillmore and Cristina Pons. It was shot on location in Madrid. Veiga, Mario Montero and Miguel Conde directed the episodes of the first season.
The first season of Pequeñas coincidencias, consisting of 8 episodes featuring a running time of around 50 minutes, premiered on 7 December 2018 on Amazon Prime Video. The series began its free-to-air broadcasting run on Antena 3 on 2 September 2019. Amazon Prime Video simultaneously released the second season in Spain, Latin America and the United States on 15 January 2020. It consisted of 12 episodes with a running time of 25–30minutes. Comprising 10 episodes, the third and final season was released on 5 February 2021 on Prime Video. NBC purchased the rights to produce an American remake, tentatively titled Someone Out There, whose production was put in hold by the COVID-19 pandemic.
Awards and nominations
|-
| align = "center" | 2019 || colspan = "2" | 7th || Best Comedy Series || ||
|-
| align = "center" | 2021? || 23rd Iris Awards || Best Actor || Javier Veiga || ||
|}
References
Television shows filmed in Spain
2010s Spanish comedy television series
2020s Spanish comedy television series
2010s romantic comedy television series
2020s romantic comedy television series
2018 Spanish television series debuts
2021 Spanish television series endings
Spanish-language television shows
Spanish-language Amazon Prime Video original programming
Television series by Onza |
Martin Edward McInnis (born June 5, 1970) is an American former ice hockey player who played in the National Hockey League for the New York Islanders, Calgary Flames, Mighty Ducks of Anaheim and the Boston Bruins. An eighth round selection of the Islanders, 163rd overall at the 1988 NHL Entry Draft, McInnis played three seasons of college hockey with the Boston College Eagles and played with the United States National Team at the 1992 Winter Olympics before turning professional. He scored 170 goals and recorded 420 points in a 12-year professional career and played in two World Championship tournaments where he was a member of the bronze medal-winning American squad in 1996. An inductee of Boston College's Varsity Club Athletic Hall of Fame, McInnis returned to the school in 2013 as an assistant coach.
Playing career
McInnis played two seasons of high school hockey for Milton Academy in Milton, Massachusetts between 1986 and 1988 where he averaged in excess of one point per game. He was selected by the New York Islanders, 163rd overall, at the 1988 NHL Entry Draft but chose to play college hockey with the Boston College Eagles before embarking on a professional career. McInnis finished third in conference scoring in 1989–90 and tied a Hockey East record with five goals in one game in an 8–5 victory over Merrimack College on March 5, 1990. McInnis recorded 142 points in three seasons at Boston College.
Opting to remain amateur so he could play in the Olympics, McInnis spent the majority of the 1991–92 season with the United States men's national ice hockey team where he recorded 34 points in 54 games. At the 1992 Albertville Olympics, McInnis led the American team in scoring with five goals and two assists in eight games as the United States finished fourth in the tournament. McInnis turned professional following the tournament as he joined the Islanders for 15 games late in the 1991–92 NHL season where he scored three goals and five assists. He made his NHL debut on March 3, 1992, against the Montreal Canadiens and scored his first goal on March 8 against goaltender Tom Draper of the Buffalo Sabres.
After splitting the 1992–93 season between New York and the American Hockey League's Capital District Islanders, McInnis joined New York full-time for 1993–94 and led the Islanders in plus-minus at +31. His totals of 25 goals and 56 points were each the highest he would score in his career. After scoring only 16 points in the lockout-shortened 1994–95 season, McInnis finished third in team scoring with 46 points in 1995–96. Following the NHL season, he joined Team USA for the 1996 World Championship. In seven games, McInnis recorded two assists for the bronze medal-winning Americans. He returned for the 1997 tournament where he scored four points in a sixth-place effort by the United States.
On March 18, 1997, McInnis was traded, along with Tyrone Garner and a draft pick to the Calgary Flames in exchange for Robert Reichel. Combined between the two teams, McInnis finished the 1996–97 season with 23 goals and 49 points in 80 games. He was primarily a checking line forward and penalty killer in his only full season with the Flames, 1998–99. Six games into the 1998–99 season, McInnis was traded twice on the same day. On October 27, 1998, the Flames sent him to the Chicago Blackhawks, along with Erik Andersson and Jamie Allison, in exchange for Jeff Shantz and Steve Dubinsky. He was then immediately sent by Chicago to the Mighty Ducks of Anaheim for a fourth round draft pick. Shortly after the trades, Chicago's general manager, Bob Murray, admitted he regretted trading McInnis so quickly, particularly after McInnis found early success on Anaheim's top scoring line as a replacement for the injured Teemu Selänne. He finished the season with 54 points, and two seasons later, scored 20 goals and 42 points for the Mighty Ducks.
Late in the 2001–02 season, Anaheim sent him to the Boston Bruins in a March 6, 2002, trade in exchange for a third round draft pick. McInnis was excited by the deal as it afforded him the opportunity to play for his hometown team. He finished the season with 28 points in 79 games between the two teams. Following a final NHL season in 2002–03, he retired. McInnis finished his career with 420 points in 796 games.
Boston College inducted McInnis into its Varsity Club Hall of Fame in 2012. He returned to the school in 2013 to serve as a volunteer assistant coach.
Career statistics
Regular season and playoffs
International
References
Career statistics:
External links
Official biography, Boston College Eagles
1970 births
Living people
American men's ice hockey left wingers
American ice hockey coaches
Boston Bruins players
Calgary Flames players
Ice hockey coaches from Massachusetts
Ice hockey players at the 1992 Winter Olympics
Mighty Ducks of Anaheim players
New York Islanders draft picks
New York Islanders players
Olympic ice hockey players for the United States
People from Hingham, Massachusetts
Sportspeople from Plymouth County, Massachusetts
Ice hockey players from Massachusetts |
Sands is an English and Scottish surname. Notable people with the surname include:
Benjamin Aymar Sands (1853–1917), American lawyer
Benjamin F. Sands (1811–1883), officer in the United States Navy during the Mexican–American War and the American Civil War
Bethanie Mattek-Sands (born 1985), American tennis player
Billy Sands (1911–1984), American character actor
Bobby Sands (1954–1981), Irish republican who died in the 1981 Irish Hunger Strike
Bradley Sands (born 1978), American author and editor
Charlie Sands (baseball) (1947–2016), baseball player
Charlie Sands (ice hockey) (1911–1953), ice hockey player
Charles Sands (1865–1945), American golfer and tennis player
Cole Sands (born 1997), American baseball player
Comfort Sands (1748–1834), American politician
Dave Sands (1926–1952), Australian aborigine boxer
Diana Sands (1934–1973), African-American actress
Diane Sands (born 1947), American politician from Montana
Donny Sands (born 1996), American baseball player
Edward F. Sands (1894–19??), suspect in the murder of Hollywood director William Desmond Taylor
Evie Sands (born 1946), American singer, songwriter and musician
Ferdinand Sands (1806–1839), American lawyer
James Sands (born 2000), American soccer player
James H. Sands (1845–1911), officer in the United States Navy during the American Civil War
Jerry Sands (born 1987), American baseball player
Jodie Sands, American singer
John Sands (1826–1900), Scottish journalist and artist
John Sands (footballer) (1859–1924), English footballer
Johnny Sands (1928–2003), American actor
Joshua Sands (politician) (1757–1835), member of the United States House of Representatives from New York.
Joshua R. Sands (1795–1883), United States Navy officer
Julian Sands (1958–2023), British actor
Leevan Sands (born 1981), Bahamian triple jumper and Olympic medallist
Lynsay Sands, Canadian author of over 30 books
Marvin Sands (1924–1999), American businessman, founder and CEO of Constellation Brands
Michael Sands (media) (1945–2012), American model, actor and media consultant
Mike Sands (athlete) (born 1953), Bahamian sprint athlete and athletics official
Mike Sands (ice hockey) (born 1963), Canadian ice hockey player
Percy Sands (1881–1965), English footballer
Peter Sands (banker) (born 1961), CEO of Standard Chartered Bank
Peter Sands (politician) (1924–2015), Irish Fianna Fáil politician
Philippe Sands (born 1960), British professor of international law and author of Lawless World
Renee Sands (born 1974), American singer and actress
Richard Sands (businessman) (born 1950), American billionaire, chairman of Constellation Brands
Rob Sands (born 1958/59), American billionaire, CEO of Constellation Brands
Robert Sands (artist) (born 1943), American artist
Robert Sands (conductor) (1828–1872), Irish-born conductor of the Mormon Tabernacle Choir in the United States' Utah Territory
Robert Charles Sands (1799–1832), American writer
Roger Sands (born 1942), British public servant
Roland Sands (born 1974), American motorcycle racer
Sarah Sands (born 1961), British journalist and author
Shamar Sands (born 1985), Bahamian hurdler
Stafford Sands (1913–1972), finance minister of the Bahamas, helped create the Bahamas' tourism industry
Tara Sands (born 1975), American voice actress
Terdell Sands (born 1979), American football player
Tom Sands (born 1954), American politician from Iowa
Tommy Sands (American singer) (born 1937), American singer and actor
Tommy Sands (Irish singer) (born 1945), Northern Irish folk singer, songwriter, radio broadcaster, and political activist
Walter B. Sands (1870–1938), chief justice of the Montana Supreme Court
Fictional characters:
George Sands, a lead character in the British television series Being Human
Sheldon Sands, a CIA agent (portrayed by Johnny Depp) from the 2003 movie Once Upon a Time in Mexico
Max Sands, a racist biker in the HBO drama Oz
See also
Sand (surname)
Sandys (surname)
Michael Sands (disambiguation)
English-language surnames
Scottish surnames |
```html
<!DOCTYPE html>
<html xmlns="path_to_url"><head><title>Mat (owl.Owl_regression.Make_Embedded.Optimise.Algodiff.Mat)</title><meta charset="utf-8"/><link rel="stylesheet" href="../../../../../../odoc.support/odoc.css"/><meta name="generator" content="odoc 2.4.2"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../odoc.support/highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body class="odoc"><nav class="odoc-nav"><a href="../index.html">Up</a> <a href="../../../../../index.html">owl</a> » <a href="../../../../index.html">Owl_regression</a> » <a href="../../../index.html">Make_Embedded</a> » <a href="../../index.html">Optimise</a> » <a href="../index.html">Algodiff</a> » Mat</nav><header class="odoc-preamble"><h1>Module <code><span>Algodiff.Mat</span></code></h1></header><div class="odoc-content"><div class="odoc-spec"><div class="spec value anchored" id="val-empty"><a href="#val-empty" class="anchor"></a><code><span><span class="keyword">val</span> empty : <span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-zeros"><a href="#val-zeros" class="anchor"></a><code><span><span class="keyword">val</span> zeros : <span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-eye"><a href="#val-eye" class="anchor"></a><code><span><span class="keyword">val</span> eye : <span>int <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-ones"><a href="#val-ones" class="anchor"></a><code><span><span class="keyword">val</span> ones : <span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-uniform"><a href="#val-uniform" class="anchor"></a><code><span><span class="keyword">val</span> uniform : <span><span class="optlabel">?a</span>:<a href="../A/index.html#type-elt">A.elt</a> <span class="arrow">-></span></span> <span><span class="optlabel">?b</span>:<a href="../A/index.html#type-elt">A.elt</a> <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-gaussian"><a href="#val-gaussian" class="anchor"></a><code><span><span class="keyword">val</span> gaussian : <span><span class="optlabel">?mu</span>:<a href="../A/index.html#type-elt">A.elt</a> <span class="arrow">-></span></span> <span><span class="optlabel">?sigma</span>:<a href="../A/index.html#type-elt">A.elt</a> <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-shape"><a href="#val-shape" class="anchor"></a><code><span><span class="keyword">val</span> shape : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> int * int</span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-numel"><a href="#val-numel" class="anchor"></a><code><span><span class="keyword">val</span> numel : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> int</span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-row_num"><a href="#val-row_num" class="anchor"></a><code><span><span class="keyword">val</span> row_num : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> int</span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-col_num"><a href="#val-col_num" class="anchor"></a><code><span><span class="keyword">val</span> col_num : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> int</span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-reset"><a href="#val-reset" class="anchor"></a><code><span><span class="keyword">val</span> reset : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> unit</span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-reshape"><a href="#val-reshape" class="anchor"></a><code><span><span class="keyword">val</span> reshape : <span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get"><a href="#val-get" class="anchor"></a><code><span><span class="keyword">val</span> get : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set"><a href="#val-set" class="anchor"></a><code><span><span class="keyword">val</span> set : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-row"><a href="#val-row" class="anchor"></a><code><span><span class="keyword">val</span> row : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-mean"><a href="#val-mean" class="anchor"></a><code><span><span class="keyword">val</span> mean : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-add"><a href="#val-add" class="anchor"></a><code><span><span class="keyword">val</span> add : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sub"><a href="#val-sub" class="anchor"></a><code><span><span class="keyword">val</span> sub : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-mul"><a href="#val-mul" class="anchor"></a><code><span><span class="keyword">val</span> mul : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-div"><a href="#val-div" class="anchor"></a><code><span><span class="keyword">val</span> div : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dot"><a href="#val-dot" class="anchor"></a><code><span><span class="keyword">val</span> dot : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-map_by_row"><a href="#val-map_by_row" class="anchor"></a><code><span><span class="keyword">val</span> map_by_row : <span><span>(<span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a>)</span> <span class="arrow">-></span></span> <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-of_arrays"><a href="#val-of_arrays" class="anchor"></a><code><span><span class="keyword">val</span> of_arrays : <span><span><span><a href="../A/index.html#type-elt">A.elt</a> array</span> array</span> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-init_2d"><a href="#val-init_2d" class="anchor"></a><code><span><span class="keyword">val</span> init_2d : <span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <span><span>(<span>int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a>)</span> <span class="arrow">-></span></span> <a href="../index.html#type-t">t</a></span></code></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-print"><a href="#val-print" class="anchor"></a><code><span><span class="keyword">val</span> print : <span><a href="../index.html#type-t">t</a> <span class="arrow">-></span></span> unit</span></code></div></div></div></body></html>
``` |
Reek Sunday () or Garland Sunday is an annual day of pilgrimage in Ireland. On the last Sunday in July, thousands of pilgrims climb Ireland's holiest mountain, Croagh Patrick (764 metres) in County Mayo. It is held in honour of Saint Patrick who is said to have spent forty days fasting on the mountain in the 5th century. Masses are held at the summit, where there is a small chapel. Some climb the mountain barefoot, as an act of penance, and some carry out 'rounding rituals', which were formerly a key part of the pilgrimage. This involves praying while walking sunwise around features on the mountain: seven times around the cairn of Leacht Benáin (Benan's grave), fifteen times around the circular perimeter of the summit, seven times around Leaba Phádraig (Patrick's bed), and then seven times around three ancient burial cairns known as Reilig Mhuire (Mary's cemetery). Until 1970, it was traditional for pilgrims to climb the mountain after sunset.
The pilgrimage has been held yearly for at least 1,500 years. It is likely that it pre-dates Christianity and was originally a ritual associated with the festival of Lughnasadh. Pilgrimages were made to the tops of many other mountains at this time of year, such as Knocknadobar, Drung Hill, Mount Brandon, and Slievecallan in Munster, Slieve Donard in Ulster and Church Mountain in Leinster. The earliest surviving mention of a pilgrimage at Croagh Patrick is from the year 1113, when the Annals of Ulster record that "a ball of fire came on the night of the feast of Patrick on Cruacháin Aighle [Croagh Patrick] and destroyed thirty of those fasting". Historically, pilgrimages were made to the mountaintop on Saint Patrick's Day, the Feast of the Assumption, and the last Friday in July (Crom Dubh's Friday).
Today, most pilgrims climb Croagh Patrick from the direction of Murrisk Abbey to the north. Originally, most pilgrims climbed the mountain from the east, following the Togher Patrick (Tochár Phádraig) pilgrim path from Ballintubber Abbey. This route is dotted with prehistoric monuments. The Tochár Phádraig may have originally been the main route to the mountain from Cruachan, seat of the Kings of Connacht. The Tochar Phadraig was revived and reopened by Pilgrim Paths of Ireland.
Between 15,000 and 30,000 pilgrims participate, compared to a yearly climbing total of more than 100,000. The Archbishop of Tuam leads the climb each year. Up to 300 personnel from eleven mountain rescue teams from across Ireland are involved, including the local Mayo Mountain Rescue Team, for whom it is the busiest day of the year. Also involved is the Air Corps, Irish Cave Rescue Organisation (ICRO) the Order of Malta, Civil Defence Ireland and members of the Garda Síochána. Injuries ranging from cuts and broken bones to hypothermia and cardiac arrest occur each year. The climb takes two hours, on average, and one and a half hours to descend.
Annual climbs
1999
In 1999, 25,000 pilgrims took part in the climb in ideal conditions. Archbishop Michael Neary of Tuam spoke on the mountain of the improving quality of life which Ireland was experiencing in the late 1990s.
2002
Michael Neary spoke of the fear created by banking and commerce as well as by the Church and state at a meeting with pilgrims in Westport prior to the 2002 climb. Pilgrims came from Australia, Europe, the United Kingdom, and the United States. Rain created difficult climbing conditions on the day.
2006
Around 20,000 people took part in 2006 during particularly bad weather of wind and rain. Archbishops Seán Brady and Michael Neary said Mass on top, with Neary appealing for kindness and goodwill to be shown to immigrant families. Twenty-three people were airlifted or stretchered off the mountain with illnesses and injuries; two of these were hospitalised. The first analytic survey was conducted when 11,000 pilgrims were interviewed. Two-thirds of them were men, one third were women, five percent came from outside Ireland, and two percent climbed in their bare feet.
2007
Over 30,000 pilgrims climbed Croagh Patrick on Reek Sunday in 2007. There were some minor foot injuries, whilst one man had a suspected cardiac arrest on the mountain.
2008
Over 25,000 pilgrims took part in 2008. The Mass on the summit, celebrated by Michael Neary, was broadcast live worldwide for the first time ever by RTÉ. He spoke of consumer values that he felt were seducing society. Over 20 priests were involved in the event. Injuries were very few.
2009
Only 18,000 pilgrims climbed the mountain in 2009. Weather conditions were particularly bad with many choosing to climb the mountain the previous day. Between five and six children contracted hypothermia. Some participants sustained minor cuts, others complained of coronary problems, whilst one woman was airlifted off the mountain after breaking her ankle the day before, and a man was airlifted to hospital after having a suspected cardiac arrest on the mountain. Prior to the climb, Mayo Mountain Rescue Team advised pilgrims to carry some sort of footwear but not flip-flops, sandals, stiletto heels or wellingtons; it was the first time they had ever issued such advice. Pilgrims were also told to use a stick for walking, wear multiple layers of clothing and to scale the mountain at a slow pace. Archbishop Michael Neary said before the 2009 climb that people were "searching desperately" for hope in the "menacing desert" of the recession. In his homily on the mountain, Neary talked of the effects the recession had on family life.
2010
Michael Neary led the 2010 National Pilgrimage to Croagh Patrick involving about 20,000 people. The Mayo Mountain Rescue Team, which responds to about 50 emergency calls to the mountain annually, called for safety maintenance work to be carried out in an area where the increased number of climbers, all year round, has caused significant erosion.
2013
The climb on 28 July 2013 took place in sunny weather and was undertaken by between 15,000 and 20,000 people. Ash and blackthorn sticks were for sale at €3 each, or for rent at €1.50. Drought conditions during July made it unusually dry underfoot on the day of the climb. Nearly 300 volunteers with Mayo Mountain Rescue, the Irish Cave Rescue Organisation, the Order of Malta Ambulance Corps, Civil Defence Ireland, and an Air Corps helicopter were in attendance and on standby. There were 17 reported injuries, including two which required airlifts. A woman who suffered a head injury on the peak was treated by Mayo Mountain Rescue and a 67-year-old tourist who suffered suspected cardiac problems Mid-descent was treated by Order of Malta Ambulance Rescue and First aid teams, before being winched into a helicopter by Irish Air Corps and transported to hospital. The weather for the day was very good, with winds being very mild in comparison to other years.
2015
The climb on 26 July 2015 was cancelled. Met Éireann issued a yellow weather alert for the day until 3pm forecasting heavy rain. Hundreds ignored that warning and traversed up the peak regardless. Locally it was estimated to be as many as 10,000 attempted.
Many are believed to have been forced to turn back and Mayo Mountain Rescue Team confirmed to TheJournal.ie that ten people have been treated for hypothermia.
2016
Twenty to twenty five thousand people participated in the 2016 Reek Sunday pilgrimage, which was led by the Archbishop of Tuam, Dr Michael Neary, with the Papal Nuncio, Archbishop Charles John Brown. Volunteers from all twelve Irish mountain rescue teams, including 120 members of the Order of Malta, were present as part of a safety plan coordinated by members of the Mayo Mountain Rescue team. A detachment from the Air Corps was on duty with a helicopter to rescue any casualties from the mountain.
2017
At least 25,000 people took part in the 2017 Reek Sunday pilgrimage. One of the first to climb the mountain was the Archbishop of Tuam, Dr Michael Neary, accompanied by Bishop Fintan Monahan, Bishop of Killaloe, and Gearóid Dullea, executive secretary of the Irish Catholic Bishops Conference, beginning the at 7 am. Archbishop Neary celebrated Mass in the mountaintop oratory at 11 am. Thirteen people were injured, three of whom were airlifted off the mountain.
2018
An estimated 5,000 people took part in the 2018 Reek Sunday. Archbishop of Tuam Michael Neary led the pilgrimage up the mountain. Hourly masses were also celebrated at the summit. Mayo Mountain Rescue Team organised and co-ordinated rescue and emergency care services. Good weather conditions kept casualties to a minimum, although one 46-year-old man had to be airlifted to hospital in Galway with chest pains.
2019
Thousands of people have taken part in the 2019 pilgrimage on Croagh Patrick. Rescue teams assisting just over 20 people for mostly minor injuries. Misty weather at the summit early in the day gave way to clear conditions as the afternoon progressed. The Archbishop of Tuam, Dr Michael Neary celebrated mass on the summit in the morning. Afterwards he spoke of the appeal of the climb for generations of people. Dr Neary said there was something of a parable in the manner in which people approached the day, assisting others and ensuring that those in difficulty were given support on their journey. A range of agencies spent the day on standby to assist with the treatment of those with injuries. The Irish Air Corps airlifted a small number of people from the mountain, while Order of Malta, Mountain Rescue and Civil Defence teams patrolled the route to cater for all incidents that arose.
References
Annual events in Ireland
July observances
Christian pilgrimages
Roman Catholic pilgrimage sites in Ireland
Christian Sunday observances
Holidays and observances by scheduling (nth weekday of the month)
Summer events in the Republic of Ireland |
Namio Takasu (born 24 January 1943) is a Japanese professional golfer.
Takasu played on the Japan Golf Tour, winning three times.
Professional wins (6)
PGA of Japan Tour wins (3)
*Note: The 1982 Kuzuha Kokusai Tournament was shortened to 27 holes due to weather.
PGA of Japan Tour playoff record (1–1)
Other wins (2)
1974 Kuzuha Kokusai Tournament
1985 Toyama Open
Senior wins (1)
2002 Castle Hill Open
Team appearances
World Cup (representing Japan): 1982, 1984
References
External links
Japanese male golfers
Japan Golf Tour golfers
Sportspeople from Chiba Prefecture
1943 births
Living people |
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
var randu = require( '@stdlib/random/base/randu' );
var incrnansumabs2 = require( './../lib' );
var accumulator;
var sum;
var v;
var i;
// Initialize an accumulator:
accumulator = incrnansumabs2();
// For each simulated datum, update the sum...
console.log( '\nValue\tSum\n' );
for ( i = 0; i < 100; i++ ) {
if ( randu() < 0.2 ) {
v = NaN;
} else {
v = ( randu()*100.0 ) - 50.0;
}
sum = accumulator( v );
console.log( '%d\t%d', v.toFixed( 3 ), ( sum === null ) ? NaN : sum.toFixed( 3 ) );
}
console.log( '\nFinal sum: %d\n', accumulator() );
``` |
Elizabeth Safian Berube (January 7, 1943 – January 15, 2021) was an American comic book artist, best known as a romance comics artist for DC Comics in the 1970s. Simply signing her work "Elizabeth," her modern, stylized art was used to illustrate fashion features, horoscope pages, tables of contents, and other various ornamental pieces. She was also a prolific colorist, first for Archie Comics and later for DC. Throughout her career she worked on children’s books, greeting cards, and other commissioned work.
Biography
Berube was born in Brooklyn, New York, where she was influenced by Pogo and EC Comics, as well as the movie Fantasia. Fine arts influences included Alphonse Mucha, and the Art Deco and Art Nouveau movements.
She attended Martin Van Buren High School in Queens (graduating at age 16 in 1959), where she started a comic strip for the school newspaper, which has been continued by different students to this day. She studied cartooning at the School of Visual Arts from 1959 to 1961.
After leaving SVA, Berube became a colorist and assistant editor for Archie Comics, continuing at that publisher in various freelance capacities until 1975. In the early 1960s, she met DC editor Jack Adler, who later brought her into the publisher.
In the late 1960s, her newspaper strip, Karen, (credited to her maiden name "Elizabeth Ann Safian") was carried by Newsday Syndicate in 40 newspapers at its peak. Berube had called Karen "my alter ego."
In 1969 she began working on DC’s romance comics line, bringing more modern, stylized art to the genre, which was still being drawn in the realistic style that had become parodied (particularly by Roy Lichtenstein) in Pop Art. One of the few women in the field, Berube worked on such titles as Date with Debbi, Falling in Love, Girls' Love Stories, Girls' Romances, Heart Throbs, Secret Hearts, Young Love, and Young Romance. At some point during this period, Berube was offered the position of editor of the whole line, but as a single mother in her mid-twenties, she preferred the flexibility of working from home that pencilling and coloring allowed, and declined. The DC romance line folded a few years later; Berube was the last female contributor.
From the mid-1970s through the 1980s Berube worked as a colorist, mostly for DC. She was known for mixing her own hues and marking the combinations for the printing separators. She also did coloring for Neal Adams’ Continuity Studios in the mid-to-late 1980s. Berube credits Jack Adler and Corey Adams (Neal Adams' wife) for teaching her the techniques of comics coloring.
Personal life and death
Her son David was born in 1965; she raised him as a single mother. In 1981, Berube moved from New York City to Maine. She returned to New York in the mid-1980s. In 1999, Berube moved to Bandon, Oregon, and by 2001 had relocated to Jerome, Arizona. She later lived in Scottsdale, Arizona.
Berube died on January 15, 2021.
References
External links
Young Romance: A tribute to Liz Safian Berube at CopperCon 2013
"How Hero Initiative Helped Liz Safian-Berube Get Her Life Back," The Hero Initiative website.
Biography at SuperPouvoir.com (in French and English)
1943 births
2021 deaths
American female comics artists
Comics colorists
Artists from Brooklyn
Martin Van Buren High School alumni
People from Bandon, Oregon
People from Jerome, Arizona
People from Scottsdale, Arizona
School of Visual Arts alumni
DC Comics people |
Grędzice is a village in the administrative district of Gmina Ciechanów, within Ciechanów County, Masovian Voivodeship, in east-central Poland. It lies approximately south-east of Ciechanów and north of Warsaw.
References
Villages in Ciechanów County |
Cedar Grove, also known as Ridgely's Whim or Sunday's Chance, is a historic home located at Baltimore, Maryland, United States. It is a large -story, side-passage, double-pile plan house constructed about 1841. A -story wing incorporates an earlier structure, built between 1799 and 1813.
Cedar Grove was listed on the National Register of Historic Places in 1996.
References
External links
, including photo from 1996, at Maryland Historical Trust
Evergreen, Baltimore
Houses on the National Register of Historic Places in Baltimore
Federal architecture in Maryland
Greek Revival architecture in Maryland
Houses in Baltimore
Houses completed in 1841 |
Cazalet is a surname. Notable people with the surname include:
Auguste Cazalet (1938–2013), member of the Senate of France
Sir Edward Cazalet (born 1936), British judge
Edward Cazalet (merchant) (1827-1883), British merchant and industrialist
Clement Cazalet (1869–1950), British tennis player
Hal Cazalet (born 1969), English tenor opera singer
Lara Cazalet (born 1973), English actress
Peter Cazalet (1899-1982), English admiral
Peter Cazalet (racehorse trainer), (1907–73) English cricketer, jockey, racehorse owner and trainer
Thelma Cazalet-Keir (1899–1989), British feminist and politician (née Cazalet)
Colonel Victor Cazalet (1896–1943), British politician
William Marshall Cazalet (1865–1932), British socialite and tennis player
See also
The Cazalets, a 2001 British television drama series
Puyol-Cazalet, a commune in the Landes department, Aquitaine, southwest France
Occitan-language surnames |
Kathleen Sheeder Bonanno (1956-2017) was an American poet, teacher, and contributing editor to The American Poetry Review.. Bonanno received a Knights Foundation Grant in 2011 (selected from 1700 submissions) to create a literary arts center in Philadelphia, PA, called Musehouse: a Center for the Literary Arts.
She was the author of Slamming Open the Door (Alice James Books, 2009), which was the 2008 Beatrice Hawley Award winner and the 9th best-selling poetry book in 2009. It received a positive, full-page review in The New York Times,, while Library Journal praised it as "A stunning first book." Bonanno was interviewed about her writing of the book on NPR's Fresh Air by Terri Gross, who began the interview by praising the book, "I really love the poems we're about to hear. They're beautifully written. But some of them really hurt. They're about the worst thing that can happen to a mother, the murder of her child." The poems in Slamming Open the Door tell the story of the aftermath of the murder of the author’s daughter, Leidy Bonanno, who was strangled in 2003 by an ex-boyfriend, just after she had graduated from nursing school. Bonanno was an advocate for victims’ rights and a member of the Montgomery County Parents of Murdered Children. She was honored with a 2008 “Women of Courage/Women of Inspiration Purple Ribbon Award” from Lutheran Settlement House in Philadelphia.
Bonanno was born in Reading, Pennsylvania, and received an undergraduate degree in English and a master’s in education from Temple University. She taught at Dobbins High School for five years and at Cheltenham High School for thirteen years. She was married to David Bonanno, a native of Caldwell, New Jersey and co-editor of The American Poetry Review.
References
External links
Alice James Books > Kathleen Sheedeer Bonanno > Author Page
Author Profile: The Chestnut Hill Local > Daughter’s Murder Inspires Local Mom to Write Best-Selling, Honored Book of Poetry > by Len Lear > May 21, 2009
Review: The New York Times Book Review > My Daughter's Murder, by David Kirby > 04/10/09
Review: Library Journal > 'Arts & Humanities > Poetry > February 1, 2009 > Review by Karla Huston of Slamming Open the Door, by Kathleen Sheeder Bonanno
1956 births
2017 deaths
Poets from Pennsylvania
Writers from Reading, Pennsylvania
Temple University College of Education alumni
Schoolteachers from Pennsylvania
21st-century American women educators
21st-century American educators
American women poets
21st-century American poets
21st-century American women writers
20th-century American women educators
20th-century American educators |
Ferugliotherium is a genus of fossil mammals in the family Ferugliotheriidae from the Campanian and/or Maastrichtian period (Late Cretaceous; around 70 million years ago) of Argentina. It contains a single species, Ferugliotherium windhauseni, which was first described in 1986. Although originally interpreted on the basis of a single brachydont (low-crowned) molar as a member of Multituberculata, an extinct group of small, rodent-like mammals, it was recognized as related to the hypsodont (high-crowned) Sudamericidae following the discovery of additional material in the early 1990s. After a jaw of the sudamericid Sudamerica was described in 1999, these animals (collectively known as Gondwanatheria) were no longer considered to be multituberculates and a few fossils that were previously considered to be Ferugliotherium were assigned to unspecified multituberculates instead. Since 2005, a relationship between gondwanatheres and multituberculates has again received support. A closely related animal, Trapalcotherium, was described in 2009 on the basis of a single tooth.
About twenty teeth and a jaw fragment have been referred to Ferugliotherium, but the assignment of many of these is controversial or has been superseded. The upper and lower incisors are long and rodent-like and have enamel on only one side of the crown. A fragment of the lower jaw shows that the tooth socket of the lower incisor was very long, extending below the fourth premolar (p4). The p4 is preserved in this fragment. It is blade-shaped and resembles multituberculate p4s. However, the determination of this fossil as Ferugliotherium is in question. The identity of a few additional isolated premolars assigned to Ferugliotherium, some resembling multituberculates, is also uncertain. The first lower molariform (molar-like tooth; mf1) is known from four examples, of which two were originally identified as upper molars of a different species (Vucetichia gracilis), which is now considered a synonym of Ferugliotherium. They bear two longitudinal rows of three or four cusps and transverse crests and furrows. A single example each of the second lower (mf2) and first upper molariform (MF1) show that these teeth also had longitudinal cusp rows and transverse furrows and crests, but the mf2 had only two or perhaps three cusps per row and the MF1 had three longitudinal rows.
Although Ferugliotherium teeth are much lower-crowned than those of the Sudamericidae, they share an essentially similar pattern on the occlusal (chewing) surface of mf1 and mf2, similar incisors, backward jaw movement during chewing, and enamel with small prisms. Ferugliotherium is thought to have been a small animal, with a body mass of about 70 g (2.5 oz), and may have eaten insects and plant material. Its remains have been found in two geological formations of southern Argentina, where it is part of a mammal fauna that also includes the sudamericid Gondwanatherium and a variety of dryolestoids.
Taxonomy
Ferugliotherium windhauseni was named in 1986 by Argentinean paleontologist José Bonaparte on the basis of a single second lower molar (m2) from the Late Cretaceous Los Alamitos Formation of Argentina. Both the generic name, Ferugliotherium, and the specific name, windhauseni, honor geologists who studied the geology of Patagonia: Egidio Feruglio and Anselmo Windhausen, respectively. Bonaparte created a new family, Ferugliotheriidae, for the new species and tentatively assigned it to Multituberculata, an extinct group of mammals that was diverse during the late Cretaceous, mostly in the northern continents (Laurasia). In subsequent years, other finds permitted a more confident assignment to Multituberculata. In 1990, Bonaparte described Vucetichia gracilis on the basis of what he interpreted as two upper molars of a relative of Gondwanatherium within the order Gondwanatheria, a small mammalian group that was at the time known only from Argentinean fossils and thought to be related to xenarthrans as part of a now-discarded group called Paratheria. The generic name, Vucetichia, commemorates Argentinean paleontologist Guiomar Vucetich, and the specific name, gracilis (Latin for "slender"), refers to the animal's small size.
However, in 1990 David W. Krause and Bonaparte argued that Gondwanatheria, including Ferugliotherium (family Ferugliotheriidae), Gondwanatherium, and Sudamerica (family Sudamericidae), should be placed within Multituberculata. Two years later, Krause, Bonaparte, and Zofia Kielan-Jaworowska described additional material of Ferugliotherium (which they tentatively placed in the multituberculate suborder Plagiaulacoidea) and suggested that the supposed upper molars of Vucetichia were in fact heavily worn first lower molariforms (mf1) of Ferugliotherium. In 1993, Krause described an unworn mf1 of Ferugliotherium and confirmed that Vucetichia was based on worn specimens of Ferugliotherium and therefore a synonym of the latter. In the same year, he and Bonaparte argued once again that Ferugliotherium, Gondwanatherium, and Sudamerica formed a closely related group of multituberculates, which they called the superfamily Gondwanatherioidea. Kielan-Jaworowska and Bonaparte described a lower jaw fragment with a multituberculate-like lower fourth premolar (p4) from Los Alamitos in 1996 and tentatively identified it as Ferugliotherium. On the basis of the morphological features of the jaw fragment, they argued that gondwanatherians were not closely related to any other multituberculate group, and consequently placed them in a suborder of their own, Gondwanatheria.
In 1999, Rosendo Pascual and colleagues described a jaw of Sudamerica. Because some of this jaw's features were thought to be incompatible with a multituberculate identity, they regarded gondwanatheres (including Ferugliotherium) as Mammalia incertae sedis. However, in 2009 Yamila Gurovich and Robin Beck argued in favor of a close relationship between gondwanatheres (including Ferugliotherium) and multituberculates. The controversy is partially due to disagreement over the assignment of two upper premolars and the jaw fragment described by Kielan-Jaworowska and Bonaparte in 1996; Gurovich and Beck identify these as Ferugliotherium, while Kielan-Jaworowska and others regard them as indeterminate multituberculates.
In the 2000s, some possible close relatives of Ferugliotherium were discovered. An enigmatic tooth from the Paleogene of Peru, LACM 149371, was described in 2004 as possibly related to the family Ferugliotheriidae. Kielan-Jaworowska and colleagues described a p4 from the La Colonia Formation (Late Cretaceous of Argentina) as a new multituberculate genus, Argentodites, in 2007, but Gurovich and Beck noted close similarities between this p4 and the p4 in the possible jaw fragment of Ferugliotherium and suggested that it represented Ferugliotherium or a closely related species. A single mf1 from the Allen Formation (Late Cretaceous of Argentina) was described as another ferugliotheriid genus, Trapalcotherium, in 2009.
Description
Ferugliotherium is known from isolated teeth, the assignment of some of which is controversial. The material from the Los Alamitos Formation, which is mostly in the Museo Argentino de Ciencias Naturales Bernardino Rivadavia (MACN) in Buenos Aires, with one tooth in the Museo de La Plata (MLP) in La Plata, Argentina, has been thoroughly described; while there are additional Ferugliotherium fossils from the La Colonia Formation, they have not been described in detail. Although the fragmentary nature of the known fossils of Ferugliotherium makes it impossible to determine its dental formula with certainty, Gurovich suggested that it had one incisor (possibly two in the upper jaw), no canines, one or two premolars, and two molars on each side of the lower and upper jaws. However, on the basis of comparisons with Sudamerica, which is known to have had four lower molariforms (molar-like teeth, either premolars or molars) in its lower jaw, Pascual and Ortiz-Jaureguizar suggested in 2007 that Ferugliotherium may also have had four lower molars.
Ferugliotherium was much smaller than the sudamericids Gondwanatherium and Sudamerica, and its body mass is estimated to have been about 70 g (2.5 oz). Unlike the hypsodont (high-crowned) sudamericids, Ferugliotherium has brachydont (low-crowned) molariform teeth that are supported by at least two roots, not a single massive root. The direction of wear on the teeth indicates that Ferugliotherium, Gondwanatherium, and Sudamerica all had palinal jaw movement (i.e., the lower jaw moved backwards during the power stroke of chewing)—a feature otherwise only seen in multituberculates among mammals.
Incisors
Three fragmentary Ferugliotherium lower incisors (MACN Pv-RN 701A, 701B, and 701C) are known from the Los Alamitos Formation. Another incisor, MACN Pv-RN 970, was assigned to Ferugliotherium by Bonaparte in 1990, but it is much larger than the other three incisors, which are otherwise similar, and probably represents Gondwanatherium instead. Only the tips of the three incisors are preserved. They are laterally compressed, with an estimated width of 1.3 mm and height of 2.4 mm in 701A. The medial side (towards the middle of the mouth) is flat, but the lateral side (towards the sides) is convex. There is enamel only on the lower (ventral) side. A large wear facet is present at the tip, forming an angle of about 35° with the ventral margin in 701A. The three incisor fragments are identified as Ferugliotherium because of their size and provenance and the presence of a restricted enamel band. They show features, such as lateral compression, an acute angle at the tip, small curvature, and an irregular cross section, that are usually seen in lower, not upper incisors in mammals with procumbent incisors, such as rodents and taeniolabidoid multituberculates.
Four specimens (MACN Pv-RN 702A through 702D) are thought to represent second upper incisors (I2) of Ferugliotherium. 702A (height 1.5 mm; width 1.1 mm) and 702B are slightly larger than 702C (height 1.2 mm; width 0.9 mm) and 702D. The smaller incisors cannot be lateral incisors (I3), because 702C's wear facet is stronger than would be expected in an I3; therefore, all four upper incisors are identified as central incisors (I2). To explain the size difference, Krause and colleagues suggested that Ferugliotherium was variable in size or that the smaller incisors were deciduous precursors of the larger permanent tooth. They considered it less likely that multiple species with similar incisors were present. The upper incisors have enamel only on the dorsal side. The wear facet at the tip is preserved only in 702C, forming an angle of 52° with the dorsal side, and is more concave than the facet in the lower incisors. 702A–D are recognizable as upper incisors because they have a less acute angle at the tip and are less laterally compressed, more curved, and elliptical in cross section.
Incisors of Ferugliotherium and Gondwanatherium are similar in overall shape and share a restricted band of enamel—a feature otherwise seen only in multituberculates among Mesozoic mammals. The incisors of Sudamerica are also similar.
Mandible with lower premolar
MACN Pv-RN 975, a fragment of the mandible (lower jaw) preserving one premolar, was discovered in 1991 and tentatively identified as Ferugliotherium by Kielan-Jaworowska and Bonaparte in 1996, but this assignment remains controversial. The poorly preserved and worn premolar is a bladelike tooth, resembling multituberculate fourth lower premolars (p4). The premolar is 4.8 mm long and bears eight faint ridges on both the labial (towards the lips) and lingual (towards the tongue) sides. On the labial side, the four ridges at the back are more widely separated than the four in front of them. The back and front margins of the tooth are parallel and there is no small cusp on the labial side. There are two roots; the one at the front is larger than the one at the back and bears a furrow. The lower border of the enamel cover is marked by two semicircular extensions of the enamel on the front side, but there is only one such extension at the back. By its size, the number of ridges, and apparently greater length than height, it differs from all known multituberculate first, second, and third lower premolars, indicating that it is a p4.
The dentary (lower jaw bone) itself is robust and short. The length axis of the p4 makes an angle of about 58° with the length axis of the jawbone. The bone is concave on the lingual, but convex on the labial side. There is a diastema (gap) between the p4 and the incisor that would have been in front of it, as in the jaw of Sudamerica. Gurovich estimated the length of the diastema as 2.5 mm. There is a rounded mental foramen (an opening in the labial side of the jawbone), with a diameter of 0.7 mm, located about 0.8 mm below the dorsal margin of the bone and 1.5 mm in front of the p4. Although the incisor itself is not preserved, its alveolus (the housing of the root) is in part. As in Sudamerica, it extends far into the dentary, passing below p4. The alveolus is 1.5 mm wide below the front root of p4 and 1.4 mm at the back of the jaw fragment. Although the height of the alveolus cannot be determined because the lower side is broken away, the incisor must have been quite deep.
When it was discovered that Sudamerica had four molariform teeth and no bladelike premolar in its lower jaw, Pascual, Kielan-Jaworowska, and colleagues removed MACN Pv-RN 975 from Ferugliotherium, which they expected to have the same dental formula as its fellow gondwanathere Sudamerica, and identified it as an indeterminate multituberculate instead. Pascual and colleagues argued that molariform teeth as seen in Sudamerica could not have evolved from the bladelike p4 of Ferugliotherium, and that it was unlikely that additional molars had been added in Sudamerica. In 2004 and 2007, Kielan-Jaworowska and colleagues aligned the dentary with the multituberculate suborder "Plagiaulacida" because the p4 is rectangular in labial view, not curved as in the suborder Cimolodonta. This feature was also used to distinguish MACN Pv-RN 975 from the single p4 assigned to Argentodites, which was tentatively placed in Cimolodonta.
Gurovich, Guillermo Rougier, and colleagues, on the other hand, maintain that the dentary is referable to Ferugliotherium and that the p4s of Argentodites and MACN Pv-RN 975 are very similar. The alveolus of MACN Pv-RN 975 fits the lower incisors attributed to Ferugliotherium in size and the blade-like premolar is of the size expected for an animal with molariforms the size of Ferugliotherium teeth. If the dentary and premolars (whose identification has been similarly controversial; see below) do not belong to Ferugliotherium, then, Gurovich and Beck argue, the Los Alamitos Formation would contain two mammals (Ferugliotherium and a multituberculate) similar in size and morphology, and therefore presumably occupying similar ecological niches—and one of those would be represented only by molariforms and incisors and the other only by premolars and a jaw fragment among the available fossils. Furthermore, they noted that the transition from blade-like to molariform premolars had actually been observed in the fossil record of the extinct sthenurine kangaroos, and that the first molariform in Sudamerica and Gondwanatherium is laterally compressed, suggesting that it may have derived from a blade-like tooth. Gurovich and Beck attributed the difference in shape between the MACN Pv-RN 975 and Argentodites p4s to the extensive wear of the former, and suggested that the two are similar enough that they probably represent at least closely related species.
Other premolars
Krause and colleagues identified a single tooth, MACN Pv-RN 251, as a possible deciduous anterior (i.e., not p4 or dp4, the deciduous version of p4) lower premolar of Ferugliotherium. It is minuscule, with a length of 0.85 mm and width of 0.5 mm (assuming the tooth is oriented correctly). It bears two serrations (small projections) at the tip of the crown—one around the middle of the crown and the other at what may be the back of the crown, where it is highest. Two prominent ridges descend from each serration towards the front down the sides of the tooth. No roots are preserved, but the rounded surface of the lower side of the tooth suggests they may have been resorbed, which would indicate that the tooth is deciduous. Krause and colleagues suggested that the tooth may have been the frontmost premolar, whether deciduous or permanent. However, Kielan-Jaworowska and Bonaparte wrote that this tooth does not match the partial jaw MACN Pv-RN 975, which has no alveoli in front of p4, and Pascual and colleagues agreed in 1999 that the tooth probably does not belong to Ferugliotherium.
Bonaparte had identified another tooth, MACN Pv-RN 252, as a possible Ferugliotherium lower premolar in 1990, but this fossil is very fragmentary and according to Krause and colleagues, it cannot even be proven to be a mammalian tooth.
Krause and colleagues identified two teeth, MACN Pv-RN 249 and 250, as anterior upper premolars. 249 bears two longitudinal rows of cusps. One row (row A; possibly the lingual one) includes four cusps, the other (row B) includes at least two, but is damaged. In row A, there are three ridges (at the front, middle, and back) extending from the tip of the base of each cusp. The second and third cusps are largest and most widely separated from each other. In row B, one cusp bears three ridges, of which one extends towards the other cusp in the row and the two others towards row A) and the other cusp is damaged. 250 is more fragmentary, but bears at least five cusps and may represent the same tooth position as 249, though it would come from the opposite side of the mouth. The microstructure of the enamel of this tooth has been studied. With a width of about 55 μm near the tip of a cusp, the enamel is thin. The enamel prisms are straight, small, and rounded and there is little material between the prisms. Small, rounded prisms are also seen in Gondwanatherium, Sudamerica, and other gondwanatheres, but in few multituberculates. Even in those multituberculates that do have small prisms, the prism sheath is closed, but the sheath is incomplete in Gondwanatherium and possibly Ferugliotherium.
Krause and colleagues wrote that these two teeth resemble multituberculate deciduous anterior upper premolars, particularly second and third premolars (P2 and P3), and used this as one of their arguments for identifying Ferugliotherium as a multituberculate. However, as with the dentary MACN Pv-RN 975, the two upper premolars were excluded from Ferugliotherium and identified as multituberculates by Kielan-Jaworowska and colleagues after the discovery of the jaw of Sudamerica. Gurovich continues to identify them as Ferugliotherium on the basis of their size and provenance and other similarities between Ferugliotherium and multituberculates.
Lower molariforms
Five putative lower molariforms of Ferugliotherium are known from the Los Alamitos Formation (MACN Pv-RN 20, 174, 175, and 253 and MLP 88-III-28-1). These teeth include the holotypes of Ferugliotherium windhauseni (MACN Pv-RN 20, the only second lower molariform, or m2) and Vucetichia gracilis (MACN Pv-RN 174).
The best-preserved mf1 is MLP 88-III-28-1. The crown is unworn and complete and there are no roots, suggesting that the tooth had not yet erupted when its owner died. Krause, who first described the tooth in 1993, identified it as a right molar, but the subsequent discovery of the jaw of Sudamerica made it clear that Ferugliotherium molariforms had been reversed, and MLP 88-III-28-1 is actually from the left side of the jaw. The tooth is 2.2 mm long and 1.5 mm wide. The crown is roughly rectangular, with rounded corners, and bears two longitudinal rows of cusps. The lingual row consists of four cusps, which are smaller and lower than the three labial ones. The cusps in this row become smaller and lower from the front to the back. Two ridges descend from the tip of each cusp to the lingual and labial sides. The labial ridges on the first and fourth cusp only reach the base of the cusp, but those on the second and third cusps join ridges descending from the first and second labial cusp. In the first three cusps, the lingual ridge extends to near the lingual margin of the tooth and then turns backward; the end of the ridge is lingual to the next cusp. In the fourth cusp, the ridge hardly extends posteriorly, but rather labially, forming the posterior margin of the tooth and joining a ridge descending from the last labial cusp. The labial cusp row includes three, larger cusps, each of which bears two ridges that descend lingually into the valley between the two cusp rows. The front ridge of each pair ends in the central valley, and the back ridge joins a ridge from a lingual cusp. The ridge pattern results in the presence of three transverse furrows between the main cusps.
Another mf1, MACN Pv-RN 253, is almost unworn, but damaged: only the front two lingual cusps and the first two cusps and part of the third in the labial row are preserved. This tooth is similar to MLP 88-III-28-1 in all respects. However, Gurovich suggests that it may also be an m2. MACN Pv-RN 174, which is heavily worn, and MACN Pv-RN 175, which is not only heavily worn but has also undergone severe abrasion, were originally identified as upper molars of Vucetichia gracilis by Bonaparte in 1990. The roots of MACN Pv-RN 174 are preserved; at the front and back of the tooth, there is a pair of roots, which are fused near their bases. It has small enamel prisms. Krause and colleagues suggested in 1992 that 174 and 175 were mf1s of Ferugliotherium on the basis of similarities with 253, and Krause confirmed this in 1993 by describing the complete mf1 MLP 88-III-28-1. The related ferugliotheriid genus Trapalcotherium is known from a single mf1, which is similar to Ferugliotherium mf1s but different in some morphological details (see Trapalcotherium: Relationships).
The holotype, MACN Pv-RN 20, is a right mf2 according to both Krause and colleagues (1992) and Gurovich (2005), but Gurovich considered the side that Krause and colleagues thought was lingual to be labial, and vice versa. The latter interpretation is used in the following description. It is almost square, but at the front it is slightly narrower than at the back. The labial side of the tooth is taller and less worn than the lingual side. There are two rows of cusps, and each lingual cusp is connected to each labial cusp by a broad crest, with one or more fossas in the middle. One of the two labial cusps may have been divided into two smaller cusps. The two crests are separated by a deep furrow. The enamel prisms of this tooth are small, like those of the premolar MACN Pv-RN 250.
Transverse ridges between the cusps, as seen in Ferugliotherium, are known in only one multituberculate, Essonodon, but the ridge pattern in Essonodon is more complicated and the animal lacks the prominent furrows of Ferugliotherium and differs in numerous other features. On the other hand, overall patterns of cusps and ridges are essentially similar among Ferugliotherium, Gondwanatherium, and Sudamerica, indicating that the three are closely related.
Upper molariforms
A single tooth, MACN Pv-RN 248, is currently identified as a Ferugliotherium upper molariform. In 1992, Krause and colleagues labeled it as a right MF1, but Gurovich identifies it as a left MF1 or possibly even a right mf1. LACM 149371, an enigmatic tooth from the Paleogene of Santa Rosa, Peru, may represent an upper molar of an animal related to Ferugliotherium. Like the latter, it has cusps that are compressed from front to back and that are connected to the center of the crown by low crests.
MACN Pv-RN 248 is somewhat damaged and almost rectangular, but slightly narrower at the back than at the front. The tooth bears three longitudinal rows of cusps. The middle row consists of five cusps, the labial row (assuming it is a left M1; if it is from the right, "lingual" and "labial" should be reversed) includes two or perhaps three cusps, and the lingual row includes probably four cusps. The lingual and middle rows extend across the entire length of the tooth, but the labial row is shorter, extending across about 70% of the length. The middle row is oriented obliquely with respect to the length axis of the tooth, so that it converges with the lingual row towards the back of the tooth. The front lingual corner of the tooth is missing, but it appears that the first cusps in the lingual and middle rows are connected by two ridges, one at the front margin of the tooth and one at the back of the cusps. A deep fossa (basin) lies between the two cusps and their connecting ridges. Behind these two cusps, a transverse furrow extends across the width of the tooth. The second lingual and middle cusps are also connected by a crest, which is somewhat weaker than those connecting the first cusps. Another transverse furrow extends behind the second cusps and also separates the second middle cusp from the labial row. A third furrow, behind the third lingual and middle cusps, also separates the first from the second labial cusp. Three ridges descend from the fourth lingual cusp: one connects to the fourth middle cusp, one ends blindly between the fourth lingual and middle cusps, and one connects to the fifth middle cusp. The second labial cusp, which is larger than the first one, is superficially divided into two smaller cusps by an indentation on its lingual side. There are vertical grooves at the bases of the cusps.
Range and ecology
Remains of Ferugliotherium come from two formations in the Late Cretaceous of southern Argentina, the Los Alamitos and La Colonia Formations. These and the Allen Formation (which has yielded Trapalcotherium) are all dated to the Campanian (84–71 million years ago) and/or Maastrichtian (71–66 million years ago), the penultimate and ultimate stages of the Cretaceous. The La Colonia Formation may be somewhat younger than the other two, while the Los Alamitos Formation has been considered Campanian, and can be dated to the Campanian or Maastrichtian on the basis of palynology. The Allen Formation is likely Maastrichtian, but not latest Maastrichtian.
The Los Alamitos Formation is located in southeastern Río Negro Province, in the vicinity of the town of Cona Niyeu and was probably deposited in a marshy environment. In 1983, it yielded the first Mesozoic mammal to be found in Argentina, Mesungulatum houssayi, and since then, the mammalian fauna has expanded to 14 species. Most of those belong to the archaic mammalian group Dryolestoidea, but the fauna also includes the gondwanatheres Ferugliotherium and Gondwanatherium. The dryolestoids Mesungulatum houssayi and Groebertherium novasi and the two gondwanatheres are the most common mammals. Other fossils found in the Los Alamitos Formation include fish, frogs, turtles, madtsoiid snakes, dinosaurs such as Secernosaurus, gastropods, and other invertebrates.
The La Colonia Formation outcrops in north-central Chubut Province, and the mammalian fossils come from the Mirasol Chico valley. The formation includes fluvial (river), deep-sea, and near-shore deposits, and the mammalian fauna probably comes from an estuary, tidal flat, or coastal plain. The La Colonia Formation also contains dryolestoids, such as Coloniatherium and Reigitherium, as well as a ferugliotheriid and the putative multituberculate Argentodites. In addition, the La Colonia Formation has yielded fossils of a wide array of other animals, including crocodiles, plesiosaurs, lungfish (Ceratodus), and dinosaurs (including Carnotaurus).
The high-crowned sudamericids were probably herbivores, but the lower-crowned Ferugliotherium was more probably an insectivore or omnivore, like similar multituberculates such as Mesodma, which is thought to have eaten insects, other arthropods, seeds, and/or nuts. It may have used its incisors for gnawing or slicing, and the blade-like p4 may also have been used for slicing hard plant parts, such as seeds. The wear patterns on Ferugliotherium teeth independently suggest that the animal may have eaten some plant material.
References
Literature cited
External links
Gondwanatheres
Campanian life
Maastrichtian life
Late Cretaceous mammals
Cretaceous mammals of South America
Late Cretaceous tetrapods of South America
Cretaceous Argentina
Fossils of Argentina
Los Alamitos Formation
Fossil taxa described in 1986
Mammals described in 1986
Taxa named by José Bonaparte |
```javascript
/**
* Graphology Connected Caveman Graph Generator
* =============================================
*
* Function generating connected caveman graphs.
*
* [Article]:
* Watts, D. J. 'Networks, Dynamics, and the Small-World Phenomenon.'
* Amer. J. Soc. 105, 493-527, 1999.
*/
var isGraphConstructor = require('graphology-utils/is-graph-constructor'),
empty = require('../classic/empty.js');
/**
* Function returning a connected caveman graph with desired properties.
*
* @param {Class} GraphClass - The Graph Class to instantiate.
* @param {number} l - The number of cliques in the graph.
* @param {number} k - Size of the cliques.
* @return {Graph}
*/
module.exports = function connectedCaveman(GraphClass, l, k) {
if (!isGraphConstructor(GraphClass))
throw new Error(
'graphology-generators/community/connected-caveman: invalid Graph constructor.'
);
var m = l * k;
var graph = empty(GraphClass, m);
if (k < 2) return graph;
var i, j, s;
for (i = 0; i < m; i += k) {
for (j = i; j < i + k; j++) {
for (s = j + 1; s < i + k; s++) {
if (j !== i || j !== s - 1) graph.addEdge(j, s);
}
}
if (i > 0) graph.addEdge(i, (i - 1) % m);
}
graph.addEdge(0, m - 1);
return graph;
};
``` |
"Kung Fu" is a song by the band Ash, released as the first single from their album, 1977. It was released in March 1995 as a CD single, limited edition 7”, and standard 7” vinyl. The song was written by Tim Wheeler and produced by Owen Morris.
Writing and recording
The song was written by Tim Wheeler in five minutes on Boxing Day 1994 at Belfast International Airport and recorded in one take on the following day. The song was recorded on The Verve's equipment, who were nearby recording their A Northern Soul album at the same time.
The song lyrics reference martial arts movie star Jackie Chan and the song was used in the advertising and during the bloopers at the end of the American release of Chan's film Rumble in the Bronx. Additionally, the song's intro is a sample from kung-fu flick Close Encounters of the Spooky Kind, starring Sammo Hung, which was being shown as part of a Channel 4 Kung-Fu film season shown over Christmas of that year. It is Hung's voice that can be heard in the sample.
When performed live, "Kung Fu" traditionally closed the band's sets in a two-minute rendition but was later moved to an earlier slot in the setlist. On the Nu-Clear Sounds tour, it ran to around 5 minutes, with a DJ filling the song with martial arts and computer game noises. Live versions of the song appear on the Barbie 7” EP and the Ash album Live at the Wireless.
The song appears on 1977, Intergalactic Sonic 7″s, Ash's first greatest hits collection, and the Tokyo Blitz DVD. The song appeared with Ash's earlier single "Jack Names the Planets" on the film soundtrack of Angus.
B-sides
The single was backed with two B-sides. The first B-side, "Day of the Triffids", tells an apocalyptic story of an invasion by aliens, and appears on the Cosmic Debris B-sides collection. It also appears on the US version of Trailer.
The second B-side, "Luther Ingo's Star Cruiser" was written by Wheeler and Mark Hamilton and is infamous for having uncommonly explicit lyrics. This was the B-side of the standard 7" vinyl (INFECT 21S) but since it was unsuitable for use in jukeboxes, another version (INFECT 21J) was pressed with "Day of the Triffids" as the B-side. This version was also released as a numbered limited edition.
Release and reception
The single reached number 57 on the UK Singles Chart, and the sleeve pictured footballer Eric Cantona's kick on a spectator that occurred in January 1995. A music video directed by Steven Wells and Nick Small was also filmed. It consists of the band playing the song in concert, and occasionally footage of different people performing martial arts moves are cut in to the video.
The song was received warmly with NME awarding it 'Single of the Week', while Eric Cantona's kick on a spectator would top Q magazine's list of Top 50 Most Rock 'n Roll Moments of 1995.
Track listing
All tracks written and composed by Tim Wheeler; except where indicated.
7": Infectious Records / INFECT21S (UK)
Side one
"Kung Fu" - 2:17
Side two
"Luther Ingo's Star Cruiser" (Hamilton/Wheeler) - 1:45
CD: Infectious Records / INFECT21CD (UK)
"Kung Fu" - 2:17
"Day of the Triffids" - 3:32
"Luther Ingo's Star Cruiser" (Hamilton/Wheeler) - 1:45
CD: Reprise Records / 2-17706 (US)
"Kung Fu (album version)" - 2:22
"Jack Names the Planets (album version)" - 3:13
Limited Edition 7": Infectious Records / INFECT21J (Japan)
Side one
"Kung Fu"
Side two
"Day of the Triffids"
References
1995 singles
Ash (band) songs
Songs written by Tim Wheeler
1995 songs
Infectious Records singles |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.