text
stringlengths 1
22.8M
|
|---|
```objective-c
//
// Purpose: interface to steam for game servers
//
//=============================================================================
#ifndef ISTEAMGAMESERVER_H
#define ISTEAMGAMESERVER_H
#ifdef _WIN32
#pragma once
#endif
#include "steam_api_common.h"
//your_sha256_hash-------------
// Purpose: Functions for authenticating users via Steam to play on a game server
//your_sha256_hash-------------
class ISteamGameServer
{
public:
//
// Basic server data. These properties, if set, must be set before before calling LogOn. They
// may not be changed after logged in.
//
/// This is called by SteamGameServer_Init, and you will usually not need to call it directly
STEAM_PRIVATE_API( virtual bool InitGameServer( uint32 unIP, uint16 usGamePort, uint16 usQueryPort, uint32 unFlags, AppId_t nGameAppId, const char *pchVersionString ) = 0; )
/// Game product identifier. This is currently used by the master server for version checking purposes.
/// It's a required field, but will eventually will go away, and the AppID will be used for this purpose.
virtual void SetProduct( const char *pszProduct ) = 0;
/// Description of the game. This is a required field and is displayed in the steam server browser....for now.
/// This is a required field, but it will go away eventually, as the data should be determined from the AppID.
virtual void SetGameDescription( const char *pszGameDescription ) = 0;
/// If your game is a "mod," pass the string that identifies it. The default is an empty string, meaning
/// this application is the original game, not a mod.
///
/// @see k_cbMaxGameServerGameDir
virtual void SetModDir( const char *pszModDir ) = 0;
/// Is this is a dedicated server? The default value is false.
virtual void SetDedicatedServer( bool bDedicated ) = 0;
//
// Login
//
/// Begin process to login to a persistent game server account
///
/// You need to register for callbacks to determine the result of this operation.
/// @see SteamServersConnected_t
/// @see SteamServerConnectFailure_t
/// @see SteamServersDisconnected_t
virtual void LogOn( const char *pszToken ) = 0;
/// Login to a generic, anonymous account.
///
/// Note: in previous versions of the SDK, this was automatically called within SteamGameServer_Init,
/// but this is no longer the case.
virtual void LogOnAnonymous() = 0;
/// Begin process of logging game server out of steam
virtual void LogOff() = 0;
// status functions
virtual bool BLoggedOn() = 0;
virtual bool BSecure() = 0;
virtual CSteamID GetSteamID() = 0;
/// Returns true if the master server has requested a restart.
/// Only returns true once per request.
virtual bool WasRestartRequested() = 0;
//
// Server state. These properties may be changed at any time.
//
/// Max player count that will be reported to server browser and client queries
virtual void SetMaxPlayerCount( int cPlayersMax ) = 0;
/// Number of bots. Default value is zero
virtual void SetBotPlayerCount( int cBotplayers ) = 0;
/// Set the name of server as it will appear in the server browser
///
/// @see k_cbMaxGameServerName
virtual void SetServerName( const char *pszServerName ) = 0;
/// Set name of map to report in the server browser
///
/// @see k_cbMaxGameServerMapName
virtual void SetMapName( const char *pszMapName ) = 0;
/// Let people know if your server will require a password
virtual void SetPasswordProtected( bool bPasswordProtected ) = 0;
/// Spectator server port to advertise. The default value is zero, meaning the
/// service is not used. If your server receives any info requests on the LAN,
/// this is the value that will be placed into the reply for such local queries.
///
/// This is also the value that will be advertised by the master server.
/// The only exception is if your server is using a FakeIP. Then then the second
/// fake port number (index 1) assigned to your server will be listed on the master
/// server as the spectator port, if you set this value to any nonzero value.
///
/// This function merely controls the values that are advertised -- it's up to you to
/// configure the server to actually listen on this port and handle any spectator traffic
virtual void SetSpectatorPort( uint16 unSpectatorPort ) = 0;
/// Name of the spectator server. (Only used if spectator port is nonzero.)
///
/// @see k_cbMaxGameServerMapName
virtual void SetSpectatorServerName( const char *pszSpectatorServerName ) = 0;
/// Call this to clear the whole list of key/values that are sent in rules queries.
virtual void ClearAllKeyValues() = 0;
/// Call this to add/update a key/value pair.
virtual void SetKeyValue( const char *pKey, const char *pValue ) = 0;
/// Sets a string defining the "gametags" for this server, this is optional, but if it is set
/// it allows users to filter in the matchmaking/server-browser interfaces based on the value
///
/// @see k_cbMaxGameServerTags
virtual void SetGameTags( const char *pchGameTags ) = 0;
/// Sets a string defining the "gamedata" for this server, this is optional, but if it is set
/// it allows users to filter in the matchmaking/server-browser interfaces based on the value
///
/// @see k_cbMaxGameServerGameData
virtual void SetGameData( const char *pchGameData ) = 0;
/// Region identifier. This is an optional field, the default value is empty, meaning the "world" region
virtual void SetRegion( const char *pszRegion ) = 0;
/// Indicate whether you wish to be listed on the master server list
/// and/or respond to server browser / LAN discovery packets.
/// The server starts with this value set to false. You should set all
/// relevant server parameters before enabling advertisement on the server.
///
/// (This function used to be named EnableHeartbeats, so if you are wondering
/// where that function went, it's right here. It does the same thing as before,
/// the old name was just confusing.)
virtual void SetAdvertiseServerActive( bool bActive ) = 0;
//
// Player list management / authentication.
//
// Retrieve ticket to be sent to the entity who wishes to authenticate you ( using BeginAuthSession API ).
// pcbTicket retrieves the length of the actual ticket.
// SteamNetworkingIdentity is an optional parameter to hold the public IP address of the entity you are connecting to
// if an IP address is passed Steam will only allow the ticket to be used by an entity with that IP address
virtual HAuthTicket GetAuthSessionTicket( void *pTicket, int cbMaxTicket, uint32 *pcbTicket, const SteamNetworkingIdentity *pSnid ) = 0;
// Authenticate ticket ( from GetAuthSessionTicket ) from entity steamID to be sure it is valid and isnt reused
// Registers for callbacks if the entity goes offline or cancels the ticket ( see ValidateAuthTicketResponse_t callback and EAuthSessionResponse )
virtual EBeginAuthSessionResult BeginAuthSession( const void *pAuthTicket, int cbAuthTicket, CSteamID steamID ) = 0;
// Stop tracking started by BeginAuthSession - called when no longer playing game with this entity
virtual void EndAuthSession( CSteamID steamID ) = 0;
// Cancel auth ticket from GetAuthSessionTicket, called when no longer playing game with the entity you gave the ticket to
virtual void CancelAuthTicket( HAuthTicket hAuthTicket ) = 0;
// After receiving a user's authentication data, and passing it to SendUserConnectAndAuthenticate, use this function
// to determine if the user owns downloadable content specified by the provided AppID.
// Ask if a user in in the specified group, results returns async by GSUserGroupStatus_t
// returns false if we're not connected to the steam servers and thus cannot ask
virtual bool RequestUserGroupStatus( CSteamID steamIDUser, CSteamID steamIDGroup ) = 0;
// these two functions s are deprecated, and will not return results
// they will be removed in a future version of the SDK
virtual void GetGameplayStats( ) = 0;
STEAM_CALL_RESULT( GSReputation_t )
virtual SteamAPICall_t GetServerReputation() = 0;
// Returns the public IP of the server according to Steam, useful when the server is
// behind NAT and you want to advertise its IP in a lobby for other clients to directly
// connect to
virtual SteamIPAddress_t GetPublicIP() = 0;
// Server browser related query packet processing for shared socket mode. These are used
// when you pass STEAMGAMESERVER_QUERY_PORT_SHARED as the query port to SteamGameServer_Init.
// IP address and port are in host order, i.e 127.0.0.1 == 0x7f000001
// These are used when you've elected to multiplex the game server's UDP socket
// rather than having the master server updater use its own sockets.
//
// Source games use this to simplify the job of the server admins, so they
// don't have to open up more ports on their firewalls.
// Call this when a packet that starts with 0xFFFFFFFF comes in. That means
// it's for us.
virtual bool HandleIncomingPacket( const void *pData, int cbData, uint32 srcIP, uint16 srcPort ) = 0;
// AFTER calling HandleIncomingPacket for any packets that came in that frame, call this.
// This gets a packet that the master server updater needs to send out on UDP.
// It returns the length of the packet it wants to send, or 0 if there are no more packets to send.
// Call this each frame until it returns 0.
virtual int GetNextOutgoingPacket( void *pOut, int cbMaxOut, uint32 *pNetAdr, uint16 *pPort ) = 0;
//
// Server clan association
//
// associate this game server with this clan for the purposes of computing player compat
STEAM_CALL_RESULT( AssociateWithClanResult_t )
virtual SteamAPICall_t AssociateWithClan( CSteamID steamIDClan ) = 0;
// ask if any of the current players dont want to play with this new player - or vice versa
STEAM_CALL_RESULT( ComputeNewPlayerCompatibilityResult_t )
virtual SteamAPICall_t ComputeNewPlayerCompatibility( CSteamID steamIDNewPlayer ) = 0;
// Handles receiving a new connection from a Steam user. This call will ask the Steam
// servers to validate the users identity, app ownership, and VAC status. If the Steam servers
// are off-line, then it will validate the cached ticket itself which will validate app ownership
// and identity. The AuthBlob here should be acquired on the game client using SteamUser()->InitiateGameConnection()
// and must then be sent up to the game server for authentication.
//
// Return Value: returns true if the users ticket passes basic checks. pSteamIDUser will contain the Steam ID of this user. pSteamIDUser must NOT be NULL
// If the call succeeds then you should expect a GSClientApprove_t or GSClientDeny_t callback which will tell you whether authentication
// for the user has succeeded or failed (the steamid in the callback will match the one returned by this call)
//
// DEPRECATED! This function will be removed from the SDK in an upcoming version.
// Please migrate to BeginAuthSession and related functions.
virtual bool SendUserConnectAndAuthenticate_DEPRECATED( uint32 unIPClient, const void *pvAuthBlob, uint32 cubAuthBlobSize, CSteamID *pSteamIDUser ) = 0;
// Creates a fake user (ie, a bot) which will be listed as playing on the server, but skips validation.
//
// Return Value: Returns a SteamID for the user to be tracked with, you should call EndAuthSession()
// when this user leaves the server just like you would for a real user.
virtual CSteamID CreateUnauthenticatedUserConnection() = 0;
// Should be called whenever a user leaves our game server, this lets Steam internally
// track which users are currently on which servers for the purposes of preventing a single
// account being logged into multiple servers, showing who is currently on a server, etc.
//
// DEPRECATED! This function will be removed from the SDK in an upcoming version.
// Please migrate to BeginAuthSession and related functions.
virtual void SendUserDisconnect_DEPRECATED( CSteamID steamIDUser ) = 0;
// Update the data to be displayed in the server browser and matchmaking interfaces for a user
// currently connected to the server. For regular users you must call this after you receive a
// GSUserValidationSuccess callback.
//
// Return Value: true if successful, false if failure (ie, steamIDUser wasn't for an active player)
virtual bool BUpdateUserData( CSteamID steamIDUser, const char *pchPlayerName, uint32 uScore ) = 0;
// Deprecated functions. These will be removed in a future version of the SDK.
// If you really need these, please contact us and help us understand what you are
// using them for.
STEAM_PRIVATE_API(
virtual void SetMasterServerHeartbeatInterval_DEPRECATED( int iHeartbeatInterval ) = 0;
virtual void ForceMasterServerHeartbeat_DEPRECATED() = 0;
)
};
#define STEAMGAMESERVER_INTERFACE_VERSION "SteamGameServer015"
// Global accessor
inline ISteamGameServer *SteamGameServer();
STEAM_DEFINE_GAMESERVER_INTERFACE_ACCESSOR( ISteamGameServer *, SteamGameServer, STEAMGAMESERVER_INTERFACE_VERSION );
// callbacks
#if defined( VALVE_CALLBACK_PACK_SMALL )
#pragma pack( push, 4 )
#elif defined( VALVE_CALLBACK_PACK_LARGE )
#pragma pack( push, 8 )
#else
#error steam_api_common.h should define VALVE_CALLBACK_PACK_xxx
#endif
// client has been approved to connect to this game server
struct GSClientApprove_t
{
enum { k_iCallback = k_iSteamGameServerCallbacks + 1 };
CSteamID m_SteamID; // SteamID of approved player
CSteamID m_OwnerSteamID; // SteamID of original owner for game license
};
// client has been denied to connection to this game server
struct GSClientDeny_t
{
enum { k_iCallback = k_iSteamGameServerCallbacks + 2 };
CSteamID m_SteamID;
EDenyReason m_eDenyReason;
char m_rgchOptionalText[128];
};
// request the game server should kick the user
struct GSClientKick_t
{
enum { k_iCallback = k_iSteamGameServerCallbacks + 3 };
CSteamID m_SteamID;
EDenyReason m_eDenyReason;
};
// NOTE: callback values 4 and 5 are skipped because they are used for old deprecated callbacks,
// do not reuse them here.
// client achievement info
struct GSClientAchievementStatus_t
{
enum { k_iCallback = k_iSteamGameServerCallbacks + 6 };
uint64 m_SteamID;
char m_pchAchievement[128];
bool m_bUnlocked;
};
// received when the game server requests to be displayed as secure (VAC protected)
// m_bSecure is true if the game server should display itself as secure to users, false otherwise
struct GSPolicyResponse_t
{
enum { k_iCallback = k_iSteamUserCallbacks + 15 };
uint8 m_bSecure;
};
// GS gameplay stats info
struct GSGameplayStats_t
{
enum { k_iCallback = k_iSteamGameServerCallbacks + 7 };
EResult m_eResult; // Result of the call
int32 m_nRank; // Overall rank of the server (0-based)
uint32 m_unTotalConnects; // Total number of clients who have ever connected to the server
uint32 m_unTotalMinutesPlayed; // Total number of minutes ever played on the server
};
// send as a reply to RequestUserGroupStatus()
struct GSClientGroupStatus_t
{
enum { k_iCallback = k_iSteamGameServerCallbacks + 8 };
CSteamID m_SteamIDUser;
CSteamID m_SteamIDGroup;
bool m_bMember;
bool m_bOfficer;
};
// Sent as a reply to GetServerReputation()
struct GSReputation_t
{
enum { k_iCallback = k_iSteamGameServerCallbacks + 9 };
EResult m_eResult; // Result of the call;
uint32 m_unReputationScore; // The reputation score for the game server
bool m_bBanned; // True if the server is banned from the Steam
// master servers
// The following members are only filled out if m_bBanned is true. They will all
// be set to zero otherwise. Master server bans are by IP so it is possible to be
// banned even when the score is good high if there is a bad server on another port.
// This information can be used to determine which server is bad.
uint32 m_unBannedIP; // The IP of the banned server
uint16 m_usBannedPort; // The port of the banned server
uint64 m_ulBannedGameID; // The game ID the banned server is serving
uint32 m_unBanExpires; // Time the ban expires, expressed in the Unix epoch (seconds since 1/1/1970)
};
// Sent as a reply to AssociateWithClan()
struct AssociateWithClanResult_t
{
enum { k_iCallback = k_iSteamGameServerCallbacks + 10 };
EResult m_eResult; // Result of the call;
};
// Sent as a reply to ComputeNewPlayerCompatibility()
struct ComputeNewPlayerCompatibilityResult_t
{
enum { k_iCallback = k_iSteamGameServerCallbacks + 11 };
EResult m_eResult; // Result of the call;
int m_cPlayersThatDontLikeCandidate;
int m_cPlayersThatCandidateDoesntLike;
int m_cClanPlayersThatDontLikeCandidate;
CSteamID m_SteamIDCandidate;
};
#pragma pack( pop )
#endif // ISTEAMGAMESERVER_H
```
|
Klooster-Lidlum () is a small village in Waadhoeke municipality in the province of Friesland, the Netherlands. It had a population of around 38 in January 2014.
History
The village was first mentioned in 1317 as Lidlem, and means "monastery of the settlement of Liudila (person)". The monastery refers to the Premonstratensian abbey Mariëndal which was founded in 1182 near Tzummarum. In 1234, it was moved to Lidlum. In the 13th century, the monastery was home to 600 monks, had several outposts and ruled over 18 parishes. In 1572, it was destroyed by the Geuzen. After its destruction, Caspar de Robles turned it into barracks for Spanish troops. In 1580, the monastery was dissolved.
The village turned into an agriculture community which specialised in potatoes. Klooster-Lidlum was home to 78 people in 1840.
Until 2018, the village was part of the Franekeradeel municipality and until 1984 it belonged to Barradeel municipality.
References
Waadhoeke
Populated places in Friesland
|
```objective-c
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
#ident "$Id$"
/*
COPYING CONDITIONS NOTICE:
This program is free software; you can redistribute it and/or modify
published by the Free Software Foundation, and provided that the
following conditions are met:
* Redistributions of source code must retain this COPYING
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
GRANT (below).
* Redistributions in binary form must reproduce this COPYING
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
GRANT (below) in the documentation and/or other materials
provided with the distribution.
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
COPYRIGHT NOTICE:
TokuFT, Tokutek Fractal Tree Indexing Library.
DISCLAIMER:
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
UNIVERSITY PATENT NOTICE:
The technology is licensed by the Massachusetts Institute of
Technology, Rutgers State University of New Jersey, and the Research
Foundation of State University of New York at Stony Brook under
United States of America Serial No. 11/760379 and to the patents
and/or patent applications resulting from it.
PATENT MARKING NOTICE:
This software is covered by US Patent No. 8,185,551.
This software is covered by US Patent No. 8,489,638.
PATENT RIGHTS GRANT:
"THIS IMPLEMENTATION" means the copyrightable works distributed by
Tokutek as part of the Fractal Tree project.
"PATENT CLAIMS" means the claims of patents that are owned or
licensable by Tokutek, both currently or in the future; and that in
the absence of this license would be infringed by THIS
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
"PATENT CHALLENGE" shall mean a challenge to the validity,
patentability, enforceability and/or non-infringement of any of the
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
Tokutek hereby grants to you, for the term and geographical scope of
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
irrevocable (except as stated in this section) patent license to
make, have made, use, offer to sell, sell, import, transfer, and
otherwise run, modify, and propagate the contents of THIS
IMPLEMENTATION, where such license applies only to the PATENT
CLAIMS. This grant does not include claims that would be infringed
only as a consequence of further modifications of THIS
IMPLEMENTATION. If you or your agent or licensee institute or order
or agree to the institution of patent litigation against any entity
(including a cross-claim or counterclaim in a lawsuit) alleging that
THIS IMPLEMENTATION constitutes direct or contributory patent
infringement, or inducement of patent infringement, then any rights
such litigation is filed. If you or your agent or exclusive
licensee institute or order or agree to the institution of a PATENT
CHALLENGE, then Tokutek may terminate any rights granted to you
*/
#pragma once
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."
#include "ft/txn/txn.h"
#include "ft/cachetable/cachetable.h"
#include "ft/comparator.h"
#include "ft/ft-ops.h"
// The loader callbacks are C functions and need to be defined as such
typedef void (*ft_loader_error_func)(DB *, int which_db, int err, DBT *key, DBT *val, void *extra);
typedef int (*ft_loader_poll_func)(void *extra, float progress);
typedef struct ft_loader_s *FTLOADER;
int toku_ft_loader_open (FTLOADER *bl,
CACHETABLE cachetable,
generate_row_for_put_func g,
DB *src_db,
int N,
FT_HANDLE ft_hs[/*N*/], DB* dbs[/*N*/],
const char * new_fnames_in_env[/*N*/],
ft_compare_func bt_compare_functions[/*N*/],
const char *temp_file_template,
LSN load_lsn,
TOKUTXN txn,
bool reserve_memory,
uint64_t reserve_memory_size,
bool compress_intermediates,
bool allow_puts);
int toku_ft_loader_put (FTLOADER bl, DBT *key, DBT *val);
int toku_ft_loader_close (FTLOADER bl,
ft_loader_error_func error_callback, void *error_callback_extra,
ft_loader_poll_func poll_callback, void *poll_callback_extra);
int toku_ft_loader_abort(FTLOADER bl,
bool is_error);
// For test purposes only
void toku_ft_loader_set_size_factor (uint32_t factor);
void ft_loader_set_os_fwrite (size_t (*fwrite_fun)(const void*,size_t,size_t,FILE*));
size_t ft_loader_leafentry_size(size_t key_size, size_t val_size, TXNID xid);
```
|
```php
<?php
/**
* Passbolt ~ Open source password manager for teams
*
* For full copyright and license information, please see the LICENSE.txt
* Redistributions of files must retain the above copyright notice.
*
* @link path_to_url Passbolt(tm)
* @since 2.0.0
*/
use App\Utility\Purifier;
?>
<table id="added_users" style="border:0; margin:5px 0 0 5px;">
<?php foreach ($groups as $group): ?>
<tr>
<td style="width:15px;">•</td>
<td><?= Purifier::clean($group['name']); ?></td>
</tr>
<?php endforeach; ?>
</table>
```
|
```javascript
'use strict';
var whitespace = require('is-whitespace-character');
var locate = require('../locate/link');
module.exports = link;
link.locator = locate;
var own = {}.hasOwnProperty;
var C_BACKSLASH = '\\';
var C_BRACKET_OPEN = '[';
var C_BRACKET_CLOSE = ']';
var C_PAREN_OPEN = '(';
var C_PAREN_CLOSE = ')';
var C_LT = '<';
var C_GT = '>';
var C_TICK = '`';
var C_DOUBLE_QUOTE = '"';
var C_SINGLE_QUOTE = '\'';
/* Map of characters, which can be used to mark link
* and image titles. */
var LINK_MARKERS = {};
LINK_MARKERS[C_DOUBLE_QUOTE] = C_DOUBLE_QUOTE;
LINK_MARKERS[C_SINGLE_QUOTE] = C_SINGLE_QUOTE;
/* Map of characters, which can be used to mark link
* and image titles in commonmark-mode. */
var COMMONMARK_LINK_MARKERS = {};
COMMONMARK_LINK_MARKERS[C_DOUBLE_QUOTE] = C_DOUBLE_QUOTE;
COMMONMARK_LINK_MARKERS[C_SINGLE_QUOTE] = C_SINGLE_QUOTE;
COMMONMARK_LINK_MARKERS[C_PAREN_OPEN] = C_PAREN_CLOSE;
function link(eat, value, silent) {
var self = this;
var subvalue = '';
var index = 0;
var character = value.charAt(0);
var pedantic = self.options.pedantic;
var commonmark = self.options.commonmark;
var gfm = self.options.gfm;
var closed;
var count;
var opening;
var beforeURL;
var beforeTitle;
var subqueue;
var hasMarker;
var markers;
var isImage;
var content;
var marker;
var length;
var title;
var depth;
var queue;
var url;
var now;
var exit;
var node;
/* Detect whether this is an image. */
if (character === '!') {
isImage = true;
subvalue = character;
character = value.charAt(++index);
}
/* Eat the opening. */
if (character !== C_BRACKET_OPEN) {
return;
}
/* Exit when this is a link and were already inside
* a link. */
if (!isImage && self.inLink) {
return;
}
subvalue += character;
queue = '';
index++;
/* Eat the content. */
length = value.length;
now = eat.now();
depth = 0;
now.column += index;
now.offset += index;
while (index < length) {
character = value.charAt(index);
subqueue = character;
if (character === C_TICK) {
/* Inline-code in link content. */
count = 1;
while (value.charAt(index + 1) === C_TICK) {
subqueue += character;
index++;
count++;
}
if (!opening) {
opening = count;
} else if (count >= opening) {
opening = 0;
}
} else if (character === C_BACKSLASH) {
/* Allow brackets to be escaped. */
index++;
subqueue += value.charAt(index);
/* In GFM mode, brackets in code still count.
* In all other modes, they dont. This empty
* block prevents the next statements are
* entered. */
} else if ((!opening || gfm) && character === C_BRACKET_OPEN) {
depth++;
} else if ((!opening || gfm) && character === C_BRACKET_CLOSE) {
if (depth) {
depth--;
} else {
/* Allow white-space between content and
* url in GFM mode. */
if (!pedantic) {
while (index < length) {
character = value.charAt(index + 1);
if (!whitespace(character)) {
break;
}
subqueue += character;
index++;
}
}
if (value.charAt(index + 1) !== C_PAREN_OPEN) {
return;
}
subqueue += C_PAREN_OPEN;
closed = true;
index++;
break;
}
}
queue += subqueue;
subqueue = '';
index++;
}
/* Eat the content closing. */
if (!closed) {
return;
}
content = queue;
subvalue += queue + subqueue;
index++;
/* Eat white-space. */
while (index < length) {
character = value.charAt(index);
if (!whitespace(character)) {
break;
}
subvalue += character;
index++;
}
/* Eat the URL. */
character = value.charAt(index);
markers = commonmark ? COMMONMARK_LINK_MARKERS : LINK_MARKERS;
queue = '';
beforeURL = subvalue;
if (character === C_LT) {
index++;
beforeURL += C_LT;
while (index < length) {
character = value.charAt(index);
if (character === C_GT) {
break;
}
if (commonmark && character === '\n') {
return;
}
queue += character;
index++;
}
if (value.charAt(index) !== C_GT) {
return;
}
subvalue += C_LT + queue + C_GT;
url = queue;
index++;
} else {
character = null;
subqueue = '';
while (index < length) {
character = value.charAt(index);
if (subqueue && own.call(markers, character)) {
break;
}
if (whitespace(character)) {
if (!pedantic) {
break;
}
subqueue += character;
} else {
if (character === C_PAREN_OPEN) {
depth++;
} else if (character === C_PAREN_CLOSE) {
if (depth === 0) {
break;
}
depth--;
}
queue += subqueue;
subqueue = '';
if (character === C_BACKSLASH) {
queue += C_BACKSLASH;
character = value.charAt(++index);
}
queue += character;
}
index++;
}
subvalue += queue;
url = queue;
index = subvalue.length;
}
/* Eat white-space. */
queue = '';
while (index < length) {
character = value.charAt(index);
if (!whitespace(character)) {
break;
}
queue += character;
index++;
}
character = value.charAt(index);
subvalue += queue;
/* Eat the title. */
if (queue && own.call(markers, character)) {
index++;
subvalue += character;
queue = '';
marker = markers[character];
beforeTitle = subvalue;
/* In commonmark-mode, things are pretty easy: the
* marker cannot occur inside the title.
*
* Non-commonmark does, however, support nested
* delimiters. */
if (commonmark) {
while (index < length) {
character = value.charAt(index);
if (character === marker) {
break;
}
if (character === C_BACKSLASH) {
queue += C_BACKSLASH;
character = value.charAt(++index);
}
index++;
queue += character;
}
character = value.charAt(index);
if (character !== marker) {
return;
}
title = queue;
subvalue += queue + character;
index++;
while (index < length) {
character = value.charAt(index);
if (!whitespace(character)) {
break;
}
subvalue += character;
index++;
}
} else {
subqueue = '';
while (index < length) {
character = value.charAt(index);
if (character === marker) {
if (hasMarker) {
queue += marker + subqueue;
subqueue = '';
}
hasMarker = true;
} else if (!hasMarker) {
queue += character;
} else if (character === C_PAREN_CLOSE) {
subvalue += queue + marker + subqueue;
title = queue;
break;
} else if (whitespace(character)) {
subqueue += character;
} else {
queue += marker + subqueue + character;
subqueue = '';
hasMarker = false;
}
index++;
}
}
}
if (value.charAt(index) !== C_PAREN_CLOSE) {
return;
}
/* istanbul ignore if - never used (yet) */
if (silent) {
return true;
}
subvalue += C_PAREN_CLOSE;
url = self.decode.raw(self.unescape(url), eat(beforeURL).test().end, {nonTerminated: false});
if (title) {
beforeTitle = eat(beforeTitle).test().end;
title = self.decode.raw(self.unescape(title), beforeTitle);
}
node = {
type: isImage ? 'image' : 'link',
title: title || null,
url: url
};
if (isImage) {
node.alt = self.decode.raw(self.unescape(content), now) || null;
} else {
exit = self.enterLink();
node.children = self.tokenizeInline(content, now);
exit();
}
return eat(subvalue)(node);
}
```
|
This is a list of public art in Coventry, in the West Midlands, England. This list applies only to works of public art accessible in an outdoor public space. For example, this does not include artwork visible inside a museum.
Central Coventry
Coventry Cathedral
Herbert Art Gallery and Museum
Millennium Place
Coventry Council House
Greyfriars Green
Broadgate and Hertford Street
Bull Yard
Coventry University
Belgrade Theatre
Other city centre areas
Coventry Ring Road
Coventry Canal
Foleshill
References
Coventry
Public art
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\BigQueryConnectionService;
class BigqueryconnectionEmpty extends \Google\Model
{
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(BigqueryconnectionEmpty::class, your_sha256_hash);
```
|
Richard Hoagland may refer to:
Richard C. Hoagland (born 1945), fringe researcher, famous for his theories on the Face on Mars
Richard E. Hoagland (born 1950), U.S. diplomat
|
```sqlpl
select 1 as id
union all
select * from {{ ref('node_0') }}
union all
select * from {{ ref('node_2') }}
union all
select * from {{ ref('node_5') }}
union all
select * from {{ ref('node_57') }}
union all
select * from {{ ref('node_361') }}
union all
select * from {{ ref('node_1071') }}
```
|
```c++
/*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkPdfFormFieldActionsDictionary_autogen.h"
#include "SkPdfNativeDoc.h"
SkPdfDictionary* SkPdfFormFieldActionsDictionary::K(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("K", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isDictionary()) || (doc == NULL && ret != NULL && ret->isReference())) return (SkPdfDictionary*)ret;
// TODO(edisonn): warn about missing default value for optional fields
return NULL;
}
bool SkPdfFormFieldActionsDictionary::has_K() const {
return get("K", "") != NULL;
}
SkPdfDictionary* SkPdfFormFieldActionsDictionary::F(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("F", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isDictionary()) || (doc == NULL && ret != NULL && ret->isReference())) return (SkPdfDictionary*)ret;
// TODO(edisonn): warn about missing default value for optional fields
return NULL;
}
bool SkPdfFormFieldActionsDictionary::has_F() const {
return get("F", "") != NULL;
}
SkPdfDictionary* SkPdfFormFieldActionsDictionary::V(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("V", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isDictionary()) || (doc == NULL && ret != NULL && ret->isReference())) return (SkPdfDictionary*)ret;
// TODO(edisonn): warn about missing default value for optional fields
return NULL;
}
bool SkPdfFormFieldActionsDictionary::has_V() const {
return get("V", "") != NULL;
}
SkPdfDictionary* SkPdfFormFieldActionsDictionary::C(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("C", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isDictionary()) || (doc == NULL && ret != NULL && ret->isReference())) return (SkPdfDictionary*)ret;
// TODO(edisonn): warn about missing default value for optional fields
return NULL;
}
bool SkPdfFormFieldActionsDictionary::has_C() const {
return get("C", "") != NULL;
}
```
|
```java
package com.netflix.metacat.connector.hive.util;
import com.netflix.metacat.common.server.partition.util.PartitionUtil;
import com.netflix.metacat.common.server.partition.visitor.PartitionKeyParserEval;
import org.apache.hadoop.hive.common.FileUtils;
/**
* Hive partition key evaluation.
*/
public class HivePartitionKeyParserEval extends PartitionKeyParserEval {
@Override
protected String toValue(final Object value) {
return value == null ? PartitionUtil.DEFAULT_PARTITION_NAME
: FileUtils.escapePathName(value.toString());
}
}
```
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<Project DefaultTargets="Build" ToolsVersion="15.0" xmlns="path_to_url">
<ItemGroup Label="ProjectConfigurations">
<ProjectConfiguration Include="debug|Win32">
<Configuration>debug</Configuration>
<Platform>Win32</Platform>
</ProjectConfiguration>
<ProjectConfiguration Include="release|Win32">
<Configuration>release</Configuration>
<Platform>Win32</Platform>
</ProjectConfiguration>
<ProjectConfiguration Include="profile|Win32">
<Configuration>profile</Configuration>
<Platform>Win32</Platform>
</ProjectConfiguration>
<ProjectConfiguration Include="checked|Win32">
<Configuration>checked</Configuration>
<Platform>Win32</Platform>
</ProjectConfiguration>
</ItemGroup>
<PropertyGroup Label="Globals">
<ProjectGuid>{F7306F72-804E-41BB-6430-8804934AD542}</ProjectGuid>
<RootNamespace>ApexCommon</RootNamespace>
</PropertyGroup>
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='debug|Win32'" Label="Configuration">
<ConfigurationType>StaticLibrary</ConfigurationType>
<PlatformToolset>v141</PlatformToolset>
</PropertyGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='release|Win32'" Label="Configuration">
<ConfigurationType>StaticLibrary</ConfigurationType>
<PlatformToolset>v141</PlatformToolset>
</PropertyGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='profile|Win32'" Label="Configuration">
<ConfigurationType>StaticLibrary</ConfigurationType>
<PlatformToolset>v141</PlatformToolset>
</PropertyGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='checked|Win32'" Label="Configuration">
<ConfigurationType>StaticLibrary</ConfigurationType>
<PlatformToolset>v141</PlatformToolset>
</PropertyGroup>
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
<ImportGroup Label="ExtensionSettings">
</ImportGroup>
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='debug|Win32'">
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
<Import Project="../paths.vsprops" />
</ImportGroup>
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='release|Win32'">
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
<Import Project="../paths.vsprops" />
</ImportGroup>
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='profile|Win32'">
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
<Import Project="../paths.vsprops" />
</ImportGroup>
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='checked|Win32'">
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
<Import Project="../paths.vsprops" />
</ImportGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='debug|Win32'">
<OutDir>./../../lib/vc15win32-PhysX_3.4\</OutDir>
<IntDir>./build/Win32/ApexCommon/debug\</IntDir>
<TargetExt>.lib</TargetExt>
<TargetName>$(ProjectName)DEBUG</TargetName>
<CodeAnalysisRuleSet>AllRules.ruleset</CodeAnalysisRuleSet>
<CodeAnalysisRules />
<CodeAnalysisRuleAssemblies />
</PropertyGroup>
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='debug|Win32'">
<ClCompile>
<FloatingPointModel>Precise</FloatingPointModel>
<AdditionalOptions>/wd4201 /wd4324 /Wall /wd4514 /wd4820 /wd4127 /wd4710 /wd4711 /wd4061 /wd4668 /wd4626 /wd4266 /wd4263 /wd4264 /wd4640 /wd4625 /wd4574 /wd4191 /wd4987 /wd4986 /wd4946 /wd4836 /wd4571 /wd4826 /wd4577 /wd4458 /wd4456 /wd4457 /wd4548 /wd5026 /wd5027 /wd4464 /wd5038 /wd5039 /wd4596 /wd4365 /wd4774 /wd4996 /wd5045 /GR- /GF /WX /fp:fast /arch:SSE2 /MP /Od /RTCsu /d2Zi+</AdditionalOptions>
<Optimization>Disabled</Optimization>
<AdditionalIncludeDirectories>../../../PxShared/include;../../../PxShared/include/filebuf;../../../PxShared/include/foundation;../../../PxShared/include/task;../../../PxShared/include/cudamanager;../../../PxShared/include/pvd;../../../PxShared/src/foundation/include;../../../PxShared/src/filebuf/include;../../../PxShared/src/fastxml/include;../../../PxShared/src/pvd/include;./../../shared/general/shared;./../../public;../../../PhysX_3.4/Include;../../../PhysX_3.4/Include/common;../../../PhysX_3.4/Include/cooking;../../../PhysX_3.4/Include/extensions;../../../PhysX_3.4/Include/geometry;../../../PhysX_3.4/Include/gpu;../../../PhysX_3.4/Include/deformable;../../../PhysX_3.4/Include/particles;../../../PhysX_3.4/Include/characterkinematic;../../../PhysX_3.4/Include/characterdynamic;../../../PhysX_3.4/Include/vehicle;../../../PhysX_3.4/Source/GeomUtils/headers;../../../PhysX_3.4/Source/PhysXGpu/include;./../../shared/general/RenderDebug/public;./../../shared/general/shared/inparser/include;./../../common/include;./../../common/include/autogen;./../../common/include/windows;./../../shared/internal/include;./../../module/common/include;./../../NvParameterized/include;./../../include;./../../include/PhysX3;./../../../Externals/nvToolsExt/1/include;./../../framework/include;./../../framework/include/autogen;./../../include;./../../include/PhysX3;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
<PreprocessorDefinitions>WIN32;_CRT_SECURE_NO_DEPRECATE;_CRT_NONSTDC_NO_DEPRECATE;DISABLE_CUDA_PHYSX;INSTALLER=1;EXCLUDE_PARTICLES=1;ENABLE_TEST=0;_DEBUG;PX_DEBUG;PX_CHECKED;PHYSX_PROFILE_SDK;PX_SUPPORT_VISUAL_DEBUGGER;PX_PROFILE;PX_NVTX=1;PX_PHYSX_DLL_NAME_POSTFIX=DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
<ExceptionHandling>false</ExceptionHandling>
<WarningLevel>Level4</WarningLevel>
<RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
<PrecompiledHeader>NotUsing</PrecompiledHeader>
<PrecompiledHeaderFile></PrecompiledHeaderFile>
<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
</ClCompile>
<Lib>
<AdditionalOptions>/INCREMENTAL:NO</AdditionalOptions>
<AdditionalDependencies>%(AdditionalDependencies)</AdditionalDependencies>
<OutputFile>$(OutDir)$(ProjectName)DEBUG.lib</OutputFile>
<AdditionalLibraryDirectories>../../../PxShared/lib/vc15win32;../../../PhysX_3.4/Lib/vc15win32;%(AdditionalLibraryDirectories)</AdditionalLibraryDirectories>
<ProgramDatabaseFile>$(OutDir)/$(ProjectName)DEBUG.lib.pdb</ProgramDatabaseFile>
<TargetMachine>MachineX86</TargetMachine>
</Lib>
<ResourceCompile>
</ResourceCompile>
<ProjectReference>
<LinkLibraryDependencies>true</LinkLibraryDependencies>
</ProjectReference>
</ItemDefinitionGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='release|Win32'">
<OutDir>./../../lib/vc15win32-PhysX_3.4\</OutDir>
<IntDir>./build/Win32/ApexCommon/release\</IntDir>
<TargetExt>.lib</TargetExt>
<TargetName>$(ProjectName)</TargetName>
<CodeAnalysisRuleSet>AllRules.ruleset</CodeAnalysisRuleSet>
<CodeAnalysisRules />
<CodeAnalysisRuleAssemblies />
</PropertyGroup>
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='release|Win32'">
<ClCompile>
<FloatingPointModel>Precise</FloatingPointModel>
<AdditionalOptions>/wd4201 /wd4324 /Wall /wd4514 /wd4820 /wd4127 /wd4710 /wd4711 /wd4061 /wd4668 /wd4626 /wd4266 /wd4263 /wd4264 /wd4640 /wd4625 /wd4574 /wd4191 /wd4987 /wd4986 /wd4946 /wd4836 /wd4571 /wd4826 /wd4577 /wd4458 /wd4456 /wd4457 /wd4548 /wd5026 /wd5027 /wd4464 /wd5038 /wd5039 /wd4596 /wd4365 /wd4774 /wd4996 /wd5045 /GR- /GF /WX /fp:fast /arch:SSE2 /MP /Ox /d2Zi+</AdditionalOptions>
<Optimization>Disabled</Optimization>
<AdditionalIncludeDirectories>../../../PxShared/include;../../../PxShared/include/filebuf;../../../PxShared/include/foundation;../../../PxShared/include/task;../../../PxShared/include/cudamanager;../../../PxShared/include/pvd;../../../PxShared/src/foundation/include;../../../PxShared/src/filebuf/include;../../../PxShared/src/fastxml/include;../../../PxShared/src/pvd/include;./../../shared/general/shared;./../../public;../../../PhysX_3.4/Include;../../../PhysX_3.4/Include/common;../../../PhysX_3.4/Include/cooking;../../../PhysX_3.4/Include/extensions;../../../PhysX_3.4/Include/geometry;../../../PhysX_3.4/Include/gpu;../../../PhysX_3.4/Include/deformable;../../../PhysX_3.4/Include/particles;../../../PhysX_3.4/Include/characterkinematic;../../../PhysX_3.4/Include/characterdynamic;../../../PhysX_3.4/Include/vehicle;../../../PhysX_3.4/Source/GeomUtils/headers;../../../PhysX_3.4/Source/PhysXGpu/include;./../../shared/general/RenderDebug/public;./../../shared/general/shared/inparser/include;./../../common/include;./../../common/include/autogen;./../../common/include/windows;./../../shared/internal/include;./../../module/common/include;./../../NvParameterized/include;./../../include;./../../include/PhysX3;./../../../Externals/nvToolsExt/1/include;./../../framework/include;./../../framework/include/autogen;./../../include;./../../include/PhysX3;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
<PreprocessorDefinitions>WIN32;_CRT_SECURE_NO_DEPRECATE;_CRT_NONSTDC_NO_DEPRECATE;DISABLE_CUDA_PHYSX;INSTALLER=1;EXCLUDE_PARTICLES=1;ENABLE_TEST=0;NDEBUG;APEX_SHIPPING;_SECURE_SCL=0;_ITERATOR_DEBUG_LEVEL=0;%(PreprocessorDefinitions)</PreprocessorDefinitions>
<ExceptionHandling>false</ExceptionHandling>
<WarningLevel>Level4</WarningLevel>
<RuntimeLibrary>MultiThreaded</RuntimeLibrary>
<PrecompiledHeader>NotUsing</PrecompiledHeader>
<PrecompiledHeaderFile></PrecompiledHeaderFile>
<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
</ClCompile>
<Lib>
<AdditionalOptions>/INCREMENTAL:NO</AdditionalOptions>
<AdditionalDependencies>%(AdditionalDependencies)</AdditionalDependencies>
<OutputFile>$(OutDir)$(ProjectName).lib</OutputFile>
<AdditionalLibraryDirectories>../../../PxShared/lib/vc15win32;../../../PhysX_3.4/Lib/vc15win32;%(AdditionalLibraryDirectories)</AdditionalLibraryDirectories>
<ProgramDatabaseFile>$(OutDir)/$(ProjectName).lib.pdb</ProgramDatabaseFile>
<TargetMachine>MachineX86</TargetMachine>
</Lib>
<ResourceCompile>
</ResourceCompile>
<ProjectReference>
<LinkLibraryDependencies>true</LinkLibraryDependencies>
</ProjectReference>
</ItemDefinitionGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='profile|Win32'">
<OutDir>./../../lib/vc15win32-PhysX_3.4\</OutDir>
<IntDir>./build/Win32/ApexCommon/profile\</IntDir>
<TargetExt>.lib</TargetExt>
<TargetName>$(ProjectName)PROFILE</TargetName>
<CodeAnalysisRuleSet>AllRules.ruleset</CodeAnalysisRuleSet>
<CodeAnalysisRules />
<CodeAnalysisRuleAssemblies />
</PropertyGroup>
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='profile|Win32'">
<ClCompile>
<FloatingPointModel>Precise</FloatingPointModel>
<AdditionalOptions>/wd4201 /wd4324 /Wall /wd4514 /wd4820 /wd4127 /wd4710 /wd4711 /wd4061 /wd4668 /wd4626 /wd4266 /wd4263 /wd4264 /wd4640 /wd4625 /wd4574 /wd4191 /wd4987 /wd4986 /wd4946 /wd4836 /wd4571 /wd4826 /wd4577 /wd4458 /wd4456 /wd4457 /wd4548 /wd5026 /wd5027 /wd4464 /wd5038 /wd5039 /wd4596 /wd4365 /wd4774 /wd4996 /wd5045 /GR- /GF /WX /fp:fast /arch:SSE2 /MP /Ox /d2Zi+</AdditionalOptions>
<Optimization>Disabled</Optimization>
<AdditionalIncludeDirectories>../../../PxShared/include;../../../PxShared/include/filebuf;../../../PxShared/include/foundation;../../../PxShared/include/task;../../../PxShared/include/cudamanager;../../../PxShared/include/pvd;../../../PxShared/src/foundation/include;../../../PxShared/src/filebuf/include;../../../PxShared/src/fastxml/include;../../../PxShared/src/pvd/include;./../../shared/general/shared;./../../public;../../../PhysX_3.4/Include;../../../PhysX_3.4/Include/common;../../../PhysX_3.4/Include/cooking;../../../PhysX_3.4/Include/extensions;../../../PhysX_3.4/Include/geometry;../../../PhysX_3.4/Include/gpu;../../../PhysX_3.4/Include/deformable;../../../PhysX_3.4/Include/particles;../../../PhysX_3.4/Include/characterkinematic;../../../PhysX_3.4/Include/characterdynamic;../../../PhysX_3.4/Include/vehicle;../../../PhysX_3.4/Source/GeomUtils/headers;../../../PhysX_3.4/Source/PhysXGpu/include;./../../shared/general/RenderDebug/public;./../../shared/general/shared/inparser/include;./../../common/include;./../../common/include/autogen;./../../common/include/windows;./../../shared/internal/include;./../../module/common/include;./../../NvParameterized/include;./../../include;./../../include/PhysX3;./../../../Externals/nvToolsExt/1/include;./../../framework/include;./../../framework/include/autogen;./../../include;./../../include/PhysX3;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
<PreprocessorDefinitions>WIN32;_CRT_SECURE_NO_DEPRECATE;_CRT_NONSTDC_NO_DEPRECATE;DISABLE_CUDA_PHYSX;INSTALLER=1;EXCLUDE_PARTICLES=1;ENABLE_TEST=0;NDEBUG;PHYSX_PROFILE_SDK;PX_SUPPORT_VISUAL_DEBUGGER;PX_PROFILE;PX_NVTX=1;_SECURE_SCL=0;_ITERATOR_DEBUG_LEVEL=0;PX_PHYSX_DLL_NAME_POSTFIX=PROFILE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
<ExceptionHandling>false</ExceptionHandling>
<WarningLevel>Level4</WarningLevel>
<RuntimeLibrary>MultiThreaded</RuntimeLibrary>
<PrecompiledHeader>NotUsing</PrecompiledHeader>
<PrecompiledHeaderFile></PrecompiledHeaderFile>
<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
</ClCompile>
<Lib>
<AdditionalOptions>/INCREMENTAL:NO</AdditionalOptions>
<AdditionalDependencies>%(AdditionalDependencies)</AdditionalDependencies>
<OutputFile>$(OutDir)$(ProjectName)PROFILE.lib</OutputFile>
<AdditionalLibraryDirectories>../../../PxShared/lib/vc15win32;../../../PhysX_3.4/Lib/vc15win32;%(AdditionalLibraryDirectories)</AdditionalLibraryDirectories>
<ProgramDatabaseFile>$(OutDir)/$(ProjectName)PROFILE.lib.pdb</ProgramDatabaseFile>
<TargetMachine>MachineX86</TargetMachine>
</Lib>
<ResourceCompile>
</ResourceCompile>
<ProjectReference>
<LinkLibraryDependencies>true</LinkLibraryDependencies>
</ProjectReference>
</ItemDefinitionGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='checked|Win32'">
<OutDir>./../../lib/vc15win32-PhysX_3.4\</OutDir>
<IntDir>./build/Win32/ApexCommon/checked\</IntDir>
<TargetExt>.lib</TargetExt>
<TargetName>$(ProjectName)CHECKED</TargetName>
<CodeAnalysisRuleSet>AllRules.ruleset</CodeAnalysisRuleSet>
<CodeAnalysisRules />
<CodeAnalysisRuleAssemblies />
</PropertyGroup>
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='checked|Win32'">
<ClCompile>
<FloatingPointModel>Precise</FloatingPointModel>
<AdditionalOptions>/wd4201 /wd4324 /Wall /wd4514 /wd4820 /wd4127 /wd4710 /wd4711 /wd4061 /wd4668 /wd4626 /wd4266 /wd4263 /wd4264 /wd4640 /wd4625 /wd4574 /wd4191 /wd4987 /wd4986 /wd4946 /wd4836 /wd4571 /wd4826 /wd4577 /wd4458 /wd4456 /wd4457 /wd4548 /wd5026 /wd5027 /wd4464 /wd5038 /wd5039 /wd4596 /wd4365 /wd4774 /wd4996 /wd5045 /GR- /GF /WX /fp:fast /arch:SSE2 /MP /Ox /d2Zi+</AdditionalOptions>
<Optimization>Disabled</Optimization>
<AdditionalIncludeDirectories>../../../PxShared/include;../../../PxShared/include/filebuf;../../../PxShared/include/foundation;../../../PxShared/include/task;../../../PxShared/include/cudamanager;../../../PxShared/include/pvd;../../../PxShared/src/foundation/include;../../../PxShared/src/filebuf/include;../../../PxShared/src/fastxml/include;../../../PxShared/src/pvd/include;./../../shared/general/shared;./../../public;../../../PhysX_3.4/Include;../../../PhysX_3.4/Include/common;../../../PhysX_3.4/Include/cooking;../../../PhysX_3.4/Include/extensions;../../../PhysX_3.4/Include/geometry;../../../PhysX_3.4/Include/gpu;../../../PhysX_3.4/Include/deformable;../../../PhysX_3.4/Include/particles;../../../PhysX_3.4/Include/characterkinematic;../../../PhysX_3.4/Include/characterdynamic;../../../PhysX_3.4/Include/vehicle;../../../PhysX_3.4/Source/GeomUtils/headers;../../../PhysX_3.4/Source/PhysXGpu/include;./../../shared/general/RenderDebug/public;./../../shared/general/shared/inparser/include;./../../common/include;./../../common/include/autogen;./../../common/include/windows;./../../shared/internal/include;./../../module/common/include;./../../NvParameterized/include;./../../include;./../../include/PhysX3;./../../../Externals/nvToolsExt/1/include;./../../framework/include;./../../framework/include/autogen;./../../include;./../../include/PhysX3;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
<PreprocessorDefinitions>WIN32;_CRT_SECURE_NO_DEPRECATE;_CRT_NONSTDC_NO_DEPRECATE;DISABLE_CUDA_PHYSX;INSTALLER=1;EXCLUDE_PARTICLES=1;ENABLE_TEST=0;NDEBUG;PX_CHECKED;PHYSX_PROFILE_SDK;PX_SUPPORT_VISUAL_DEBUGGER;PX_ENABLE_CHECKED_ASSERTS;PX_NVTX=1;_SECURE_SCL=0;_ITERATOR_DEBUG_LEVEL=0;PX_PHYSX_DLL_NAME_POSTFIX=CHECKED;%(PreprocessorDefinitions)</PreprocessorDefinitions>
<ExceptionHandling>false</ExceptionHandling>
<WarningLevel>Level4</WarningLevel>
<RuntimeLibrary>MultiThreaded</RuntimeLibrary>
<PrecompiledHeader>NotUsing</PrecompiledHeader>
<PrecompiledHeaderFile></PrecompiledHeaderFile>
<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
</ClCompile>
<Lib>
<AdditionalOptions>/INCREMENTAL:NO</AdditionalOptions>
<AdditionalDependencies>%(AdditionalDependencies)</AdditionalDependencies>
<OutputFile>$(OutDir)$(ProjectName)CHECKED.lib</OutputFile>
<AdditionalLibraryDirectories>../../../PxShared/lib/vc15win32;../../../PhysX_3.4/Lib/vc15win32;%(AdditionalLibraryDirectories)</AdditionalLibraryDirectories>
<ProgramDatabaseFile>$(OutDir)/$(ProjectName)CHECKED.lib.pdb</ProgramDatabaseFile>
<TargetMachine>MachineX86</TargetMachine>
</Lib>
<ResourceCompile>
</ResourceCompile>
<ProjectReference>
<LinkLibraryDependencies>true</LinkLibraryDependencies>
</ProjectReference>
</ItemDefinitionGroup>
<ItemGroup>
<ClCompile Include="..\..\common\src\autogen\ConvexHullParameters.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\autogen\DebugColorParams.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\autogen\DebugRenderParams.cpp">
</ClCompile>
</ItemGroup>
<ItemGroup>
<ClCompile Include="..\..\common\src\ApexActor.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexAssetAuthoring.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexAssetTracker.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexCollision.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexContext.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexCudaProfile.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexCudaTest.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexGeneralizedCubeTemplates.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexGeneralizedMarchingCubes.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexIsoMesh.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexMeshContractor.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexMeshHash.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexPreview.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexPvdClient.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexQuadricSimplifier.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexResource.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexRWLockable.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexSDKCachedDataImpl.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexSDKHelpers.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexShape.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexSharedUtils.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexSubdivider.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ApexTetrahedralizer.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\CurveImpl.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ModuleBase.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ModuleUpdateLoader.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\PVDParameterizedHandler.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\ReadCheck.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\Spline.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\variable_oscillator.cpp">
</ClCompile>
<ClCompile Include="..\..\common\src\WriteCheck.cpp">
</ClCompile>
</ItemGroup>
<ItemGroup>
<ClInclude Include="..\..\common\include\autogen\ConvexHullParameters.h">
</ClInclude>
<ClInclude Include="..\..\common\include\autogen\DebugColorParams.h">
</ClInclude>
<ClInclude Include="..\..\common\include\autogen\DebugRenderParams.h">
</ClInclude>
<ClInclude Include="..\..\common\include\autogen\ModuleCommonRegistration.h">
</ClInclude>
</ItemGroup>
<ItemGroup>
<ClInclude Include="..\..\common\include\ApexActor.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexAssetAuthoring.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexAssetTracker.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexAuthorableObject.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexBinaryHeap.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexCollision.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexConstrainedDistributor.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexContext.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexCuda.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexCudaDefs.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexCudaProfile.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexCudaSource.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexCudaTest.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexCudaWrapper.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexCutil.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexFIFO.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexFind.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexGeneralizedCubeTemplates.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexGeneralizedMarchingCubes.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexGroupsFiltering.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexIsoMesh.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexLegacyModule.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexMarchingCubes.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexMath.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexMerge.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexMeshContractor.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexMeshHash.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexMirrored.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexMirroredArray.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexPermute.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexPreview.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexPvdClient.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexQuadricSimplifier.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexQuickSelectSmallestK.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexRand.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexRenderable.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexResource.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexResourceHelper.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexRWLockable.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexSDKCachedDataImpl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexSDKHelpers.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexSDKIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexShape.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexSharedUtils.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexSubdivider.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexTest.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ApexTetrahedralizer.h">
</ClInclude>
<ClInclude Include="..\..\common\include\AuthorableObjectIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\Cof44.h">
</ClInclude>
<ClInclude Include="..\..\common\include\CurveImpl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\DebugColorParamsEx.h">
</ClInclude>
<ClInclude Include="..\..\common\include\DeclareArray.h">
</ClInclude>
<ClInclude Include="..\..\common\include\FieldBoundaryIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\FieldSamplerIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\FieldSamplerManagerIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\FieldSamplerQueryIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\FieldSamplerSceneIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\InplaceStorage.h">
</ClInclude>
<ClInclude Include="..\..\common\include\InplaceTypes.h">
</ClInclude>
<ClInclude Include="..\..\common\include\InplaceTypesBuilder.h">
</ClInclude>
<ClInclude Include="..\..\common\include\InstancedObjectSimulationIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\IofxManagerIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ModuleBase.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ModuleFieldSamplerIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ModuleIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ModuleIofxIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ModuleUpdateLoader.h">
</ClInclude>
<ClInclude Include="..\..\common\include\P4Info.h">
</ClInclude>
<ClInclude Include="..\..\common\include\PhysXObjectDescIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ProfilerCallback.h">
</ClInclude>
<ClInclude Include="..\..\common\include\PVDParameterizedHandler.h">
</ClInclude>
<ClInclude Include="..\..\common\include\RandState.h">
</ClInclude>
<ClInclude Include="..\..\common\include\RandStateHelpers.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ReadCheck.h">
</ClInclude>
<ClInclude Include="..\..\common\include\RenderAPIIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\RenderMeshAssetIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\ResourceProviderIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\SceneIntl.h">
</ClInclude>
<ClInclude Include="..\..\common\include\SimplexNoise.h">
</ClInclude>
<ClInclude Include="..\..\common\include\Spline.h">
</ClInclude>
<ClInclude Include="..\..\common\include\TableLookup.h">
</ClInclude>
<ClInclude Include="..\..\common\include\variable_oscillator.h">
</ClInclude>
<ClInclude Include="..\..\common\include\WriteCheck.h">
</ClInclude>
</ItemGroup>
<ItemGroup>
</ItemGroup>
<ItemGroup>
<None Include="..\..\common\parameters\ConvexHullParamSchema.pl">
</None>
<None Include="..\..\common\parameters\DebugColorParamSchema.pl">
</None>
<None Include="..\..\common\parameters\DebugRenderParamSchema.pl">
</None>
</ItemGroup>
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
<ImportGroup Label="ExtensionTargets"></ImportGroup>
</Project>
```
|
```elixir
defmodule Benchmark.MixProject do
use Mix.Project
def project do
[
app: :benchmark,
version: "0.1.0",
elixir: "~> 1.6",
start_permanent: Mix.env() == :prod,
deps: deps()
]
end
# Run "mix help compile.app" to learn about applications.
def application do
[
extra_applications: [:logger]
]
end
# Run "mix help deps" to learn about dependencies.
defp deps do
[
{:grpc, path: ".."},
{:protobuf, "~> 0.11"}
]
end
end
```
|
```c++
/*
* Tencent is pleased to support the open source community by making
* WCDB available.
*
* All rights reserved.
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
#ifndef rwlock_hpp
#define rwlock_hpp
#include <condition_variable>
#include <mutex>
//std::shared_lock is supported from C++14
namespace WCDB {
class RWLock {
public:
RWLock();
~RWLock();
void lockRead();
void unlockRead();
bool tryLockRead();
void lockWrite();
void unlockWrite();
bool tryLockWrite();
bool isWriting() const;
bool isReading() const;
protected:
mutable std::mutex m_mutex;
std::condition_variable m_cond;
int m_reader;
int m_writer;
int m_pending;
};
} //namespace WCDB
#endif /* rwlock_hpp */
```
|
The Gabardan Solar Park is a 67.5 megawatt (MW) photovoltaic power station in France. It has about 872,300 thin-film PV panels made by First Solar, and incorporates a 2 MW pilot plant using 11,100 solar trackers.
See also
Photovoltaic power stations
List of largest power stations in the world
List of photovoltaic power stations
References
Photovoltaic power stations in France
|
```xml
import { ComponentFixture, TestBed, waitForAsync } from '@angular/core/testing';
import { PagesModule } from '~/app/core/pages/pages.module';
import { ShutdownPageComponent } from '~/app/core/pages/shutdown-page/shutdown-page.component';
import { TestingModule } from '~/app/testing.module';
describe('ShutdownPageComponent', () => {
let component: ShutdownPageComponent;
let fixture: ComponentFixture<ShutdownPageComponent>;
beforeEach(waitForAsync(() => {
TestBed.configureTestingModule({
imports: [PagesModule, TestingModule]
}).compileComponents();
}));
beforeEach(() => {
fixture = TestBed.createComponent(ShutdownPageComponent);
component = fixture.componentInstance;
fixture.detectChanges();
});
it('should create', () => {
expect(component).toBeTruthy();
});
});
```
|
```xml
/*
* LiskHQ/lisk-commander
*
* See the LICENSE file at the top-level directory of this distribution
* for licensing information.
*
* Unless otherwise agreed in a custom licensing agreement with the Lisk Foundation,
* no part of this software, including this file, may be copied, modified,
* propagated, or distributed except according to the terms contained in the
* LICENSE file.
*
* Removal or modification of this copyright notice is prohibited.
*
*/
import * as fs from 'fs';
import * as readline from 'readline';
import * as inquirer from 'inquirer';
import { createFakeInterface } from '../helpers/utils';
import {
readStdIn,
getPassphraseFromPrompt,
isFileSource,
readFileSource,
checkFileExtension,
readParamsFile,
} from '../../src/utils/reader';
describe('reader', () => {
describe('readPassphraseFromPrompt', () => {
const displayName = 'password';
const defaultInputs =
'tiny decrease photo key change abuse forward penalty twin foot wish expose';
let promptStub: jest.SpyInstance;
beforeEach(() => {
promptStub = jest.spyOn(inquirer, 'prompt');
});
it('passphrase should equal to the result of the prompt', async () => {
const promptResult = { passphrase: defaultInputs };
promptStub.mockResolvedValue(promptResult);
const passphrase = await getPassphraseFromPrompt(displayName);
expect(passphrase).toEqual(promptResult.passphrase);
});
it('should prompt once with shouldRepeat false', async () => {
const promptResult = { passphrase: defaultInputs };
promptStub.mockResolvedValue(promptResult);
await getPassphraseFromPrompt(displayName);
return expect(inquirer.prompt).toHaveBeenCalledWith([
{
name: 'passphrase',
type: 'password',
message: `Please enter ${displayName}: `,
},
]);
});
it('should prompt twice with shouldRepeat true', async () => {
const promptResult = { passphrase: defaultInputs, passphraseRepeat: defaultInputs };
promptStub.mockResolvedValue(promptResult);
await getPassphraseFromPrompt(displayName, true);
expect(inquirer.prompt).toHaveBeenCalledWith([
{
name: 'passphrase',
type: 'password',
message: `Please enter ${displayName}: `,
},
{
name: 'passphraseRepeat',
type: 'password',
message: `Please re-enter ${displayName}: `,
},
]);
});
it('should reject with error when repeated passphrase does not match', async () => {
const promptResult = { passphrase: defaultInputs, passphraseRepeat: '456' };
promptStub.mockResolvedValue(promptResult);
await expect(getPassphraseFromPrompt(displayName, true)).rejects.toThrow(
'Password was not successfully repeated.',
);
});
});
describe('isFileSource', () => {
it('should return false when input is undefined', () => {
expect(isFileSource()).toBe(false);
});
it('should return false when there is no source identifier', () => {
expect(isFileSource('random string')).toBe(false);
});
it('should return true when it has correct source identifier', () => {
expect(isFileSource('file:path/to/file')).toBe(true);
});
});
describe('readFileSource', () => {
const path = './some/path.txt';
const source = `file:${path}`;
const resultFileData = 'file data';
beforeEach(() => {
jest.spyOn(fs, 'readFileSync').mockReturnValue(resultFileData);
});
it('should read from file', async () => {
await readFileSource(source);
return expect(fs.readFileSync).toHaveBeenCalledWith(path, 'utf8');
});
it('should return the result from readFileSync', async () => {
const data = await readFileSource(source);
return expect(data).toEqual(resultFileData);
});
it('should throw error when source is empty', async () => {
await expect(readFileSource()).rejects.toThrow('No data was provided.');
});
it('should throw error when source is not file', async () => {
await expect(readFileSource('random string')).rejects.toThrow('Unknown data source type.');
});
it('should throw error when readFile throws ENOENT error', async () => {
jest.spyOn(fs, 'readFileSync').mockImplementation(() => {
throw new Error('ENOENT');
});
await expect(readFileSource(source)).rejects.toThrow(`File at ${path} does not exist.`);
});
it('should throw error when readFile throws EACCES error', async () => {
jest.spyOn(fs, 'readFileSync').mockImplementation(() => {
throw new Error('EACCES');
});
await expect(readFileSource(source)).rejects.toThrow(`File at ${path} could not be read.`);
});
});
describe('readStdIn', () => {
describe('when string without line break is given', () => {
it('should resolve to a single element string array', async () => {
const stdInContents = 'some contents';
jest
.spyOn(readline, 'createInterface')
.mockReturnValue(createFakeInterface(stdInContents) as any);
const result = await readStdIn();
return expect(result).toEqual([stdInContents]);
});
});
describe('when string with line break is given', () => {
it('should resolve to a single element string array', async () => {
const multilineStdContents = 'passphrase\npassword\ndata';
jest
.spyOn(readline, 'createInterface')
.mockReturnValue(createFakeInterface(multilineStdContents) as any);
const result = await readStdIn();
return expect(result).toEqual(['passphrase', 'password', 'data']);
});
});
describe('checkFileExtension', () => {
it('should throw an error if no file extension is passed', () => {
const filePath = './some/path';
expect(() => checkFileExtension(filePath)).toThrow('Not a JSON file.');
});
it('should throw an error if file extension is not .json', () => {
const filePath = './some/path.txt';
expect(() => checkFileExtension(filePath)).toThrow('Not a JSON file.');
});
});
describe('readParamsFile', () => {
const filePath = './some/path.json';
const fileData = {
tokenID: '0000000000000000',
amount: 100000000,
recipientAddress: 'ab0041a7d3f7b2c290b5b834d46bdc7b7eb85815',
data: 'send token',
};
beforeEach(() => {
jest.spyOn(fs, 'readFileSync').mockReturnValue(JSON.stringify(fileData));
});
it('should read a json file and check that an amount value and a recipient address are contained in the file', () => {
const result = readParamsFile(filePath);
expect(JSON.parse(result)).toEqual(fileData);
expect(JSON.parse(result).amount).toBe(100000000);
expect(JSON.parse(result).recipientAddress).toBe(
'ab0041a7d3f7b2c290b5b834d46bdc7b7eb85815',
);
});
it('should throw an error if the file is not found', () => {
jest.spyOn(fs, 'readFileSync').mockImplementation(() => {
throw new Error('ENOENT');
});
expect(() => readParamsFile(filePath)).toThrow(`No such file or directory.`);
});
});
});
});
```
|
Aleksei Sergeyevich Kandalintsev (; born 6 February 1976) is a Russian professional football official and a former player. He is the general director for FC SKA-Khabarovsk.
Club career
He played 8 seasons in the Russian Football National League for FC SKA Khabarovsk and FC Tom Tomsk.
References
External links
1976 births
Footballers from Khabarovsk
Living people
Russian men's footballers
Men's association football midfielders
FC Tom Tomsk players
FC SKA-Khabarovsk players
FC Smena Komsomolsk-na-Amure players
|
```java
/*
*
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
package io.jenkins.blueocean.blueocean_git_pipeline;
import org.eclipse.jgit.lib.ProgressMonitor;
import java.util.Map;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.atomic.AtomicInteger;
/**
* Simple progress monitor to track progress during any clone operations
* @author kzantow
*/
class CloneProgressMonitor implements ProgressMonitor {
private final String repositoryUrl;
private final AtomicInteger cloneCount = new AtomicInteger(0);
private final AtomicInteger latestProgress = new AtomicInteger(0);
private boolean cancel = false;
public CloneProgressMonitor(String repositoryUrl) {
this.repositoryUrl = repositoryUrl;
}
@Override
public void beginTask(String task, int i) {
CloneProgressMonitor existing = currentStatus.computeIfAbsent( repositoryUrl, k -> this );
existing.cloneCount.incrementAndGet();
existing.latestProgress.set(i);
}
@Override
public void start(int i) {
latestProgress.set(i);
}
@Override
public void update(int i) {
latestProgress.set(i);
}
@Override
public void endTask() {
latestProgress.set(100);
if (0 == cloneCount.decrementAndGet()) {
currentStatus.remove(repositoryUrl);
}
}
@Override
public boolean isCancelled() {
return cancel;
}
@Override
public void showDuration(boolean enabled) {
}
/**
* Call this for the percentage complete
* @return a number 0-100
*/
public int getPercentComplete() {
return latestProgress.get();
}
/**
* Call this to cancel the clone
*/
public void cancel() {
this.cancel = true;
}
private static final Map<String, CloneProgressMonitor> currentStatus = new ConcurrentHashMap<>();
/**
* Get the latest progress for a clone operation on the given repository
* @param repositoryUrl url to find information for
* @return the progress monitor
*/
public static CloneProgressMonitor get(String repositoryUrl) {
return currentStatus.get(repositoryUrl);
}
}
```
|
```c++
#include "legacynotebookutils.h"
#include <QJsonDocument>
#include <QJsonArray>
#include <utils/pathutils.h>
#include <utils/fileutils.h>
#include <utils/utils.h>
using namespace vnotex;
const QString LegacyNotebookUtils::c_legacyFolderConfigFile = "_vnote.json";
static QDateTime stringToDateTime(const QString &p_str)
{
if (p_str.isEmpty()) {
return QDateTime::currentDateTimeUtc();
}
return Utils::dateTimeFromStringUniform(p_str);
}
bool LegacyNotebookUtils::isLegacyNotebookRootFolder(const QString &p_folderPath)
{
return QFileInfo::exists(getFolderConfigFile(p_folderPath));
}
QDateTime LegacyNotebookUtils::getCreatedTimeUtcOfFolder(const QString &p_folderPath)
{
auto ti = getFolderConfig(p_folderPath).value(QStringLiteral("created_time")).toString();
return stringToDateTime(ti);
}
QString LegacyNotebookUtils::getAttachmentFolderOfNotebook(const QString &p_folderPath)
{
return getFolderConfig(p_folderPath).value(QStringLiteral("attachment_folder")).toString();
}
QString LegacyNotebookUtils::getImageFolderOfNotebook(const QString &p_folderPath)
{
return getFolderConfig(p_folderPath).value(QStringLiteral("image_folder")).toString();
}
QString LegacyNotebookUtils::getRecycleBinFolderOfNotebook(const QString &p_folderPath)
{
return getFolderConfig(p_folderPath).value(QStringLiteral("recycle_bin_folder")).toString();
}
QString LegacyNotebookUtils::getFolderConfigFile(const QString &p_folderPath)
{
return PathUtils::concatenateFilePath(p_folderPath, c_legacyFolderConfigFile);
}
QJsonObject LegacyNotebookUtils::getFolderConfig(const QString &p_folderPath)
{
auto configFile = getFolderConfigFile(p_folderPath);
return QJsonDocument::fromJson(FileUtils::readFile(configFile)).object();
}
void LegacyNotebookUtils::removeFolderConfigFile(const QString &p_folderPath)
{
auto configFile = getFolderConfigFile(p_folderPath);
FileUtils::removeFile(configFile);
}
void LegacyNotebookUtils::forEachFolder(const QJsonObject &p_config, std::function<void(const QString &p_name)> p_func)
{
auto folderArray = p_config.value(QStringLiteral("sub_directories")).toArray();
for (int i = 0; i < folderArray.size(); ++i) {
const auto name = folderArray[i].toObject().value(QStringLiteral("name")).toString();
p_func(name);
}
}
void LegacyNotebookUtils::forEachFile(const QJsonObject &p_config, std::function<void(const LegacyNotebookUtils::FileInfo &p_info)> p_func)
{
auto fileArray = p_config.value(QStringLiteral("files")).toArray();
for (int i = 0; i < fileArray.size(); ++i) {
const auto obj = fileArray[i].toObject();
FileInfo info;
info.m_name = obj.value(QStringLiteral("name")).toString();
{
auto ti = obj.value(QStringLiteral("created_time")).toString();
info.m_createdTimeUtc = stringToDateTime(ti);
}
{
auto ti = obj.value(QStringLiteral("created_time")).toString();
info.m_modifiedTimeUtc = stringToDateTime(ti);
}
info.m_attachmentFolder = obj.value(QStringLiteral("attachment_folder")).toString();
{
auto arr = obj.value(QStringLiteral("tags")).toArray();
for (int i = 0; i < arr.size(); ++i) {
info.m_tags << arr[i].toString();
}
}
p_func(info);
}
}
```
|
Power Couple, also known as Power Couple Brasil, is a Brazilian reality competition based on the Israeli television series . The series premiered on Tuesday, April 12, 2016 at 10:30 p.m. on RecordTV.
The show features celebrity couples living under one roof and facing extreme challenges that will test how well they really know each other. Each week, a couple will be eliminated until the last couple wins the grand prize.
The first two seasons were hosted by Roberto Justus. From seasons three to four, Gugu Liberato replaced Justus as the host and production moved from São Paulo to Itapecerica da Serra. From season five onwards, Adriane Galisteu replaced Gugu (dead since late–2019), thus becoming the show's first female host.
The fifth season was originally expected to air in 2020, but production was postponed to 2021 due to safety concerns resulting from the COVID-19 pandemic.
Season chronology
Records
Highest number of rejections
Spin-offs
Power Couple Live
An online spin-off show titled Power Couple Live was originally presented by Gianne Albertoni. The show is broadcast live on Facebook after every episode and is also available on-demand via R7 Play. It features interviews with the newly eliminated couples, as well special guests and exclusive content across social media sites like YouTube. For season 2, Albertoni was replaced by Junno Andrade who presented until the third season, with Dani Bavoso reading questions from netizens.
In fourth season, the couple Flávia Viana and Marcelo Zangrandi assume the presentation, also counting on the youtubers Tati Martins and Marcelo Carlos, from the WebTVBrasileira channel, as commentators. The fifth season passed to the command of Lidi Lisboa and the return of Dani Bavoso.
Podcast Power Couple
Since 2021, Dani Bavoso also started to present a podcast, available on YouTube and streaming platforms, interviewing couples who have been through the program in previous seasons.
Ratings
References
External links
on R7.com
2016 Brazilian television series debuts
2022 Brazilian television series endings
Brazilian reality television series
Portuguese-language television shows
RecordTV original programming
|
```smalltalk
/*
*/
using System;
using System.Drawing;
using System.Windows.Forms;
using Klocman.Binding.Settings;
using Klocman.IO;
namespace BulkCrapUninstaller.Controls
{
public partial class UninstallationSettings : UserControl
{
public UninstallationSettings()
{
InitializeComponent();
}
protected override void OnLoad(EventArgs e)
{
base.OnLoad(e);
if (DesignMode) return;
var sb = Properties.Settings.Default.SettingBinder;
// Shutdown blocking not available below Windows Vista
if (Environment.OSVersion.Version < new Version(6, 0))
checkBoxShutdown.Enabled = false;
else
sb.BindControl(checkBoxShutdown, settings => settings.UninstallPreventShutdown, this);
checkBoxRestorePoint.Enabled = SysRestore.SysRestoreAvailable();
sb.BindControl(checkBoxRestorePoint, settings => settings.CreateRestorePoint, this);
sb.BindControl(checkBoxConcurrent, settings => settings.UninstallConcurrency, this);
sb.BindControl(checkBoxConcurrentOneLoud, settings => settings.UninstallConcurrentOneLoud, this);
sb.BindControl(checkBoxManualNoCollisionProtection, settings => settings.UninstallConcurrentDisableManualCollisionProtection, this);
sb.Subscribe(OnMaxCountChanged, settings => settings.UninstallConcurrentMaxCount, this);
numericUpDownMaxConcurrent.ValueChanged += NumericUpDownMaxConcurrentOnValueChanged;
sb.BindControl(checkBoxBatchSortQuiet, x => x.AdvancedIntelligentUninstallerSorting, this);
sb.BindControl(checkBoxDiisableProtection, x => x.AdvancedDisableProtection, this);
sb.BindControl(checkBoxSimulate, x => x.AdvancedSimulate, this);
sb.BindControl(checkBoxAutoKillQuiet, x => x.QuietAutoKillStuck, this);
sb.BindControl(checkBoxRetryQuiet, x => x.QuietRetryFailedOnce, this);
sb.BindControl(checkBoxGenerate, x => x.QuietAutomatization, this);
sb.BindControl(checkBoxGenerateStuck, x => x.QuietAutomatizationKillStuck, this);
sb.BindControl(checkBoxAutoDaemon, x => x.QuietUseDaemon, this);
sb.Subscribe((sender, args) => checkBoxGenerateStuck.Enabled = args.NewValue, settings => settings.QuietAutomatization, this);
sb.Subscribe(
(x, y) => checkBoxSimulate.ForeColor = y.NewValue ? Color.OrangeRed : SystemColors.ControlText,
x => x.AdvancedSimulate, this);
sb.SendUpdates(this);
Disposed += (x, y) => sb.RemoveHandlers(this);
}
private void NumericUpDownMaxConcurrentOnValueChanged(object sender, EventArgs eventArgs)
{
Properties.Settings.Default.UninstallConcurrentMaxCount = (int)numericUpDownMaxConcurrent.Value;
}
private void OnMaxCountChanged(object sender, SettingChangedEventArgs<int> args)
{
numericUpDownMaxConcurrent.Value = args.NewValue;
}
}
}
```
|
```c++
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "config.h"
#include "modules/cachestorage/GlobalCacheStorage.h"
#include "core/dom/ExecutionContext.h"
#include "core/frame/LocalDOMWindow.h"
#include "core/frame/UseCounter.h"
#include "core/workers/WorkerGlobalScope.h"
#include "modules/cachestorage/CacheStorage.h"
#include "platform/Supplementable.h"
#include "platform/heap/Handle.h"
#include "platform/weborigin/DatabaseIdentifier.h"
#include "public/platform/Platform.h"
namespace blink {
namespace {
template <typename T>
class GlobalCacheStorageImpl final : public NoBaseWillBeGarbageCollectedFinalized<GlobalCacheStorageImpl<T>>, public WillBeHeapSupplement<T> {
WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(GlobalCacheStorageImpl);
public:
static GlobalCacheStorageImpl& from(T& supplementable, ExecutionContext* executionContext)
{
GlobalCacheStorageImpl* supplement = static_cast<GlobalCacheStorageImpl*>(WillBeHeapSupplement<T>::from(supplementable, name()));
if (!supplement) {
supplement = new GlobalCacheStorageImpl();
WillBeHeapSupplement<T>::provideTo(supplementable, name(), adoptPtrWillBeNoop(supplement));
}
return *supplement;
}
~GlobalCacheStorageImpl()
{
if (m_caches)
m_caches->dispose();
}
CacheStorage* caches(T& fetchingScope, ExceptionState& exceptionState)
{
ExecutionContext* context = fetchingScope.executionContext();
if (!context->securityOrigin()->canAccessCacheStorage()) {
if (context->securityContext().isSandboxed(SandboxOrigin))
exceptionState.throwSecurityError("Cache storage is disabled because the context is sandboxed and lacks the 'allow-same-origin' flag.");
else if (context->url().protocolIs("data"))
exceptionState.throwSecurityError("Cache storage is disabled inside 'data:' URLs.");
else
exceptionState.throwSecurityError("Access to cache storage is denied.");
return nullptr;
}
if (!m_caches) {
String identifier = createDatabaseIdentifierFromSecurityOrigin(context->securityOrigin());
ASSERT(!identifier.isEmpty());
m_caches = CacheStorage::create(GlobalFetch::ScopedFetcher::from(fetchingScope), Platform::current()->cacheStorage(identifier));
}
return m_caches;
}
// Promptly dispose of associated CacheStorage.
EAGERLY_FINALIZE();
DEFINE_INLINE_VIRTUAL_TRACE()
{
visitor->trace(m_caches);
WillBeHeapSupplement<T>::trace(visitor);
}
private:
GlobalCacheStorageImpl()
{
}
static const char* name() { return "CacheStorage"; }
PersistentWillBeMember<CacheStorage> m_caches;
};
} // namespace
CacheStorage* GlobalCacheStorage::caches(DOMWindow& window, ExceptionState& exceptionState)
{
return GlobalCacheStorageImpl<LocalDOMWindow>::from(toLocalDOMWindow(window), window.executionContext()).caches(toLocalDOMWindow(window), exceptionState);
}
CacheStorage* GlobalCacheStorage::caches(WorkerGlobalScope& worker, ExceptionState& exceptionState)
{
return GlobalCacheStorageImpl<WorkerGlobalScope>::from(worker, worker.executionContext()).caches(worker, exceptionState);
}
} // namespace blink
```
|
Special Jury Prize may refer to:
Special Jury Prize (Karlovy Vary IFF)
Special Jury Prize (Locarno International Film Festival)
Special Jury Prize (Sarajevo Film Festival)
Special Jury Prize (Venice Film Festival)
Jury Prize (Cannes Film Festival), previously the Special Jury Prize
|
Selwyn James Baker (9 April 1911 – 16 September 1996) was an Australian rules footballer who played with North Melbourne and Collingwood in the Victorian Football League (VFL).
Baker played his early football at Scotch College and for Kew. He spent the 1930 season with the Richmond seconds and was a joint winner of that year's Gardiner Medal.
Having not made any senior appearance while at Richmond, Baker made his league debut in 1931, with North Melbourne. A rover, he was their third leading goal-kicker in 1932 with 27 goals and was a VFL interstate representative in 1933.
He changed clubs during the 1934 VFL season, joining Collingwood, the club his elder brothers Ted and Reg had previously played for. His stint at Collingwood was short and his appearance in round 17 was the only senior game he would play for them.
Baker, who was also a professional runner, spent some time with the Brighton Football Club later in the decade.
References
1911 births
Australian rules footballers from Victoria (state)
North Melbourne Football Club players
Collingwood Football Club players
Brighton Football Club players
Kew Football Club players
People educated at Scotch College, Melbourne
1996 deaths
|
```hcl
locals {
cluster_name = "minimal-warmpool.example.com"
master_autoscaling_group_ids = [aws_autoscaling_group.master-us-test-1a-masters-minimal-warmpool-example-com.id]
master_security_group_ids = [aws_security_group.masters-minimal-warmpool-example-com.id]
masters_role_arn = aws_iam_role.masters-minimal-warmpool-example-com.arn
masters_role_name = aws_iam_role.masters-minimal-warmpool-example-com.name
node_autoscaling_group_ids = [aws_autoscaling_group.nodes-minimal-warmpool-example-com.id]
node_security_group_ids = [aws_security_group.nodes-minimal-warmpool-example-com.id]
node_subnet_ids = [aws_subnet.us-test-1a-minimal-warmpool-example-com.id]
nodes_role_arn = aws_iam_role.nodes-minimal-warmpool-example-com.arn
nodes_role_name = aws_iam_role.nodes-minimal-warmpool-example-com.name
region = "us-test-1"
route_table_public_id = aws_route_table.minimal-warmpool-example-com.id
subnet_us-test-1a_id = aws_subnet.us-test-1a-minimal-warmpool-example-com.id
vpc_cidr_block = aws_vpc.minimal-warmpool-example-com.cidr_block
vpc_id = aws_vpc.minimal-warmpool-example-com.id
vpc_ipv6_cidr_block = aws_vpc.minimal-warmpool-example-com.ipv6_cidr_block
vpc_ipv6_cidr_length = local.vpc_ipv6_cidr_block == "" ? null : tonumber(regex(".*/(\\d+)", local.vpc_ipv6_cidr_block)[0])
}
output "cluster_name" {
value = "minimal-warmpool.example.com"
}
output "master_autoscaling_group_ids" {
value = [aws_autoscaling_group.master-us-test-1a-masters-minimal-warmpool-example-com.id]
}
output "master_security_group_ids" {
value = [aws_security_group.masters-minimal-warmpool-example-com.id]
}
output "masters_role_arn" {
value = aws_iam_role.masters-minimal-warmpool-example-com.arn
}
output "masters_role_name" {
value = aws_iam_role.masters-minimal-warmpool-example-com.name
}
output "node_autoscaling_group_ids" {
value = [aws_autoscaling_group.nodes-minimal-warmpool-example-com.id]
}
output "node_security_group_ids" {
value = [aws_security_group.nodes-minimal-warmpool-example-com.id]
}
output "node_subnet_ids" {
value = [aws_subnet.us-test-1a-minimal-warmpool-example-com.id]
}
output "nodes_role_arn" {
value = aws_iam_role.nodes-minimal-warmpool-example-com.arn
}
output "nodes_role_name" {
value = aws_iam_role.nodes-minimal-warmpool-example-com.name
}
output "region" {
value = "us-test-1"
}
output "route_table_public_id" {
value = aws_route_table.minimal-warmpool-example-com.id
}
output "subnet_us-test-1a_id" {
value = aws_subnet.us-test-1a-minimal-warmpool-example-com.id
}
output "vpc_cidr_block" {
value = aws_vpc.minimal-warmpool-example-com.cidr_block
}
output "vpc_id" {
value = aws_vpc.minimal-warmpool-example-com.id
}
output "vpc_ipv6_cidr_block" {
value = aws_vpc.minimal-warmpool-example-com.ipv6_cidr_block
}
output "vpc_ipv6_cidr_length" {
value = local.vpc_ipv6_cidr_block == "" ? null : tonumber(regex(".*/(\\d+)", local.vpc_ipv6_cidr_block)[0])
}
provider "aws" {
region = "us-test-1"
}
provider "aws" {
alias = "files"
region = "us-test-1"
}
resource "aws_autoscaling_group" "master-us-test-1a-masters-minimal-warmpool-example-com" {
enabled_metrics = ["GroupDesiredCapacity", "GroupInServiceInstances", "GroupMaxSize", "GroupMinSize", "GroupPendingInstances", "GroupStandbyInstances", "GroupTerminatingInstances", "GroupTotalInstances"]
launch_template {
id = aws_launch_template.master-us-test-1a-masters-minimal-warmpool-example-com.id
version = aws_launch_template.master-us-test-1a-masters-minimal-warmpool-example-com.latest_version
}
max_instance_lifetime = 0
max_size = 1
metrics_granularity = "1Minute"
min_size = 1
name = "master-us-test-1a.masters.minimal-warmpool.example.com"
protect_from_scale_in = false
tag {
key = "KubernetesCluster"
propagate_at_launch = true
value = "minimal-warmpool.example.com"
}
tag {
key = "Name"
propagate_at_launch = true
value = "master-us-test-1a.masters.minimal-warmpool.example.com"
}
tag {
key = "aws-node-termination-handler/managed"
propagate_at_launch = true
value = ""
}
tag {
key = "k8s.io/cluster-autoscaler/node-template/label/kops.k8s.io/kops-controller-pki"
propagate_at_launch = true
value = ""
}
tag {
key = "k8s.io/cluster-autoscaler/node-template/label/node-role.kubernetes.io/control-plane"
propagate_at_launch = true
value = ""
}
tag {
key = "k8s.io/cluster-autoscaler/node-template/label/node.kubernetes.io/exclude-from-external-load-balancers"
propagate_at_launch = true
value = ""
}
tag {
key = "k8s.io/role/control-plane"
propagate_at_launch = true
value = "1"
}
tag {
key = "k8s.io/role/master"
propagate_at_launch = true
value = "1"
}
tag {
key = "kops.k8s.io/instancegroup"
propagate_at_launch = true
value = "master-us-test-1a"
}
tag {
key = "kubernetes.io/cluster/minimal-warmpool.example.com"
propagate_at_launch = true
value = "owned"
}
vpc_zone_identifier = [aws_subnet.us-test-1a-minimal-warmpool-example-com.id]
}
resource "aws_autoscaling_group" "nodes-minimal-warmpool-example-com" {
enabled_metrics = ["GroupDesiredCapacity", "GroupInServiceInstances", "GroupMaxSize", "GroupMinSize", "GroupPendingInstances", "GroupStandbyInstances", "GroupTerminatingInstances", "GroupTotalInstances"]
launch_template {
id = aws_launch_template.nodes-minimal-warmpool-example-com.id
version = aws_launch_template.nodes-minimal-warmpool-example-com.latest_version
}
max_instance_lifetime = 0
max_size = 2
metrics_granularity = "1Minute"
min_size = 2
name = "nodes.minimal-warmpool.example.com"
protect_from_scale_in = false
tag {
key = "KubernetesCluster"
propagate_at_launch = true
value = "minimal-warmpool.example.com"
}
tag {
key = "Name"
propagate_at_launch = true
value = "nodes.minimal-warmpool.example.com"
}
tag {
key = "aws-node-termination-handler/managed"
propagate_at_launch = true
value = ""
}
tag {
key = "k8s.io/cluster-autoscaler/node-template/label/node-role.kubernetes.io/node"
propagate_at_launch = true
value = ""
}
tag {
key = "k8s.io/role/node"
propagate_at_launch = true
value = "1"
}
tag {
key = "kops.k8s.io/instancegroup"
propagate_at_launch = true
value = "nodes"
}
tag {
key = "kubernetes.io/cluster/minimal-warmpool.example.com"
propagate_at_launch = true
value = "owned"
}
vpc_zone_identifier = [aws_subnet.us-test-1a-minimal-warmpool-example-com.id]
warm_pool {
max_group_prepared_capacity = 1
min_size = 0
}
}
resource "aws_autoscaling_lifecycle_hook" "kops-warmpool-nodes" {
autoscaling_group_name = aws_autoscaling_group.nodes-minimal-warmpool-example-com.id
default_result = "ABANDON"
heartbeat_timeout = 600
lifecycle_transition = "autoscaling:EC2_INSTANCE_LAUNCHING"
name = "kops-warmpool"
}
resource "aws_autoscaling_lifecycle_hook" "master-us-test-1a-NTHLifecycleHook" {
autoscaling_group_name = aws_autoscaling_group.master-us-test-1a-masters-minimal-warmpool-example-com.id
default_result = "CONTINUE"
heartbeat_timeout = 300
lifecycle_transition = "autoscaling:EC2_INSTANCE_TERMINATING"
name = "master-us-test-1a-NTHLifecycleHook"
}
resource "aws_autoscaling_lifecycle_hook" "nodes-NTHLifecycleHook" {
autoscaling_group_name = aws_autoscaling_group.nodes-minimal-warmpool-example-com.id
default_result = "CONTINUE"
heartbeat_timeout = 300
lifecycle_transition = "autoscaling:EC2_INSTANCE_TERMINATING"
name = "nodes-NTHLifecycleHook"
}
resource "aws_cloudwatch_event_rule" "minimal-warmpool-example-com-ASGLifecycle" {
event_pattern = file("${path.module}/data/aws_cloudwatch_event_rule_minimal-warmpool.example.com-ASGLifecycle_event_pattern")
name = "minimal-warmpool.example.com-ASGLifecycle"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool.example.com-ASGLifecycle"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_cloudwatch_event_rule" "minimal-warmpool-example-com-InstanceScheduledChange" {
event_pattern = file("${path.module}/data/aws_cloudwatch_event_rule_minimal-warmpool.example.com-InstanceScheduledChange_event_pattern")
name = "minimal-warmpool.example.com-InstanceScheduledChange"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool.example.com-InstanceScheduledChange"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_cloudwatch_event_rule" "minimal-warmpool-example-com-InstanceStateChange" {
event_pattern = file("${path.module}/data/aws_cloudwatch_event_rule_minimal-warmpool.example.com-InstanceStateChange_event_pattern")
name = "minimal-warmpool.example.com-InstanceStateChange"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool.example.com-InstanceStateChange"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_cloudwatch_event_rule" "minimal-warmpool-example-com-SpotInterruption" {
event_pattern = file("${path.module}/data/aws_cloudwatch_event_rule_minimal-warmpool.example.com-SpotInterruption_event_pattern")
name = "minimal-warmpool.example.com-SpotInterruption"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool.example.com-SpotInterruption"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_cloudwatch_event_target" "minimal-warmpool-example-com-ASGLifecycle-Target" {
arn = aws_sqs_queue.minimal-warmpool-example-com-nth.arn
rule = aws_cloudwatch_event_rule.minimal-warmpool-example-com-ASGLifecycle.id
}
resource "aws_cloudwatch_event_target" "minimal-warmpool-example-com-InstanceScheduledChange-Target" {
arn = aws_sqs_queue.minimal-warmpool-example-com-nth.arn
rule = aws_cloudwatch_event_rule.minimal-warmpool-example-com-InstanceScheduledChange.id
}
resource "aws_cloudwatch_event_target" "minimal-warmpool-example-com-InstanceStateChange-Target" {
arn = aws_sqs_queue.minimal-warmpool-example-com-nth.arn
rule = aws_cloudwatch_event_rule.minimal-warmpool-example-com-InstanceStateChange.id
}
resource "aws_cloudwatch_event_target" "minimal-warmpool-example-com-SpotInterruption-Target" {
arn = aws_sqs_queue.minimal-warmpool-example-com-nth.arn
rule = aws_cloudwatch_event_rule.minimal-warmpool-example-com-SpotInterruption.id
}
resource "aws_ebs_volume" "us-test-1a-etcd-events-minimal-warmpool-example-com" {
availability_zone = "us-test-1a"
encrypted = false
iops = 3000
size = 20
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "us-test-1a.etcd-events.minimal-warmpool.example.com"
"k8s.io/etcd/events" = "us-test-1a/us-test-1a"
"k8s.io/role/control-plane" = "1"
"k8s.io/role/master" = "1"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
throughput = 125
type = "gp3"
}
resource "aws_ebs_volume" "us-test-1a-etcd-main-minimal-warmpool-example-com" {
availability_zone = "us-test-1a"
encrypted = false
iops = 3000
size = 20
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "us-test-1a.etcd-main.minimal-warmpool.example.com"
"k8s.io/etcd/main" = "us-test-1a/us-test-1a"
"k8s.io/role/control-plane" = "1"
"k8s.io/role/master" = "1"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
throughput = 125
type = "gp3"
}
resource "aws_iam_instance_profile" "masters-minimal-warmpool-example-com" {
name = "masters.minimal-warmpool.example.com"
role = aws_iam_role.masters-minimal-warmpool-example-com.name
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "masters.minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_iam_instance_profile" "nodes-minimal-warmpool-example-com" {
name = "nodes.minimal-warmpool.example.com"
role = aws_iam_role.nodes-minimal-warmpool-example-com.name
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "nodes.minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_iam_role" "masters-minimal-warmpool-example-com" {
assume_role_policy = file("${path.module}/data/aws_iam_role_masters.minimal-warmpool.example.com_policy")
name = "masters.minimal-warmpool.example.com"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "masters.minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_iam_role" "nodes-minimal-warmpool-example-com" {
assume_role_policy = file("${path.module}/data/aws_iam_role_nodes.minimal-warmpool.example.com_policy")
name = "nodes.minimal-warmpool.example.com"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "nodes.minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_iam_role_policy" "masters-minimal-warmpool-example-com" {
name = "masters.minimal-warmpool.example.com"
policy = file("${path.module}/data/aws_iam_role_policy_masters.minimal-warmpool.example.com_policy")
role = aws_iam_role.masters-minimal-warmpool-example-com.name
}
resource "aws_iam_role_policy" "nodes-minimal-warmpool-example-com" {
name = "nodes.minimal-warmpool.example.com"
policy = file("${path.module}/data/aws_iam_role_policy_nodes.minimal-warmpool.example.com_policy")
role = aws_iam_role.nodes-minimal-warmpool-example-com.name
}
resource "aws_internet_gateway" "minimal-warmpool-example-com" {
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
vpc_id = aws_vpc.minimal-warmpool-example-com.id
}
resource "aws_key_pair" your_sha256_hasheb9c7157" {
key_name = "kubernetes.minimal-warmpool.example.com-c4:a6:ed:9a:a8:89:b9:e2:c3:9c:d6:63:eb:9c:71:57"
public_key = file("${path.module}/data/aws_key_pair_kubernetes.minimal-warmpool.example.com-c4a6ed9aa889b9e2c39cd663eb9c7157_public_key")
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_launch_template" "master-us-test-1a-masters-minimal-warmpool-example-com" {
block_device_mappings {
device_name = "/dev/xvda"
ebs {
delete_on_termination = true
encrypted = true
iops = 3000
throughput = 125
volume_size = 64
volume_type = "gp3"
}
}
block_device_mappings {
device_name = "/dev/sdc"
virtual_name = "ephemeral0"
}
iam_instance_profile {
name = aws_iam_instance_profile.masters-minimal-warmpool-example-com.id
}
image_id = "ami-12345678"
instance_type = "m3.medium"
key_name = aws_key_pair.your_sha256_hasheb9c7157.id
lifecycle {
create_before_destroy = true
}
metadata_options {
http_endpoint = "enabled"
http_protocol_ipv6 = "disabled"
http_put_response_hop_limit = 1
http_tokens = "optional"
}
monitoring {
enabled = false
}
name = "master-us-test-1a.masters.minimal-warmpool.example.com"
network_interfaces {
associate_public_ip_address = true
delete_on_termination = true
ipv6_address_count = 0
security_groups = [aws_security_group.masters-minimal-warmpool-example-com.id]
}
tag_specifications {
resource_type = "instance"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "master-us-test-1a.masters.minimal-warmpool.example.com"
"aws-node-termination-handler/managed" = ""
"k8s.io/cluster-autoscaler/node-template/label/kops.k8s.io/kops-controller-pki" = ""
"k8s.io/cluster-autoscaler/node-template/label/node-role.kubernetes.io/control-plane" = ""
"k8s.io/cluster-autoscaler/node-template/label/node.kubernetes.io/exclude-from-external-load-balancers" = ""
"k8s.io/role/control-plane" = "1"
"k8s.io/role/master" = "1"
"kops.k8s.io/instancegroup" = "master-us-test-1a"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
tag_specifications {
resource_type = "volume"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "master-us-test-1a.masters.minimal-warmpool.example.com"
"aws-node-termination-handler/managed" = ""
"k8s.io/cluster-autoscaler/node-template/label/kops.k8s.io/kops-controller-pki" = ""
"k8s.io/cluster-autoscaler/node-template/label/node-role.kubernetes.io/control-plane" = ""
"k8s.io/cluster-autoscaler/node-template/label/node.kubernetes.io/exclude-from-external-load-balancers" = ""
"k8s.io/role/control-plane" = "1"
"k8s.io/role/master" = "1"
"kops.k8s.io/instancegroup" = "master-us-test-1a"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "master-us-test-1a.masters.minimal-warmpool.example.com"
"aws-node-termination-handler/managed" = ""
"k8s.io/cluster-autoscaler/node-template/label/kops.k8s.io/kops-controller-pki" = ""
"k8s.io/cluster-autoscaler/node-template/label/node-role.kubernetes.io/control-plane" = ""
"k8s.io/cluster-autoscaler/node-template/label/node.kubernetes.io/exclude-from-external-load-balancers" = ""
"k8s.io/role/control-plane" = "1"
"k8s.io/role/master" = "1"
"kops.k8s.io/instancegroup" = "master-us-test-1a"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
user_data = filebase64("${path.module}/data/aws_launch_template_master-us-test-1a.masters.minimal-warmpool.example.com_user_data")
}
resource "aws_launch_template" "nodes-minimal-warmpool-example-com" {
block_device_mappings {
device_name = "/dev/xvda"
ebs {
delete_on_termination = true
encrypted = true
iops = 3000
throughput = 125
volume_size = 128
volume_type = "gp3"
}
}
iam_instance_profile {
name = aws_iam_instance_profile.nodes-minimal-warmpool-example-com.id
}
image_id = "ami-12345678"
instance_type = "t2.medium"
key_name = aws_key_pair.your_sha256_hasheb9c7157.id
lifecycle {
create_before_destroy = true
}
metadata_options {
http_endpoint = "enabled"
http_protocol_ipv6 = "disabled"
http_put_response_hop_limit = 1
http_tokens = "optional"
}
monitoring {
enabled = false
}
name = "nodes.minimal-warmpool.example.com"
network_interfaces {
associate_public_ip_address = true
delete_on_termination = true
ipv6_address_count = 0
security_groups = [aws_security_group.nodes-minimal-warmpool-example-com.id]
}
tag_specifications {
resource_type = "instance"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "nodes.minimal-warmpool.example.com"
"aws-node-termination-handler/managed" = ""
"k8s.io/cluster-autoscaler/node-template/label/node-role.kubernetes.io/node" = ""
"k8s.io/role/node" = "1"
"kops.k8s.io/instancegroup" = "nodes"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
tag_specifications {
resource_type = "volume"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "nodes.minimal-warmpool.example.com"
"aws-node-termination-handler/managed" = ""
"k8s.io/cluster-autoscaler/node-template/label/node-role.kubernetes.io/node" = ""
"k8s.io/role/node" = "1"
"kops.k8s.io/instancegroup" = "nodes"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "nodes.minimal-warmpool.example.com"
"aws-node-termination-handler/managed" = ""
"k8s.io/cluster-autoscaler/node-template/label/node-role.kubernetes.io/node" = ""
"k8s.io/role/node" = "1"
"kops.k8s.io/instancegroup" = "nodes"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
user_data = filebase64("${path.module}/data/aws_launch_template_nodes.minimal-warmpool.example.com_user_data")
}
resource "aws_route" "route-0-0-0-0--0" {
destination_cidr_block = "0.0.0.0/0"
gateway_id = aws_internet_gateway.minimal-warmpool-example-com.id
route_table_id = aws_route_table.minimal-warmpool-example-com.id
}
resource "aws_route" "route-__--0" {
destination_ipv6_cidr_block = "::/0"
gateway_id = aws_internet_gateway.minimal-warmpool-example-com.id
route_table_id = aws_route_table.minimal-warmpool-example-com.id
}
resource "aws_route_table" "minimal-warmpool-example-com" {
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
"kubernetes.io/kops/role" = "public"
}
vpc_id = aws_vpc.minimal-warmpool-example-com.id
}
resource "aws_route_table_association" "us-test-1a-minimal-warmpool-example-com" {
route_table_id = aws_route_table.minimal-warmpool-example-com.id
subnet_id = aws_subnet.us-test-1a-minimal-warmpool-example-com.id
}
resource "aws_s3_object" "cluster-completed-spec" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_cluster-completed.spec_content")
key = "clusters.example.com/minimal-warmpool.example.com/cluster-completed.spec"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "etcd-cluster-spec-events" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_etcd-cluster-spec-events_content")
key = "clusters.example.com/minimal-warmpool.example.com/backups/etcd/events/control/etcd-cluster-spec"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "etcd-cluster-spec-main" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_etcd-cluster-spec-main_content")
key = "clusters.example.com/minimal-warmpool.example.com/backups/etcd/main/control/etcd-cluster-spec"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "kops-version-txt" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_kops-version.txt_content")
key = "clusters.example.com/minimal-warmpool.example.com/kops-version.txt"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "manifests-etcdmanager-events-master-us-test-1a" {
bucket = "testingBucket"
content = file("${path.module}/data/your_sha256_hashtent")
key = "clusters.example.com/minimal-warmpool.example.com/manifests/etcd/events-master-us-test-1a.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "manifests-etcdmanager-main-master-us-test-1a" {
bucket = "testingBucket"
content = file("${path.module}/data/your_sha256_hashnt")
key = "clusters.example.com/minimal-warmpool.example.com/manifests/etcd/main-master-us-test-1a.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "manifests-static-kube-apiserver-healthcheck" {
bucket = "testingBucket"
content = file("${path.module}/data/your_sha256_hasht")
key = "clusters.example.com/minimal-warmpool.example.com/manifests/static/kube-apiserver-healthcheck.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" your_sha256_hashk8s-io-k8s-1-18" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-aws-cloud-controller.addons.k8s.io-k8s-1.18_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/aws-cloud-controller.addons.k8s.io/k8s-1.18.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" your_sha256_hashs-io-k8s-1-17" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-aws-ebs-csi-driver.addons.k8s.io-k8s-1.17_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/aws-ebs-csi-driver.addons.k8s.io/k8s-1.17.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "minimal-warmpool-example-com-addons-bootstrap" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-bootstrap_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/bootstrap-channel.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" your_sha256_hash12" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-coredns.addons.k8s.io-k8s-1.12_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/coredns.addons.k8s.io/k8s-1.12.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" your_sha256_hash-k8s-1-12" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-dns-controller.addons.k8s.io-k8s-1.12_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/dns-controller.addons.k8s.io/k8s-1.12.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" your_sha256_hasho-k8s-1-16" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-kops-controller.addons.k8s.io-k8s-1.16_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/kops-controller.addons.k8s.io/k8s-1.16.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" your_sha256_hashio-k8s-1-9" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-kubelet-api.rbac.addons.k8s.io-k8s-1.9_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/kubelet-api.rbac.addons.k8s.io/k8s-1.9.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "minimal-warmpool-example-com-addons-limit-range-addons-k8s-io" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-limit-range.addons.k8s.io_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/limit-range.addons.k8s.io/v1.5.0.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" your_sha256_hash6" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-networking.cilium.io-k8s-1.16_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/networking.cilium.io/k8s-1.16-v1.15.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" your_sha256_hash-k8s-1-11" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-node-termination-handler.aws-k8s-1.11_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/node-termination-handler.aws/k8s-1.11.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" your_sha256_hash-15-0" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_minimal-warmpool.example.com-addons-storage-aws.addons.k8s.io-v1.15.0_content")
key = "clusters.example.com/minimal-warmpool.example.com/addons/storage-aws.addons.k8s.io/v1.15.0.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "nodeupconfig-master-us-test-1a" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_nodeupconfig-master-us-test-1a_content")
key = "clusters.example.com/minimal-warmpool.example.com/igconfig/control-plane/master-us-test-1a/nodeupconfig.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_s3_object" "nodeupconfig-nodes" {
bucket = "testingBucket"
content = file("${path.module}/data/aws_s3_object_nodeupconfig-nodes_content")
key = "clusters.example.com/minimal-warmpool.example.com/igconfig/node/nodes/nodeupconfig.yaml"
provider = aws.files
server_side_encryption = "AES256"
}
resource "aws_security_group" "masters-minimal-warmpool-example-com" {
description = "Security group for masters"
name = "masters.minimal-warmpool.example.com"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "masters.minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
vpc_id = aws_vpc.minimal-warmpool-example-com.id
}
resource "aws_security_group" "nodes-minimal-warmpool-example-com" {
description = "Security group for nodes"
name = "nodes.minimal-warmpool.example.com"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "nodes.minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
vpc_id = aws_vpc.minimal-warmpool-example-com.id
}
resource "aws_security_group_rule" your_sha256_hashple-com" {
cidr_blocks = ["0.0.0.0/0"]
from_port = 22
protocol = "tcp"
security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
to_port = 22
type = "ingress"
}
resource "aws_security_group_rule" your_sha256_hashe-com" {
cidr_blocks = ["0.0.0.0/0"]
from_port = 22
protocol = "tcp"
security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
to_port = 22
type = "ingress"
}
resource "aws_security_group_rule" your_sha256_hashample-com" {
cidr_blocks = ["0.0.0.0/0"]
from_port = 443
protocol = "tcp"
security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
to_port = 443
type = "ingress"
}
resource "aws_security_group_rule" your_sha256_hash0--0" {
cidr_blocks = ["0.0.0.0/0"]
from_port = 0
protocol = "-1"
security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
to_port = 0
type = "egress"
}
resource "aws_security_group_rule" "from-masters-minimal-warmpool-example-com-egress-all-0to0-__--0" {
from_port = 0
ipv6_cidr_blocks = ["::/0"]
protocol = "-1"
security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
to_port = 0
type = "egress"
}
resource "aws_security_group_rule" your_sha256_hashrs-minimal-warmpool-example-com" {
from_port = 0
protocol = "-1"
security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
source_security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
to_port = 0
type = "ingress"
}
resource "aws_security_group_rule" your_sha256_hash-minimal-warmpool-example-com" {
from_port = 0
protocol = "-1"
security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
source_security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
to_port = 0
type = "ingress"
}
resource "aws_security_group_rule" your_sha256_hash-0" {
cidr_blocks = ["0.0.0.0/0"]
from_port = 0
protocol = "-1"
security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
to_port = 0
type = "egress"
}
resource "aws_security_group_rule" "from-nodes-minimal-warmpool-example-com-egress-all-0to0-__--0" {
from_port = 0
ipv6_cidr_blocks = ["::/0"]
protocol = "-1"
security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
to_port = 0
type = "egress"
}
resource "aws_security_group_rule" your_sha256_hashinimal-warmpool-example-com" {
from_port = 0
protocol = "-1"
security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
source_security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
to_port = 0
type = "ingress"
}
resource "aws_security_group_rule" your_sha256_hashers-minimal-warmpool-example-com" {
from_port = 1
protocol = "tcp"
security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
source_security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
to_port = 2379
type = "ingress"
}
resource "aws_security_group_rule" your_sha256_hashasters-minimal-warmpool-example-com" {
from_port = 2382
protocol = "tcp"
security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
source_security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
to_port = 4000
type = "ingress"
}
resource "aws_security_group_rule" your_sha256_hashmasters-minimal-warmpool-example-com" {
from_port = 4003
protocol = "tcp"
security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
source_security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
to_port = 65535
type = "ingress"
}
resource "aws_security_group_rule" your_sha256_hashters-minimal-warmpool-example-com" {
from_port = 1
protocol = "udp"
security_group_id = aws_security_group.masters-minimal-warmpool-example-com.id
source_security_group_id = aws_security_group.nodes-minimal-warmpool-example-com.id
to_port = 65535
type = "ingress"
}
resource "aws_sqs_queue" "minimal-warmpool-example-com-nth" {
message_retention_seconds = 300
name = "minimal-warmpool-example-com-nth"
policy = file("${path.module}/data/aws_sqs_queue_minimal-warmpool-example-com-nth_policy")
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool-example-com-nth"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_subnet" "us-test-1a-minimal-warmpool-example-com" {
availability_zone = "us-test-1a"
cidr_block = "172.20.32.0/19"
enable_resource_name_dns_a_record_on_launch = true
private_dns_hostname_type_on_launch = "resource-name"
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "us-test-1a.minimal-warmpool.example.com"
"SubnetType" = "Public"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
"kubernetes.io/role/elb" = "1"
"kubernetes.io/role/internal-elb" = "1"
}
vpc_id = aws_vpc.minimal-warmpool-example-com.id
}
resource "aws_vpc" "minimal-warmpool-example-com" {
assign_generated_ipv6_cidr_block = true
cidr_block = "172.20.0.0/16"
enable_dns_hostnames = true
enable_dns_support = true
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_vpc_dhcp_options" "minimal-warmpool-example-com" {
domain_name = "us-test-1.compute.internal"
domain_name_servers = ["AmazonProvidedDNS"]
tags = {
"KubernetesCluster" = "minimal-warmpool.example.com"
"Name" = "minimal-warmpool.example.com"
"kubernetes.io/cluster/minimal-warmpool.example.com" = "owned"
}
}
resource "aws_vpc_dhcp_options_association" "minimal-warmpool-example-com" {
dhcp_options_id = aws_vpc_dhcp_options.minimal-warmpool-example-com.id
vpc_id = aws_vpc.minimal-warmpool-example-com.id
}
terraform {
required_version = ">= 0.15.0"
required_providers {
aws = {
"configuration_aliases" = [aws.files]
"source" = "hashicorp/aws"
"version" = ">= 5.0.0"
}
}
}
```
|
was a Japanese film director, best known for the cult-classic Godzilla vs. Hedorah (1971), which he directed and co-wrote. Banno was a special guest at G-Fest XII in 2005. He was an executive producer on Legendary Pictures's American Godzilla films, Godzilla (2014), Godzilla: King of the Monsters (2019), and Godzilla vs. Kong (2021). He died of subarachnoid hemorrhage in 2017. King of the Monsters was dedicated to his memory along with Haruo Nakajima's.
Filmography
Director
Birth of the Japanese Islands (1970)
Godzilla vs. Hedorah (1971)
Ninja, the Wonder Boy (1985) (TV Series)
Assistant director
Throne of Blood (1957)
The Lower Depths (1957)
The Hidden Fortress (1958)
The Bad Sleep Well (1960)
Nippon musekinin jidai (The Irresponsible Age of Japan) (1962)
Nippon musekinin yaro (The Irresponsible Guys of Japan) (1962)
Kyomo ware ozorami ari (1964)
Nippon ichi no horafuki otoko (Japan's Number One Braggart Man) (1964)
Hyappatsu hyakuchu (1965)
Taiheiyo kiseki no sakusen: Kisuka (A Miraculous Military Operation in the Pacific Ocean: Kiska) (1965)
Nikutai no gakko (School of the Flesh) (1965)
Doto ichiman kairi (The Mad Atlantic) (1966)
Kureji no musekinin Shimizu Minato (The Boss of Pickpocket Bay) (1966)
Prophecies of Nostradamus (1974)
Writer
Techno Police 21c (1982)
The Wizard of Oz (1982)
Prophecies of Nostradamus (Nosutoradamusu no daiyogen) (1974)
Godzilla vs. Hedorah (1971)
Executive producer
Godzilla (2014)
Godzilla: King of the Monsters (2019) (posthumous)
Godzilla vs. Kong (2021) (posthumous)
References
External links
Japanese film directors
People from Imabari, Ehime
Neurological disease deaths in Japan
Deaths from subarachnoid hemorrhage
1931 births
2017 deaths
|
The Diocese of Kimberley and Kuruman is a diocese in the Anglican Church of Southern Africa, and encompasses the area around Kimberley and Kuruman and overlaps the Northern Cape Province and North West Province of South Africa. It is presided over by the Bishop of Kimberley and Kuruman, until recently Ossie Swartz. On 19 September 2021 the Electoral College of Bishops elected to translate the Right Revd Brian Marajh of George to become the 13th Bishop of Kimberley & Kuruman. The seat of the Bishop of Kimberley and Kuruman is at St Cyprian's Cathedral, Kimberley. There had been so far 12 bishops of the See, though one of these served for two different periods of time.
Formation of the diocese
The Anglican presence on the Diamond Fields and in Kimberley's hinterland, from the early 1870s, was at first administered from Bloemfontein, initially under Allan Webb, the oldest parish here being St Mary's, Barkly West. By the early 1890s, however, there was a feeling in some quarters that the Diocese of Bloemfontein was too big and there were proposals for the formation of a separate bishopric with its seat in Kimberley. But in the event the bishops decided upon establishing the missionary Diocese of Mashonaland instead – an area also up until then administered from Bloemfontein.
From 1907 to 1910 motions were passed and planning and fund-raising initiatives were being conducted in earnest towards founding a new Diocese of Kimberley. These included the "Million Shillings Fund" launched by Arthur Chandler, Bishop of Bloemfontein, in London on 2 February 1909. It was hoped that all would be in place so that the coming into being of the new Diocese would coincide with the establishment of Union in South Africa in 1910. However it was not before July 1911 that all was ready and a formal resolution could be proposed, as it was at a meeting in the Kimberley Town Hall, that ‘the western portion of the Diocese of Bloemfontein be constituted a new and separate Diocese with Kimberley as its Cathedral Town’ – to which the Episcopal Synod, meeting in Maritzburg, gave its final consent in the form of a mandate dated 11 October 1911. The elective assembly for the choosing of a bishop for the new diocese was held in Kimberley on 13 December 1911, at which Wilfrid Gore Browne, Dean of Pretoria, was the unanimous choice. Gore Browne was consecrated in the Bloemfontein Cathedral on 29 June 1912. He was enthroned the following day as bishop of Kimberley and Kuruman, at St Cyprian's Cathedral.
Geographical extent
The Diocese of Kimberley and Kuruman has not been constant in extent and at times less than exactly defined. Taking over the western side of the Diocese of Boemfontein (now "of the Free State"), it also included some of the sparsely populated interior extremities of the Dioceses of Cape Town and of Grahamstown. The southern half of Bechuanaland Protectorate was added om 1915 and remained part of "K&K" (as Kimberley and Kuruman is often called) until Botswana's independence in 1966. This history flavoured liturgical usage there, which still resembles the style more of the South African Prayer Book than the Central African Prayer Book. The 1952 diocesan synod was concerned to establish the boundaries of parishes; noting also a lack of clarity on "where is the Diocese" – "The Bishop called attention ... to the fact that certain places where at present the Diocese has Clergymen at work are not technically in the Diocese."
Bishops
Notable clergy and people
Besides the bishops of the see (above) and the Deans of Kimberley (see also the early Rectors of St Cyprian's), notable clergy and people of the diocese have included: The so-called "Big Three" pioneer missionary priests of the diocese, W.H.R. Bevan of Phokwane; George Mervyn Lawson, archdeacon of Griqualand West; and Frederick William Peasley of Bothithong; Henrietta Stockdale, a sister of the Community of St Michael and All Angels; Levi Kraai, ordained by Gore-Browne in 1913; J. W. Mogg, who served the diocese from 1915 to 1945; Walter Wade, of St Matthew's Barkly Road, Archdeacon of Bechuanaland and of Kimberley, and afterwards Dean of Umtata and Suffragan Bishop of Cape Town; Joseph Thekiso, an archdeacon; Theo Naledi, afterwards Bishop of Botswana; Richard Stanley Cutts, an archdeacon, afterwards Dean of Salisbury and later the bishop of Buenos Aires; Alan Butler, latterly director of the Kuruman Moffat Mission; George Pressly; John William Salt, afterwards dean of Eshowe and bishop of St Helena; Kimberley-born Brian Marajh, bishop of George; Kimberley-born Margaret Vertue, bishop of False Bay and second woman to be elected as a bishop of the Anglican Church of Southern Africa and of the whole African continent.
Current archdeaconries and parishes
Some of the parishes in the diocese date back to the beginnings of Anglican work on the Diamond Fields and in Kimberley's hinterland, for example St Mary's, Barkly West and the Cathedral Parish of St Cyprian. They have multiplied in number, various parishes being subdivided or consolidated through time. It follows that boundaries have not been unchanging. The archdeaconry structure has been even more dynamic, responding to the needs of the day at different periods. In 2010 an experimental division between north and south was replaced when the archdeaconries of the Molopo, the Kgalagadi and the Karoo, additional to the Cathedral archdeaconry, were created. Currently these administrative units are the archdeaconries of the Cathedral, The Diamond Fields, Gariep, Kgalagadi, and Molopo, embracing the following parishes (Schedule of Archdeaconries as of May 2017):
Cathedral
The Cathedral Church of St Cyprian the Martyr, Kimberley.
St Alban's, De Beers
Archdeaconry of the Diamond Fields
All Saints, Homevale
St Matthew's, Barkly Road
St Barnabas, Florianville
St Mary Magdalene, Ritchie
St Augustine's, West End
St Paul's, Vergenoeg
St Peter's, Greenpoint
St Mary the Virgin, Barkly West – the oldest Parish Church in the Diocese
St Francis, Roodepan
St James, Galeshewe
Archdeaconry of Gariep
All Saints, Paballelo
St Andrew's, Prieska
St Philip's, Boegoeberg
St Matthew's, Oranjekruin, Upington
Annunciation, Douglas
St Luke's, Prieska
Good Shepherd, Nonzwakazi, De Aar
St Martin's, Breipaal, Douglas
St Thomas, De Aar
[with St Anne's, Niekerkshoop; St Paul's, Marydale; St Barnabas, Britstown; St Andrew's, Philipstown; St Matthew's, Richmond]
Archdeaconry of the Kgalagadi
St Mary-le-Bourne, Kuruman
St Monica, Tsineng
St Paul's, Mothibistad
St Timothy, Seoding
St Wilfred, Maruping
St Peter's Wrenchville
St Laurence, Danielskuil
St John's, Bothithong
St Michael and All Angels, Batlharos
St Francis, Manyeding
Good Shepherd
Several of these parishes have numerous outstations
Archdeaconry of the Molopo
Resurrection, Mmabatho
All Saints, Montshiwa
St John the Evangelist, Mafikeng
Transfiguration, Setlagole
St Michael and All Angels, Lomanyaneng
Holy Cross, Pudimong
St Chad's, Taung
St Mary's, Matalong
All Saints, Pampierstad
St Peter's, Ganyesa
St Hubert's, Hartsvaal Parish
St Augustine's Hartsvaal
St George, Warrenton
St Peter's, Ikhutseng
St Stephen's, Vryburg
St Philip's, Huhudi
St John, Tlakgameng
Several of these parishes have numerous outstations
Coat of arms
The diocese assumed arms at the time of its inception, and had them granted by the College of Arms in 1953 : Per pale Argent and Sable, a cross potent counterchanged within a bordure Azure charged with eleven lozenges of the first.
Relationship with Oxford
The diocese has a link partnership with the Diocese of Oxford, established in 1993. Visits by John Pritchard, Bishop of Oxford, to Kimberley and Kuruman in 2008 and 2010, by Bishop Oswald Swartz to Lambeth Palace (and Oxford) in 2008, and by other senior clergy and people from both sides of the link, strengthened partnerships with focus areas on HIV/Aids and other key projects. The Dean of Kimberley, the Very Revd Reginald Leeuw, represented his diocese at the inauguration of the Rt Revd Dr Steven Croft as Bishop of Oxford in 2016. A large contingent flew with Bishop Croft to Kimberley for a Link Summit in 2017, and a meeting on environmental issues followed in Oxford a year later. A planned Link Summit to have taken place in Oxford in 2020 was called off owing to the COVID-19 pandemic.
References
1911 establishments in South Africa
Anglican Church of Southern Africa dioceses
Christian organizations established in 1911
|
On 14 October 2004, Pádraig Nally, an Irish farmer living in County Mayo, Republic of Ireland shot dead Irish Traveller John "Frog" Ward, who had been trespassing on his property. In November 2005 Nally was sentenced to six years' imprisonment for manslaughter. His conviction was quashed in October 2006 and, after a retrial in December 2006, he was found not guilty of manslaughter.
First trial
The Central Criminal Court decided to hear the Nally case in Castlebar, making it the first murder trial in Mayo for almost a century; the jury was chosen from a pool of more than 200 locals. Travellers' support groups criticised the bias because of the jury's composition, arguing that the murder trial should have been afforded a more independent and objective forum. A member of the Law Reform Commission concurred that there was strong case to have such trials take place in Dublin.
Ward was a 43-year-old Traveller with approximately 80 convictions from 38 separate court appearances and had convictions for burglary, larceny and assault. John "Frog" Ward had twice been committed to hospital for psychiatric treatment. In 1999, he threatened a barman with a Stanley knife. Ward attacked a car with a slash hook while a woman and two children were inside. Ward had threatened Gardaí in an incident in May 2002 and with a slash, in April 2002. At the time of his death he was facing charges of attacking Gardaí with a slash hook. The court heard that a post-mortem examination and toxicology tests on Mr Ward's body found traces of cannabis, opiates and tranquillisers. It was also emphasised that Mr Ward had been receiving hospital treatment and was on medication for a condition. The Prime Time Special (RTÉ flagship current affairs programme) brought forward new evidence showing that John Ward had a long criminal record dating back over 30 years and revealed that four bench warrants for John Ward's arrest were outstanding at the time of his death.
Tom Ward, the chief witness for the prosecution, was himself serving an eleven-month sentence at the time of the trial, for possessing a knife and for theft.
During the first trial, the court heard that Nally had become increasingly agitated and worried that his property would be targeted by local thieves as a number of farms in the area had recently been burgled. His own home had been broken into in 2003 and a chainsaw stolen from one of his sheds in February 2004. Other items had disappeared from around his house and farm. This caused him to be unable to sleep properly. Following the break-in in February 2004 he had kept a gun in a garage and had started to keep registration numbers of strange cars travelling through the district. Friends and neighbours noted Nally had become preoccupied with looking after his farm and terrified that the robbers would return. He told the jury he was at the end of his tether and, according to counsel, was "agitated and fearful, even paranoid" about his safety. "Did he suddenly, after 60 years, become a murderer?" asked Brendan Grehan, Nally's lawyer, describing his client as a law-abiding member of his community who acted in self-defence.
Nally alleged he had met John "Frog" Ward previously when Ward had called to his house two weeks before 14 October and had enquired if it would be a good day for fishing. Ward, said Nally, had no fishing tackle with him and this led him to be suspicious of Ward. He did not like the look of him.
Under cross-examination, Tom Ward denied a suggestion that his father was a bare knuckle boxer, and he said he had no knowledge of a suggestion his father had threatened a Garda with a slashhook. Tom Ward said that on the evening of 13 October 2004 he had bought the car he and his father had travelled in to Pádraig Nally's house the following day. He said he had bought it from other travellers, but he declined to give the court any names. Pádraig Nally's barrister had earlier stated a car bearing a similar description had previously been seen in the vicinity of Cross a short distance from where a chainsaw was reported stolen.
According to Marie Cassidy, the state pathologist, John Ward, a Galway traveller, was shot twice on 14 October 2004. The first shot injured John Ward in the hand and hip. The second shot was fired from above and John Ward was in a crouched position at the time. The person who shot him was standing over him and the shot was fired at close range. Nally said in evidence he was afraid Ward would kill him, which was why he fired the second shot (to frighten him [Ward]).
The Defense argued provocation, as Nally could have reasonably assumed John Ward had been responsible for the theft of the chainsaw and perhaps the numerous other thefts since, as Mr. Nally recognised the vehicle outside his home on 14 October as that bearing the description of the one seen in the vicinity of his home the day his chainsaw was stolen (in 2003). The provocation was, seemingly, the fact that Nally's house had been burgled some time previously, that Ward had called to his house some weeks previously and had acted suspiciously and that Ward was on his premises on 14 October, without authorisation.
Nally pleaded not guilty to murder and manslaughter charges. He was acquitted of murder, but convicted of manslaughter. The judge, Mr Justice Paul Carney, refused to allow the jury to consider a full defence argument of self-defence.
Sentencing Nally to six years for the manslaughter conviction, Mr Justice Paul Carney said: "This is undoubtedly the most socially divisive case I have had to try. It is also the most difficult one in which I have had to impose sentence.". The judge said he would take into consideration Nally's unblemished past, his low risk of re-offending, his willingness to show remorse for his crime and the fact that the prosecution's case was based largely on testaments given by the farmer.
Appeal
Nally was refused leave to appeal by the Central Criminal Court against his conviction and six-year jail sentence.
The case was then appealed to the Court of Criminal Appeal. Nally's lawyers had argued at his appeal that the trial judge had erred in law by not allowing the jury to consider a defence of full self-defence and by not allowing it to find Nally not guilty. He had directed that the jury had to find Nally guilty of murder or guilty of manslaughter, and ruled that an acquittal verdict based on the evidence would be perverse.
In October 2006, the Court of Criminal Appeal quashed Pádraig Nally's conviction for manslaughter and ordered a retrial. The Court said that the jury should not have been denied the opportunity to return a verdict of not guilty, even if such a verdict may have flown in the face of the evidence.
Retrial
Pádraig Nally's retrial took place in December 2006. Similar evidence was submitted to the court, including evidence of Ward's character and previous convictions and both Nally's and Ward's mental states on the day in question.
The jury of eight men and four women acquitted Nally of manslaughter and he walked free.
Legacy
In 2009, the government announced its plan to introduce a new law of self-defence in 2010 upon recommendation by the Law Reform Commission which would codify the existing common law position on the use of force in defence of property. The Criminal Law (Defence and the Dwelling) Act 2011 was enacted on 19 December 2011.
Although widely heralded as "allowing" homeowners to exercise reasonable force in defending their home, the Act in fact did nothing to change the legal position as it existed at the time of Nally's trial, other than to place the previous common law jurisprudence on a statutory footing.
See also
Castle doctrine
Defence of property
Joe Horn shooting controversy
1984 New York City Subway shooting
Tony Martin (farmer)
Munir Hussain case
References
External links
RTE News: Mixed Reaction to Nally Acquittal
Cork FM Coverage of First Conviction
Ward, John
Ward, John
Irish Traveller-related controversies
2004 in the Republic of Ireland
|
Daniel Rodighiero (born 20 September 1940) is a French former professional footballer who played as a striker.
References
External links
Profile at FFF
Profile at tangofoot.free.fr
1940 births
Living people
Sportspeople from Saint-Cloud
French men's footballers
Footballers from Hauts-de-Seine
Men's association football forwards
France men's international footballers
Red Star F.C. players
Stade Malherbe Caen players
Stade Rennais F.C. players
Valenciennes FC players
Stade Lavallois players
Ligue 1 players
|
Kitui County is a county in the former Eastern Province of Kenya with its capital and largest town being Kitui, although Mwingi is also another major urban centre. The county has a population of 1,136,187 (2019 census). and an area of 30,496 km2. It lies between latitudes 0°10 South and 3°0 South and longitudes 37°50 East and 39°0 East.
Kitui County shares its borders with seven counties; Tharaka-Nithi and Meru to the north, Embu to the northwest, Machakos and Makueni to the west, Tana River to the east and southeast, and Taita-Taveta to the south.
History
The name Kitui means 'a place where iron goods are made'. The Kamba iron-smiths who settled in the county many years before the colonial period are the ones who named the area Kitui.
Demographics
Kitui county has a total population of 1,136,187 of which 549,003 are males, 587,151 females and 33 intersex persons. There are 262,942 household with an average household size of 4.3 persons per household and a population density 37 people per square kilometre.
Source
The population is mostly made up of people of the Akamba ethnicity. Tharaka people, a section of the Ameru, are also found in Kitui County mainly in Tharaka ward. There is also a growing Somali presence.
Administration and Political Units
Administrative Units
There are eight sub counties, forty county assembly wards, one hundred and sixty seven locations and four hundred and eleven sub-locations.
Further, the sub-counties are divided into smaller units called wards. There are 40 wards which are further divided into 247 villages.
Administrative Sub-Counties
Ikutha sub county
Katulani sub county
Kisasi sub county
Kitui central sub county
Kitui west sub county
Kyuso sub county
Lower yatta sub county
Matinyani sub county
Migwani sub county
Mumoni sub county
Mutitu sub county
Mutitu north sub county
Mutomo sub county
Mwingi central sub county
Mwingi east sub county
Nzambani sub county
Thagicu sub county
Tseikuru sub county
Source
Electoral Constituencies
Kitui Central Constituency
Kitui East Constituency
Kitui Rural Constituency
Kitui South Constituency
Kitui West Constituency
Mwingi Central Constituency
Mwingi North Constituency
Mwingi West Constituency
Source
Political Leadership
Julius Makau Malombe is the governor of the county after being elected in the 2022 general elections. He is deputised by Augustine Kanani Wambua .Eoch Kiio Wambua is the senator who was re-elected in the 2022 general elections after unseating the first senator David Musila. Judith Wanza is the women representative and second holder of this office after Irene Muthoni Kasalu.
For Kitui County, the County Executive Committee comprises:-
kSource
Members of Parliament 2017-2022 (Kitui County)
Hon. Mulu, Benson Makali of Wiper Democratic Party Kenya Member of Parliament Kitui Central Constituency
Hon. Mbai, Nimrod Mbithuka of Jubilee Party Member of Parliament Kitui East Constituency
Hon. Mboni, David Mwalika of chama cha uma party Member of Parliament Kitui Rural Constituency
Hon. Nyamai, Rachael Kaki of Jubilee Party Member of Parliament Kitui South Constituency
Hon. Nyenze, Edith of Wiper Democratic Party Kenya Member of Parliament Kitui West Constituency
Hon. Mulyungi, Gideon Mutemi of Wiper Democratic Party Kenya Member of Parliament Mwingi Central Constituency
Hon. Nzengu, Paul Musyimi of Wiper Democratic Party of Kenya Member of Parliament Mwingi North Constituency
Hon. Nguna, Charles Ngusya of Wiper Democratic Party of Kenya Member of Parliament Mwingi West Constituency
Religion
Religion in Kitui County
Education
There are 1826 ECD centres 1099 primary schools and 384 secondary schools. The county has also 5 teachers training colleges, 311 adult training institutions and 1 technical training institutions.
Source
Health
There are a total of 256 health facilities in the county with one county referral hospital. County has 2,084 health personnel of different cadre.
HIV prevalence is at 4.2% below the national 5.9%.
Source
Major towns
Major towns in the county include Kitui, Mwingi, Mutomo, Kwa Vonza, Mutitu, Ikutha, Kabati, Migwani, Mutonguni, Mbitini and Kyuso.
Climate
The climate is semi-arid; it receives roughly 71 cm (28 inches). A significant point however is that rainfall occurs practically only during the rainy seasons (one long around March & April, and one short, around October, November and December). The terms Long and Short Rains has nothing to do with amount of rainfall received but rather on the length of the rainy seasons.
Urbanisation
Source: OpenDataKenya
Education
There are 1826 ECD centres 1476 primary schools and 384 secondary schools. The county has also 5 teachers training colleges, 311 adult training institutions and 1 technical training institutions.
Source
Kitui School and Muthale Girls are the only national schools in Kitui County. Other major secondary schools are St. Charles Lwanga Secondary School, Kyuso Boys Sec, St. Joseph's Seminary at Mwingi, St, Benedict Ikutha Boys' high school, Kisasi Boys' Secondary School, Matinyani Boys' Secondary, Mutonguni Secondary School, St. Luke's Yatta Boys' Secondary School, Katheka boys high school (St Aquinas) Mutito Boys' Secondary School and Mwingi Boys' Secondary School. Major girls' schools include Mulango Girls' High School, St. Angela's High School, Mbitini Girls' Secondary School, Chuluni Girls' Secondary School, Mutito Girls' Secondary School and Mutomo Girls' Secondary School. Other notable secondary schools are St.Ursula Girls-Tungutu, St. Aquinas Kyangwithya Boys, Nzambani Boys, Maliku Girls, Thitani Girls, Zombe Girls, Migwani Boys, Katheka Boys, Kabaa secondary school and St. Lawrence Kaluva Secondary School
Kathungi Secondary School, which is also found in Kitui County, is famous for its football championship in the country. Kathungi were the 2013 national silver medalists. Alongside the national champions Upper Hill, they represented Kenya in East Africa Secondary School games held in Lira, Uganda.
South Eastern Kenya University is a public university located in Kitui with the Main Campus at Kwa Vonza and other campuses at Mwingi and Kitui towns. Kenyatta University has a campus at Kwa Vonza while Moi University has a campus at Kyuso in Mwingi North sub-county. University of Nairobi also has a campus in Kitui town. Kenya Medical Training College has campuses in Kitui and Mwingi.
Statistics
Source: USAid Kenya
Health
There are a total of 256 health facilities in the county with one county referral hospital. County has 2,084 health personnel of different cadre.
HIV prevalence is at 4.2% below the national 5.9%.
Source
Kitui County has several hospitals and health centres to meet the health needs of residents, among them Kitui County Referral Hospital, Mwingi Sub-County General Hospital, Kitui Nursing Home, Neema Hospital, Jordan Hospital, mission-run hospitals such as Muthale Mission hospital and some private health centres.
Economy
The vast majority of the economy is based on sustenance farming, despite the fact that the agriculture is an extremely challenging endeavor giving the sporadic rainfall. A logical move therefore would be a transition to non-agricultural industries.
During a recent, informal survey of the businesses in the town of Ikutha in southern Kitui County, the following businesses were identified:
Butcheries
Food Staples (rice, corn meal)
Mini-markets (sells things like Coca-Cola, potato chips, bread, long-shelf milk)
Mechanics
Pubs
Hotels and restaurants
Industries
Situated in Kitui town is a cotton ginnery where cotton farmers from around the county can deliver their harvest. It is the only major industry in the region, and was set up way back in 1935. Kitui is a semi-arid region and not many crops fare well there apart from cotton, hence the ginnery plays a major role creating income for the many cotton farmers in the region.
Minerals
Kitui county has large deposits of coal in Mui Basin, having low energy content/calorific value, meaning it produces less heat when burned. It also has sulphur. The coal could potentially supply the 1,000 MW Lamu Coal Power Station, and the 960-megawatt (MW) Kitui coal plant.
Mutomo/Ikutha district contains limestone.
Wealth/Poverty Level
Source: OpenDataKenya Worldbank
Tourism
Tsavo East National Park
South Kitui National Reserve
Mwingi National Reserve
Ikoo Valley
Ngomeni Rock Catchment.
Nzambani Rock
Also in Kitui county is one of the largest Rock outcrops in Kenya which is locally known as "Ivia ya Nzambani". Situated past Kitui Town, about 1 km from Chuluni Market is the Nzambani Rock which is famous for the tales and myths of its origin. Activities here include hiking and rock climbing.
Religion and traditional culture
Christianity is the dominant religion in Kitui County. Roman Catholics make about 15% of the county's population. Other Christian denominations in the county include The Africa Brotherhood Church (ABC), the African Inland Church (AIC), Anglican Church of Kenya (ACK), Presbyterian Church of East Africa (PCEA), Independent Presbyterian Church (IPC), Redeemed Gospel Church and many others. Kitui county has a significant number of Muslims and several mosques can be spotted around the county's major urban centres.
Notable people
Willy Mutunga, Former Chief Justice of Kenya
Kalonzo Musyoka, 10th Vice-President of Kenya
Julius Malombe, The first Governor of Kitui County
Makau W. Mutua, Former dean of the University of Buffalo Law School
Charity Ngilu, Former MP Kitui Central (The current Governor of Kitui County)
David Musila, Former Member of Parliament of Kitui West Constituency
Nzamba Kitonga, Former president of the East Africa Law Society and COMESA Court of Justice
Kiema Kilonzo, Kenyan ambassador to Turkey
Eric Mutua, Former chairman of the Law Society of Kenya and Treasurer of the East Africa Law Society
Onesmus Kimweli Mutungi, Former Chancellor of Kenyatta University and the first Kenyan to get Doctor of Law degree
Ngala Mwendwa, Former Minister of Labour in the first Kenyan post-independence cabinet
Nyiva Mwendwa, The first Kitui County Woman Representative and first Kenyan woman to serve as a cabinet minister
Kitili Maluki Mwendwa, First black Chief Justice of Kenya
Benson Masya, Kenyan long distance runner and marathon serial winner and the winner of the inaugural IAAF World Half Marathon Championships in 1992
Benjamin Nzimbi, Retired Archbishop and Primate of the Anglican Church of Kenya
Musili Wambua, Associate Dean of the University of Nairobi School of Law and the first Chancellor of University of Embu
John Nzau Mwangangi, Kenyan long distance runner and the gold medalist at the 2011 African Cross Country Championships
See also
Counties of Kenya
Water supply and sanitation in Kenya#Kitui County
References
External links
Kitui County official website
Visit Kitui website
Counties of Kenya
|
```c
#include "include/opl.h"
#include "include/ioman.h"
#include <kernel.h>
#include <string.h>
#include <malloc.h>
#include <stdio.h>
#include <unistd.h>
#ifdef __EESIO_DEBUG
#include <sio.h>
#endif
#define MAX_IO_REQUESTS 64
#define MAX_IO_HANDLERS 64
extern void *_gp;
static int gIOTerminate = 0;
#define THREAD_STACK_SIZE (96 * 1024)
static u8 thread_stack[THREAD_STACK_SIZE] ALIGNED(16);
struct io_request_t
{
int type;
void *data;
struct io_request_t *next;
};
struct io_handler_t
{
int type;
io_request_handler_t handler;
};
/// Circular request queue
static struct io_request_t *gReqList;
static struct io_request_t *gReqEnd;
static struct io_handler_t gRequestHandlers[MAX_IO_HANDLERS];
static int gHandlerCount;
// id of the processing thread
static s32 gIOThreadId;
// lock for tip processing
static s32 gProcSemaId;
// lock for queue end
static s32 gEndSemaId;
// ioPrintf sema id
static s32 gIOPrintfSemaId;
static ee_thread_t gIOThread;
static ee_sema_t gQueueSema;
static int isIOBlocked = 0;
static int isIORunning = 0;
int ioRegisterHandler(int type, io_request_handler_t handler)
{
WaitSema(gProcSemaId);
if (handler == NULL)
return IO_ERR_INVALID_HANDLER;
if (gHandlerCount >= MAX_IO_HANDLERS)
return IO_ERR_TOO_MANY_HANDLERS;
int i;
for (i = 0; i < gHandlerCount; ++i) {
if (gRequestHandlers[i].type == type)
return IO_ERR_DUPLICIT_HANDLER;
}
gRequestHandlers[gHandlerCount].type = type;
gRequestHandlers[gHandlerCount].handler = handler;
gHandlerCount++;
SignalSema(gProcSemaId);
return IO_OK;
}
static io_request_handler_t ioGetHandler(int type)
{
int i;
for (i = 0; i < gHandlerCount; ++i) {
struct io_handler_t *h = &gRequestHandlers[i];
if (h->type == type)
return h->handler;
}
return NULL;
}
static void ioProcessRequest(struct io_request_t *req)
{
if (!req)
return;
io_request_handler_t hlr = ioGetHandler(req->type);
// invalidate the request
void *data = req->data;
if (hlr)
hlr(data);
}
static void ioWorkerThread(void *arg)
{
while (!gIOTerminate) {
SleepThread();
// if term requested exit immediately from the loop
if (gIOTerminate)
break;
// do we have a request in the queue?
WaitSema(gProcSemaId);
while (gReqList) {
// if term requested exit immediately from the loop
if (gIOTerminate)
break;
struct io_request_t *req = gReqList;
ioProcessRequest(req);
// lock the queue tip as well now
WaitSema(gEndSemaId);
// can't be sure if the request was
gReqList = req->next;
free(req);
if (!gReqList)
gReqEnd = NULL;
SignalSema(gEndSemaId);
}
SignalSema(gProcSemaId);
}
// delete the pending requests
while (gReqList) {
struct io_request_t *req = gReqList;
gReqList = gReqList->next;
free(req);
}
// delete the semaphores
DeleteSema(gProcSemaId);
DeleteSema(gEndSemaId);
isIORunning = 0;
ExitDeleteThread();
}
static void ioSimpleActionHandler(void *data)
{
io_simpleaction_t action = (io_simpleaction_t)data;
if (action)
action();
}
void ioInit(void)
{
gIOTerminate = 0;
gHandlerCount = 0;
gReqList = NULL;
gReqEnd = NULL;
gIOThreadId = 0;
gQueueSema.init_count = 1;
gQueueSema.max_count = 1;
gQueueSema.option = 0;
gProcSemaId = CreateSema(&gQueueSema);
gEndSemaId = CreateSema(&gQueueSema);
gIOPrintfSemaId = CreateSema(&gQueueSema);
// default custom simple action handler
ioRegisterHandler(IO_CUSTOM_SIMPLEACTION, &ioSimpleActionHandler);
gIOThread.attr = 0;
gIOThread.stack_size = THREAD_STACK_SIZE;
gIOThread.gp_reg = &_gp;
gIOThread.func = &ioWorkerThread;
gIOThread.stack = thread_stack;
gIOThread.initial_priority = 30;
isIORunning = 1;
gIOThreadId = CreateThread(&gIOThread);
StartThread(gIOThreadId, NULL);
}
int ioPutRequest(int type, void *data)
{
if (isIOBlocked)
return IO_ERR_IO_BLOCKED;
// check the type before queueing
if (!ioGetHandler(type))
return IO_ERR_INVALID_HANDLER;
WaitSema(gEndSemaId);
// We don't have to lock the tip of the queue...
// If it exists, it won't be touched, if it does not exist, it is not being processed
struct io_request_t *req = gReqEnd;
if (!req) {
gReqList = (struct io_request_t *)malloc(sizeof(struct io_request_t));
req = gReqList;
gReqEnd = gReqList;
} else {
req->next = (struct io_request_t *)malloc(sizeof(struct io_request_t));
req = req->next;
gReqEnd = req;
}
req->next = NULL;
req->type = type;
req->data = data;
SignalSema(gEndSemaId);
// Worker thread cannot wake itself up (WakeupThread will return an error), but it will find the new request before sleeping.
WakeupThread(gIOThreadId);
return IO_OK;
}
int ioRemoveRequests(int type)
{
// lock the deletion sema and the queue end sema as well
WaitSema(gProcSemaId);
WaitSema(gEndSemaId);
int count = 0;
struct io_request_t *req = gReqList;
struct io_request_t *last = NULL;
while (req) {
if (req->type == type) {
struct io_request_t *next = req->next;
if (last)
last->next = next;
if (req == gReqList)
gReqList = next;
if (req == gReqEnd)
gReqEnd = last;
count++;
free(req);
req = next;
} else {
last = req;
req = req->next;
}
}
SignalSema(gEndSemaId);
SignalSema(gProcSemaId);
return count;
}
void ioEnd(void)
{
// termination requested flag
gIOTerminate = 1;
// wake up and wait for end
WakeupThread(gIOThreadId);
}
int ioGetPendingRequestCount(void)
{
int count = 0;
struct io_request_t *req = gReqList;
WaitSema(gProcSemaId);
while (req) {
count++;
req = req->next;
}
SignalSema(gProcSemaId);
return count;
}
int ioHasPendingRequests(void)
{
return gReqList != NULL ? 1 : 0;
}
#ifdef __EESIO_DEBUG
static char tbuf[2048];
#endif
int ioPrintf(const char *format, ...)
{
if (isIORunning == 1)
WaitSema(gIOPrintfSemaId);
va_list args;
va_start(args, format);
#ifdef __EESIO_DEBUG
int ret = vsnprintf((char *)tbuf, sizeof(tbuf), format, args);
sio_putsn(tbuf);
#else
int ret = vprintf(format, args);
#endif
va_end(args);
if (isIORunning == 1)
SignalSema(gIOPrintfSemaId);
return ret;
}
int ioBlockOps(int block)
{
ee_thread_status_t status;
int ThreadID;
if (block && !isIOBlocked) {
isIOBlocked = 1;
ThreadID = GetThreadId();
ReferThreadStatus(ThreadID, &status);
ChangeThreadPriority(ThreadID, 90);
// wait for all io to finish
while (ioHasPendingRequests()) {
};
ChangeThreadPriority(ThreadID, status.current_priority);
// now all io should be blocked
} else if (!block && isIOBlocked) {
isIOBlocked = 0;
}
return IO_OK;
}
```
|
The canton of Le Moule is an administrative division of Guadeloupe, an overseas department and region of France. It was created at the French canton reorganisation which came into effect in March 2015. Its seat is in Le Moule.
It consists of the following communes:
Le Moule
References
Cantons of Guadeloupe
|
South Carolina Highway 73 (SC 73) was a primary state highway in the U.S. state of South Carolina. Established five times in the state, from 1926 to 2006, its last routing was along Ocean Boulevard, in Myrtle Beach, a popular stretch of road lined with hotels, shops, tourist sites and access to the beach.
Route description
SC 73 began and ended at US 17 Bus., with the southern terminus at Springmaid Beach and the northern terminus in the northern part of Myrtle Beach.
Ocean Boulevard is a major point during the annual Bi-Lo Marathon; full and half marathon runners head south during the first loop of the course, and for full marathon runners only, they head northbound for the second loop. Together, about nine miles (14 km) of the entire marathon course is run on Ocean Boulevard.
History
SCDOT handed SC 73 over to the city of Myrtle Beach in the 1990s and is no longer an official state route. As such, the route is no longer signed and, as of 2008, the route no longer appears on the official state highway map.
Major intersections
References
External links
Mapmikey's South Carolina Highways Page: SC 73
Mapmikey's South Carolina Highways Page: SC 73 Alt
073
Roads in Myrtle Beach, South Carolina
Transportation in Horry County, South Carolina
|
```objective-c
/* Support for embedding graphical components in a buffer.
This file is part of GNU Emacs.
GNU Emacs is free software: you can redistribute it and/or modify
your option) any later version.
GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with GNU Emacs. If not, see <path_to_url */
#ifndef XWIDGET_H_INCLUDED
#define XWIDGET_H_INCLUDED
#include "lisp.h"
struct glyph_matrix;
struct glyph_string;
struct xwidget;
struct xwidget_view;
struct window;
#ifdef HAVE_XWIDGETS
# include <gtk/gtk.h>
struct xwidget
{
union vectorlike_header header;
/* Auxiliary data. */
Lisp_Object plist;
/* The widget type. */
Lisp_Object type;
/* The buffer where the xwidget lives. */
Lisp_Object buffer;
/* A title used for button labels, for instance. */
Lisp_Object title;
/* Here ends the Lisp part. "height" is the marker field. */
int height;
int width;
/* For offscreen widgets, unused if not osr. */
GtkWidget *widget_osr;
GtkWidget *widgetwindow_osr;
/* Kill silently if Emacs is exited. */
bool_bf kill_without_query : 1;
};
struct xwidget_view
{
union vectorlike_header header;
Lisp_Object model;
Lisp_Object w;
/* Here ends the lisp part. "redisplayed" is the marker field. */
/* If touched by redisplay. */
bool redisplayed;
/* The "live" instance isn't drawn. */
bool hidden;
GtkWidget *widget;
GtkWidget *widgetwindow;
GtkWidget *emacswindow;
int x;
int y;
int clip_right;
int clip_bottom;
int clip_top;
int clip_left;
long handler_id;
};
#endif
/* Test for xwidget pseudovector. */
#define XWIDGETP(x) PSEUDOVECTORP (x, PVEC_XWIDGET)
#define XXWIDGET(a) (eassert (XWIDGETP (a)), \
(struct xwidget *) XUNTAG (a, Lisp_Vectorlike))
#define CHECK_XWIDGET(x) \
CHECK_TYPE (XWIDGETP (x), Qxwidgetp, x)
/* Test for xwidget_view pseudovector. */
#define XWIDGET_VIEW_P(x) PSEUDOVECTORP (x, PVEC_XWIDGET_VIEW)
#define XXWIDGET_VIEW(a) (eassert (XWIDGET_VIEW_P (a)), \
(struct xwidget_view *) XUNTAG (a, Lisp_Vectorlike))
#define CHECK_XWIDGET_VIEW(x) \
CHECK_TYPE (XWIDGET_VIEW_P (x), Qxwidget_view_p, x)
#define XG_XWIDGET "emacs_xwidget"
#define XG_XWIDGET_VIEW "emacs_xwidget_view"
#ifdef HAVE_XWIDGETS
void syms_of_xwidget (void);
bool valid_xwidget_spec_p (Lisp_Object);
void xwidget_view_delete_all_in_window (struct window *);
void x_draw_xwidget_glyph_string (struct glyph_string *);
struct xwidget *lookup_xwidget (Lisp_Object spec);
void xwidget_end_redisplay (struct window *, struct glyph_matrix *);
void kill_buffer_xwidgets (Lisp_Object);
#else
INLINE_HEADER_BEGIN
INLINE void syms_of_xwidget (void) {}
INLINE bool valid_xwidget_spec_p (Lisp_Object obj) { return false; }
INLINE void xwidget_view_delete_all_in_window (struct window *w) {}
INLINE void x_draw_xwidget_glyph_string (struct glyph_string *s) { eassume (0); }
INLINE struct xwidget *lookup_xwidget (Lisp_Object obj) { eassume (0); }
INLINE void xwidget_end_redisplay (struct window *w, struct glyph_matrix *m) {}
INLINE void kill_buffer_xwidgets (Lisp_Object buf) {}
INLINE_HEADER_END
#endif
#endif /* XWIDGET_H_INCLUDED */
```
|
```ruby
class NicotinePlus < Formula
include Language::Python::Virtualenv
desc "Graphical client for the Soulseek peer-to-peer network"
homepage "path_to_url"
url "path_to_url"
sha256 your_sha256_hash
license "GPL-3.0-or-later"
head "path_to_url", branch: "master"
bottle do
rebuild 1
sha256 cellar: :any_skip_relocation, arm64_sonoma: your_sha256_hash
sha256 cellar: :any_skip_relocation, arm64_ventura: your_sha256_hash
sha256 cellar: :any_skip_relocation, arm64_monterey: your_sha256_hash
sha256 cellar: :any_skip_relocation, sonoma: your_sha256_hash
sha256 cellar: :any_skip_relocation, ventura: your_sha256_hash
sha256 cellar: :any_skip_relocation, monterey: your_sha256_hash
sha256 cellar: :any_skip_relocation, x86_64_linux: your_sha256_hash
end
depends_on "adwaita-icon-theme"
depends_on "gtk4"
depends_on "libadwaita"
depends_on "py3cairo"
depends_on "pygobject3"
depends_on "python@3.12"
on_linux do
depends_on "gettext" => :build # for `msgfmt`
end
conflicts_with "httm", because: "both install `nicotine` binaries"
def install
virtualenv_install_with_resources
end
test do
# nicotine is a GUI app
assert_match version.to_s, shell_output("#{bin}/nicotine --version")
end
end
```
|
Brendan Kyle Hatcher is a United States diplomat who was called "the most closely surveilled American in Russia" by ABC News Investigative Reporter Brian Ross in a September 2009 investigative report. Hatcher gained notoriety in August 2009 after the Russian tabloid Komsomolskaya Pravda, a newspaper which Russian intelligence expert Andrei Soldatov ties to the Federal Security Services (FSB) of the Russian Federation, showed a video of him while accusing him of being an undercover CIA agent in Russia. The media reports were quickly condemned by investigating authorities in the U.S. as fabricated.
Media coverage
According to Eli Lake of The Washington Times, Hatcher became one of several American diplomats and journalists to be attacked and falsely accused of "gross sexual imposition in a moving vehicle" between 2007 and 2011 after the Obama Administration's "reset" with Russia. Hatcher served as Political Officer who worked to promote human rights and freedom of religion in Russia from 2008 to 2010. He was awarded in June 2010 by the State Department for his "courage and character, commitment to excellence, and support of human rights and religious freedom in spite of exceedingly difficult circumstances and personal hardship." As part of his job, Hatcher would meet with opposition figures, government officials, NGOs, journalists, and religious leaders to promote human rights and religious equality. Hatcher was fully exonerated by the media and State Department, and he was lauded by his colleagues for heroism.
On August 6, 2009, Russian media sources with links to the FSB (the successor organization to the KGB of the Soviet Union) released real video images and pictures of Hatcher that had been spliced with images of another person. The doctored images emerged just one month after the first presidential summit between U.S. President Barack Obama and Russian President Dmitry Medvedev which prominently featured discussions on human rights and corruption. The Ambassador of the Embassy of the United States in Moscow, John Beyrle, issued a formal protest to the Russian government, stating that the Russian media reports about Hatcher were completely untrue and had no place in the development of better relations between the two superpowers. Despite Beyrle's protest, neither Hatcher nor the U.S government received an apology from Russian officials for the "smear campaign."
On September 23, 2009, ABC News ran an investigative piece on Nightline concerning the "smear campaign" against Hatcher, including the interview with Ambassador Beyrle. During the interview, Beyrle stated that Hatcher was 100% innocent of any wrongdoing. Beyrle had previously awarded Hatcher in May 2009 for his success in promoting freedom of religion and human rights in Russia, and commented that an element in Russia had attacked Hatcher to discredit him and his work as well as prevent the two countries from developing closer ties. Soldatov further noted that only Russian intelligence agents would be interested in smearing Hatcher to force his dismissal from Russia.
In the course of the segment, retired FBI Counterintelligence Officer and Russian intelligence services expert David Majors pointed out that the video segments had been doctored to smear Hatcher and to reduce his effectiveness at his job. Major pointed out obvious flaws in the video sequence and assessed that the false media reports were a "dirty trick," constituting a failed attempt to frame Hatcher and ruin his reputation as a change agent in the human rights activist community.
On September 24, 2009, State Department spokesperson Ian Kelly called Hatcher "one of our best" diplomats, and confirmed that Hatcher had been smeared with false media reports to discredit his work promoting human rights and religious freedom. Kelly noted that the State Department deplored this type of activity by the Russians at a time when diplomats like Hatcher were working to improve bilateral relations.
In the February 19, 2017, episode of HBO series Last Week Tonight, host John Oliver called the FSB fake tape "ridiculous" as part of his larger commentary on the lengths to which the Kremlin will go to discredit its opponents.
Prior to his service in the diplomatic corps, Hatcher served as an intelligence analyst with the Department of the Treasury, Office of Intelligence and Analysis, where he focused on fighting the sources of terrorism financing. In the summer of 2004, Hatcher conducted research for the Center for East Asian Studies in Vladivostok, Russia, where he focused on Russian attitudes towards Chinese migrants. He later presented and published a paper detailing his findings, which included a scathing commentary about Russian racism and xenophobia. Prior to his research in Russia, Hatcher worked in the private sector as a business manager, and he served in the Peace Corps as a volunteer in Kazakhstan (part of the former Soviet Union) where he taught economics at the Taraz Polytechnical College in Taraz, Kazakhstan. Former Soviet officials have long been skeptical of the Peace Corps as a cover for US spies, evidenced by Russia's decision to kick out the Peace Corps in 2002.
Personal background and honors
Hatcher hails from Nashville, Tennessee and attended Montgomery Bell Academy, famous as the source for the blockbuster film Dead Poets Society. In 1997, Hatcher graduated from the University of Georgia, which honored him as one of its top 40 under 40 graduates in 2013. In 2005, Hatcher received his masters from the Middlebury Institute of International Studies at Monterey (MIIS), where he delivered the student commencement address alongside Russian scientist Roald Sagdeev and philanthropist Susan Eisenhower. The U.S. Government honored him as a Presidential Management Fellow in 2005.
References
American diplomats
Diplomatic incidents
Living people
Middlebury College alumni
Diplomats from Nashville, Tennessee
University of Georgia alumni
Year of birth missing (living people)
|
```c
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <sys/time.h>
#define NAME "asin"
#define ITERATIONS 1000000
#define REPEATS 3
/**
* Prints the TAP version.
*/
static void print_version( void ) {
printf( "TAP version 13\n" );
}
/**
* Prints the TAP summary.
*
* @param total total number of tests
* @param passing total number of passing tests
*/
static void print_summary( int total, int passing ) {
printf( "#\n" );
printf( "1..%d\n", total ); // TAP plan
printf( "# total %d\n", total );
printf( "# pass %d\n", passing );
printf( "#\n" );
printf( "# ok\n" );
}
/**
* Prints benchmarks results.
*
* @param elapsed elapsed time in seconds
*/
static void print_results( double elapsed ) {
double rate = (double)ITERATIONS / elapsed;
printf( " ---\n" );
printf( " iterations: %d\n", ITERATIONS );
printf( " elapsed: %0.9f\n", elapsed );
printf( " rate: %0.9f\n", rate );
printf( " ...\n" );
}
/**
* Returns a clock time.
*
* @return clock time
*/
static double tic( void ) {
struct timeval now;
gettimeofday( &now, NULL );
return (double)now.tv_sec + (double)now.tv_usec/1.0e6;
}
/**
* Generates a random number on the interval [0,1).
*
* @return random number
*/
static double rand_double( void ) {
int r = rand();
return (double)r / ( (double)RAND_MAX + 1.0 );
}
/**
* Runs a benchmark.
*
* @return elapsed time in seconds
*/
static double benchmark( void ) {
double elapsed;
double x;
double y;
double t;
int i;
t = tic();
for ( i = 0; i < ITERATIONS; i++ ) {
x = ( 2.0*rand_double() ) - 1.0;
y = asin( x );
if ( y != y ) {
printf( "should not return NaN\n" );
break;
}
}
elapsed = tic() - t;
if ( y != y ) {
printf( "should not return NaN\n" );
}
return elapsed;
}
/**
* Main execution sequence.
*/
int main( void ) {
double elapsed;
int i;
// Use the current time to seed the random number generator:
srand( time( NULL ) );
print_version();
for ( i = 0; i < REPEATS; i++ ) {
printf( "# c::%s\n", NAME );
elapsed = benchmark();
print_results( elapsed );
printf( "ok %d benchmark finished\n", i+1 );
}
print_summary( REPEATS, REPEATS );
}
```
|
Kevin Wright may refer to:
Kevin Wright (cricketer) (born 1953), Australian cricketer
Kevin Wright (Australian footballer) (1933–2003), Australian rules footballer
Kevin Wright (footballer, born 1995), Sierra Leonean footballer
Kevin Wright (producer)
|
Grant Ian Brebner (born 6 December 1977) is a Scottish football coach and former player who was the head coach at Australian side Melbourne Victory. Born in Edinburgh, Brebner joined Manchester United as a 16-year-old in 1994. While at Manchester United, he broke into the Scotland under-21 team, making 17 appearances between 1997 and 1999; however, he was unable to find a place in the Manchester United first team and was loaned out to Cambridge United and Hibernian, before being sold to Reading for £300,000 in 1998. He then returned to Hibernian on a permanent basis, and made more than 100 appearances in a five-year stint there that included a loan spell with Stockport County. In August 2004, he was transferred to Dundee United, before moving to Australia to play for Melbourne Victory. After six years with Melbourne Victory, he joined Victorian Premier League side Moreland Zebras. He returned to Melbourne Victory as an assistant coach in 2020, before assuming the position of manager later that year, where he served until being dismissed from the position in April 2021.
Club career
Early career
On leaving school in 1994, Brebner signed for Manchester United as an apprentice, playing in the FA Youth Cup winning side of 1995 and turning professional soon after. FourFourTwo magazine hailed him as the latest big talent to be produced by Manchester United's youth system.
After four years in United's youth and reserve teams, Brebner was loaned to Cambridge United, where he scored his first senior goal while making six appearances. A further loan spell was spent back in Edinburgh at Hibernian, where Brebner suffered relegation at the end of the 1997–98 season.
Brebner was then transferred permanently to Reading at the start of the 1998–99 season. He was already 21 years old, but had never played a single first-team game for Manchester United. During his time at Reading, he scored 10 goals in 41 league games. He was also responsible for scoring the first ever goal at the Madejski Stadium, but he suffered from homesickness during his time at the club.
Scotland
After just one season with Reading, Brebner returned to Hibernian on a permanent deal. Brebner moved on loan again to Stockport County during the 2000–01 season, but then established himself in the Hibs first team, playing in the 2001 Scottish Cup Final and the UEFA Cup. Brebner scored a hat-trick against future employers Dundee United in a Scottish Cup match in February 2003. He was latterly club captain at Hibs, and was a senior player in the side with young stars like Kevin Thomson and Scott Brown.
Brebner was surprisingly transferred to Dundee United in August 2004, despite having just signed a three-year contract with Hibs. He missed just three matches in his first season with United and scored seven times from 64 appearances in all for United. Following a change in management at the club, however, Brebner was informed by his new manager Craig Brewster in April 2006 that he would be allowed to leave the club at the end of the 2005–06 season.
Melbourne Victory
On 26 May 2006, Brebner was reported by BBC Sport to be attracting interest from Melbourne Victory. He subsequently flew to Australia for talks with the A-League club. Brebner came on as a trialist and scored for Victory with seconds remaining, in the QNI North Queensland Challenge Trophy game versus Central Coast Mariners on 18 June. Securing a 2–2 draw, Brebner then scored the winning penalty to seal a 4–2 shoot-out win. On Brebner's performance, Victory manager Ernie Merrick said: "There's not too much more you can do when you're on trial than come in and win the game, is there?". In Victory's second match on 20 June, Brebner completed the full 90 minutes, playing in a 3–1 win over Chinese team Changchun Yatai. Brebner completed a successful trial period by netting a 28-yard free-kick as Victory won the trophy with a 6–1 win over the Chinese team in the final, on 24 June.
On the back of his impressive displays during his trial, Brebner was signed to a full-time contract with the Melbourne Victory, having agreed on a deal to be released from his Dundee United contract. In his first season, he helped the Victory win the 2006–07 A-League premiership with five rounds remaining. The round 19 clash with Perth Glory away at Members Equity Stadium saw Brebner take the captain's armband for the first time in the absence of regular captain Kevin Muscat and vice-captain Archie Thompson. He scored the last of the five goals against Newcastle Jets in round 3 of the 2008–09 season. This was his second goal for the club, after scoring a late winner against Perth Glory in the 2006–07 season.
Brebner received Australian residency status at the start of 2009, which meant he no longer counted towards the Victory's overseas player quota.
Betting controversy
In December 2008, Brebner was fined A$5,000 and banned for four matches after betting on Victory to lose an AFC Champions League match against Chonburi. Brebner, who won under $550 in the bet, was not part of the squad. Craig Moore and Kevin Muscat were also fined after betting on matches not involving their own clubs. Brebner had previously confessed to being a gambling addict, losing more than £100,000, and received professional help for his addiction.
Managerial career
In 2013, Brebner took over the management of the football teams at Mazenod College in Mulgrave, Victoria, while also playing for the local club side, Mazenod United. Later that year, he took over as manager of Richmond SC, but resigned in April 2014. In 2020, he returned to Melbourne Victory as the club's assistant manager under interim coach Carlos Pérez Salvachúa, he was later appointed as the Victory's caretaker manager upon the departure of the latter. On 24 August 2020, Brebner was appointed as Melbourne Victory's manager. Brebner's tenure as Melbourne Victory manager coincided with the worst run of results in Melbourne Victory's history. He was sacked as head coach shortly after Victory's 7–0 loss to local rivals Melbourne City in April 2021, a result which came only a month and a half after losing 6–0 to the same team.
Brebner possesses a UEFA A License.
Career statistics
Managerial statistics
Honours
Melbourne Victory
A-League Championship: 2006–07, 2008–09
A-League Premiership: 2006–07, 2008–09
References
External links
1977 births
Living people
Scottish men's footballers
Manchester United F.C. players
Cambridge United F.C. players
Hibernian F.C. players
Reading F.C. players
Stockport County F.C. players
Dundee United F.C. players
Melbourne Victory FC players
English Football League players
Scottish Football League players
Scottish Premier League players
A-League Men players
Scottish expatriate men's footballers
Scottish expatriate sportspeople in Australia
Footballers from Edinburgh
Scotland men's under-21 international footballers
Men's association football midfielders
Lothian Thistle Hutchison Vale F.C. players
Scottish expatriate football managers
Expatriate men's soccer players in Australia
Expatriate soccer managers in Australia
A-League Men managers
Melbourne Victory FC managers
Brunswick Juventus FC players
Naturalised soccer players of Australia
|
```java
package org.lognet.springboot.grpc.auth;
import com.google.protobuf.Empty;
import io.grpc.Metadata;
import io.grpc.ServerCall;
import io.grpc.ServerCallHandler;
import io.grpc.ServerInterceptor;
import io.grpc.Status;
import io.grpc.StatusRuntimeException;
import io.grpc.examples.SecuredGreeterGrpc;
import org.hamcrest.Matchers;
import org.junit.Assert;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.lognet.springboot.grpc.GRpcErrorHandler;
import org.lognet.springboot.grpc.GRpcGlobalInterceptor;
import org.lognet.springboot.grpc.GrpcServerTestBase;
import org.lognet.springboot.grpc.demo.DemoApp;
import org.lognet.springboot.grpc.security.AuthCallCredentials;
import org.lognet.springboot.grpc.security.AuthHeader;
import org.lognet.springboot.grpc.security.GrpcSecurity;
import org.lognet.springboot.grpc.security.GrpcSecurityConfigurerAdapter;
import org.springframework.boot.test.context.SpringBootTest;
import org.springframework.boot.test.context.TestConfiguration;
import org.springframework.boot.test.mock.mockito.SpyBean;
import org.springframework.context.annotation.Bean;
import org.springframework.context.annotation.Import;
import org.springframework.security.core.userdetails.User;
import org.springframework.security.provisioning.InMemoryUserDetailsManager;
import org.springframework.test.context.junit4.SpringRunner;
import java.nio.ByteBuffer;
import java.nio.charset.StandardCharsets;
import static org.hamcrest.MatcherAssert.assertThat;
import static org.mockito.ArgumentMatchers.any;
import static org.mockito.ArgumentMatchers.eq;
import static org.mockito.Mockito.verify;
import static org.mockito.Mockito.verifyZeroInteractions;
@SpringBootTest(classes = DemoApp.class)
@RunWith(SpringRunner.class)
@Import({SecurityInterceptorTest.TestCfg.class})
public class SecurityInterceptorTest extends GrpcServerTestBase {
@TestConfiguration
static class TestCfg extends GrpcSecurityConfigurerAdapter {
@Override
public void configure(GrpcSecurity builder) throws Exception {
builder.authorizeRequests()
.withSecuredAnnotation()
.userDetailsService(new InMemoryUserDetailsManager(
User.withDefaultPasswordEncoder()
.username("user")
.password("user")
.authorities("SCOPE_profile")
.build()
));
}
@GRpcGlobalInterceptor
@Bean
public ServerInterceptor customInterceptor(){
return new ServerInterceptor() {
@Override
public <ReqT, RespT> ServerCall.Listener<ReqT> interceptCall(ServerCall<ReqT, RespT> call, Metadata headers, ServerCallHandler<ReqT, RespT> next) {
if(SecuredGreeterGrpc.getSayAuthHello2Method().equals(call.getMethodDescriptor())) {
final Status status = Status.ALREADY_EXISTS;
call.close(status, new Metadata());
throw status.asRuntimeException();
}
return next.startCall(call,headers);
}
};
}
}
@Test
public void originalCustomInterceptorStatusIsPreserved() {
final StatusRuntimeException statusRuntimeException = Assert.assertThrows(StatusRuntimeException.class, () -> {
SecuredGreeterGrpc.newBlockingStub(selectedChanel)
.withCallCredentials(userCredentials())
.sayAuthHello2(Empty.newBuilder().build()).getMessage();
});
assertThat(statusRuntimeException.getStatus().getCode(), Matchers.is(Status.Code.ALREADY_EXISTS));
}
@Test
public void unsupportedAuthSchemeShouldThrowUnauthenticatedException() {
AuthCallCredentials callCredentials = new AuthCallCredentials(
AuthHeader.builder()
.authScheme("custom")
.tokenSupplier(() -> ByteBuffer.wrap("dummy".getBytes()))
);
final StatusRuntimeException statusRuntimeException = Assert.assertThrows(StatusRuntimeException.class, () -> {
SecuredGreeterGrpc.newBlockingStub(selectedChanel)
.withCallCredentials(callCredentials)
.sayAuthHello2(Empty.newBuilder().build()).getMessage();
});
assertThat(statusRuntimeException.getStatus().getCode(), Matchers.is(Status.Code.UNAUTHENTICATED));
}
private AuthCallCredentials userCredentials(){
return new AuthCallCredentials(
AuthHeader.builder()
.basic("user","user".getBytes(StandardCharsets.UTF_8))
);
}
}
```
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<androidx.constraintlayout.widget.ConstraintLayout
xmlns:android="path_to_url"
xmlns:tools="path_to_url"
xmlns:app="path_to_url"
android:orientation="vertical"
android:layout_width="match_parent"
android:layout_height="wrap_content">
<LinearLayout
android:layout_width="match_parent"
android:layout_height="wrap_content"
android:orientation="vertical"
android:showDividers="middle"
android:divider="@drawable/space_8dp"
app:layout_constraintStart_toStartOf="parent"
app:layout_constraintEnd_toEndOf="parent"
app:layout_constraintTop_toTopOf="parent">
<TextView
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_gravity="center"
android:text="@string/quest_entrance_reference_reference_label" />
<include
android:layout_width="128dp"
android:layout_height="wrap_content"
android:layout_gravity="center"
layout="@layout/view_entrance_reference" />
<TextView
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_gravity="center"
android:layout_marginTop="8dp"
android:text="@string/quest_entrance_reference_flat_range_label" />
<include
android:layout_width="224dp"
android:layout_height="wrap_content"
android:layout_gravity="center"
layout="@layout/view_entrance_flat_range" />
</LinearLayout>
<Button
android:id="@+id/toggleKeyboardButton"
android:layout_width="64dp"
android:layout_height="56dp"
tools:text="abc"
style="@style/Widget.MaterialComponents.Button.OutlinedButton"
tools:ignore="RtlHardcoded"
app:layout_constraintTop_toTopOf="parent"
app:layout_constraintRight_toRightOf="parent" />
</androidx.constraintlayout.widget.ConstraintLayout>
```
|
The Uproar Festival, also called the Rockstar Energy Drink Uproar Festival, was an annual hard rock and heavy metal tour inaugurated in 2010 by John Reese and sponsored by Rockstar Energy Drink. The tour was also created by John Oakes, Darryl Eaton and Ryan Harlacher from the Creative Artists Agency, and Perry Lavoisne from Live Nation. Reese is also responsible for creating Mayhem Festival and the Taste of Chaos tour. Uproar Festival is the replacement for Reese's Taste of Chaos tour, as he was "running out of bands that fit within the profile of what Taste of Chaos was."
Reese attempted to have Pantera as headliner for a 2015 show, but those plans fell through. The 2014 festival was the last.
2010 line-up
Main Stage
Disturbed
Avenged Sevenfold
Stone Sour
Halestorm
Jägermeister Stage
Hellyeah
Airbourne
Hail the Villain
New Medicine
White Cowbell Oklahoma (for all Canadian dates)
Jägermeister Battle of the Bands Winner
2010 tour dates
2011 line-up
Main Stage
Avenged Sevenfold
Three Days Grace
Seether
Bullet for My Valentine
Escape the Fate
Best Buy Music Gear Stage
Sevendust
Black Tide
Art of Dying
Hell or Highwater
Fozzy (Selected Dates)
Battle of the Bands Winner
2011 tour dates
2012 line-up
Main Stage
Shinedown
Godsmack
Staind
Papa Roach (cancelled after first five dates due to Jacoby Shaddix vocal chords problems, Rock the Rapids show was also cancelled)
Adelitas Way
Ernie Ball Stage
P.O.D. (except 8/25, replaced Papa Roach on the main stage on the Rock the Rapids show)
Fozzy (except 8/19, 8/29 and 9/18)
Mindset Evolution
Candlelight Red
Jägermeister Stage
Deuce
Redlight King (except 9/1 and 9/18)
In This Moment (until 9/2)
Thousand Foot Krutch (started 9/7, except 9/8, 9/15. 9/29 and 9/30)
Greek Fire (select dates only: 8/17, 8/18, 8/19, 8/22, 8/24)
Switchpin (select dates only: 8/17, 8/18, 8/19, 8/22, 8/24, 8/25, 8/26, 8/28)
Cruz (select dates only: 8/19, 8/25, 8/26, 8/28, 8/31, 9/1, 9/2, 9/7)
Silvertung (select dates only: 8/31, 9/1, 9/2)
Uncrowned (select dates only: 9/7, 9/8, 9/9, 9/11, 9/12, 9/13, 9/16, 9/19, 9/29, 9/30)
Within Reason (select dates only: 9/8, 9/9, 9/11, 9/12, 9/13, 9/16)
Attika 7 (select dates only: 9/19, 9/21, 9/22, 9/23, 9/25, 9/29, 9/30)
Drown Mary (select dates only: 9/21, 9/22, 9/23)
2012 tour dates
2013 line-up
Main Stage
Alice in Chains
Jane's Addiction
Coheed and Cambria
Circa Survive
Festival Stage
Walking Papers
Danko Jones
Middle Class Rut
New Politics
The Chuck Shaffer Picture Show
COLDCOCK Spirits Showcase Stage
The Dead Daisies
Beware of Darkness
Charming Liars
2013 tour dates
This show was part of KISW 99.9's Pain In The Grass *
2014 line-up
Main Stage
Godsmack
Seether
Skillet
Buckcherry
Blackstream Stage
Pop Evil
Escape the Fate
Redlight King
These Raven Skies
Tattered
Sons of Revelry
3 Years Hollow
Within Reason
New Medicine
The Reality Of Yourself (T.R.O.Y)
2014 tour dates
References
External links
Rockstar Uproar Irvine Review and Pictures
Heavy metal festivals in Canada
Heavy metal festivals in the United States
2010 concert tours
2011 concert tours
2012 concert tours
2013 concert tours
2014 concert tours
pt:Mayhem Festival
|
"Locked Out of Heaven" is a song by American singer and songwriter Bruno Mars from his second studio album, Unorthodox Jukebox (2012). It was released as the lead single from the album on October 1, 2012. The song was written by Mars, Philip Lawrence and Ari Levine. It was produced by the former three, under their alias, the Smeezingtons along with Mark Ronson, Jeff Bhasker and Emile Haynie. "Locked Out of Heaven" is a reggae rock and pop rock song influenced by new wave and funk. The song's lyrics are about the rapturous feelings brought about by a relationship infused with positive emotion as well as euphoria from sex.
"Locked Out of Heaven" was well received by most critics, some of whom complimented Mars's different musical direction. His vocals were compared to the ones by Sting, while its sound was lauded, with the song being called "interesting" and a "musical evolution". While some critics noted influences from various bands, Mars stated that The Police were the ones who influenced him the most to write the song. The single charted inside the top ten in over twenty countries, including the United States, where it became Mars's fourth number-one single on the Billboard Hot 100, holding the spot for six consecutive weeks, and topping the Canadian Hot 100 for three consecutive weeks. "Locked Out of Heaven" was certified diamond by the Recording Industry Association of America (RIAA) and seven times platinum by the Australian Recording Industry Association (ARIA).
The song's music video was shot by director Cameron Duddy and by Mars. It depicts Mars and his bandmates leisurely engaging in activities such as smoking, drinking and playing games. The singer performed "Locked Out of Heaven" on television shows such as Saturday Night Live and The X Factor and included it on The Moonshine Jungle Tour (2013–14) and the 24K Magic World Tour (2017–18). It was also used at his Super Bowl XLVIII halftime show set list. The song won several awards and received three Grammy nominations. The song has also been covered by various recording artists, including Leona Lewis and Bastille.
Background and production
After his 2010 debut album Doo-Wops & Hooligans, which produced the singles "Just the Way You Are" and "Grenade", Bruno Mars revealed he wanted to create something unexpected with its follow-up. "This is me going into the studio and recording and writing whatever I want," Mars said confidently. "This album represents my freedom." It all started backstage, after a show, during a jamming session in a "greenroom", while singing the phrase "Locked Out of Heaven". According to Philip Lawrence, the track developed a meaning as they started to write it, "when you’re with someone who's showing you a new way to love." The Smeezingtons went to New York to work with Jeff Bhasker, Emile Haynie and Mark Ronson and during a jamming session with drums, bass, and guitar, Mars created the riff of the song. He started singing the chorus previously created on the top of the riff. Then, the production team went back to L.A., where they finished the lyrics and changed the original melody. Lawrence felt that the recording was "sort of empty but it had a carnal vibe to it", making them enthusiastic to place a "driving rhythm" in it. He recalled thinking it was "something special" in the studio, the same way he did during the creation of "Just The Way You Are" and "Billionaire".
Jeff Bhasker, one of the song's producers, explained the track's roots as it "came in the middle of the process of putting together the album". He further elaborated; "We were just having a jam session, tracking some things, and Bruno started playing this groove and making up something on the spot; we all thought it was pretty good. We wound up working a long time on that, trying to get it just right." "Locked Out of Heaven" began as a "cha-cha-style duet", sounding like Santana's "Smooth". Ronson asked the Dap-Kings to collaborate on the track in order to get a "crisply syncopated, locked-in groove." According to Michael Leonhart, he contributed with "Thriller" (1984) vibe horns to the song, however, they didn't make the final version of the track. Regarding the development of the song, the Smeezingtons thought "there's a good pocket on this song right now. Let's keep it going." Mars also mentioned that it took a long time to create it, commenting "People didn't see us going at each other's throats in the studio and pulling out our hair." He added, "Trying to get these drums right and figure out a bass line." Lawrence believes the lack of "heavy hitting drums" and the presence of a small guitar solo allows the song to be carried by Mars.
"Locked Out of Heaven" was written by Mars, Lawrence and Ari Levine. Its production was handled by the former three, under their stage name, the Smeezingtons, alongside Ronson, Bhasker, and Haynie. Bhasker, Mars, Nick Movshon, and Homer Steinweiss played the instruments, with additional assistance by Haynie. The recording was done by Levine, Wayne Gordon, ALALAL and Ronson, while Bob Mallory and Tyler Hartman served as the recording assistants for the latter two. Recording took place at the Levcon Studios in Los Angeles, Daptone Studios in Brooklyn and Avatar Studios in New York. Charles Moniz provided additional engineering to the recording. It was mixed at Larrabee Sound Studios in Hollywood by Manny Marroquin and mastered by David Kutch at The Mastering Place.
Release
According to Ronson, Mars wanted "Locked Out of Heaven" to be the lead single, which he considered a "brave" choice. Aaron Bay-Schuck, Mars's A&R representative at the time, found the track's production to be cutting edge, although admitting that it was not an instant favorite. However, he perceived that "it was something special" but had no idea how to classify it. Bay-Schuck felt the song needed time to grow as "the more you hear it, the more of an earworm it becomes", leading the promotional department to make sure that program directors weren't afraid of playing a track that "sounded different from what was on the radio".
"Locked Out of Heaven" was unveiled digitally and sent to radio airplay on October 1, 2012, as the lead single from Unorthodox Jukebox. It also became available for purchase the following day, and it was officially sent to American contemporary hit radio by Atlantic Records and for radio airplay in Italy by Warner. The label also sent the song to rhythmic contemporary on October 25, 2012. It was made available to purchase as a digital download in Germany on October 3, 2012. In early November 2013, a CD Single was released on Poland, Germany, Austria and Switzerland, it included the album version of "Locked Out of Heaven", as well as a poster and stickers of Bruno Mars. The song was released as an available download on November 21, 2012, in Japan. On November 26, 2012, the song was released as a digital download in the United Kingdom. On January 21, 2013, four remixes were released for download in the UK.
Composition and influences
"Locked Out of Heaven" was composed in the key of D minor, with Mars's vocals ranging from the low note of A3 to the high note of C5. Levine aforementioned that some parts in the song are not instruments as Mars said they needed "a dep-dep-dep-dep sound". Later, Levine told Mars to "sing it into the microphone", where he chopped it up, and despite sounding like an instrument, the sounds are really Mars's voice. The song's composition relies mainly on a "guitar-worthy groove guitar, a soaring sing-along chorus and sexual innuendo galore". It finds Mars singing a confession of a relationship that is so good that he repeats to his love "Your sex takes me to paradise", a verse inspired by Halle Berry; "You make me feel like I've been locked out of heaven for too long/ Can I just stay here, spend the rest of my days here?" he sings. During his Google Hangout on the day of the song's release, Mars was asked by a fan to name his favorite lyrics from the track. Mars picked the phrase "But swimming in your water is something spiritual", and said that the single's exploration of feeling and being in love fits into the "sensual, sensual and sensual" theme of the album.
It has been described as a reggae rock and pop rock track heavily influenced by new wave and funk. Tim Sendra of AllMusic described the song as "a breezy mashup of 'Beat It' (1982), The Police, and Dire Straits." For Paul MacInnes of The Guardian called it "a brazen – but successful – welding of Dire Straits' 'Sultans of Swing' (1978) and 'Can't Stand Losing You' (1978) by the Police." Carl Williott of Idolator found out that "the angular guitars and Mars' Sting-like staccato delivery are heavily indebted to The Police," also seeing "hints of Foster the People on the omnipresent 'eh-eh-eh-eh-ooo' punctuating the beat." Melinda Newman of HitFix commented that the song has a "Police/'80s rock skipping beat plus a touch of The Romantics' 'What I Like About You' (1980)." Mikael Wood of the Los Angeles Times likened it to The Police era Ghost in the Machine (1981) heavily influenced by Human League. Jon Caramanica of The New York Times simply called it "a vivid carbon copy of Zenyatta Mondatta (1980)-era Police."
Though critics have pointed out the song's similarities to some of the hits by the Police, Mars told MTV News that he did not intend to write anything mimicking by the Sting-fronted band. Instead, it came to him out of the blue, one night during his studio sessions prior to recording the Unorthodox Jukebox album. "I don't think it initially tried to sound like anybody else, but I picked up the guitar and just started playing [the song's opening chords]," Mars explained. "That's how it normally works; I'll pick up a guitar and I'll start humming a melody, and I started singing that, and I was up there in Sting-ville, in that register, so that's what you get...". John Marx, a partner in the music division at William Morris Endeavor (WME), who was responsible for managing The Moonshine Jungle Tour said "it's the type of song that really motivates people to purchase a ticket. It has that live element to it; it was a very active track".
Critical reception
The song received generally positive reviews from music critics. Robert Copsey of Digital Spy was positive, giving the song a rating of 5 out of 5 stars, praising the "80s-styled funk beats and wildly infectious percussion", the "singalong chorus may be a hasty reminder that his strength lies in fist-clenching". He also wrote that considered the song "one of the most interesting musical evolutions of 2012." Jody Rosen of Rolling Stone gave the song 3.5 out of 5 stars, writing that "The song is about unbridled passion, but as usual with Mars, the aesthetic is tidy and impeccable, pop songcraft polished to a high-gloss gleam: jittery Police-esque rock-reggae verses that erupt, amid thunder-boom synths, into a steamrolling four-on-the-floor chorus." Carl Williott of Idolator also gave the song a positive review, writing that it "shows an interesting musical evolution," and called the song "interesting" and marks it as a shift for Mars and his style.
Ryan Reed of Paste Magazine called it "a driving pop anthem that moves from a punchy, 'Roxanne'-esque new-wave groove to a soulful, synth-driven chorus." Matt Cibula of PopMatters further explained the track, writing, "It starts out like an early Police single, with some straight-up Reggatta de Blanc syncopation and a shockingly good Sting vocal impression. But the chorus opens up to turn into something less Police-y and more, dare I say it, Bruno Mars-y." Kitty Empire of The Observer wrote that the song "channels the Police, but its 21st-century builds owe as much to rave-pop as they do to producer Mark Ronson. It's an ill-omened meeting that somehow gels." Jason Lipshut of Billboard gave a very positive review, stating that "'Locked out of Heaven' is Mars's best solo single to date, with the singer-songwriter yelping about fornication as a tossed salad of chopped guitars and vocal exclamations buttress his sumptuous leading-man act. Sometimes, the perfect lead single is hard to find; other times, it walks right up to you and delivers a big, cozy hug." Melinda Newman of HitFix praised "Mars' singing and the catchy little background vocals," which according to her, "keep the song moving downstream at a rapid pace." She also noted that "Even clumsy lyrics like 'your sex takes me to paradise' can't diminish that joy that the beats and melody bring."
Accolades
"Locked Out of Heaven" received several nominations, including Outstanding Song at the 2013 NAACP Image Awards. It was nominated for Top Radio Song and Top Pop Song at the 2013 Billboard Music Awards. The single received a nomination at the 2013 MTV Millennial Awards for International Hit of the Year. In the same year, "Locked Out of Heaven" received the accolade for Top 10 Gold International Gold Songs at the RTHK International Pop Poll. It also received a nomination for Choice Single: Male Artist award at the 2013 Teen Choice Awards. At the 2013 MTV Europe Music Awards, it won the award Best Song, the only category it was nominated. In December 2013, the song was nominated at Los Premios 40 Principales 2013 for Best International Song. The song was one of the several winners of the 2014 ASCAP Pop Music Awards for Most Performed Songs. In 2014, "Locked Out of Heaven" received nominations for Record of the Year, Song of the Year and Best Remixed Recording, Non-Classical for its Sultan + Ned Shepard remix at the 56th Annual Grammy Awards, but did not win for any. In 2015, the recording was also nominated for Outstanding Creative Achievement in the category of Record Production/Single or Track at the TEC Awards. The Village Voices annual year-end Pazz & Jop critics' poll selected it as the 25th best song of 2012, tying with five other songs.
Commercial performance
North America
In the United States, "Locked Out of Heaven" debuted at number 34 on the Billboard Hot 100 and sold 92,000 copies in its first week. In its fourth week, on the chart, "Locked Out of Heaven" climbed to number seven, becoming Mars's ninth Hot 100 top 10 in only in two years. On December 22, 2012, the song replaced Rihanna's "Diamonds" on top of the Billboard Hot 100 chart, becoming Mars's fourth Hot 100 topper since his arrival in 2010. This ascension to the top marked the fastest collection of a male artist's first four number-ones in 48 years, only surpassed by Bobby Vinton. "Locked Out of Heaven" charted for a second consecutive week atop the Hot 100, with Mars becoming one of nine male soloists in the Hot 100's 54-year history to tally at least two weeks on top with each of his first four leaders. On its third consecutive week on the top, the song was the first to lead all the four tallies (Hot 100, Radio Songs, Digital Songs, On-Demand Songs) simultaneously. The song spent six consecutive weeks at the top, becoming the second longest-reigning of Mars's eight number-one singles (since surpassed by "Uptown Funk", which topped the chart for fourteen consecutive weeks in 2015).
On the Mainstream Top 40 chart, "Locked Out of Heaven" debuted at number 26, extending a streak begun with his featured single, "Nothin' on You", in 2011, and marking the longest such career-opening streak among male artists in the chart's 20-year history. When "Locked Out of Heaven" climbed to number seven in its sixth week on the Radio Songs it became his ninth consecutive top ten, also in a streak beginning with the aforementioned song. It extended his record among men. The song also debuted on the Adult Pop Songs at number 26, marking the highest entrance by a solo male since Rob Thomas debuted at number 20 with "Lonely No More". "Locked Out of Heaven" was certified diamond by the Recording Industry Association of America (RIAA). As of December 16, 2012, the song became the first track to be streamed more than a million times in a one-week period on Spotify. In the same week, it also became the most-streamed in Spotify's history at the time. In Canada, the song peaked at number one on Canadian Hot 100, becoming Mars's third single to reach number one on the chart, spending three consecutive weeks atop the chart. It also peaked at number one on Canada AC and was certified five times platinum by Music Canada (MC).
Europe and Oceania
"Locked Out of Heaven" made its first chart appearance in Spain and France on October 6, 2012, where it debuted at number 35 and 85, respectively. In Spain and France, the song kept fluctuating on the chart for the next couple of weeks, until it peaked at number three in both countries. In the UK, the song peaked at number two, on the week ending 24 November 2012. It has reached a total of 1,109,451 combined sales (863,122 purchases and 246,329 streaming-equivalent sales) in the United Kingdom as of September 2017 and was certified three times platinum by the British Phonographic Industry (BPI). In Italy, the song peaked at number three and was certified three times platinum by the Federazione Industria Musicale Italiana (FIMI). "Locked Out of Heaven" became Mars's fifth top-fifteen single in Denmark, peaking at number two. The single peaked at number seven in Germany. It peaked at number six in Sweden and was certified three times platinum by the Swedish Recording Industry Association (GLF).
"Locked Out of Heaven" entered the New Zealand Singles Chart at number 23 on October 15, 2012. After five weeks the song entered the top ten, at number eight, remaining for two weeks. Eventually, the song peaked at number four after four weeks. The single has received a double-platinum certification from the Recording Industry Association of New Zealand (RMNZ), denoting sales of 30,000 copies. "Locked Out of Heaven" debuted at number 21 on the Australian Singles Chart on October 21, 2012. The song reached a peak of number four on November 11, 2012. It was certified seven times platinum by the Australian Recording Industry Association (ARIA).
Music video
Development
Cameron Duddy affirmed he gave Mars various "wacky story lines". Nevertheless, the singer wanted to record a "performance video" as it demonstrated a "hard-rocking image". The music video was filmed using "an old VHS camera", with Mars and The Hooligans performing, and playing along with the single live multiple times. This allowed Duddy to record the "feel of a live performance". He added that Mars "wanted it to feel as if someone's dad filmed it". Mars said, "The concept is just old-fashioned fun. No story line, it's not me singing to a girl, you get a good sense of what you're going to get live ... It's very VHS-y. I love that man, it takes me back to my childhood, when the tracking is off and the color is off, there's a beauty in that."
Synopsis
The song's music video was directed by Duddy and Mars and was released on October 15, 2012. The concept of the video shows Mars having a good time with his bandmates, doing things like smoking, drinking beer and playing games. He is also seen singing the song with his band at a club. The video has a vintage style reminiscent of VHS tapes.
Hugh McIntire of Billboard explained the video, writing, "Everything about "Locked Out of Heaven" – whether it be the video or the track itself – is retro. While the song references the early discography of The Police, the video takes us back a little bit further. From the style of their dress and the wonky-TV effects on the video, one might guess that Bruno and his friends are partying in the '70s. Only the Akai MPC sampler being played by a band member reminds the viewer that this video is, in fact, modern."
Reception
Idolator reviewer Sam Lansky wrote that Mars is "serving up all kinds of retro flavor in the clip for that song, which eschews the higher-concept vibe of his other videos (dancing monkeys in 'The Lazy Song') for a mellower vibe", adding that the video is "all filtered with Instagram-evoking effects that give it the grainy feel of an old tape." Rolling Stone, commented that the video takes place "in a dingy club", however, "the real attraction here are the grainy visuals filmed in fake fuzziness, giving the clip a retro feel." Chris Martins of Spin magazine said the video's vintage style "may be slightly off since the [song] sounds far more Sting than Curtis Mayfield", but regarded it as "a good one nonetheless."
The music video for the song received multiple awards and nominations. In 2013, it received a nomination for Outstanding Music Video at the NAACP Image Award. At the 2013 MTV Video Music Awards Japan, the visual received three nominations for Best Male Video, Video of the Year and Best Karaokee! Song. It also received nominations for Video of the Year, Best Pop Video and Best Male Video, winning the latter at the 2013 MTV Video Music Awards. The video received a nomination for Best International Video, a category decided by a Jury at the 2013 Los Premios Principales.
Live performances
Mars first performed the song live on Saturday Night Live on October 20, 2012. His performance was well-received by critics. Rolling Stone magazine wrote, "With a little oomph, a whole lotta shimmy-shimmy-ya and a few hip swivels, Bruno's ska-bop jam was given new life. It all seems so effortless; so cool and fresh; pop performances don't often fall ahead of the curve, but this one does." Sam Lansky of Idolator praised the performance, writing that "Mars turned it out on the show, with an energetic rendition of 'Locked Out of Heaven' backed by a fleet of impeccably choreographed dancers." A live performance was also done on the ninth UK series of The X Factor on November 25, 2012. On December 4, Mars performed on the Victoria's Secret Fashion Show, aired on CBS. His performance happened during the Calendar Girls segment. Mars performed the song at the Jingle Bell Ball at London's The O2 Arena on December 8. On December 13, he performed "Locked Out of Heaven" on the second US season of The X Factor.
Mars also performed the song with Sting at the 2013 Grammy Awards, and was later joined by Rihanna, Ziggy Marley and Damian Marley to pay tribute to reggae legend Bob Marley. It was played as the twelfth or fifteenth track on the set list of his second tour, The Moonshine Jungle Tour (2013–14), and as an encore on his debut concert residency, Bruno Mars at The Chelsea, Las Vegas (2013–15). On February 2, 2014, the single was featured as the third number in the mini-set medley, in the halftime performance of Super Bowl XLVIII at MetLife Stadium in New Jersey. During The Late Late Show with James Corden on December 13, 2016, Mars included "Locked Out of Heaven" on the popular segment Carpool Karaoke. On his third tour, the 24K Magic World Tour (2017–18), "Locked Out of Heaven" was the fourteenth or fifteenth track of the setlist, in the latter case sang as an encore.
Cover versions and usage in other media
British quartet Bastille covered "Locked Out of Heaven" for BBC Radio 1 DJ Sara Cox in the Live Lounge on January 21, 2013. The band's version saw a mash-up between the track and Rihanna's "Diamonds"; also incorporating "Niggas in Paris" by Jay-Z and Kanye West and "Angels" by The xx. The female members of the New Directions glee club covered the song in the "Sadie Hawkins" episode of Glee. English singer Leona Lewis included an acoustic version of "Locked Out of Heaven" on the set-list for her 2013 concert tour, Glassheart Tour. American singer Bridgit Mendler covered an acoustic version of the song for her online series called The Hurricane Sessions and the official video of her cover was uploaded on YouTube on May 15, 2013. The video received nearly 500,000 views in its first week, landing herself in the 46th position of Billboard Social 50 Artists. English singer Amelia Lily performed the song in her set on the Girls Aloud Ten: The Hits Tour in 2013 and during her summer gigs. The duo Major Lazer produced a remix of the song that was include on the Target Edition and later on the deluxe edition of Unorthodox Jukebox. The song also appeared on multiple Nissan Car commercials that debuted in April 2013. "Locked Out of Heaven" was also used on commercials for Toyota and Samsung. The song appears in the dance rhythm game Just Dance 2023 Edition.
Formats and track listing
Digital download
"Locked Out of Heaven" – 3:53
CD single
"Locked Out of Heaven" – 3:53
Extras: Bruno Mars Poster / Stickers
Digital download – Remixes
"Locked Out of Heaven" – 6:41
"Locked Out of Heaven" – 6:50
"Locked Out of Heaven" – 4:02
"Locked Out of Heaven" – 5:17
Personnel
Credits adapted from the liner notes of Unorthodox Jukebox.
Bruno Mars – lead vocals, songwriting, guitar
Philip Lawrence – songwriting
Ari Levine – songwriting, recording
The Smeezingtons – production
Mark Ronson –production, performer as DJ Shit, recording
Jeff Bhasker – production, keyboards
Emile Haynie – production, additional drums, keys, FX
Nick Movshon – bass
Homer Steinweiss – drums
Artie Smith – gear and vibes
ALALAL – recording
Wayne Gordon – recording
Bob Mallory – recording assistant
Tyler Hartman – recording assistant
Charles Moniz – additional engineer
Manny Marroquin – mixing
David Kutch – mastering
Charts
Weekly charts
Year-end charts
Decade-end charts
Certifications
Release history
See also
List of best-selling singles in Australia
List of best-selling singles in the United States
List of Billboard Hot 100 number-one singles of 2012
List of Billboard Hot 100 number-one singles of 2013
List of Billboard Rhythmic number-one songs of the 2010s
List of Hot 100 number-one singles of 2012 (Canada)
List of Hot 100 number-one singles of 2013 (Canada)
List of Mainstream Top 40 number-one hits of 2012 (U.S.)
List of Mainstream Top 40 number-one hits of 2013 (U.S.)
List of number-one singles of 2010 (Hungary)
List of number-one singles of 2013 (Poland)
References
External links
2012 singles
Bruno Mars songs
American pop rock songs
American reggae songs
Song recordings produced by the Smeezingtons
Songs written by Bruno Mars
Songs written by Ari Levine
Songs written by Philip Lawrence (songwriter)
Song recordings produced by Emile Haynie
Song recordings produced by Jeff Bhasker
Song recordings produced by Mark Ronson
Canadian Hot 100 number-one singles
Billboard Hot 100 number-one singles
Record Report Pop Rock General number-one singles
Number-one singles in Poland
2012 songs
Heaven in popular culture
Atlantic Records singles
Elektra Records singles
MTV Video Music Award for Best Male Video
Reggae rock songs
Music videos directed by Cameron Duddy
|
```c++
//
// Aspia Project
//
// This program is free software: you can redistribute it and/or modify
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
//
// along with this program. If not, see <path_to_url
//
#include "base/files/file_path_watcher.h"
#include "base/logging.h"
namespace base {
namespace {
class FilePathWatcherImpl final : public FilePathWatcher::PlatformDelegate
{
public:
FilePathWatcherImpl(std::shared_ptr<TaskRunner> task_runner);
~FilePathWatcherImpl() final;
bool watch(const std::filesystem::path& path,
bool recursive,
const FilePathWatcher::Callback& callback) final;
void cancel() final;
private:
DISALLOW_COPY_AND_ASSIGN(FilePathWatcherImpl);
};
//your_sha256_hash----------------------------------
FilePathWatcherImpl::FilePathWatcherImpl(std::shared_ptr<TaskRunner> task_runner)
: FilePathWatcher::PlatformDelegate(std::move(task_runner))
{
// Nothing
}
//your_sha256_hash----------------------------------
FilePathWatcherImpl::~FilePathWatcherImpl() = default;
//your_sha256_hash----------------------------------
bool FilePathWatcherImpl::watch(const std::filesystem::path& /* path */,
bool /* recursive */,
const FilePathWatcher::Callback& /* callback */)
{
NOTIMPLEMENTED();
return false;
}
//your_sha256_hash----------------------------------
void FilePathWatcherImpl::cancel()
{
NOTIMPLEMENTED();
}
} // namespace
//your_sha256_hash----------------------------------
FilePathWatcher::FilePathWatcher(std::shared_ptr<TaskRunner> task_runner)
{
impl_ = std::make_shared<FilePathWatcherImpl>(std::move(task_runner));
}
} // namespace base
```
|
```objective-c
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
* vim: set ts=8 sts=4 et sw=4 tw=99:
* This Source Code Form is subject to the terms of the Mozilla Public
* file, You can obtain one at path_to_url */
#ifndef vm_TypedArrayCommon_h
#define vm_TypedArrayCommon_h
/* Utilities and common inline code for TypedArray and SharedTypedArray */
#include "mozilla/Assertions.h"
#include "mozilla/FloatingPoint.h"
#include "mozilla/PodOperations.h"
#include "js/Conversions.h"
#include "js/Value.h"
#include "vm/SharedTypedArrayObject.h"
#include "vm/TypedArrayObject.h"
namespace js {
// Definitions below are shared between TypedArrayObject and
// SharedTypedArrayObject.
// ValueIsLength happens not to be according to ES6, which mandates
// the use of ToLength, which in turn includes ToNumber, ToInteger,
// and clamping. ValueIsLength is used in the current TypedArray code
// but will disappear when that code is made spec-compliant.
inline bool
ValueIsLength(const Value& v, uint32_t* len)
{
if (v.isInt32()) {
int32_t i = v.toInt32();
if (i < 0)
return false;
*len = i;
return true;
}
if (v.isDouble()) {
double d = v.toDouble();
if (mozilla::IsNaN(d))
return false;
uint32_t length = uint32_t(d);
if (d != double(length))
return false;
*len = length;
return true;
}
return false;
}
template<typename NativeType> static inline Scalar::Type TypeIDOfType();
template<> inline Scalar::Type TypeIDOfType<int8_t>() { return Scalar::Int8; }
template<> inline Scalar::Type TypeIDOfType<uint8_t>() { return Scalar::Uint8; }
template<> inline Scalar::Type TypeIDOfType<int16_t>() { return Scalar::Int16; }
template<> inline Scalar::Type TypeIDOfType<uint16_t>() { return Scalar::Uint16; }
template<> inline Scalar::Type TypeIDOfType<int32_t>() { return Scalar::Int32; }
template<> inline Scalar::Type TypeIDOfType<uint32_t>() { return Scalar::Uint32; }
template<> inline Scalar::Type TypeIDOfType<float>() { return Scalar::Float32; }
template<> inline Scalar::Type TypeIDOfType<double>() { return Scalar::Float64; }
template<> inline Scalar::Type TypeIDOfType<uint8_clamped>() { return Scalar::Uint8Clamped; }
inline bool
IsAnyTypedArray(JSObject* obj)
{
return obj->is<TypedArrayObject>() || obj->is<SharedTypedArrayObject>();
}
inline uint32_t
AnyTypedArrayLength(JSObject* obj)
{
if (obj->is<TypedArrayObject>())
return obj->as<TypedArrayObject>().length();
return obj->as<SharedTypedArrayObject>().length();
}
inline Scalar::Type
AnyTypedArrayType(JSObject* obj)
{
if (obj->is<TypedArrayObject>())
return obj->as<TypedArrayObject>().type();
return obj->as<SharedTypedArrayObject>().type();
}
inline Shape*
AnyTypedArrayShape(JSObject* obj)
{
if (obj->is<TypedArrayObject>())
return obj->as<TypedArrayObject>().lastProperty();
return obj->as<SharedTypedArrayObject>().lastProperty();
}
inline const TypedArrayLayout&
AnyTypedArrayLayout(const JSObject* obj)
{
if (obj->is<TypedArrayObject>())
return obj->as<TypedArrayObject>().layout();
return obj->as<SharedTypedArrayObject>().layout();
}
inline void*
AnyTypedArrayViewData(const JSObject* obj)
{
if (obj->is<TypedArrayObject>())
return obj->as<TypedArrayObject>().viewData();
return obj->as<SharedTypedArrayObject>().viewData();
}
inline uint32_t
AnyTypedArrayBytesPerElement(const JSObject* obj)
{
if (obj->is<TypedArrayObject>())
return obj->as<TypedArrayObject>().bytesPerElement();
return obj->as<SharedTypedArrayObject>().bytesPerElement();
}
inline uint32_t
AnyTypedArrayByteLength(const JSObject* obj)
{
if (obj->is<TypedArrayObject>())
return obj->as<TypedArrayObject>().byteLength();
return obj->as<SharedTypedArrayObject>().byteLength();
}
inline bool
IsAnyTypedArrayClass(const Class* clasp)
{
return IsTypedArrayClass(clasp) || IsSharedTypedArrayClass(clasp);
}
template<class SpecificArray>
class ElementSpecific
{
typedef typename SpecificArray::ElementType T;
typedef typename SpecificArray::SomeTypedArray SomeTypedArray;
public:
/*
* Copy |source|'s elements into |target|, starting at |target[offset]|.
* Act as if the assignments occurred from a fresh copy of |source|, in
* case the two memory ranges overlap.
*/
static bool
setFromAnyTypedArray(JSContext* cx,
Handle<SomeTypedArray*> target, HandleObject source,
uint32_t offset)
{
MOZ_ASSERT(SpecificArray::ArrayTypeID() == target->type(),
"calling wrong setFromAnyTypedArray specialization");
MOZ_ASSERT(offset <= target->length());
MOZ_ASSERT(AnyTypedArrayLength(source) <= target->length() - offset);
if (source->is<SomeTypedArray>()) {
Rooted<SomeTypedArray*> src(cx, source.as<SomeTypedArray>());
if (SomeTypedArray::sameBuffer(target, src))
return setFromOverlappingTypedArray(cx, target, src, offset);
}
T* dest = static_cast<T*>(target->viewData()) + offset;
uint32_t count = AnyTypedArrayLength(source);
if (AnyTypedArrayType(source) == target->type()) {
mozilla::PodCopy(dest, static_cast<T*>(AnyTypedArrayViewData(source)), count);
return true;
}
#ifdef __arm__
# define JS_VOLATILE_ARM volatile // Inhibit unaligned accesses on ARM.
#else
# define JS_VOLATILE_ARM /* nothing */
#endif
void* data = AnyTypedArrayViewData(source);
switch (AnyTypedArrayType(source)) {
case Scalar::Int8: {
JS_VOLATILE_ARM
int8_t* src = static_cast<int8_t*>(data);
for (uint32_t i = 0; i < count; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Uint8:
case Scalar::Uint8Clamped: {
JS_VOLATILE_ARM
uint8_t* src = static_cast<uint8_t*>(data);
for (uint32_t i = 0; i < count; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Int16: {
JS_VOLATILE_ARM
int16_t* src = static_cast<int16_t*>(data);
for (uint32_t i = 0; i < count; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Uint16: {
JS_VOLATILE_ARM
uint16_t* src = static_cast<uint16_t*>(data);
for (uint32_t i = 0; i < count; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Int32: {
JS_VOLATILE_ARM
int32_t* src = static_cast<int32_t*>(data);
for (uint32_t i = 0; i < count; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Uint32: {
JS_VOLATILE_ARM
uint32_t* src = static_cast<uint32_t*>(data);
for (uint32_t i = 0; i < count; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Float32: {
JS_VOLATILE_ARM
float* src = static_cast<float*>(data);
for (uint32_t i = 0; i < count; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Float64: {
JS_VOLATILE_ARM
double* src = static_cast<double*>(data);
for (uint32_t i = 0; i < count; ++i)
*dest++ = T(*src++);
break;
}
default:
MOZ_CRASH("setFromAnyTypedArray with a typed array with bogus type");
}
#undef JS_VOLATILE_ARM
return true;
}
/*
* Copy |source[0]| to |source[len]| (exclusive) elements into the typed
* array |target|, starting at index |offset|. |source| must not be a
* typed array.
*/
static bool
setFromNonTypedArray(JSContext* cx, Handle<SomeTypedArray*> target, HandleObject source,
uint32_t len, uint32_t offset = 0)
{
MOZ_ASSERT(target->type() == SpecificArray::ArrayTypeID(),
"target type and NativeType must match");
MOZ_ASSERT(!IsAnyTypedArray(source),
"use setFromAnyTypedArray instead of this method");
uint32_t i = 0;
if (source->isNative()) {
// Attempt fast-path infallible conversion of dense elements up to
// the first potentially side-effectful lookup or conversion.
uint32_t bound = Min(source->as<NativeObject>().getDenseInitializedLength(), len);
T* dest = static_cast<T*>(target->viewData()) + offset;
MOZ_ASSERT(!canConvertInfallibly(MagicValue(JS_ELEMENTS_HOLE)),
"the following loop must abort on holes");
const Value* srcValues = source->as<NativeObject>().getDenseElements();
for (; i < bound; i++) {
if (!canConvertInfallibly(srcValues[i]))
break;
dest[i] = infallibleValueToNative(srcValues[i]);
}
if (i == len)
return true;
}
// Convert and copy any remaining elements generically.
RootedValue v(cx);
for (; i < len; i++) {
if (!GetElement(cx, source, source, i, &v))
return false;
T n;
if (!valueToNative(cx, v, &n))
return false;
len = Min(len, target->length());
if (i >= len)
break;
// Compute every iteration in case getElement/valueToNative is wacky.
void* data = target->viewData();
static_cast<T*>(data)[offset + i] = n;
}
return true;
}
private:
static bool
setFromOverlappingTypedArray(JSContext* cx,
Handle<SomeTypedArray*> target,
Handle<SomeTypedArray*> source,
uint32_t offset)
{
MOZ_ASSERT(SpecificArray::ArrayTypeID() == target->type(),
"calling wrong setFromTypedArray specialization");
MOZ_ASSERT(SomeTypedArray::sameBuffer(target, source),
"provided arrays don't actually overlap, so it's "
"undesirable to use this method");
MOZ_ASSERT(offset <= target->length());
MOZ_ASSERT(source->length() <= target->length() - offset);
T* dest = static_cast<T*>(target->viewData()) + offset;
uint32_t len = source->length();
if (source->type() == target->type()) {
mozilla::PodMove(dest, static_cast<T*>(source->viewData()), len);
return true;
}
// Copy |source| in case it overlaps the target elements being set.
size_t sourceByteLen = len * source->bytesPerElement();
void* data = target->zone()->template pod_malloc<uint8_t>(sourceByteLen);
if (!data)
return false;
mozilla::PodCopy(static_cast<uint8_t*>(data),
static_cast<uint8_t*>(source->viewData()),
sourceByteLen);
switch (source->type()) {
case Scalar::Int8: {
int8_t* src = static_cast<int8_t*>(data);
for (uint32_t i = 0; i < len; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Uint8:
case Scalar::Uint8Clamped: {
uint8_t* src = static_cast<uint8_t*>(data);
for (uint32_t i = 0; i < len; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Int16: {
int16_t* src = static_cast<int16_t*>(data);
for (uint32_t i = 0; i < len; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Uint16: {
uint16_t* src = static_cast<uint16_t*>(data);
for (uint32_t i = 0; i < len; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Int32: {
int32_t* src = static_cast<int32_t*>(data);
for (uint32_t i = 0; i < len; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Uint32: {
uint32_t* src = static_cast<uint32_t*>(data);
for (uint32_t i = 0; i < len; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Float32: {
float* src = static_cast<float*>(data);
for (uint32_t i = 0; i < len; ++i)
*dest++ = T(*src++);
break;
}
case Scalar::Float64: {
double* src = static_cast<double*>(data);
for (uint32_t i = 0; i < len; ++i)
*dest++ = T(*src++);
break;
}
default:
MOZ_CRASH("setFromOverlappingTypedArray with a typed array with bogus type");
}
js_free(data);
return true;
}
static bool
canConvertInfallibly(const Value& v)
{
return v.isNumber() || v.isBoolean() || v.isNull() || v.isUndefined();
}
static T
infallibleValueToNative(const Value& v)
{
if (v.isInt32())
return T(v.toInt32());
if (v.isDouble())
return doubleToNative(v.toDouble());
if (v.isBoolean())
return T(v.toBoolean());
if (v.isNull())
return T(0);
MOZ_ASSERT(v.isUndefined());
return TypeIsFloatingPoint<T>() ? T(JS::GenericNaN()) : T(0);
}
static bool
valueToNative(JSContext* cx, const Value& v, T* result)
{
MOZ_ASSERT(!v.isMagic());
if (MOZ_LIKELY(canConvertInfallibly(v))) {
*result = infallibleValueToNative(v);
return true;
}
double d;
MOZ_ASSERT(v.isString() || v.isObject() || v.isSymbol());
if (!(v.isString() ? StringToNumber(cx, v.toString(), &d) : ToNumber(cx, v, &d)))
return false;
*result = doubleToNative(d);
return true;
}
static T
doubleToNative(double d)
{
if (TypeIsFloatingPoint<T>()) {
#ifdef JS_MORE_DETERMINISTIC
// The JS spec doesn't distinguish among different NaN values, and
// it deliberately doesn't specify the bit pattern written to a
// typed array when NaN is written into it. This bit-pattern
// inconsistency could confuse deterministic testing, so always
// canonicalize NaN values in more-deterministic builds.
d = JS::CanonicalizeNaN(d);
#endif
return T(d);
}
if (MOZ_UNLIKELY(mozilla::IsNaN(d)))
return T(0);
if (SpecificArray::ArrayTypeID() == Scalar::Uint8Clamped)
return T(d);
if (TypeIsUnsigned<T>())
return T(JS::ToUint32(d));
return T(JS::ToInt32(d));
}
};
template<typename SomeTypedArray>
class TypedArrayMethods
{
static_assert(mozilla::IsSame<SomeTypedArray, TypedArrayObject>::value ||
mozilla::IsSame<SomeTypedArray, SharedTypedArrayObject>::value,
"methods must be shared/unshared-specific, not "
"element-type-specific");
typedef typename SomeTypedArray::BufferType BufferType;
typedef typename SomeTypedArray::template OfType<int8_t>::Type Int8ArrayType;
typedef typename SomeTypedArray::template OfType<uint8_t>::Type Uint8ArrayType;
typedef typename SomeTypedArray::template OfType<int16_t>::Type Int16ArrayType;
typedef typename SomeTypedArray::template OfType<uint16_t>::Type Uint16ArrayType;
typedef typename SomeTypedArray::template OfType<int32_t>::Type Int32ArrayType;
typedef typename SomeTypedArray::template OfType<uint32_t>::Type Uint32ArrayType;
typedef typename SomeTypedArray::template OfType<float>::Type Float32ArrayType;
typedef typename SomeTypedArray::template OfType<double>::Type Float64ArrayType;
typedef typename SomeTypedArray::template OfType<uint8_clamped>::Type Uint8ClampedArrayType;
public:
/* subarray(start[, end]) */
static bool
subarray(JSContext* cx, CallArgs args)
{
MOZ_ASSERT(SomeTypedArray::is(args.thisv()));
Rooted<SomeTypedArray*> tarray(cx, &args.thisv().toObject().as<SomeTypedArray>());
// These are the default values.
uint32_t initialLength = tarray->length();
uint32_t begin = 0, end = initialLength;
if (args.length() > 0) {
if (!ToClampedIndex(cx, args[0], initialLength, &begin))
return false;
if (args.length() > 1) {
if (!ToClampedIndex(cx, args[1], initialLength, &end))
return false;
}
}
if (begin > end)
begin = end;
if (begin > tarray->length() || end > tarray->length() || begin > end) {
JS_ReportErrorNumber(cx, js_GetErrorMessage, nullptr, JSMSG_BAD_INDEX);
return false;
}
if (!SomeTypedArray::ensureHasBuffer(cx, tarray))
return false;
Rooted<BufferType*> bufobj(cx, tarray->buffer());
MOZ_ASSERT(bufobj);
uint32_t length = end - begin;
size_t elementSize = tarray->bytesPerElement();
MOZ_ASSERT(begin < UINT32_MAX / elementSize);
uint32_t arrayByteOffset = tarray->byteOffset();
MOZ_ASSERT(UINT32_MAX - begin * elementSize >= arrayByteOffset);
uint32_t byteOffset = arrayByteOffset + begin * elementSize;
JSObject* nobj = nullptr;
switch (tarray->type()) {
case Scalar::Int8:
nobj = Int8ArrayType::makeInstance(cx, bufobj, byteOffset, length);
break;
case Scalar::Uint8:
nobj = Uint8ArrayType::makeInstance(cx, bufobj, byteOffset, length);
break;
case Scalar::Int16:
nobj = Int16ArrayType::makeInstance(cx, bufobj, byteOffset, length);
break;
case Scalar::Uint16:
nobj = Uint16ArrayType::makeInstance(cx, bufobj, byteOffset, length);
break;
case Scalar::Int32:
nobj = Int32ArrayType::makeInstance(cx, bufobj, byteOffset, length);
break;
case Scalar::Uint32:
nobj = Uint32ArrayType::makeInstance(cx, bufobj, byteOffset, length);
break;
case Scalar::Float32:
nobj = Float32ArrayType::makeInstance(cx, bufobj, byteOffset, length);
break;
case Scalar::Float64:
nobj = Float64ArrayType::makeInstance(cx, bufobj, byteOffset, length);
break;
case Scalar::Uint8Clamped:
nobj = Uint8ClampedArrayType::makeInstance(cx, bufobj, byteOffset, length);
break;
default:
MOZ_CRASH("nonsense target element type");
break;
}
if (!nobj)
return false;
args.rval().setObject(*nobj);
return true;
}
/* copyWithin(target, start[, end]) */
// ES6 draft rev 26, 22.2.3.5
static bool
copyWithin(JSContext* cx, CallArgs args)
{
MOZ_ASSERT(SomeTypedArray::is(args.thisv()));
// Steps 1-2.
Rooted<SomeTypedArray*> obj(cx, &args.thisv().toObject().as<SomeTypedArray>());
// Steps 3-4.
uint32_t len = obj->length();
// Steps 6-8.
uint32_t to;
if (!ToClampedIndex(cx, args.get(0), len, &to))
return false;
// Steps 9-11.
uint32_t from;
if (!ToClampedIndex(cx, args.get(1), len, &from))
return false;
// Steps 12-14.
uint32_t final;
if (args.get(2).isUndefined()) {
final = len;
} else {
if (!ToClampedIndex(cx, args.get(2), len, &final))
return false;
}
// Steps 15-18.
// If |final - from < 0|, then |count| will be less than 0, so step 18
// never loops. Exit early so |count| can use a non-negative type.
// Also exit early if elements are being moved to their pre-existing
// location.
if (final < from || to == from) {
args.rval().setObject(*obj);
return true;
}
uint32_t count = Min(final - from, len - to);
uint32_t lengthDuringMove = obj->length(); // beware ToClampedIndex
// Technically |from + count| and |to + count| can't overflow, because
// buffer contents are limited to INT32_MAX length. But eventually
// we're going to lift this restriction, and the extra checking cost is
// negligible, so just handle it anyway.
if (from > lengthDuringMove ||
to > lengthDuringMove ||
count > lengthDuringMove - from ||
count > lengthDuringMove - to)
{
JS_ReportErrorNumber(cx, js_GetErrorMessage, nullptr, JSMSG_TYPED_ARRAY_BAD_ARGS);
return false;
}
const size_t ElementSize = obj->bytesPerElement();
MOZ_ASSERT(to <= UINT32_MAX / ElementSize);
uint32_t byteDest = to * ElementSize;
MOZ_ASSERT(from <= UINT32_MAX / ElementSize);
uint32_t byteSrc = from * ElementSize;
MOZ_ASSERT(count <= UINT32_MAX / ElementSize);
uint32_t byteSize = count * ElementSize;
#ifdef DEBUG
uint32_t viewByteLength = obj->byteLength();
MOZ_ASSERT(byteSize <= viewByteLength);
MOZ_ASSERT(byteDest <= viewByteLength);
MOZ_ASSERT(byteSrc <= viewByteLength);
MOZ_ASSERT(byteDest <= viewByteLength - byteSize);
MOZ_ASSERT(byteSrc <= viewByteLength - byteSize);
#endif
uint8_t* data = static_cast<uint8_t*>(obj->viewData());
mozilla::PodMove(&data[byteDest], &data[byteSrc], byteSize);
// Step 19.
args.rval().set(args.thisv());
return true;
}
/* set(array[, offset]) */
static bool
set(JSContext* cx, CallArgs args)
{
MOZ_ASSERT(SomeTypedArray::is(args.thisv()));
Rooted<SomeTypedArray*> target(cx, &args.thisv().toObject().as<SomeTypedArray>());
// The first argument must be either a typed array or arraylike.
if (args.length() == 0 || !args[0].isObject()) {
JS_ReportErrorNumber(cx, js_GetErrorMessage, nullptr, JSMSG_TYPED_ARRAY_BAD_ARGS);
return false;
}
int32_t offset = 0;
if (args.length() > 1) {
if (!ToInt32(cx, args[1], &offset))
return false;
if (offset < 0 || uint32_t(offset) > target->length()) {
// the given offset is bogus
JS_ReportErrorNumber(cx, js_GetErrorMessage, nullptr,
JSMSG_TYPED_ARRAY_BAD_INDEX, "2");
return false;
}
}
RootedObject arg0(cx, &args[0].toObject());
if (IsAnyTypedArray(arg0)) {
if (AnyTypedArrayLength(arg0) > target->length() - offset) {
JS_ReportErrorNumber(cx, js_GetErrorMessage, nullptr, JSMSG_BAD_ARRAY_LENGTH);
return false;
}
if (!setFromAnyTypedArray(cx, target, arg0, offset))
return false;
} else {
uint32_t len;
if (!GetLengthProperty(cx, arg0, &len))
return false;
if (uint32_t(offset) > target->length() || len > target->length() - offset) {
JS_ReportErrorNumber(cx, js_GetErrorMessage, nullptr, JSMSG_BAD_ARRAY_LENGTH);
return false;
}
if (!setFromNonTypedArray(cx, target, arg0, len, offset))
return false;
}
args.rval().setUndefined();
return true;
}
static bool
setFromArrayLike(JSContext* cx, Handle<SomeTypedArray*> target, HandleObject source, uint32_t len,
uint32_t offset = 0)
{
MOZ_ASSERT(offset <= target->length());
MOZ_ASSERT(len <= target->length() - offset);
if (IsAnyTypedArray(source))
return setFromAnyTypedArray(cx, target, source, offset);
return setFromNonTypedArray(cx, target, source, len, offset);
}
private:
static bool
setFromAnyTypedArray(JSContext* cx, Handle<SomeTypedArray*> target, HandleObject source,
uint32_t offset)
{
MOZ_ASSERT(IsAnyTypedArray(source), "use setFromNonTypedArray");
switch (target->type()) {
case Scalar::Int8:
return ElementSpecific<Int8ArrayType>::setFromAnyTypedArray(cx, target, source, offset);
case Scalar::Uint8:
return ElementSpecific<Uint8ArrayType>::setFromAnyTypedArray(cx, target, source, offset);
case Scalar::Int16:
return ElementSpecific<Int16ArrayType>::setFromAnyTypedArray(cx, target, source, offset);
case Scalar::Uint16:
return ElementSpecific<Uint16ArrayType>::setFromAnyTypedArray(cx, target, source, offset);
case Scalar::Int32:
return ElementSpecific<Int32ArrayType>::setFromAnyTypedArray(cx, target, source, offset);
case Scalar::Uint32:
return ElementSpecific<Uint32ArrayType>::setFromAnyTypedArray(cx, target, source, offset);
case Scalar::Float32:
return ElementSpecific<Float32ArrayType>::setFromAnyTypedArray(cx, target, source, offset);
case Scalar::Float64:
return ElementSpecific<Float64ArrayType>::setFromAnyTypedArray(cx, target, source, offset);
case Scalar::Uint8Clamped:
return ElementSpecific<Uint8ClampedArrayType>::setFromAnyTypedArray(cx, target, source, offset);
case Scalar::Float32x4:
case Scalar::Int32x4:
case Scalar::MaxTypedArrayViewType:
break;
}
MOZ_CRASH("nonsense target element type");
}
static bool
setFromNonTypedArray(JSContext* cx, Handle<SomeTypedArray*> target, HandleObject source,
uint32_t len, uint32_t offset)
{
MOZ_ASSERT(!IsAnyTypedArray(source), "use setFromAnyTypedArray");
switch (target->type()) {
case Scalar::Int8:
return ElementSpecific<Int8ArrayType>::setFromNonTypedArray(cx, target, source, len, offset);
case Scalar::Uint8:
return ElementSpecific<Uint8ArrayType>::setFromNonTypedArray(cx, target, source, len, offset);
case Scalar::Int16:
return ElementSpecific<Int16ArrayType>::setFromNonTypedArray(cx, target, source, len, offset);
case Scalar::Uint16:
return ElementSpecific<Uint16ArrayType>::setFromNonTypedArray(cx, target, source, len, offset);
case Scalar::Int32:
return ElementSpecific<Int32ArrayType>::setFromNonTypedArray(cx, target, source, len, offset);
case Scalar::Uint32:
return ElementSpecific<Uint32ArrayType>::setFromNonTypedArray(cx, target, source, len, offset);
case Scalar::Float32:
return ElementSpecific<Float32ArrayType>::setFromNonTypedArray(cx, target, source, len, offset);
case Scalar::Float64:
return ElementSpecific<Float64ArrayType>::setFromNonTypedArray(cx, target, source, len, offset);
case Scalar::Uint8Clamped:
return ElementSpecific<Uint8ClampedArrayType>::setFromNonTypedArray(cx, target, source, len, offset);
case Scalar::Float32x4:
case Scalar::Int32x4:
case Scalar::MaxTypedArrayViewType:
break;
}
MOZ_CRASH("bad target array type");
}
};
} // namespace js
#endif // vm_TypedArrayCommon_h
```
|
Nowe Racibory is a village in the administrative district of Gmina Sokoły, within Wysokie Mazowieckie County, Podlaskie Voivodeship, in north-eastern Poland.
References
Nowe Racibory
|
Paul Guttmann (9 September 1834 in Ratibor () – 24 May 1893 in Berlin) was a German-Jewish pathologist.
He studied medicine in Berlin, Würzburg and Vienna, earning his doctorate in 1858. From 1859 he worked in Berlin, where he later became an assistant to Wilhelm Griesinger (1817-1868). In 1879 he replaced Heinrich Curschmann (1846-1910) as director of the Moabit Hospital, where one of his students was pediatrician Hugo Neumann (1858-1912). From 1885 to 1893 he was an editor of the Journal für praktische Aerzt.
He is remembered for work with neurologist Albert Eulenburg (1840-1917) involving research of the sympathetic nervous system. With Eulenburg he published Die Pathologie des Sympathicus auf physiologischer Grundlage, a work that was considered at the time to be the best written book on the pathology of the sympathetic system from a physiological basis. As a result of this publication, the two physicians were awarded the 1877 Astley Cooper Prize. However, this honor was later overturned due to a technicality that the book had two authors.
Guttmann also made contributions in his research of tuberculosis and malaria. With Paul Ehrlich (1854-1915), he discovered that the histological stain, methylene blue had effectiveness against malaria.
Selected works
Die Pathologie des Sympathicus auf physiologischer Grundlage, Albert Eulenburg and Paul Guttmann - Essay on the sympathetic nervous system.
"A handbook of physical diagnosis: comprising the throat, thorax, and abdomen"; by Paul Guttmann, translated from the third German edition by Alex Napier.
Die Wirksamkeit to kleiner Tuberkulindosen they gegen Lungenschwindsucht. (with Paul Ehrlich) Deutsche Medizinische Wochenschrift, Berlin, 1890, 16:793-795.
Ueber die Wirkung des Methylenblau bei Malaria. (with Paul Ehrlich) Berliner klinische Wochenschrift, 1891, 28:953-956.
References
Meridian Institute A Historical Sketch Of The Developmental Knowledge Of The Sympathetic Nerves
Paul Ehrlich @ Who Named It
Parts of this article are based on translation of equivalent articles at the German and Polish Wikipedia.
1834 births
1893 deaths
19th-century German people
German pathologists
Jewish scientists
People from Racibórz
People from the Province of Silesia
19th-century German Jews
|
European route E 56 is a road part of the International E-road network. It begins in Nuremberg, Germany and ends in Sattledt, Austria.
The road follows: Nuremberg - Regensburg - Deggendorf - Passau - Ried - Wels - Sattledt.
56
056
E056
|
Cirimido (Comasco: ) is a comune (municipality) in the Province of Como in the Italian region Lombardy, located about northwest of Milan and about southwest of Como. As of 31 December 2004, it had a population of 2,052 and an area of 2.6 km².
Cirimido borders the following municipalities: Fenegrò, Guanzate, Lomazzo, Turate.
Demographic evolution
References
External links
www.comune.cirimido.co.it
Cities and towns in Lombardy
|
Ashiq Khan (ASHIQ KHAN]; born 7 June 1993)
Early life
Ashiq Khan was born on 7 June in Doha, Qatar. His father is from Peshawar, Pakistan, but moved to Doha in 1970. According to Khan, his father served in the Pakistan Army, and then served in the Qatar Army in the early 1970s. Ethnically, Khan describes himself as Pathan (Pashtun). He grew up in Doha and Islamabad where he attended the Pakistan Education Centre in the former, and both the City School and the Asas International School in the latter. After high school, he attended the International Islamic University and earned his bachelor's degree in International Relations. He later opted out to pursue a career in the film industry of Doha while attending the Doha Film Institute for workshops.
Acting & film-making career
Filming with the Doha Film Institute, Doha
Ashiq Khan participated in the casting and the filming of the Doha Film Institute advertisements for the 2nd Doha Tribeca Film Festival (DTFF) in 2010. He got involved to enhance his acting abilities, inform the public about the important cultural activities taking place in that country, and to support the growing artistic and cultural development of Doha. He was also a part of the Haggle Tour "The Haggler – Financing" advertisement, playing the roles of an elf and the clown director. His role as a volunteer earned him the 'Best Volunteer' award. Meanwhile, Khan learned how to act during various film shootings and his love for filming increased because of this experience. He once tried auditioning for a role in Jean-Jacques Annaud's film Black Gold, though the coveted role was not given to him. Nevertheless, Khan attended special panels at the Doha Tribeca Film Festival 2010 entitled Emerging Actors, and Emerging Stars.
Ashiq Khan became an assistant director, production assistant and actor in a Doha Film Institute music video "Nomadination – AshwinRenju". He also had parts in the Nomadination music video screening, and in the 2011 Doha Tribeca Film Festival volunteers' video, which promotes volunteerism.
He also got an opportunity to play the role of a journalist in the second season of Taymour, a television series that was scheduled to be screened during the holy month of Ramadan 2012 by Al Jazeera Children's Channel (JCC TV).
Acting and writing workshops
In the same way, Khan took part in a workshop entitled the "Acting for the Camera with Ashraf Farah Workshop 2011", where he learned different techniques for acting in a convincing and natural manner. He also participated in a stunt workshop to show his interest and love for stunt acting. In effect, he learned how to direct and perform stunts from a professional stunt man. He also learned how to work with a film/video crew in a very professional way. On the side note, a short video of stunt acting was recorded entitled "Once upon a time in Qatar" during the workshop.
On the other hand, Ashiq Khan wrote scripts for a 10-minute film and several 1-minute films, showing his great interest in acting.
Khan also attended the Maisha Film Lab's 4th Screenwriting Lab in Zanzibar, Tanzania. The course was tutored by accomplished film industry professionals Anjum Rajabali and Ashwini Malik, and was set up in collaboration with the Zanzibar International Film Festival.
During the Doha Tribeca Film Festival of 2011, Ashiq Khan participated in the casting and filming of advertisements for the 2011 DTFF- Supermarket Showdown. He also participated in "Harrer Harrer – Doha", a one-week story telling workshop during which the participants aimed at telling stories about the recent political turmoils in the Middle East. During the workshop, the participants recalled their personal connection to these historical events and told their personal stories, resulting in 1-minute films. The goal of the workshop was to capture the essence of the sudden changes and communicate human emotions of the actors involved. The films were then uploaded and distributed on a web platform and became part of an international exhibition at the Doha Tribeca Film Festival 2011.
At the same festival of the same year, the education team has developed a special program called "Rendez-vous". The Doha Film Institute selected Ashiq Khan to become part of the program since he was one of the top students of the year 2011. During the festival in 25–29 October, he obtained access to a one-hour one-on-one conversation with special guest Jan Uddin. Jan Uddin is an English-Bengali actor, who was featured in Black Gold (2011), Shank (2010), and Boogie (2009) among others. The meeting with Uddin proved to be valuable for Khan as it allowed him to grasp excellent insider knowledge and career guidance.
Adding to the list of his participation in the said festival, Ashiq Khan also got involved in the Comedy Workshop. Meanwhile, Khan's short films Hamour, 15 Heartbeats, Re:Move, Last 7 Minutes and his music video "Nomadination" were screened in the festival. His one-minute films The Choice and Contradiction were also screened at the festival's "Harrer, Harrer" Video Exhibition.
On 11 to 14 March 2012, Khan attended the acting workshop "From the page to the stage" at the Royal Academy of Dramatic Art to understand the dramatic elements behind a performance. In the same year, a short film entitled HAMOUR, which features Khan as the production assistant, has been selected for the Gulf Film Festival 2012 in Dubai. It was also selected to be screened on 17 and 20 November 2012 at the Middle East Studies Association Film Festival at Denver, Colorado, USA.
On the other hand, Khan played two roles, a Pakistani Pakhton and a Qatari man in Spain-based short film MAX.
Other ventures
Ashiq Khan was once a production assistant for Vice Magazine and Levi's jeans' shoot, which features epic portraits of cool creatives, celebrating 140 years of 501s. He was also a part of Doha Film Institute's new workshop, "7 days Filmmaking Challenge".
Filmography
As an actor
As director
As production assistant
As screenplay writer
See also
Abu Dhabi Film Festival
Al Jazeera Children's Channel
Dubai International Film Festival
Zanzibar International Film Festival
References
1993 births
Living people
Maisha Film Lab alumni
Pakistani male film actors
|
Tina Lynn Seelig (born 1957) is an American educator, entrepreneur, and author of several books on creativity and innovation. She is a faculty member at Stanford University.
Biography
In 1985, Seelig earned her PhD in neuroscience from Stanford University School of Medicine.
After completing her PhD, Seelig worked as a management consultant for Booz, Allen and Hamilton and as a multimedia producer at Compaq Computer Corporation, and founded a multimedia company called BookBrowser.
In 1999, Seelig joined Stanford University. She is currently Professor of the Practice in Stanford's Department of Management Science and Engineering, as well as a faculty director of the Stanford Technology Ventures Program (STVP). She teaches courses in the Hasso Plattner Institute of Design (d.school) and leads three fellowship programs in the School of Engineering that are focused on creativity, innovation, and entrepreneurship.
Seelig is the author of 17 books, including:
What I Wish I Knew When I Was 20 (2009), which Publisher' Weekly said "presents a thoughtful, concise set of observations for those making the unsteady transition to adulthood";
inGenius (2012), which Entrepreneur called "the book for head honchos who are looking to shake up corporate stagnation"; and
Insight Out (2016), which Entrepreneur recommended for "businesses who are looking for a way to release all of the creativity they feel is locked up in their human capital."
Honors and awards
Seelig is the recipient of the National Olympus Innovation Award (2008), the Gordon Prize from the National Academy of Engineering (2009), and the Silicon Valley Visionary Award (2014).
Selected publications
Seelig, Tina. What I Wish I Knew When I Was 20: A Crash Course for Making Your Place in the World. HarperCollins, 2009.
Seelig, Tina. inGenius: A Crash Course on Creativity. HarperCollins, 2012.
Seelig, Tina. Insight Out: Get Ideas Out of Your Head and into the World. HarperCollins, 2016.
References
1958 births
Living people
Stanford University faculty
21st-century American women writers
Stanford University School of Medicine alumni
Booz Allen Hamilton people
Compaq
|
Kondratovskaya () is a rural locality (a village) in Puchuzhskoye Rural Settlement of Verkhnetoyemsky District, Arkhangelsk Oblast, Russia. The population was 173 as of 2010.
Geography
It is located on the Severnaya Dvina River, 70 km north-west from Verknyaya Toyma.
References
Rural localities in Verkhnetoyemsky District
|
Fakhruddin G. Ebrahim, TI (Urdu: فخر الدين جى ابراهيم; February 12, 1928 – January 7, 2020) was a Pakistani judge, a legal expert and senior most lawyer. He was appointed as the 24th Chief Election Commissioner of Pakistan on 14 July 2012 and served until he resigned on 31 July 2013 and oversaw the 2013 election.
Ebrahim was born in 1928 in Ahmedabad, Bombay Presidency, British India. In 1945, he attended the Gujarat Vidyapith where he earned his LLB with distinctions in 1949. While there, Ebrahim studied courses on philosophy and also attended the lectures given by Mohandas Karamchand Gandhi, which played an important role in his advocacy for non-violence. In 1950, Ebrahim moved to Pakistan and attended the Sindh Muslim Law College, where he earned an LLM and was awarded an honorary Juris Doctor in 1960. In 1961, Ebrahim established his own firm while he continued to lecture at the Sindh Law College. In 1971, Zulfikar Ali Bhutto appointed him Attorney General of Pakistan.
He served as the interim Law Minister from 18 July 1993 until 19 October 1993, and interim Justice Minister from 5 November 1996 until 17 February 1997. Ebrahim was a retired Associate Judge of the Supreme Court of Pakistan, and Senior Advocate Supreme Court and was known also as a peace activist. In 1988, he was also Governor of Sindh, appointed by Prime Minister Benazir Bhutto during her first term.
In March 1981, serving as an ad hoc Judge of the Supreme Court of Pakistan, he refused to take a fresh oath, under the Provisional Constitutional Order (PCO) promulgated by General Zia-ul-Haq along with Justice Dorab Patel and Chief Justice Sheikh Anwarul Haq. The PCO not only negated the independence of the judiciary but also prolonged martial law by nullifying the effect of a judgement giving General Zia's regime limited recognition.
Ebrahim established the Citizen Police Liaison Committee (CPLC) in 1989. The CPLC works in Karachi and assists citizens in registering the First Information Report if it is refused by police for some reason. Ebrahim headed the law firm of Fakhruddin G. Ebrahim & Company, a general legal practice originally established in Bombay (now Mumbai), India. The firm relocated to Karachi in 1951.
Ebrahim had long-standing ties with the Pakistan Cricket Board (PCB). In 1995, the PCB initiated an inquiry, under the chairmanship of Ebrahim, to look into allegations made by Australian players Shane Warne and Mark Waugh surrounding the First Test between Pakistan and Australia in Karachi in 1994 and the ODI in Rawalpindi. The Australian cricketers had accused Saleem Malik of offering them bribes which they rejected. The inquiry was frustrated as the Australian players did not travel to Pakistan to give evidence, and thus the Inquiry had to rely on their statements together with the cross-examination of Saleem Malik. In October 1995, it was decided that the allegations were unfounded. In December 2006, Ebrahim also served as the Chairman of the PCB's Anti-doping Appeals Committee, which acquitted Shoaib Akhtar and Mohammad Asif. Ebrahim was in favour of the acquittal. He died On 7 January 2020 In Karachi, Pakistan.
References
1928 births
2020 deaths
Attorneys General of Pakistan
Governors of Sindh
Pakistani anti-war activists
Pakistani judges
Pakistani lawyers
Chief Election Commissioners of Pakistan
Recipients of Tamgha-e-Imtiaz
Lawyers from Karachi
Politicians from Karachi
Abbottabad Commission
Pakistani people of Gujarati descent
Sindh Muslim Law College alumni
Lawyers from Lahore
People from Karachi
Muhajir people
People from Ahmedabad
|
Kushanshah (Bactrian: KΟÞANΟ ÞAΟ, Koshano Shao, Pahlavi: Kwšan MLK Kushan Malik) was the title of the rulers of the Kushano-Sasanian Kingdom, the parts of the former Kushan Empire in the areas of Sogdiana, Bactria and Gandhara, named Kushanshahr and held by the Sasanian Empire, during the 3rd and 4th centuries CE. They are collectively known as Kushano-Sasanians, or Indo-Sasanians.
The Kushanshahs minted their own coinage, and took the title of Kushanshas, ie "Kings of the Kushans". This administration continued until 360 CE. The Kushanshas are mainly known through their coins.
A rebellion of Hormizd I Kushanshah (277-286 CE), who issued coins with the title Kushanshahanshah (KΟÞANΟ ÞAΟNΟNΟ ÞAΟ "King of kings of the Kushans"), seems to have occurred against contemporary emperor Bahram II (276-293 CE) of the Sasanian Empire, but failed.
The title is first attested in the Paikuli inscription of the Sasanian shah Narseh in ca. 293, where it functioned as a title for the Sasanian governors of the eastern portion of the empire. The title was also used by the Kidarite dynasty, which was the last kingdom to make use of it.
Main Kushanshahs
The following Kushanshahs were:
Ardashir I Kushanshah (230–245)
Peroz I Kushanshah (245–275)
Hormizd I Kushanshah (275–300)
Hormizd II Kushanshah (300–303)
Peroz II Kushanshah (303–330)
Varahran I Kushanshah (330-365)
References
Sources
Iranian words and phrases
Royal titles
|
Halstead Place was a historic residence located at East Brach Drive in Ocean Springs, Mississippi. Constructed in 1910, it was on the National Register of Historic Places until 2008. It was destroyed by Hurricane Katrina in 2005.
References
Houses on the National Register of Historic Places in Mississippi
Former National Register of Historic Places in Mississippi
Houses in Jackson County, Mississippi
National Register of Historic Places in Jackson County, Mississippi
|
```c
/*++
version 3. Alternative licensing terms are available. Contact
info@minocacorp.com for details. See the LICENSE file at the root of this
project for complete licensing information.
Module Name:
rsa.c
Abstract:
This module impelements support for the Rivest Shamir Adleman public/
private key encryption scheme.
Author:
Evan Green 21-Jul-2015
Environment:
Any
--*/
//
// your_sha256_hash--- Includes
//
#include "../cryptop.h"
//
// your_sha256_hash Definitions
//
//
// ------------------------------------------------------ Data Type Definitions
//
//
// ----------------------------------------------- Internal Function Prototypes
//
PBIG_INTEGER
CypRsaRunPrivateKey (
PRSA_CONTEXT Context,
PBIG_INTEGER Message
);
PBIG_INTEGER
CypRsaRunPublicKey (
PRSA_CONTEXT Context,
PBIG_INTEGER Message
);
//
// your_sha256_hash---- Globals
//
//
// your_sha256_hash-- Functions
//
CRYPTO_API
KSTATUS
CyRsaInitializeContext (
PRSA_CONTEXT Context
)
/*++
Routine Description:
This routine initializes an RSA context. The caller must have filled out
the allocate, reallocate, and free memory routine pointers in the big
integer context, and zeroed the rest of the structure.
Arguments:
Context - Supplies a pointer to the context to initialize.
Return Value:
Status code.
--*/
{
KSTATUS Status;
Status = CypBiInitializeContext(&(Context->BigIntegerContext));
if (!KSUCCESS(Status)) {
return Status;
}
ASSERT(Context->ModulusSize == 0);
return Status;
}
CRYPTO_API
VOID
CyRsaDestroyContext (
PRSA_CONTEXT Context
)
/*++
Routine Description:
This routine destroys a previously intialized RSA context.
Arguments:
Context - Supplies a pointer to the context to destroy.
Return Value:
None.
--*/
{
PBIG_INTEGER_CONTEXT BigContext;
PBIG_INTEGER Value;
BigContext = &(Context->BigIntegerContext);
Value = Context->PublicExponent;
if (Value != NULL) {
CypBiMakeNonPermanent(Value);
CypBiReleaseReference(BigContext, Value);
}
CypBiReleaseModuli(BigContext, BIG_INTEGER_M_OFFSET);
Value = Context->PrivateExponent;
if (Value != NULL) {
CypBiMakeNonPermanent(Value);
CypBiReleaseReference(BigContext, Value);
}
Value = Context->PValue;
if (Value != NULL) {
CypBiReleaseModuli(BigContext, BIG_INTEGER_P_OFFSET);
}
Value = Context->QValue;
if (Value != NULL) {
CypBiReleaseModuli(BigContext, BIG_INTEGER_Q_OFFSET);
}
Value = Context->DpValue;
if (Value != NULL) {
CypBiMakeNonPermanent(Value);
CypBiReleaseReference(BigContext, Value);
}
Value = Context->DqValue;
if (Value != NULL) {
CypBiMakeNonPermanent(Value);
CypBiReleaseReference(BigContext, Value);
}
Value = Context->QInverse;
if (Value != NULL) {
CypBiMakeNonPermanent(Value);
CypBiReleaseReference(BigContext, Value);
}
CypBiDestroyContext(BigContext);
//
// Zero out the whole context to be safe.
//
RtlZeroMemory(Context, sizeof(RSA_CONTEXT));
return;
}
CRYPTO_API
KSTATUS
CyRsaLoadPrivateKey (
PRSA_CONTEXT Context,
PRSA_PRIVATE_KEY_COMPONENTS PrivateKey
)
/*++
Routine Description:
This routine adds private key information to the given RSA context.
Arguments:
Context - Supplies a pointer to the context.
PrivateKey - Supplies a pointer to the private key information. All fields
are required, including the public key ones.
Return Value:
Status code.
--*/
{
PBIG_INTEGER_CONTEXT BigInteger;
KSTATUS Status;
PBIG_INTEGER Value;
Status = CyRsaLoadPublicKey(Context, &(PrivateKey->PublicKey));
if (!KSUCCESS(Status)) {
return Status;
}
BigInteger = &(Context->BigIntegerContext);
Value = CypBiImport(BigInteger,
PrivateKey->PrivateExponent,
PrivateKey->PrivateExponentLength);
if (Value == NULL) {
return STATUS_INSUFFICIENT_RESOURCES;
}
CypBiMakePermanent(Value);
Context->PrivateExponent = Value;
Value = CypBiImport(BigInteger,
PrivateKey->PValue,
PrivateKey->PValueLength);
if (Value == NULL) {
return STATUS_INSUFFICIENT_RESOURCES;
}
Context->PValue = Value;
Value = CypBiImport(BigInteger,
PrivateKey->QValue,
PrivateKey->QValueLength);
if (Value == NULL) {
return STATUS_INSUFFICIENT_RESOURCES;
}
Context->QValue = Value;
Value = CypBiImport(BigInteger,
PrivateKey->DpValue,
PrivateKey->DpValueLength);
if (Value == NULL) {
return STATUS_INSUFFICIENT_RESOURCES;
}
CypBiMakePermanent(Value);
Context->DpValue = Value;
Value = CypBiImport(BigInteger,
PrivateKey->DqValue,
PrivateKey->DqValueLength);
if (Value == NULL) {
return STATUS_INSUFFICIENT_RESOURCES;
}
CypBiMakePermanent(Value);
Context->DqValue = Value;
Value = CypBiImport(BigInteger,
PrivateKey->QInverse,
PrivateKey->QInverseLength);
if (Value == NULL) {
return STATUS_INSUFFICIENT_RESOURCES;
}
CypBiMakePermanent(Value);
Context->QInverse = Value;
Status = CypBiCalculateModuli(BigInteger,
Context->PValue,
BIG_INTEGER_P_OFFSET);
if (!KSUCCESS(Status)) {
return Status;
}
Status = CypBiCalculateModuli(BigInteger,
Context->QValue,
BIG_INTEGER_Q_OFFSET);
if (!KSUCCESS(Status)) {
return Status;
}
return STATUS_SUCCESS;
}
CRYPTO_API
KSTATUS
CyRsaLoadPublicKey (
PRSA_CONTEXT Context,
PRSA_PUBLIC_KEY_COMPONENTS PublicKey
)
/*++
Routine Description:
This routine adds public key information to the given RSA context.
This routine should not be called if private key information was already
added.
Arguments:
Context - Supplies a pointer to the context.
PublicKey - Supplies a pointer to the public key information. All fields
are required.
Return Value:
Status code.
--*/
{
PBIG_INTEGER_CONTEXT BigInteger;
KSTATUS Status;
PBIG_INTEGER Value;
BigInteger = &(Context->BigIntegerContext);
Context->ModulusSize = PublicKey->ModulusLength;
Value = CypBiImport(BigInteger,
PublicKey->Modulus,
PublicKey->ModulusLength);
if (Value == NULL) {
return STATUS_INSUFFICIENT_RESOURCES;
}
Status = CypBiCalculateModuli(BigInteger, Value, BIG_INTEGER_M_OFFSET);
if (!KSUCCESS(Status)) {
return Status;
}
Value = CypBiImport(BigInteger,
PublicKey->PublicExponent,
PublicKey->PublicExponentLength);
if (Value == NULL) {
return STATUS_INSUFFICIENT_RESOURCES;
}
CypBiMakePermanent(Value);
Context->PublicExponent = Value;
return STATUS_SUCCESS;
}
CRYPTO_API
INTN
CyRsaDecrypt (
PRSA_CONTEXT Context,
PVOID Ciphertext,
PVOID Plaintext,
BOOL IsDecryption
)
/*++
Routine Description:
This routine performs RSA decryption.
Arguments:
Context - Supplies a pointer to the context.
Ciphertext - Supplies a pointer to the ciphertext, which must be less than
the size of the modulus minus 11.
Plaintext - Supplies a pointer where the plaintext will be returned.
IsDecryption - Supplies a boolean indicating if this is a decryption
operation (TRUE) or a verify operation (FALSE).
Return Value:
Returns the number of bytes that were originally encrypted on success.
-1 on allocation failure.
--*/
{
PBIG_INTEGER_CONTEXT BigContext;
PUCHAR Block;
UINTN BlockSize;
PBIG_INTEGER CipherInteger;
UINTN LastIndex;
PBIG_INTEGER PlainInteger;
INTN Size;
KSTATUS Status;
BigContext = &(Context->BigIntegerContext);
Size = -1;
BlockSize = Context->ModulusSize;
ASSERT(BlockSize > 10);
Block = BigContext->AllocateMemory(BlockSize);
if (Block == NULL) {
goto RsaDecryptEnd;
}
CipherInteger = CypBiImport(BigContext, Ciphertext, BlockSize);
if (CipherInteger == NULL) {
goto RsaDecryptEnd;
}
if (IsDecryption != FALSE) {
PlainInteger = CypRsaRunPrivateKey(Context, CipherInteger);
} else {
PlainInteger = CypRsaRunPublicKey(Context, CipherInteger);
}
if (PlainInteger == NULL) {
CypBiReleaseReference(BigContext, CipherInteger);
goto RsaDecryptEnd;
}
Status = CypBiExport(BigContext, PlainInteger, Block, BlockSize);
if (!KSUCCESS(Status)) {
CypBiReleaseReference(BigContext, PlainInteger);
goto RsaDecryptEnd;
}
//
// There are at least 11 bytes of padding even for a zero length
// message.
//
LastIndex = 11;
//
// PKCS1.5 encryption is padded with random bytes.
//
if (IsDecryption != FALSE) {
while ((Block[LastIndex] != 0) && (LastIndex < BlockSize)) {
LastIndex += 1;
}
//
// PKCS1.5 signing is padded with 0xFF.
//
} else {
while ((Block[LastIndex] == 0xFF) && (LastIndex < BlockSize)) {
LastIndex += 1;
}
if (Block[LastIndex - 1] != 0xFF) {
LastIndex = BlockSize - 1;
}
}
LastIndex += 1;
Size = BlockSize - LastIndex;
if (Size > 0) {
RtlCopyMemory(Plaintext, &(Block[LastIndex]), Size);
}
RsaDecryptEnd:
if (Block != NULL) {
BigContext->FreeMemory(Block);
}
return Size;
}
CRYPTO_API
INTN
CyRsaEncrypt (
PRSA_CONTEXT Context,
PVOID Plaintext,
UINTN PlaintextLength,
PVOID Ciphertext,
BOOL IsSigning
)
/*++
Routine Description:
This routine performs RSA encryption.
Arguments:
Context - Supplies a pointer to the context.
Plaintext - Supplies a pointer to the plaintext to encrypt.
PlaintextLength - Supplies the length of the plaintext buffer in bytes.
Ciphertext - Supplies a pointer where the ciphertext will be returned.
This buffer must be the size of the modulus.
IsSigning - Supplies a boolean indicating whether this is a signing
operation (TRUE) and should therefore use the private key, or
whether this is an encryption operation (FALSE) and should use the
public key.
Return Value:
Returns the number of bytes that were originally encrypted on success. This
is the same as the modulus size.
-1 on allocation failure.
--*/
{
PBIG_INTEGER_CONTEXT BigContext;
PUCHAR Bytes;
PBIG_INTEGER CipherInteger;
UINTN PaddingBytes;
PBIG_INTEGER PlainInteger;
UINTN Size;
KSTATUS Status;
BigContext = &(Context->BigIntegerContext);
Size = Context->ModulusSize;
ASSERT(PlaintextLength <= Size - 3);
PaddingBytes = Size - PlaintextLength - 3;
//
// Borrow the ciphertext buffer to construct the padded input buffer.
//
Bytes = Ciphertext;
//
// For PKCS1.5, signing pads with 0xFF bytes.
//
Bytes[0] = 0;
if (IsSigning != FALSE) {
Bytes[1] = 1;
RtlSetMemory(&(Bytes[2]), 0xFF, PaddingBytes);
//
// Encryption pads with random bytes.
//
} else {
Bytes[1] = 2;
if (Context->FillRandom == NULL) {
ASSERT(FALSE);
return -1;
}
Context->FillRandom(&(Bytes[2]), PaddingBytes);
}
Bytes[2 + PaddingBytes] = 0;
RtlCopyMemory(&(Bytes[2 + PaddingBytes + 1]), Plaintext, PlaintextLength);
//
// Make an integer from the padded plaintext.
//
PlainInteger = CypBiImport(BigContext, Ciphertext, Size);
if (PlainInteger == NULL) {
return -1;
}
if (IsSigning != FALSE) {
CipherInteger = CypRsaRunPrivateKey(Context, PlainInteger);
} else {
CipherInteger = CypRsaRunPublicKey(Context, PlainInteger);
}
if (CipherInteger == NULL) {
CypBiReleaseReference(BigContext, PlainInteger);
}
Status = CypBiExport(BigContext, CipherInteger, Ciphertext, Size);
if (!KSUCCESS(Status)) {
CypBiReleaseReference(BigContext, CipherInteger);
return -1;
}
return Size;
}
//
// --------------------------------------------------------- Internal Functions
//
PBIG_INTEGER
CypRsaRunPrivateKey (
PRSA_CONTEXT Context,
PBIG_INTEGER Message
)
/*++
Routine Description:
This routine runs the given message integer through the private key,
performing c^d mod n.
Arguments:
Context - Supplies a pointer to the context.
Message - Supplies a pointer to the message to encrypt/decrypt using the
private key. A reference on this value will be released on success.
Return Value:
Returns a pointer to the new value.
NULL on allocation failure.
--*/
{
PBIG_INTEGER Result;
Result = CypBiChineseRemainderTheorem(&(Context->BigIntegerContext),
Message,
Context->DpValue,
Context->DqValue,
Context->PValue,
Context->QValue,
Context->QInverse);
return Result;
}
PBIG_INTEGER
CypRsaRunPublicKey (
PRSA_CONTEXT Context,
PBIG_INTEGER Message
)
/*++
Routine Description:
This routine runs the given message integer through the public key,
performing c^e mod n.
Arguments:
Context - Supplies a pointer to the context.
Message - Supplies a pointer to the message to encrypt/decrypt using the
public key. A reference on this value will be released on success.
Return Value:
Returns a pointer to the new value.
NULL on allocation failure.
--*/
{
PBIG_INTEGER Result;
Context->BigIntegerContext.ModOffset = BIG_INTEGER_M_OFFSET;
Result = CypBiExponentiateModulo(&(Context->BigIntegerContext),
Message,
Context->PublicExponent);
return Result;
}
```
|
```javascript
import { getQueryParam, removeQueryParam } from 'elementor-editor-utils/query-params';
export class RemoveActiveTabQueryParam extends $e.modules.hookUI.After {
getCommand() {
return 'editor/documents/close';
}
getId() {
return 'remove-active-tab-query-param';
}
apply( args ) {
const activeTab = getQueryParam( 'active-tab' ),
activeDocumentId = parseInt( args.previous_active_document_id ),
closedDocumentId = parseInt( args.id );
if ( activeDocumentId === closedDocumentId && activeTab ) {
removeQueryParam( 'active-tab' );
}
}
}
export default RemoveActiveTabQueryParam;
```
|
Ivan Ćosić (born 23 May 1986) is a former Croatian handballer.
Honours
RK Zamet II
3. HRL - West
Winner (1): 2004-05
Sandefjord
1. Division
Promotion (1): 2010-11
RK Zamet
Croatian Cup
Finalist (1): 2012
References
External links
Ivan Ćosić in European competitions
Ivan Ćosić Premier League stats
1986 births
Living people
Croatian male handball players
Handball players from Rijeka
RK Zamet players
Expatriate handball players
Croatian expatriate sportspeople in Norway
Croatian expatriate sportspeople in Germany
|
```go
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
package zap
import (
"runtime"
"strings"
"sync"
"go.uber.org/zap/internal/bufferpool"
)
const _zapPackage = "go.uber.org/zap"
var (
_stacktracePool = sync.Pool{
New: func() interface{} {
return newProgramCounters(64)
},
}
// We add "." and "/" suffixes to the package name to ensure we only match
// the exact package and not any package with the same prefix.
_zapStacktracePrefixes = addPrefix(_zapPackage, ".", "/")
_zapStacktraceVendorContains = addPrefix("/vendor/", _zapStacktracePrefixes...)
)
func takeStacktrace() string {
buffer := bufferpool.Get()
defer buffer.Free()
programCounters := _stacktracePool.Get().(*programCounters)
defer _stacktracePool.Put(programCounters)
var numFrames int
for {
// Skip the call to runtime.Counters and takeStacktrace so that the
// program counters start at the caller of takeStacktrace.
numFrames = runtime.Callers(2, programCounters.pcs)
if numFrames < len(programCounters.pcs) {
break
}
// Don't put the too-short counter slice back into the pool; this lets
// the pool adjust if we consistently take deep stacktraces.
programCounters = newProgramCounters(len(programCounters.pcs) * 2)
}
i := 0
skipZapFrames := true // skip all consecutive zap frames at the beginning.
frames := runtime.CallersFrames(programCounters.pcs[:numFrames])
// Note: On the last iteration, frames.Next() returns false, with a valid
// frame, but we ignore this frame. The last frame is a a runtime frame which
// adds noise, since it's only either runtime.main or runtime.goexit.
for frame, more := frames.Next(); more; frame, more = frames.Next() {
if skipZapFrames && isZapFrame(frame.Function) {
continue
} else {
skipZapFrames = false
}
if i != 0 {
buffer.AppendByte('\n')
}
i++
buffer.AppendString(frame.Function)
buffer.AppendByte('\n')
buffer.AppendByte('\t')
buffer.AppendString(frame.File)
buffer.AppendByte(':')
buffer.AppendInt(int64(frame.Line))
}
return buffer.String()
}
func isZapFrame(function string) bool {
for _, prefix := range _zapStacktracePrefixes {
if strings.HasPrefix(function, prefix) {
return true
}
}
// We can't use a prefix match here since the location of the vendor
// directory affects the prefix. Instead we do a contains match.
for _, contains := range _zapStacktraceVendorContains {
if strings.Contains(function, contains) {
return true
}
}
return false
}
type programCounters struct {
pcs []uintptr
}
func newProgramCounters(size int) *programCounters {
return &programCounters{make([]uintptr, size)}
}
func addPrefix(prefix string, ss ...string) []string {
withPrefix := make([]string, len(ss))
for i, s := range ss {
withPrefix[i] = prefix + s
}
return withPrefix
}
```
|
```shell
# $OpenBSD: envpass.sh,v 1.5 2022/06/03 04:31:54 djm Exp $
# Placed in the Public Domain.
tid="environment passing"
# NB accepted env vars are in test-exec.sh (_XXX_TEST_* and _XXX_TEST)
# Prepare a custom config to test for a configuration parsing bug fixed in 4.0
cat << EOF > $OBJ/ssh_proxy_envpass
Host test-sendenv-confparse-bug
SendEnv *
EOF
cat $OBJ/ssh_proxy >> $OBJ/ssh_proxy_envpass
cp $OBJ/sshd_proxy $OBJ/sshd_proxy_bak
trace "pass env, don't accept"
verbose "test $tid: pass env, don't accept"
_TEST_ENV=blah ${SSH} -oSendEnv="*" -F $OBJ/ssh_proxy_envpass otherhost \
sh << 'EOF'
test -z "$_TEST_ENV"
EOF
r=$?
if [ $r -ne 0 ]; then
fail "environment found"
fi
trace "setenv, don't accept"
verbose "test $tid: setenv, don't accept"
${SSH} -oSendEnv="*" -F $OBJ/ssh_proxy_envpass -oSetEnv="_TEST_ENV=blah" \
otherhost \
sh << 'EOF'
test -z "$_TEST_ENV"
EOF
r=$?
if [ $r -ne 0 ]; then
fail "environment found"
fi
trace "don't pass env, accept"
verbose "test $tid: don't pass env, accept"
_XXX_TEST_A=1 _XXX_TEST_B=2 ${SSH} -F $OBJ/ssh_proxy_envpass otherhost \
sh << 'EOF'
test -z "$_XXX_TEST_A" && test -z "$_XXX_TEST_B"
EOF
r=$?
if [ $r -ne 0 ]; then
fail "environment found"
fi
trace "pass single env, accept single env"
verbose "test $tid: pass single env, accept single env"
_XXX_TEST=blah ${SSH} -oSendEnv="_XXX_TEST" -F $OBJ/ssh_proxy_envpass \
otherhost sh << 'EOF'
test X"$_XXX_TEST" = X"blah"
EOF
r=$?
if [ $r -ne 0 ]; then
fail "environment not found"
fi
trace "pass multiple env, accept multiple env"
verbose "test $tid: pass multiple env, accept multiple env"
_XXX_TEST_A=1 _XXX_TEST_B=2 ${SSH} -oSendEnv="_XXX_TEST_*" \
-F $OBJ/ssh_proxy_envpass otherhost \
sh << 'EOF'
test X"$_XXX_TEST_A" = X"1" -a X"$_XXX_TEST_B" = X"2"
EOF
r=$?
if [ $r -ne 0 ]; then
fail "environment not found"
fi
trace "setenv, accept"
verbose "test $tid: setenv, accept"
${SSH} -F $OBJ/ssh_proxy_envpass \
-oSetEnv="_XXX_TEST_A=1 _XXX_TEST_B=2" otherhost \
sh << 'EOF'
test X"$_XXX_TEST_A" = X"1" -a X"$_XXX_TEST_B" = X"2"
EOF
r=$?
if [ $r -ne 0 ]; then
fail "environment not found"
fi
trace "setenv, first match wins"
verbose "test $tid: setenv, first match wins"
${SSH} -F $OBJ/ssh_proxy_envpass \
-oSetEnv="_XXX_TEST_A=1 _XXX_TEST_A=11 _XXX_TEST_B=2" otherhost \
sh << 'EOF'
test X"$_XXX_TEST_A" = X"1" -a X"$_XXX_TEST_B" = X"2"
EOF
r=$?
if [ $r -ne 0 ]; then
fail "environment not found"
fi
trace "server setenv wins"
verbose "test $tid: server setenv wins"
cp $OBJ/sshd_proxy_bak $OBJ/sshd_proxy
echo "SetEnv _XXX_TEST_A=23" >> $OBJ/sshd_proxy
${SSH} -F $OBJ/ssh_proxy_envpass \
-oSetEnv="_XXX_TEST_A=1 _XXX_TEST_B=2" otherhost \
sh << 'EOF'
test X"$_XXX_TEST_A" = X"23" -a X"$_XXX_TEST_B" = X"2"
EOF
r=$?
if [ $r -ne 0 ]; then
fail "environment not found"
fi
trace "server setenv first match wins"
verbose "test $tid: server setenv wins"
cp $OBJ/sshd_proxy_bak $OBJ/sshd_proxy
echo "SetEnv _XXX_TEST_A=23 _XXX_TEST_A=42" >> $OBJ/sshd_proxy
${SSH} -F $OBJ/ssh_proxy_envpass \
-oSetEnv="_XXX_TEST_A=1 _XXX_TEST_B=2" otherhost \
sh << 'EOF'
test X"$_XXX_TEST_A" = X"23" -a X"$_XXX_TEST_B" = X"2"
EOF
r=$?
if [ $r -ne 0 ]; then
fail "environment not found"
fi
rm -f $OBJ/ssh_proxy_envpass
```
|
```python
# This file is part of h5py, a Python interface to the HDF5 library.
#
# path_to_url
#
#
# and contributor agreement.
"""
Versioning module for h5py.
"""
from __future__ import absolute_import
from collections import namedtuple
from . import h5 as _h5
import sys
import numpy
# All should be integers, except pre, as validating versions is more than is
# needed for our use case
_H5PY_VERSION_CLS = namedtuple("_H5PY_VERSION_CLS",
"major minor bugfix pre post dev")
hdf5_built_version_tuple = _h5.HDF5_VERSION_COMPILED_AGAINST
version_tuple = _H5PY_VERSION_CLS(2, 8, 0, None, None, None)
version = "{0.major:d}.{0.minor:d}.{0.bugfix:d}".format(version_tuple)
if version_tuple.pre is not None:
version += version_tuple.pre
if version_tuple.post is not None:
version += ".post{0.post:d}".format(version_tuple)
if version_tuple.dev is not None:
version += ".dev{0.dev:d}".format(version_tuple)
hdf5_version_tuple = _h5.get_libversion()
hdf5_version = "%d.%d.%d" % hdf5_version_tuple
api_version_tuple = (1,8)
api_version = "%d.%d" % api_version_tuple
info = """\
Summary of the h5py configuration
---------------------------------
h5py %(h5py)s
HDF5 %(hdf5)s
Python %(python)s
sys.platform %(platform)s
sys.maxsize %(maxsize)s
numpy %(numpy)s
""" % { 'h5py': version,
'hdf5': hdf5_version,
'python': sys.version,
'platform': sys.platform,
'maxsize': sys.maxsize,
'numpy': numpy.__version__ }
```
|
```javascript
import React from 'react'
import Link from 'next/link'
export default () => {
const myRef = React.createRef(null)
React.useEffect(() => {
if (!myRef.current) {
console.error(`ref wasn't updated`)
}
})
return (
<Link
href="/"
ref={(el) => {
myRef.current = el
}}
>
Click me
</Link>
)
}
```
|
Oregon ( ) is a city in and the county seat of Ogle County, Illinois, United States. The population was 3,721 in 2010.
History
The land Oregon, Illinois was founded on was previously held by the Potawatomi and Winnebago Indian tribes. In fact, later, settlers discovered that the area contained a large number of Indian mounds, most in diameter.
Ogle County was a New England settlement. The original founders of Oregon and Rochelle consisted entirely of settlers from New England. These people were "Yankees", that is to say they were descended from the English Puritans who settled New England in the 1600s. They were part of a wave of New England farmers who headed west into what was then the wilds of the Northwest Territory during the early 1800s. Most of them arrived as a result of the completion of the Erie Canal. When they arrived in what is now Bureau County there was nothing but a virgin forest and wild prairie, the New Englanders laid out farms, constructed roads, erected government buildings and established post routes. They brought with them many of their Yankee New England values, such as a passion for education, establishing many schools as well as staunch support for abolitionism. They were mostly members of the Congregationalist Church though some were Episcopalian. Culturally Bureau County, like much of northern Illinois would be culturally very continuous with early New England culture, for most of its history.
The first European to visit the land was pioneer John Phelps. Phelps first visited the area in 1829 and returned in 1833 hoping to find a suitable site to settle. Phelps found a forest and river-fed valley which impressed him enough that he built his cabin there. Other pioneers followed Phelps to this site, and Phelps helped create the first church, school, grocery store, blacksmith shop, and post office in Oregon. By December 4, 1838, due in large part to the efforts of Phelps and his brothers B.T. Phelps and G.W. Phelps, the land was claimed, subdivided and certified by the Ogle County clerk as Oregon City. The name Oregon means "River of the West".
In 1839, Oregon City was renamed Florence after a visitor compared the scenic beauty of the Rock River to the Italian city of the same name. Florence was used for only about three years when the city opted to revert to its original name, without the word "city," in 1843. By 1847 the town had a general store, sawmill, ferry, 44 households and a population of 225. The population continued to grow through the 1850s and 1860s, a fact demonstrated by the increasing number of churches in those decades and the building of a railroad in 1871. Industry followed the railroad and Oregon became home to an oatmeal mill, furniture factory, chair factory, flour mill and a foundry, Paragon Foundry, which operated until the 1960s.
The city of Oregon was first organized under an act of the Illinois General Assembly which was approved on April 1, 1869. By the 1870s the town of Oregon and nearby area was home to around 2,000 people. James Gale was elected the city's first mayor on March 21, 1870 and four other men, Christian Lehman, W.W. Bennett, George M. Dwight and George P. Jacobs, were chosen as aldermen. On March 29, 1873 the city was reorganized because of an act of the Illinois legislature which allowed the municipalities to incorporate as cities and villages. In 1920, the Oregon City Hall was constructed on the perimeter of the city's commercial district and it has been the center of city government ever since. The Ogle County Courthouse was built in 1891 on the corner of Washington Street and Fourth Street (Illinois Route 64 and Illinois Route 2).
Between 1908 and 1911, on a site just north of the city, sculptor Lorado Taft erected a 50-foot tall statue he had designed and originally named The Eternal Indian. Located on a bluff overlooking the Rock River valley, the sculpture is now known as the Black Hawk Statue, named after Black Hawk, a chief of the Sauk Indian tribe that once inhabited the area.
The city of Oregon annexed nearby Daysville, Illinois, in 1993.
Geography
According to the 2010 census, Oregon has a total area of , of which (or 96.65%) is land and (or 3.35%) is water.
Demographics
As of the census of 2010, there were 3,721 citizens, 1,630 households, and 941 families residing in the city. The population density was . There were 1,789 housing units at an average density of . The racial makeup of the city was 95.9% White, .9% African American, 0.1% Native American, 0.8% Asian, 0% Pacific Islander, 1.2% from other races, and 1.1% from two or more races. Hispanic or Latino of any race were 4.2% of the population.
There were 1,630 households, out of which 22.1% had children under the age of 18 living with them, 42.3% were husband-wife families, 10.9% had a female householder with no husband present, and 42.3% were nonfamily households. 36.3% of householders lived alone, 20.1% of which were female and 16.1% male. The average household size was 2.18 and the average family size was 2.83.
In the city, the age distribution of the population shows 79.6% over the age of 18, with 19.6% aged 65 years or older. The median age was 43.5 years.
The median income for a household in the city was $47,971 and the median income for a family was $60,625. Males employed full-time had a median income of $49,958 versus $29,792 for females. The per capita income for the city was $24,832.
11.9% of all residents lived below the poverty level, including 11.6% of families with related children under the age of 18. Of families with a female householder with related children under 18 years and no husband present, 34.4% lived below the poverty line.
Culture
Oregon has a rich history in the arts. As of Feb. 2021, renovations are planned for the historic building known as the Oregon Coliseum, which will create a new museum and cultural center.
The community hosts several major events a year, including the annual Autumn On Parade Candlelight Walk ShamROCK The Town and more
The Arts
In 1898, sculptor Lorado Taft founded the Eagle's Nest Art Colony on a bluff overlooking the Rock River, north of Oregon. Taft and his art colony began to exert an influence on the city of Oregon and its culture. The artists who gathered during the summer at Eagle's Nest would leave a mark on the city below them. One result of the colony's location near Oregon was the inclusion of a second story art gallery in the Oregon Public Library when it was built in 1908. Art colony members were required to contribute to the local culture by giving art shows, lectures and plays. In 1904, Taft created The Blind and then began focusing on more monumental works including The Eternal Indian located just north of Oregon in Illinois' Lowden State Park. Several other Taft works are located in and around Oregon, including The Soldiers' Monument on the courthouse lawn.
Notable people
Norene Arnold, All-American Girls Professional Baseball League player
James H. Cartwright, Illinois Supreme Court justice
Sherman Landers, 5th place triple jumper for the 1920 Summer Olympics Team
Frank Loomis, gold medal and world record-setting 400m hurdler for the 1920 Summer Olympics Team
Frank Orren Lowden, the 25th Governor of Illinois, kept an estate on the river just outside Oregon
Fred Roat, third baseman for the Pittsburgh Alleghenys and Chicago Colts
Lorado Taft, sculptor and friend of Frank Lloyd Wright
See also
Chicago, Burlington & Quincy Railroad Depot
Chana School
Lowden State Park
Oregon Public Library
Pinehill Inn
The Soldiers' Monument
References
Further reading
Behrens, Marsha, et al. "Oregon Public Library", (PDF), National Register of Historic Places Nomination Form, 27 March 2003, HAARGIS Database, Illinois Historic Preservation Agency. Retrieved 4 July 2007.
Novak, Alice. "Oregon Commercial Historic District", (PDF), National Register of Historic Places Nomination Form, 12 July 2006, HAARGIS Database, Illinois Historic Preservation Agency. Retrieved 4 July 2007.
External links
Oregon official website
Oregon Public Library website
Oregon School District Homepage
Oregon-Mt. Morris School merger
Cities in Ogle County, Illinois
Cities in Illinois
County seats in Illinois
Populated places established in 1833
Rockford metropolitan area, Illinois
1833 establishments in Illinois
|
Ana Laura Chávez (born February 18, 1986), commonly known as Ana Laura, is an American singer of Contemporary Christian musician. She released a self-titled debut album in 2006 and had two hit singles on Christian radio, ("Water" and "Completely"). She also contributed to the Christmas compilation Come Let Us Adore Him. She supported democratic nominee Joe Biden in the 2020 election. She is part owner of Brownsville Piano Studio. Ana Laura runs City de Arte.
Discography
Albums
Singles
Music videos
Ana Laura EPK (2005)
Compilation contributions
Come Let Us Adore Him, 2005 - "Sanctus", "Holy, Holy Lord"
Facing the Giants, 2006 - "Completely"
External links
Ana Laura at IMDB
Ana Laura at MySpace
References
1986 births
Living people
21st-century American women singers
American musicians of Mexican descent
American Seventh-day Adventists
American women pop singers
American performers of Christian music
People from Brownsville, Texas
21st-century American singers
|
Kyerwa District is one of the eight districts of the Kagera Region of Tanzania. It is one of the 20 new districts that were formed in Tanzania since 2010; it was split off from Karagwe District. It is bordered to the north by Uganda, to the east by Missenyi District, to the south by Karagwe District and to the west by Rwanda, and has an area of .
According to the 2012 Tanzania National Census, the population of Kyerwa District was 321,026, with a population density of .
The district is home to the Ibanda-Kyerwa National Park. The park is fed by the Kagera river that sustains animals such as hippos, leopards, antelope and buffalo.
Transport
Unpaved trunk road T39 from Kayanga in Karagwe District to the Ugandan border passes through Kyerwa District from Omurushaka, Nkwenda, Isingiro, Kaisho to Murongo.
There is also unpaved road from Kayanga (administrative HQ for Karagwe district) via Rwambaizi, Katera, Businde, Bugomora, Nyamiyaga to Murongo.
Administrative subdivisions
As of 2012, Kyerwa District was administratively divided into 18 wards.
Wards
Bugomora
BUSINDE
Isingiro
Kaisho
Kamuli
Kibale
Kibingo
Kikukuru
Kimuli
Kyerwa
Mabira
Murongo
Nkwenda
Nyakatuntu
Rukuraijo
Rutunguru
Rwabwere
Songambele
Kitwechenkura
References
Districts of Kagera Region
|
```c++
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
/*
* This file contains a simple demo for how to take a model for inference with
* IPUs.
* Model: wget -q
* path_to_url
*/
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#include "glog/logging.h"
#include "paddle/common/flags.h"
#include "paddle/fluid/inference/api/paddle_inference_api.h"
PD_DEFINE_string(infer_model, "", "Directory of the inference model.");
using paddle_infer::Config;
using paddle_infer::CreatePredictor;
using paddle_infer::Predictor;
void inference(std::string model_path,
bool use_ipu,
std::vector<float> *out_data) {
//# 1. Create Predictor with a config.
Config config;
config.SetModel(FLAGS_infer_model);
if (use_ipu) {
// ipu_device_num, ipu_micro_batch_size
config.EnableIpu(1, 4);
}
auto predictor = CreatePredictor(config);
//# 2. Prepare input/output tensor.
auto input_names = predictor->GetInputNames();
std::vector<int64_t> data{1, 2, 3, 4};
// For simplicity, we set all the slots with the same data.
for (auto input_name : input_names) {
auto input_tensor = predictor->GetInputHandle(input_name);
input_tensor->Reshape({4, 1});
input_tensor->CopyFromCpu(data.data());
}
//# 3. Run
predictor->Run();
//# 4. Get output.
auto output_names = predictor->GetOutputNames();
auto output_tensor = predictor->GetOutputHandle(output_names[0]);
std::vector<int> output_shape = output_tensor->shape();
int out_num = std::accumulate(
output_shape.begin(), output_shape.end(), 1, std::multiplies<int>());
out_data->resize(out_num);
output_tensor->CopyToCpu(out_data->data());
}
int main(int argc, char *argv[]) {
::paddle::flags::ParseCommandLineFlags(&argc, &argv);
std::vector<float> ipu_result;
std::vector<float> cpu_result;
inference(FLAGS_infer_model, true, &ipu_result);
inference(FLAGS_infer_model, false, &cpu_result);
for (size_t i = 0; i < ipu_result.size(); i++) {
CHECK_NEAR(ipu_result[i], cpu_result[i], 1e-6);
}
LOG(INFO) << "Finished";
}
```
|
Pope Adrian 37th Psychristiatric is a concept album by the band Rudimentary Peni. It was recorded in 1992 and released in 1995. The majority of the album was written while lead singer/guitarist Nick Blinko was being detained in a psychiatric hospital under Section 3 of the 1983 Mental Health Act. The subject matter of the album relates to the delusions Blinko was experiencing at the time, particularly the idea that he was "Pope Adrian 37th" — a reference to Pope Adrian IV.
Adding to the album's unique sound, the pseudo-latinized phrase "Papas Adrianus" (Pope Adrian) is looped and can be heard in the background through the entire album.
Blinko provided the artwork for the album.
Track listing
"Pogo Pope"
"The Pope with No Name"
"Hadrianich Relique"
"Il Papus Puss"
"Muse Sick (Sic)"
"Vatican't City Hearse"
"I'm a Dream"
"We're Gonna Destroy Life the World Gets Higher and Higher"
"Pills, Popes And Potions"
"Ireland Sun"
"Regicide Chaz III"
"Iron Lung"
References
Concept albums
1995 albums
Rudimentary Peni albums
|
```html
<!DOCTYPE html>
<!--[if IE]><![endif]-->
<html>
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1">
<title>Class NumberParser
</title>
<meta name="viewport" content="width=device-width">
<meta name="title" content="Class NumberParser
">
<meta name="generator" content="docfx 2.59.4.0">
<link rel="shortcut icon" href="../favicon.ico">
<link rel="stylesheet" href="../styles/docfx.vendor.css">
<link rel="stylesheet" href="../styles/docfx.css">
<link rel="stylesheet" href="../styles/main.css">
<meta property="docfx:navrel" content="../toc.html">
<meta property="docfx:tocrel" content="toc.html">
<meta property="docfx:rel" content="../">
</head>
<body data-spy="scroll" data-target="#affix" data-offset="120">
<div id="wrapper">
<header>
<nav id="autocollapse" class="navbar navbar-inverse ng-scope" role="navigation">
<div class="container">
<div class="navbar-header">
<button type="button" class="navbar-toggle" data-toggle="collapse" data-target="#navbar">
<span class="sr-only">Toggle navigation</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<a class="navbar-brand" href="../index.html">
<img id="logo" class="svg" src="../logo.svg" alt="">
</a>
</div>
<div class="collapse navbar-collapse" id="navbar">
<form class="navbar-form navbar-right" role="search" id="search">
<div class="form-group">
<input type="text" class="form-control" id="search-query" placeholder="Search" autocomplete="off">
</div>
</form>
</div>
</div>
</nav>
<div class="subnav navbar navbar-default">
<div class="container hide-when-search" id="breadcrumb">
<ul class="breadcrumb">
<li></li>
</ul>
</div>
</div>
</header>
<div class="container body-content">
<div id="search-results">
<div class="search-list">Search Results for <span></span></div>
<div class="sr-items">
<p><i class="glyphicon glyphicon-refresh index-loading"></i></p>
</div>
<ul id="pagination" data-first="First" data-prev="Previous" data-next="Next" data-last="Last"></ul>
</div>
</div>
<div role="main" class="container body-content hide-when-search">
<div class="sidenav hide-when-search">
<a class="btn toc-toggle collapse" data-toggle="collapse" href="#sidetoggle" aria-expanded="false" aria-controls="sidetoggle">Show / Hide Table of Contents</a>
<div class="sidetoggle collapse" id="sidetoggle">
<div id="sidetoc"></div>
</div>
</div>
<div class="article row grid-right">
<div class="col-md-10">
<article class="content wrap" id="_content" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser">
<h1 id="System_Linq_Dynamic_Core_Parser_NumberParser" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser" class="text-break">Class NumberParser
</h1>
<div class="markdown level0 summary"><p>NumberParser</p>
</div>
<div class="markdown level0 conceptual"></div>
<div class="inheritance">
<h5>Inheritance</h5>
<div class="level0"><span class="xref">System.Object</span></div>
<div class="level1"><span class="xref">NumberParser</span></div>
</div>
<div class="inheritedMembers">
<h5>Inherited Members</h5>
<div>
<span class="xref">System.Object.ToString()</span>
</div>
<div>
<span class="xref">System.Object.Equals(System.Object)</span>
</div>
<div>
<span class="xref">System.Object.Equals(System.Object, System.Object)</span>
</div>
<div>
<span class="xref">System.Object.ReferenceEquals(System.Object, System.Object)</span>
</div>
<div>
<span class="xref">System.Object.GetHashCode()</span>
</div>
<div>
<span class="xref">System.Object.GetType()</span>
</div>
<div>
<span class="xref">System.Object.MemberwiseClone()</span>
</div>
</div>
<h6><strong>Namespace</strong>: <a class="xref" href="System.Linq.Dynamic.Core.Parser.html">System.Linq.Dynamic.Core.Parser</a></h6>
<h6><strong>Assembly</strong>: System.Linq.Dynamic.Core.dll</h6>
<h5 id="System_Linq_Dynamic_Core_Parser_NumberParser_syntax">Syntax</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public class NumberParser</code></pre>
</div>
<h3 id="constructors">Constructors
</h3>
<span class="small pull-right mobile-hide">
<span class="divider">|</span>
<a href="path_to_url">Improve this Doc</a>
</span>
<span class="small pull-right mobile-hide">
<a href="path_to_url#L27">View Source</a>
</span>
<a id="System_Linq_Dynamic_Core_Parser_NumberParser__ctor_" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.#ctor*"></a>
<h4 id=your_sha256_hashynamic_Core_ParsingConfig_" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.#ctor(System.Linq.Dynamic.Core.ParsingConfig)">NumberParser(ParsingConfig)</h4>
<div class="markdown level1 summary"><p>Initializes a new instance of the <a class="xref" href="System.Linq.Dynamic.Core.Parser.NumberParser.html">NumberParser</a> class.</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public NumberParser(ParsingConfig config)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><a class="xref" href="System.Linq.Dynamic.Core.ParsingConfig.html">ParsingConfig</a></td>
<td><span class="parametername">config</span></td>
<td><p>The ParsingConfig.</p>
</td>
</tr>
</tbody>
</table>
<h3 id="methods">Methods
</h3>
<span class="small pull-right mobile-hide">
<span class="divider">|</span>
<a href="path_to_url">Improve this Doc</a>
</span>
<span class="small pull-right mobile-hide">
<a href="path_to_url#L38">View Source</a>
</span>
<a id=your_sha256_hash_" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.ParseIntegerLiteral*"></a>
<h4 id=your_sha256_hash_System_Int32_System_String_" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.ParseIntegerLiteral(System.Int32,System.String)">ParseIntegerLiteral(Int32, String)</h4>
<div class="markdown level1 summary"><p>Tries to parse the text into a IntegerLiteral ConstantExpression.</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public Expression ParseIntegerLiteral(int tokenPosition, string text)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">System.Int32</span></td>
<td><span class="parametername">tokenPosition</span></td>
<td><p>The current token position (needed for error reporting).</p>
</td>
</tr>
<tr>
<td><span class="xref">System.String</span></td>
<td><span class="parametername">text</span></td>
<td><p>The text.</p>
</td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">System.Linq.Expressions.Expression</span></td>
<td></td>
</tr>
</tbody>
</table>
<span class="small pull-right mobile-hide">
<span class="divider">|</span>
<a href="path_to_url">Improve this Doc</a>
</span>
<span class="small pull-right mobile-hide">
<a href="path_to_url#L215">View Source</a>
</span>
<a id="System_Linq_Dynamic_Core_Parser_NumberParser_ParseNumber_" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.ParseNumber*"></a>
<h4 id=your_sha256_hashString_System_Type_" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.ParseNumber(System.String,System.Type)">ParseNumber(String, Type)</h4>
<div class="markdown level1 summary"><p>Parses the number (text) into the specified type.</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public object ParseNumber(string text, Type type)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">System.String</span></td>
<td><span class="parametername">text</span></td>
<td><p>The text.</p>
</td>
</tr>
<tr>
<td><span class="xref">System.Type</span></td>
<td><span class="parametername">type</span></td>
<td><p>The type.</p>
</td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">System.Object</span></td>
<td></td>
</tr>
</tbody>
</table>
<span class="small pull-right mobile-hide">
<span class="divider">|</span>
<a href="path_to_url">Improve this Doc</a>
</span>
<span class="small pull-right mobile-hide">
<a href="path_to_url#L162">View Source</a>
</span>
<a id="System_Linq_Dynamic_Core_Parser_NumberParser_ParseRealLiteral_" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.ParseRealLiteral*"></a>
<h4 id=your_sha256_hashstem_String_System_Char_System_Boolean_" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.ParseRealLiteral(System.String,System.Char,System.Boolean)">ParseRealLiteral(String, Char, Boolean)</h4>
<div class="markdown level1 summary"><p>Parse the text into a Real ConstantExpression.</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public Expression ParseRealLiteral(string text, char qualifier, bool stripQualifier)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">System.String</span></td>
<td><span class="parametername">text</span></td>
<td></td>
</tr>
<tr>
<td><span class="xref">System.Char</span></td>
<td><span class="parametername">qualifier</span></td>
<td></td>
</tr>
<tr>
<td><span class="xref">System.Boolean</span></td>
<td><span class="parametername">stripQualifier</span></td>
<td></td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">System.Linq.Expressions.Expression</span></td>
<td></td>
</tr>
</tbody>
</table>
<span class="small pull-right mobile-hide">
<span class="divider">|</span>
<a href="path_to_url">Improve this Doc</a>
</span>
<span class="small pull-right mobile-hide">
<a href="path_to_url#L204">View Source</a>
</span>
<a id="System_Linq_Dynamic_Core_Parser_NumberParser_TryParseNumber_" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.TryParseNumber*"></a>
<h4 id=your_sha256_hashem_String_System_Type_System_Object__" data-uid="System.Linq.Dynamic.Core.Parser.NumberParser.TryParseNumber(System.String,System.Type,System.Object@)">TryParseNumber(String, Type, out Object)</h4>
<div class="markdown level1 summary"><p>Tries to parse the number (text) into the specified type.</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public bool TryParseNumber(string text, Type type, out object result)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">System.String</span></td>
<td><span class="parametername">text</span></td>
<td><p>The text.</p>
</td>
</tr>
<tr>
<td><span class="xref">System.Type</span></td>
<td><span class="parametername">type</span></td>
<td><p>The type.</p>
</td>
</tr>
<tr>
<td><span class="xref">System.Object</span></td>
<td><span class="parametername">result</span></td>
<td><p>The result.</p>
</td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">System.Boolean</span></td>
<td></td>
</tr>
</tbody>
</table>
</article>
</div>
<div class="hidden-sm col-md-2" role="complementary">
<div class="sideaffix">
<div class="contribution">
<ul class="nav">
<li>
<a href="path_to_url" class="contribution-link">Improve this Doc</a>
</li>
<li>
<a href="path_to_url#L12" class="contribution-link">View Source</a>
</li>
</ul>
</div>
<nav class="bs-docs-sidebar hidden-print hidden-xs hidden-sm affix" id="affix">
<h5>In This Article</h5>
<div></div>
</nav>
</div>
</div>
</div>
</div>
<footer>
<div class="grad-bottom"></div>
<div class="footer">
<div class="container">
<span class="pull-right">
<a href="#top">Back to top</a>
</span>
<span>Generated by <strong>DocFX</strong></span>
</div>
</div>
</footer>
</div>
<script type="text/javascript" src="../styles/docfx.vendor.js"></script>
<script type="text/javascript" src="../styles/docfx.js"></script>
<script type="text/javascript" src="../styles/main.js"></script>
</body>
</html>
```
|
Niphargus is by far the largest genus of its family, the Niphargidae, and the largest of all freshwater amphipod genera.
Usually, these animals inhabit caves or groundwater. They occur in western Eurasia, in regions that were not covered by the Pleistocene ice sheets. They are found throughout most of Europe with the notable exception of the Nordics and they are also largely missing from Iberia. The genus extends into Asia as far as the Arabian Peninsula and Iran. In their main range – the central Mediterranean region through Central and Eastern Europe to the Ukraine – they are among the most significant organisms inhabiting the groundwater. In the Dinaric Alps alone there are at least 45 species. There are also six species in the British Isles (the northernmost Niphargus): N. aquilex, N. fontanus, N. glenniei and N. kochianus of Great Britain, and N. irlandicus and N. wexfordensis of Ireland. Although the individual species often have very small ranges and only live at a narrow water temperature range, the genus includes both species of cold and relatively warm places, taken to the extreme in N. thermalis from thermal waters.
Niphargus are extremely variable in their appearance (more so than even some amphipod families), but are whitish and completely lack eyes. They are fairly small, ranging from about in length in the smallest species to about in the largest. At least some of the species are highly resistant to starvation and able to survive for more than 200 days without food.
Species
The taxonomy of Niphargus is highly complex. The genus contains the following species:
Niphargus abchasicus Martynov, 1932
Niphargus aberrans Sket, 1972
Niphargus ablaskiri Birstein, 1940
Niphargus abricossovi Birstein, 1932
Niphargus adbiptus G. Karaman, 1973
Niphargus adei S. Karaman, 1934
Niphargus affinis Dobreanu, Manolache & Puscariu, 1953
Niphargus aggtelekiensis Dudich, 1932
Niphargus alasonius Derzhavin, 1945
Niphargus alatus G. Karaman, 1973
Niphargus alpinus G. Karaman & Ruffo, 1989
Niphargus altagahizi Alouf, 1973
Niphargus alutensis Dancau, 1971
Niphargus ambulator G. Karaman, 1975
Niphargus anatolicus S. Karaman, 1950
Niphargus andropus Schellenberg, 1940
Niphargus angelieri Ruffo, 1954
Niphargus anticolanus d’Ancona, 1934
Niphargus apuanus Ruffo, 1936
Niphargus aquilex Schioedte, 1855
Niphargus arbiter G. Karaman, 1985
Niphargus arcanus G. Karaman, 1988
Niphargus armatus G. Karaman, 1985
Niphargus asper G. Karaman, 1972
Niphargus auerbachi Schellenberg, 1934
Niphargus aulicus G. S. Karaman, 1991
Niphargus bajuvaricus Schellenberg, 1932
Niphargus balazuci Schellenberg, 1951
Niphargus balcanicus Absolon, 1927
Niphargus baloghi Dudich, 1940
Niphargus banaticus Dobreanu & Manolache, 1936
Niphargus banjanus S. Karaman, 1943
Niphargus barbatus Karaman, 1985
Niphargus bihorensis Schellenberg, 1940
Niphargus bilecanus S. Karaman, 1953
Niphargus biljanae Karaman, 1998
Niphargus birsteini Dedyu, 1963
Niphargus bitoljensis S. Karaman, 1943
Niphargus bodoni Karaman, 1985
Niphargus borkanus S. Karaman, 1960
Niphargus borutzkyi Birstein, 1933
Niphargus boskovici S. Karaman, 1952
Niphargus bosniacus S. Karaman, 1943
Niphargus boulangei Wichers, 1964
Niphargus brachytelson S. Karaman, 1952
Niphargus brevicuspis Schellenberg, 1937
Niphargus brevirostris Sket, 1971
Niphargus brixianus Ruffo, 1937
Niphargus bulgaricus Andreev, 2001
Niphargus bureschi Fage, 1926
Niphargus burgundus Graf & Straskraba, 1967
Niphargus buturovici S. Karaman, 1958
Niphargus caelestis G. Karaman, 1982
Niphargus canui G. Karaman, 1976
Niphargus carcerarius G. Karaman, 1989
Niphargus carniolicus Sket, 1960
Niphargus carpathicus Dobreanu & Manolache, 1939
Niphargus carpathorossicus Straskraba, 1957
Niphargus carsicus Straskraba, 1956
Niphargus casimiriensis Skalski, 1980
Niphargus castellanus S. Karaman, 1960
Niphargus catalogus G. S. Karaman, 1995
Niphargus cavernicolus Dobreanu & Manolache, 1957
Niphargus cepelarensis S. Karaman & G. Karaman, 1959
Niphargus ciliatus Chevreux, 1906
Niphargus cismontanus Margalef, 1952
Niphargus corinae Dedyu, 1963
Niphargus corniculanus Iannilli&Vigna-Taglianti, 2005
Niphargus corsicanus Schellenberg, 1950
Niphargus costozzae Schellenberg, 1935
Niphargus croaticus Jurinac, 1888
Niphargus cubanicus Birstein, 1954
Niphargus cvijici S. Karaman, 1950
Niphargus d’anconai Benedetti, 1942
Niphargus dabarensis Fišer, Trontelj & Sket, 2006
Niphargus dacicus Dancau, 1963
Niphargus dalmatinus Schaferna, 1922
Niphargus danconai Benedetti, 1942
Niphargus danconai S. Karaman, 1954
Niphargus danielopoli Karaman, 1994
Niphargus debilis Ruffo, 1936
Niphargus decui G. Karaman & Sarbu, 1995
Niphargus deelemanae G. Karaman, 1973
Niphargus delamarei Ruffo, 1954
Niphargus derzhavini Birstein, 1952
Niphargus dimorphopus Stock & Gledhill, 1977
Niphargus dimorphus Birstein, 1961
Niphargus dissonus G. Karaman, 1984
Niphargus dobati Sket, 1999
Niphargus dobrogicus Dancau, 1964
Niphargus dojranensis G. Karaman, 1960
Niphargus dolenianesis Lorenzi, 1898
Niphargus dolichopus Fišer, Trontelj & Sket, 2006
Niphargus dubius Dobreanu & Manolache
Niphargus dudichi Hanko, 1924
Niphargus duplus G. Karaman, 1976
Niphargus echion G. Karaman & Gottstein Matočec, 2006
Niphargus effossus Dudich, 1943
Niphargus elegans Garbini, 1894
Niphargus enslini S. Karaman, 1932
Niphargus eugeniae Derzhavin, 1945
Niphargus factor Sket & G. Karaman, 1990
Niphargus fontanus Bate, 1859
Niphargus fongi Fišer & Zagmajster, 2009
Niphargus fontophilus S. Karaman, 1943
Niphargus foreli Humbert, 1877
Niphargus forroi Karaman, 1986
Niphargus galenae Derzhavin, 1939
Niphargus gallicus Schellenberg, 1935
Niphargus galvagnii Ruffo, 1953
Niphargus gebhardti Schellenberg, 1934
Niphargus georgievi S. Karaman & G. Karaman, 1959
Niphargus gineti Bou, 1965
Niphargus glontii Behning, 1940
Niphargus graecus S. Karaman, 1934
Niphargus grandii Ruffo, 1937
† Niphargus groehni Coleman & Myers, 2001
Niphargus gurjanovae Birstein, 1941
Niphargus hadzii Rejic, 1956
Niphargus hebereri Schellenberg, 1933
Niphargus hercegovinensis S. Karaman, 1950
Niphargus hoverlicus Dedyu, 1963
Niphargus hrabei S. Karaman, 1932
Niphargus hungaricus Mehely, 1937
Niphargus hvarensis S. Karaman, 1952
Niphargus ictus G. Karaman, 1985
Niphargus illidzensis Schaferna, 1922
Niphargus incertus Dobreanu, Manolache & Puscariu, 1951
Niphargus inclinatus G. Karaman, 1973
Niphargus inermis Birstein, 1940
Niphargus iniochus Birstein, 1941
Niphargus inopinatus Schellenberg, 1932
Niphargus inornatus Derzhavin, 1945
Niphargus irlandicus Schellenberg, 1932
Niphargus italicus G. Karaman, 1976
Niphargus itus G. Karaman, 1986
Niphargus ivokaramani G. Karaman, 1994
Niphargus jadranko Sket & G. Karaman, 1990
Niphargus jalzici G. Karaman, 1989
Niphargus jaroschenkoi Dedyu, 1963
Niphargus jovanovici S. Karaman, 1931
Niphargus jugoslavicus G. Karaman, 1982
Niphargus jurinaci S. Karaman, 1950
Niphargus karamani Schellenberg, 1935
Niphargus kenki S. Karaman, 1952
Niphargus kieferi Schellenberg, 1936
Niphargus kirgizi Fišer, Çamur-Elipek & Özbek, 2009
Niphargus kochianus Bate, 1859
Niphargus kolombatovici S. Karaman, 1950
Niphargus komareki S. Karaman, 1932
Niphargus korosensis Dudich, 1943
Niphargus kosanini S. Karaman, 1943
Niphargus kragujevensis S. Karaman, 1950
Niphargus krameri Schellenberg, 1935
Niphargus kurdus Derzhavin, 1945
Niphargus kusceri S. Karaman, 1950
Niphargus labacensis Sket, 1956
Niphargus ladmiraulti Chevreux, 1901
Niphargus laisi Schellenberg, 1936
Niphargus laticaudatus Schellenberg, 1940
Niphargus latimanus Birstein, 1952
Niphargus lattingerae G. Karaman, 1983
Niphargus leopoliensis Jaworowski, 1893
Niphargus lessiniensis Stoch, 1998
Niphargus liburnicus G. Karaman & Sket, 1989
Niphargus likanus S. Karaman, 1952
Niphargus lindbergi S. Karaman, 1956
Niphargus longicaudatus A. Costa, 1851
Niphargus longidactylus Ruffo, 1937
Niphargus longiflagellum S. Karaman, 1950
Niphargus lori Derzhavin, 1945
Niphargus lourensis Fišer, Trontelj & Sket, 2006
Niphargus lunaris G. Karaman, 1985
Niphargus macedonicus S. Karaman, 1929
Niphargus magnus Birstein, 1940
Niphargus maximus S. Karaman, 1929
Niphargus mediodanubilais Dudich, 1941
Niphargus medvednicae S. Karaman, 1950
Niphargus melticensis Dancau & Andreev, 1973
Niphargus meridionalis Dobreanu & Manolache, 1942
Niphargus messanai G. Karaman, 1989
Niphargus microcerberus Sket, 1972
Niphargus miljeticus Straškraba, 1959
Niphargus minor Sket, 1956
Niphargus moldavicus Dobreanu, Manolache & Puscariu, 1953
Niphargus molnari Mehely, 1927
Niphargus montellianus Stoch, 1998
Niphargus montenigrinus G. Karaman, 1962
Niphargus multipennatus Sket, 1956
Niphargus nadarini Alouf, 1972
Niphargus nicaensis Isnard, 1916
Niphargus novomestanus S. Karaman, 1952
Niphargus numerus G. Karaman & Sket, 1990
Niphargus occultus G. Karaman, 1993-94
Niphargus ohridanus S. Karaman, 1929
Niphargus orcinus Joseph, 1869
Niphargus orientalis S. Karaman, 1950
Niphargus osogovensis S. Karaman, 1959
Niphargus otharicus Birstein, 1952
Niphargus pachypus Schellenberg, 1933
Niphargus pachytelson Sket, 1960
Niphargus pancici S. Karaman, 1929
Niphargus pannonicus S. Karaman, 1950
Niphargus parapupetta G. Karaman, 1984
Niphargus parenzani Ruffo & Vigna–Taglianti, 1968
Niphargus parvus S. Karaman, 1943
Niphargus pasquinii Vigna-Taglianti, 1966
Niphargus pater Mehely, 1941
Niphargus patrizii Ruffo & Vigna–Taglianti, 1968
Niphargus pavicevici G. Karaman, 1976
Niphargus pecarensis S. Karaman & G. Karaman, 1959
Niphargus pectencoronatae Sket & G. Karaman, 1990
Niphargus pectinicauda Sket, 1971
Niphargus pedemontanus Ruffo, 1937
Niphargus pellagonicus S. Karaman, 1943
Niphargus pescei G. Karaman, 1984
Niphargus petkovskii G. Karaman, 1963
Niphargus petrosani Dobreanu & Manolache, 1933
Niphargus phreaticolus Motas, Dobreanu & Manolache, 1948
Niphargus plateaui Chevreux, 1901
Niphargus pliginskii Martynov, 1930
Niphargus podgoricensis S. Karaman, 1934
Niphargus podpecanus S. Karaman, 1952
Niphargus poianoi G. Karaman, 1988
Niphargus polonicus Schellenberg, 1936
Niphargus poloninicus Straškraba, 1957
Niphargus polymorphus Fišer, Trontelj & Sket, 2006
Niphargus ponoricus Dancau, 1963
Niphargus potamophilus Birstein, 1954
Niphargus pretneri Sket, 1959
Niphargus pseudocaspius G. Karaman, 1982
Niphargus pseudokochianus Dobreanu, Manolache & Puscariu, 1953
Niphargus pseudolatimanus Birstein, 1952
Niphargus pulevici G. Karaman, 1967
Niphargus pupetta Sket, 1962
Niphargus puteanus (C. L. Koch, 1836)
Niphargus rajecensis Schellenberg, 1938
Niphargus ravanicanus S. Karaman, 1943
Niphargus redenseki Sket, 1959
Niphargus rejici Sket, 1958
Niphargus remus G. Karaman, 1992
Niphargus remyi S. Karaman, 1934
Niphargus renei Karaman, 1986
Niphargus rhenorhodanensis Schellenberg, 1937
Niphargus rhodi S. Karaman, 1950
Niphargus robustus Chevreux, 1901
Niphargus romanicus Dobreanu & Manolache, 1942
Niphargus romuleus Vigna-Taglianti, 1968
Niphargus rostratus Sket, 1971
Niphargus rucneri G. Karaman, 1962
Niphargus ruffoi G. Karaman, 1976
Niphargus salonitanus S. Karaman, 1950
Niphargus sanctinaumi S. Karaman, 1943
Niphargus schellenbergi S. Karaman, 1932
Niphargus schusteri G. Karaman, 1991
Niphargus scopicauda Fišer, Coleman, Zagmajster, Zwittnig, Gerecke & Sket, 2010
Niphargus serbicus S. Karaman, 1960
Niphargus sertaci Fišer, Çamur-Elipek & Özbek, 2009
Niphargus setiferus Schellenberg, 1937
Niphargus sibillinianus G. Karaman, 1984
Niphargus similis G. Karaman & Ruffo, 1989
Niphargus sketi G. Karaman, 1966
Niphargus skopljensis S. Karaman, 1929
Niphargus slovenicus S. Karaman, 1932
Niphargus smederevanus S. Karaman, 1950
Niphargus smirnovi Birstein, 1952
Niphargus sodalis G. Karaman, 1984
Niphargus somesensis Motas, Dobreanu & Manolache, 1948
Niphargus speziae Schellenberg, 1936
Niphargus sphagnicolus Rejic, 1956
Niphargus spinulifemur S. Karaman, 1954
Niphargus spoeckeri Schellenberg, 1933
Niphargus stadleri S. Karaman, 1932
Niphargus stankoi G. Karaman, 1974
Niphargus stebbingi Cecchini
Niphargus stefanellii Ruffo & Vigna-Taglianti, 1968
Niphargus stenopus Sket, 1960
Niphargus steueri Schellenberg, 1935
Niphargus stochi G. Karaman, 1994
Niphargus strouhali Schellenberg, 1933
Niphargus stygius Schiodte, 1847 – type species
Niphargus stygocharis Dudich, 1943
Niphargus submersus Derzhavin, 1945
Niphargus subtypicus Sket, 1960
Niphargus talikadzei Giliarov, Lagidze, Levushkin & Talikadze, 1974
Niphargus tamaninii Ruffo, 1953
Niphargus tatrensis Wrzesniowsky, 1888
Niphargus tauri Schellenberg, 1933
Niphargus tauricus Birstein, 1964
Niphargus tenuicaudatus Schellenberg, 1940
Niphargus thermalis Dudich, 1941
Niphargus thienemanni Schellenberg, 1934
Niphargus thuringius Schellenberg, 1934
Niphargus timavi S. Karaman, 1954
Niphargus toplicensis Andreev, 1966
Niphargus transitivus Sket, 1971
Niphargus transsylvanicus Schellenberg, 1934
Niphargus tridentinus Stoch, 1998
Niphargus trullipes Sket, 1958
Niphargus vadimi Birstein, 1961
Niphargus valachicus Dobreanu & Manolache, 1933
Niphargus vandeli Barbe, 1961
Niphargus variabilis Dobreanu, Manolache & Puscariu, 1953
Niphargus velesensis S. Karaman, 1943
Niphargus versluysi S. Karaman, 1950
Niphargus vinodolensis Fišer, Sket & Stoch, 2006
Niphargus virei Chevreux, 1896
Niphargus vjeternicensis S. Karaman, 1932
Niphargus vlkanovi S. Karaman & G. Karaman, 1959
Niphargus vodnensis S. Karaman, 1943
Niphargus vornatscheri Schellenberg, 1934
Niphargus vranjinae G. Karaman, 1967
Niphargus vulgaris G. Karaman, 1968
Niphargus wexfordensis Karaman, Gledhill & Holmes, 1994
Niphargus wolfi Schellenberg, 1933
Niphargus zagrebensis S. Karaman, 1950
Niphargus zavalanus S. Karaman, 1950
Niphargus zorae G. Karaman, 1967
References
Niphargidae
Amphipod genera
Taxa named by Jørgen Matthias Christian Schiødte
Taxonomy articles created by Polbot
|
Ischiocentra is a genus of longhorn beetles of the subfamily Lamiinae, containing the following species:
Ischiocentra clavata Thomson, 1860
Ischiocentra diringshofeni Lane, 1956
Ischiocentra disjuncta Martins & Galileo, 1990
Ischiocentra hebes (Thomson, 1868)
Ischiocentra monteverdensis Giesbert, 1984
Ischiocentra nobilitata Thomson, 1868
Ischiocentra punctata Martins & Galileo, 2005
Ischiocentra quadrisignata Thomson, 1868
Ischiocentra stockwelli Giesbert, 1984
References
Onciderini
|
```python
Built-in `list` methods
`bytes` type
`date` object
`Module`s everywhere!
Get the most of `float`s
```
|
TU Mensae is a cataclysmic variable star of (SU Ursae Majoris subtype) in the constellation Mensa. A close binary, it consists of a white dwarf and low-mass star orbiting each other in 2 hours 49 minutes. The stars are close enough that the white dwarf strips material off the other star, creating an accretion disc that periodically ignites with a resulting brightening of the system. These result in an increase in brightness lasting around a day every 37 days. Brighter outbursts, known as superhumps, last 5-20 days and take place every 194 days. The properties of TU Mensae have been difficult to calculate, as the calculated mass ratio between the two stars mean there should not be superhumps.
TU Mensae has an apparent magnitude of 18.6 when quiescent, brightening to 11.8 in outburst. The companion star has been calculated to be a red dwarf of spectral type M4V, and the white dwarf has an estimated mass around 80% that of the Sun. The orbital period is one of the longest for cataclysmic variable systems exhibiting superhumps.
References
White dwarfs
Dwarf novae
Mensa (constellation)
Mensae, TU
|
Brooklyn Institute for Social Research (BISR), founded in 2012, is a non-profit interdisciplinary education and research institute based in New York City that offers university-style seminar classes, primarily in the humanities and social sciences, to adult learners. Alongside classes, BISR supports public research, programs with labor, non-profit, and activist organizations, and independent scholarly work outside the university. BISR is not a traditional degree-granting educational institution; rather, students enroll on a per-course basis to learn about topics that interest them. BISR classes typically take place in the evenings in a variety of public spaces, including museums, bars, bookstores, and community spaces.
History
BISR was founded in 2012 by current executive director Ajay Singh Chaudhary. As a doctoral candidate at Columbia's Institute for Comparative Literature and Society, Chaudhary conceived of BISR "as something of an alternative—for both students and professors—to our current higher education system."
The institute's first faculty were fellow Columbia Ph.D. candidates Christine Smallwood, Abby Kluchin, and Michael Brent. The institute emphasizes "pedagogy and interdisciplinary work".
The first course offered by BISR, in January 2012, was "Politics of the City", a study of ancient Greek political philosophy. Other early courses included "Dreams and Hysteria: An Introduction to Freud", "Shocks and Phantasmagoria: Walter Benjamin and the Arcades Project", "Telegraphs, Pneumatic Tubes and Teleportation; Or, the Way We Communicate Now", "Philosophy and Film" and "Realism".
Side by side with its course offerings, BISR also runs a number of projects and programs. The Podcast for Social Research is "a forum for the school's staff to discuss books, films, current affairs, and other pressing concerns". Days of Learning offers an opportunity for students "to learn about a particular topic – like Melville and the literature of Wall Street or Hannah Arendt – with no required preparations."
From its founding in 2011 through the fall of 2015, it offered between 12 and 20 courses a year. Between 2015 and 2016, it offered 70 courses and enrolled 1,000 students. By mid-2016, BISR had 40 faculty members in total. In 2017, it offered over 85 classes in New York City alone.
Campus
BISR classes typically take place in the evenings in a variety of public spaces, including museums, bars, bookstores, and community spaces.
In recent years BISR has expanded and diversified its programming, offering sliding-scale courses across the Midwest through BISR Network, political education to labor and community groups through BISR Praxis, free courses to disadvantaged communities through Community Initiative, and discounted courses to public school teachers through Educator Access.
BISR currently holds courses in New York City, Philadelphia, as well as smaller centers in Michigan, Ohio, and Kentucky.
See also
Core Curriculum (Columbia College)
University of Frankfurt Institute for Social Research
References
External links
Official website
2011 establishments in New York City
Adult education in the United States
Lifelong learning
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "path_to_url">
<plist version="1.0">
<dict>
<key>BuildMachineOSBuild</key>
<string>12D78</string>
<key>CFBundleDevelopmentRegion</key>
<string>English</string>
<key>CFBundleExecutable</key>
<string>Vorbis</string>
<key>CFBundleGetInfoString</key>
<key>CFBundleIdentifier</key>
<string>org.xiph.vorbis</string>
<key>CFBundleInfoDictionaryVersion</key>
<string>6.0</string>
<key>CFBundlePackageType</key>
<string>FMWK</string>
<key>CFBundleShortVersionString</key>
<string>1.2.3</string>
<key>CFBundleSignature</key>
<string>????</string>
<key>CFBundleVersion</key>
<string>1.2.3</string>
<key>CSResourcesFileMapped</key>
<true/>
<key>DTCompiler</key>
<string></string>
<key>DTPlatformBuild</key>
<string>4H1003</string>
<key>DTPlatformVersion</key>
<string>GM</string>
<key>DTSDKBuild</key>
<string>12D75</string>
<key>DTSDKName</key>
<string>macosx10.8</string>
<key>DTXcode</key>
<string>0462</string>
<key>DTXcodeBuild</key>
<string>4H1003</string>
</dict>
</plist>
```
|
Men's freestyle 97 kilograms competition at the 2016 Summer Olympics in Rio de Janeiro, Brazil, took place on August 21 at the Carioca Arena 2 in Barra da Tijuca.
This freestyle wrestling competition consists of a single-elimination tournament, with a repechage used to determine the winner of two bronze medals. The two finalists face off for gold and silver medals. Each wrestler who loses to one of the two finalists moves into the repechage, culminating in a pair of bronze medal matches featuring the semifinal losers each facing the remaining repechage opponent from their half of the bracket.
Each bout consists of a single round within a six-minute limit. The wrestler who scores more points is the winner.
Schedule
All times are Brasília Standard Time (UTC−03:00)
Results
Legend
F — Won by fall
WO — Won by walkover
Final
Top half
Bottom half
Repechage
Final standing
References
External links
NBC Olympics Coverage
Wrestling at the 2016 Summer Olympics
Men's events at the 2016 Summer Olympics
|
```c++
//
//
// path_to_url
//
#include "pxr/imaging/hdSt/pipelineDrawBatch.h"
#include "pxr/imaging/hdSt/binding.h"
#include "pxr/imaging/hdSt/bufferArrayRange.h"
#include "pxr/imaging/hdSt/codeGen.h"
#include "pxr/imaging/hdSt/commandBuffer.h"
#include "pxr/imaging/hdSt/cullingShaderKey.h"
#include "pxr/imaging/hdSt/debugCodes.h"
#include "pxr/imaging/hdSt/drawItemInstance.h"
#include "pxr/imaging/hdSt/geometricShader.h"
#include "pxr/imaging/hdSt/glslProgram.h"
#include "pxr/imaging/hdSt/hgiConversions.h"
#include "pxr/imaging/hdSt/materialNetworkShader.h"
#include "pxr/imaging/hdSt/indirectDrawBatch.h"
#include "pxr/imaging/hdSt/renderPassState.h"
#include "pxr/imaging/hdSt/resourceRegistry.h"
#include "pxr/imaging/hdSt/shaderCode.h"
#include "pxr/imaging/hdSt/shaderKey.h"
#include "pxr/imaging/hdSt/textureBinder.h"
#include "pxr/imaging/hd/debugCodes.h"
#include "pxr/imaging/hd/perfLog.h"
#include "pxr/imaging/hd/tokens.h"
#include "pxr/imaging/hgi/blitCmds.h"
#include "pxr/imaging/hgi/blitCmdsOps.h"
#include "pxr/imaging/hgi/graphicsPipeline.h"
#include "pxr/imaging/hgi/indirectCommandEncoder.h"
#include "pxr/imaging/hgi/resourceBindings.h"
#include "pxr/base/gf/matrix4f.h"
#include "pxr/base/arch/hash.h"
#include "pxr/base/tf/diagnostic.h"
#include "pxr/base/tf/envSetting.h"
#include "pxr/base/tf/staticTokens.h"
#include <iostream>
#include <limits>
PXR_NAMESPACE_OPEN_SCOPE
TF_DEFINE_PRIVATE_TOKENS(
_tokens,
(constantPrimvars)
(dispatchBuffer)
(drawCullInput)
(drawIndirect)
(drawIndirectCull)
(drawIndirectResult)
(ulocCullParams)
);
TF_DEFINE_ENV_SETTING(HDST_ENABLE_PIPELINE_DRAW_BATCH_GPU_FRUSTUM_CULLING, true,
"Enable pipeline draw batching GPU frustum culling");
HdSt_PipelineDrawBatch::HdSt_PipelineDrawBatch(
HdStDrawItemInstance * drawItemInstance,
bool const allowGpuFrustumCulling,
bool const allowIndirectCommandEncoding)
: HdSt_DrawBatch(drawItemInstance)
, _drawCommandBufferDirty(false)
, _bufferArraysHash(0)
, _barElementOffsetsHash(0)
, _numVisibleItems(0)
, _numTotalVertices(0)
, _numTotalElements(0)
/* The following two values are set before draw by
* SetEnableTinyPrimCulling(). */
, _useTinyPrimCulling(false)
, _dirtyCullingProgram(false)
/* The following four values are initialized in _Init(). */
, _useDrawIndexed(true)
, _useInstancing(false)
, _useGpuCulling(false)
, _useInstanceCulling(false)
, _allowGpuFrustumCulling(allowGpuFrustumCulling)
, _allowIndirectCommandEncoding(allowIndirectCommandEncoding)
, _instanceCountOffset(0)
, _cullInstanceCountOffset(0)
, _drawCoordOffset(0)
, _patchBaseVertexByteOffset(0)
{
_Init(drawItemInstance);
}
HdSt_PipelineDrawBatch::~HdSt_PipelineDrawBatch() = default;
/*virtual*/
void
HdSt_PipelineDrawBatch::_Init(HdStDrawItemInstance * drawItemInstance)
{
HdSt_DrawBatch::_Init(drawItemInstance);
drawItemInstance->SetBatchIndex(0);
drawItemInstance->SetBatch(this);
// remember buffer arrays version for dispatch buffer updating
HdStDrawItem const * drawItem = drawItemInstance->GetDrawItem();
_bufferArraysHash = drawItem->GetBufferArraysHash();
// _barElementOffsetsHash is updated during _CompileBatch
_barElementOffsetsHash = 0;
// determine drawing and culling config according to the first drawitem
_useDrawIndexed = static_cast<bool>(drawItem->GetTopologyRange());
_useInstancing = static_cast<bool>(drawItem->GetInstanceIndexRange());
_useGpuCulling = _allowGpuFrustumCulling && IsEnabledGPUFrustumCulling();
// note: _useInstancing condition is not necessary. it can be removed
// if we decide always to use instance culling.
_useInstanceCulling = _useInstancing &&
_useGpuCulling && IsEnabledGPUInstanceFrustumCulling();
if (_useGpuCulling) {
_cullingProgram.Initialize(
_useDrawIndexed, _useInstanceCulling, _bufferArraysHash);
}
TF_DEBUG(HDST_DRAW_BATCH).Msg(
" Resetting dispatch buffer.\n");
_dispatchBuffer.reset();
}
void
HdSt_PipelineDrawBatch::SetEnableTinyPrimCulling(bool tinyPrimCulling)
{
if (_useTinyPrimCulling != tinyPrimCulling) {
_useTinyPrimCulling = tinyPrimCulling;
_dirtyCullingProgram = true;
}
}
/* static */
bool
HdSt_PipelineDrawBatch::IsEnabled(Hgi const *hgi)
{
// We require Hgi resource generation.
return HdSt_CodeGen::IsEnabledHgiResourceGeneration(hgi);
}
/* static */
bool
HdSt_PipelineDrawBatch::IsEnabledGPUFrustumCulling()
{
// Allow GPU frustum culling for PipelineDrawBatch to be disabled even
// when other GPU frustum culling is enabled. Both switches must be true
// for PipelineDrawBatch to use GPU frustum culling.
static bool isEnabled =
TfGetEnvSetting(HDST_ENABLE_PIPELINE_DRAW_BATCH_GPU_FRUSTUM_CULLING);
return isEnabled && HdSt_IndirectDrawBatch::IsEnabledGPUFrustumCulling();
}
/* static */
bool
HdSt_PipelineDrawBatch::IsEnabledGPUCountVisibleInstances()
{
return HdSt_IndirectDrawBatch::IsEnabledGPUCountVisibleInstances();
}
/* static */
bool
HdSt_PipelineDrawBatch::IsEnabledGPUInstanceFrustumCulling()
{
return HdSt_IndirectDrawBatch::IsEnabledGPUInstanceFrustumCulling();
}
////////////////////////////////////////////////////////////
// GPU Command Buffer Preparation
////////////////////////////////////////////////////////////
namespace {
// Draw command dispatch buffers are built as arrays of uint32_t, but
// we use these struct definitions to reason consistently about element
// access and offsets.
//
// The _DrawingCoord struct defines bundles of element offsets into buffers
// which together represent the drawing coordinate input to the shader.
// These must be kept in sync with codeGen. For instanced culling we need
// only a subset of the drawing coord. It might be beneficial to rearrange
// the drawing coord tuples.
//
// Note: _Draw*Command structs are layed out such that the first elements
// match the layout of Vulkan and GL and D3D indirect draw parameters.
//
// Note: Metal Patch drawing uses a different encoding than Vulkan and GL
// and D3D. Also, there is no base vertex offset in the indexed draw encoding,
// so we need to manually step vertex buffer binding offsets while encoding
// draw commands.
//
// Note: GL specifies baseVertex as 'int' and other as 'uint', but
// we never set negative baseVertex in our use cases.
// DrawingCoord 10 integers (+ numInstanceLevels)
struct _DrawingCoord
{
// drawingCoord0 (ivec4 for drawing and culling)
uint32_t modelDC;
uint32_t constantDC;
uint32_t elementDC;
uint32_t primitiveDC;
// drawingCoord1 (ivec4 for drawing or ivec2 for culling)
uint32_t fvarDC;
uint32_t instanceIndexDC;
uint32_t shaderDC;
uint32_t vertexDC;
// drawingCoord2 (ivec2 for drawing)
uint32_t topVisDC;
uint32_t varyingDC;
// drawingCoordI (int32[] for drawing and culling)
// uint32_t instanceDC[numInstanceLevels];
};
// DrawNonIndexed + non-instance culling : 14 integers (+ numInstanceLevels)
struct _DrawNonIndexedCommand
{
union {
struct {
uint32_t count;
uint32_t instanceCount;
uint32_t baseVertex;
uint32_t baseInstance;
} common;
struct {
uint32_t patchCount;
uint32_t instanceCount;
uint32_t patchStart;
uint32_t baseInstance;
} metalPatch;
};
_DrawingCoord drawingCoord;
};
// DrawNonIndexed + Instance culling : 18 integers (+ numInstanceLevels)
struct _DrawNonIndexedInstanceCullCommand
{
union {
struct {
uint32_t count;
uint32_t instanceCount;
uint32_t baseVertex;
uint32_t baseInstance;
} common;
struct {
uint32_t patchCount;
uint32_t instanceCount;
uint32_t patchStart;
uint32_t baseInstance;
} metalPatch;
};
uint32_t cullCount;
uint32_t cullInstanceCount;
uint32_t cullBaseVertex;
uint32_t cullBaseInstance;
_DrawingCoord drawingCoord;
};
// DrawIndexed + non-instance culling : 15 integers (+ numInstanceLevels)
struct _DrawIndexedCommand
{
union {
struct {
uint32_t count;
uint32_t instanceCount;
uint32_t baseIndex;
uint32_t baseVertex;
uint32_t baseInstance;
} common;
struct {
uint32_t patchCount;
uint32_t instanceCount;
uint32_t patchStart;
uint32_t baseInstance;
uint32_t baseVertex;
} metalPatch;
};
_DrawingCoord drawingCoord;
};
// DrawIndexed + Instance culling : 19 integers (+ numInstanceLevels)
struct _DrawIndexedInstanceCullCommand
{
union {
struct {
uint32_t count;
uint32_t instanceCount;
uint32_t baseIndex;
uint32_t baseVertex;
uint32_t baseInstance;
} common;
struct {
uint32_t patchCount;
uint32_t instanceCount;
uint32_t patchStart;
uint32_t baseInstance;
uint32_t baseVertex;
} metalPatch;
};
uint32_t cullCount;
uint32_t cullInstanceCount;
uint32_t cullBaseVertex;
uint32_t cullBaseInstance;
_DrawingCoord drawingCoord;
};
// These traits capture sizes and offsets for the _Draw*Command structs
struct _DrawCommandTraits
{
// Since the underlying buffer is an array of uint32_t, we capture
// the size of the struct as the number of uint32_t elements.
size_t numUInt32;
// Additional uint32_t values needed to align command entries.
size_t numUInt32Padding;
size_t instancerNumLevels;
size_t instanceIndexWidth;
size_t count_offset;
size_t instanceCount_offset;
size_t baseInstance_offset;
size_t cullCount_offset;
size_t cullInstanceCount_offset;
size_t drawingCoord0_offset;
size_t drawingCoord1_offset;
size_t drawingCoord2_offset;
size_t drawingCoordI_offset;
size_t patchBaseVertex_offset;
};
template <typename CmdType>
void _SetDrawCommandTraits(_DrawCommandTraits * traits,
int const instancerNumLevels,
size_t const uint32Alignment)
{
// Number of uint32_t in the command struct
// followed by instanceDC[instancerNumLevals]
traits->numUInt32 = sizeof(CmdType) / sizeof(uint32_t)
+ instancerNumLevels;
if (uint32Alignment > 0) {
size_t const alignMask = uint32Alignment - 1;
size_t const alignedNumUInt32 =
(traits->numUInt32 + alignMask) & ~alignMask;
traits->numUInt32Padding = alignedNumUInt32 - traits->numUInt32;
traits->numUInt32 = alignedNumUInt32;
} else {
traits->numUInt32Padding = 0;
}
traits->instancerNumLevels = instancerNumLevels;
traits->instanceIndexWidth = instancerNumLevels + 1;
traits->count_offset = offsetof(CmdType, common.count);
traits->instanceCount_offset = offsetof(CmdType, common.instanceCount);
traits->baseInstance_offset = offsetof(CmdType, common.baseInstance);
// These are different only for instanced culling.
traits->cullCount_offset = traits->count_offset;
traits->cullInstanceCount_offset = traits->instanceCount_offset;
}
template <typename CmdType>
void _SetInstanceCullTraits(_DrawCommandTraits * traits)
{
traits->cullCount_offset = offsetof(CmdType, cullCount);
traits->cullInstanceCount_offset = offsetof(CmdType, cullInstanceCount);
}
template <typename CmdType>
void _SetDrawingCoordTraits(_DrawCommandTraits * traits)
{
// drawingCoord bundles are located by the offsets to their first elements
traits->drawingCoord0_offset =
offsetof(CmdType, drawingCoord) + offsetof(_DrawingCoord, modelDC);
traits->drawingCoord1_offset =
offsetof(CmdType, drawingCoord) + offsetof(_DrawingCoord, fvarDC);
traits->drawingCoord2_offset =
offsetof(CmdType, drawingCoord) + offsetof(_DrawingCoord, topVisDC);
// drawingCoord instancer bindings follow the base drawing coord struct
traits->drawingCoordI_offset = sizeof(CmdType);
// needed to step vertex buffer binding offsets for Metal tessellation
traits->patchBaseVertex_offset =
offsetof(CmdType, drawingCoord) + offsetof(_DrawingCoord, vertexDC);
}
_DrawCommandTraits
_GetDrawCommandTraits(int const instancerNumLevels,
bool const useDrawIndexed,
bool const useInstanceCulling,
size_t const uint32Alignment)
{
_DrawCommandTraits traits;
if (!useDrawIndexed) {
if (useInstanceCulling) {
using CmdType = _DrawNonIndexedInstanceCullCommand;
_SetDrawCommandTraits<CmdType>(&traits, instancerNumLevels,
uint32Alignment);
_SetInstanceCullTraits<CmdType>(&traits);
_SetDrawingCoordTraits<CmdType>(&traits);
} else {
using CmdType = _DrawNonIndexedCommand;
_SetDrawCommandTraits<CmdType>(&traits, instancerNumLevels,
uint32Alignment);
_SetDrawingCoordTraits<CmdType>(&traits);
}
} else {
if (useInstanceCulling) {
using CmdType = _DrawIndexedInstanceCullCommand;
_SetDrawCommandTraits<CmdType>(&traits, instancerNumLevels,
uint32Alignment);
_SetInstanceCullTraits<CmdType>(&traits);
_SetDrawingCoordTraits<CmdType>(&traits);
} else {
using CmdType = _DrawIndexedCommand;
_SetDrawCommandTraits<CmdType>(&traits, instancerNumLevels,
uint32Alignment);
_SetDrawingCoordTraits<CmdType>(&traits);
}
}
return traits;
}
void
_AddDrawResourceViews(HdStDispatchBufferSharedPtr const & dispatchBuffer,
_DrawCommandTraits const & traits)
{
// draw indirect command
dispatchBuffer->AddBufferResourceView(
HdTokens->drawDispatch, {HdTypeInt32, 1},
traits.count_offset);
// drawing coord 0
dispatchBuffer->AddBufferResourceView(
HdTokens->drawingCoord0, {HdTypeInt32Vec4, 1},
traits.drawingCoord0_offset);
// drawing coord 1
dispatchBuffer->AddBufferResourceView(
HdTokens->drawingCoord1, {HdTypeInt32Vec4, 1},
traits.drawingCoord1_offset);
// drawing coord 2
dispatchBuffer->AddBufferResourceView(
HdTokens->drawingCoord2, {HdTypeInt32Vec2, 1},
traits.drawingCoord2_offset);
// instance drawing coords
if (traits.instancerNumLevels > 0) {
dispatchBuffer->AddBufferResourceView(
HdTokens->drawingCoordI, {HdTypeInt32, traits.instancerNumLevels},
traits.drawingCoordI_offset);
}
}
HdBufferArrayRangeSharedPtr
_GetShaderBar(HdSt_MaterialNetworkShaderSharedPtr const & shader)
{
return shader ? shader->GetShaderData() : nullptr;
}
// Collection of resources for a drawItem
struct _DrawItemState
{
explicit _DrawItemState(HdStDrawItem const * drawItem)
: constantBar(std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetConstantPrimvarRange()))
, indexBar(std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetTopologyRange()))
, topVisBar(std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetTopologyVisibilityRange()))
, elementBar(std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetElementPrimvarRange()))
, fvarBar(std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetFaceVaryingPrimvarRange()))
, varyingBar(std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetVaryingPrimvarRange()))
, vertexBar(std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetVertexPrimvarRange()))
, shaderBar(std::static_pointer_cast<HdStBufferArrayRange>(
_GetShaderBar(drawItem->GetMaterialNetworkShader())))
, instanceIndexBar(std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetInstanceIndexRange()))
{
instancePrimvarBars.resize(drawItem->GetInstancePrimvarNumLevels());
for (size_t i = 0; i < instancePrimvarBars.size(); ++i) {
instancePrimvarBars[i] =
std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetInstancePrimvarRange(i));
}
}
HdStBufferArrayRangeSharedPtr constantBar;
HdStBufferArrayRangeSharedPtr indexBar;
HdStBufferArrayRangeSharedPtr topVisBar;
HdStBufferArrayRangeSharedPtr elementBar;
HdStBufferArrayRangeSharedPtr fvarBar;
HdStBufferArrayRangeSharedPtr varyingBar;
HdStBufferArrayRangeSharedPtr vertexBar;
HdStBufferArrayRangeSharedPtr shaderBar;
HdStBufferArrayRangeSharedPtr instanceIndexBar;
std::vector<HdStBufferArrayRangeSharedPtr> instancePrimvarBars;
};
uint32_t
_GetElementOffset(HdBufferArrayRangeSharedPtr const & range)
{
return range ? range->GetElementOffset() : 0;
}
uint32_t
_GetElementCount(HdBufferArrayRangeSharedPtr const & range)
{
return range ? range->GetNumElements() : 0;
}
uint32_t
_GetInstanceCount(HdStDrawItemInstance const * drawItemInstance,
HdBufferArrayRangeSharedPtr const & instanceIndexBar,
int const instanceIndexWidth)
{
// It's possible to have an instanceIndexBar which exists but is empty,
// i.e. GetNumElements() == 0, and no instancePrimvars.
// In that case instanceCount should be 0, instead of 1, otherwise the
// frustum culling shader might write out-of-bounds to the result buffer.
// this is covered by testHdDrawBatching/EmptyDrawBatchTest
uint32_t const numInstances =
instanceIndexBar ? instanceIndexBar->GetNumElements() : 1;
uint32_t const instanceCount =
drawItemInstance->IsVisible() ? (numInstances / instanceIndexWidth) : 0;
return instanceCount;
}
HdStBufferResourceSharedPtr
_AllocateTessFactorsBuffer(
HdStDrawItem const * drawItem,
HdStResourceRegistrySharedPtr const & resourceRegistry)
{
if (!drawItem) { return nullptr; }
HdStBufferArrayRangeSharedPtr indexBar(
std::static_pointer_cast<HdStBufferArrayRange>(
drawItem->GetTopologyRange()));
if (!indexBar) { return nullptr; }
HdStBufferResourceSharedPtr indexBuffer =
indexBar->GetResource(HdTokens->indices);
if (!indexBuffer) { return nullptr; }
HgiBufferHandle const & indexBufferHandle = indexBuffer->GetHandle();
if (!indexBufferHandle) { return nullptr; }
size_t const byteSizeOfTuple =
HdDataSizeOfTupleType(indexBuffer->GetTupleType());
size_t const byteSizeOfResource =
indexBufferHandle->GetByteSizeOfResource();
size_t const numElements = byteSizeOfResource / byteSizeOfTuple;
size_t const numTessFactorsPerElement = 6;
return resourceRegistry->RegisterBufferResource(
HdTokens->tessFactors,
HdTupleType{HdTypeHalfFloat, numElements*numTessFactorsPerElement},
HgiBufferUsageUniform);
}
} // annonymous namespace
void
HdSt_PipelineDrawBatch::_CompileBatch(
HdStResourceRegistrySharedPtr const & resourceRegistry)
{
TRACE_FUNCTION();
HF_MALLOC_TAG_FUNCTION();
if (_drawItemInstances.empty()) return;
size_t const numDrawItemInstances = _drawItemInstances.size();
size_t const instancerNumLevels =
_drawItemInstances[0]->GetDrawItem()->GetInstancePrimvarNumLevels();
bool const useMetalTessellation =
_drawItemInstances[0]->GetDrawItem()->
GetGeometricShader()->GetUseMetalTessellation();
// Align drawing commands to 32 bytes for Metal.
size_t const uint32Alignment = useMetalTessellation ? 8 : 0;
// Get the layout of the command buffer we are building.
_DrawCommandTraits const traits =
_GetDrawCommandTraits(instancerNumLevels,
_useDrawIndexed,
_useInstanceCulling,
uint32Alignment);
TF_DEBUG(HDST_DRAW).Msg("\nCompile Dispatch Buffer\n");
TF_DEBUG(HDST_DRAW).Msg(" - numUInt32: %zd\n", traits.numUInt32);
TF_DEBUG(HDST_DRAW).Msg(" - useDrawIndexed: %d\n", _useDrawIndexed);
TF_DEBUG(HDST_DRAW).Msg(" - useInstanceCulling: %d\n", _useInstanceCulling);
TF_DEBUG(HDST_DRAW).Msg(" - num draw items: %zu\n", numDrawItemInstances);
_drawCommandBuffer.resize(numDrawItemInstances * traits.numUInt32);
std::vector<uint32_t>::iterator cmdIt = _drawCommandBuffer.begin();
// Count the number of visible items. We may actually draw fewer
// items than this when GPU frustum culling is active.
_numVisibleItems = 0;
_numTotalElements = 0;
_numTotalVertices = 0;
TF_DEBUG(HDST_DRAW).Msg(" - Processing Items:\n");
_barElementOffsetsHash = 0;
for (size_t item = 0; item < numDrawItemInstances; ++item) {
HdStDrawItemInstance const *drawItemInstance = _drawItemInstances[item];
HdStDrawItem const *drawItem = drawItemInstance->GetDrawItem();
_barElementOffsetsHash =
TfHash::Combine(_barElementOffsetsHash,
drawItem->GetElementOffsetsHash());
_DrawItemState const dc(drawItem);
// drawing coordinates.
uint32_t const modelDC = 0; // reserved for future extension
uint32_t const constantDC = _GetElementOffset(dc.constantBar);
uint32_t const vertexDC = _GetElementOffset(dc.vertexBar);
uint32_t const topVisDC = _GetElementOffset(dc.topVisBar);
uint32_t const elementDC = _GetElementOffset(dc.elementBar);
uint32_t const primitiveDC = _GetElementOffset(dc.indexBar);
uint32_t const fvarDC = _GetElementOffset(dc.fvarBar);
uint32_t const instanceIndexDC = _GetElementOffset(dc.instanceIndexBar);
uint32_t const shaderDC = _GetElementOffset(dc.shaderBar);
uint32_t const varyingDC = _GetElementOffset(dc.varyingBar);
// 3 for triangles, 4 for quads, 6 for triquads, n for patches
uint32_t const numIndicesPerPrimitive =
drawItem->GetGeometricShader()->GetPrimitiveIndexSize();
uint32_t const baseVertex = vertexDC;
uint32_t const vertexCount = _GetElementCount(dc.vertexBar);
// if delegate fails to get vertex primvars, it could be empty.
// skip the drawitem to prevent drawing uninitialized vertices.
uint32_t const numElements =
vertexCount != 0 ? _GetElementCount(dc.indexBar) : 0;
uint32_t const baseIndex = primitiveDC * numIndicesPerPrimitive;
uint32_t const indexCount = numElements * numIndicesPerPrimitive;
uint32_t const instanceCount =
_GetInstanceCount(drawItemInstance,
dc.instanceIndexBar,
traits.instanceIndexWidth);
// tessellated patches are encoded differently for Metal.
uint32_t const patchStart = primitiveDC;
uint32_t const patchCount = numElements;
uint32_t const baseInstance = (uint32_t)item;
// draw command
if (!_useDrawIndexed) {
if (_useInstanceCulling) {
// _DrawNonIndexedInstanceCullCommand
if (useMetalTessellation) {
*cmdIt++ = patchCount;
*cmdIt++ = instanceCount;
*cmdIt++ = patchStart;
*cmdIt++ = baseInstance;
*cmdIt++ = 1; /* cullCount (always 1) */
*cmdIt++ = instanceCount; /* cullInstanceCount */
*cmdIt++ = 0; /* cullBaseVertex (not used)*/
*cmdIt++ = baseInstance; /* cullBaseInstance */
} else {
*cmdIt++ = vertexCount;
*cmdIt++ = instanceCount;
*cmdIt++ = baseVertex;
*cmdIt++ = baseInstance;
*cmdIt++ = 1; /* cullCount (always 1) */
*cmdIt++ = instanceCount; /* cullInstanceCount */
*cmdIt++ = 0; /* cullBaseVertex (not used)*/
*cmdIt++ = baseInstance; /* cullBaseInstance */
}
} else {
// _DrawNonIndexedCommand
if (useMetalTessellation) {
*cmdIt++ = patchCount;
*cmdIt++ = instanceCount;
*cmdIt++ = patchStart;
*cmdIt++ = baseInstance;
} else {
*cmdIt++ = vertexCount;
*cmdIt++ = instanceCount;
*cmdIt++ = baseVertex;
*cmdIt++ = baseInstance;
}
}
} else {
if (_useInstanceCulling) {
// _DrawIndexedInstanceCullCommand
if (useMetalTessellation) {
*cmdIt++ = patchCount;
*cmdIt++ = instanceCount;
*cmdIt++ = patchStart;
*cmdIt++ = baseInstance;
*cmdIt++ = baseVertex;
*cmdIt++ = 1; /* cullCount (always 1) */
*cmdIt++ = instanceCount; /* cullInstanceCount */
*cmdIt++ = 0; /* cullBaseVertex (not used)*/
*cmdIt++ = baseInstance; /* cullBaseInstance */
} else {
*cmdIt++ = indexCount;
*cmdIt++ = instanceCount;
*cmdIt++ = baseIndex;
*cmdIt++ = baseVertex;
*cmdIt++ = baseInstance;
*cmdIt++ = 1; /* cullCount (always 1) */
*cmdIt++ = instanceCount; /* cullInstanceCount */
*cmdIt++ = 0; /* cullBaseVertex (not used)*/
*cmdIt++ = baseInstance; /* cullBaseInstance */
}
} else {
// _DrawIndexedCommand
if (useMetalTessellation) {
*cmdIt++ = patchCount;
*cmdIt++ = instanceCount;
*cmdIt++ = patchStart;
*cmdIt++ = baseInstance;
*cmdIt++ = baseVertex;
} else {
*cmdIt++ = indexCount;
*cmdIt++ = instanceCount;
*cmdIt++ = baseIndex;
*cmdIt++ = baseVertex;
*cmdIt++ = baseInstance;
}
}
}
// drawingCoord0
*cmdIt++ = modelDC;
*cmdIt++ = constantDC;
*cmdIt++ = elementDC;
*cmdIt++ = primitiveDC;
// drawingCoord1
*cmdIt++ = fvarDC;
*cmdIt++ = instanceIndexDC;
*cmdIt++ = shaderDC;
*cmdIt++ = vertexDC;
// drawingCoord2
*cmdIt++ = topVisDC;
*cmdIt++ = varyingDC;
// drawingCoordI
for (size_t i = 0; i < dc.instancePrimvarBars.size(); ++i) {
uint32_t instanceDC = _GetElementOffset(dc.instancePrimvarBars[i]);
*cmdIt++ = instanceDC;
}
// add padding and clear to 0
for (size_t i = 0; i < traits.numUInt32Padding; ++i) {
*cmdIt++ = 0;
}
if (TfDebug::IsEnabled(HDST_DRAW)) {
std::vector<uint32_t>::iterator cmdIt2 = cmdIt - traits.numUInt32;
std::cout << " - ";
while (cmdIt2 != cmdIt) {
std::cout << *cmdIt2 << " ";
cmdIt2++;
}
std::cout << std::endl;
}
_numVisibleItems += instanceCount;
_numTotalElements += numElements;
_numTotalVertices += vertexCount;
}
TF_DEBUG(HDST_DRAW).Msg(" - Num Visible: %zu\n", _numVisibleItems);
TF_DEBUG(HDST_DRAW).Msg(" - Total Elements: %zu\n", _numTotalElements);
TF_DEBUG(HDST_DRAW).Msg(" - Total Verts: %zu\n", _numTotalVertices);
// make sure we filled all
TF_VERIFY(cmdIt == _drawCommandBuffer.end());
// cache the location of instanceCount and cullInstanceCount,
// to be used during DrawItemInstanceChanged().
_instanceCountOffset = traits.instanceCount_offset/sizeof(uint32_t);
_cullInstanceCountOffset = traits.cullInstanceCount_offset/sizeof(uint32_t);
// cache the offset needed for compute culling.
_drawCoordOffset = traits.drawingCoord0_offset / sizeof(uint32_t);
// cache the location of patchBaseVertex for tessellated patch drawing.
_patchBaseVertexByteOffset = traits.patchBaseVertex_offset;
// allocate draw dispatch buffer
_dispatchBuffer =
resourceRegistry->RegisterDispatchBuffer(_tokens->drawIndirect,
numDrawItemInstances,
traits.numUInt32);
// allocate tessFactors buffer for Metal tessellation
if (useMetalTessellation &&
_drawItemInstances[0]->GetDrawItem()->
GetGeometricShader()->IsPrimTypePatches()) {
_tessFactorsBuffer = _AllocateTessFactorsBuffer(
_drawItemInstances[0]->GetDrawItem(),
resourceRegistry);
}
// add drawing resource views
_AddDrawResourceViews(_dispatchBuffer, traits);
// copy data
_dispatchBuffer->CopyData(_drawCommandBuffer);
if (_useGpuCulling) {
// Make a duplicate of the draw dispatch buffer to use as an input
// for GPU frustum culling (a single buffer cannot be bound for
// both reading and writing). We use only the instanceCount
// and drawingCoord parameters, but it is simplest to just make
// a copy.
_dispatchBufferCullInput =
resourceRegistry->RegisterDispatchBuffer(_tokens->drawIndirectCull,
numDrawItemInstances,
traits.numUInt32);
// copy data
_dispatchBufferCullInput->CopyData(_drawCommandBuffer);
}
}
HdSt_DrawBatch::ValidationResult
HdSt_PipelineDrawBatch::Validate(bool deepValidation)
{
if (!TF_VERIFY(!_drawItemInstances.empty())) {
return ValidationResult::RebuildAllBatches;
}
TF_DEBUG(HDST_DRAW_BATCH).Msg(
"Validating pipeline draw batch %p (deep validation = %d)...\n",
(void*)(this), deepValidation);
// check the hash to see they've been reallocated/migrated or not.
// note that we just need to compare the hash of the first item,
// since drawitems are aggregated and ensure that they are sharing
// same buffer arrays.
HdStDrawItem const * batchItem = _drawItemInstances.front()->GetDrawItem();
size_t const bufferArraysHash = batchItem->GetBufferArraysHash();
if (_bufferArraysHash != bufferArraysHash) {
_bufferArraysHash = bufferArraysHash;
TF_DEBUG(HDST_DRAW_BATCH).Msg(
" Buffer arrays hash changed. Need to rebuild batch.\n");
return ValidationResult::RebuildBatch;
}
// Deep validation is flagged explicitly when a drawItem has changes to
// its BARs (e.g. buffer spec, aggregation, element offsets) or when its
// material network shader or geometric shader changes.
if (deepValidation) {
TRACE_SCOPE("Pipeline draw batch deep validation");
// look through all draw items to be still compatible
size_t numDrawItemInstances = _drawItemInstances.size();
size_t barElementOffsetsHash = 0;
for (size_t item = 0; item < numDrawItemInstances; ++item) {
HdStDrawItem const * drawItem =
_drawItemInstances[item]->GetDrawItem();
if (!TF_VERIFY(drawItem->GetGeometricShader())) {
return ValidationResult::RebuildAllBatches;
}
if (!_IsAggregated(batchItem, drawItem)) {
TF_DEBUG(HDST_DRAW_BATCH).Msg(
" Deep validation: Found draw item that fails aggregation"
" test. Need to rebuild all batches.\n");
return ValidationResult::RebuildAllBatches;
}
barElementOffsetsHash = TfHash::Combine(barElementOffsetsHash,
drawItem->GetElementOffsetsHash());
}
if (_barElementOffsetsHash != barElementOffsetsHash) {
TF_DEBUG(HDST_DRAW_BATCH).Msg(
" Deep validation: Element offsets hash mismatch."
" Rebuilding batch (even though only the dispatch buffer"
" needs to be updated)\n.");
return ValidationResult::RebuildBatch;
}
}
TF_DEBUG(HDST_DRAW_BATCH).Msg(
" Validation passed. No need to rebuild batch.\n");
return ValidationResult::ValidBatch;
}
bool
HdSt_PipelineDrawBatch::_HasNothingToDraw() const
{
return ( _useDrawIndexed && _numTotalElements == 0) ||
(!_useDrawIndexed && _numTotalVertices == 0);
}
void
HdSt_PipelineDrawBatch::PrepareDraw(
HgiGraphicsCmds *gfxCmds,
HdStRenderPassStateSharedPtr const & renderPassState,
HdStResourceRegistrySharedPtr const & resourceRegistry)
{
TRACE_FUNCTION();
if (!_dispatchBuffer) {
_CompileBatch(resourceRegistry);
}
if (_HasNothingToDraw()) return;
// Do we have to update our dispatch buffer because drawitem instance
// data has changed?
// On the first time through, after batches have just been compiled,
// the flag will be false because the resource registry will have already
// uploaded the buffer.
bool const updateBufferData = _drawCommandBufferDirty;
if (updateBufferData) {
_dispatchBuffer->CopyData(_drawCommandBuffer);
_drawCommandBufferDirty = false;
}
if (_useGpuCulling) {
// Ignore passed in gfxCmds for now since GPU frustum culling
// may still require multiple command buffer submissions.
_ExecuteFrustumCull(updateBufferData,
renderPassState, resourceRegistry);
}
}
void
HdSt_PipelineDrawBatch::EncodeDraw(
HdStRenderPassStateSharedPtr const & renderPassState,
HdStResourceRegistrySharedPtr const & resourceRegistry,
bool firstDrawBatch)
{
if (_HasNothingToDraw()) return;
Hgi *hgi = resourceRegistry->GetHgi();
HgiCapabilities const *capabilities = hgi->GetCapabilities();
// For ICBs on Apple Silicon, we do not support rendering to non-MSAA
// surfaces, such as OIT as Volumetrics. Disable in these cases.
bool const drawICB =
_allowIndirectCommandEncoding &&
capabilities->IsSet(HgiDeviceCapabilitiesBitsIndirectCommandBuffers) &&
renderPassState->GetMultiSampleEnabled();
_indirectCommands.reset();
if (drawICB) {
_PrepareIndirectCommandBuffer(renderPassState, resourceRegistry,
firstDrawBatch);
}
}
////////////////////////////////////////////////////////////
// GPU Resource Binding
////////////////////////////////////////////////////////////
namespace {
// Resources to Bind/Unbind for a drawItem
struct _BindingState : public _DrawItemState
{
_BindingState(
HdStDrawItem const * drawItem,
HdStDispatchBufferSharedPtr const & dispatchBuffer,
HdSt_ResourceBinder const & binder,
HdStGLSLProgramSharedPtr const & glslProgram,
HdStShaderCodeSharedPtrVector const & shaders,
HdSt_GeometricShaderSharedPtr const & geometricShader)
: _DrawItemState(drawItem)
, dispatchBuffer(dispatchBuffer)
, binder(binder)
, glslProgram(glslProgram)
, shaders(shaders)
, geometricShader(geometricShader)
{ }
// Core resources needed for view transformation & frustum culling.
void GetBindingsForViewTransformation(
HgiResourceBindingsDesc * bindingsDesc) const;
// Core resources plus additional resources needed for drawing.
void GetBindingsForDrawing(
HgiResourceBindingsDesc * bindingsDesc,
HdStBufferResourceSharedPtr const & tessFactorsBuffer,
bool bindTessFactors) const;
HdStDispatchBufferSharedPtr dispatchBuffer;
HdSt_ResourceBinder const & binder;
HdStGLSLProgramSharedPtr glslProgram;
HdStShaderCodeSharedPtrVector shaders;
HdSt_GeometricShaderSharedPtr geometricShader;
};
void
_BindingState::GetBindingsForViewTransformation(
HgiResourceBindingsDesc * bindingsDesc) const
{
bindingsDesc->debugName = "PipelineDrawBatch.ViewTransformation";
// Bind the constant buffer for the prim transformation and bounds.
binder.GetInterleavedBufferArrayBindingDesc(
bindingsDesc, constantBar, _tokens->constantPrimvars);
// Bind the instance buffers to support instance transformations.
if (instanceIndexBar) {
for (size_t level = 0; level < instancePrimvarBars.size(); ++level) {
binder.GetInstanceBufferArrayBindingDesc(
bindingsDesc, instancePrimvarBars[level], level);
}
binder.GetBufferArrayBindingDesc(bindingsDesc, instanceIndexBar);
}
}
void
_BindingState::GetBindingsForDrawing(
HgiResourceBindingsDesc * bindingsDesc,
HdStBufferResourceSharedPtr const & tessFactorsBuffer,
bool bindTessFactors) const
{
GetBindingsForViewTransformation(bindingsDesc);
bindingsDesc->debugName = "PipelineDrawBatch.Drawing";
binder.GetInterleavedBufferArrayBindingDesc(
bindingsDesc, topVisBar, HdTokens->topologyVisibility);
binder.GetBufferArrayBindingDesc(bindingsDesc, indexBar);
if (!geometricShader->IsPrimTypePoints()) {
binder.GetBufferArrayBindingDesc(bindingsDesc, elementBar);
binder.GetBufferArrayBindingDesc(bindingsDesc, fvarBar);
}
binder.GetBufferArrayBindingDesc(bindingsDesc, varyingBar);
if (tessFactorsBuffer) {
binder.GetBufferBindingDesc(bindingsDesc,
HdTokens->tessFactors,
tessFactorsBuffer,
tessFactorsBuffer->GetOffset());
if (bindTessFactors) {
binder.GetBufferBindingDesc(bindingsDesc,
HdTokens->tessFactors,
tessFactorsBuffer,
tessFactorsBuffer->GetOffset());
HgiBufferBindDesc &tessFactorBuffDesc = bindingsDesc->buffers.back();
tessFactorBuffDesc.resourceType = HgiBindResourceTypeTessFactors;
}
}
for (HdStShaderCodeSharedPtr const & shader : shaders) {
HdStBufferArrayRangeSharedPtr shaderBar =
std::static_pointer_cast<HdStBufferArrayRange>(
shader->GetShaderData());
binder.GetInterleavedBufferArrayBindingDesc(
bindingsDesc, shaderBar, HdTokens->materialParams);
HdStBindingRequestVector bindingRequests;
shader->AddBindings(&bindingRequests);
for (auto const & req : bindingRequests) {
binder.GetBindingRequestBindingDesc(bindingsDesc, req);
}
HdSt_TextureBinder::GetBindingDescs(
binder, bindingsDesc, shader->GetNamedTextureHandles());
}
}
HgiVertexBufferDescVector
_GetVertexBuffersForViewTransformation(_BindingState const & state)
{
// Bind the dispatchBuffer drawing coordinate resource views
HdStBufferArrayRangeSharedPtr const dispatchBar =
state.dispatchBuffer->GetBufferArrayRange();
size_t const dispatchBufferStride =
state.dispatchBuffer->GetCommandNumUints()*sizeof(uint32_t);
HgiVertexAttributeDescVector attrDescVector;
for (auto const & namedResource : dispatchBar->GetResources()) {
HdStBinding const binding =
state.binder.GetBinding(namedResource.first);
HdStBufferResourceSharedPtr const & resource = namedResource.second;
HdTupleType const tupleType = resource->GetTupleType();
if (binding.GetType() == HdStBinding::DRAW_INDEX_INSTANCE) {
HgiVertexAttributeDesc attrDesc;
attrDesc.format =
HdStHgiConversions::GetHgiVertexFormat(tupleType.type);
attrDesc.offset = resource->GetOffset(),
attrDesc.shaderBindLocation = binding.GetLocation();
attrDescVector.push_back(attrDesc);
} else if (binding.GetType() ==
HdStBinding::DRAW_INDEX_INSTANCE_ARRAY) {
for (size_t i = 0; i < tupleType.count; ++i) {
HgiVertexAttributeDesc attrDesc;
attrDesc.format =
HdStHgiConversions::GetHgiVertexFormat(tupleType.type);
attrDesc.offset = resource->GetOffset() + i*sizeof(uint32_t);
attrDesc.shaderBindLocation = binding.GetLocation() + i;
attrDescVector.push_back(attrDesc);
}
}
}
// All drawing coordinate resources are sourced from the same buffer.
HgiVertexBufferDesc bufferDesc;
bufferDesc.bindingIndex = 0;
bufferDesc.vertexAttributes = attrDescVector;
bufferDesc.vertexStepFunction = HgiVertexBufferStepFunctionPerDrawCommand;
bufferDesc.vertexStride = dispatchBufferStride;
return HgiVertexBufferDescVector{bufferDesc};
}
HgiVertexBufferDescVector
_GetVertexBuffersForDrawing(_BindingState const & state)
{
// Bind the vertexBar resources
HgiVertexBufferDescVector vertexBufferDescVector =
_GetVertexBuffersForViewTransformation(state);
for (auto const & namedResource : state.vertexBar->GetResources()) {
HdStBinding const binding =
state.binder.GetBinding(namedResource.first);
HdStBufferResourceSharedPtr const & resource = namedResource.second;
HdTupleType const tupleType = resource->GetTupleType();
if (binding.GetType() == HdStBinding::VERTEX_ATTR) {
HgiVertexAttributeDesc attrDesc;
attrDesc.format =
HdStHgiConversions::GetHgiVertexFormat(tupleType.type);
attrDesc.offset = resource->GetOffset(),
attrDesc.shaderBindLocation = binding.GetLocation();
// Each vertexBar resource is sourced from a distinct buffer.
HgiVertexBufferDesc bufferDesc;
bufferDesc.bindingIndex = vertexBufferDescVector.size();
bufferDesc.vertexAttributes = {attrDesc};
if (state.geometricShader->GetUseMetalTessellation()) {
bufferDesc.vertexStepFunction =
HgiVertexBufferStepFunctionPerPatchControlPoint;
} else {
bufferDesc.vertexStepFunction =
HgiVertexBufferStepFunctionPerVertex;
}
bufferDesc.vertexStride = HdDataSizeOfTupleType(tupleType);
vertexBufferDescVector.push_back(bufferDesc);
}
}
return vertexBufferDescVector;
}
uint32_t
_GetVertexBufferBindingsForViewTransformation(
HgiVertexBufferBindingVector *bindings,
_BindingState const & state)
{
// Bind the dispatchBuffer drawing coordinate resource views
HdStBufferResourceSharedPtr resource =
state.dispatchBuffer->GetEntireResource();
bindings->emplace_back(resource->GetHandle(),
(uint32_t)resource->GetOffset(),
0);
return static_cast<uint32_t>(bindings->size());
}
uint32_t
_GetVertexBufferBindingsForDrawing(
HgiVertexBufferBindingVector *bindings,
_BindingState const & state)
{
uint32_t nextBinding = // continue binding subsequent locations
_GetVertexBufferBindingsForViewTransformation(bindings, state);
for (auto const & namedResource : state.vertexBar->GetResources()) {
HdStBinding const binding =
state.binder.GetBinding(namedResource.first);
HdStBufferResourceSharedPtr const & resource = namedResource.second;
if (binding.GetType() == HdStBinding::VERTEX_ATTR) {
bindings->emplace_back(resource->GetHandle(),
static_cast<uint32_t>(resource->GetOffset()),
nextBinding);
nextBinding++;
}
}
return nextBinding;
}
} // annonymous namespace
////////////////////////////////////////////////////////////
// GPU Drawing
////////////////////////////////////////////////////////////
static
HgiGraphicsPipelineSharedPtr
_GetDrawPipeline(
HdStRenderPassStateSharedPtr const & renderPassState,
HdStResourceRegistrySharedPtr const & resourceRegistry,
_BindingState const & state,
bool firstDrawBatch)
{
// Drawing pipeline is compatible as long as the shader and
// pipeline state are the same.
HgiShaderProgramHandle const & programHandle =
state.glslProgram->GetProgram();
static const uint64_t salt = ArchHash64(__FUNCTION__, sizeof(__FUNCTION__));
uint64_t hash = salt;
hash = TfHash::Combine(hash, programHandle.Get());
hash = TfHash::Combine(hash, renderPassState->GetGraphicsPipelineHash(
state.geometricShader, firstDrawBatch));
HdInstance<HgiGraphicsPipelineSharedPtr> pipelineInstance =
resourceRegistry->RegisterGraphicsPipeline(hash);
if (pipelineInstance.IsFirstInstance()) {
HgiGraphicsPipelineDesc pipeDesc;
renderPassState->InitGraphicsPipelineDesc(&pipeDesc,
state.geometricShader,
firstDrawBatch);
pipeDesc.shaderProgram = state.glslProgram->GetProgram();
pipeDesc.vertexBuffers = _GetVertexBuffersForDrawing(state);
Hgi* hgi = resourceRegistry->GetHgi();
HgiGraphicsPipelineHandle pso = hgi->CreateGraphicsPipeline(pipeDesc);
pipelineInstance.SetValue(
std::make_shared<HgiGraphicsPipelineHandle>(pso));
}
return pipelineInstance.GetValue();
}
static
HgiGraphicsPipelineSharedPtr
_GetPTCSPipeline(
HdStRenderPassStateSharedPtr const & renderPassState,
HdStResourceRegistrySharedPtr const & resourceRegistry,
_BindingState const & state,
bool firstDrawBatch)
{
// PTCS pipeline is compatible as long as the shader and
// pipeline state are the same.
HgiShaderProgramHandle const & programHandle =
state.glslProgram->GetProgram();
static const uint64_t salt = ArchHash64(__FUNCTION__, sizeof(__FUNCTION__));
uint64_t hash = salt;
hash = TfHash::Combine(hash, programHandle.Get());
hash = TfHash::Combine(hash, renderPassState->GetGraphicsPipelineHash(
state.geometricShader, firstDrawBatch));
HdInstance<HgiGraphicsPipelineSharedPtr> pipelineInstance =
resourceRegistry->RegisterGraphicsPipeline(hash);
if (pipelineInstance.IsFirstInstance()) {
HgiGraphicsPipelineDesc pipeDesc;
renderPassState->InitGraphicsPipelineDesc(&pipeDesc,
state.geometricShader,
firstDrawBatch);
pipeDesc.rasterizationState.rasterizerEnabled = false;
pipeDesc.shaderProgram = state.glslProgram->GetProgram();
pipeDesc.vertexBuffers = _GetVertexBuffersForDrawing(state);
pipeDesc.tessellationState.tessFactorMode =
HgiTessellationState::TessControl;
Hgi* hgi = resourceRegistry->GetHgi();
HgiGraphicsPipelineHandle pso = hgi->CreateGraphicsPipeline(pipeDesc);
pipelineInstance.SetValue(
std::make_shared<HgiGraphicsPipelineHandle>(pso));
}
return pipelineInstance.GetValue();
}
void
HdSt_PipelineDrawBatch::ExecuteDraw(
HgiGraphicsCmds * gfxCmds,
HdStRenderPassStateSharedPtr const & renderPassState,
HdStResourceRegistrySharedPtr const & resourceRegistry,
bool firstDrawBatch)
{
TRACE_FUNCTION();
if (!TF_VERIFY(!_drawItemInstances.empty())) return;
if (!TF_VERIFY(_dispatchBuffer)) return;
if (_HasNothingToDraw()) return;
Hgi *hgi = resourceRegistry->GetHgi();
HgiCapabilities const *capabilities = hgi->GetCapabilities();
if (_tessFactorsBuffer) {
// Metal tessellation tessFactors are computed by PTCS.
_ExecutePTCS(gfxCmds, renderPassState, resourceRegistry,
firstDrawBatch);
// Finish computing tessFactors before drawing.
gfxCmds->InsertMemoryBarrier(HgiMemoryBarrierAll);
}
//
// If an indirect command buffer was created in the Prepare phase then
// execute it here. Otherwise render with the normal graphicsCmd path.
//
if (_indirectCommands) {
HgiIndirectCommandEncoder *encoder = hgi->GetIndirectCommandEncoder();
encoder->ExecuteDraw(gfxCmds, _indirectCommands.get());
hgi->DestroyResourceBindings(&(_indirectCommands->resourceBindings));
_indirectCommands.reset();
}
else {
_DrawingProgram & program = _GetDrawingProgram(renderPassState,
resourceRegistry);
if (!TF_VERIFY(program.IsValid())) return;
_BindingState state(
_drawItemInstances.front()->GetDrawItem(),
_dispatchBuffer,
program.GetBinder(),
program.GetGLSLProgram(),
program.GetComposedShaders(),
program.GetGeometricShader());
HgiGraphicsPipelineSharedPtr pso =
_GetDrawPipeline(
renderPassState,
resourceRegistry,
state,
firstDrawBatch);
HgiGraphicsPipelineHandle psoHandle = *pso.get();
gfxCmds->BindPipeline(psoHandle);
HgiResourceBindingsDesc bindingsDesc;
state.GetBindingsForDrawing(&bindingsDesc,
_tessFactorsBuffer, /*bindTessFactors=*/true);
HgiResourceBindingsHandle resourceBindings =
hgi->CreateResourceBindings(bindingsDesc);
gfxCmds->BindResources(resourceBindings);
HgiVertexBufferBindingVector bindings;
_GetVertexBufferBindingsForDrawing(&bindings, state);
gfxCmds->BindVertexBuffers(bindings);
// Drawing can be either direct or indirect. For either case,
// the drawing batch and drawing program are prepared to resolve
// drawing coordinate state indirectly, i.e. from buffer data.
bool const drawIndirect =
capabilities->IsSet(HgiDeviceCapabilitiesBitsMultiDrawIndirect);
if (drawIndirect) {
_ExecuteDrawIndirect(gfxCmds, state.indexBar);
} else {
_ExecuteDrawImmediate(gfxCmds, state.indexBar);
}
hgi->DestroyResourceBindings(&resourceBindings);
}
HD_PERF_COUNTER_INCR(HdPerfTokens->drawCalls);
HD_PERF_COUNTER_ADD(HdTokens->itemsDrawn, _numVisibleItems);
}
void
HdSt_PipelineDrawBatch::_ExecuteDrawIndirect(
HgiGraphicsCmds * gfxCmds,
HdStBufferArrayRangeSharedPtr const & indexBar)
{
TRACE_FUNCTION();
HdStBufferResourceSharedPtr paramBuffer = _dispatchBuffer->
GetBufferArrayRange()->GetResource(HdTokens->drawDispatch);
if (!TF_VERIFY(paramBuffer)) return;
if (!_useDrawIndexed) {
gfxCmds->DrawIndirect(
paramBuffer->GetHandle(),
paramBuffer->GetOffset(),
_dispatchBuffer->GetCount(),
paramBuffer->GetStride());
} else {
HdStBufferResourceSharedPtr indexBuffer =
indexBar->GetResource(HdTokens->indices);
if (!TF_VERIFY(indexBuffer)) return;
gfxCmds->DrawIndexedIndirect(
indexBuffer->GetHandle(),
paramBuffer->GetHandle(),
paramBuffer->GetOffset(),
_dispatchBuffer->GetCount(),
paramBuffer->GetStride(),
_drawCommandBuffer,
_patchBaseVertexByteOffset);
}
}
void
HdSt_PipelineDrawBatch::_ExecuteDrawImmediate(
HgiGraphicsCmds * gfxCmds,
HdStBufferArrayRangeSharedPtr const & indexBar)
{
TRACE_FUNCTION();
uint32_t const drawCount = _dispatchBuffer->GetCount();
uint32_t const strideUInt32 = _dispatchBuffer->GetCommandNumUints();
if (!_useDrawIndexed) {
for (uint32_t i = 0; i < drawCount; ++i) {
_DrawNonIndexedCommand const * cmd =
reinterpret_cast<_DrawNonIndexedCommand*>(
&_drawCommandBuffer[i * strideUInt32]);
if (cmd->common.count && cmd->common.instanceCount) {
gfxCmds->Draw(
cmd->common.count,
cmd->common.baseVertex,
cmd->common.instanceCount,
cmd->common.baseInstance);
}
}
} else {
HdStBufferResourceSharedPtr indexBuffer =
indexBar->GetResource(HdTokens->indices);
if (!TF_VERIFY(indexBuffer)) return;
bool const useMetalTessellation =
_drawItemInstances[0]->GetDrawItem()->
GetGeometricShader()->GetUseMetalTessellation();
for (uint32_t i = 0; i < drawCount; ++i) {
_DrawIndexedCommand const * cmd =
reinterpret_cast<_DrawIndexedCommand*>(
&_drawCommandBuffer[i * strideUInt32]);
uint32_t const indexBufferByteOffset =
static_cast<uint32_t>(cmd->common.baseIndex * sizeof(uint32_t));
if (cmd->common.count && cmd->common.instanceCount) {
if (useMetalTessellation) {
gfxCmds->DrawIndexed(
indexBuffer->GetHandle(),
cmd->metalPatch.patchCount,
indexBufferByteOffset,
cmd->metalPatch.baseVertex,
cmd->metalPatch.instanceCount,
cmd->metalPatch.baseInstance);
} else {
gfxCmds->DrawIndexed(
indexBuffer->GetHandle(),
cmd->common.count,
indexBufferByteOffset,
cmd->common.baseVertex,
cmd->common.instanceCount,
cmd->common.baseInstance);
}
}
}
}
}
////////////////////////////////////////////////////////////
// GPU Frustum Culling
////////////////////////////////////////////////////////////
static
HgiComputePipelineSharedPtr
_GetCullPipeline(
HdStResourceRegistrySharedPtr const & resourceRegistry,
_BindingState const & state,
size_t byteSizeUniforms)
{
// Culling pipeline is compatible as long as the shader is the same.
HgiShaderProgramHandle const & programHandle =
state.glslProgram->GetProgram();
uint64_t const hash = reinterpret_cast<uint64_t>(programHandle.Get());
HdInstance<HgiComputePipelineSharedPtr> pipelineInstance =
resourceRegistry->RegisterComputePipeline(hash);
if (pipelineInstance.IsFirstInstance()) {
// Create a points primitive, vertex shader only pipeline that uses
// a uniform block data for the 'cullParams' in the shader.
HgiComputePipelineDesc pipeDesc;
pipeDesc.debugName = "FrustumCulling";
pipeDesc.shaderProgram = programHandle;
pipeDesc.shaderConstantsDesc.byteSize = byteSizeUniforms;
Hgi* hgi = resourceRegistry->GetHgi();
HgiComputePipelineSharedPtr pipe =
std::make_shared<HgiComputePipelineHandle>(
hgi->CreateComputePipeline(pipeDesc));
pipelineInstance.SetValue(pipe);
}
return pipelineInstance.GetValue();
}
void
HdSt_PipelineDrawBatch::_PrepareIndirectCommandBuffer(
HdStRenderPassStateSharedPtr const & renderPassState,
HdStResourceRegistrySharedPtr const & resourceRegistry,
bool firstDrawBatch)
{
Hgi *hgi = resourceRegistry->GetHgi();
_DrawingProgram & program = _GetDrawingProgram(renderPassState,
resourceRegistry);
if (!TF_VERIFY(program.IsValid())) return;
_BindingState state(
_drawItemInstances.front()->GetDrawItem(),
_dispatchBuffer,
program.GetBinder(),
program.GetGLSLProgram(),
program.GetComposedShaders(),
program.GetGeometricShader());
HgiGraphicsPipelineSharedPtr pso =
_GetDrawPipeline(
renderPassState,
resourceRegistry,
state,
firstDrawBatch);
HgiGraphicsPipelineHandle psoHandle = *pso.get();
HgiResourceBindingsDesc bindingsDesc;
state.GetBindingsForDrawing(&bindingsDesc,
_tessFactorsBuffer, /*bindTessFactors=*/true);
HgiResourceBindingsHandle resourceBindings =
hgi->CreateResourceBindings(bindingsDesc);
HgiVertexBufferBindingVector vertexBindings;
_GetVertexBufferBindingsForDrawing(&vertexBindings, state);
HdStBufferResourceSharedPtr paramBuffer = _dispatchBuffer->
GetBufferArrayRange()->GetResource(HdTokens->drawDispatch);
HgiIndirectCommandEncoder *encoder = hgi->GetIndirectCommandEncoder();
HgiComputeCmds *computeCmds =
resourceRegistry->GetGlobalComputeCmds(HgiComputeDispatchConcurrent);
if (!_useDrawIndexed) {
_indirectCommands = encoder->EncodeDraw(
computeCmds,
psoHandle,
resourceBindings,
vertexBindings,
paramBuffer->GetHandle(),
paramBuffer->GetOffset(),
_dispatchBuffer->GetCount(),
paramBuffer->GetStride());
} else {
HdStBufferResourceSharedPtr indexBuffer =
state.indexBar->GetResource(HdTokens->indices);
_indirectCommands = encoder->EncodeDrawIndexed(
computeCmds,
psoHandle,
resourceBindings,
vertexBindings,
indexBuffer->GetHandle(),
paramBuffer->GetHandle(),
paramBuffer->GetOffset(),
_dispatchBuffer->GetCount(),
paramBuffer->GetStride(),
_patchBaseVertexByteOffset);
}
}
void
HdSt_PipelineDrawBatch::_ExecuteFrustumCull(
bool const updateBufferData,
HdStRenderPassStateSharedPtr const & renderPassState,
HdStResourceRegistrySharedPtr const & resourceRegistry)
{
TRACE_FUNCTION();
// Disable GPU culling when instancing enabled and
// not using instance culling.
if (_useInstancing && !_useInstanceCulling) return;
// Bypass freezeCulling if the command buffer is dirty.
bool const freezeCulling = TfDebug::IsEnabled(HD_FREEZE_CULL_FRUSTUM);
if (freezeCulling && !updateBufferData) return;
if (updateBufferData) {
_dispatchBufferCullInput->CopyData(_drawCommandBuffer);
}
_CreateCullingProgram(resourceRegistry);
if (!TF_VERIFY(_cullingProgram.IsValid())) return;
struct Uniforms {
GfMatrix4f cullMatrix;
GfVec2f drawRangeNDC;
uint32_t drawCommandNumUints;
uint32_t indexEnd;
};
// We perform frustum culling in a compute shader, stomping the
// instanceCount of each drawing command in the dispatch buffer to 0 for
// primitives that are culled, skipping over other elements.
_BindingState state(
_drawItemInstances.front()->GetDrawItem(),
_dispatchBufferCullInput,
_cullingProgram.GetBinder(),
_cullingProgram.GetGLSLProgram(),
_cullingProgram.GetComposedShaders(),
_cullingProgram.GetGeometricShader());
Hgi * hgi = resourceRegistry->GetHgi();
HgiComputePipelineSharedPtr const & pso =
_GetCullPipeline(resourceRegistry,
state,
sizeof(Uniforms));
HgiComputePipelineHandle psoHandle = *pso.get();
HgiComputeCmds* computeCmds =
resourceRegistry->GetGlobalComputeCmds(HgiComputeDispatchConcurrent);
computeCmds->PushDebugGroup("FrustumCulling Cmds");
HgiResourceBindingsDesc bindingsDesc;
state.GetBindingsForViewTransformation(&bindingsDesc);
if (IsEnabledGPUCountVisibleInstances()) {
_BeginGPUCountVisibleInstances(resourceRegistry);
state.binder.GetBufferBindingDesc(
&bindingsDesc,
_tokens->drawIndirectResult,
_resultBuffer,
_resultBuffer->GetOffset());
}
// bind destination buffer
// (using entire buffer bind to start from offset=0)
state.binder.GetBufferBindingDesc(
&bindingsDesc,
_tokens->dispatchBuffer,
_dispatchBuffer->GetEntireResource(),
_dispatchBuffer->GetEntireResource()->GetOffset());
// bind the read-only copy of the destination buffer for input.
state.binder.GetBufferBindingDesc(
&bindingsDesc,
_tokens->drawCullInput,
_dispatchBufferCullInput->GetEntireResource(),
_dispatchBufferCullInput->GetEntireResource()->GetOffset());
// HdSt_ResourceBinder::GetBufferBindingDesc() sets state usage
// to all graphics pipeline stages. Instead we have to set all the
// buffer stage usage to Compute.
for (HgiBufferBindDesc & bufDesc : bindingsDesc.buffers) {
bufDesc.stageUsage = HgiShaderStageCompute;
bufDesc.writable = true;
}
HgiResourceBindingsHandle resourceBindings =
hgi->CreateResourceBindings(bindingsDesc);
computeCmds->BindResources(resourceBindings);
computeCmds->BindPipeline(psoHandle);
GfMatrix4f const &cullMatrix = GfMatrix4f(renderPassState->GetCullMatrix());
GfVec2f const &drawRangeNdc = renderPassState->GetDrawingRangeNDC();
HdStBufferResourceSharedPtr paramBuffer = _dispatchBuffer->
GetBufferArrayRange()->GetResource(HdTokens->drawDispatch);
int const inputCount = _dispatchBufferCullInput->GetCount();
// set instanced cull parameters
Uniforms cullParams;
cullParams.cullMatrix = cullMatrix;
cullParams.drawRangeNDC = drawRangeNdc;
cullParams.drawCommandNumUints = _dispatchBuffer->GetCommandNumUints();
cullParams.indexEnd = inputCount;
computeCmds->SetConstantValues(
psoHandle, 0,
sizeof(Uniforms), &cullParams);
computeCmds->Dispatch(inputCount, 1);
computeCmds->PopDebugGroup();
if (IsEnabledGPUCountVisibleInstances()) {
_EndGPUCountVisibleInstances(resourceRegistry, &_numVisibleItems);
}
hgi->DestroyResourceBindings(&resourceBindings);
}
void
HdSt_PipelineDrawBatch::_ExecutePTCS(
HgiGraphicsCmds *ptcsGfxCmds,
HdStRenderPassStateSharedPtr const & renderPassState,
HdStResourceRegistrySharedPtr const & resourceRegistry,
bool firstDrawBatch)
{
TRACE_FUNCTION();
if (!TF_VERIFY(!_drawItemInstances.empty())) return;
if (!TF_VERIFY(_dispatchBuffer)) return;
if (_HasNothingToDraw()) return;
HgiCapabilities const *capabilities =
resourceRegistry->GetHgi()->GetCapabilities();
// Drawing can be either direct or indirect. For either case,
// the drawing batch and drawing program are prepared to resolve
// drawing coordinate state indirectly, i.e. from buffer data.
bool const drawIndirect =
capabilities->IsSet(HgiDeviceCapabilitiesBitsMultiDrawIndirect);
_DrawingProgram & program = _GetDrawingProgram(renderPassState,
resourceRegistry);
if (!TF_VERIFY(program.IsValid())) return;
_BindingState state(
_drawItemInstances.front()->GetDrawItem(),
_dispatchBuffer,
program.GetBinder(),
program.GetGLSLProgram(),
program.GetComposedShaders(),
program.GetGeometricShader());
Hgi * hgi = resourceRegistry->GetHgi();
HgiGraphicsPipelineSharedPtr const & psoTess =
_GetPTCSPipeline(renderPassState,
resourceRegistry,
state,
firstDrawBatch);
HgiGraphicsPipelineHandle psoTessHandle = *psoTess.get();
ptcsGfxCmds->BindPipeline(psoTessHandle);
HgiResourceBindingsDesc bindingsDesc;
state.GetBindingsForDrawing(&bindingsDesc,
_tessFactorsBuffer, /*bindTessFactors=*/false);
HgiResourceBindingsHandle resourceBindings =
hgi->CreateResourceBindings(bindingsDesc);
ptcsGfxCmds->BindResources(resourceBindings);
HgiVertexBufferBindingVector bindings;
_GetVertexBufferBindingsForDrawing(&bindings, state);
ptcsGfxCmds->BindVertexBuffers(bindings);
if (drawIndirect) {
_ExecuteDrawIndirect(ptcsGfxCmds, state.indexBar);
} else {
_ExecuteDrawImmediate(ptcsGfxCmds, state.indexBar);
}
hgi->DestroyResourceBindings(&resourceBindings);
}
void
HdSt_PipelineDrawBatch::DrawItemInstanceChanged(
HdStDrawItemInstance const * instance)
{
// We need to check the visibility and update if needed
if (!_dispatchBuffer) return;
size_t const batchIndex = instance->GetBatchIndex();
int const commandNumUints = _dispatchBuffer->GetCommandNumUints();
int const numLevels = instance->GetDrawItem()->GetInstancePrimvarNumLevels();
int const instanceIndexWidth = numLevels + 1;
// When non-instance culling is being used, cullcommand points the same
// location as drawcommands. Then we update the same place twice, it
// might be better than branching.
std::vector<uint32_t>::iterator instanceCountIt =
_drawCommandBuffer.begin()
+ batchIndex * commandNumUints
+ _instanceCountOffset;
std::vector<uint32_t>::iterator cullInstanceCountIt =
_drawCommandBuffer.begin()
+ batchIndex * commandNumUints
+ _cullInstanceCountOffset;
HdBufferArrayRangeSharedPtr const &instanceIndexBar_ =
instance->GetDrawItem()->GetInstanceIndexRange();
HdStBufferArrayRangeSharedPtr instanceIndexBar =
std::static_pointer_cast<HdStBufferArrayRange>(instanceIndexBar_);
uint32_t const newInstanceCount =
_GetInstanceCount(instance, instanceIndexBar, instanceIndexWidth);
TF_DEBUG(HDST_DRAW).Msg("\nInstance Count changed: %d -> %d\n",
*instanceCountIt,
newInstanceCount);
// Update instance count and overall count of visible items.
if (static_cast<size_t>(newInstanceCount) != (*instanceCountIt)) {
_numVisibleItems += (newInstanceCount - (*instanceCountIt));
*instanceCountIt = newInstanceCount;
*cullInstanceCountIt = newInstanceCount;
_drawCommandBufferDirty = true;
}
}
void
HdSt_PipelineDrawBatch::_BeginGPUCountVisibleInstances(
HdStResourceRegistrySharedPtr const & resourceRegistry)
{
if (!_resultBuffer) {
HdTupleType tupleType;
tupleType.type = HdTypeInt32;
tupleType.count = 1;
_resultBuffer =
resourceRegistry->RegisterBufferResource(
_tokens->drawIndirectResult, tupleType, HgiBufferUsageStorage);
}
// Reset visible item count
static const int32_t count = 0;
HgiBlitCmds* blitCmds = resourceRegistry->GetGlobalBlitCmds();
HgiBufferCpuToGpuOp op;
op.cpuSourceBuffer = &count;
op.sourceByteOffset = 0;
op.gpuDestinationBuffer = _resultBuffer->GetHandle();
op.destinationByteOffset = 0;
op.byteSize = sizeof(count);
blitCmds->CopyBufferCpuToGpu(op);
// For now we need to submit here, because there gfx commands after
// _BeginGPUCountVisibleInstances that rely on this having executed on GPU.
resourceRegistry->SubmitBlitWork();
}
void
HdSt_PipelineDrawBatch::_EndGPUCountVisibleInstances(
HdStResourceRegistrySharedPtr const & resourceRegistry,
size_t * result)
{
// Submit and wait for all the work recorded up to this point.
// The GPU work must complete before we can read-back the GPU buffer.
resourceRegistry->SubmitComputeWork(HgiSubmitWaitTypeWaitUntilCompleted);
int32_t count = 0;
// Submit GPU buffer read back
HgiBufferGpuToCpuOp copyOp;
copyOp.byteSize = sizeof(count);
copyOp.cpuDestinationBuffer = &count;
copyOp.destinationByteOffset = 0;
copyOp.gpuSourceBuffer = _resultBuffer->GetHandle();
copyOp.sourceByteOffset = 0;
HgiBlitCmds* blitCmds = resourceRegistry->GetGlobalBlitCmds();
blitCmds->CopyBufferGpuToCpu(copyOp);
resourceRegistry->SubmitBlitWork(HgiSubmitWaitTypeWaitUntilCompleted);
*result = count;
}
void
HdSt_PipelineDrawBatch::_CreateCullingProgram(
HdStResourceRegistrySharedPtr const & resourceRegistry)
{
if (!_cullingProgram.GetGLSLProgram() || _dirtyCullingProgram) {
// Create a culling compute shader key
HdSt_CullingComputeShaderKey shaderKey(_useInstanceCulling,
_useTinyPrimCulling,
IsEnabledGPUCountVisibleInstances());
// access the drawing coord from the drawCullInput buffer
_CullingProgram::DrawingCoordBufferBinding drawingCoordBufferBinding{
_tokens->drawCullInput,
uint32_t(_drawCoordOffset),
uint32_t(_dispatchBuffer->GetCommandNumUints()),
};
// sharing the culling geometric shader for the same configuration.
HdSt_GeometricShaderSharedPtr cullShader =
HdSt_GeometricShader::Create(shaderKey, resourceRegistry);
_cullingProgram.SetDrawingCoordBufferBinding(drawingCoordBufferBinding);
_cullingProgram.SetGeometricShader(cullShader);
_cullingProgram.CompileShader(_drawItemInstances.front()->GetDrawItem(),
resourceRegistry);
_dirtyCullingProgram = false;
}
}
void
HdSt_PipelineDrawBatch::_CullingProgram::Initialize(
bool useDrawIndexed,
bool useInstanceCulling,
size_t bufferArrayHash)
{
if (useDrawIndexed != _useDrawIndexed ||
useInstanceCulling != _useInstanceCulling ||
bufferArrayHash != _bufferArrayHash) {
// reset shader
Reset();
}
_useDrawIndexed = useDrawIndexed;
_useInstanceCulling = useInstanceCulling;
_bufferArrayHash = bufferArrayHash;
}
/* virtual */
void
HdSt_PipelineDrawBatch::_CullingProgram::_GetCustomBindings(
HdStBindingRequestVector * customBindings,
bool * enableInstanceDraw) const
{
if (!TF_VERIFY(enableInstanceDraw) ||
!TF_VERIFY(customBindings)) return;
customBindings->push_back(HdStBindingRequest(HdStBinding::SSBO,
_tokens->drawIndirectResult));
customBindings->push_back(HdStBindingRequest(HdStBinding::SSBO,
_tokens->dispatchBuffer));
customBindings->push_back(HdStBindingRequest(HdStBinding::UBO,
_tokens->ulocCullParams));
customBindings->push_back(HdStBindingRequest(HdStBinding::SSBO,
_tokens->drawCullInput));
// set instanceDraw true if instanceCulling is enabled.
// this value will be used to determine if glVertexAttribDivisor needs to
// be enabled or not.
*enableInstanceDraw = _useInstanceCulling;
}
PXR_NAMESPACE_CLOSE_SCOPE
```
|
```m4sugar
# DO NOT EDIT! GENERATED AUTOMATICALLY!
#
# This file is free software; you can redistribute it and/or modify
# (at your option) any later version.
#
# This file is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
#
# along with this file. If not, see <path_to_url
#
# this file may be distributed as part of a program that
# contains a configuration script generated by Autoconf, under
# the same distribution terms as the rest of that program.
#
# Generated by gnulib-tool.
#
# This file represents the compiled summary of the specification in
# gnulib-cache.m4. It lists the computed macro invocations that need
# to be invoked from configure.ac.
# In projects that use version control, this file can be treated like
# other built files.
# This macro should be invoked from gettext-tools/configure.ac, in the section
# "Checks for programs", right after AC_PROG_CC, and certainly before
# any checks for libraries, header files, types and library functions.
AC_DEFUN([gl_EARLY],
[
m4_pattern_forbid([^gl_[A-Z]])dnl the gnulib macro namespace
m4_pattern_allow([^gl_ES$])dnl a valid locale name
m4_pattern_allow([^gl_LIBOBJS$])dnl a variable
m4_pattern_allow([^gl_LTLIBOBJS$])dnl a variable
# Pre-early section.
AC_REQUIRE([gl_USE_SYSTEM_EXTENSIONS])
AC_REQUIRE([gl_PROG_AR_RANLIB])
AC_REQUIRE([AM_PROG_CC_C_O])
# Code from module absolute-header:
# Code from module acl:
# Code from module acl-permissions:
# Code from module acl-tests:
# Code from module alignof:
# Code from module alignof-tests:
# Code from module alloca-opt:
# Code from module alloca-opt-tests:
# Code from module allocator:
# Code from module ansi-c++-opt:
# Code from module areadlink:
# Code from module areadlink-tests:
# Code from module argmatch:
# Code from module argmatch-tests:
# Code from module array-list:
# Code from module array-list-tests:
# Code from module atexit:
# Code from module atexit-tests:
# Code from module backupfile:
# Code from module basename:
# Code from module binary-io:
# Code from module binary-io-tests:
# Code from module bison-i18n:
# Code from module btowc:
# Code from module btowc-tests:
# Code from module byteswap:
# Code from module byteswap-tests:
# Code from module c-ctype:
# Code from module c-ctype-tests:
# Code from module c-strcase:
# Code from module c-strcase-tests:
# Code from module c-strcaseeq:
# Code from module c-strcasestr:
# Code from module c-strcasestr-tests:
# Code from module c-strstr:
# Code from module c-strstr-tests:
# Code from module canonicalize-lgpl:
# Code from module canonicalize-lgpl-tests:
# Code from module careadlinkat:
# Code from module classpath:
# Code from module clean-temp:
# Code from module cloexec:
# Code from module cloexec-tests:
# Code from module close:
# Code from module close-tests:
# Code from module closedir:
# Code from module closeout:
# Code from module concat-filename:
# Code from module configmake:
# Code from module copy-file:
# Code from module copy-file-tests:
# Code from module csharpcomp:
# Code from module csharpcomp-script:
# Code from module csharpexec:
# Code from module csharpexec-script:
# Code from module ctype:
# Code from module ctype-tests:
# Code from module diffseq:
# Code from module dirent:
# Code from module dirent-tests:
# Code from module dirfd:
# Code from module dosname:
# Code from module double-slash-root:
# Code from module dup:
# Code from module dup-tests:
# Code from module dup2:
# Code from module dup2-tests:
# Code from module environ:
# Code from module environ-tests:
# Code from module errno:
# Code from module errno-tests:
# Code from module error:
# Code from module error-progname:
# Code from module execute:
# Code from module exitfail:
# Code from module extensions:
# Code from module extern-inline:
# Code from module fabs:
# Code from module fabs-tests:
# Code from module fatal-signal:
# Code from module fcntl:
# Code from module fcntl-h:
# Code from module fcntl-h-tests:
# Code from module fcntl-tests:
# Code from module fd-hook:
# Code from module fd-ostream:
# Code from module fd-safer-flag:
# Code from module fdopen:
# Code from module fdopen-tests:
# Code from module fgetc-tests:
# Code from module file-has-acl:
# Code from module file-has-acl-tests:
# Code from module file-ostream:
# Code from module filename:
# Code from module findprog:
# Code from module float:
# Code from module float-tests:
# Code from module fnmatch:
# Code from module fnmatch-tests:
# Code from module fopen:
# Code from module fopen-tests:
# Code from module fpieee:
AC_REQUIRE([gl_FP_IEEE])
# Code from module fpucw:
# Code from module fputc-tests:
# Code from module fread-tests:
# Code from module fstat:
# Code from module fstat-tests:
# Code from module fstrcmp:
# Code from module fstrcmp-tests:
# Code from module ftell:
# Code from module ftell-tests:
# Code from module ftello:
AC_REQUIRE([AC_FUNC_FSEEKO])
# Code from module ftello-tests:
# Code from module full-write:
# Code from module fwrite-tests:
# Code from module fwriteerror:
# Code from module gcd:
# Code from module gcj:
# Code from module getcwd-lgpl:
# Code from module getcwd-lgpl-tests:
# Code from module getdelim:
# Code from module getdelim-tests:
# Code from module getdtablesize:
# Code from module getdtablesize-tests:
# Code from module getline:
# Code from module getline-tests:
# Code from module getopt-gnu:
# Code from module getopt-posix:
# Code from module getopt-posix-tests:
# Code from module getpagesize:
# Code from module gettext:
# Code from module gettext-h:
# Code from module gettext-tools-misc:
# Code from module gettimeofday:
# Code from module gettimeofday-tests:
# Code from module gperf:
# Code from module hard-locale:
# Code from module hash:
# Code from module havelib:
# Code from module html-ostream:
# Code from module html-styled-ostream:
# Code from module iconv:
# Code from module iconv-h:
# Code from module iconv-h-tests:
# Code from module iconv-tests:
# Code from module iconv_open:
# Code from module ignore-value:
# Code from module ignore-value-tests:
# Code from module include_next:
# Code from module inline:
# Code from module intprops:
# Code from module intprops-tests:
# Code from module inttypes:
# Code from module inttypes-incomplete:
# Code from module inttypes-tests:
# Code from module isinf:
# Code from module isinf-tests:
# Code from module isnan:
# Code from module isnan-tests:
# Code from module isnand:
# Code from module isnand-nolibm:
# Code from module isnand-nolibm-tests:
# Code from module isnand-tests:
# Code from module isnanf:
# Code from module isnanf-nolibm:
# Code from module isnanf-nolibm-tests:
# Code from module isnanf-tests:
# Code from module isnanl:
# Code from module isnanl-nolibm:
# Code from module isnanl-nolibm-tests:
# Code from module isnanl-tests:
# Code from module iswblank:
# Code from module iswblank-tests:
# Code from module java:
# Code from module javacomp:
# Code from module javacomp-script:
# Code from module javaexec:
# Code from module javaexec-script:
# Code from module javaversion:
# Code from module langinfo:
# Code from module langinfo-tests:
# Code from module largefile:
AC_REQUIRE([AC_SYS_LARGEFILE])
# Code from module libcroco:
# Code from module libglib:
# Code from module libunistring-optional:
# Code from module libxml:
# Code from module linkedhash-list:
# Code from module linkedhash-list-tests:
# Code from module list:
# Code from module localcharset:
# Code from module locale:
# Code from module locale-tests:
# Code from module localename:
# Code from module localename-tests:
# Code from module lock:
# Code from module lock-tests:
# Code from module log10:
# Code from module log10-tests:
# Code from module lseek:
# Code from module lseek-tests:
# Code from module lstat:
# Code from module lstat-tests:
# Code from module malloc-posix:
# Code from module malloca:
# Code from module malloca-tests:
# Code from module math:
# Code from module math-tests:
# Code from module mbchar:
# Code from module mbiter:
# Code from module mbrtowc:
# Code from module mbrtowc-tests:
# Code from module mbsinit:
# Code from module mbsinit-tests:
# Code from module mbslen:
# Code from module mbsrtowcs:
# Code from module mbsrtowcs-tests:
# Code from module mbsstr:
# Code from module mbsstr-tests:
# Code from module mbswidth:
# Code from module mbtowc:
# Code from module mbuiter:
# Code from module memchr:
# Code from module memchr-tests:
# Code from module memmove:
# Code from module memset:
# Code from module minmax:
# Code from module mkdtemp:
# Code from module moo:
# Code from module moo-tests:
# Code from module msvc-inval:
# Code from module msvc-nothrow:
# Code from module multiarch:
# Code from module no-c++:
# Code from module nocrash:
# Code from module obstack:
# Code from module open:
# Code from module open-tests:
# Code from module opendir:
# Code from module openmp:
# Code from module ostream:
# Code from module pathmax:
# Code from module pathmax-tests:
# Code from module pipe-filter-ii:
# Code from module pipe-filter-ii-tests:
# Code from module pipe2:
# Code from module pipe2-safer:
# Code from module pipe2-tests:
# Code from module posix_spawn-internal:
# Code from module posix_spawn_file_actions_addclose:
# Code from module posix_spawn_file_actions_addclose-tests:
# Code from module posix_spawn_file_actions_adddup2:
# Code from module posix_spawn_file_actions_adddup2-tests:
# Code from module posix_spawn_file_actions_addopen:
# Code from module posix_spawn_file_actions_addopen-tests:
# Code from module posix_spawn_file_actions_destroy:
# Code from module posix_spawn_file_actions_init:
# Code from module posix_spawnattr_destroy:
# Code from module posix_spawnattr_init:
# Code from module posix_spawnattr_setflags:
# Code from module posix_spawnattr_setsigmask:
# Code from module posix_spawnp:
# Code from module posix_spawnp-tests:
# Code from module pow:
# Code from module pow-tests:
# Code from module progname:
# Code from module propername:
# Code from module putenv:
# Code from module qcopy-acl:
# Code from module qset-acl:
# Code from module quote:
# Code from module quotearg:
# Code from module quotearg-simple:
# Code from module quotearg-simple-tests:
# Code from module raise:
# Code from module raise-tests:
# Code from module rawmemchr:
# Code from module rawmemchr-tests:
# Code from module read:
# Code from module read-file:
# Code from module read-file-tests:
# Code from module read-tests:
# Code from module readdir:
# Code from module readlink:
# Code from module readlink-tests:
# Code from module realloc-posix:
# Code from module relocatable-prog:
# Code from module relocatable-prog-wrapper:
# Code from module relocatable-script:
# Code from module rmdir:
# Code from module rmdir-tests:
# Code from module safe-read:
# Code from module safe-write:
# Code from module same-inode:
# Code from module sched:
# Code from module sched-tests:
# Code from module secure_getenv:
# Code from module setenv:
# Code from module setenv-tests:
# Code from module setlocale:
# Code from module setlocale-tests:
# Code from module sh-quote:
# Code from module sh-quote-tests:
# Code from module sigaction:
# Code from module sigaction-tests:
# Code from module signal-h:
# Code from module signal-h-tests:
# Code from module signbit:
# Code from module signbit-tests:
# Code from module sigpipe:
# Code from module sigpipe-tests:
# Code from module sigprocmask:
# Code from module sigprocmask-tests:
# Code from module size_max:
# Code from module sleep:
# Code from module sleep-tests:
# Code from module snippet/_Noreturn:
# Code from module snippet/arg-nonnull:
# Code from module snippet/c++defs:
# Code from module snippet/unused-parameter:
# Code from module snippet/warn-on-use:
# Code from module snprintf:
# Code from module snprintf-tests:
# Code from module spawn:
# Code from module spawn-pipe:
# Code from module spawn-pipe-tests:
# Code from module spawn-tests:
# Code from module ssize_t:
# Code from module stat:
# Code from module stat-tests:
# Code from module stdalign:
# Code from module stdalign-tests:
# Code from module stdarg:
dnl Some compilers (e.g., AIX 5.3 cc) need to be in c99 mode
dnl for the builtin va_copy to work. With Autoconf 2.60 or later,
dnl gl_PROG_CC_C99 arranges for this. With older Autoconf gl_PROG_CC_C99
dnl shouldn't hurt, though installers are on their own to set c99 mode.
gl_PROG_CC_C99
# Code from module stdbool:
# Code from module stdbool-tests:
# Code from module stddef:
# Code from module stddef-tests:
# Code from module stdint:
# Code from module stdint-tests:
# Code from module stdio:
# Code from module stdio-tests:
# Code from module stdlib:
# Code from module stdlib-tests:
# Code from module stpcpy:
# Code from module stpncpy:
# Code from module strchrnul:
# Code from module strchrnul-tests:
# Code from module strcspn:
# Code from module streq:
# Code from module strerror:
# Code from module strerror-override:
# Code from module strerror-tests:
# Code from module striconv:
# Code from module striconv-tests:
# Code from module striconveh:
# Code from module striconveh-tests:
# Code from module striconveha:
# Code from module striconveha-tests:
# Code from module string:
# Code from module string-tests:
# Code from module strnlen:
# Code from module strnlen-tests:
# Code from module strnlen1:
# Code from module strpbrk:
# Code from module strstr:
# Code from module strstr-simple:
# Code from module strstr-tests:
# Code from module strtol:
# Code from module strtol-tests:
# Code from module strtoul:
# Code from module strtoul-tests:
# Code from module styled-ostream:
# Code from module symlink:
# Code from module symlink-tests:
# Code from module sys_select:
# Code from module sys_select-tests:
# Code from module sys_stat:
# Code from module sys_stat-tests:
# Code from module sys_time:
# Code from module sys_time-tests:
# Code from module sys_types:
# Code from module sys_types-tests:
# Code from module sys_wait:
# Code from module sys_wait-tests:
# Code from module tempname:
# Code from module term-ostream:
# Code from module term-ostream-tests:
# Code from module term-styled-ostream:
# Code from module terminfo:
# Code from module terminfo-h:
# Code from module test-framework-sh:
# Code from module test-framework-sh-tests:
# Code from module thread:
# Code from module thread-tests:
# Code from module threadlib:
gl_THREADLIB_EARLY
# Code from module time:
# Code from module time-tests:
# Code from module tls:
# Code from module tls-tests:
# Code from module tmpdir:
# Code from module trim:
# Code from module uniconv/base:
# Code from module uniconv/u8-conv-from-enc:
# Code from module uniconv/u8-conv-from-enc-tests:
# Code from module unictype/base:
# Code from module unictype/ctype-space:
# Code from module unictype/ctype-space-tests:
# Code from module unilbrk/base:
# Code from module unilbrk/tables:
# Code from module unilbrk/u8-possible-linebreaks:
# Code from module unilbrk/u8-width-linebreaks:
# Code from module unilbrk/u8-width-linebreaks-tests:
# Code from module unilbrk/ulc-common:
# Code from module unilbrk/ulc-width-linebreaks:
# Code from module uniname/base:
# Code from module uniname/uniname:
# Code from module uniname/uniname-tests:
# Code from module unistd:
# Code from module unistd-safer:
# Code from module unistd-safer-tests:
# Code from module unistd-tests:
# Code from module unistr/base:
# Code from module unistr/u16-mbtouc:
# Code from module unistr/u16-mbtouc-tests:
# Code from module unistr/u8-check:
# Code from module unistr/u8-check-tests:
# Code from module unistr/u8-cmp:
# Code from module unistr/u8-cmp-tests:
# Code from module unistr/u8-mblen:
# Code from module unistr/u8-mblen-tests:
# Code from module unistr/u8-mbtouc:
# Code from module unistr/u8-mbtouc-unsafe:
# Code from module unistr/u8-mbtoucr:
# Code from module unistr/u8-mbtoucr-tests:
# Code from module unistr/u8-prev:
# Code from module unistr/u8-prev-tests:
# Code from module unistr/u8-strlen:
# Code from module unistr/u8-strlen-tests:
# Code from module unistr/u8-uctomb:
# Code from module unistr/u8-uctomb-tests:
# Code from module unitypes:
# Code from module uniwidth/base:
# Code from module uniwidth/width:
# Code from module unlocked-io:
# Code from module unsetenv:
# Code from module unsetenv-tests:
# Code from module vasnprintf:
# Code from module vasnprintf-tests:
# Code from module vasprintf:
# Code from module vasprintf-tests:
# Code from module verify:
# Code from module verify-tests:
# Code from module vsnprintf:
# Code from module vsnprintf-tests:
# Code from module wait-process:
# Code from module waitpid:
# Code from module wchar:
# Code from module wchar-tests:
# Code from module wcrtomb:
# Code from module wcrtomb-tests:
# Code from module wctob:
# Code from module wctomb:
# Code from module wctype-h:
# Code from module wctype-h-tests:
# Code from module wcwidth:
# Code from module wcwidth-tests:
# Code from module write:
# Code from module write-tests:
# Code from module xalloc:
# Code from module xalloc-die:
# Code from module xalloc-die-tests:
# Code from module xconcat-filename:
# Code from module xerror:
# Code from module xlist:
# Code from module xmalloca:
# Code from module xmemdup0:
# Code from module xmemdup0-tests:
# Code from module xreadlink:
# Code from module xsetenv:
# Code from module xsize:
# Code from module xstriconv:
# Code from module xstriconveh:
# Code from module xvasprintf:
# Code from module xvasprintf-tests:
# Code from module yield:
])
# This macro should be invoked from gettext-tools/configure.ac, in the section
# "Check for header files, types and library functions".
AC_DEFUN([gl_INIT],
[
AM_CONDITIONAL([GL_COND_LIBTOOL], [true])
gl_cond_libtool=true
gl_m4_base='gnulib-m4'
m4_pushdef([AC_LIBOBJ], m4_defn([gl_LIBOBJ]))
m4_pushdef([AC_REPLACE_FUNCS], m4_defn([gl_REPLACE_FUNCS]))
m4_pushdef([AC_LIBSOURCES], m4_defn([gl_LIBSOURCES]))
m4_pushdef([gl_LIBSOURCES_LIST], [])
m4_pushdef([gl_LIBSOURCES_DIR], [])
gl_COMMON
gl_source_base='gnulib-lib'
gl_FUNC_ACL
gl_FUNC_ALLOCA
gl_PROG_ANSI_CXX([CXX], [ANSICXX])
gl_FUNC_ATEXIT
if test $ac_cv_func_atexit = no; then
AC_LIBOBJ([atexit])
gl_PREREQ_ATEXIT
fi
gt_PREREQ_BACKUPFILE
BISON_I18N
gl_BYTESWAP
gl_CANONICALIZE_LGPL
if test $HAVE_CANONICALIZE_FILE_NAME = 0 || test $REPLACE_CANONICALIZE_FILE_NAME = 1; then
AC_LIBOBJ([canonicalize-lgpl])
fi
gl_MODULE_INDICATOR([canonicalize-lgpl])
gl_STDLIB_MODULE_INDICATOR([canonicalize_file_name])
gl_STDLIB_MODULE_INDICATOR([realpath])
AC_CHECK_FUNCS_ONCE([readlinkat])
AC_DEFINE([SIGNAL_SAFE_LIST], [1], [Define if lists must be signal-safe.])
gl_MODULE_INDICATOR_FOR_TESTS([cloexec])
gl_FUNC_CLOSE
if test $REPLACE_CLOSE = 1; then
AC_LIBOBJ([close])
fi
gl_UNISTD_MODULE_INDICATOR([close])
gl_FUNC_CLOSEDIR
if test $HAVE_CLOSEDIR = 0 || test $REPLACE_CLOSEDIR = 1; then
AC_LIBOBJ([closedir])
fi
gl_DIRENT_MODULE_INDICATOR([closedir])
gl_CONFIGMAKE_PREP
gl_COPY_FILE
AC_REQUIRE([gt_CSHARPCOMP])
AC_CONFIG_FILES([csharpcomp.sh:../build-aux/csharpcomp.sh.in])
# You need to invoke gt_CSHARPEXEC yourself, possibly with arguments.
AC_CONFIG_FILES([csharpexec.sh:../build-aux/csharpexec.sh.in])
gl_DIRENT_H
gl_FUNC_DIRFD
if test $ac_cv_func_dirfd = no && test $gl_cv_func_dirfd_macro = no \
|| test $REPLACE_DIRFD = 1; then
AC_LIBOBJ([dirfd])
gl_PREREQ_DIRFD
fi
gl_DIRENT_MODULE_INDICATOR([dirfd])
gl_DOUBLE_SLASH_ROOT
gl_FUNC_DUP2
if test $HAVE_DUP2 = 0 || test $REPLACE_DUP2 = 1; then
AC_LIBOBJ([dup2])
gl_PREREQ_DUP2
fi
gl_UNISTD_MODULE_INDICATOR([dup2])
gl_ENVIRON
gl_UNISTD_MODULE_INDICATOR([environ])
gl_HEADER_ERRNO_H
gl_ERROR
if test $ac_cv_lib_error_at_line = no; then
AC_LIBOBJ([error])
gl_PREREQ_ERROR
fi
m4_ifdef([AM_XGETTEXT_OPTION],
[AM_][XGETTEXT_OPTION([--flag=error:3:c-format])
AM_][XGETTEXT_OPTION([--flag=error_at_line:5:c-format])])
gl_EXECUTE
AC_REQUIRE([gl_EXTERN_INLINE])
gl_FUNC_FABS
gl_FATAL_SIGNAL
gl_FUNC_FCNTL
if test $HAVE_FCNTL = 0 || test $REPLACE_FCNTL = 1; then
AC_LIBOBJ([fcntl])
fi
gl_FCNTL_MODULE_INDICATOR([fcntl])
gl_FCNTL_H
gl_MODULE_INDICATOR([fd-safer-flag])
gl_FINDPROG
gl_FLOAT_H
if test $REPLACE_FLOAT_LDBL = 1; then
AC_LIBOBJ([float])
fi
if test $REPLACE_ITOLD = 1; then
AC_LIBOBJ([itold])
fi
gl_FUNC_FNMATCH_POSIX
if test -n "$FNMATCH_H"; then
AC_LIBOBJ([fnmatch])
gl_PREREQ_FNMATCH
fi
gl_FUNC_FOPEN
if test $REPLACE_FOPEN = 1; then
AC_LIBOBJ([fopen])
gl_PREREQ_FOPEN
fi
gl_STDIO_MODULE_INDICATOR([fopen])
gl_FUNC_FSTAT
if test $REPLACE_FSTAT = 1; then
AC_LIBOBJ([fstat])
gl_PREREQ_FSTAT
fi
gl_SYS_STAT_MODULE_INDICATOR([fstat])
gl_MODULE_INDICATOR([fwriteerror])
gt_GCJ
gl_FUNC_GETDELIM
if test $HAVE_GETDELIM = 0 || test $REPLACE_GETDELIM = 1; then
AC_LIBOBJ([getdelim])
gl_PREREQ_GETDELIM
fi
gl_STDIO_MODULE_INDICATOR([getdelim])
gl_FUNC_GETDTABLESIZE
if test $HAVE_GETDTABLESIZE = 0 || test $REPLACE_GETDTABLESIZE = 1; then
AC_LIBOBJ([getdtablesize])
gl_PREREQ_GETDTABLESIZE
fi
gl_UNISTD_MODULE_INDICATOR([getdtablesize])
gl_FUNC_GETLINE
if test $REPLACE_GETLINE = 1; then
AC_LIBOBJ([getline])
gl_PREREQ_GETLINE
fi
gl_STDIO_MODULE_INDICATOR([getline])
gl_FUNC_GETOPT_GNU
if test $REPLACE_GETOPT = 1; then
AC_LIBOBJ([getopt])
AC_LIBOBJ([getopt1])
gl_PREREQ_GETOPT
dnl Arrange for unistd.h to include getopt.h.
GNULIB_GL_UNISTD_H_GETOPT=1
fi
AC_SUBST([GNULIB_GL_UNISTD_H_GETOPT])
gl_MODULE_INDICATOR_FOR_TESTS([getopt-gnu])
gl_FUNC_GETOPT_POSIX
if test $REPLACE_GETOPT = 1; then
AC_LIBOBJ([getopt])
AC_LIBOBJ([getopt1])
gl_PREREQ_GETOPT
dnl Arrange for unistd.h to include getopt.h.
GNULIB_GL_UNISTD_H_GETOPT=1
fi
AC_SUBST([GNULIB_GL_UNISTD_H_GETOPT])
dnl you must add AM_GNU_GETTEXT([external]) or similar to configure.ac.
AM_GNU_GETTEXT_VERSION([0.18.1])
AC_SUBST([LIBINTL])
AC_SUBST([LTLIBINTL])
gl_FUNC_GETTIMEOFDAY
if test $HAVE_GETTIMEOFDAY = 0 || test $REPLACE_GETTIMEOFDAY = 1; then
AC_LIBOBJ([gettimeofday])
gl_PREREQ_GETTIMEOFDAY
fi
gl_SYS_TIME_MODULE_INDICATOR([gettimeofday])
gl_HARD_LOCALE
AM_ICONV
m4_ifdef([gl_ICONV_MODULE_INDICATOR],
[gl_ICONV_MODULE_INDICATOR([iconv])])
gl_ICONV_H
gl_FUNC_ICONV_OPEN
if test $REPLACE_ICONV_OPEN = 1; then
AC_LIBOBJ([iconv_open])
fi
if test $REPLACE_ICONV = 1; then
AC_LIBOBJ([iconv])
AC_LIBOBJ([iconv_close])
fi
gl_INLINE
gl_ISINF
if test $REPLACE_ISINF = 1; then
AC_LIBOBJ([isinf])
fi
gl_MATH_MODULE_INDICATOR([isinf])
gl_ISNAN
gl_MATH_MODULE_INDICATOR([isnan])
gl_FUNC_ISNAND
m4_ifdef([gl_ISNAN], [
AC_REQUIRE([gl_ISNAN])
])
if test $HAVE_ISNAND = 0 || test $REPLACE_ISNAN = 1; then
AC_LIBOBJ([isnand])
gl_PREREQ_ISNAND
fi
gl_MATH_MODULE_INDICATOR([isnand])
gl_FUNC_ISNAND_NO_LIBM
if test $gl_func_isnand_no_libm != yes; then
AC_LIBOBJ([isnand])
gl_PREREQ_ISNAND
fi
gl_FUNC_ISNANF
m4_ifdef([gl_ISNAN], [
AC_REQUIRE([gl_ISNAN])
])
if test $HAVE_ISNANF = 0 || test $REPLACE_ISNAN = 1; then
AC_LIBOBJ([isnanf])
gl_PREREQ_ISNANF
fi
gl_MATH_MODULE_INDICATOR([isnanf])
gl_FUNC_ISNANF_NO_LIBM
if test $gl_func_isnanf_no_libm != yes; then
AC_LIBOBJ([isnanf])
gl_PREREQ_ISNANF
fi
gl_FUNC_ISNANL
m4_ifdef([gl_ISNAN], [
AC_REQUIRE([gl_ISNAN])
])
if test $HAVE_ISNANL = 0 || test $REPLACE_ISNAN = 1; then
AC_LIBOBJ([isnanl])
gl_PREREQ_ISNANL
fi
gl_MATH_MODULE_INDICATOR([isnanl])
gl_FUNC_ISNANL_NO_LIBM
if test $gl_func_isnanl_no_libm != yes; then
AC_LIBOBJ([isnanl])
gl_PREREQ_ISNANL
fi
gl_FUNC_ISWBLANK
if test $HAVE_ISWCNTRL = 0 || test $REPLACE_ISWCNTRL = 1; then
:
else
if test $HAVE_ISWBLANK = 0 || test $REPLACE_ISWBLANK = 1; then
AC_LIBOBJ([iswblank])
fi
fi
gl_WCTYPE_MODULE_INDICATOR([iswblank])
gt_JAVA_CHOICE
# You need to invoke gt_JAVACOMP yourself, possibly with arguments.
AC_CONFIG_FILES([javacomp.sh:../build-aux/javacomp.sh.in])
# You need to invoke gt_JAVAEXEC yourself, possibly with arguments.
AC_CONFIG_FILES([javaexec.sh:../build-aux/javaexec.sh.in])
gl_LANGINFO_H
AC_REQUIRE([gl_LARGEFILE])
gl_LIBCROCO
gl_LIBGLIB
gl_LIBUNISTRING_OPTIONAL
gl_LIBXML
gl_LOCALCHARSET
LOCALCHARSET_TESTS_ENVIRONMENT="CHARSETALIASDIR=\"\$(abs_top_builddir)/$gl_source_base\""
AC_SUBST([LOCALCHARSET_TESTS_ENVIRONMENT])
gl_LOCALE_H
gl_LOCALENAME
gl_LOCK
gl_MODULE_INDICATOR([lock])
gl_FUNC_LOG10
if test $REPLACE_LOG10 = 1; then
AC_LIBOBJ([log10])
fi
gl_MATH_MODULE_INDICATOR([log10])
gl_FUNC_LSTAT
if test $REPLACE_LSTAT = 1; then
AC_LIBOBJ([lstat])
gl_PREREQ_LSTAT
fi
gl_SYS_STAT_MODULE_INDICATOR([lstat])
gl_FUNC_MALLOC_POSIX
if test $REPLACE_MALLOC = 1; then
AC_LIBOBJ([malloc])
fi
gl_STDLIB_MODULE_INDICATOR([malloc-posix])
gl_MALLOCA
gl_MATH_H
gl_MBCHAR
gl_MBITER
gl_FUNC_MBRTOWC
if test $HAVE_MBRTOWC = 0 || test $REPLACE_MBRTOWC = 1; then
AC_LIBOBJ([mbrtowc])
gl_PREREQ_MBRTOWC
fi
gl_WCHAR_MODULE_INDICATOR([mbrtowc])
gl_FUNC_MBSINIT
if test $HAVE_MBSINIT = 0 || test $REPLACE_MBSINIT = 1; then
AC_LIBOBJ([mbsinit])
gl_PREREQ_MBSINIT
fi
gl_WCHAR_MODULE_INDICATOR([mbsinit])
gl_FUNC_MBSLEN
gl_STRING_MODULE_INDICATOR([mbslen])
gl_FUNC_MBSRTOWCS
if test $HAVE_MBSRTOWCS = 0 || test $REPLACE_MBSRTOWCS = 1; then
AC_LIBOBJ([mbsrtowcs])
AC_LIBOBJ([mbsrtowcs-state])
gl_PREREQ_MBSRTOWCS
fi
gl_WCHAR_MODULE_INDICATOR([mbsrtowcs])
gl_STRING_MODULE_INDICATOR([mbsstr])
gl_MBSWIDTH
gl_MBITER
gl_FUNC_MEMCHR
if test $HAVE_MEMCHR = 0 || test $REPLACE_MEMCHR = 1; then
AC_LIBOBJ([memchr])
gl_PREREQ_MEMCHR
fi
gl_STRING_MODULE_INDICATOR([memchr])
gl_FUNC_MEMMOVE
if test $ac_cv_func_memmove = no; then
AC_LIBOBJ([memmove])
gl_PREREQ_MEMMOVE
fi
gl_FUNC_MEMSET
if test $ac_cv_func_memset = no; then
AC_LIBOBJ([memset])
gl_PREREQ_MEMSET
fi
gl_MINMAX
gl_FUNC_MKDTEMP
if test $HAVE_MKDTEMP = 0; then
AC_LIBOBJ([mkdtemp])
gl_PREREQ_MKDTEMP
fi
gl_STDLIB_MODULE_INDICATOR([mkdtemp])
gl_MOO
AC_REQUIRE([gl_MSVC_INVAL])
if test $HAVE_MSVC_INVALID_PARAMETER_HANDLER = 1; then
AC_LIBOBJ([msvc-inval])
fi
AC_REQUIRE([gl_MSVC_NOTHROW])
if test $HAVE_MSVC_INVALID_PARAMETER_HANDLER = 1; then
AC_LIBOBJ([msvc-nothrow])
fi
gl_MULTIARCH
gt_NO_CXX
AC_FUNC_OBSTACK
dnl Note: AC_FUNC_OBSTACK does AC_LIBSOURCES([obstack.h, obstack.c]).
gl_FUNC_OPEN
if test $REPLACE_OPEN = 1; then
AC_LIBOBJ([open])
gl_PREREQ_OPEN
fi
gl_FCNTL_MODULE_INDICATOR([open])
gl_FUNC_OPENDIR
if test $HAVE_OPENDIR = 0 || test $REPLACE_OPENDIR = 1; then
AC_LIBOBJ([opendir])
fi
gl_DIRENT_MODULE_INDICATOR([opendir])
AC_OPENMP
gl_PATHMAX
AC_CHECK_FUNCS_ONCE([select])
gl_FUNC_PIPE2
gl_UNISTD_MODULE_INDICATOR([pipe2])
gl_MODULE_INDICATOR([pipe2-safer])
gl_FUNC_POSIX_SPAWN_FILE_ACTIONS_ADDCLOSE
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN_FILE_ACTIONS_ADDCLOSE = 1; then
AC_LIBOBJ([spawn_faction_addclose])
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawn_file_actions_addclose])
gl_FUNC_POSIX_SPAWN_FILE_ACTIONS_ADDDUP2
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN_FILE_ACTIONS_ADDDUP2 = 1; then
AC_LIBOBJ([spawn_faction_adddup2])
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawn_file_actions_adddup2])
gl_FUNC_POSIX_SPAWN_FILE_ACTIONS_ADDOPEN
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN_FILE_ACTIONS_ADDOPEN = 1; then
AC_LIBOBJ([spawn_faction_addopen])
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawn_file_actions_addopen])
gl_POSIX_SPAWN
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN = 1; then
AC_LIBOBJ([spawn_faction_destroy])
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawn_file_actions_destroy])
gl_POSIX_SPAWN
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN = 1; then
AC_LIBOBJ([spawn_faction_init])
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawn_file_actions_init])
gl_POSIX_SPAWN
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN = 1; then
AC_LIBOBJ([spawnattr_destroy])
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawnattr_destroy])
gl_POSIX_SPAWN
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN = 1; then
AC_LIBOBJ([spawnattr_init])
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawnattr_init])
gl_POSIX_SPAWN
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN = 1; then
AC_LIBOBJ([spawnattr_setflags])
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawnattr_setflags])
gl_POSIX_SPAWN
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN = 1; then
AC_LIBOBJ([spawnattr_setsigmask])
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawnattr_setsigmask])
gl_POSIX_SPAWN
if test $HAVE_POSIX_SPAWN = 0 || test $REPLACE_POSIX_SPAWN = 1; then
AC_LIBOBJ([spawnp])
AC_LIBOBJ([spawni])
gl_PREREQ_POSIX_SPAWN_INTERNAL
fi
gl_SPAWN_MODULE_INDICATOR([posix_spawnp])
gl_FUNC_POW
AC_CHECK_DECLS([program_invocation_name], [], [], [#include <errno.h>])
AC_CHECK_DECLS([program_invocation_short_name], [], [], [#include <errno.h>])
m4_ifdef([AM_XGETTEXT_OPTION],
[AM_][XGETTEXT_OPTION([--keyword='proper_name:1,\"This is a proper name. See the gettext manual, section Names.\"'])
AM_][XGETTEXT_OPTION([--keyword='proper_name_utf8:1,\"This is a proper name. See the gettext manual, section Names.\"'])])
gl_QUOTE
gl_QUOTEARG
gl_FUNC_RAISE
if test $HAVE_RAISE = 0 || test $REPLACE_RAISE = 1; then
AC_LIBOBJ([raise])
gl_PREREQ_RAISE
fi
gl_SIGNAL_MODULE_INDICATOR([raise])
gl_FUNC_RAWMEMCHR
if test $HAVE_RAWMEMCHR = 0; then
AC_LIBOBJ([rawmemchr])
gl_PREREQ_RAWMEMCHR
fi
gl_STRING_MODULE_INDICATOR([rawmemchr])
gl_FUNC_READ
if test $REPLACE_READ = 1; then
AC_LIBOBJ([read])
gl_PREREQ_READ
fi
gl_UNISTD_MODULE_INDICATOR([read])
gl_FUNC_READDIR
if test $HAVE_READDIR = 0; then
AC_LIBOBJ([readdir])
fi
gl_DIRENT_MODULE_INDICATOR([readdir])
gl_FUNC_READLINK
if test $HAVE_READLINK = 0 || test $REPLACE_READLINK = 1; then
AC_LIBOBJ([readlink])
gl_PREREQ_READLINK
fi
gl_UNISTD_MODULE_INDICATOR([readlink])
gl_FUNC_REALLOC_POSIX
if test $REPLACE_REALLOC = 1; then
AC_LIBOBJ([realloc])
fi
gl_STDLIB_MODULE_INDICATOR([realloc-posix])
gl_RELOCATABLE([$gl_source_base])
if test $RELOCATABLE = yes; then
AC_LIBOBJ([progreloc])
AC_LIBOBJ([relocatable])
fi
gl_FUNC_READLINK_SEPARATE
gl_CANONICALIZE_LGPL_SEPARATE
gl_MALLOCA
gl_RELOCATABLE_LIBRARY
gl_FUNC_SETENV_SEPARATE
AC_REQUIRE([gl_RELOCATABLE_NOP])
relocatable_sh=$ac_aux_dir/relocatable.sh.in
AC_SUBST_FILE([relocatable_sh])
gl_FUNC_RMDIR
if test $REPLACE_RMDIR = 1; then
AC_LIBOBJ([rmdir])
fi
gl_UNISTD_MODULE_INDICATOR([rmdir])
gl_PREREQ_SAFE_READ
gl_PREREQ_SAFE_WRITE
gl_SCHED_H
gl_FUNC_SECURE_GETENV
if test $HAVE_SECURE_GETENV = 0; then
AC_LIBOBJ([secure_getenv])
gl_PREREQ_SECURE_GETENV
fi
gl_STDLIB_MODULE_INDICATOR([secure_getenv])
gl_FUNC_SETENV
if test $HAVE_SETENV = 0 || test $REPLACE_SETENV = 1; then
AC_LIBOBJ([setenv])
fi
gl_STDLIB_MODULE_INDICATOR([setenv])
gl_FUNC_SETLOCALE
if test $REPLACE_SETLOCALE = 1; then
AC_LIBOBJ([setlocale])
gl_PREREQ_SETLOCALE
fi
gl_LOCALE_MODULE_INDICATOR([setlocale])
gl_SIGACTION
if test $HAVE_SIGACTION = 0; then
AC_LIBOBJ([sigaction])
gl_PREREQ_SIGACTION
fi
gl_SIGNAL_MODULE_INDICATOR([sigaction])
gl_SIGNAL_H
gl_SIGNBIT
if test $REPLACE_SIGNBIT = 1; then
AC_LIBOBJ([signbitf])
AC_LIBOBJ([signbitd])
AC_LIBOBJ([signbitl])
fi
gl_MATH_MODULE_INDICATOR([signbit])
gl_SIGNAL_SIGPIPE
dnl Define the C macro GNULIB_SIGPIPE to 1.
gl_MODULE_INDICATOR([sigpipe])
dnl Define the substituted variable GNULIB_SIGNAL_H_SIGPIPE to 1.
AC_REQUIRE([gl_SIGNAL_H_DEFAULTS])
GNULIB_SIGNAL_H_SIGPIPE=1
dnl Define the substituted variable GNULIB_STDIO_H_SIGPIPE to 1.
AC_REQUIRE([gl_STDIO_H_DEFAULTS])
AC_REQUIRE([gl_ASM_SYMBOL_PREFIX])
GNULIB_STDIO_H_SIGPIPE=1
dnl Define the substituted variable GNULIB_UNISTD_H_SIGPIPE to 1.
AC_REQUIRE([gl_UNISTD_H_DEFAULTS])
GNULIB_UNISTD_H_SIGPIPE=1
gl_SIGNALBLOCKING
if test $HAVE_POSIX_SIGNALBLOCKING = 0; then
AC_LIBOBJ([sigprocmask])
gl_PREREQ_SIGPROCMASK
fi
gl_SIGNAL_MODULE_INDICATOR([sigprocmask])
gl_SIZE_MAX
gl_FUNC_SNPRINTF
gl_STDIO_MODULE_INDICATOR([snprintf])
gl_MODULE_INDICATOR([snprintf])
gl_SPAWN_H
gl_SPAWN_PIPE
gt_TYPE_SSIZE_T
gl_FUNC_STAT
if test $REPLACE_STAT = 1; then
AC_LIBOBJ([stat])
gl_PREREQ_STAT
fi
gl_SYS_STAT_MODULE_INDICATOR([stat])
gl_STDARG_H
AM_STDBOOL_H
gl_STDDEF_H
gl_STDINT_H
gl_STDIO_H
gl_STDLIB_H
gl_FUNC_STPCPY
if test $HAVE_STPCPY = 0; then
AC_LIBOBJ([stpcpy])
gl_PREREQ_STPCPY
fi
gl_STRING_MODULE_INDICATOR([stpcpy])
gl_FUNC_STPNCPY
if test $HAVE_STPNCPY = 0 || test $REPLACE_STPNCPY = 1; then
AC_LIBOBJ([stpncpy])
gl_PREREQ_STPNCPY
fi
gl_STRING_MODULE_INDICATOR([stpncpy])
gl_FUNC_STRCHRNUL
if test $HAVE_STRCHRNUL = 0 || test $REPLACE_STRCHRNUL = 1; then
AC_LIBOBJ([strchrnul])
gl_PREREQ_STRCHRNUL
fi
gl_STRING_MODULE_INDICATOR([strchrnul])
gl_FUNC_STRCSPN
if test $ac_cv_func_strcspn = no; then
AC_LIBOBJ([strcspn])
gl_PREREQ_STRCSPN
fi
gl_FUNC_STRERROR
if test $REPLACE_STRERROR = 1; then
AC_LIBOBJ([strerror])
fi
gl_MODULE_INDICATOR([strerror])
gl_STRING_MODULE_INDICATOR([strerror])
AC_REQUIRE([gl_HEADER_ERRNO_H])
AC_REQUIRE([gl_FUNC_STRERROR_0])
if test -n "$ERRNO_H" || test $REPLACE_STRERROR_0 = 1; then
AC_LIBOBJ([strerror-override])
gl_PREREQ_SYS_H_WINSOCK2
fi
if test $gl_cond_libtool = false; then
gl_ltlibdeps="$gl_ltlibdeps $LTLIBICONV"
gl_libdeps="$gl_libdeps $LIBICONV"
fi
if test $gl_cond_libtool = false; then
gl_ltlibdeps="$gl_ltlibdeps $LTLIBICONV"
gl_libdeps="$gl_libdeps $LIBICONV"
fi
gl_HEADER_STRING_H
gl_FUNC_STRNLEN
if test $HAVE_DECL_STRNLEN = 0 || test $REPLACE_STRNLEN = 1; then
AC_LIBOBJ([strnlen])
gl_PREREQ_STRNLEN
fi
gl_STRING_MODULE_INDICATOR([strnlen])
gl_FUNC_STRPBRK
if test $HAVE_STRPBRK = 0; then
AC_LIBOBJ([strpbrk])
gl_PREREQ_STRPBRK
fi
gl_STRING_MODULE_INDICATOR([strpbrk])
gl_FUNC_STRSTR
if test $REPLACE_STRSTR = 1; then
AC_LIBOBJ([strstr])
fi
gl_FUNC_STRSTR_SIMPLE
if test $REPLACE_STRSTR = 1; then
AC_LIBOBJ([strstr])
fi
gl_STRING_MODULE_INDICATOR([strstr])
gl_FUNC_STRTOL
if test $ac_cv_func_strtol = no; then
AC_LIBOBJ([strtol])
fi
gl_FUNC_STRTOUL
if test $ac_cv_func_strtoul = no; then
AC_LIBOBJ([strtoul])
fi
gl_HEADER_SYS_SELECT
AC_PROG_MKDIR_P
gl_HEADER_SYS_STAT_H
AC_PROG_MKDIR_P
gl_HEADER_SYS_TIME_H
AC_PROG_MKDIR_P
gl_SYS_TYPES_H
AC_PROG_MKDIR_P
gl_SYS_WAIT_H
AC_PROG_MKDIR_P
gl_FUNC_GEN_TEMPNAME
gl_TERM_OSTREAM
gl_TERMINFO
gl_THREADLIB
gl_HEADER_TIME_H
gl_TLS
gt_TMPDIR
gl_LIBUNISTRING_LIBHEADER([0.9.4], [uniconv.h])
gl_LIBUNISTRING_MODULE([0.9], [uniconv/u8-conv-from-enc])
gl_LIBUNISTRING_LIBHEADER([0.9.4], [unictype.h])
AC_REQUIRE([AC_C_INLINE])
gl_LIBUNISTRING_MODULE([0.9.6], [unictype/ctype-space])
gl_LIBUNISTRING_LIBHEADER([0.9.4], [unilbrk.h])
AC_REQUIRE([AC_C_INLINE])
gl_LIBUNISTRING_MODULE([0.9.6], [unilbrk/u8-possible-linebreaks])
gl_LIBUNISTRING_MODULE([0.9.6], [unilbrk/u8-width-linebreaks])
gl_LIBUNISTRING_MODULE([0.9.6], [unilbrk/ulc-width-linebreaks])
gl_LIBUNISTRING_LIBHEADER([0.9.5], [uniname.h])
gl_LIBUNISTRING_MODULE([0.9.6], [uniname/uniname])
gl_UNISTD_H
gl_UNISTD_SAFER
gl_LIBUNISTRING_LIBHEADER([0.9.4], [unistr.h])
gl_MODULE_INDICATOR([unistr/u16-mbtouc])
gl_LIBUNISTRING_MODULE([0.9], [unistr/u16-mbtouc])
gl_LIBUNISTRING_MODULE([0.9], [unistr/u8-check])
gl_LIBUNISTRING_MODULE([0.9], [unistr/u8-mblen])
gl_MODULE_INDICATOR([unistr/u8-mbtouc])
gl_LIBUNISTRING_MODULE([0.9.4], [unistr/u8-mbtouc])
gl_MODULE_INDICATOR([unistr/u8-mbtouc-unsafe])
gl_LIBUNISTRING_MODULE([0.9.4], [unistr/u8-mbtouc-unsafe])
gl_MODULE_INDICATOR([unistr/u8-mbtoucr])
gl_LIBUNISTRING_MODULE([0.9], [unistr/u8-mbtoucr])
gl_LIBUNISTRING_MODULE([0.9], [unistr/u8-prev])
gl_MODULE_INDICATOR([unistr/u8-uctomb])
gl_LIBUNISTRING_MODULE([0.9], [unistr/u8-uctomb])
gl_LIBUNISTRING_LIBHEADER([0.9.4], [unitypes.h])
gl_LIBUNISTRING_LIBHEADER([0.9.4], [uniwidth.h])
gl_LIBUNISTRING_MODULE([0.9.6], [uniwidth/width])
gl_FUNC_GLIBC_UNLOCKED_IO
gl_FUNC_UNSETENV
if test $HAVE_UNSETENV = 0 || test $REPLACE_UNSETENV = 1; then
AC_LIBOBJ([unsetenv])
gl_PREREQ_UNSETENV
fi
gl_STDLIB_MODULE_INDICATOR([unsetenv])
gl_FUNC_VASNPRINTF
gl_FUNC_VASPRINTF
gl_STDIO_MODULE_INDICATOR([vasprintf])
m4_ifdef([AM_XGETTEXT_OPTION],
[AM_][XGETTEXT_OPTION([--flag=asprintf:2:c-format])
AM_][XGETTEXT_OPTION([--flag=vasprintf:2:c-format])])
gl_FUNC_VSNPRINTF
gl_STDIO_MODULE_INDICATOR([vsnprintf])
gl_WAIT_PROCESS
gt_UNION_WAIT
gl_FUNC_WAITPID
if test $HAVE_WAITPID = 0; then
AC_LIBOBJ([waitpid])
fi
gl_SYS_WAIT_MODULE_INDICATOR([waitpid])
gl_WCHAR_H
gl_WCTYPE_H
gl_FUNC_WCWIDTH
if test $HAVE_WCWIDTH = 0 || test $REPLACE_WCWIDTH = 1; then
AC_LIBOBJ([wcwidth])
fi
gl_WCHAR_MODULE_INDICATOR([wcwidth])
gl_FUNC_WRITE
if test $REPLACE_WRITE = 1; then
AC_LIBOBJ([write])
gl_PREREQ_WRITE
fi
gl_UNISTD_MODULE_INDICATOR([write])
AC_LIBOBJ([xmemdup0])
gl_XSIZE
gl_XVASPRINTF
m4_ifdef([AM_XGETTEXT_OPTION],
[AM_][XGETTEXT_OPTION([--flag=xasprintf:1:c-format])])
# End of code from modules
m4_ifval(gl_LIBSOURCES_LIST, [
m4_syscmd([test ! -d ]m4_defn([gl_LIBSOURCES_DIR])[ ||
for gl_file in ]gl_LIBSOURCES_LIST[ ; do
if test ! -r ]m4_defn([gl_LIBSOURCES_DIR])[/$gl_file ; then
echo "missing file ]m4_defn([gl_LIBSOURCES_DIR])[/$gl_file" >&2
exit 1
fi
done])dnl
m4_if(m4_sysval, [0], [],
[AC_FATAL([expected source file, required through AC_LIBSOURCES, not found])])
])
m4_popdef([gl_LIBSOURCES_DIR])
m4_popdef([gl_LIBSOURCES_LIST])
m4_popdef([AC_LIBSOURCES])
m4_popdef([AC_REPLACE_FUNCS])
m4_popdef([AC_LIBOBJ])
AC_CONFIG_COMMANDS_PRE([
gl_libobjs=
gl_ltlibobjs=
if test -n "$gl_LIBOBJS"; then
# Remove the extension.
sed_drop_objext='s/\.o$//;s/\.obj$//'
for i in `for i in $gl_LIBOBJS; do echo "$i"; done | sed -e "$sed_drop_objext" | sort | uniq`; do
gl_libobjs="$gl_libobjs $i.$ac_objext"
gl_ltlibobjs="$gl_ltlibobjs $i.lo"
done
fi
AC_SUBST([gl_LIBOBJS], [$gl_libobjs])
AC_SUBST([gl_LTLIBOBJS], [$gl_ltlibobjs])
])
gltests_libdeps=
gltests_ltlibdeps=
m4_pushdef([AC_LIBOBJ], m4_defn([gltests_LIBOBJ]))
m4_pushdef([AC_REPLACE_FUNCS], m4_defn([gltests_REPLACE_FUNCS]))
m4_pushdef([AC_LIBSOURCES], m4_defn([gltests_LIBSOURCES]))
m4_pushdef([gltests_LIBSOURCES_LIST], [])
m4_pushdef([gltests_LIBSOURCES_DIR], [])
gl_COMMON
gl_source_base='gnulib-tests'
changequote(,)dnl
gltests_WITNESS=IN_`echo "${PACKAGE-$PACKAGE_TARNAME}" | LC_ALL=C tr abcdefghijklmnopqrstuvwxyz ABCDEFGHIJKLMNOPQRSTUVWXYZ | LC_ALL=C sed -e 's/[^A-Z0-9_]/_/g'`_GNULIB_TESTS
changequote([, ])dnl
AC_SUBST([gltests_WITNESS])
gl_module_indicator_condition=$gltests_WITNESS
m4_pushdef([gl_MODULE_INDICATOR_CONDITION], [$gl_module_indicator_condition])
gl_FUNC_BTOWC
if test $HAVE_BTOWC = 0 || test $REPLACE_BTOWC = 1; then
AC_LIBOBJ([btowc])
gl_PREREQ_BTOWC
fi
gl_WCHAR_MODULE_INDICATOR([btowc])
gt_LOCALE_FR
gt_LOCALE_FR_UTF8
gt_LOCALE_FR
gt_LOCALE_TR_UTF8
gl_CTYPE_H
gl_FUNC_DUP
if test $REPLACE_DUP = 1; then
AC_LIBOBJ([dup])
gl_PREREQ_DUP
fi
gl_UNISTD_MODULE_INDICATOR([dup])
gl_FUNC_FDOPEN
if test $REPLACE_FDOPEN = 1; then
AC_LIBOBJ([fdopen])
gl_PREREQ_FDOPEN
fi
gl_STDIO_MODULE_INDICATOR([fdopen])
gl_FILE_HAS_ACL
AC_CHECK_DECLS_ONCE([alarm])
gl_FUNC_FTELL
if test $REPLACE_FTELL = 1; then
AC_LIBOBJ([ftell])
fi
gl_STDIO_MODULE_INDICATOR([ftell])
gl_FUNC_UNGETC_WORKS
gl_FUNC_FTELLO
if test $HAVE_FTELLO = 0 || test $REPLACE_FTELLO = 1; then
AC_LIBOBJ([ftello])
gl_PREREQ_FTELLO
fi
gl_STDIO_MODULE_INDICATOR([ftello])
gl_FUNC_UNGETC_WORKS
gl_FUNC_GETCWD_LGPL
if test $REPLACE_GETCWD = 1; then
AC_LIBOBJ([getcwd-lgpl])
fi
gl_UNISTD_MODULE_INDICATOR([getcwd])
gl_FUNC_GETPAGESIZE
if test $REPLACE_GETPAGESIZE = 1; then
AC_LIBOBJ([getpagesize])
fi
gl_UNISTD_MODULE_INDICATOR([getpagesize])
gl_INTTYPES_H
gl_INTTYPES_INCOMPLETE
gl_FLOAT_EXPONENT_LOCATION
gl_DOUBLE_EXPONENT_LOCATION
gl_LONG_DOUBLE_EXPONENT_LOCATION
AC_REQUIRE([gl_LONG_DOUBLE_VS_DOUBLE])
gl_FLOAT_EXPONENT_LOCATION
gl_DOUBLE_EXPONENT_LOCATION
gl_LONG_DOUBLE_EXPONENT_LOCATION
AC_REQUIRE([gl_LONG_DOUBLE_VS_DOUBLE])
gl_DOUBLE_EXPONENT_LOCATION
gl_DOUBLE_EXPONENT_LOCATION
gl_FLOAT_EXPONENT_LOCATION
gl_FLOAT_EXPONENT_LOCATION
gl_LONG_DOUBLE_EXPONENT_LOCATION
AC_REQUIRE([gl_LONG_DOUBLE_VS_DOUBLE])
gl_LONG_DOUBLE_EXPONENT_LOCATION
AC_REQUIRE([gl_LONG_DOUBLE_VS_DOUBLE])
AC_CHECK_FUNCS_ONCE([newlocale])
AC_CHECK_FUNCS_ONCE([newlocale])
gl_FUNC_LSEEK
if test $REPLACE_LSEEK = 1; then
AC_LIBOBJ([lseek])
fi
gl_UNISTD_MODULE_INDICATOR([lseek])
gt_LOCALE_FR
gt_LOCALE_FR_UTF8
gt_LOCALE_JA
gt_LOCALE_ZH_CN
gt_LOCALE_FR_UTF8
gt_LOCALE_FR
gt_LOCALE_FR_UTF8
gt_LOCALE_JA
gt_LOCALE_ZH_CN
gt_LOCALE_FR_UTF8
gt_LOCALE_ZH_CN
gl_FUNC_MBTOWC
if test $REPLACE_MBTOWC = 1; then
AC_LIBOBJ([mbtowc])
gl_PREREQ_MBTOWC
fi
gl_STDLIB_MODULE_INDICATOR([mbtowc])
dnl Check for prerequisites for memory fence checks.
gl_FUNC_MMAP_ANON
AC_CHECK_HEADERS_ONCE([sys/mman.h])
AC_CHECK_FUNCS_ONCE([mprotect])
AC_EGREP_CPP([notposix], [[
#if defined _MSC_VER || defined __MINGW32__
notposix
#endif
]],
[posix_spawn_ported=no],
[posix_spawn_ported=yes])
AM_CONDITIONAL([POSIX_SPAWN_PORTED], [test $posix_spawn_ported = yes])
gl_FUNC_PUTENV
if test $REPLACE_PUTENV = 1; then
AC_LIBOBJ([putenv])
gl_PREREQ_PUTENV
fi
gl_STDLIB_MODULE_INDICATOR([putenv])
dnl Check for prerequisites for memory fence checks.
dnl FIXME: zerosize-ptr.h requires these: make a module for it
gl_FUNC_MMAP_ANON
AC_CHECK_HEADERS_ONCE([sys/mman.h])
AC_CHECK_FUNCS_ONCE([mprotect])
dnl Check for prerequisites for memory fence checks.
gl_FUNC_MMAP_ANON
AC_CHECK_HEADERS_ONCE([sys/mman.h])
AC_CHECK_FUNCS_ONCE([mprotect])
gl_PREREQ_READ_FILE
gt_LOCALE_FR
gt_LOCALE_FR_UTF8
gt_LOCALE_JA
gt_LOCALE_ZH_CN
AC_REQUIRE([gl_FLOAT_EXPONENT_LOCATION])
AC_REQUIRE([gl_DOUBLE_EXPONENT_LOCATION])
AC_REQUIRE([gl_LONG_DOUBLE_EXPONENT_LOCATION])
gl_FUNC_SLEEP
if test $HAVE_SLEEP = 0 || test $REPLACE_SLEEP = 1; then
AC_LIBOBJ([sleep])
fi
gl_UNISTD_MODULE_INDICATOR([sleep])
AC_CHECK_DECLS_ONCE([alarm])
gl_STDALIGN_H
AC_REQUIRE([gt_TYPE_WCHAR_T])
AC_REQUIRE([gt_TYPE_WINT_T])
dnl Check for prerequisites for memory fence checks.
gl_FUNC_MMAP_ANON
AC_CHECK_HEADERS_ONCE([sys/mman.h])
AC_CHECK_FUNCS_ONCE([mprotect])
AC_CHECK_DECLS_ONCE([alarm])
gl_FUNC_MMAP_ANON
AC_CHECK_HEADERS_ONCE([sys/mman.h])
AC_CHECK_FUNCS_ONCE([mprotect])
gl_FUNC_SYMLINK
if test $HAVE_SYMLINK = 0 || test $REPLACE_SYMLINK = 1; then
AC_LIBOBJ([symlink])
fi
gl_UNISTD_MODULE_INDICATOR([symlink])
gl_THREAD
gl_LIBUNISTRING_MODULE([0.9], [unistr/u8-cmp])
gl_FUNC_MMAP_ANON
AC_CHECK_HEADERS_ONCE([sys/mman.h])
AC_CHECK_FUNCS_ONCE([mprotect])
gl_LIBUNISTRING_MODULE([0.9], [unistr/u8-strlen])
gl_FUNC_WCRTOMB
if test $HAVE_WCRTOMB = 0 || test $REPLACE_WCRTOMB = 1; then
AC_LIBOBJ([wcrtomb])
gl_PREREQ_WCRTOMB
fi
gl_WCHAR_MODULE_INDICATOR([wcrtomb])
gt_LOCALE_FR
gt_LOCALE_FR_UTF8
gt_LOCALE_JA
gt_LOCALE_ZH_CN
gl_FUNC_WCTOB
if test $HAVE_WCTOB = 0 || test $REPLACE_WCTOB = 1; then
AC_LIBOBJ([wctob])
gl_PREREQ_WCTOB
fi
gl_WCHAR_MODULE_INDICATOR([wctob])
gl_FUNC_WCTOMB
if test $REPLACE_WCTOMB = 1; then
AC_LIBOBJ([wctomb])
gl_PREREQ_WCTOMB
fi
gl_STDLIB_MODULE_INDICATOR([wctomb])
gl_YIELD
m4_popdef([gl_MODULE_INDICATOR_CONDITION])
m4_ifval(gltests_LIBSOURCES_LIST, [
m4_syscmd([test ! -d ]m4_defn([gltests_LIBSOURCES_DIR])[ ||
for gl_file in ]gltests_LIBSOURCES_LIST[ ; do
if test ! -r ]m4_defn([gltests_LIBSOURCES_DIR])[/$gl_file ; then
echo "missing file ]m4_defn([gltests_LIBSOURCES_DIR])[/$gl_file" >&2
exit 1
fi
done])dnl
m4_if(m4_sysval, [0], [],
[AC_FATAL([expected source file, required through AC_LIBSOURCES, not found])])
])
m4_popdef([gltests_LIBSOURCES_DIR])
m4_popdef([gltests_LIBSOURCES_LIST])
m4_popdef([AC_LIBSOURCES])
m4_popdef([AC_REPLACE_FUNCS])
m4_popdef([AC_LIBOBJ])
AC_CONFIG_COMMANDS_PRE([
gltests_libobjs=
gltests_ltlibobjs=
if test -n "$gltests_LIBOBJS"; then
# Remove the extension.
sed_drop_objext='s/\.o$//;s/\.obj$//'
for i in `for i in $gltests_LIBOBJS; do echo "$i"; done | sed -e "$sed_drop_objext" | sort | uniq`; do
gltests_libobjs="$gltests_libobjs $i.$ac_objext"
gltests_ltlibobjs="$gltests_ltlibobjs $i.lo"
done
fi
AC_SUBST([gltests_LIBOBJS], [$gltests_libobjs])
AC_SUBST([gltests_LTLIBOBJS], [$gltests_ltlibobjs])
])
LIBTESTS_LIBDEPS="$gltests_libdeps"
AC_SUBST([LIBTESTS_LIBDEPS])
])
# Like AC_LIBOBJ, except that the module name goes
# into gl_LIBOBJS instead of into LIBOBJS.
AC_DEFUN([gl_LIBOBJ], [
AS_LITERAL_IF([$1], [gl_LIBSOURCES([$1.c])])dnl
gl_LIBOBJS="$gl_LIBOBJS $1.$ac_objext"
])
# Like AC_REPLACE_FUNCS, except that the module name goes
# into gl_LIBOBJS instead of into LIBOBJS.
AC_DEFUN([gl_REPLACE_FUNCS], [
m4_foreach_w([gl_NAME], [$1], [AC_LIBSOURCES(gl_NAME[.c])])dnl
AC_CHECK_FUNCS([$1], , [gl_LIBOBJ($ac_func)])
])
# Like AC_LIBSOURCES, except the directory where the source file is
# expected is derived from the gnulib-tool parameterization,
# and alloca is special cased (for the alloca-opt module).
# We could also entirely rely on EXTRA_lib..._SOURCES.
AC_DEFUN([gl_LIBSOURCES], [
m4_foreach([_gl_NAME], [$1], [
m4_if(_gl_NAME, [alloca.c], [], [
m4_define([gl_LIBSOURCES_DIR], [gnulib-lib])
m4_append([gl_LIBSOURCES_LIST], _gl_NAME, [ ])
])
])
])
# Like AC_LIBOBJ, except that the module name goes
# into gltests_LIBOBJS instead of into LIBOBJS.
AC_DEFUN([gltests_LIBOBJ], [
AS_LITERAL_IF([$1], [gltests_LIBSOURCES([$1.c])])dnl
gltests_LIBOBJS="$gltests_LIBOBJS $1.$ac_objext"
])
# Like AC_REPLACE_FUNCS, except that the module name goes
# into gltests_LIBOBJS instead of into LIBOBJS.
AC_DEFUN([gltests_REPLACE_FUNCS], [
m4_foreach_w([gl_NAME], [$1], [AC_LIBSOURCES(gl_NAME[.c])])dnl
AC_CHECK_FUNCS([$1], , [gltests_LIBOBJ($ac_func)])
])
# Like AC_LIBSOURCES, except the directory where the source file is
# expected is derived from the gnulib-tool parameterization,
# and alloca is special cased (for the alloca-opt module).
# We could also entirely rely on EXTRA_lib..._SOURCES.
AC_DEFUN([gltests_LIBSOURCES], [
m4_foreach([_gl_NAME], [$1], [
m4_if(_gl_NAME, [alloca.c], [], [
m4_define([gltests_LIBSOURCES_DIR], [gnulib-tests])
m4_append([gltests_LIBSOURCES_LIST], _gl_NAME, [ ])
])
])
])
# This macro records the list of files which have been installed by
# gnulib-tool and may be removed by future gnulib-tool invocations.
AC_DEFUN([gl_FILE_LIST], [
build-aux/config.libpath
build-aux/config.rpath
build-aux/csharpcomp.sh.in
build-aux/csharpexec.sh.in
build-aux/install-reloc
build-aux/javacomp.sh.in
build-aux/javaexec.sh.in
build-aux/moopp
build-aux/reloc-ldflags
build-aux/relocatable.sh.in
build-aux/snippet/_Noreturn.h
build-aux/snippet/arg-nonnull.h
build-aux/snippet/c++defs.h
build-aux/snippet/unused-parameter.h
build-aux/snippet/warn-on-use.h
doc/relocatable.texi
lib/acl-errno-valid.c
lib/acl-internal.c
lib/acl-internal.h
lib/acl.h
lib/acl_entries.c
lib/addext.c
lib/alignof.h
lib/alloca.in.h
lib/allocator.c
lib/allocator.h
lib/areadlink.c
lib/areadlink.h
lib/argmatch.c
lib/argmatch.h
lib/asnprintf.c
lib/asprintf.c
lib/atexit.c
lib/backupfile.c
lib/backupfile.h
lib/basename.c
lib/basename.h
lib/binary-io.c
lib/binary-io.h
lib/byteswap.in.h
lib/c-ctype.c
lib/c-ctype.h
lib/c-strcase.h
lib/c-strcasecmp.c
lib/c-strcaseeq.h
lib/c-strcasestr.c
lib/c-strcasestr.h
lib/c-strncasecmp.c
lib/c-strstr.c
lib/c-strstr.h
lib/canonicalize-lgpl.c
lib/careadlinkat.c
lib/careadlinkat.h
lib/classpath.c
lib/classpath.h
lib/clean-temp.c
lib/clean-temp.h
lib/cloexec.c
lib/cloexec.h
lib/close.c
lib/closedir.c
lib/closeout.c
lib/closeout.h
lib/concat-filename.c
lib/concat-filename.h
lib/config.charset
lib/copy-acl.c
lib/copy-file.c
lib/copy-file.h
lib/csharpcomp.c
lib/csharpcomp.h
lib/csharpexec.c
lib/csharpexec.h
lib/diffseq.h
lib/dirent-private.h
lib/dirent.in.h
lib/dirfd.c
lib/dosname.h
lib/dup-safer-flag.c
lib/dup-safer.c
lib/dup2.c
lib/errno.in.h
lib/error-progname.c
lib/error-progname.h
lib/error.c
lib/error.h
lib/execute.c
lib/execute.h
lib/exitfail.c
lib/exitfail.h
lib/fatal-signal.c
lib/fatal-signal.h
lib/fcntl.c
lib/fcntl.in.h
lib/fd-hook.c
lib/fd-hook.h
lib/fd-ostream.oo.c
lib/fd-ostream.oo.h
lib/fd-safer-flag.c
lib/fd-safer.c
lib/file-ostream.oo.c
lib/file-ostream.oo.h
lib/filename.h
lib/findprog.c
lib/findprog.h
lib/float+.h
lib/float.c
lib/float.in.h
lib/fnmatch.c
lib/fnmatch.in.h
lib/fnmatch_loop.c
lib/fopen.c
lib/fstat.c
lib/fstrcmp.c
lib/fstrcmp.h
lib/full-write.c
lib/full-write.h
lib/fwriteerror.c
lib/fwriteerror.h
lib/gcd.c
lib/gcd.h
lib/get-permissions.c
lib/getdelim.c
lib/getdtablesize.c
lib/getline.c
lib/getopt.c
lib/getopt.in.h
lib/getopt1.c
lib/getopt_int.h
lib/gettext.h
lib/gettimeofday.c
lib/gl_anyhash_list1.h
lib/gl_anyhash_list2.h
lib/gl_anylinked_list1.h
lib/gl_anylinked_list2.h
lib/gl_array_list.c
lib/gl_array_list.h
lib/gl_linkedhash_list.c
lib/gl_linkedhash_list.h
lib/gl_list.c
lib/gl_list.h
lib/gl_xlist.c
lib/gl_xlist.h
lib/glib.in.h
lib/glib/ghash.c
lib/glib/ghash.in.h
lib/glib/glist.c
lib/glib/glist.in.h
lib/glib/gmessages.c
lib/glib/gprimes.c
lib/glib/gprimes.in.h
lib/glib/gstrfuncs.c
lib/glib/gstrfuncs.in.h
lib/glib/gstring.c
lib/glib/gstring.in.h
lib/glib/gtypes.in.h
lib/glibconfig.in.h
lib/glthread/lock.c
lib/glthread/lock.h
lib/glthread/threadlib.c
lib/glthread/tls.c
lib/glthread/tls.h
lib/hard-locale.c
lib/hard-locale.h
lib/hash.c
lib/hash.h
lib/html-ostream.oo.c
lib/html-ostream.oo.h
lib/html-styled-ostream.oo.c
lib/html-styled-ostream.oo.h
lib/iconv.c
lib/iconv.in.h
lib/iconv_close.c
lib/iconv_open-aix.gperf
lib/iconv_open-hpux.gperf
lib/iconv_open-irix.gperf
lib/iconv_open-osf.gperf
lib/iconv_open-solaris.gperf
lib/iconv_open.c
lib/iconveh.h
lib/ignore-value.h
lib/intprops.h
lib/isinf.c
lib/isnan.c
lib/isnand-nolibm.h
lib/isnand.c
lib/isnanf-nolibm.h
lib/isnanf.c
lib/isnanl-nolibm.h
lib/isnanl.c
lib/iswblank.c
lib/itold.c
lib/javacomp.c
lib/javacomp.h
lib/javaexec.c
lib/javaexec.h
lib/javaversion.c
lib/javaversion.class
lib/javaversion.h
lib/javaversion.java
lib/langinfo.in.h
lib/libcroco/cr-additional-sel.c
lib/libcroco/cr-additional-sel.h
lib/libcroco/cr-attr-sel.c
lib/libcroco/cr-attr-sel.h
lib/libcroco/cr-cascade.c
lib/libcroco/cr-cascade.h
lib/libcroco/cr-declaration.c
lib/libcroco/cr-declaration.h
lib/libcroco/cr-doc-handler.c
lib/libcroco/cr-doc-handler.h
lib/libcroco/cr-enc-handler.c
lib/libcroco/cr-enc-handler.h
lib/libcroco/cr-fonts.c
lib/libcroco/cr-fonts.h
lib/libcroco/cr-input.c
lib/libcroco/cr-input.h
lib/libcroco/cr-num.c
lib/libcroco/cr-num.h
lib/libcroco/cr-om-parser.c
lib/libcroco/cr-om-parser.h
lib/libcroco/cr-parser.c
lib/libcroco/cr-parser.h
lib/libcroco/cr-parsing-location.c
lib/libcroco/cr-parsing-location.h
lib/libcroco/cr-prop-list.c
lib/libcroco/cr-prop-list.h
lib/libcroco/cr-pseudo.c
lib/libcroco/cr-pseudo.h
lib/libcroco/cr-rgb.c
lib/libcroco/cr-rgb.h
lib/libcroco/cr-sel-eng.c
lib/libcroco/cr-sel-eng.h
lib/libcroco/cr-selector.c
lib/libcroco/cr-selector.h
lib/libcroco/cr-simple-sel.c
lib/libcroco/cr-simple-sel.h
lib/libcroco/cr-statement.c
lib/libcroco/cr-statement.h
lib/libcroco/cr-string.c
lib/libcroco/cr-string.h
lib/libcroco/cr-style.c
lib/libcroco/cr-style.h
lib/libcroco/cr-stylesheet.c
lib/libcroco/cr-stylesheet.h
lib/libcroco/cr-term.c
lib/libcroco/cr-term.h
lib/libcroco/cr-tknzr.c
lib/libcroco/cr-tknzr.h
lib/libcroco/cr-token.c
lib/libcroco/cr-token.h
lib/libcroco/cr-utils.c
lib/libcroco/cr-utils.h
lib/libcroco/libcroco-config.h
lib/libcroco/libcroco.h
lib/libunistring.valgrind
lib/libxml/COPYING
lib/libxml/DOCBparser.c
lib/libxml/DOCBparser.in.h
lib/libxml/HTMLparser.c
lib/libxml/HTMLparser.in.h
lib/libxml/HTMLtree.c
lib/libxml/HTMLtree.in.h
lib/libxml/SAX.c
lib/libxml/SAX.in.h
lib/libxml/SAX2.c
lib/libxml/SAX2.in.h
lib/libxml/buf.c
lib/libxml/buf.h
lib/libxml/c14n.c
lib/libxml/c14n.in.h
lib/libxml/catalog.c
lib/libxml/catalog.in.h
lib/libxml/chvalid.c
lib/libxml/chvalid.in.h
lib/libxml/debugXML.c
lib/libxml/debugXML.in.h
lib/libxml/dict.c
lib/libxml/dict.in.h
lib/libxml/elfgcchack.h
lib/libxml/enc.h
lib/libxml/encoding.c
lib/libxml/encoding.in.h
lib/libxml/entities.c
lib/libxml/entities.in.h
lib/libxml/error.c
lib/libxml/globals.c
lib/libxml/globals.in.h
lib/libxml/hash.c
lib/libxml/hash.in.h
lib/libxml/legacy.c
lib/libxml/libxml.h
lib/libxml/list.c
lib/libxml/list.in.h
lib/libxml/nanoftp.c
lib/libxml/nanoftp.in.h
lib/libxml/nanohttp.c
lib/libxml/nanohttp.in.h
lib/libxml/parser.c
lib/libxml/parser.in.h
lib/libxml/parserInternals.c
lib/libxml/parserInternals.in.h
lib/libxml/pattern.c
lib/libxml/pattern.in.h
lib/libxml/relaxng.c
lib/libxml/relaxng.in.h
lib/libxml/save.h
lib/libxml/schemasInternals.in.h
lib/libxml/schematron.c
lib/libxml/schematron.in.h
lib/libxml/threads.c
lib/libxml/threads.in.h
lib/libxml/timsort.h
lib/libxml/tree.c
lib/libxml/tree.in.h
lib/libxml/trionan.c
lib/libxml/uri.c
lib/libxml/uri.in.h
lib/libxml/valid.c
lib/libxml/valid.in.h
lib/libxml/xinclude.c
lib/libxml/xinclude.in.h
lib/libxml/xlink.c
lib/libxml/xlink.in.h
lib/libxml/xmlIO.c
lib/libxml/xmlIO.in.h
lib/libxml/xmlautomata.in.h
lib/libxml/xmlerror.in.h
lib/libxml/xmlexports.in.h
lib/libxml/xmlmemory.c
lib/libxml/xmlmemory.in.h
lib/libxml/xmlmodule.c
lib/libxml/xmlmodule.in.h
lib/libxml/xmlreader.c
lib/libxml/xmlreader.in.h
lib/libxml/xmlregexp.c
lib/libxml/xmlregexp.in.h
lib/libxml/xmlsave.c
lib/libxml/xmlsave.in.h
lib/libxml/xmlschemas.c
lib/libxml/xmlschemas.in.h
lib/libxml/xmlschemastypes.c
lib/libxml/xmlschemastypes.in.h
lib/libxml/xmlstring.c
lib/libxml/xmlstring.in.h
lib/libxml/xmlunicode.c
lib/libxml/xmlunicode.in.h
lib/libxml/xmlversion.in.h
lib/libxml/xmlwriter.c
lib/libxml/xmlwriter.in.h
lib/libxml/xpath.c
lib/libxml/xpath.in.h
lib/libxml/xpathInternals.in.h
lib/libxml/xpointer.c
lib/libxml/xpointer.in.h
lib/localcharset.c
lib/localcharset.h
lib/locale.in.h
lib/localename.c
lib/localename.h
lib/log10.c
lib/lstat.c
lib/malloc.c
lib/malloca.c
lib/malloca.h
lib/malloca.valgrind
lib/math.c
lib/math.in.h
lib/mbchar.c
lib/mbchar.h
lib/mbiter.c
lib/mbiter.h
lib/mbrtowc.c
lib/mbsinit.c
lib/mbslen.c
lib/mbsrtowcs-impl.h
lib/mbsrtowcs-state.c
lib/mbsrtowcs.c
lib/mbsstr.c
lib/mbswidth.c
lib/mbswidth.h
lib/mbuiter.c
lib/mbuiter.h
lib/memchr.c
lib/memchr.valgrind
lib/memmove.c
lib/memset.c
lib/minmax.h
lib/mkdtemp.c
lib/moo.h
lib/msvc-inval.c
lib/msvc-inval.h
lib/msvc-nothrow.c
lib/msvc-nothrow.h
lib/obstack.c
lib/obstack.h
lib/open.c
lib/opendir.c
lib/ostream.oo.c
lib/ostream.oo.h
lib/pathmax.h
lib/pipe-filter-aux.c
lib/pipe-filter-aux.h
lib/pipe-filter-ii.c
lib/pipe-filter.h
lib/pipe-safer.c
lib/pipe2-safer.c
lib/pipe2.c
lib/printf-args.c
lib/printf-args.h
lib/printf-parse.c
lib/printf-parse.h
lib/progname.c
lib/progname.h
lib/progreloc.c
lib/propername.c
lib/propername.h
lib/qcopy-acl.c
lib/qset-acl.c
lib/quote.h
lib/quotearg.c
lib/quotearg.h
lib/raise.c
lib/rawmemchr.c
lib/rawmemchr.valgrind
lib/read.c
lib/readdir.c
lib/readlink.c
lib/realloc.c
lib/ref-add.sin
lib/ref-del.sin
lib/relocatable.c
lib/relocatable.h
lib/relocwrapper.c
lib/rmdir.c
lib/safe-read.c
lib/safe-read.h
lib/safe-write.c
lib/safe-write.h
lib/sched.in.h
lib/secure_getenv.c
lib/set-acl.c
lib/set-permissions.c
lib/setenv.c
lib/setlocale.c
lib/sh-quote.c
lib/sh-quote.h
lib/sig-handler.c
lib/sig-handler.h
lib/sigaction.c
lib/signal.in.h
lib/signbitd.c
lib/signbitf.c
lib/signbitl.c
lib/sigprocmask.c
lib/size_max.h
lib/snprintf.c
lib/spawn-pipe.c
lib/spawn-pipe.h
lib/spawn.in.h
lib/spawn_faction_addclose.c
lib/spawn_faction_adddup2.c
lib/spawn_faction_addopen.c
lib/spawn_faction_destroy.c
lib/spawn_faction_init.c
lib/spawn_int.h
lib/spawnattr_destroy.c
lib/spawnattr_init.c
lib/spawnattr_setflags.c
lib/spawnattr_setsigmask.c
lib/spawni.c
lib/spawnp.c
lib/stat.c
lib/stdarg.in.h
lib/stdbool.in.h
lib/stddef.in.h
lib/stdint.in.h
lib/stdio-write.c
lib/stdio.in.h
lib/stdlib.in.h
lib/stpcpy.c
lib/stpncpy.c
lib/str-kmp.h
lib/str-two-way.h
lib/strchrnul.c
lib/strchrnul.valgrind
lib/strcspn.c
lib/streq.h
lib/strerror-override.c
lib/strerror-override.h
lib/strerror.c
lib/striconv.c
lib/striconv.h
lib/striconveh.c
lib/striconveh.h
lib/striconveha.c
lib/striconveha.h
lib/string.in.h
lib/strnlen.c
lib/strnlen1.c
lib/strnlen1.h
lib/strpbrk.c
lib/strstr.c
lib/strtol.c
lib/strtoul.c
lib/styled-ostream.oo.c
lib/styled-ostream.oo.h
lib/sys_select.in.h
lib/sys_stat.in.h
lib/sys_time.in.h
lib/sys_types.in.h
lib/sys_wait.in.h
lib/tempname.c
lib/tempname.h
lib/term-ostream.oo.c
lib/term-ostream.oo.h
lib/term-styled-ostream.oo.c
lib/term-styled-ostream.oo.h
lib/terminfo.h
lib/time.in.h
lib/tmpdir.c
lib/tmpdir.h
lib/tparm.c
lib/tputs.c
lib/trim.c
lib/trim.h
lib/uniconv.in.h
lib/uniconv/u8-conv-from-enc.c
lib/unictype.in.h
lib/unictype/bitmap.h
lib/unictype/ctype_space.c
lib/unictype/ctype_space.h
lib/unilbrk.in.h
lib/unilbrk/lbrkprop1.h
lib/unilbrk/lbrkprop2.h
lib/unilbrk/lbrktables.c
lib/unilbrk/lbrktables.h
lib/unilbrk/u8-possible-linebreaks.c
lib/unilbrk/u8-width-linebreaks.c
lib/unilbrk/ulc-common.c
lib/unilbrk/ulc-common.h
lib/unilbrk/ulc-width-linebreaks.c
lib/uniname.in.h
lib/uniname/gen-uninames.lisp
lib/uniname/uniname.c
lib/uniname/uninames.h
lib/unistd--.h
lib/unistd-safer.h
lib/unistd.c
lib/unistd.in.h
lib/unistr.in.h
lib/unistr/u16-mbtouc-aux.c
lib/unistr/u16-mbtouc.c
lib/unistr/u8-check.c
lib/unistr/u8-mblen.c
lib/unistr/u8-mbtouc-aux.c
lib/unistr/u8-mbtouc-unsafe-aux.c
lib/unistr/u8-mbtouc-unsafe.c
lib/unistr/u8-mbtouc.c
lib/unistr/u8-mbtoucr.c
lib/unistr/u8-prev.c
lib/unistr/u8-uctomb-aux.c
lib/unistr/u8-uctomb.c
lib/unitypes.in.h
lib/uniwidth.in.h
lib/uniwidth/cjk.h
lib/uniwidth/width.c
lib/unlocked-io.h
lib/unsetenv.c
lib/vasnprintf.c
lib/vasnprintf.h
lib/vasprintf.c
lib/verify.h
lib/vsnprintf.c
lib/w32spawn.h
lib/wait-process.c
lib/wait-process.h
lib/waitpid.c
lib/wchar.in.h
lib/wctype-h.c
lib/wctype.in.h
lib/wcwidth.c
lib/write.c
lib/xalloc.h
lib/xasprintf.c
lib/xconcat-filename.c
lib/xerror.c
lib/xerror.h
lib/xmalloc.c
lib/xmalloca.c
lib/xmalloca.h
lib/xmemdup0.c
lib/xmemdup0.h
lib/xreadlink.c
lib/xreadlink.h
lib/xsetenv.c
lib/xsetenv.h
lib/xsize.c
lib/xsize.h
lib/xstrdup.c
lib/xstriconv.c
lib/xstriconv.h
lib/xstriconveh.c
lib/xstriconveh.h
lib/xvasprintf.c
lib/xvasprintf.h
m4/00gnulib.m4
m4/absolute-header.m4
m4/acl.m4
m4/alloca.m4
m4/ansi-c++.m4
m4/asm-underscore.m4
m4/atexit.m4
m4/backupfile.m4
m4/bison-i18n.m4
m4/btowc.m4
m4/byteswap.m4
m4/canonicalize.m4
m4/check-math-lib.m4
m4/close.m4
m4/closedir.m4
m4/codeset.m4
m4/configmake.m4
m4/copy-file.m4
m4/csharp.m4
m4/csharpcomp.m4
m4/csharpexec.m4
m4/ctype.m4
m4/curses.m4
m4/dirent_h.m4
m4/dirfd.m4
m4/double-slash-root.m4
m4/dup.m4
m4/dup2.m4
m4/eaccess.m4
m4/eealloc.m4
m4/environ.m4
m4/errno_h.m4
m4/error.m4
m4/execute.m4
m4/exponentd.m4
m4/exponentf.m4
m4/exponentl.m4
m4/extensions.m4
m4/extern-inline.m4
m4/fabs.m4
m4/fatal-signal.m4
m4/fcntl-o.m4
m4/fcntl.m4
m4/fcntl_h.m4
m4/fdopen.m4
m4/findprog.m4
m4/float_h.m4
m4/fnmatch.m4
m4/fopen.m4
m4/fpieee.m4
m4/fseeko.m4
m4/fstat.m4
m4/ftell.m4
m4/ftello.m4
m4/gcj.m4
m4/getcwd.m4
m4/getdelim.m4
m4/getdtablesize.m4
m4/getline.m4
m4/getopt.m4
m4/getpagesize.m4
m4/gettext.m4
m4/gettimeofday.m4
m4/glibc2.m4
m4/glibc21.m4
m4/gnulib-common.m4
m4/hard-locale.m4
m4/iconv.m4
m4/iconv_h.m4
m4/iconv_open.m4
m4/include_next.m4
m4/inline.m4
m4/intdiv0.m4
m4/intl.m4
m4/intldir.m4
m4/intlmacosx.m4
m4/intmax.m4
m4/intmax_t.m4
m4/inttypes-pri.m4
m4/inttypes.m4
m4/inttypes_h.m4
m4/isinf.m4
m4/isnan.m4
m4/isnand.m4
m4/isnanf.m4
m4/isnanl.m4
m4/iswblank.m4
m4/java.m4
m4/javacomp.m4
m4/javaexec.m4
m4/langinfo_h.m4
m4/largefile.m4
m4/lcmessage.m4
m4/lib-ld.m4
m4/lib-link.m4
m4/lib-prefix.m4
m4/libcroco.m4
m4/libglib.m4
m4/libunistring-base.m4
m4/libunistring-optional.m4
m4/libunistring.m4
m4/libxml.m4
m4/localcharset.m4
m4/locale-fr.m4
m4/locale-ja.m4
m4/locale-tr.m4
m4/locale-zh.m4
m4/locale_h.m4
m4/localename.m4
m4/lock.m4
m4/log10.m4
m4/longlong.m4
m4/lseek.m4
m4/lstat.m4
m4/malloc.m4
m4/malloca.m4
m4/math_h.m4
m4/mathfunc.m4
m4/mbchar.m4
m4/mbiter.m4
m4/mbrtowc.m4
m4/mbsinit.m4
m4/mbslen.m4
m4/mbsrtowcs.m4
m4/mbstate_t.m4
m4/mbswidth.m4
m4/mbtowc.m4
m4/memchr.m4
m4/memmove.m4
m4/memset.m4
m4/minmax.m4
m4/mkdtemp.m4
m4/mmap-anon.m4
m4/mode_t.m4
m4/moo.m4
m4/msvc-inval.m4
m4/msvc-nothrow.m4
m4/multiarch.m4
m4/nls.m4
m4/no-c++.m4
m4/nocrash.m4
m4/obstack.m4
m4/off_t.m4
m4/open.m4
m4/opendir.m4
m4/openmp.m4
m4/pathmax.m4
m4/pipe2.m4
m4/po.m4
m4/posix_spawn.m4
m4/pow.m4
m4/printf-posix.m4
m4/printf.m4
m4/progtest.m4
m4/putenv.m4
m4/quote.m4
m4/quotearg.m4
m4/raise.m4
m4/rawmemchr.m4
m4/read-file.m4
m4/read.m4
m4/readdir.m4
m4/readlink.m4
m4/realloc.m4
m4/relocatable-lib.m4
m4/relocatable.m4
m4/rmdir.m4
m4/safe-read.m4
m4/safe-write.m4
m4/sched_h.m4
m4/secure_getenv.m4
m4/setenv.m4
m4/setlocale.m4
m4/sig_atomic_t.m4
m4/sigaction.m4
m4/signal_h.m4
m4/signalblocking.m4
m4/signbit.m4
m4/sigpipe.m4
m4/size_max.m4
m4/sleep.m4
m4/snprintf.m4
m4/spawn-pipe.m4
m4/spawn_h.m4
m4/ssize_t.m4
m4/stat.m4
m4/stdalign.m4
m4/stdarg.m4
m4/stdbool.m4
m4/stddef_h.m4
m4/stdint.m4
m4/stdint_h.m4
m4/stdio_h.m4
m4/stdlib_h.m4
m4/stpcpy.m4
m4/stpncpy.m4
m4/strchrnul.m4
m4/strcspn.m4
m4/strerror.m4
m4/string_h.m4
m4/strnlen.m4
m4/strpbrk.m4
m4/strstr.m4
m4/strtol.m4
m4/strtoul.m4
m4/symlink.m4
m4/sys_select_h.m4
m4/sys_socket_h.m4
m4/sys_stat_h.m4
m4/sys_time_h.m4
m4/sys_types_h.m4
m4/sys_wait_h.m4
m4/tempname.m4
m4/term-ostream.m4
m4/terminfo.m4
m4/thread.m4
m4/threadlib.m4
m4/time_h.m4
m4/tls.m4
m4/tmpdir.m4
m4/uintmax_t.m4
m4/ungetc.m4
m4/unionwait.m4
m4/unistd-safer.m4
m4/unistd_h.m4
m4/unlocked-io.m4
m4/vasnprintf.m4
m4/vasprintf.m4
m4/visibility.m4
m4/vsnprintf.m4
m4/wait-process.m4
m4/waitpid.m4
m4/warn-on-use.m4
m4/wchar_h.m4
m4/wchar_t.m4
m4/wcrtomb.m4
m4/wctob.m4
m4/wctomb.m4
m4/wctype_h.m4
m4/wcwidth.m4
m4/wint_t.m4
m4/write.m4
m4/xsize.m4
m4/xvasprintf.m4
m4/yield.m4
tests/infinity.h
tests/init.sh
tests/macros.h
tests/minus-zero.h
tests/nan.h
tests/randomd.c
tests/signature.h
tests/test-alignof.c
tests/test-alloca-opt.c
tests/test-areadlink.c
tests/test-areadlink.h
tests/test-argmatch.c
tests/test-array_list.c
tests/test-atexit.c
tests/test-atexit.sh
tests/test-binary-io.c
tests/test-binary-io.sh
tests/test-btowc.c
tests/test-btowc1.sh
tests/test-btowc2.sh
tests/test-byteswap.c
tests/test-c-ctype.c
tests/test-c-strcase.sh
tests/test-c-strcasecmp.c
tests/test-c-strcasestr.c
tests/test-c-strncasecmp.c
tests/test-c-strstr.c
tests/test-canonicalize-lgpl.c
tests/test-cloexec.c
tests/test-close.c
tests/test-copy-acl-1.sh
tests/test-copy-acl-2.sh
tests/test-copy-acl.c
tests/test-copy-acl.sh
tests/test-copy-file-1.sh
tests/test-copy-file-2.sh
tests/test-copy-file.c
tests/test-copy-file.sh
tests/test-ctype.c
tests/test-dirent.c
tests/test-dup-safer.c
tests/test-dup.c
tests/test-dup2.c
tests/test-environ.c
tests/test-errno.c
tests/test-fabs.c
tests/test-fabs.h
tests/test-fcntl-h.c
tests/test-fcntl.c
tests/test-fdopen.c
tests/test-fgetc.c
tests/test-file-has-acl-1.sh
tests/test-file-has-acl-2.sh
tests/test-file-has-acl.c
tests/test-file-has-acl.sh
tests/test-float.c
tests/test-fnmatch.c
tests/test-fopen.c
tests/test-fopen.h
tests/test-fputc.c
tests/test-fread.c
tests/test-fstat.c
tests/test-fstrcmp.c
tests/test-ftell.c
tests/test-ftell.sh
tests/test-ftell2.sh
tests/test-ftell3.c
tests/test-ftello.c
tests/test-ftello.sh
tests/test-ftello2.sh
tests/test-ftello3.c
tests/test-ftello4.c
tests/test-ftello4.sh
tests/test-fwrite.c
tests/test-getcwd-lgpl.c
tests/test-getdelim.c
tests/test-getdtablesize.c
tests/test-getline.c
tests/test-getopt.c
tests/test-getopt.h
tests/test-getopt_long.h
tests/test-gettimeofday.c
tests/test-iconv-h.c
tests/test-iconv.c
tests/test-ignore-value.c
tests/test-init.sh
tests/test-intprops.c
tests/test-inttypes.c
tests/test-isinf.c
tests/test-isnan.c
tests/test-isnand-nolibm.c
tests/test-isnand.c
tests/test-isnand.h
tests/test-isnanf-nolibm.c
tests/test-isnanf.c
tests/test-isnanf.h
tests/test-isnanl-nolibm.c
tests/test-isnanl.c
tests/test-isnanl.h
tests/test-iswblank.c
tests/test-langinfo.c
tests/test-linkedhash_list.c
tests/test-locale.c
tests/test-localename.c
tests/test-lock.c
tests/test-log10.c
tests/test-log10.h
tests/test-lseek.c
tests/test-lseek.sh
tests/test-lstat.c
tests/test-lstat.h
tests/test-malloca.c
tests/test-math.c
tests/test-mbrtowc-w32-1.sh
tests/test-mbrtowc-w32-2.sh
tests/test-mbrtowc-w32-3.sh
tests/test-mbrtowc-w32-4.sh
tests/test-mbrtowc-w32-5.sh
tests/test-mbrtowc-w32.c
tests/test-mbrtowc.c
tests/test-mbrtowc1.sh
tests/test-mbrtowc2.sh
tests/test-mbrtowc3.sh
tests/test-mbrtowc4.sh
tests/test-mbrtowc5.sh
tests/test-mbsinit.c
tests/test-mbsinit.sh
tests/test-mbsrtowcs.c
tests/test-mbsrtowcs1.sh
tests/test-mbsrtowcs2.sh
tests/test-mbsrtowcs3.sh
tests/test-mbsrtowcs4.sh
tests/test-mbsstr1.c
tests/test-mbsstr2.c
tests/test-mbsstr2.sh
tests/test-mbsstr3.c
tests/test-mbsstr3.sh
tests/test-memchr.c
tests/test-moo-aroot.oo.c
tests/test-moo-aroot.oo.h
tests/test-moo-assign.c
tests/test-moo-asub1.oo.c
tests/test-moo-asub1.oo.h
tests/test-moo-root.oo.c
tests/test-moo-root.oo.h
tests/test-moo-sub1.oo.c
tests/test-moo-sub1.oo.h
tests/test-moo-sub2.oo.c
tests/test-moo-sub2.oo.h
tests/test-open.c
tests/test-open.h
tests/test-pathmax.c
tests/test-pipe-filter-ii1.c
tests/test-pipe-filter-ii1.sh
tests/test-pipe-filter-ii2-child.c
tests/test-pipe-filter-ii2-main.c
tests/test-pipe-filter-ii2.sh
tests/test-pipe2.c
tests/test-posix_spawn1.c
tests/test-posix_spawn1.in.sh
tests/test-posix_spawn2.c
tests/test-posix_spawn2.in.sh
tests/test-posix_spawn_file_actions_addclose.c
tests/test-posix_spawn_file_actions_adddup2.c
tests/test-posix_spawn_file_actions_addopen.c
tests/test-pow.c
tests/test-quotearg-simple.c
tests/test-quotearg.h
tests/test-raise.c
tests/test-rawmemchr.c
tests/test-read-file.c
tests/test-read.c
tests/test-readlink.c
tests/test-readlink.h
tests/test-rmdir.c
tests/test-rmdir.h
tests/test-sameacls.c
tests/test-sched.c
tests/test-set-mode-acl-1.sh
tests/test-set-mode-acl-2.sh
tests/test-set-mode-acl.c
tests/test-set-mode-acl.sh
tests/test-setenv.c
tests/test-setlocale1.c
tests/test-setlocale1.sh
tests/test-setlocale2.c
tests/test-setlocale2.sh
tests/test-sh-quote.c
tests/test-sigaction.c
tests/test-signal-h.c
tests/test-signbit.c
tests/test-sigpipe.c
tests/test-sigpipe.sh
tests/test-sigprocmask.c
tests/test-sleep.c
tests/test-snprintf.c
tests/test-spawn-pipe-child.c
tests/test-spawn-pipe-main.c
tests/test-spawn-pipe.sh
tests/test-spawn.c
tests/test-stat.c
tests/test-stat.h
tests/test-stdalign.c
tests/test-stdbool.c
tests/test-stddef.c
tests/test-stdint.c
tests/test-stdio.c
tests/test-stdlib.c
tests/test-strchrnul.c
tests/test-strerror.c
tests/test-striconv.c
tests/test-striconveh.c
tests/test-striconveha.c
tests/test-string.c
tests/test-strnlen.c
tests/test-strstr.c
tests/test-strtol.c
tests/test-strtoul.c
tests/test-symlink.c
tests/test-symlink.h
tests/test-sys_select.c
tests/test-sys_stat.c
tests/test-sys_time.c
tests/test-sys_types.c
tests/test-sys_wait.c
tests/test-sys_wait.h
tests/test-term-ostream-xterm
tests/test-term-ostream-xterm-16color.out
tests/test-term-ostream-xterm-256color.out
tests/test-term-ostream-xterm-88color.out
tests/test-term-ostream-xterm-8bit.out
tests/test-term-ostream-xterm-aix51.out
tests/test-term-ostream-xterm-basic-italic.out
tests/test-term-ostream-xterm-basic.out
tests/test-term-ostream-xterm-freebsd101.out
tests/test-term-ostream-xterm-irix65.out
tests/test-term-ostream-xterm-linux-debian.out
tests/test-term-ostream-xterm-linux-mandriva.out
tests/test-term-ostream-xterm-mingw.out
tests/test-term-ostream-xterm-netbsd3.out
tests/test-term-ostream-xterm-osf51.out
tests/test-term-ostream-xterm-r6.out
tests/test-term-ostream-xterm-solaris10.out
tests/test-term-ostream-xterm-xf86-v32.out
tests/test-term-ostream.c
tests/test-thread_create.c
tests/test-thread_self.c
tests/test-time.c
tests/test-tls.c
tests/test-unistd.c
tests/test-unsetenv.c
tests/test-vasnprintf-posix.c
tests/test-vasnprintf.c
tests/test-vasprintf.c
tests/test-verify.c
tests/test-verify.sh
tests/test-vsnprintf.c
tests/test-wchar.c
tests/test-wcrtomb-w32-1.sh
tests/test-wcrtomb-w32-2.sh
tests/test-wcrtomb-w32-3.sh
tests/test-wcrtomb-w32-4.sh
tests/test-wcrtomb-w32-5.sh
tests/test-wcrtomb-w32.c
tests/test-wcrtomb.c
tests/test-wcrtomb.sh
tests/test-wctype-h.c
tests/test-wcwidth.c
tests/test-write.c
tests/test-xalloc-die.c
tests/test-xalloc-die.sh
tests/test-xmemdup0.c
tests/test-xvasprintf.c
tests/uniconv/test-u8-conv-from-enc.c
tests/unictype/test-ctype_space.c
tests/unictype/test-predicate-part1.h
tests/unictype/test-predicate-part2.h
tests/unilbrk/test-u8-width-linebreaks.c
tests/uniname/HangulSyllableNames.txt
tests/uniname/NameAliases.txt
tests/uniname/UnicodeData.txt
tests/uniname/test-uninames.c
tests/uniname/test-uninames.sh
tests/unistr/test-cmp.h
tests/unistr/test-u16-mbtouc.c
tests/unistr/test-u16-mbtouc.h
tests/unistr/test-u8-check.c
tests/unistr/test-u8-cmp.c
tests/unistr/test-u8-mblen.c
tests/unistr/test-u8-mbtoucr.c
tests/unistr/test-u8-prev.c
tests/unistr/test-u8-strlen.c
tests/unistr/test-u8-uctomb.c
tests/zerosize-ptr.h
tests=lib/btowc.c
tests=lib/ctype.in.h
tests=lib/dup.c
tests=lib/fdopen.c
tests=lib/file-has-acl.c
tests=lib/fpucw.h
tests=lib/ftell.c
tests=lib/ftello.c
tests=lib/getcwd-lgpl.c
tests=lib/getpagesize.c
tests=lib/glthread/thread.c
tests=lib/glthread/thread.h
tests=lib/glthread/yield.h
tests=lib/inttypes.in.h
tests=lib/lseek.c
tests=lib/mbtowc-impl.h
tests=lib/mbtowc.c
tests=lib/putenv.c
tests=lib/read-file.c
tests=lib/read-file.h
tests=lib/same-inode.h
tests=lib/sleep.c
tests=lib/stdalign.in.h
tests=lib/stdio-impl.h
tests=lib/symlink.c
tests=lib/unistr/u8-cmp.c
tests=lib/unistr/u8-strlen.c
tests=lib/wcrtomb.c
tests=lib/wctob.c
tests=lib/wctomb-impl.h
tests=lib/wctomb.c
])
```
|
```kotlin
package net.corda.serialization.internal.amqp
import net.corda.serialization.internal.AllWhitelist
import net.corda.serialization.internal.amqp.custom.OptionalSerializer
import net.corda.serialization.internal.amqp.testutils.TestSerializationOutput
import net.corda.serialization.internal.amqp.testutils.deserialize
import net.corda.serialization.internal.amqp.testutils.testDefaultFactory
import net.corda.serialization.internal.carpenter.ClassCarpenterImpl
import org.hamcrest.Matchers.equalTo
import org.hamcrest.Matchers.`is`
import org.junit.Test
import java.util.Optional
import org.hamcrest.MatcherAssert.assertThat
class OptionalSerializationTests {
@Test(timeout = 300_000)
fun `java optionals should serialize`() {
val factory = SerializerFactoryBuilder.build(AllWhitelist,
ClassCarpenterImpl(AllWhitelist, ClassLoader.getSystemClassLoader())
)
factory.register(OptionalSerializer(factory))
val obj = Optional.ofNullable("YES")
val bytes = TestSerializationOutput(true, factory).serialize(obj)
val deserializerFactory = testDefaultFactory().apply {
register(OptionalSerializer(this))
}
val deserialized = DeserializationInput(factory).deserialize(bytes)
val deserialized2 = DeserializationInput(deserializerFactory).deserialize(bytes)
assertThat(deserialized, `is`(equalTo(deserialized2)))
assertThat(obj, `is`(equalTo(deserialized2)))
}
}
```
|
Aechmea prava is a plant species in the genus Aechmea. This species is endemic to the State of Rio de Janeiro in Brazil.
References
prava
Flora of Brazil
Plants described in 1972
|
Vincent Jewell (born June 9, 1994, in Datteln), professionally known as Fifty Vinc (sometimes stylized in all caps) is a German-American Music Producer and composer.
Early life
Vinc grew up bilingual in Lüdinghausen, Germany, as his father is a native of New Jersey, USA. His father was a DJ in various clubs in the United States in his youth, spinning Hip-Hop, Funk und RnB music.
Initially, Vinc attended elementary school, but after the second grade he was transfarred to a special school for children with behavioral problems. Later, he switched to a secondary school, then to a vocational college. In 2015, he successfully passed his High school diploma.
From 2017 to 2020, Vinc completed vocational training as a freight forwarding and logistics services clerk before starting his own business composing and producing music.
Music
Due to Vinc' former hobby of breakdancing, he originally started producing breakdance music as a hobby at a young age. Later, he mainly produced music in the genres of Hip-Hop and Rap. Because of his biggest role model, Hans Zimmer and his passion for epic, orchestral and trailer music, Vinc began combining classical and modern Hip-Hop musical elements early on. This style of music was strongly influenced by Vinc. Later, he discovered composing for TV, film and Video games.
In September 2016, the album Trittschall by female rapper and amateur actress Nina Menke (also known as Mrs. Nina Chartier) was released, on which Vinc produced the songs Flaschenpost (feat. Jacy) and Outro. The album was released by the label Keine Faxen, distributed by Sony Music.
At the event UFC 268 Vinc provided the walkout song for the participant Andreas Michailidis, as well as at the event UFC Fight Night: Jacaré vs. Hermansson for the participant Jason Gonzalez. The events were broadcast on the American TV channel ESPN.
Vinc was also involved in the official soundtrack of the Brazilian short film Djorge: Da Bonja pro Mundo in collaboration with DidekBeats.
In 2016, 2017, 2021, as well as 2022, Vinc contributed a composition to each of the official soundtracks of the international breakdance event Battle of the Year, which was released by the Dominance Records label. The event was filmed in 2013 and featured actor and singer Chris Brown among others.
In 2018, 2021 and 2023 the instrumental singles Golden Era, Verdansk and The Conquest were released by Vinc and platinum producer Sadikbeatz, who has composed and produced several songs for artists like Kollegah.
In October 2019, the official video mixtape King's Blood Volume 2 of basketball player LeBron James Jr. (also known as Bronny James), son of the professional NBA basketball player LeBron James, was released by Ballislife, which is underlined by the music of Vinc.
The album Messias II by German chart rapper Rapido was released in 2019, on which Vinc produced the songs Messias II and Vollautoamtisch II.
Rapper Chris Ares has also used Vinc' musical arts on several occasions. The album Ares, released on July 3, 2020, on which the songs Intro, BRDigung, Löwe and Machtwechsel were produced by Vinc, made it to peak 44 (1 week) in the official charts of Switzerland.
Vinc' composition Way of the Warrior, which counts multiple million views on YouTube alone, has been used for the single Killer's Blood by the artist Cryptik Soul and the rappers Swifty Mcvay and Kuniva. McVay and Kuniva are former members of the multi-award-winning hip-hop crew D12, which since 1999 was signed to the label Shady Records of the successful US rapper Eminem.
On June 3, 2020, Vinc released the album Hip Hop & Rap Beats 5, which consists of hip-hop and rap instrumentals, as well as orchestral music combined with modern beats. The album made it to the Greek iTunes Top 100 Hip-Hop/Rap Albums on peak 17 (for 1 week) in September 2020.
In 2022, he released the single Work It Out (feat. Didker & Agf.Israel), as well as We Gonna Make It (feat. Julian Rübner & Dogman Rukus), Look Out, Halloween Nightmare and Jazz Do It, which brought Vinc to the attention of several hip-hop magazines und blogs. Among others he was mentioned in LA Weekly and in The Source.
In the same year, the album Spiritual Warfare 2 was released by Spirit Of Truth on which Vinc produced the songs Lone Wolf (feat. Ill Bill & Celph Titled) and Firestorm (feat. K-da Venom, King Magnetic & Slaine).
Also in 2022, Vinc participated in the FMC – Film Music Contest, an international music competition in the category of Music for Film, TV, Advertising, Video Games, and successfully reached the finals, where six other participants competed alongside him.
Likewise, compositions by Vinc for TV, film and video games have been released for industry use and licensing by Epic Music LA, FBP Music Publishing, Amori Sounds / Marmoset Music and Hunchback Music.
Vinc is an official power user of the digital audio workstation (DAW) FL Studio, which was developed by the company Image-Line.
Most of his works are managed and published by music publishers Beastars Publishing Worldwide and Sony Music Publishing (formerly Sony/ATV).
Discography
Albums
Singles
External links
Official Website
FIFTY VINC Discography on Genius
FIFTY VINC on Spotify
FIFTY VINC on Apple Music
FIFTY VINC on YouTube
References
Living people
German record producers
People from Lüdinghausen
1994 births
|
```xml
import * as React from 'react';
import { Button, Flex } from '@fluentui/react-northstar';
import { MicIcon, TranslationIcon, CallVideoIcon } from '@fluentui/react-icons-northstar';
const ButtonExampleDisabled = () => (
<Flex column gap="gap.smaller">
<Flex gap="gap.smaller">
<Button disabled>Default</Button>
<Button disabled primary>
<Button.Content>Primary</Button.Content>
</Button>
<Button disabled inverted>
<Button.Content content="Inverted Button" />
</Button>
<Button disabled icon iconPosition="before" primary>
<MicIcon xSpacing="after" />
<Button.Content content="Click me" />
</Button>
<Button disabled circular title="Translation">
<TranslationIcon xSpacing="none" />
</Button>
<Button disabled text>
<CallVideoIcon xSpacing="before" />
<Button.Content content="Disabled text button" />
</Button>
</Flex>
<Button disabled fluid>
<Button.Content>Fluid</Button.Content>
</Button>
</Flex>
);
export default ButtonExampleDisabled;
```
|
```c++
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
* vim: set ts=8 sts=4 et sw=4 tw=99:
* This Source Code Form is subject to the terms of the Mozilla Public
* file, You can obtain one at path_to_url */
#include "jit/Recover.h"
#include "jsapi.h"
#include "jscntxt.h"
#include "jsmath.h"
#include "jsobj.h"
#include "jsstr.h"
#include "builtin/RegExp.h"
#include "builtin/TypedObject.h"
#include "gc/Heap.h"
#include "jit/JitFrameIterator.h"
#include "jit/JitSpewer.h"
#include "jit/MIR.h"
#include "jit/MIRGraph.h"
#include "jit/VMFunctions.h"
#include "vm/Interpreter.h"
#include "vm/Interpreter-inl.h"
#include "vm/NativeObject-inl.h"
using namespace js;
using namespace js::jit;
bool
MNode::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_CRASH("This instruction is not serializable");
}
void
RInstruction::readRecoverData(CompactBufferReader& reader, RInstructionStorage* raw)
{
uint32_t op = reader.readUnsigned();
switch (Opcode(op)) {
# define MATCH_OPCODES_(op) \
case Recover_##op: \
static_assert(sizeof(R##op) <= sizeof(RInstructionStorage), \
"Storage space is too small to decode R" #op " instructions."); \
new (raw->addr()) R##op(reader); \
break;
RECOVER_OPCODE_LIST(MATCH_OPCODES_)
# undef MATCH_OPCODES_
case Recover_Invalid:
default:
MOZ_CRASH("Bad decoding of the previous instruction?");
}
}
bool
MResumePoint::writeRecoverData(CompactBufferWriter& writer) const
{
writer.writeUnsigned(uint32_t(RInstruction::Recover_ResumePoint));
MBasicBlock* bb = block();
JSFunction* fun = bb->info().funMaybeLazy();
JSScript* script = bb->info().script();
uint32_t exprStack = stackDepth() - bb->info().ninvoke();
#ifdef DEBUG
// Ensure that all snapshot which are encoded can safely be used for
// bailouts.
if (GetJitContext()->cx) {
uint32_t stackDepth;
bool reachablePC;
jsbytecode* bailPC = pc();
if (mode() == MResumePoint::ResumeAfter)
bailPC = GetNextPc(pc());
if (!ReconstructStackDepth(GetJitContext()->cx, script,
bailPC, &stackDepth, &reachablePC))
{
return false;
}
if (reachablePC) {
if (JSOp(*bailPC) == JSOP_FUNCALL) {
// For fun.call(this, ...); the reconstructStackDepth will
// include the this. When inlining that is not included. So the
// exprStackSlots will be one less.
MOZ_ASSERT(stackDepth - exprStack <= 1);
} else if (JSOp(*bailPC) != JSOP_FUNAPPLY &&
!IsGetPropPC(bailPC) && !IsSetPropPC(bailPC))
{
// For fun.apply({}, arguments) the reconstructStackDepth will
// have stackdepth 4, but it could be that we inlined the
// funapply. In that case exprStackSlots, will have the real
// arguments in the slots and not be 4.
// With accessors, we have different stack depths depending on
// whether or not we inlined the accessor, as the inlined stack
// contains a callee function that should never have been there
// and we might just be capturing an uneventful property site,
// in which case there won't have been any violence.
MOZ_ASSERT(exprStack == stackDepth);
}
}
}
#endif
// Test if we honor the maximum of arguments at all times. This is a sanity
// check and not an algorithm limit. So check might be a bit too loose. +4
// to account for scope chain, return value, this value and maybe
// arguments_object.
MOZ_ASSERT(CountArgSlots(script, fun) < SNAPSHOT_MAX_NARGS + 4);
uint32_t implicit = StartArgSlot(script);
uint32_t formalArgs = CountArgSlots(script, fun);
uint32_t nallocs = formalArgs + script->nfixed() + exprStack;
JitSpew(JitSpew_IonSnapshots, "Starting frame; implicit %u, formals %u, fixed %u, exprs %u",
implicit, formalArgs - implicit, script->nfixed(), exprStack);
uint32_t pcoff = script->pcToOffset(pc());
JitSpew(JitSpew_IonSnapshots, "Writing pc offset %u, nslots %u", pcoff, nallocs);
writer.writeUnsigned(pcoff);
writer.writeUnsigned(nallocs);
return true;
}
RResumePoint::RResumePoint(CompactBufferReader& reader)
{
pcOffset_ = reader.readUnsigned();
numOperands_ = reader.readUnsigned();
JitSpew(JitSpew_IonSnapshots, "Read RResumePoint (pc offset %u, nslots %u)",
pcOffset_, numOperands_);
}
bool
RResumePoint::recover(JSContext* cx, SnapshotIterator& iter) const
{
MOZ_CRASH("This instruction is not recoverable.");
}
bool
MBitNot::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_BitNot));
return true;
}
RBitNot::RBitNot(CompactBufferReader& reader)
{ }
bool
RBitNot::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue operand(cx, iter.read());
int32_t result;
if (!js::BitNot(cx, operand, &result))
return false;
RootedValue rootedResult(cx, js::Int32Value(result));
iter.storeInstructionResult(rootedResult);
return true;
}
bool
MBitAnd::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_BitAnd));
return true;
}
RBitAnd::RBitAnd(CompactBufferReader& reader)
{ }
bool
RBitAnd::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
int32_t result;
MOZ_ASSERT(!lhs.isObject() && !rhs.isObject());
if (!js::BitAnd(cx, lhs, rhs, &result))
return false;
RootedValue rootedResult(cx, js::Int32Value(result));
iter.storeInstructionResult(rootedResult);
return true;
}
bool
MBitOr::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_BitOr));
return true;
}
RBitOr::RBitOr(CompactBufferReader& reader)
{}
bool
RBitOr::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
int32_t result;
MOZ_ASSERT(!lhs.isObject() && !rhs.isObject());
if (!js::BitOr(cx, lhs, rhs, &result))
return false;
RootedValue asValue(cx, js::Int32Value(result));
iter.storeInstructionResult(asValue);
return true;
}
bool
MBitXor::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_BitXor));
return true;
}
RBitXor::RBitXor(CompactBufferReader& reader)
{ }
bool
RBitXor::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
int32_t result;
if (!js::BitXor(cx, lhs, rhs, &result))
return false;
RootedValue rootedResult(cx, js::Int32Value(result));
iter.storeInstructionResult(rootedResult);
return true;
}
bool
MLsh::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Lsh));
return true;
}
RLsh::RLsh(CompactBufferReader& reader)
{}
bool
RLsh::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
int32_t result;
MOZ_ASSERT(!lhs.isObject() && !rhs.isObject());
if (!js::BitLsh(cx, lhs, rhs, &result))
return false;
RootedValue asValue(cx, js::Int32Value(result));
iter.storeInstructionResult(asValue);
return true;
}
bool
MRsh::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Rsh));
return true;
}
RRsh::RRsh(CompactBufferReader& reader)
{ }
bool
RRsh::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
MOZ_ASSERT(!lhs.isObject() && !rhs.isObject());
int32_t result;
if (!js::BitRsh(cx, lhs, rhs, &result))
return false;
RootedValue rootedResult(cx, js::Int32Value(result));
iter.storeInstructionResult(rootedResult);
return true;
}
bool
MUrsh::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Ursh));
return true;
}
RUrsh::RUrsh(CompactBufferReader& reader)
{ }
bool
RUrsh::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
MOZ_ASSERT(!lhs.isObject() && !rhs.isObject());
RootedValue result(cx);
if (!js::UrshOperation(cx, lhs, rhs, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MAdd::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Add));
writer.writeByte(specialization_ == MIRType_Float32);
return true;
}
RAdd::RAdd(CompactBufferReader& reader)
{
isFloatOperation_ = reader.readByte();
}
bool
RAdd::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(!lhs.isObject() && !rhs.isObject());
if (!js::AddValues(cx, &lhs, &rhs, &result))
return false;
// MIRType_Float32 is a specialization embedding the fact that the result is
// rounded to a Float32.
if (isFloatOperation_ && !RoundFloat32(cx, result, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MSub::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Sub));
writer.writeByte(specialization_ == MIRType_Float32);
return true;
}
RSub::RSub(CompactBufferReader& reader)
{
isFloatOperation_ = reader.readByte();
}
bool
RSub::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(!lhs.isObject() && !rhs.isObject());
if (!js::SubValues(cx, &lhs, &rhs, &result))
return false;
// MIRType_Float32 is a specialization embedding the fact that the result is
// rounded to a Float32.
if (isFloatOperation_ && !RoundFloat32(cx, result, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MMul::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Mul));
writer.writeByte(specialization_ == MIRType_Float32);
return true;
}
RMul::RMul(CompactBufferReader& reader)
{
isFloatOperation_ = reader.readByte();
}
bool
RMul::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
RootedValue result(cx);
if (!js::MulValues(cx, &lhs, &rhs, &result))
return false;
// MIRType_Float32 is a specialization embedding the fact that the result is
// rounded to a Float32.
if (isFloatOperation_ && !RoundFloat32(cx, result, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MDiv::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Div));
writer.writeByte(specialization_ == MIRType_Float32);
return true;
}
RDiv::RDiv(CompactBufferReader& reader)
{
isFloatOperation_ = reader.readByte();
}
bool
RDiv::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
RootedValue result(cx);
if (!js::DivValues(cx, &lhs, &rhs, &result))
return false;
// MIRType_Float32 is a specialization embedding the fact that the result is
// rounded to a Float32.
if (isFloatOperation_ && !RoundFloat32(cx, result, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MMod::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Mod));
return true;
}
RMod::RMod(CompactBufferReader& reader)
{ }
bool
RMod::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(!lhs.isObject() && !rhs.isObject());
if (!js::ModValues(cx, &lhs, &rhs, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MNot::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Not));
return true;
}
RNot::RNot(CompactBufferReader& reader)
{ }
bool
RNot::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue v(cx, iter.read());
RootedValue result(cx);
result.setBoolean(!ToBoolean(v));
iter.storeInstructionResult(result);
return true;
}
bool
MConcat::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Concat));
return true;
}
RConcat::RConcat(CompactBufferReader& reader)
{}
bool
RConcat::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue lhs(cx, iter.read());
RootedValue rhs(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(!lhs.isObject() && !rhs.isObject());
if (!js::AddValues(cx, &lhs, &rhs, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
RStringLength::RStringLength(CompactBufferReader& reader)
{}
bool
RStringLength::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue operand(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(!operand.isObject());
if (!js::GetLengthProperty(operand, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MStringLength::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_StringLength));
return true;
}
bool
MArgumentsLength::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_ArgumentsLength));
return true;
}
RArgumentsLength::RArgumentsLength(CompactBufferReader& reader)
{ }
bool
RArgumentsLength::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue result(cx);
result.setInt32(iter.readOuterNumActualArgs());
iter.storeInstructionResult(result);
return true;
}
bool
MFloor::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Floor));
return true;
}
RFloor::RFloor(CompactBufferReader& reader)
{ }
bool RFloor::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue v(cx, iter.read());
RootedValue result(cx);
if (!js::math_floor_handle(cx, v, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MCeil::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Ceil));
return true;
}
RCeil::RCeil(CompactBufferReader& reader)
{ }
bool
RCeil::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue v(cx, iter.read());
RootedValue result(cx);
if (!js::math_ceil_handle(cx, v, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MRound::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Round));
return true;
}
RRound::RRound(CompactBufferReader& reader)
{}
bool
RRound::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue arg(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(!arg.isObject());
if(!js::math_round_handle(cx, arg, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MCharCodeAt::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_CharCodeAt));
return true;
}
RCharCodeAt::RCharCodeAt(CompactBufferReader& reader)
{}
bool
RCharCodeAt::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedString lhs(cx, iter.read().toString());
RootedValue rhs(cx, iter.read());
RootedValue result(cx);
if (!js::str_charCodeAt_impl(cx, lhs, rhs, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MFromCharCode::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_FromCharCode));
return true;
}
RFromCharCode::RFromCharCode(CompactBufferReader& reader)
{}
bool
RFromCharCode::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue operand(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(!operand.isObject());
if (!js::str_fromCharCode_one_arg(cx, operand, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MPow::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Pow));
return true;
}
RPow::RPow(CompactBufferReader& reader)
{ }
bool
RPow::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue base(cx, iter.read());
RootedValue power(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(base.isNumber() && power.isNumber());
if (!js::math_pow_handle(cx, base, power, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MPowHalf::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_PowHalf));
return true;
}
RPowHalf::RPowHalf(CompactBufferReader& reader)
{ }
bool
RPowHalf::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue base(cx, iter.read());
RootedValue power(cx);
RootedValue result(cx);
power.setNumber(0.5);
MOZ_ASSERT(base.isNumber());
if (!js::math_pow_handle(cx, base, power, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MMinMax::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_MinMax));
writer.writeByte(isMax_);
return true;
}
RMinMax::RMinMax(CompactBufferReader& reader)
{
isMax_ = reader.readByte();
}
bool
RMinMax::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue a(cx, iter.read());
RootedValue b(cx, iter.read());
RootedValue result(cx);
if (!js::minmax_impl(cx, isMax_, a, b, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MAbs::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Abs));
return true;
}
RAbs::RAbs(CompactBufferReader& reader)
{ }
bool
RAbs::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue v(cx, iter.read());
RootedValue result(cx);
if (!js::math_abs_handle(cx, v, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MSqrt::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Sqrt));
writer.writeByte(type() == MIRType_Float32);
return true;
}
RSqrt::RSqrt(CompactBufferReader& reader)
{
isFloatOperation_ = reader.readByte();
}
bool
RSqrt::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue num(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(num.isNumber());
if (!math_sqrt_handle(cx, num, &result))
return false;
// MIRType_Float32 is a specialization embedding the fact that the result is
// rounded to a Float32.
if (isFloatOperation_ && !RoundFloat32(cx, result, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MAtan2::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Atan2));
return true;
}
RAtan2::RAtan2(CompactBufferReader& reader)
{ }
bool
RAtan2::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue y(cx, iter.read());
RootedValue x(cx, iter.read());
RootedValue result(cx);
if(!math_atan2_handle(cx, y, x, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MHypot::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Hypot));
writer.writeUnsigned(uint32_t(numOperands()));
return true;
}
RHypot::RHypot(CompactBufferReader& reader)
: numOperands_(reader.readUnsigned())
{ }
bool
RHypot::recover(JSContext* cx, SnapshotIterator& iter) const
{
JS::AutoValueVector vec(cx);
if (!vec.reserve(numOperands_))
return false;
for (uint32_t i = 0 ; i < numOperands_ ; ++i)
vec.infallibleAppend(iter.read());
RootedValue result(cx);
if(!js::math_hypot_handle(cx, vec, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MMathFunction::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
switch (function_) {
case Round:
writer.writeUnsigned(uint32_t(RInstruction::Recover_Round));
return true;
case Sin:
case Log:
writer.writeUnsigned(uint32_t(RInstruction::Recover_MathFunction));
writer.writeByte(function_);
return true;
default:
MOZ_CRASH("Unknown math function.");
}
}
RMathFunction::RMathFunction(CompactBufferReader& reader)
{
function_ = reader.readByte();
}
bool
RMathFunction::recover(JSContext* cx, SnapshotIterator& iter) const
{
switch (function_) {
case MMathFunction::Sin: {
RootedValue arg(cx, iter.read());
RootedValue result(cx);
if (!js::math_sin_handle(cx, arg, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
case MMathFunction::Log: {
RootedValue arg(cx, iter.read());
RootedValue result(cx);
if (!js::math_log_handle(cx, arg, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
default:
MOZ_CRASH("Unknown math function.");
}
}
bool
MStringSplit::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_StringSplit));
return true;
}
RStringSplit::RStringSplit(CompactBufferReader& reader)
{}
bool
RStringSplit::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedString str(cx, iter.read().toString());
RootedString sep(cx, iter.read().toString());
RootedObjectGroup group(cx, iter.read().toObject().group());
RootedValue result(cx);
JSObject* res = str_split_string(cx, group, str, sep);
if (!res)
return false;
result.setObject(*res);
iter.storeInstructionResult(result);
return true;
}
bool MRegExpExec::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_RegExpExec));
return true;
}
RRegExpExec::RRegExpExec(CompactBufferReader& reader)
{}
bool RRegExpExec::recover(JSContext* cx, SnapshotIterator& iter) const{
RootedObject regexp(cx, &iter.read().toObject());
RootedString input(cx, iter.read().toString());
RootedValue result(cx);
if (!regexp_exec_raw(cx, regexp, input, nullptr, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MRegExpTest::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_RegExpTest));
return true;
}
RRegExpTest::RRegExpTest(CompactBufferReader& reader)
{ }
bool
RRegExpTest::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedString string(cx, iter.read().toString());
RootedObject regexp(cx, &iter.read().toObject());
bool resultBool;
if (!js::regexp_test_raw(cx, regexp, string, &resultBool))
return false;
RootedValue result(cx);
result.setBoolean(resultBool);
iter.storeInstructionResult(result);
return true;
}
bool
MRegExpReplace::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_RegExpReplace));
return true;
}
RRegExpReplace::RRegExpReplace(CompactBufferReader& reader)
{ }
bool
RRegExpReplace::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedString string(cx, iter.read().toString());
RootedObject regexp(cx, &iter.read().toObject());
RootedString repl(cx, iter.read().toString());
RootedValue result(cx);
if (!js::str_replace_regexp_raw(cx, string, regexp, repl, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MTypeOf::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_TypeOf));
return true;
}
RTypeOf::RTypeOf(CompactBufferReader& reader)
{ }
bool
RTypeOf::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue v(cx, iter.read());
RootedValue result(cx, StringValue(TypeOfOperation(v, cx->runtime())));
iter.storeInstructionResult(result);
return true;
}
bool
MToDouble::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_ToDouble));
return true;
}
RToDouble::RToDouble(CompactBufferReader& reader)
{ }
bool
RToDouble::recover(JSContext* cx, SnapshotIterator& iter) const
{
Value v = iter.read();
MOZ_ASSERT(!v.isObject());
iter.storeInstructionResult(v);
return true;
}
bool
MToFloat32::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_ToFloat32));
return true;
}
RToFloat32::RToFloat32(CompactBufferReader& reader)
{ }
bool
RToFloat32::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue v(cx, iter.read());
RootedValue result(cx);
MOZ_ASSERT(!v.isObject());
if (!RoundFloat32(cx, v, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
bool
MTruncateToInt32::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_TruncateToInt32));
return true;
}
RTruncateToInt32::RTruncateToInt32(CompactBufferReader& reader)
{ }
bool
RTruncateToInt32::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue value(cx, iter.read());
RootedValue result(cx);
int32_t trunc;
if (!JS::ToInt32(cx, value, &trunc))
return false;
result.setInt32(trunc);
iter.storeInstructionResult(result);
return true;
}
bool
MNewObject::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_NewObject));
MOZ_ASSERT(Mode(uint8_t(mode_)) == mode_);
writer.writeByte(uint8_t(mode_));
return true;
}
RNewObject::RNewObject(CompactBufferReader& reader)
{
mode_ = MNewObject::Mode(reader.readByte());
}
bool
RNewObject::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedPlainObject templateObject(cx, &iter.read().toObject().as<PlainObject>());
RootedValue result(cx);
JSObject* resultObject = nullptr;
// See CodeGenerator::visitNewObjectVMCall
if (mode_ == MNewObject::ObjectLiteral) {
resultObject = NewInitObject(cx, templateObject);
} else {
MOZ_ASSERT(mode_ == MNewObject::ObjectCreate);
resultObject = ObjectCreateWithTemplate(cx, templateObject);
}
if (!resultObject)
return false;
result.setObject(*resultObject);
iter.storeInstructionResult(result);
return true;
}
bool
MNewArray::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_NewArray));
writer.writeUnsigned(count());
writer.writeByte(uint8_t(allocatingBehaviour()));
return true;
}
RNewArray::RNewArray(CompactBufferReader& reader)
{
count_ = reader.readUnsigned();
allocatingBehaviour_ = AllocatingBehaviour(reader.readByte());
}
bool
RNewArray::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedObject templateObject(cx, &iter.read().toObject());
RootedValue result(cx);
RootedObjectGroup group(cx);
// See CodeGenerator::visitNewArrayCallVM
if (!templateObject->isSingleton())
group = templateObject->group();
JSObject* resultObject = NewDenseArray(cx, count_, group, allocatingBehaviour_);
if (!resultObject)
return false;
result.setObject(*resultObject);
iter.storeInstructionResult(result);
return true;
}
bool
MNewDerivedTypedObject::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_NewDerivedTypedObject));
return true;
}
RNewDerivedTypedObject::RNewDerivedTypedObject(CompactBufferReader& reader)
{ }
bool
RNewDerivedTypedObject::recover(JSContext* cx, SnapshotIterator& iter) const
{
Rooted<TypeDescr*> descr(cx, &iter.read().toObject().as<TypeDescr>());
Rooted<TypedObject*> owner(cx, &iter.read().toObject().as<TypedObject>());
int32_t offset = iter.read().toInt32();
JSObject* obj = OutlineTypedObject::createDerived(cx, descr, owner, offset);
if (!obj)
return false;
RootedValue result(cx, ObjectValue(*obj));
iter.storeInstructionResult(result);
return true;
}
bool
MCreateThisWithTemplate::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_CreateThisWithTemplate));
writer.writeByte(bool(initialHeap() == gc::TenuredHeap));
return true;
}
RCreateThisWithTemplate::RCreateThisWithTemplate(CompactBufferReader& reader)
{
tenuredHeap_ = reader.readByte();
}
bool
RCreateThisWithTemplate::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedPlainObject templateObject(cx, &iter.read().toObject().as<PlainObject>());
// See CodeGenerator::visitCreateThisWithTemplate
gc::AllocKind allocKind = templateObject->asTenured().getAllocKind();
gc::InitialHeap initialHeap = tenuredHeap_ ? gc::TenuredHeap : gc::DefaultHeap;
JSObject* resultObject = NativeObject::copy(cx, allocKind, initialHeap, templateObject);
if (!resultObject)
return false;
RootedValue result(cx);
result.setObject(*resultObject);
iter.storeInstructionResult(result);
return true;
}
bool
MLambda::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_Lambda));
return true;
}
RLambda::RLambda(CompactBufferReader& reader)
{
}
bool
RLambda::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedObject scopeChain(cx, &iter.read().toObject());
RootedFunction fun(cx, &iter.read().toObject().as<JSFunction>());
JSObject* resultObject = js::Lambda(cx, fun, scopeChain);
if (!resultObject)
return false;
RootedValue result(cx);
result.setObject(*resultObject);
iter.storeInstructionResult(result);
return true;
}
bool
MObjectState::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_ObjectState));
writer.writeUnsigned(numSlots());
return true;
}
RObjectState::RObjectState(CompactBufferReader& reader)
{
numSlots_ = reader.readUnsigned();
}
bool
RObjectState::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedNativeObject object(cx, &iter.read().toObject().as<NativeObject>());
MOZ_ASSERT(object->slotSpan() == numSlots());
RootedValue val(cx);
for (size_t i = 0; i < numSlots(); i++) {
val = iter.read();
object->setSlot(i, val);
}
val.setObject(*object);
iter.storeInstructionResult(val);
return true;
}
bool
MArrayState::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_ArrayState));
writer.writeUnsigned(numElements());
return true;
}
RArrayState::RArrayState(CompactBufferReader& reader)
{
numElements_ = reader.readUnsigned();
}
bool
RArrayState::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedValue result(cx);
ArrayObject* object = &iter.read().toObject().as<ArrayObject>();
uint32_t initLength = iter.read().toInt32();
object->setDenseInitializedLength(initLength);
for (size_t index = 0; index < numElements(); index++) {
Value val = iter.read();
if (index >= initLength) {
MOZ_ASSERT(val.isUndefined());
continue;
}
object->initDenseElement(index, val);
}
result.setObject(*object);
iter.storeInstructionResult(result);
return true;
}
bool
MStringReplace::writeRecoverData(CompactBufferWriter& writer) const
{
MOZ_ASSERT(canRecoverOnBailout());
writer.writeUnsigned(uint32_t(RInstruction::Recover_StringReplace));
return true;
}
RStringReplace::RStringReplace(CompactBufferReader& reader)
{ }
bool RStringReplace::recover(JSContext* cx, SnapshotIterator& iter) const
{
RootedString string(cx, iter.read().toString());
RootedString pattern(cx, iter.read().toString());
RootedString replace(cx, iter.read().toString());
RootedValue result(cx);
if (!js::str_replace_string_raw(cx, string, pattern, replace, &result))
return false;
iter.storeInstructionResult(result);
return true;
}
```
|
Pamela Coburn (born 29 March 1959) is an American operatic soprano. She has performed leading roles internationally, including regular performances at the Vienna State Opera, the Zurich Opera, the Metropolitan Opera, and the Salzburg Festival. She has also recorded with notable conductors, including Nikolaus Harnoncourt and Carlos Kleiber.
Career
Born in Dayton, Ohio, Coburn grew up in Cincinnati where her mother was a piano teacher and a choral conductor. Coburn studied at DePauw University with Ed White, the Eastman School in Rochester, and the Juilliard School. She moved to Germany in 1980 and won the ARD International Music Competition the same year. She won the Metropolitan Opera National Council Auditions in 1982.
Her career was promoted by Elisabeth Schwarzkopf. She was a member of the Bavarian State Opera from 1982 to 1987 and often returned as a guest. She was Rosalinde in Strauss' Die Fledermaus in a performance with this company which was captured on video. At the Vienna State Opera, she appeared as Fiordiligi in Mozart's Così fan tutte, as the Countess in his Le nozze di Figaro, and as Ellen in Benjamin Britten's Peter Grimes, a role which she also performed at the Maggio Musicale Fiorentino and in Munich. She sang Pamina in Mozart's Die Zauberflöte at the municipal de Marseille|Opéra de Marseille (France) in 1988 and also appeared as the Countess at the Salzburg Festival in 1991 and at the Metropolitan Opera. Her roles have included Cleopatra in Handel's Giulio Cesare, Elvira in Mozart's Don Giovanni, Elettra in his Idomeneo, and the Marschallin in Der Rosenkavalier by Richard Strauss.
Coburn recorded Mozart's Die Zauberflöte, conducted by Nikolaus Harnoncourt in a production of the Zurich Opera. In 1990, she recorded Mozart's L'Oca del Cairo conducted by Peter Schreier. She has made many other recordings in both opera and concert.
References
External links
Pamela Coburn as Rosalinde "So muss allein ich bleiben..." ("Die Fledermaus") on YouTube
American operatic sopranos
1959 births
Living people
Musicians from Dayton, Ohio
Indiana University alumni
Eastman School of Music alumni
Juilliard School alumni
Singers from Ohio
Classical musicians from Ohio
21st-century American women
|
Dr. Josie Miller (1925, Yaguajay, Cuba - February 27, 2006, Havana) was the leader of the Jewish community of Cuba for 25 years, from 1981 when the community was tiny and endangered, through the 1990s during which they returned to vigorous growth and reemerged on the world stage. He held the dual positions of head of the Coordinating Commission (the official organization of Cuban Jewry) and head of the Patronato (the country's largest synagogue).
Miller was the interface between the Cuban Jewish community, the government of Fidel Castro, and the world organizations which wished to provide assistance to Cuban Jewry. His skills in diplomacy and arbitration allowed him to meld the often conflicting demands of these disparate groups into a compromise which was acceptable to all.
In 1924 Miller's parents immigrated from Poland to Cuba, where his father became a peddler and eventually a merchant. Although his family maintained a traditional Jewish home, in the small town of Yaguajay there were few other Jews, and Miller grew up having close relationships with non-Jewish Cubans, giving him the wide understanding which was to serve him in his career.
In the 1950s Miller was active in the Maimonides Lodge (Havana) of B'nai B'rith.
See also
Jews in Cuba
References
1925 births
2006 deaths
People from Yaguajay
Cuban Jews
|
Francis Buller was an English politician who sat in the House of Commons variously between 1624 and 1648. He supported the Parliamentary side in the English Civil War.
Buller was the son of Sir Richard Buller, of Shillingham, Cornwall. The Buller family was originally from Somerset and acquired Shillingham in around 1555. He entered Sidney Sussex College, Cambridge in 1620 and matriculated at the Inner Temple in 1622. In 1624, Buller was elected Member of Parliament for Saltash and was re-elected in 1625.
In April 1640, Buller was elected MP for Saltash in the Short Parliament. He was elected MP for East Looe for the Long Parliament in November 1640 and sat until he was excluded under Pride's Purge in 1648. During the Civil War he commanded a regiment for the Parliamentary army at Plymouth. He subsequently moved to Kent.
Buller married Thomasine Honeywood, daughter of Sir Thomas Honeywood of Elmstead Kent. His sons Francis and John were also MPs in Cornwall.
References
|-
Year of birth missing
Year of death missing
Members of the pre-1707 English Parliament for constituencies in Cornwall
Roundheads
English MPs 1624–1625
English MPs 1640 (April)
Francis
|
Rausch Creek may refer to:
Rausch Creek, Pennsylvania, a populated place in Schuylkill County, Pennsylvania
Rausch Creek (Pine Creek), in Schuylkill County, Pennsylvania
Stony Creek (Susquehanna River), also referred to as Rausch Creek, in Dauphin County, Pennsylvania
Rausch Creek (Stony Creek), a tributary of the above
|
```smalltalk
// <copyright file="ToleratingController.cs" company="App Metrics Contributors">
// </copyright>
using System.Threading.Tasks;
using MetricsSandboxMvc.JustForTesting;
using Microsoft.AspNetCore.Mvc;
namespace MetricsSandboxMvc.Controllers
{
[Route("api/[controller]")]
public class ToleratingController : ControllerBase
{
private readonly RequestDurationForApdexTesting _durationForApdexTesting;
public ToleratingController(RequestDurationForApdexTesting durationForApdexTesting)
{
_durationForApdexTesting = durationForApdexTesting;
}
[HttpGet]
public async Task<int> Get()
{
var duration = _durationForApdexTesting.NextToleratingDuration;
await Task.Delay(duration, HttpContext.RequestAborted);
return duration;
}
}
}
```
|
40th Motorized Infantry Battalion is a formation of the Ukrainian Ground Forces. It was originally formed as the 40th Territorial Defence Battalion Kryvbas in Kryvyi Rih.
History
Prerequisites
On March 18, 2014, after the military invasion Russia to Crimea and his annexation, partial mobilization began in Ukraine.
On April 13, 2014, the military actions of war in the east began, after capturing the Sloviansk Donetsk region by Russian sabotage detachments under the command of Igor Girkin. On April 30, 2014, acting President of Ukraine Oleksandr Turchynov instructed the heads of regional administrations to start creating territorial defense battalions in each region of Ukraine. The functions of creating battalions were assigned to the authorities and military commissariats.
Creation
On May 15, 2014, the 40th Territorial Defense Battalion began to form. Measures began on May 20, and equipment and techniques helped the city authorities of Kryvy Rih.
Sending to a fight zone
On June 26, the battalion fighters during the raid in the vicinity of Donetsk captured two persons with the weapons and documents of the DNR called sign Klotz (deputy Igor Girkin, the Russian field commander), and the Donetsk militiaman Sergey Tishchenko, which took direct part in the operations of militants. Klotz had numerous keys to apartments and notarial acts recorded on his real estate in Donetsk and its region.
On July 3, 2014, the terrorist attack on the checkpoint is reflected; six militants were killed, two cars were captured as well as a significant amount of weapons.
On July 23 during an inspection at checkpoints in the area of Amvrosiyivka, a BRDM hit a radio-controlled bomb. After the explosion, mortally wounded Roman Krakovetskiy managed to bring the BRDM from the zone of fire.
On August 4, 2014, the unit reported an event at the checkpoint of the battalion Kryvbas. During the breakthrough, a "suicide bomber" was eliminated, whose purpose was to destroy checkpoints and peaceful inhabitants, later evacuated from the fire of Donetsk.
On August 7, 2014, during the storming of the terrorists' fortified area and the battalion Kryvbas, also involved fighters of the reconnaissance battalion from Cherkaske, 51st Guards Mechanized Brigade, Right Sector. The checkpoint and the enemy were destroyed, as well as the reinforcements. In the battle, two soldiers of Kryvbas were killed — Vladimir Kordabnov & Maxim Kochur. 6 fighters were injured.
On August 10, 2014, protecting a group, a soldier was killed in battle named Sergiy Bontsevych.
Ilovaisk
In early August, the leadership of the "B" sector in the person of General Ruslana Khomchak approved a plan for a military operation on defeating illegal armed formations in the city of Ilovaisk, who was an integral part of the ATO headquarters in the environment of Donetsk. 40 TDB, which at that time was located in Starobesheve, received a task for blocking Ilovaisk from four directions. On August 5, 40 TDB tasks were completed, while two fighters were killed, three were injured. Subsequently, Kryvbas covered the back of the battalions Donbass and Dnipro-1. On August 17 and 18, two sides went to Ilovaysk and killed half of the city. To support them, Ilovaysk overturned battalions Peacekeeper, Ivano-Frankivsk, Kherson, and Svityaz. On August 20, ATO headquarters had reported on the establishment of control over the city. However, on August 24, the column of Russian armored vehicles in 100 units had crossed the state border in sector D, and hit the Ilovaisk group of volunteer battalions of the Ministry of Internal Affairs and the Ministry of Defense, the personal composition of which in most has been armed with light rifle weapons had only a small amount of BTR-80, 82-mm mortar BM-37, and ZU-23-2. The battles took place until August 28. On August 29, 40 TDB, which refused to negotiate the so-called green corridor, began to break from the surroundings. From the surroundings in the Ilovaisk Boiler, 358 soldiers and 40 TDB officers came out. 16 fighters were killed under the Ilovaysk; 84 were injured, 19 disappeared, 25 people were captives.
Reformatting
In November, the 40th Battalion of Territorial Defense was reformatted on the 40th Separate Motorcycle Battalion, and was included in the 17th tank brigade. The commander of the battalion was assigned a former commander to the separate educational detachment of special training of land troops of the Armed Forces of Ukraine (Kirovograd region) Victor Pochernyaev.
Disbandment
In April 2015, information about the General Staff directory pointed out the imbalance of the battalion.
Losses
According to the Book of Remembrance, as of February 2019, the battalion lost 53 men.
Traditions
The day of inception is considered to be May 15.
Honorings
The townspeople honored the memory of the battalion in 2017 and in 2019.
References
External links
Territorial defence battalions of Ukraine
|
Max Görtz (born January 28, 1993) is a Swedish professional ice hockey forward. He is currently playing with KalPa in the Liiga. Görtz was selected by the Nashville Predators in the 6th round (172nd overall) of the 2012 NHL Entry Draft.
Playing career
Görtz originally played as a youth within the Malmö Redhawks organization at the J20 SuperElit level. He later made his professional debut appearing in the Swedish Hockey League with Färjestad BK and Frölunda HC. On June 2, 2014, he signed a three-year entry level contract with Nashville.
After a successful rookie season in North America scoring 47 points in 72 games with the Predators AHL affiliate, the Milwaukee Admirals , Görtz was unable to consolidate his performance in repeating his offensive contribution the following 2016–17 season. After 30 games, having registered just 1 goal and 4 points, Görtz was traded by the Predators to the Anaheim Ducks, in exchange for Andrew O'Brien on January 19, 2017.
Having failed to make his debut at the NHL level throughout the duration of his rookie contract, as an impending restricted free agent, Görtz opted to return to his original club in Sweden, the Malmö Redhawks of the SHL, in signing a two-year contract on May 26, 2017.
At the completion of his contract with the Redhawks, Görtz left Sweden to sign a one-year contract with German club, Grizzlys Wolfsburg of the Deutsche Eishockey Liga (DEL), on 7 August 2020.
Having completed a second season in the DEL with Schwenninger Wild Wings, Görtz left Germany and was signed as a free agent to a two-year contact with Finnish club, KalPa of the Liiga, on 11 June 2022.
Career statistics
Regular season and playoffs
International
References
External links
1993 births
Living people
Swedish people of German descent
Cincinnati Cyclones (ECHL) players
Färjestad BK players
Frölunda HC players
Grizzlys Wolfsburg players
Malmö Redhawks players
Milwaukee Admirals players
Nashville Predators draft picks
San Diego Gulls (AHL) players
Schwenninger Wild Wings players
Swedish ice hockey right wingers
|
The Soviet Union men's national under-18 and under-19 basketball team was a men's junior national basketball team of the Soviet Union. It represented the country in international under-18 and under-19 (under age 18 and under age 19) basketball competitions, until the dissolution of the Soviet Union in 1991. In 1992, CIS men's national under-18 basketball team represented the Commonwealth of Independent States in international under-18 competitions. After 1992, the successor countries all set up their own national teams.
FIBA Under-19 World Championship participations
FIBA Under-18 European Championship participations
See also
Soviet Union men's national basketball team
Soviet Union men's national under-16 basketball team
Soviet Union women's national under-19 basketball team
Russia men's national basketball team
Russia men's national under-19 basketball team
References
U
Men's national under-19 basketball teams
|
```objective-c
/*
This file is free software: you can redistribute it and/or modify
(at your option) any later version.
This file is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with the this software. If not, see <path_to_url
*/
#ifndef _IMAGE_FILTER_
#define _IMAGE_FILTER_
#define FILTER_MAX_WORKING_SURFACE_COUNT 8
typedef struct {
unsigned char *Surface;
unsigned int Pitch;
unsigned int Width, Height;
unsigned char *workingSurface[FILTER_MAX_WORKING_SURFACE_COUNT];
void *userData;
} SSurface;
void RenderDeposterize(SSurface Src, SSurface Dst);
void RenderNearest2X (SSurface Src, SSurface Dst);
void RenderLQ2X (SSurface Src, SSurface Dst);
void RenderLQ2XS (SSurface Src, SSurface Dst);
void RenderHQ2X (SSurface Src, SSurface Dst);
void RenderHQ2XS (SSurface Src, SSurface Dst);
void RenderHQ3X (SSurface Src, SSurface Dst);
void RenderHQ3XS (SSurface Src, SSurface Dst);
void RenderHQ4X (SSurface Src, SSurface Dst);
void RenderHQ4XS (SSurface Src, SSurface Dst);
void Render2xSaI (SSurface Src, SSurface Dst);
void RenderSuper2xSaI (SSurface Src, SSurface Dst);
void RenderSuperEagle (SSurface Src, SSurface Dst);
void RenderScanline( SSurface Src, SSurface Dst);
void RenderBilinear( SSurface Src, SSurface Dst);
void RenderEPX( SSurface Src, SSurface Dst);
void RenderEPXPlus( SSurface Src, SSurface Dst);
void RenderEPX_1Point5x( SSurface Src, SSurface Dst);
void RenderEPXPlus_1Point5x( SSurface Src, SSurface Dst);
void RenderNearest_1Point5x( SSurface Src, SSurface Dst);
void RenderNearestPlus_1Point5x( SSurface Src, SSurface Dst);
void Render2xBRZ(SSurface Src, SSurface Dst);
void Render3xBRZ(SSurface Src, SSurface Dst);
void Render4xBRZ(SSurface Src, SSurface Dst);
void Render5xBRZ(SSurface Src, SSurface Dst);
void Render6xBRZ(SSurface Src, SSurface Dst);
#endif // _IMAGE_FILTER_
```
|
```xml
/*
*
* See the LICENSE file at the top-level directory of this distribution
* for licensing information.
*
* Unless otherwise agreed in a custom licensing agreement with the Lisk Foundation,
* no part of this software, including this file, may be copied, modified,
* propagated, or distributed except according to the terms contained in the
* LICENSE file.
*
* Removal or modification of this copyright notice is prohibited.
*/
import * as cryptography from '@liskhq/lisk-cryptography';
import { Types, Modules } from '../../../../src';
import { RandomEndpoint } from '../../../../src/modules/random/endpoint';
import { HashOnionStore } from '../../../../src/modules/random/stores/hash_onion';
import {
UsedHashOnionStoreObject,
UsedHashOnionsStore,
} from '../../../../src/modules/random/stores/used_hash_onions';
import { ValidatorRevealsStore } from '../../../../src/modules/random/stores/validator_reveals';
import { PrefixedStateReadWriter } from '../../../../src/state_machine/prefixed_state_read_writer';
import { createTransientModuleEndpointContext } from '../../../../src/testing';
import { InMemoryPrefixedStateDB } from '../../../../src/testing/in_memory_prefixed_state';
import * as genesisValidators from '../../../fixtures/genesis_validators.json';
import { MAX_HASH_COMPUTATION } from '../../../../src/modules/random/constants';
describe('RandomModuleEndpoint', () => {
let randomEndpoint: RandomEndpoint;
let context: Types.ModuleEndpointContext;
const validatorsData = [
{
generatorAddress: cryptography.address.getAddressFromLisk32Address(
genesisValidators.validators[0].address,
),
seedReveal: Buffer.from(genesisValidators.validators[0].hashOnion.hashes[0], 'hex'),
height: 1,
valid: true,
},
{
generatorAddress: cryptography.address.getAddressFromLisk32Address(
genesisValidators.validators[1].address,
),
seedReveal: Buffer.from(genesisValidators.validators[1].hashOnion.hashes[1], 'hex'),
height: 3,
valid: true,
},
{
generatorAddress: cryptography.address.getAddressFromLisk32Address(
genesisValidators.validators[2].address,
),
seedReveal: Buffer.from(genesisValidators.validators[2].hashOnion.hashes[1], 'hex'),
height: 5,
valid: true,
},
];
const emptyBytes = Buffer.alloc(0);
const defaultUsedHashOnion: UsedHashOnionStoreObject = {
usedHashOnions: [
{
count: 5,
height: 9,
},
{
count: 6,
height: 12,
},
{
count: 7,
height: 15,
},
],
};
beforeEach(async () => {
const randomModule = new Modules.Random.RandomModule();
randomEndpoint = new RandomEndpoint(randomModule.stores, randomModule.offchainStores);
const stateStore = new PrefixedStateReadWriter(new InMemoryPrefixedStateDB());
context = createTransientModuleEndpointContext({
stateStore,
});
const validatorRevealStore = randomModule.stores.get(ValidatorRevealsStore);
await validatorRevealStore.set(
{ getStore: (p1, p2) => stateStore.getStore(p1, p2) },
emptyBytes,
{ validatorReveals: validatorsData },
);
});
describe('isSeedRevealValid', () => {
it('should throw error when seedReveal provided in params is invalid', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const hashToBeChecked = '12345%$#6';
context.params = { generatorAddress: address, seedReveal: hashToBeChecked };
// Act & Assert
await expect(randomEndpoint.isSeedRevealValid(context)).rejects.toThrow(
'Lisk validator found 1 error[s]:\nProperty \'.seedReveal\' must match format "hex"',
);
});
it('should throw error when generatorAddress provided in params is invalid', async () => {
// Arrange
const address = ['address'];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const hashes = cryptography.utils.hashOnion(
Buffer.from(seed, 'hex'),
genesisValidators.validators[0].hashOnion.distance,
1,
);
const hashToBeChecked = hashes[1].toString('hex');
context.params = { generatorAddress: address, seedReveal: hashToBeChecked };
// Act & Assert
await expect(randomEndpoint.isSeedRevealValid(context)).rejects.toThrow(
"Lisk validator found 1 error[s]:\nProperty '.generatorAddress' should be of type 'string'",
);
});
it('should throw error when seedReveal and address provided in params are both invalid', async () => {
// Arrange
const address = '777777777&&&';
const hashToBeChecked = '12345%$#6';
context.params = { generatorAddress: address, seedReveal: hashToBeChecked };
// Act & Assert
await expect(randomEndpoint.isSeedRevealValid(context)).rejects.toThrow(
'Lisk validator found 2 error[s]:\nProperty \'.generatorAddress\' must match format "lisk32"\nProperty \'.seedReveal\' must match format "hex"',
);
});
it('should return true for a valid seed reveal', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const hashes = cryptography.utils.hashOnion(
Buffer.from(seed, 'hex'),
genesisValidators.validators[0].hashOnion.distance,
1,
);
const hashToBeChecked = hashes[1].toString('hex');
context.params = { generatorAddress: address, seedReveal: hashToBeChecked };
// Act
const isValid = await randomEndpoint.isSeedRevealValid(context);
// Assert
expect(isValid).toEqual({ valid: true });
});
it('should return true if no last seed reveal found', async () => {
// Arrange
const { address } = genesisValidators.validators[4];
const seed = genesisValidators.validators[4].hashOnion.hashes[0];
const hashes = cryptography.utils.hashOnion(
Buffer.from(seed, 'hex'),
genesisValidators.validators[0].hashOnion.distance,
1,
);
const hashToBeChecked = hashes[3].toString('hex');
context.params = { generatorAddress: address, seedReveal: hashToBeChecked };
// Act
const isValid = await randomEndpoint.isSeedRevealValid(context);
// Assert
expect(isValid).toEqual({ valid: true });
});
it('should return false for an invalid seed reveal when last seed is not hash of the given reveal', async () => {
// Arrange
const { address } = genesisValidators.validators[1];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const hashes = cryptography.utils.hashOnion(
Buffer.from(seed, 'hex'),
genesisValidators.validators[0].hashOnion.distance,
1,
);
const hashToBeChecked = hashes[3].toString('hex');
context.params = { generatorAddress: address, seedReveal: hashToBeChecked };
// Act
const isValid = await randomEndpoint.isSeedRevealValid(context);
// Assert
expect(isValid).toEqual({ valid: false });
});
});
describe('setHashOnion', () => {
it('should create a new hash onion and set used hash onion count to 0', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = genesisValidators.validators[1].hashOnion.hashes[1];
const count = 1000;
const distance = 10;
context.params = { address, seed, count, distance };
// Act
await randomEndpoint.setHashOnion(context);
// Assert
const hashOnionStore = randomEndpoint['offchainStores'].get(HashOnionStore);
const storedSeed = await hashOnionStore.get(
context,
cryptography.address.getAddressFromLisk32Address(address),
);
expect(storedSeed).toEqual({
count,
distance,
hashes: expect.any(Array),
});
const usedHashOnionStore = randomEndpoint['offchainStores'].get(UsedHashOnionsStore);
const usedHashOnions = await usedHashOnionStore.get(
context,
cryptography.address.getAddressFromLisk32Address(address),
);
expect(usedHashOnions.usedHashOnions[0].count).toBe(0);
expect(usedHashOnions.usedHashOnions[0].height).toBe(0);
});
it('should set hash onion and set used hash onion count to 0', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const count = 1000;
const distance = 10;
const hashes = cryptography.utils.hashOnion(
cryptography.utils.generateHashOnionSeed(),
count,
distance,
);
context.params = { address, hashes: hashes.map(h => h.toString('hex')), count, distance };
// Act
await randomEndpoint.setHashOnion(context);
// Assert
const hashOnionStore = randomEndpoint['offchainStores'].get(HashOnionStore);
const storedSeed = await hashOnionStore.get(
context,
cryptography.address.getAddressFromLisk32Address(address),
);
expect(storedSeed).toEqual({
count,
distance,
hashes: expect.any(Array),
});
const usedHashOnionStore = randomEndpoint['offchainStores'].get(UsedHashOnionsStore);
const usedHashOnions = await usedHashOnionStore.get(
context,
cryptography.address.getAddressFromLisk32Address(address),
);
expect(usedHashOnions.usedHashOnions[0].count).toBe(0);
expect(usedHashOnions.usedHashOnions[0].height).toBe(0);
});
it('should throw error when address provided in params is invalid', async () => {
// Arrange
const address = ['address'];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const count = 1000;
const distance = 1000;
context.params = { address, seed, count, distance };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
"Lisk validator found 1 error[s]:\nProperty '.address' should be of type 'string'",
);
});
it('should throw error when seed provided in params is invalid', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = ['seed'];
const count = 1000;
const distance = 1000;
context.params = { address, seed, count, distance };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
"Lisk validator found 1 error[s]:\nProperty '.seed' should be of type 'string'",
);
});
it('should throw error when distance is greater than count', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = '7c73f00f64fcebbab49a6145ef14a843';
const count = 1000;
const distance = 1001;
context.params = { address, seed, count, distance };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
'Invalid count. Count must be multiple of distance',
);
});
it('should throw error when hashes is provided but not count', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const distance = 1000;
context.params = { address, hashes: ['7c73f00f64fcebbab49a6145ef14a843'], distance };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
'Hashes must be provided with count and distance.',
);
});
it('should throw error when hashes is provided but not distance', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const count = 1000000;
context.params = { address, hashes: ['7c73f00f64fcebbab49a6145ef14a843'], count };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
'Hashes must be provided with count and distance.',
);
});
it('should throw error when hashes property is empty', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const count = MAX_HASH_COMPUTATION * 10;
context.params = {
address,
hashes: [],
count,
distance: 1,
};
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
'must NOT have fewer than 1 items',
);
});
it('should throw error when count is not multiple of distance', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const count = 10;
context.params = {
address,
hashes: ['7c73f00f64fcebbab49a6145ef14a843'],
count,
distance: 3,
};
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
'Invalid count. Count must be multiple of distance.',
);
});
it('should throw error when hashes length does not match with count and distance', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const count = 2;
context.params = {
address,
hashes: [
'7c73f00f64fcebbab49a6145ef14a843',
'7c73f00f64fcebbab49a6145ef14a843',
'7c73f00f64fcebbab49a6145ef14a843',
],
count,
distance: 2,
};
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
'Invalid length of hashes. hashes must have 2 elements',
);
});
it('should throw error when hashes has an element not 16 bytes', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const count = 1000000;
const distance = 10000;
context.params = { address, hashes: ['7c73f00f64fcebbab49a6145ef14a84300'], count, distance };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
"Lisk validator found 1 error[s]:\nProperty '.hashes.0' must NOT have more than 32 characters",
);
});
it(`should throw error when count without hashes is greater than ${MAX_HASH_COMPUTATION}`, async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const count = MAX_HASH_COMPUTATION + 1;
context.params = { address, count, distance: 1 };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
`Count is too big. In order to set count greater than ${MAX_HASH_COMPUTATION}`,
);
});
it('should throw error when count provided in params is invalid', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const count = 'count';
const distance = 1000;
context.params = { address, seed, count, distance };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
"Lisk validator found 1 error[s]:\nProperty '.count' should be of type 'integer'",
);
});
it('should throw error when distance provided in params is invalid', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const count = 1000;
const distance = 'distance';
context.params = { address, seed, count, distance };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
"Lisk validator found 1 error[s]:\nProperty '.distance' should be of type 'integer'",
);
});
it('should throw error when count is less than 1', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const count = 0;
const distance = 1000;
context.params = { address, seed, count, distance };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
'Lisk validator found 1 error[s]:\nmust be >= 1',
);
});
it('should throw error when distance is less than 1', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const count = 1000;
const distance = 0;
context.params = { address, seed, count, distance };
// Act & Assert
await expect(randomEndpoint.setHashOnion(context)).rejects.toThrow(
'Lisk validator found 1 error[s]:\nmust be >= 1',
);
});
});
describe('getHashOnionSeeds', () => {
let address: string;
beforeEach(async () => {
// Arrange
address = genesisValidators.validators[0].address;
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const count = 1000;
const distance = 10;
await randomEndpoint.setHashOnion({ ...context, params: { address, seed, count, distance } });
});
it('should return an array of seed objects', async () => {
// Act
const storedSeed = await randomEndpoint.getHashOnionSeeds(context);
// Assert
expect(storedSeed.seeds).toHaveLength(1);
expect(storedSeed.seeds[0]).toEqual({
address,
count: 1000,
distance: 10,
seed: expect.any(String),
});
});
});
describe('hasHashOnion', () => {
const count = 1000;
const distance = 10;
it('should return error if param is empty', async () => {
await expect(
randomEndpoint.hasHashOnion({
...context,
params: {},
}),
).rejects.toThrow('must have required property');
});
it('should return hasSeed false with 0 remaining hashes if hashOnion does not exist', async () => {
const hasHashOnion = await randomEndpoint.hasHashOnion({
...context,
params: { address: 'lsk7tyskeefnd6p6bfksd7ytp5jyaw8f2r9foa6ch' },
});
// Assert
expect(hasHashOnion.hasSeed).toBe(false);
expect(hasHashOnion.remaining).toBe(0);
});
it('should return hasSeed true with valid number of remaining hashes', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const usedCount = 20;
await randomEndpoint.setHashOnion({ ...context, params: { address, count, distance } });
const usedHashOnionStore = randomEndpoint['offchainStores'].get(UsedHashOnionsStore);
await usedHashOnionStore.set(
context,
cryptography.address.getAddressFromLisk32Address(address),
{
usedHashOnions: [{ count: usedCount, height: 2121 }],
},
);
// Act
const hasHashOnion = await randomEndpoint.hasHashOnion({ ...context, params: { address } });
// Assert
expect(hasHashOnion.hasSeed).toBe(true);
expect(hasHashOnion.remaining).toBe(count - usedCount);
});
it('should return hasSeed true with all remaining hashes when usedHashOnions does not exist', async () => {
// Arrange
const { address } = genesisValidators.validators[1];
await randomEndpoint.setHashOnion({ ...context, params: { address, count, distance } });
// Act
const hasHashOnion = await randomEndpoint.hasHashOnion({
...context,
params: { address },
});
// Assert
expect(hasHashOnion.hasSeed).toBe(true);
expect(hasHashOnion.remaining).toBe(count);
});
it('should return hasSeed false with 0 remaining hashes when a hash onion is used up', async () => {
// Arrange
const { address } = genesisValidators.validators[2];
await randomEndpoint.setHashOnion({ ...context, params: { address, count, distance } });
const usedHashOnionStore = randomEndpoint['offchainStores'].get(UsedHashOnionsStore);
await usedHashOnionStore.set(
context,
cryptography.address.getAddressFromLisk32Address(address),
{
usedHashOnions: [{ count, height: 8888 }],
},
);
// Act
const hasHashOnion = await randomEndpoint.hasHashOnion({ ...context, params: { address } });
// Assert
expect(hasHashOnion.hasSeed).toBe(false);
expect(hasHashOnion.remaining).toBe(0);
});
});
describe('getHashOnionUsage', () => {
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const count = 1000;
const distance = 10;
let address: string;
let address2: string;
beforeEach(async () => {
// Arrange
address = genesisValidators.validators[0].address;
address2 = genesisValidators.validators[1].address;
await randomEndpoint.setHashOnion({ ...context, params: { address, seed, count, distance } });
await randomEndpoint.setHashOnion({
...context,
params: { address: address2, count, distance },
});
const usedHashOnionStore = randomEndpoint['offchainStores'].get(UsedHashOnionsStore);
await usedHashOnionStore.set(
context,
cryptography.address.getAddressFromLisk32Address(address),
defaultUsedHashOnion,
);
});
it('should reject if the seed does not exist', async () => {
// Act
await expect(
randomEndpoint.getHashOnionUsage({
...context,
params: { address: 'lsk7tyskeefnd6p6bfksd7ytp5jyaw8f2r9foa6ch' },
}),
).rejects.toThrow('does not exist');
});
it('should return the seed usage of a given address', async () => {
// Act
const seedUsage = await randomEndpoint.getHashOnionUsage({ ...context, params: { address } });
// Assert
expect(seedUsage).toEqual({
usedHashOnions: defaultUsedHashOnion.usedHashOnions,
seed: genesisValidators.validators[0].hashOnion.hashes[1],
});
});
it('should return the seed usage when usedHashOnion does not exist', async () => {
// Act
const seedUsage = await randomEndpoint.getHashOnionUsage({
...context,
params: { address: address2 },
});
// Assert
expect(seedUsage).toEqual({
usedHashOnions: [{ count: 0, height: 0 }],
seed: expect.any(String),
});
});
});
describe('setHashOnionUsage', () => {
it('should store the appropriate params in the offchain store', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
context.params = { address, usedHashOnions: defaultUsedHashOnion.usedHashOnions };
// Act
await randomEndpoint.setHashOnionUsage(context);
const usedHashOnionStore = randomEndpoint['offchainStores'].get(UsedHashOnionsStore);
const usedOnionData = await usedHashOnionStore.get(
context,
cryptography.address.getAddressFromLisk32Address(address),
);
// Assert
expect(usedOnionData).toEqual({
usedHashOnions: defaultUsedHashOnion.usedHashOnions,
});
});
it('should throw error when address provided in params is invalid', async () => {
// Arrange
const address = ['address'];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const distance = 1000;
context.params = {
address,
seed,
distance,
usedHashOnions: defaultUsedHashOnion.usedHashOnions,
};
// Act & Assert
await expect(randomEndpoint.setHashOnionUsage(context)).rejects.toThrow(
"Lisk validator found 1 error[s]:\nProperty '.address' should be of type 'string'",
);
});
it('should throw error when count provided in params is invalid', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const count = 'count';
const distance = 1000;
const height = 50;
context.params = { address, seed, distance, usedHashOnions: [{ count, height }] };
// Act & Assert
await expect(randomEndpoint.setHashOnionUsage(context)).rejects.toThrow(
"Lisk validator found 1 error[s]:\nProperty '.usedHashOnions.0.count' should be of type 'integer'",
);
});
it('should throw error when height provided in params is invalid', async () => {
// Arrange
const { address } = genesisValidators.validators[0];
const seed = genesisValidators.validators[0].hashOnion.hashes[1];
const count = 1000;
const distance = 1000;
const height = 'height';
context.params = { address, seed, distance, usedHashOnions: [{ count, height }] };
// Act & Assert
await expect(randomEndpoint.setHashOnionUsage(context)).rejects.toThrow(
"Lisk validator found 1 error[s]:\nProperty '.usedHashOnions.0.height' should be of type 'integer'",
);
});
});
});
```
|
```c++
#ifndef QT_SETTINGS_BUS_TRACKING_HPP
#define QT_SETTINGS_BUS_TRACKING_HPP
#include <QWidget>
#define TRACK_CLEAR 0
#define TRACK_SET 1
#define DEV_HDD 0x01
#define DEV_CDROM 0x02
#define DEV_ZIP 0x04
#define DEV_MO 0x08
#define BUS_MFM 0
#define BUS_ESDI 1
#define BUS_XTA 2
#define BUS_IDE 3
#define BUS_SCSI 4
#define CHANNEL_NONE 0xff
namespace Ui {
class SettingsBusTracking;
}
class SettingsBusTracking {
public:
explicit SettingsBusTracking();
~SettingsBusTracking() = default;
QList<int> busChannelsInUse(int bus);
/* These return 0xff is none is free. */
uint8_t next_free_mfm_channel();
uint8_t next_free_esdi_channel();
uint8_t next_free_xta_channel();
uint8_t next_free_ide_channel();
uint8_t next_free_scsi_id();
int mfm_bus_full();
int esdi_bus_full();
int xta_bus_full();
int ide_bus_full();
int scsi_bus_full();
/* Set: 0 = Clear the device from the tracking, 1 = Set the device on the tracking.
Device type: 1 = Hard Disk, 2 = CD-ROM, 4 = ZIP, 8 = Magneto-Optical.
Bus: 0 = MFM, 1 = ESDI, 2 = XTA, 3 = IDE, 4 = SCSI. */
void device_track(int set, uint8_t dev_type, int bus, int channel);
private:
/* 1 channel, 2 devices per channel, 8 bits per device = 16 bits. */
uint64_t mfm_tracking { 0 };
/* 1 channel, 2 devices per channel, 8 bits per device = 16 bits. */
uint64_t esdi_tracking { 0 };
/* 1 channel, 2 devices per channel, 8 bits per device = 16 bits. */
uint64_t xta_tracking { 0 };
/* 16 channels (prepatation for that weird IDE card), 2 devices per channel, 8 bits per device = 256 bits. */
uint64_t ide_tracking[4] { 0, 0, 0, 0 };
/* 9 buses (rounded upwards to 16for future-proofing), 16 devices per bus,
8 bits per device (future-proofing) = 2048 bits. */
uint64_t scsi_tracking[32] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
};
#endif // QT_SETTINGS_BUS_TRACKING_HPP
```
|
```objective-c
/*
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#ifndef EditingBehavior_h
#define EditingBehavior_h
#include "core/CoreExport.h"
#include "core/editing/EditingBehaviorTypes.h"
namespace blink {
class KeyboardEvent;
class CORE_EXPORT EditingBehavior {
public:
explicit EditingBehavior(EditingBehaviorType type)
: m_type(type)
{
}
// Individual functions for each case where we have more than one style of editing behavior.
// Create a new function for any platform difference so we can control it here.
// When extending a selection beyond the top or bottom boundary of an editable area,
// maintain the horizontal position on Windows and Android but extend it to the boundary of
// the editable content on Mac and Linux.
bool shouldMoveCaretToHorizontalBoundaryWhenPastTopOrBottom() const
{
return m_type != EditingWindowsBehavior && m_type != EditingAndroidBehavior;
}
// On Windows, selections should always be considered as directional, regardless if it is
// mouse-based or keyboard-based.
bool shouldConsiderSelectionAsDirectional() const { return m_type != EditingMacBehavior; }
// On Mac, when revealing a selection (for example as a result of a Find operation on the Browser),
// content should be scrolled such that the selection gets certer aligned.
bool shouldCenterAlignWhenSelectionIsRevealed() const { return m_type == EditingMacBehavior; }
// On Mac, style is considered present when present at the beginning of selection. On other platforms,
// style has to be present throughout the selection.
bool shouldToggleStyleBasedOnStartOfSelection() const { return m_type == EditingMacBehavior; }
// Standard Mac behavior when extending to a boundary is grow the selection rather than leaving the base
// in place and moving the extent. Matches NSTextView.
bool shouldAlwaysGrowSelectionWhenExtendingToBoundary() const { return m_type == EditingMacBehavior; }
// On Mac, when processing a contextual click, the object being clicked upon should be selected.
bool shouldSelectOnContextualMenuClick() const { return m_type == EditingMacBehavior; }
// On Mac and Windows, pressing backspace (when it isn't handled otherwise) should navigate back.
bool shouldNavigateBackOnBackspace() const
{
return m_type != EditingUnixBehavior && m_type != EditingAndroidBehavior;
}
// On Mac, selecting backwards by word/line from the middle of a word/line, and then going
// forward leaves the caret back in the middle with no selection, instead of directly selecting
// to the other end of the line/word (Unix/Windows behavior).
bool shouldExtendSelectionByWordOrLineAcrossCaret() const { return m_type != EditingMacBehavior; }
// Based on native behavior, when using ctrl(alt)+arrow to move caret by word, ctrl(alt)+left arrow moves caret to
// immediately before the word in all platforms, for example, the word break positions are: "|abc |def |hij |opq".
// But ctrl+right arrow moves caret to "abc |def |hij |opq" on Windows and "abc| def| hij| opq|" on Mac and Linux.
bool shouldSkipSpaceWhenMovingRight() const { return m_type == EditingWindowsBehavior; }
// On Mac, undo of delete/forward-delete of text should select the deleted text. On other platforms deleted text
// should not be selected and the cursor should be placed where the deletion started.
bool shouldUndoOfDeleteSelectText() const { return m_type == EditingMacBehavior; }
// Support for global selections, used on platforms like the X Window
// System that treat selection as a type of clipboard.
bool supportsGlobalSelection() const
{
return m_type != EditingWindowsBehavior && m_type != EditingMacBehavior;
}
// Convert a KeyboardEvent to a command name like "Copy", "Undo" and so on.
// If nothing, return empty string.
const char* interpretKeyEvent(const KeyboardEvent&) const;
bool shouldInsertCharacter(const KeyboardEvent&) const;
private:
EditingBehaviorType m_type;
};
} // namespace blink
#endif // EditingBehavior_h
```
|
```cmake
# This file records the Unity Build compilation rules.
# The source files in a `register_unity_group` called are compiled in a unity
# file.
# Generally, the combination rules in this file do not need to be modified.
# If there are some redefined error in compiling with the source file which
# in combination rule, you can remove the source file from the following rules.
register_unity_group(
cc
ftrl_op.cc
lars_momentum_op.cc
proximal_gd_op.cc
decayed_adagrad_op.cc
adadelta_op.cc
dpsgd_op.cc)
register_unity_group(
cu
ftrl_op.cu
lars_momentum_op.cu
momentum_op.cu
sgd_op.cu
adagrad_op.cu
decayed_adagrad_op.cu
adadelta_op.cu
lamb_op.cu)
```
|
```c++
/* boost random/detail/large_arithmetic.hpp header file
*
* accompanying file LICENSE_1_0.txt or copy at
* path_to_url
*
* See path_to_url for most recent version including documentation.
*
* $Id: large_arithmetic.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $
*/
#ifndef BOOST_RANDOM_DETAIL_LARGE_ARITHMETIC_HPP
#define BOOST_RANDOM_DETAIL_LARGE_ARITHMETIC_HPP
#include <boost/cstdint.hpp>
#include <boost/integer.hpp>
#include <boost/limits.hpp>
#include <boost/random/detail/integer_log2.hpp>
#include <boost/random/detail/disable_warnings.hpp>
namespace boost {
namespace random {
namespace detail {
struct div_t {
boost::uintmax_t quotient;
boost::uintmax_t remainder;
};
inline div_t muldivmod(boost::uintmax_t a, boost::uintmax_t b, boost::uintmax_t m)
{
static const int bits =
::std::numeric_limits< ::boost::uintmax_t>::digits / 2;
static const ::boost::uintmax_t mask = (::boost::uintmax_t(1) << bits) - 1;
typedef ::boost::uint_t<bits>::fast digit_t;
int shift = std::numeric_limits< ::boost::uintmax_t>::digits - 1
- detail::integer_log2(m);
a <<= shift;
m <<= shift;
digit_t product[4] = { 0, 0, 0, 0 };
digit_t a_[2] = { digit_t(a & mask), digit_t((a >> bits) & mask) };
digit_t b_[2] = { digit_t(b & mask), digit_t((b >> bits) & mask) };
digit_t m_[2] = { digit_t(m & mask), digit_t((m >> bits) & mask) };
// multiply a * b
for(int i = 0; i < 2; ++i) {
digit_t carry = 0;
for(int j = 0; j < 2; ++j) {
::boost::uint64_t temp = ::boost::uintmax_t(a_[i]) * b_[j] +
carry + product[i + j];
product[i + j] = digit_t(temp & mask);
carry = digit_t(temp >> bits);
}
if(carry != 0) {
product[i + 2] += carry;
}
}
digit_t quotient[2];
if(m == 0) {
div_t result = {
((::boost::uintmax_t(product[3]) << bits) | product[2]),
((::boost::uintmax_t(product[1]) << bits) | product[0]) >> shift,
};
return result;
}
// divide product / m
for(int i = 3; i >= 2; --i) {
::boost::uintmax_t temp =
::boost::uintmax_t(product[i]) << bits | product[i - 1];
digit_t q = digit_t((product[i] == m_[1]) ? mask : temp / m_[1]);
::boost::uintmax_t rem =
((temp - ::boost::uintmax_t(q) * m_[1]) << bits) + product[i - 2];
::boost::uintmax_t diff = m_[0] * ::boost::uintmax_t(q);
int error = 0;
if(diff > rem) {
if(diff - rem > m) {
error = 2;
} else {
error = 1;
}
}
q -= error;
rem = rem + error * m - diff;
quotient[i - 2] = q;
product[i] = 0;
product[i-1] = (rem >> bits) & mask;
product[i-2] = rem & mask;
}
div_t result = {
((::boost::uintmax_t(quotient[1]) << bits) | quotient[0]),
((::boost::uintmax_t(product[1]) << bits) | product[0]) >> shift,
};
return result;
}
inline boost::uintmax_t muldiv(boost::uintmax_t a, boost::uintmax_t b, boost::uintmax_t m)
{ return detail::muldivmod(a, b, m).quotient; }
inline boost::uintmax_t mulmod(boost::uintmax_t a, boost::uintmax_t b, boost::uintmax_t m)
{ return detail::muldivmod(a, b, m).remainder; }
} // namespace detail
} // namespace random
} // namespace boost
#include <boost/random/detail/enable_warnings.hpp>
#endif // BOOST_RANDOM_DETAIL_LARGE_ARITHMETIC_HPP
```
|
Albert Edward Fogg (13 March 1897 – 23 December 1942), known as Bert Fogg, was a football referee from Bolton, Lancashire, who refereed the FA Cup Final in 1935 between Sheffield Wednesday and West Bromwich Albion.
Run ins with Hughie Gallacher
Fogg's name was the cause of an incident when he was refereeing a game involving Hughie Gallacher one day. Gallacher, the Scottish centre-forward, had committed a foul and Fogg booked him and before doing so asked him what his name was. 'What is yours?' asked Gallacher, 'Fogg' replied the referee. 'Aye, and you've been in one all afternoon'. (Tony Mason: The Goalscorers, 1976, p. 48).
Fogg ran into Gallacher early in his Football League career. There was one infamous incident in the Newcastle United v Huddersfield Town game on New Year’s Eve 1927, which ended with Gallacher pushing Fogg into the team bath.
Internationals
Fogg took charge of one England international (v. Wales) in 1927, and two years later, the Scotland v Northern Ireland fixture in Belfast. He also refereed the Dutch national side twice during his career.
References
External links
1897 births
1942 deaths
English football referees
FA Cup final referees
English Football League referees
|
Dan or Danny Johnson may refer to:
Politics
Dan Johnson (Kansas politician) (1936–2014), member of Kansas House of Representatives
Dan Johnson (Kentucky politician) (1960–2017), member of Kentucky House of Representatives
Dan G. Johnson, member of Idaho Senate
Sports
Dan Johnson (American football) (born 1960), American football tight end
Dan Johnson (baseball) (born 1979), baseball player
Danny Johnson (footballer) (born 1993), English footballer for Mansfield Town F.C.
Danny Johnson (ice hockey) (1944–1993), Canadian ice hockey player
Danny Johnson (American football) (born 1995), American football cornerback
Danny Johnson (racing driver) (born, 1960), four time Mr. Dirt Champion
Other
Dan Johnson (economist) (born 1969), Canadian economist
Dan Johnson (journalist) (born c. 1984), English journalist and presenter
Dan Johnson (musician), American rock drummer
D. E. Johnson or Dan E. Johnson, American author
Dan Curtis Johnson, American programmer and comic book writer
See also
Daniel Johnson (disambiguation)
Daniel Johnston (disambiguation)
|
```yaml
name: Vue Calc
description: 'A Simple VueJS Calculator built with ElectronJS'
website: 'path_to_url
repository: 'path_to_url
screenshots:
- imageUrl: 'path_to_url
keywords:
- calculator
- vuetify
- vue
category: Utilities
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.