text
stringlengths 1
22.8M
|
|---|
```xml
<resources>
<string name="app_name" translatable="false">APKUpdater</string>
<string name="tab_apps">"Aplicaes"</string>
<string name="tab_search">"Procurar"</string>
<string name="tab_updates">"Atualizaes"</string>
<string name="tab_settings">"Configuraes"</string>
<string name="something_went_wrong">"Aconteceu algo de errado\n\uD83E\uDD26"</string>
<string name="ignore_version">Ignorar a verso</string>
<string name="ignore_cd">"Ignorar a aplicao"</string>
<string name="unignore_cd">"No ignorar a aplicao"</string>
<string name="refresh_updates">"Procurar atualizaes"</string>
<string name="exclude_system_apps">"Excluir a Loja de Aplicaes"</string>
<string name="include_system_apps">"Incluir aplicaes do sistema"</string>
<string name="exclude_app_store">"Excluir a Loja de Aplicaes"</string>
<string name="include_app_store">"Incluir a Loja de Aplicaes"</string>
<string name="exclude_disabled_apps">"Excluir aplicaes desativadas"</string>
<string name="include_disabled_apps">"Incluir aplicaes desativadas"</string>
<string name="install_cd">"Instalar aplicao"</string>
<string name="app_cd">"cone da aplicao"</string>
<string name="install_success">"%1$s foi instalado com sucesso."</string>
<string name="install_failure">A instalao de "%1$s falhou."</string>
// Settings
<string name="settings_portrait_columns">"Colunas em modo retrato"</string>
<string name="settings_landscape_columns">"Colunas em modo paisagem"</string>
<string name="settings_sources">"Fontes"</string>
<string name="settings_ui">"Interface"</string>
<string name="settings_alarm">"Alarme"</string>
<string name="settings_options">"Opes"</string>
<string name="settings_hour">"Intervalo de horas"</string>
<string name="settings_alarm_daily">"Dirio"</string>
<string name="settings_alarm_3day">"A cada 3 dias"</string>
<string name="settings_alarm_weekly">"Semanalmente"</string>
<string name="settings_android_tv_ui" translatable="false">Interface do Android TV</string>
<string name="ignore_alpha">"Ignorar alpha"</string>
<string name="ignore_beta">"Ignorar beta"</string>
<string name="ignore_preRelease">"Ignorar pr-lanamento"</string>
<string name="use_safe_stores">"Utilizar lojas seguras (Aptoide)"</string>
<string name="root_install">"Instalao root"</string>
<string name="source_apkmirror" translatable="false">ApkMirror</string>
<string name="source_fdroid" translatable="false">F-Droid (Principal)</string>
<string name="source_izzy" translatable="false">F-Droid (Izzy)</string>
<string name="source_aptoide" translatable="false">Aptoide</string>
<string name="source_github" translatable="false">GitHub</string>
<string name="source_apkpure" translatable="false">APKPure (Beta)</string>
<string name="about">"Sobre"</string>
<string name="frequency">"Frequncia"</string>
<string name="theme">"Tema"</string>
<string name="theme_system">"Sistema"</string>
<string name="theme_dark">"Escuro"</string>
<string name="theme_light">"Claro"</string>
<string name="about_github">"Obter cdigo fonte, reportar bugs, requisitar novas funcionalidades e tradues."</string>
<string name="about_donate">"Se gostas da app, considera fazer um donativo para uma causa justa."</string>
<string name="copy_to_clipboard">Copiar para a rea de transferncia</string>
<string name="copy_app_list">Copiar lista da app</string>
// Notifications
<string name="notification_channel_name">Atualizaes</string>
<string name="notification_channel_description">Canal para notificaes de atualizaes.</string>
<string name="notification_channel_id" translatable="false">updateChannel</string>
<string name="notification_update_title">Atualizaes</string>
<plurals name="notification_update_description">
<item quantity="zero">Nenhuma atualizao encontrada.</item>
<item quantity="one">Foi encontrada %1$d atualizao.</item>
<item quantity="other">Foram encontradas %1$d atualizaes.</item>
</plurals>
</resources>
```
|
Lisa A. Borowski is a Democratic member of the Pennsylvania House of Representatives, representing the 168th District since 2023.
Formative years and family
Born circa 1966 in Delaware County, Pennsylvania as Lisa Anne Cianciulli, Lisa A. Borowski is a daughter of Francis D. Cianciulli, M.D., and the paternal granddaughter of Daniel R. Cianciulli and Rose Marie (Moccia) Cianciulli. A 1984 graduate of Radnor High School, Lisa Cianciulli earned her Bachelor of Science degree in communications from Drexel University in 1989.
She married Mark R. Borowski in September 1994. They are the parents of two sons.
Career
Lisa Borowski worked as a healthcare communications professional for Mercy Health System and Einstein Healthcare Network, and also served as board operations manager for the Philadelphia Police Foundation.
As an elected official, she served as a Radnor Township commissioner (2018-2022) and school board member (2011-2015).
On November 8, 2022, she unseated Republican incumbent Christopher B. Quinn to represent the 168th House district, with 17,485 votes to Quinn's 13,708.
References
External links
personal Facebook page
Borowski entry on ballotpedia.org
People from Radnor Township, Pennsylvania
Democratic Party members of the Pennsylvania House of Representatives
Women state legislators in Pennsylvania
School board members in Pennsylvania
Year of birth missing (living people)
Living people
21st-century American politicians
21st-century American women politicians
|
```go
package aws
import (
"net/http"
"time"
"github.com/aws/aws-sdk-go/aws/credentials"
"github.com/aws/aws-sdk-go/aws/endpoints"
)
// UseServiceDefaultRetries instructs the config to use the service's own
// default number of retries. This will be the default action if
// Config.MaxRetries is nil also.
const UseServiceDefaultRetries = -1
// RequestRetryer is an alias for a type that implements the request.Retryer
// interface.
type RequestRetryer interface{}
// A Config provides service configuration for service clients. By default,
// all clients will use the defaults.DefaultConfig structure.
//
// // Create Session with MaxRetries configuration to be shared by multiple
// // service clients.
// sess := session.Must(session.NewSession(&aws.Config{
// MaxRetries: aws.Int(3),
// }))
//
// // Create S3 service client with a specific Region.
// svc := s3.New(sess, &aws.Config{
// Region: aws.String("us-west-2"),
// })
type Config struct {
// Enables verbose error printing of all credential chain errors.
// Should be used when wanting to see all errors while attempting to
// retrieve credentials.
CredentialsChainVerboseErrors *bool
// The credentials object to use when signing requests. Defaults to a
// chain of credential providers to search for credentials in environment
// variables, shared credential file, and EC2 Instance Roles.
Credentials *credentials.Credentials
// An optional endpoint URL (hostname only or fully qualified URI)
// that overrides the default generated endpoint for a client. Set this
// to `nil` or the value to `""` to use the default generated endpoint.
//
// Note: You must still provide a `Region` value when specifying an
// endpoint for a client.
Endpoint *string
// The resolver to use for looking up endpoints for AWS service clients
// to use based on region.
EndpointResolver endpoints.Resolver
// EnforceShouldRetryCheck is used in the AfterRetryHandler to always call
// ShouldRetry regardless of whether or not if request.Retryable is set.
// This will utilize ShouldRetry method of custom retryers. If EnforceShouldRetryCheck
// is not set, then ShouldRetry will only be called if request.Retryable is nil.
// Proper handling of the request.Retryable field is important when setting this field.
EnforceShouldRetryCheck *bool
// The region to send requests to. This parameter is required and must
// be configured globally or on a per-client basis unless otherwise
// noted. A full list of regions is found in the "Regions and Endpoints"
// document.
//
// See path_to_url for AWS
// Regions and Endpoints.
Region *string
// Set this to `true` to disable SSL when sending requests. Defaults
// to `false`.
DisableSSL *bool
// The HTTP client to use when sending requests. Defaults to
// `http.DefaultClient`.
HTTPClient *http.Client
// An integer value representing the logging level. The default log level
// is zero (LogOff), which represents no logging. To enable logging set
// to a LogLevel Value.
LogLevel *LogLevelType
// The logger writer interface to write logging messages to. Defaults to
// standard out.
Logger Logger
// The maximum number of times that a request will be retried for failures.
// Defaults to -1, which defers the max retry setting to the service
// specific configuration.
MaxRetries *int
// Retryer guides how HTTP requests should be retried in case of
// recoverable failures.
//
// When nil or the value does not implement the request.Retryer interface,
// the client.DefaultRetryer will be used.
//
// When both Retryer and MaxRetries are non-nil, the former is used and
// the latter ignored.
//
// To set the Retryer field in a type-safe manner and with chaining, use
// the request.WithRetryer helper function:
//
// cfg := request.WithRetryer(aws.NewConfig(), myRetryer)
//
Retryer RequestRetryer
// Disables semantic parameter validation, which validates input for
// missing required fields and/or other semantic request input errors.
DisableParamValidation *bool
// Disables the computation of request and response checksums, e.g.,
// CRC32 checksums in Amazon DynamoDB.
DisableComputeChecksums *bool
// Set this to `true` to force the request to use path-style addressing,
// i.e., `path_to_url`. By default, the S3 client
// will use virtual hosted bucket addressing when possible
// (`path_to_url`).
//
// Note: This configuration option is specific to the Amazon S3 service.
//
// See path_to_url
// for Amazon S3: Virtual Hosting of Buckets
S3ForcePathStyle *bool
// Set this to `true` to disable the SDK adding the `Expect: 100-Continue`
// header to PUT requests over 2MB of content. 100-Continue instructs the
// HTTP client not to send the body until the service responds with a
// `continue` status. This is useful to prevent sending the request body
// until after the request is authenticated, and validated.
//
// path_to_url
//
// 100-Continue is only enabled for Go 1.6 and above. See `http.Transport`'s
// `ExpectContinueTimeout` for information on adjusting the continue wait
// timeout. path_to_url#Transport
//
// You should use this flag to disable 100-Continue if you experience issues
// with proxies or third party S3 compatible services.
S3Disable100Continue *bool
// Set this to `true` to enable S3 Accelerate feature. For all operations
// compatible with S3 Accelerate will use the accelerate endpoint for
// requests. Requests not compatible will fall back to normal S3 requests.
//
// The bucket must be enable for accelerate to be used with S3 client with
// accelerate enabled. If the bucket is not enabled for accelerate an error
// will be returned. The bucket name must be DNS compatible to also work
// with accelerate.
S3UseAccelerate *bool
// S3DisableContentMD5Validation config option is temporarily disabled,
// For S3 GetObject API calls, #1837.
//
// Set this to `true` to disable the S3 service client from automatically
// adding the ContentMD5 to S3 Object Put and Upload API calls. This option
// will also disable the SDK from performing object ContentMD5 validation
// on GetObject API calls.
S3DisableContentMD5Validation *bool
// Set this to `true` to have the S3 service client to use the region specified
// in the ARN, when an ARN is provided as an argument to a bucket parameter.
S3UseARNRegion *bool
// Set this to `true` to enable the SDK to unmarshal API response header maps to
// normalized lower case map keys.
//
// For example S3's X-Amz-Meta prefixed header will be unmarshaled to lower case
// Metadata member's map keys. The value of the header in the map is unaffected.
LowerCaseHeaderMaps *bool
// Set this to `true` to disable the EC2Metadata client from overriding the
// default http.Client's Timeout. This is helpful if you do not want the
// EC2Metadata client to create a new http.Client. This options is only
// meaningful if you're not already using a custom HTTP client with the
// SDK. Enabled by default.
//
// Must be set and provided to the session.NewSession() in order to disable
// the EC2Metadata overriding the timeout for default credentials chain.
//
// Example:
// sess := session.Must(session.NewSession(aws.NewConfig()
// .WithEC2MetadataDisableTimeoutOverride(true)))
//
// svc := s3.New(sess)
//
EC2MetadataDisableTimeoutOverride *bool
// Instructs the endpoint to be generated for a service client to
// be the dual stack endpoint. The dual stack endpoint will support
// both IPv4 and IPv6 addressing.
//
// Setting this for a service which does not support dual stack will fail
// to make requests. It is not recommended to set this value on the session
// as it will apply to all service clients created with the session. Even
// services which don't support dual stack endpoints.
//
// If the Endpoint config value is also provided the UseDualStack flag
// will be ignored.
//
// Only supported with.
//
// sess := session.Must(session.NewSession())
//
// svc := s3.New(sess, &aws.Config{
// UseDualStack: aws.Bool(true),
// })
UseDualStack *bool
// SleepDelay is an override for the func the SDK will call when sleeping
// during the lifecycle of a request. Specifically this will be used for
// request delays. This value should only be used for testing. To adjust
// the delay of a request see the aws/client.DefaultRetryer and
// aws/request.Retryer.
//
// SleepDelay will prevent any Context from being used for canceling retry
// delay of an API operation. It is recommended to not use SleepDelay at all
// and specify a Retryer instead.
SleepDelay func(time.Duration)
// DisableRestProtocolURICleaning will not clean the URL path when making rest protocol requests.
// Will default to false. This would only be used for empty directory names in s3 requests.
//
// Example:
// sess := session.Must(session.NewSession(&aws.Config{
// DisableRestProtocolURICleaning: aws.Bool(true),
// }))
//
// svc := s3.New(sess)
// out, err := svc.GetObject(&s3.GetObjectInput {
// Bucket: aws.String("bucketname"),
// Key: aws.String("//foo//bar//moo"),
// })
DisableRestProtocolURICleaning *bool
// EnableEndpointDiscovery will allow for endpoint discovery on operations that
// have the definition in its model. By default, endpoint discovery is off.
// To use EndpointDiscovery, Endpoint should be unset or set to an empty string.
//
// Example:
// sess := session.Must(session.NewSession(&aws.Config{
// EnableEndpointDiscovery: aws.Bool(true),
// }))
//
// svc := s3.New(sess)
// out, err := svc.GetObject(&s3.GetObjectInput {
// Bucket: aws.String("bucketname"),
// Key: aws.String("/foo/bar/moo"),
// })
EnableEndpointDiscovery *bool
// DisableEndpointHostPrefix will disable the SDK's behavior of prefixing
// request endpoint hosts with modeled information.
//
// Disabling this feature is useful when you want to use local endpoints
// for testing that do not support the modeled host prefix pattern.
DisableEndpointHostPrefix *bool
// STSRegionalEndpoint will enable regional or legacy endpoint resolving
STSRegionalEndpoint endpoints.STSRegionalEndpoint
// S3UsEast1RegionalEndpoint will enable regional or legacy endpoint resolving
S3UsEast1RegionalEndpoint endpoints.S3UsEast1RegionalEndpoint
}
// NewConfig returns a new Config pointer that can be chained with builder
// methods to set multiple configuration values inline without using pointers.
//
// // Create Session with MaxRetries configuration to be shared by multiple
// // service clients.
// sess := session.Must(session.NewSession(aws.NewConfig().
// WithMaxRetries(3),
// ))
//
// // Create S3 service client with a specific Region.
// svc := s3.New(sess, aws.NewConfig().
// WithRegion("us-west-2"),
// )
func NewConfig() *Config {
return &Config{}
}
// WithCredentialsChainVerboseErrors sets a config verbose errors boolean and returning
// a Config pointer.
func (c *Config) WithCredentialsChainVerboseErrors(verboseErrs bool) *Config {
c.CredentialsChainVerboseErrors = &verboseErrs
return c
}
// WithCredentials sets a config Credentials value returning a Config pointer
// for chaining.
func (c *Config) WithCredentials(creds *credentials.Credentials) *Config {
c.Credentials = creds
return c
}
// WithEndpoint sets a config Endpoint value returning a Config pointer for
// chaining.
func (c *Config) WithEndpoint(endpoint string) *Config {
c.Endpoint = &endpoint
return c
}
// WithEndpointResolver sets a config EndpointResolver value returning a
// Config pointer for chaining.
func (c *Config) WithEndpointResolver(resolver endpoints.Resolver) *Config {
c.EndpointResolver = resolver
return c
}
// WithRegion sets a config Region value returning a Config pointer for
// chaining.
func (c *Config) WithRegion(region string) *Config {
c.Region = ®ion
return c
}
// WithDisableSSL sets a config DisableSSL value returning a Config pointer
// for chaining.
func (c *Config) WithDisableSSL(disable bool) *Config {
c.DisableSSL = &disable
return c
}
// WithHTTPClient sets a config HTTPClient value returning a Config pointer
// for chaining.
func (c *Config) WithHTTPClient(client *http.Client) *Config {
c.HTTPClient = client
return c
}
// WithMaxRetries sets a config MaxRetries value returning a Config pointer
// for chaining.
func (c *Config) WithMaxRetries(max int) *Config {
c.MaxRetries = &max
return c
}
// WithDisableParamValidation sets a config DisableParamValidation value
// returning a Config pointer for chaining.
func (c *Config) WithDisableParamValidation(disable bool) *Config {
c.DisableParamValidation = &disable
return c
}
// WithDisableComputeChecksums sets a config DisableComputeChecksums value
// returning a Config pointer for chaining.
func (c *Config) WithDisableComputeChecksums(disable bool) *Config {
c.DisableComputeChecksums = &disable
return c
}
// WithLogLevel sets a config LogLevel value returning a Config pointer for
// chaining.
func (c *Config) WithLogLevel(level LogLevelType) *Config {
c.LogLevel = &level
return c
}
// WithLogger sets a config Logger value returning a Config pointer for
// chaining.
func (c *Config) WithLogger(logger Logger) *Config {
c.Logger = logger
return c
}
// WithS3ForcePathStyle sets a config S3ForcePathStyle value returning a Config
// pointer for chaining.
func (c *Config) WithS3ForcePathStyle(force bool) *Config {
c.S3ForcePathStyle = &force
return c
}
// WithS3Disable100Continue sets a config S3Disable100Continue value returning
// a Config pointer for chaining.
func (c *Config) WithS3Disable100Continue(disable bool) *Config {
c.S3Disable100Continue = &disable
return c
}
// WithS3UseAccelerate sets a config S3UseAccelerate value returning a Config
// pointer for chaining.
func (c *Config) WithS3UseAccelerate(enable bool) *Config {
c.S3UseAccelerate = &enable
return c
}
// WithS3DisableContentMD5Validation sets a config
// S3DisableContentMD5Validation value returning a Config pointer for chaining.
func (c *Config) WithS3DisableContentMD5Validation(enable bool) *Config {
c.S3DisableContentMD5Validation = &enable
return c
}
// WithS3UseARNRegion sets a config S3UseARNRegion value and
// returning a Config pointer for chaining
func (c *Config) WithS3UseARNRegion(enable bool) *Config {
c.S3UseARNRegion = &enable
return c
}
// WithUseDualStack sets a config UseDualStack value returning a Config
// pointer for chaining.
func (c *Config) WithUseDualStack(enable bool) *Config {
c.UseDualStack = &enable
return c
}
// WithEC2MetadataDisableTimeoutOverride sets a config EC2MetadataDisableTimeoutOverride value
// returning a Config pointer for chaining.
func (c *Config) WithEC2MetadataDisableTimeoutOverride(enable bool) *Config {
c.EC2MetadataDisableTimeoutOverride = &enable
return c
}
// WithSleepDelay overrides the function used to sleep while waiting for the
// next retry. Defaults to time.Sleep.
func (c *Config) WithSleepDelay(fn func(time.Duration)) *Config {
c.SleepDelay = fn
return c
}
// WithEndpointDiscovery will set whether or not to use endpoint discovery.
func (c *Config) WithEndpointDiscovery(t bool) *Config {
c.EnableEndpointDiscovery = &t
return c
}
// WithDisableEndpointHostPrefix will set whether or not to use modeled host prefix
// when making requests.
func (c *Config) WithDisableEndpointHostPrefix(t bool) *Config {
c.DisableEndpointHostPrefix = &t
return c
}
// MergeIn merges the passed in configs into the existing config object.
func (c *Config) MergeIn(cfgs ...*Config) {
for _, other := range cfgs {
mergeInConfig(c, other)
}
}
// WithSTSRegionalEndpoint will set whether or not to use regional endpoint flag
// when resolving the endpoint for a service
func (c *Config) WithSTSRegionalEndpoint(sre endpoints.STSRegionalEndpoint) *Config {
c.STSRegionalEndpoint = sre
return c
}
// WithS3UsEast1RegionalEndpoint will set whether or not to use regional endpoint flag
// when resolving the endpoint for a service
func (c *Config) WithS3UsEast1RegionalEndpoint(sre endpoints.S3UsEast1RegionalEndpoint) *Config {
c.S3UsEast1RegionalEndpoint = sre
return c
}
func mergeInConfig(dst *Config, other *Config) {
if other == nil {
return
}
if other.CredentialsChainVerboseErrors != nil {
dst.CredentialsChainVerboseErrors = other.CredentialsChainVerboseErrors
}
if other.Credentials != nil {
dst.Credentials = other.Credentials
}
if other.Endpoint != nil {
dst.Endpoint = other.Endpoint
}
if other.EndpointResolver != nil {
dst.EndpointResolver = other.EndpointResolver
}
if other.Region != nil {
dst.Region = other.Region
}
if other.DisableSSL != nil {
dst.DisableSSL = other.DisableSSL
}
if other.HTTPClient != nil {
dst.HTTPClient = other.HTTPClient
}
if other.LogLevel != nil {
dst.LogLevel = other.LogLevel
}
if other.Logger != nil {
dst.Logger = other.Logger
}
if other.MaxRetries != nil {
dst.MaxRetries = other.MaxRetries
}
if other.Retryer != nil {
dst.Retryer = other.Retryer
}
if other.DisableParamValidation != nil {
dst.DisableParamValidation = other.DisableParamValidation
}
if other.DisableComputeChecksums != nil {
dst.DisableComputeChecksums = other.DisableComputeChecksums
}
if other.S3ForcePathStyle != nil {
dst.S3ForcePathStyle = other.S3ForcePathStyle
}
if other.S3Disable100Continue != nil {
dst.S3Disable100Continue = other.S3Disable100Continue
}
if other.S3UseAccelerate != nil {
dst.S3UseAccelerate = other.S3UseAccelerate
}
if other.S3DisableContentMD5Validation != nil {
dst.S3DisableContentMD5Validation = other.S3DisableContentMD5Validation
}
if other.S3UseARNRegion != nil {
dst.S3UseARNRegion = other.S3UseARNRegion
}
if other.UseDualStack != nil {
dst.UseDualStack = other.UseDualStack
}
if other.EC2MetadataDisableTimeoutOverride != nil {
dst.EC2MetadataDisableTimeoutOverride = other.EC2MetadataDisableTimeoutOverride
}
if other.SleepDelay != nil {
dst.SleepDelay = other.SleepDelay
}
if other.DisableRestProtocolURICleaning != nil {
dst.DisableRestProtocolURICleaning = other.DisableRestProtocolURICleaning
}
if other.EnforceShouldRetryCheck != nil {
dst.EnforceShouldRetryCheck = other.EnforceShouldRetryCheck
}
if other.EnableEndpointDiscovery != nil {
dst.EnableEndpointDiscovery = other.EnableEndpointDiscovery
}
if other.DisableEndpointHostPrefix != nil {
dst.DisableEndpointHostPrefix = other.DisableEndpointHostPrefix
}
if other.STSRegionalEndpoint != endpoints.UnsetSTSEndpoint {
dst.STSRegionalEndpoint = other.STSRegionalEndpoint
}
if other.S3UsEast1RegionalEndpoint != endpoints.UnsetS3UsEast1Endpoint {
dst.S3UsEast1RegionalEndpoint = other.S3UsEast1RegionalEndpoint
}
}
// Copy will return a shallow copy of the Config object. If any additional
// configurations are provided they will be merged into the new config returned.
func (c *Config) Copy(cfgs ...*Config) *Config {
dst := &Config{}
dst.MergeIn(c)
for _, cfg := range cfgs {
dst.MergeIn(cfg)
}
return dst
}
```
|
Paduka Sri Sultan Muzzil Shah ibni al-Marhum Sultan Muhammad Shah (died 24 August 1280) was the fourth Sultan of Kedah. His reign was from 1237 to 1280. He moved his new capital to Kota Sungai Mas from Kota Meriam.
External links
List of Sultans of Kedah
1280 deaths
13th-century Sultans of Kedah
|
Mind at Large is a concept proposed by Aldous Huxley to help interpret psychedelic experience. He maintained that the human mind filters reality under normal circumstances and that psychedelic drugs remove the filter, exposing the user to a Mind at Large.
Concept
Huxley introduced the concept of Mind at Large in his books The Doors of Perception (1954) and Heaven and Hell (1956). It was influenced by the ideas of the philosopher C. D. Broad.
Huxley held that psychedelic drugs open a 'Reducing Valve' in the brain and nervous system that ordinarily inhibits Mind at Large from reaching the conscious mind. In the aforementioned books, Huxley explores the idea that the human mind has evolved to filter wider planes of reality, partly because handling the details of all of the impressions and images coming in would be unbearable and partly because it has been taught to do so. He believes that psychoactive drugs can partly remove this filter, which leaves the drug user exposed to Mind at Large.
During an experiment conducted by the British psychiatrist Humphrey Osmond in 1953, Huxley was administered the psychedelic drug mescaline, and was prompted by Osmond to comment on the various stimuli around him, such as books and flowers. Huxley recorded aspects of their conversation in The Doors of Perception, focusing on what he said in the recordings. He observed that everyday objects lose their functionality, and suddenly exist "as such"; space and dimension become irrelevant, with perceptions seemingly being enlarged, and at times even overwhelming.
In The Doors of Perception, Huxley cites a 1949 paper by Cambridge Philosopher C. D. Broad ('The Relevance of Psychical Research to Philosophy' ):
However, Huxley omits an important qualifier from the citation of Broad that he employs in The Doors of Perception. Broad's original quotation includes the word 'potentially' thus:Each person is at each moment potentially capable of remembering all that has ever happened to him and of perceiving everything that is happening everywhere in the universe. Broad's paper concerned the implications for philosophy of a number of apparently veridical instances of ESP he had encountered in association with his membership and Presidency of The Society for Psychical Research. Broad had been particularly impressed by reports of the card guessing abilities of a number of subjects, including Basil Shackleton as documented in experiments carried out by the British Psychical Researcher, Dr Samuel Soal. Broad ends his paper by concluding that such evidence appears to present a counterexample to the Basic Limiting Principles he sets out in the same paper and particularly Basic Limiting Principle (4.1) that states:
(4.1) It is impossible for a person to perceive a physical event or a material thing except by means of sensations which that event or thing produces in his mind.
Huxley's misquotation and omission of the word 'potentially' changes the intended emphasis of Broad's paper from which the citation is taken. Broad was summarising the logical implications of a single verified psychical counterexample to his Basic Limiting Principle 4.1 whereas Huxley employs it as a potential consequence of psychedelic experience. Mind at Large in The Doors of Perception is a description of the expanded consciousness that Huxley experienced following the ingestion of 0.4g of mescaline in Water but the misquotation of Broad is taken out of its context concerning psychical events and applied by Huxley as a basis for his Mind at Large metaphor of expanded consciousness under psychedelics.
The power of the altered quotation has led to widespread misattribution of it to Huxley.
The Doors of Perception includes Huxley's descriptions of his experiences with mescaline and includes a total of eight references to 'Mind at Large'. In modern psychedelic research, the closest comparator is that of Oceanic Boundlessness.
In The Doors of Perception, Huxley stated:
References to the concept
In 2009, journalist Andrew Sullivan published excerpts from the writing of Barbara Bradley Hagerty in The Atlantic. In the excerpts, Hagerty connects the research of neuroscientist Andrew Newberg on religious experiences in Catholic nuns and Buddhist monks to Huxley's concept of Mind at Large.
See also
Altered state of consciousness
Collective unconscious
Cosmic consciousness
Default mode network
Eight-circuit model of consciousness
Higher consciousness
Panpsychism
Pantheism
References
Aldous Huxley
Psychedelia
Perception
Theory of mind
|
Hagen is a surname. Notable people with the surname include:
A
Aksel Hagen (born 1953), Norwegian politician
Alexander Hagen (born 1955), German sailor
Alice Mary Hagen (1872 – 1972), Canadian ceramic artist
Anders Hagen (1921–2005), Norwegian archaeologist
Anita Hagen (1931–2015), Canadian politician
B
Bernhard Joachim Hagen (1720–1787), German composer, violinist and lutenist
Bruce Hagen (born 1930), American politician
C
Carl I. Hagen (born 1944), Norwegian politician, former leader of the Progress Party and Vice-President of Stortinget
Cosma Shiva Hagen (born 1981), German actress
C. R. Hagen (born 1937), American physicist at the University of Rochester
D
Daniel Hagen, American voice, television, and film actor
Daron Hagen (born 1961), American composer
David Hagen (1973–2020), Scottish footballer
David Warner Hagen (1931-2022), American jurist
E
Earle Hagen (1919–2008), American composer
Edvald Boasson Hagen (born 1987), Norwegian cyclist
Edward Hagen (anthropologist) (born 1962), American biological anthropologist and professor
Edward Hagen (handballer) (1908–1963), American handball player
Edward Hagen (Minnesota politician) (1875–1950), American farmer, educator and politician
Eli Hagen (born 1947), wife and secretary of the Norwegian politician Carl I. Hagen
Erik Hagen (born 1975), footballer who played for FC Zenit Saint Petersburg
Eva-Maria Hagen (1934–2022), German actress and singer
G
Georgina Hagen (born 1991), English actress
Gottfried Hagen (1230–1299), German town clerk
Gotthilf Hagen (1797–1884), German physicist and hydraulic engineer
Gulbrand Hagen (1864–1919), American newspaper editor, writer and photographer
H
Halvor Hagen (born 1947), American football player
Hans Hagen (born 1953), professor of computer science at the University of Kaiserslautern
Harald Hagen (1902–1970), Norwegian sailor
Harlan Hagen (1914–1990), American politician
Harold Hagen (1901–1957), American politician
Hermann August Hagen (1817–1893), German entomologist
Horst Hagen (born 1950), German volleyball player
I
I. Kathleen Hagen (1945–2015), former medical doctor who gained notoriety for being accused of murder by asphyxia of her parents
Ingeborg Refling Hagen (1895–1989), Norwegian author and teacher
Ingebrigt Severin Hagen (1852–1917), Norwegian bryologist
J
Jacob Hagen (1809–1870), businessman and parliamentarian in South Australia
Jean Hagen (1923–1977), American actress
Jimmy Hagan (1918–1998), English football player and manager
Johann Georg Hagen (1847–1930), American astronomer and Catholic priest
Julius Hagen (1884–1940), German film producer
K
Karen Grønn-Hagen (1903–1982), Norwegian politician
Kenneth Sverre Hagen (1919–1997), American entomologist
Kevin Hagen (1928–2005), American actor
L
Loren D. Hagen (1946–1971), United States Army Special Forces officer awarded the Medal of Honor
M
Magne Hagen (born 1938), Norwegian royal servant
Mark Rein·Hagen (born 1964), role-playing, card, video and board game designer
Mark von Hagen (1954–2019), professor for Russian, Ukrainian, and Eurasian history at Arizona State University
Morten Hagen (born 1974), Norwegian golfer
N
Natascha Hagen, Austrian singer-songwriter
Nina Hagen (born 1955), German female singer
O
Oddbjørn Hagen (1908–1983), Norwegian skier
Olav Hagen (1921–2013), Norwegian cross country skier
Orville W. Hagen (1915–2007), American politician
Oskar Hagen (art historian) (1888–1957), German art historian
Oscar W. Hagen (1884–1945), American politician
P
Paul Hagen (1920–2003), Danish film actor
R
Rune Hagen (born 1975), Norwegian footballer
S
Silvia Hagen, author
Stan Hagen (1940–2009), Canadian politician
Steffen Hagen (born 1986), Norwegian footballer
Stein Erik Hagen (born 1956), Norwegian businessman
Steve Hagen (born 1945), founder of the Dharma Field Zen Center
Steven van der Hagen (1563–1621), first admiral of the Dutch East India Company
T
Theodor Hagen (music critic) (1823–1871), German-American writer on musical topics
Theodor Hagen (artist) (1842–1919), German landscape painter
Thoralf Hagen (1887–1979), Norwegian rower
Tom Hagen (businessman) (born 1950), Norwegian businessman
Tom Harald Hagen (born 1978), Norwegian footballer
Toni Hagen (1917–2003), Swiss geologist and development assistance pioneer in Nepal
U
Ulrich Hagen (1925–2007), German scientist
Uta Hagen (1919–2004), American stage actress
V
Veronika Hagen (born 1963), Austrian violist
Victor Wolfgang von Hagen (1908–1985), American explorer
W
Walter Hagen (1892–1969), American Golfer
Walter Hagen (aviator) (1897–1963), German Luftwaffe Stuka pilot
William W. Hagen (born 1942), Professor of History at the University of California-Davis
Y
Yngvar Hagen (1909 – 1993), Norwegian zoologist
See also
Hagens, a surname
Hagan (surname)
Van der Hagen, a surname
Von Hagen, a surname
Surnames
Norwegian-language surnames
German-language surnames
Danish-language surnames
Surnames of Norwegian origin
Surnames of Danish origin
Surnames of German origin
Surnames of Scandinavian origin
Surnames of Swedish origin
|
```java
package com.fishercoder.secondthousand;
import com.fishercoder.solutions.secondthousand._1558;
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.assertEquals;
public class _1558Test {
private _1558.Solution1 solution1;
private static int[] nums;
@BeforeEach
public void setup() {
solution1 = new _1558.Solution1();
}
@Test
public void test1() {
nums = new int[]{1, 5};
assertEquals(5, solution1.minOperations(nums));
}
@Test
public void test2() {
nums = new int[]{2, 2};
assertEquals(3, solution1.minOperations(nums));
}
@Test
public void test3() {
nums = new int[]{4, 2, 5};
assertEquals(6, solution1.minOperations(nums));
}
@Test
public void test4() {
nums = new int[]{3, 2, 2, 4};
assertEquals(7, solution1.minOperations(nums));
}
@Test
public void test5() {
nums = new int[]{2, 4, 8, 16};
assertEquals(8, solution1.minOperations(nums));
}
}
```
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<shape xmlns:android="path_to_url">
<stroke android:color="@android:color/darker_gray"
android:width="1dp"/>
<corners android:radius="3dp"/>
</shape>
```
|
The is an ancient Spanish breed of warren hound used to hunt small game in Andalusia, Spain. It is one of four podenco breeds recognized by the Real Sociedad Canina de España. It is an agile dog generally used to hunt ducks, rabbits, boar and fowl. There are three accepted sizes (small, medium and large) and three coat types (wire-haired, long-haired and smooth).
History
As with some other Mediterranean sighthounds, it is sometimes claimed that the Podenco descends from Egyptian hounds such as the Tesem or Saluki, distributed by Phoenician traders in the 1st century BC. However, it was not until 1990 that a breed club formed to promote the development of breed standards. Phillipe Bloque-Rentón and colleagues at the University of Córdoba's veterinary medicine faculty undertook the research work required to specify the breed; their study, presented at the second Simposium de las razas caninas españolas (Spanish dog breeds symposium) in 1992, was recognized by Real Sociedad Canina de España in April of that year as a defining breed standard. In Spain, podenco Andaluz were included within Group V - Spitz and Primitive Types, under Section 7, Primitive type - Hunting dogs. However, the breed is recognized neither by the Fédération Cynologique Internationale (FCI) nor by any other international dog breeds association, due to the large number of matches with the Portuguese Podengo standard — a fact which casts doubt on its claim to be regarded as a separate breed. Genetically the Podenco Andaluz is most closely related to the Galgo Español. In January 2015 it was recognized by the Verband für das Deutsche Hundewesen in Germany.
Characteristics
There are three sizes – large, medium and small – and three types of coat – wire-haired (Spanish: Cerdeño), long-haired (Spanish: Sedeño) and smooth. This combination of factors can results in nine different varieties. This variability may be the result of adaptation to the different microclimates within Andalusia, including mountains, agricultural land and marshes, as well as the diverse game targeted by hunters. Coat colors ranges from white to deep red. Podenco Andaluz have a trot as fast as their gallop.
Like other warren hounds, the Podenco has excellent sight, hearing and sense of smell. They are renowned for their methodical hunting style, as well as stamina and endurance while working in the mild winters with irregular precipitations, and dry, hot, sunny summers of Andalusia. Podenco Andaluz are lively dogs, affectionate, loyal to their owners, but wary with strangers.
Podenco Andaluz are used either singularly, in pairs or as part of a large hunting pack known as a rehala. Small and medium podenco Andaluz hunt rabbits with one dog entering the bramble to drive out the rabbit, while the rest lie in wait to catch it. medium and smaller dogs search out deer or wild boar, while the larger hounds are used for attacking the prey.
One of the most typical functions of the large Andalusian hound was that of the so-called quitaor accompanying the Spanish greyhound colleras during hare hunting. The quitaor‘s job consisted primarily of flushing out the hares from their home or hiding place and killing them; then, together with the greyhounds, retrieving them for the owner. Andalusian farmhouses would use the larger hounds as watchdogs, and the smaller hounds were used to kill rodents.
References
Sighthounds
Dog breeds originating in Andalusia
|
```c++
/**
* Authors:
* - Paul Asmuth <paul@eventql.io>
*
* This program is free software: you can redistribute it and/or modify it under
* or any later version.
*
* In accordance with Section 7(e) of the license, the licensing of the Program
* under the license does not imply a trademark license. Therefore any rights,
* title and interest in our trademarks remain entirely with us.
*
* 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 license for more details.
*
* You can be released from the requirements of the license by purchasing a
* commercial license. Buying such a license is mandatory as soon as you develop
* commercial activities involving this program without disclosing the source
* code of your own applications
*/
#include "eventql/util/UTF8.h"
#include "eventql/util/exception.h"
char32_t UTF8::nextCodepoint(const char** cur, const char* end_) {
auto begin = reinterpret_cast<const uint8_t*>(*cur);
auto end = reinterpret_cast<const uint8_t*>(end_);
if (begin >= end) {
return 0;
}
if (*begin < 0b10000000) {
return *(*cur)++;
}
if ((*begin & 0b11100000) == 0b11000000) {
if (begin + 1 >= end) {
RAISE(kEncodingError, "invalid UTF8 encoding");
}
char32_t chr;
chr = (*(*cur)++ & 0b00011111) << 6;
chr |= (*(*cur)++ & 0b00111111);
return chr;
}
if ((*begin & 0b11110000) == 0b11100000) {
if (begin + 2 >= end) {
RAISE(kEncodingError, "invalid UTF8 encoding");
}
char32_t chr;
chr = (*(*cur)++ & 0b00001111) << 12;
chr |= (*(*cur)++ & 0b00111111) << 6;
chr |= (*(*cur)++ & 0b00111111);
return chr;
}
if ((*begin & 0b11111000) == 0b11110000) {
if (begin + 3 >= end) {
RAISE(kEncodingError, "invalid UTF8 encoding");
}
char32_t chr;
chr = (*(*cur)++ & 0b00000111) << 18;
chr |= (*(*cur)++ & 0b00111111) << 12;
chr |= (*(*cur)++ & 0b00111111) << 6;
chr |= (*(*cur)++ & 0b00111111);
return chr;
}
if ((*begin & 0b11111100) == 0b11111000) {
if (begin + 4 >= end) {
RAISE(kEncodingError, "invalid UTF8 encoding");
}
char32_t chr;
chr = (*(*cur)++ & 0b00000011) << 14;
chr |= (*(*cur)++ & 0b00111111) << 18;
chr |= (*(*cur)++ & 0b00111111) << 12;
chr |= (*(*cur)++ & 0b00111111) << 6;
chr |= (*(*cur)++ & 0b00111111);
return chr;
}
if ((*begin & 0b11111110) == 0b11111100) {
if (begin + 5 >= end) {
RAISE(kEncodingError, "invalid UTF8 encoding");
}
char32_t chr;
chr = (*(*cur)++ & 0b00000001) << 30;
chr |= (*(*cur)++ & 0b00111111) << 24;
chr |= (*(*cur)++ & 0b00111111) << 18;
chr |= (*(*cur)++ & 0b00111111) << 12;
chr |= (*(*cur)++ & 0b00111111) << 6;
chr |= (*(*cur)++ & 0b00111111);
return chr;
}
RAISE(kEncodingError, "invalid UTF8 encoding");
}
bool UTF8::isValidUTF8(const String& str) {
return UTF8::isValidUTF8(str.data(), str.size());
}
bool UTF8::isValidUTF8(const char* str, size_t size) {
auto end = str + size;
for (auto cur = str; cur < end; ) {
if (*reinterpret_cast<const uint8_t*>(cur) < 0b10000000) {
cur = cur + 1;
return true;
}
if ((*reinterpret_cast<const uint8_t*>(cur) & 0b11100000) == 0b11000000) {
if (cur + 1 >= end) {
return false;
} else {
cur = cur + 2;
continue;
}
}
if ((*reinterpret_cast<const uint8_t*>(cur) & 0b11110000) == 0b11100000) {
if (cur + 2 >= end) {
return false;
} else {
cur = cur + 3;
continue;
}
}
if ((*reinterpret_cast<const uint8_t*>(cur) & 0b11111000) == 0b11110000) {
if (cur + 3 >= end) {
return false;
} else {
cur = cur + 4;
continue;
}
}
if ((*reinterpret_cast<const uint8_t*>(cur) & 0b11111100) == 0b11111000) {
if (cur + 4 >= end) {
return false;
} else {
cur = cur + 5;
continue;
}
}
if ((*reinterpret_cast<const uint8_t*>(cur) & 0b11111110) == 0b11111100) {
if (cur + 5 >= end) {
return false;
} else {
cur = cur + 6;
continue;
}
}
}
return true;
}
void UTF8::encodeCodepoint(char32_t codepoint, String* target) {
if (codepoint < 0b10000000) {
*target += (char) codepoint;
return;
}
if (codepoint < 0b100000000000) {
*target += (char) (0b11000000 | ((codepoint >> 6) & 0b00011111));
*target += (char) (0b10000000 | (codepoint & 0b00111111));
return;
}
else if (codepoint < 0b10000000000000000) {
*target += (char) (0b11100000 | ((codepoint >> 12) & 0b00001111));
*target += (char) (0b10000000 | ((codepoint >> 6) & 0b00111111));
*target += (char) (0b10000000 | (codepoint & 0b00111111));
return;
}
else if (codepoint < 0b1000000000000000000000) {
*target += (char) (0b11110000 | ((codepoint >> 18) & 0b00000111));
*target += (char) (0b10000000 | ((codepoint >> 12) & 0b00111111));
*target += (char) (0b10000000 | ((codepoint >> 6) & 0b00111111));
*target += (char) (0b10000000 | (codepoint & 0b00111111));
return;
}
else if (codepoint < 0b100000000000000000000000000) {
*target += (char) (0b11111000 | ((codepoint >> 24) & 0b00000011));
*target += (char) (0b10000000 | ((codepoint >> 18) & 0b00111111));
*target += (char) (0b10000000 | ((codepoint >> 12) & 0b00111111));
*target += (char) (0b10000000 | ((codepoint >> 6) & 0b00111111));
*target += (char) (0b10000000 | (codepoint & 0b00111111));
}
else {
*target += (char) (0b11111100 | ((codepoint >> 30) & 0b00000001));
*target += (char) (0b10000000 | ((codepoint >> 24) & 0b00111111));
*target += (char) (0b10000000 | ((codepoint >> 18) & 0b00111111));
*target += (char) (0b10000000 | ((codepoint >> 11) & 0b00111111));
*target += (char) (0b10000000 | ((codepoint >> 6) & 0b00111111));
*target += (char) (0b10000000 | (codepoint & 0b00111111));
}
}
```
|
```raw token data
IP Route Table for VRF "default"
'*' denotes best ucast next-hop
'**' denotes best mcast next-hop
'[x/y]' denotes [preference/metric]
'%<string>' in via output denotes VRF <string>
0.0.0.0/0, ubest/mbest: 1/0
*via 10.1.100.1%management, [1/0], 6d02h, static
1.1.1.1/32, ubest/mbest: 2/0, attached
*via 1.1.1.1, Lo1, [0/0], 6d00h, local
*via 1.1.1.1, Lo1, [0/0], 6d00h, direct
1.1.1.10/32, ubest/mbest: 2/0, attached
*via 1.1.1.10, Lo10, [0/0], 1w12h, local
*via 1.1.1.10, Lo10, [0/0], 1w12h, direct
2.2.2.2/32, ubest/mbest: 2/0
*via 10.10.30.2, Eth2/2, [110/3], 5d18h, ospf-10, intra
*via 10.10.40.2, Eth2/4, [110/3], 5d18h, ospf-10, intra
3.3.3.3/32, ubest/mbest: 2/0
*via 10.10.30.2, Eth2/2, [110/4], 5d18h, ospf-10, intra
*via 10.10.40.2, Eth2/4, [110/4], 5d18h, ospf-10, intra
4.4.4.4/32, ubest/mbest: 2/0
*via 10.10.30.2, Eth2/2, [110/2], 5d23h, ospf-10, intra
*via 10.10.40.2, Eth2/4, [110/2], 5d23h, ospf-10, intra
7.7.7.7/32, ubest/mbest: 1/0
*via 10.10.50.1, [1/0], 1d21h, static
8.8.8.8/32, ubest/mbest: 1/0, pending
*via 10.66.120.1, Vlan1220, [1/0], 00:00:01, static, tag 100
10.0.255.1/32, ubest/mbest: 3/0
*via 10.24.1.74, Eth1/1, [170/51712], 4w4d, eigrp-NAMED, external, tag 65422
*via 10.24.2.76, Eth1/3, [170/51712], 4w4d, eigrp-NAMED, external, tag 65422
*via 10.24.2.154, Eth2/11, [170/51712], 3w4d, eigrp-NAMED, external, tag 65422
10.1.17.128/25, ubest/mbest: 3/0
*via 10.24.1.74, Eth1/1, [170/3072], 4w4d, eigrp-NAMED, external
*via 10.24.2.76, Eth1/3, [170/3072], 4w4d, eigrp-NAMED, external
*via 10.24.2.154, Eth2/11, [170/3072], 3w4d, eigrp-NAMED, external
10.10.10.0/24, ubest/mbest: 1/0, attached
*via 10.10.10.1, Vlan5, [0/0], 5d18h, direct
10.10.10.1/32, ubest/mbest: 1/0, attached
*via 10.10.10.1, Vlan5, [0/0], 5d18h, local
10.10.30.0/24, ubest/mbest: 1/0, attached
*via 10.10.30.1, Eth2/2, [0/0], 5d23h, direct
10.10.30.1/32, ubest/mbest: 1/0, attached
*via 10.10.30.1, Eth2/2, [0/0], 5d23h, local
10.10.40.0/24, ubest/mbest: 1/0, attached
*via 10.10.40.1, Eth2/4, [0/0], 5d23h, direct
10.10.40.1/32, ubest/mbest: 1/0, attached
*via 10.10.40.1, Eth2/4, [0/0], 5d23h, local
10.10.50.0/24, ubest/mbest: 2/0
*via 10.10.30.2, Eth2/2, [110/3], 5d18h, ospf-10, intra
*via 10.10.40.2, Eth2/4, [110/3], 5d18h, ospf-10, intra
10.10.60.0/24, ubest/mbest: 2/0
*via 10.10.30.2, Eth2/2, [110/3], 5d18h, ospf-10, intra
*via 10.10.40.2, Eth2/4, [110/3], 5d18h, ospf-10, intra
10.10.70.0/24, ubest/mbest: 2/0
*via 10.10.30.2, Eth2/2, [110/2], 5d23h, ospf-10, intra
*via 10.10.40.2, Eth2/4, [110/2], 5d23h, ospf-10, intra
10.10.80.0/24, ubest/mbest: 2/0
*via 10.10.30.2, Eth2/2, [110/2], 5d23h, ospf-10, intra
*via 10.10.40.2, Eth2/4, [110/2], 5d23h, ospf-10, intra
10.71.0.0/21, ubest/mbest: 1/0
*via Null0, [220/10], 2y49w, ospf-1, discard
10.151.0.0/16, ubest/mbest: 1/0
*via 172.24.0.240%default, [150/51712], 3d17h, bgp-65004, internal, tag 65004 (evpn) segid: 10000 tunnelid: 0xac1800f0 encap: VXLAN
10.218.139.240/29, ubest/mbest: 2/0
*via 10.62.2.30, Po1, [110/10], 0.000000, ospf-1, type-2, tag 888
*via 10.62.2.34, Po1, [110/10], 0.000000, ospf-1, type-2, tag 888
```
|
The Malta national women's cricket team is the team that represents Malta in international women's cricket. In April 2018, the International Cricket Council (ICC) granted full Women's Twenty20 International (WT20I) status to all its members. Therefore, all Twenty20 matches to be played between Malta women and other ICC members after 1 July 2018 have been eligible for full WT20I status.
Records and statistics
International Match Summary — Malta Women
Last updated 6 August 2023
Twenty20 International
T20I record versus other nations
Records complete to WT20I #1530. Last updated 6 August 2023.
See also
List of Malta women Twenty20 International cricketers
References
Further reading
Women
C
Women's national cricket teams
|
Lars-Ove "Larsa" Johansson (14 November 1938 – 11 November 2019) was a Swedish footballer who played as a forward, best known for representing Hammarby IF.
Club career
Johansson was born in Härnösand and started to play football with local club IF Älgarna, making his debut for the senior team at age 14 in the Swedish lower divisions. As a youngster, he reportedly attracted interest from Degerfors IF.
Before the 1956–57 season, Johansson instead transferred to Hammarby IF in Allsvenskan, the domestic top tier. Aged 18, he immediately established himself as a starting player, but Hammarby got relegated at the end of the year.
In 1957–58, Hammarby scored an impressive 117 goals in 33 fixtures throughout the campaign, with Johansson playing an integral part, getting instantly promoted from the second division.
Johansson established himself as a frequent starter for Hammarby in Allsvenskan between 1959 and 1963. He got known as a prolific goalscorer with a powerful shot, forming a fruitful partnership with forward Karl-Evert Skoglund.
Being plagued by injuries his whole career, Johansson only played one game Hammarby in 1964, now competing in the second tier again, and left the club at the end of the year. In total, Johansson made 116 league appearances for Hammarby, scoring 65 goals.
Johansson ended his career with IFK Västerås, playing two seasons before announcing his retirement in 1966, aged 28.
International career
After regularly featuring for the Swedish U21's and B-team, Johansson won his first and only senior cap for Sweden on 18 September 1960. He played the full game in a 1–3 loss against Norway, in an away friendly.
References
External links
1938 births
2019 deaths
Sportspeople from Härnösand
Swedish men's footballers
Men's association football forwards
Allsvenskan players
Hammarby Fotboll players
IFK Västerås players
Sweden men's international footballers
Footballers from Västernorrland County
|
```xml
<?xml version="1.0" encoding="utf-8" ?>
<hosts>
<host name="localhost">
<alias>host1</alias>
</host>
</hosts>
```
|
Bernd Baumgart (born 3 July 1955) is a German rower who competed for East Germany in the 1976 Summer Olympics.
He was born in Wittenberg. In 1976, he was a crew member of the East German boat, which won the gold medal in the men's eight event.
References
1955 births
Living people
People from Wittenberg
People from Bezirk Halle
East German male rowers
Sportspeople from Saxony-Anhalt
Olympic rowers for East Germany
Rowers at the 1976 Summer Olympics
Olympic gold medalists for East Germany
Olympic medalists in rowing
Medalists at the 1976 Summer Olympics
Recipients of the Patriotic Order of Merit in silver
|
Joaquim Faria (14 July 1904 – 23 February 1977) was a Brazilian rower. He competed in the men's eight event at the 1932 Summer Olympics.
References
1904 births
1977 deaths
Brazilian male rowers
Olympic rowers for Brazil
Rowers at the 1932 Summer Olympics
Rowers from Rio de Janeiro (city)
|
Saragooru Nanjangud is a small village in Mysore district of Karnataka state, India.
Location
Saragooru village is located on the road from Nanjangud to T.Narasipur.
Demographics
There are 553 families living in the village with a total population of 2,283. Literacy rate is 65%.
Administration
As per constitution of India and Panchyati Raaj Act, Saragooru village is administrated by Sarpanch (Head of Village) who is elected representative of village.
See also
Sargur, H.D.Kote
References
Villages in Mysore district
|
```yaml
# Each section from every release note are combined when the
# CHANGELOG.rst is rendered. So the text needs to be worded so that
# it does not depend on any information only available in another
# section. This may mean repeating some details, but each section
# must be readable independently of the other.
#
# Each section note must be formatted as reStructuredText.
---
enhancements:
- |
Add Pod exit timestamp to container-lifecycle check.
```
|
```xml
/*
* This software is released under MIT license.
* The full license information can be found in LICENSE in the root directory of this project.
*/
import { renderIcon } from '../icon.renderer.js';
import { IconShapeTuple } from '../interfaces/icon.interfaces.js';
const icon = {
outline:
'<path d="M6,34a1,1,0,0,1-1-1V3A1,1,0,0,1,7,3V33A1,1,0,0,1,6,34Z"/><path d="M30.55,3.82a1,1,0,0,0-1,0,14.9,14.9,0,0,1-6.13,1.16,13.11,13.11,0,0,1-5.18-1.49,12.78,12.78,0,0,0-5-1.45A10.86,10.86,0,0,0,9,2.85V5.08A8.8,8.8,0,0,1,13.25,4a11.22,11.22,0,0,1,4.2,1.28,14.84,14.84,0,0,0,6,1.66A18.75,18.75,0,0,0,29,6.12V18.95a16.16,16.16,0,0,1-5.58.93,13.11,13.11,0,0,1-5.18-1.49,12.78,12.78,0,0,0-5-1.45A10.86,10.86,0,0,0,9,17.79V20a8.8,8.8,0,0,1,4.25-1.08,11.22,11.22,0,0,1,4.2,1.28,14.84,14.84,0,0,0,6,1.66,16.79,16.79,0,0,0,7-1.37,1,1,0,0,0,.55-.89V4.67A1,1,0,0,0,30.55,3.82Z"/>',
solid:
'<path d="M5.92,2a1,1,0,0,0-1,1V33a1,1,0,0,0,2,0V3A1,1,0,0,0,5.92,2Z"/><path d="M30.5,3.82a1,1,0,0,0-1,0,14.9,14.9,0,0,1-6.13,1.16,13.11,13.11,0,0,1-5.18-1.49A12.78,12.78,0,0,0,13.2,2,10.86,10.86,0,0,0,9,2.85V20a8.8,8.8,0,0,1,4.25-1.08,11.22,11.22,0,0,1,4.2,1.28,14.84,14.84,0,0,0,6,1.66,16.79,16.79,0,0,0,7-1.37,1,1,0,0,0,.55-.89V4.67A1,1,0,0,0,30.5,3.82Z"/>',
};
export const flagIconName = 'flag';
export const flagIcon: IconShapeTuple = [flagIconName, renderIcon(icon)];
```
|
```javascript
/*!
* # Semantic UI 2.2.7 - Accordion
* path_to_url
*
*
* Released under the MIT license
* path_to_url
*
*/
!function(e,n,t,i){"use strict";n="undefined"!=typeof n&&n.Math==Math?n:"undefined"!=typeof self&&self.Math==Math?self:Function("return this")(),e.fn.accordion=function(t){var o,a=e(this),s=(new Date).getTime(),r=[],c=arguments[0],l="string"==typeof c,u=[].slice.call(arguments,1);n.requestAnimationFrame||n.mozRequestAnimationFrame||n.webkitRequestAnimationFrame||n.msRequestAnimationFrame||function(e){setTimeout(e,0)};return a.each(function(){var d,g,f=e.isPlainObject(t)?e.extend(!0,{},e.fn.accordion.settings,t):e.extend({},e.fn.accordion.settings),m=f.className,p=f.namespace,h=f.selector,v=f.error,b="."+p,y="module-"+p,C=a.selector||"",O=e(this),x=O.find(h.title),F=O.find(h.content),A=this,T=O.data(y);g={initialize:function(){g.debug("Initializing",O),g.bind.events(),f.observeChanges&&g.observeChanges(),g.instantiate()},instantiate:function(){T=g,O.data(y,g)},destroy:function(){g.debug("Destroying previous instance",O),O.off(b).removeData(y)},refresh:function(){x=O.find(h.title),F=O.find(h.content)},observeChanges:function(){"MutationObserver"in n&&(d=new MutationObserver(function(e){g.debug("DOM tree modified, updating selector cache"),g.refresh()}),d.observe(A,{childList:!0,subtree:!0}),g.debug("Setting up mutation observer",d))},bind:{events:function(){g.debug("Binding delegated events"),O.on(f.on+b,h.trigger,g.event.click)}},event:{click:function(){g.toggle.call(this)}},toggle:function(n){var t=n!==i?"number"==typeof n?x.eq(n):e(n).closest(h.title):e(this).closest(h.title),o=t.next(F),a=o.hasClass(m.animating),s=o.hasClass(m.active),r=s&&!a,c=!s&&a;g.debug("Toggling visibility of content",t),r||c?f.collapsible?g.close.call(t):g.debug("Cannot close accordion content collapsing is disabled"):g.open.call(t)},open:function(n){var t=n!==i?"number"==typeof n?x.eq(n):e(n).closest(h.title):e(this).closest(h.title),o=t.next(F),a=o.hasClass(m.animating),s=o.hasClass(m.active),r=s||a;return r?void g.debug("Accordion already open, skipping",o):(g.debug("Opening accordion content",t),f.onOpening.call(o),f.exclusive&&g.closeOthers.call(t),t.addClass(m.active),o.stop(!0,!0).addClass(m.animating),f.animateChildren&&(e.fn.transition!==i&&O.transition("is supported")?o.children().transition({animation:"fade in",queue:!1,useFailSafe:!0,debug:f.debug,verbose:f.verbose,duration:f.duration}):o.children().stop(!0,!0).animate({opacity:1},f.duration,g.resetOpacity)),void o.slideDown(f.duration,f.easing,function(){o.removeClass(m.animating).addClass(m.active),g.reset.display.call(this),f.onOpen.call(this),f.onChange.call(this)}))},close:function(n){var t=n!==i?"number"==typeof n?x.eq(n):e(n).closest(h.title):e(this).closest(h.title),o=t.next(F),a=o.hasClass(m.animating),s=o.hasClass(m.active),r=!s&&a,c=s&&a;!s&&!r||c||(g.debug("Closing accordion content",o),f.onClosing.call(o),t.removeClass(m.active),o.stop(!0,!0).addClass(m.animating),f.animateChildren&&(e.fn.transition!==i&&O.transition("is supported")?o.children().transition({animation:"fade out",queue:!1,useFailSafe:!0,debug:f.debug,verbose:f.verbose,duration:f.duration}):o.children().stop(!0,!0).animate({opacity:0},f.duration,g.resetOpacity)),o.slideUp(f.duration,f.easing,function(){o.removeClass(m.animating).removeClass(m.active),g.reset.display.call(this),f.onClose.call(this),f.onChange.call(this)}))},closeOthers:function(n){var t,o,a,s=n!==i?x.eq(n):e(this).closest(h.title),r=s.parents(h.content).prev(h.title),c=s.closest(h.accordion),l=h.title+"."+m.active+":visible",u=h.content+"."+m.active+":visible";f.closeNested?(t=c.find(l).not(r),a=t.next(F)):(t=c.find(l).not(r),o=c.find(u).find(l).not(r),t=t.not(o),a=t.next(F)),t.length>0&&(g.debug("Exclusive enabled, closing other content",t),t.removeClass(m.active),a.removeClass(m.animating).stop(!0,!0),f.animateChildren&&(e.fn.transition!==i&&O.transition("is supported")?a.children().transition({animation:"fade out",useFailSafe:!0,debug:f.debug,verbose:f.verbose,duration:f.duration}):a.children().stop(!0,!0).animate({opacity:0},f.duration,g.resetOpacity)),a.slideUp(f.duration,f.easing,function(){e(this).removeClass(m.active),g.reset.display.call(this)}))},reset:{display:function(){g.verbose("Removing inline display from element",this),e(this).css("display",""),""===e(this).attr("style")&&e(this).attr("style","").removeAttr("style")},opacity:function(){g.verbose("Removing inline opacity from element",this),e(this).css("opacity",""),""===e(this).attr("style")&&e(this).attr("style","").removeAttr("style")}},setting:function(n,t){if(g.debug("Changing setting",n,t),e.isPlainObject(n))e.extend(!0,f,n);else{if(t===i)return f[n];e.isPlainObject(f[n])?e.extend(!0,f[n],t):f[n]=t}},internal:function(n,t){return g.debug("Changing internal",n,t),t===i?g[n]:void(e.isPlainObject(n)?e.extend(!0,g,n):g[n]=t)},debug:function(){!f.silent&&f.debug&&(f.performance?g.performance.log(arguments):(g.debug=Function.prototype.bind.call(console.info,console,f.name+":"),g.debug.apply(console,arguments)))},verbose:function(){!f.silent&&f.verbose&&f.debug&&(f.performance?g.performance.log(arguments):(g.verbose=Function.prototype.bind.call(console.info,console,f.name+":"),g.verbose.apply(console,arguments)))},error:function(){f.silent||(g.error=Function.prototype.bind.call(console.error,console,f.name+":"),g.error.apply(console,arguments))},performance:{log:function(e){var n,t,i;f.performance&&(n=(new Date).getTime(),i=s||n,t=n-i,s=n,r.push({Name:e[0],Arguments:[].slice.call(e,1)||"",Element:A,"Execution Time":t})),clearTimeout(g.performance.timer),g.performance.timer=setTimeout(g.performance.display,500)},display:function(){var n=f.name+":",t=0;s=!1,clearTimeout(g.performance.timer),e.each(r,function(e,n){t+=n["Execution Time"]}),n+=" "+t+"ms",C&&(n+=" '"+C+"'"),(console.group!==i||console.table!==i)&&r.length>0&&(console.groupCollapsed(n),console.table?console.table(r):e.each(r,function(e,n){console.log(n.Name+": "+n["Execution Time"]+"ms")}),console.groupEnd()),r=[]}},invoke:function(n,t,a){var s,r,c,l=T;return t=t||u,a=A||a,"string"==typeof n&&l!==i&&(n=n.split(/[\. ]/),s=n.length-1,e.each(n,function(t,o){var a=t!=s?o+n[t+1].charAt(0).toUpperCase()+n[t+1].slice(1):n;if(e.isPlainObject(l[a])&&t!=s)l=l[a];else{if(l[a]!==i)return r=l[a],!1;if(!e.isPlainObject(l[o])||t==s)return l[o]!==i?(r=l[o],!1):(g.error(v.method,n),!1);l=l[o]}})),e.isFunction(r)?c=r.apply(a,t):r!==i&&(c=r),e.isArray(o)?o.push(c):o!==i?o=[o,c]:c!==i&&(o=c),r}},l?(T===i&&g.initialize(),g.invoke(c)):(T!==i&&T.invoke("destroy"),g.initialize())}),o!==i?o:this},e.fn.accordion.settings={name:"Accordion",namespace:"accordion",silent:!1,debug:!1,verbose:!1,performance:!0,on:"click",observeChanges:!0,exclusive:!0,collapsible:!0,closeNested:!1,animateChildren:!0,duration:350,easing:"easeOutQuad",onOpening:function(){},onOpen:function(){},onClosing:function(){},onClose:function(){},onChange:function(){},error:{method:"The method you called is not defined"},className:{active:"active",animating:"animating"},selector:{accordion:".accordion",title:".title",trigger:".title",content:".content"}},e.extend(e.easing,{easeOutQuad:function(e,n,t,i,o){return-i*(n/=o)*(n-2)+t}})}(jQuery,window,document);
```
|
Parappadi is a village in the Elangulam panchayat, Tirunelveli district of Tamil Nadu, India.
Villages in Tirunelveli district
|
The following is a list of psychology and self-help podcasts that focus on popular psychology, meditation, and mindfulness.
List
See also
Self-help
Meditation
References
Psychology
Popular psychology works
|
```php
<?php
namespace Spatie\Tags\Test;
use Illuminate\Database\Schema\Blueprint;
use Illuminate\Support\Facades\Schema;
use Orchestra\Testbench\TestCase as Orchestra;
use Spatie\Tags\TagsServiceProvider;
abstract class TestCase extends Orchestra
{
protected function setUp(): void
{
parent::setUp();
$this->setUpDatabase($this->app);
}
protected function getPackageProviders($app)
{
return [
TagsServiceProvider::class,
];
}
/**
* @param \Illuminate\Foundation\Application $app
*/
protected function setUpDatabase($app)
{
Schema::dropAllTables();
$migration = include __DIR__.'/../database/migrations/create_tag_tables.php.stub';
$migration->up();
Schema::create('test_models', function (Blueprint $table) {
$table->increments('id');
$table->string('name')->nullable();
});
Schema::create('test_another_models', function (Blueprint $table) {
$table->increments('id');
$table->string('name')->nullable();
});
Schema::create('custom_tags', function (Blueprint $table) {
$table->id();
$table->json('name');
$table->json('slug');
$table->json('description')->nullable();
$table->string('type')->nullable();
$table->integer('order_column')->nullable();
$table->timestamps();
});
Schema::create('custom_tags_static_locale', function (Blueprint $table) {
$table->id();
$table->json('name');
$table->json('slug');
$table->string('type')->nullable();
$table->integer('order_column')->nullable();
$table->timestamps();
});
}
}
```
|
is a football (soccer) club based in Onagawa, the main and only city forming the Oshika District, which is located in Miyagi Prefecture in Japan. They play in the Tohoku Soccer League, which is part of Japanese Regional Leagues. The name Cobaltore comes from the combination of two Spanish words: cobalto, referring to cobalt blue, and floresta, meaning "forest".
History
Born in April 2006 and initially managed by former Japan NT member Nobuo Fujishima, the name of the club resembles the true nature of the region in Miyagi Prefecture and today Cobaltore is still one of the clubs aiming to J. League and professional football. It was founded by the local community, formed by people who wanted to stay in the city instead of leaving for Sendai or Tokyo. The club rapidly grew, climbing the Japanese football pyramid in five years.
The 2011 Tohoku earthquake was devastating both for the region and the club: Onagawa lost 1300 citizens, one tenth of the city's population, and the club's office was destroyed. However, all players escaped death and many of them became the core of the club.
Despite the strong shock and skipping the 2011 season due to damages and the impossibility of using their own stadium, which was used as a shelter, Cobaltore players - especially the Japanese - remained in town to give a hand to the city that hosted their careers. The group of Onagawa Supporters pushed back the club into the pitch and - for 2012 season - Cobaltore returned on the field.
Thanks to Fukushima United FC going to Japan Football League, Cobaltore joined Tohoku Soccer League first division for 2013 season. From then, Cobaltore is trying to reach JFL, aiming towards pro-football. They also won the division in 2016. After repeating the title in 2017 and winning the Regional Promotion Series, they were promoted to JFL but only lasted one season before going back down.
Current squad
Updated as of 23 August 2023.
League record
Honours
Regional Champions League
Champions (1): 2017
Tohoku Soccer League
Champions (4): 2016, 2017, 2021, 2022
Stadium
References
External links
Official Site (Japanese)
Official Facebook Page
Official Twitter Account
Academy's website
Onagawa Supporters' Twitter
Football clubs in Japan
Sports teams in Miyagi Prefecture
Onagawa, Miyagi
Association football clubs established in 2006
2006 establishments in Japan
Japan Football League clubs
|
Rebecca Leslie is a Canadian ice hockey forward, currently a member of the PWHPA.
Career
Across four seasons at Boston University, Leslie scored 171 points in 139 games, and captained the team in her final year. In 2018, she signed her first professional contract with the Calgary Inferno of the CWHL, with whom she won the Clarkson Cup, and was a finalist for rookie of the year. After the CWHL folded, she announced she would join the newly-formed PWHPA.
International
In 2014, Leslie put up 5 points in 5 games for the Canadian team that won the gold medal in the U18 IIHF Women's World Juniors. In 2019, she made her first senior appearance for Team Canada in the Rivalry Series.
Personal life
Her brother Zac Leslie also plays hockey professionally. Most of his career has been in the AHL.
References
External links
Biographical information and career statistics from Elite Prospects
1996 births
Living people
Ice hockey people from Ottawa
Canadian women's ice hockey forwards
Professional Women's Hockey Players Association players
Calgary Inferno players
Boston University Terriers women's ice hockey players
|
```objective-c
/*
FSearch - A fast file search utility
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
*/
#pragma once
#include <gtk/gtk.h>
#include <stdbool.h>
typedef void (*FsearchFileUtilsOpenCallback)(gboolean result, const char *error_message, gpointer user_data);
void
fsearch_file_utils_init_data_dir_path(char *path, size_t len);
bool
fsearch_file_utils_create_dir(const char *path);
bool
fsearch_file_utils_trash(const char *path, GString *error_messages);
bool
fsearch_file_utils_remove(const char *path, GString *error_messages);
void
fsearch_file_utils_open_path_list(GList *paths,
bool launch_desktop_files,
GAppLaunchContext *app_launch_context,
FsearchFileUtilsOpenCallback callback,
gpointer callback_data);
bool
fsearch_file_utils_open_path_list_with_command(GList *paths, const char *cmd, GString *error_message);
gchar *
fsearch_file_utils_get_file_type(const gchar *name, gboolean is_dir);
gchar *
fsearch_file_utils_get_file_type_non_localized(const char *name, gboolean is_dir);
GIcon *
fsearch_file_utils_get_icon_for_path(const char *path);
GIcon *
fsearch_file_utils_guess_icon(const char *name, const char *path, bool is_dir);
char *
fsearch_file_utils_get_size_formatted(off_t size, bool show_base_2_units);
bool
fsearch_file_utils_is_desktop_file(const char *path);
GIcon *
fsearch_file_utils_get_desktop_file_icon(const char *path);
char *
fsearch_file_utils_get_content_type(const char *path, GError **error);
GIcon *
fsearch_file_utils_get_thumbnail_icon(const char *path);
```
|
The Roman provinces (, pl. ) were the administrative regions of Ancient Rome outside Roman Italy that were controlled by the Romans under the Roman Republic and later the Roman Empire. Each province was ruled by a Roman appointed as governor.
For centuries it was the largest administrative unit of the foreign possessions of ancient Rome. With the administrative reform initiated by Diocletian, it became a third level administrative subdivision of the Roman Empire, or rather a subdivision of the imperial dioceses (in turn subdivisions of the imperial prefectures).
History
A province was the basic and, until the Tetrarchy (from AD 293), the largest territorial and administrative unit of the empire's territorial possessions outside Roman Italy.
During the republic and early empire, provinces were generally governed by politicians of senatorial rank, usually former consuls or former praetors. A later exception was the province of Egypt, which was incorporated by Augustus after the death of Cleopatra and was ruled by a governor of only equestrian rank, perhaps as a discouragement to senatorial ambition. That exception was unique but not contrary to Roman law, as Egypt was considered Augustus's personal property, following the tradition of the kings of the earlier Hellenistic period.
Republican period
The English word province comes from the Latin word provincia. The Latin term provincia had an equivalent in eastern, Greek-speaking parts of the Greco-Roman world. In the Greek language, a province was called an eparchy (, eparchia), with a governor called an eparch (, eparchos).
Emergence
The Latin , during the middle republic, referred not to a territory, but to a task assigned to a Roman magistrate. That task might require using the military command powers of imperium but otherwise could even be a task assigned to a junior magistrates without imperium: for example, the treasury was the of a quaestor and the civil jurisdiction of the urban praetor was the . In the middle and late republican authors like Plautus, Terence, and Cicero, the word referred something akin to a modern ministerial portfolio: "when... the senate assigned to the various magistrates... what they were doing was more like allocating a portfolio than putting people in charge of geographic areas".
The first commanders dispatched with were for the purpose of waging war and to command an army. However, merely that a provincia was assigned did not mean the Romans made that territory theirs. For example, Publius Sulpicius Galba Maximus in 211 BC received Macedonia as his provincia but the republic did not annex the kingdom, even as Macedonia was continuously assigned until 205 BC with the end of the First Macedonian war. Even though the Second and Third Macedonian wars saw the Macedonian province revived, the senate settled affairs in the region by abolishing Macedonia and replacing it with four client republics. Macedonia only came under direct Roman administration in the aftermath of the Fourth Macedonian war in 148 BC. Similarly, assignment of various in Hispania was not accompanied by the creation of any regular administration of the area; indeed, even though two praetors were assigned to Hispania regularly from 196 BC, no systematic settlement of the region occurred for nearly thirty years and what administration occurred was ad hoc and emerged from military necessities.
In the middle republic, the administration of a territory – whether taxation or jurisdictrion – had basically no relationship with whether that place was assigned as a provincia by the senate. Rome would even intervene on territorial disputes which were part of no provincia at all and were not administered by Rome. The territorial province, called a "permanent" provincia in the scholarship, emerged only gradually.
Permanent provincia
The acquisition of territories, however, through the middle republic created the recurrent task of defending and administering some place. The first "permanent" was that of Sicily, created after the First Punic War. In the immediate aftermath, a quaestor was sent to Sicily to look out for Roman interests but eventually, praetors were dispatched as well. The sources differ as to when sending a praetor became normal: Appian reports 241 BC; Solinus indicates 227 BC instead. Regardless, the change likely reflected Roman unease about Carthaginian power: quaestors could not command armies or fleets; praetors could and initially seem to have held largely garrison duties. This first province started a permanent shift in Roman thinking about . Instead of being a task of military expansion, it became a recurrent defensive assignment to oversee conquered territories. These defensive assignments, with few opportunities to gain glory, were less desirable and therefore became regularly assigned to the praetors.
Only around 180 BC did provinces take on a more geographically-defined position when a border was established to separate the two commanders assigned to Hispania on the river Baetis. Later provinces, once campaigns were complete, were all largely defined geographically. Once this division of permanent and temporary emerged, magistrates assigned to permanent provinces also came under pressures to achieve as much as possible during their terms. Whenever a military crisis occurred near some province, it was normally reassigned to one of the consuls; praetors were left with the garrison duties. In the permanent provinces, the Roman commanders were initially not intended as administrators. However, the presence of the commander with forces sufficient to coerce compliance made him an obvious place to seek final judgement. A governor's legal jurisdiction thus grew from the demands of the provincial inhabitants for authoritative settlement of disputes.
In the absence of opportunities for conquest and with little oversight for their activities, many praetorian governors settled on extorting the provincials. This profiteering threatened Roman control by unnecessarily angering the province's subject populations and was regardless dishonourable. It eventually drew a reaction from the senate, which reacted with laws to rein in the governors. After initial experimentation with ad hoc panels of inquest, various laws were passed, such as the lex Calpurnia de repetundis in 149 BC, which established a permanent court to try corruption cases; troubles with corruption and laws reacting to it continued through the republican era. By the end of the republic, a multitude of laws had been passed on how a governor would complete his task, requiring presence in the province, regulating how he could requisition goods from provincial communities, limiting the number of years he could serve in the province, etc.
Assignment
Prior to 123 BC, the senate assigned consular provinces as it wished, usually in its first meeting of the consular year. The specific provinces to be assigned were normally determined by lot or by mutual agreement among the commanders; only extraordinarily did the senate assign a command (outside of sortition). But in 123 or 122 BC, the tribune Gaius Sempronius Gracchus passed the lex Sempronia de provinciis consularibus, which required the senate to select the consular provinces before the consular elections and made this announcement immune from tribunician veto. The law had the effect of, over time, abolishing the temporary , as it was not always realistic for the senate to anticipate the theatres of war some six months in advance. Instead, the senate chose to assign consuls to permanent provinces near expected trouble spots. From 200 to 124 BC, only 22 per cent of recorded consular were permanent provinces; between 122 and 53 BC, this rose to 60 per cent.
While many of the provinces had been assigned to sitting praetors in the earlier part of the second century, with new praetorships created to fill empty provincial commands, by the start of the first century it had become uncommon for praetors to hold provincial commands during their formal annual term. Instead they generally took command as promagistrate after the end of their term. The use of prorogation was due to an insufficient number of praetors, which was for two reasons: more provinces needed commands and the increased number of permanent jury courts (quaestiones perpetuae), each of which had a praetor as president, exacerbated this issue. Praetors during the second century were normally prorogued pro praetore, but starting with the Spanish provinces and expanding by 167 BC, praetors were more commonly prorogued with the augmented rank pro consule; by the end of the republic, all governors acted pro consule.
Also important was the assertion of popular authority over the assignment of provincial commands. This started with Gaius Marius, who had an allied tribune introduce a law transferring to him the already-taken province of Numidia (then held by Quintus Caecilius Metellus), allowing Marius to assume command of the Jugurthine War. This innovation destabilised the system of assigning provincial commands, exacerbated internal political tensions, and later allowed ambitious politicians to assemble for themselves enormous commands which the senate would never have approved: the Pompeian lex Gabinia of 67 BC granted Pompey all land within 50 miles of the Mediterranean; Caesar's Gallic command that encompassed three normal provinces.
Late Republican period
In the late Republican period, Roman authorities generally preferred that a majority of people in Rome's provinces venerated, respected, and worshipped gods from Rome proper and Roman Italy to an extent, alongside normal services done in honor of their "traditional" gods.
Transition to empire
The increasing practices of prorogation and statutorily-defined "super commands" driven by political tactics undermined the republican constitutional principle of annually-elected magistracies. This allowed the powerful men to amass disproportionate wealth and military power through their provincial commands, which was one of the major factors in the transition from a republic to an imperial autocracy.
The senate attempted to push back against these commands in many instances: it preferred to break up any large war into multiple territorially separated commands; for similar reasons, it opposed the lex Gabinia which gave Pompey an overlapping command over large portions of the Mediterranean. The senate, which had long acted as a check on aristocratic ambitions, was unable to stop these immense commands, which culminated eventually with the reduction of the number of meaningfully-independent governors during the triumviral period to three men and, with the end of the republic, to one man.
Early imperial period
During his sixth and seventh consulships (28 and 27 BC), Augustus began a process which saw the republic return to "normality": he shared the fasces that year with his consular colleague month-by-month and announced the abolition of the triumvirate by the end of the year in accordance with promises to do so at the close of the civil wars. At the start of 27 BC, Augustus formally had a provincial command over all of Rome's provinces. That year, in his "first settlement", he ostentatiously returned his control of them and their attached armies to the senate, likely by declaring that the task assigned to him either by the lex Titia creating the Triumvirate or that the war on Cleopatra and Antony was complete. In return, at a carefully-managed meeting of the senate, he was given commands over Spain, Gaul, Syria, Cilicia, Cyprus, and Egypt to hold for ten years; these provinces contained 22 of the 28 extant Roman legions (over 80 per cent) and contained all prospective military theatres.
The provinces that were assigned to Augustus became known as imperial provinces and the remaining provinces, largely demilitarised and confined to the older republican conquests, became known as public or senatorial provinces, as their commanders were still assigned by the senate on an annual basis consistent with tradition. Because no one man could command in practically all the border-regions of the empire at once, Augustus appointed subordinate legates for each of the provinces with the title legatus Augusti pro praetore. These lieutenant legati probably held imperium but, due to their lack of an independent command, were unable to triumph and could be replaced by their superior (Augustus) at any time. These arrangements were likely based on the precedent of Pompey's proconsulship over the Spanish provinces after 55 BC entirely through legates, while he stayed in the vicinity of Rome. In contrast, the public provinces continued to be governed by proconsuls with formally independent commands. In only three of the public provinces were there any armies: Africa, Illyricum, and Macedonia; after Augustus' Balkan wars, only Africa retained a legion.
To make this monopolisation of military commands palatable, Augustus separated prestige from military importance and inverted it. The title pro praetore had gone out of use by the end of the republic and was regardless in inferior status to a proconsul. More radically, Egypt (which was sufficiently powerful that a commander there could start a rebellion against the emperor) was commanded by a equestrian prefect, "a very low title indeed" as prefects were normally low-ranking officers and equestrians were not normally part of the elite. In Augustus' "second settlement" of 23 BC, he gave up his continual holding of the consulship in exchange for a general proconsulship – with a special dispensation from the law that nullified imperium within the city of Rome – over the imperial provinces. He also gave himself, through the senate, a general grant of imperium maius, which gave him priority over the ordinary governors of the public provinces, allowing him to interfere in their affairs.
Within the public and imperial provinces there also existed distinctions of rank. In the public provinces, the provinces of Africa and Asia were given only to ex-consuls; ex-praetors received the others. The imperial provinces eventually produced a three-tier system with prefects and procurators, legates pro praetore who were ex-praetors, and legates pro praetore who were ex-consuls. The public provinces' governors normally served only one year; the imperial provinces' governors on the other hand normally served several years before rotating out. The extent to which the emperor exercised control over all the provinces increased during the imperial period: Tiberius, for example, once reprimanded legates in the imperial provinces for failing to forward financial reports to the senate; by the reign of Claudius, however, the senatorial provinces' proconsuls were regularly issued with orders directly from the emperor.
Late imperial period
The emperor Diocletian introduced a radical reform known as the tetrarchy (AD 284–305), with a western and an eastern senior emperor styled Augustus, each seconded by a junior emperor (and designated successor) styled caesar. Each of these four defended and administered a quarter of the empire. In the 290s, Diocletian divided the empire anew into almost a hundred provinces, including Roman Italy. Their governors were hierarchically ranked, from the proconsuls of Africa Proconsularis and Asia through those governed by consulares and correctores to the praesides. The provinces in turn were grouped into (originally twelve) dioceses, headed usually by a vicarius, who oversaw their affairs. Only the proconsuls and the urban prefect of Rome (and later Constantinople) were exempt from this, and were directly subordinated to the tetrarchs.
Although the Caesars were soon eliminated from the picture, the four administrative resorts were restored in 318 by Emperor Constantine I, in the form of praetorian prefectures, whose holders generally rotated frequently, as in the usual magistracies but without a colleague. Constantine also created a new capital, named after him as Constantinople, which was sometimes called 'New Rome' because it became the permanent seat of the government. In Italy itself, Rome had not been the imperial residence for some time and 286 Diocletian formally moved the seat of government to Mediolanum (modern Milan), while taking up residence himself in Nicomedia. During the 4th century, the administrative structure was modified several times, including repeated experiments with Eastern-Western co-emperors.
Detailed information on the arrangements during this period is contained in the Notitia Dignitatum (Record of Offices), a document dating from the early 5th century. Most data is drawn from this authentic imperial source, as the names of the areas governed and titles of the governors are given there. There are however debates about the source of some data recorded in the , and it seems clear that some of its own sources are earlier than others. Some scholars compare this with the list of military territories under the duces, in charge of border garrisons on so-called limites, and the higher ranking , with more mobile forces, and the later, even higher magistri militum.
Justinian I made the next great changes in 534–536 by abolishing, in some provinces, the strict separation of civil and military authority that Diocletian had established.This process was continued on a larger scale with the creation of extraordinary Exarchates in the 580s and culminated with the adoption of the military theme system in the 640s, which replaced the older administrative arrangements entirely. Some scholars use the reorganization of the empire into themata in this period as one of the demarcations between the Dominate and the Byzantine (or the Later Roman) period.
List of provinces
Republican provinces
241 BC – Sicilia (Sicily) taken over from the Carthaginians and annexed at the end of the First Punic War
237 BC – Sardinia and Corsica; these two islands were taken over from the Carthaginians and annexed soon after the Mercenary War, in 238 BC and 237 BC respectively
197 BC – Hispania Citerior; along the east coast of the Iberian Peninsula; part of the territories taken over from the Carthaginians
197 BC – Hispania Ulterior; along the southern coast of the Iberian Peninsula; part of the territories taken over from the Carthaginians in the Second Punic War
147 BC – Macedonia was annexed after the Achaean War
146 BC – Africa (modern-day Tunisia, eastern Algeria and western Libya); created after the destruction of Carthage in the Third Punic War
129 BC – Asia, formerly the Attalid kingdom, in western Anatolia (now in Turkey), bequeathed to Rome by its last king, Attalus III, in 133 BC.
120 BC – Gallia Narbonensis (southern France); prior to its annexation it was called Gallia Transalpina (Gallia on the other side of the Alps) to distinguish it from Gallia Cisalpina (Gaul on this same side of the Alps, in northern Italy). It was annexed following attacks on the allied Greek city of Massalia (Marseille).
67 BC – Crete and Cyrenaica; Cyrenaica was bequeathed to Rome in 78 BC. However, it was not organised as a province. It was incorporated into the province of Creta et Cyrenae when Crete was annexed in 67 BC.
63 BC – Bithynia et Pontus; the Kingdom of Bithynia (in North-western Anatolia) was bequeathed to Rome by its last king, Nicomedes IV, in 74 BC. It was organised as a Roman province at the end of the Third Mithridatic War (73–63 BC) by Pompey, who incorporated the western part of the defeated Kingdom of Pontus into it in 63 BC.
63 BC – Syria; Pompey deposed the last Seleucid king Philip II Philoromaeus, creating the province of Syria.
63 BC – Cilicia; Cilicia was created as a province in the sense of area of military command in 102 BC in a campaign against piracy. The Romans controlled only a small area. In 74 BC Lycia and Pamphylia (to the east) were added to the small Roman possessions in Cilicia. Cilicia came fully under Roman control at the end of the Third Mithridatic War (73–63 BC), reorganised by Pompey in 63 BC.
58 BC – Cyprus was annexed after the death of its last king Ptolemy of Cyprus and added to the province of Cilicia, creating the province of Cilicia et Cyprus.
46 BC – Africa Nova (Eastern Numidia – Algeria), Julius Caesar annexed Eastern Numidia and the new province called Africa Nova (new Africa) to distinguish it from the older province of Africa, created in 146 BC, which became known as Africa Vetus (old Africa). Western Numidia was annexed and added to the province of Africa Nova in 40 BC. The territory remained the direct part of the Roman Empire except for a brief period when Augustus restored Juba II (son of Juba I) as a client king (30–25 BC).
Cisalpine Gaul (in northern Italy) was occupied by Rome in the 220s BC and became considered geographically and de facto part of Roman Italy, but remained politically and de jure separated. It was legally merged into the administrative unit of Roman Italy in 42 BC by the triumvir Augustus as a ratification of Caesar's unpublished acts (Acta Caesaris).
Provinces of the Principate
Under Augustus
30 BC – Aegyptus, taken over by Augustus after his defeat of Mark Antony and Cleopatra VII in 30 BC. It was the first imperial province in that it was Augustus' own domain as the Egyptians recognised him as their new pharaoh. Its proper initial name was Alexandrea et Aegyptus. It was governed by Augustus' praefectus, Alexandreae et Aegypti.
27 BC – Achaia (southern and central Greece), Augustus separated it from Macedonia (senatorial propraetorial province)
27 BC – Hispania Tarraconensis; former Hispania Citerior (northern, central and eastern Spain), created with the reorganisation of the provinces in Hispania by Augustus (imperial proconsular province).
27 BC – Lusitania (Portugal and Extremadura in Spain), created with the reorganisation of the provinces in Hispania by Augustus (imperial proconsular province)
27 BC – Illyricum, Augustus conquered Illyria and southern Pannonia in 35–33 BC. Created as a senatorial province in 27 BC. Northern Pannonia was conquered during the Pannonian War (14–10 BC). Subdivided into Dalmatia (a new name for Illyria) and Pannonia, which were officially called Upper and Lower Illyricum respectively in 9 BC, towards the end of the Batonian War. Initially a senatorial province, it became an imperial propraetorial province in 11 BC, during the Pannonian War. It was dissolved and the new provinces of Dalmatia and Pannonia were created during the reign of Vespasian (69–79). In 107, Pannonia was divided into Pannonia Superior and Pannonia Inferior – imperial provinces (proconsular and propraetorial respectively).
27 BC or 16–13 BC – Aquitania (south-western France) province created in the territories in Gaul conquered by Julius Caesar; there is uncertainty as to whether it was created with Augustus’ first visit and the first census on Gaul or during Augustus' visit in 16–13 (imperial proconsular province)
27 BC or 16–13 BC – Gallia Lugdunensis (central and part of northern France) province created in the territories in Gaul conquered by Julius Caesar; there is uncertainty as to whether it was created with Augustus’ first visit and the first census on Gaul or during Augustus’ visit in 16–13 (imperial proconsular province)
25 BC – Galatia (central Anatolia, Turkey), formerly a client kingdom, it was annexed by Augustus when Amyntas, its last king, died (imperial propraetorial province)
25 BC – Africa Proconsularis. The client kingdom of Numidia under king Juba II (30 - 25 BC), previously between 46 - 30 BC the province Africa Nova, was abolished, and merged with the province Africa Vetus, creating the province Africa Proconsularis (except territory of Western Numidia).
22 BC – Gallia Belgica (Netherlands south of the Rhine river, Belgium, Luxembourg, part of northern France and Germany west of the Rhine; there is uncertainty as to whether it was created with Augustus’ first visit and the first census on Gaul or during Augustus' visit in 16–13 (imperial proconsular province)
15 BC – Raetia (imperial procuratorial province)
14 BC – Hispania Baetica; former Hispania Ulterior (southern Spain); created with the reorganisation of the provinces in Hispania by Augustus (senatorial propraetorial province). The name derives from Betis, the Latin name for the Guadalquivir River.
7 BC – Germania Antiqua, lost after three Roman legions were routed in 9 AD
AD 6? – Moesia (on the east and south bank of the River Danube part of modern Serbia, the north part of North Macedonia, northern Bulgaria), Conquered in 28 BC, originally it was a military district under the province of Macedonia. The first mention of a provincial governor was for 6 AD, at the beginning of the Batonian War. In 85 Moesia was divided into Moesia Superior and Moesia Inferior (imperial proconsular provinces).
AD 6 – Judaea, imperial procuratorial province, created after the deposition of ethnarch Herod Archelaus, formed initially from the territory of Samaria, Judea, and Idumea. Reverted to the status of client kingdom under king Herod Agrippa in AD 41 by Claudius and became province again after Agrippa's death in AD 44, enlarged by territories of Galilee and Peraea; renamed Syria Palaestina by Hadrian in AD 135 and upgraded to proconsular province.
Under Tiberius
AD 17 – Cappadocia (central Anatolia – Turkey); imperial propraetorial (later proconsular) province, created after the death of its last client king Archelaus.
Under Claudius
AD 42 – Mauretania Tingitana (northern Morocco); after the death of Ptolemy, the last king of Mauretania, in AD 40, his kingdom was annexed. It was begun by Caligula and was completed by Claudius with the defeat of the rebels. In AD 42, Claudius divided it into two provinces (imperial procuratorial province).
AD 42 – Mauretania Caesariensis, (western and central Algeria), after the death of Ptolemy, the last king of Mauretania, in AD 40, his kingdom was annexed. It was begun by Caligula and was completed by Claudius with the defeat of the rebels. In AD 42 Claudius divided it into two provinces( imperial procuratorial province).
AD 41/53 – Noricum (central Austria, north-eastern Slovenia and part of Bavaria), it was incorporated into the empire in 16 BC. It was called a province, but it remained a client kingdom under the control of an imperial procurator. It was turned into a proper province during the reign of Claudius (41–54) (imperial propraetorial province).
AD 43 – Britannia; Claudius initiated the invasion of Britannia. Up to AD 60, the Romans controlled the area south of a line from the River Humber to the Severn Estuary. Wales was finally subdued in 78. In 78–84 Agricola conquered the north of England and Scotland. Scotland was then abandoned (imperial proconsular province). In 197 Septimius Severus divided Britannia into Britannia Superior and Britannia Inferior. Imperial provinces (proconsular and propraetorial respectively).
AD 43 – Lycia annexed by Claudius (in 74 AD merged with Pamphylia to form Lycia et Pamphylia).
AD 46 – Thracia (Thrace, north-eastern Greece, south-eastern Bulgaria and European Turkey), it was annexed by Claudius (imperial procuratorial province).
AD 47? – Alpes Atrectianae et Poeninae (between Italy and Switzerland), Augustus subdued its inhabitants, the Salassi, in 15 BC. It was incorporated into Raetia. The date of the creation of the province is uncertain. It is usually set at the date of Claudius' foundation of Forum Claudii Vallensium (Martigny), which became its capital (imperial procuratorial province).
Under Nero
AD 62 – Pontus (the eastern half of the Kingdom of Pontus) together with Colchis annexed, later incorporated in the Province of Cappadocia (probably under Emperor Trajan).
AD 63 – Bosporan Kingdom incorporated as part of the Roman province of Moesia Inferior. In 68 AD Galba restored the Bosporan Kingdom as a client kingdom.
AD 63? – Alpes Maritimae (on the French Alps), created as a protectorate by Augustus, it probably became a province under Nero when Alpes Cottiae became a province (imperial procuratorial province)
AD 63 – Alpes Cottiae (between France and Italy), in 14 BC it became a nominal prefecture which was run by the ruling dynasty of the Cotii. It was named after the king, Marcus Julius Cottius. It became a province in 63 (imperial procuratorial province).
Under Vespasian
AD 72 – Commagene, its last client king Antiochus IV was deposed and Commagene was annexed to Syria.
AD 72 – Lesser Armenia, its last client king Aristobulus of Chalcis was deposed and Lesser Armenia was annexed to Syria.
AD 72 – Western mountainous parts of Cilicia, formed into three client kingdoms established by Augustus, were disestablished, and merged with the imperial province of Cilicia.
AD 74 – Lycia et Pamphylia. Vespasian (reigned AD 69–79) merged Lycia, annexed by Claudius, and Pamphylia which had been a part of the province of Galatia.
Under Domitian
AD 83/84 – Germania Superior (southern Germany) The push into southern Germany up to the Agri Decumates by Domitian created the necessity to create this province, which had been a military district in Gallia Belgica when it was restricted to the west bank of the River Rhine (imperial proconsular province).
AD 83/84 – Germania Inferior (Netherlands south of the River Rhine, part of Belgium, and part of Germany west of the Rhine) originally a military district under Gallia Belgica, created when Germania Superior was created (imperial proconsular province).
AD 92 – Chalcis was annexed to Syria after the death of its last ruler, tetrarch Aristobulus of Chalcis.
Under Trajan
AD 100 – Territories of Iturea, Trachonitis, Batanea, Gaulanitis, Auranitis and Paneas were annexed to Syria after the death of king Herod Agrippa II.
AD 106 – Arabia, formerly the Kingdom of Nabataea, it was annexed without resistance by Trajan (imperial propraetorial province)
AD 107 – Dacia "Trajana" (the Romanian regions of south-eastern Transylvania, the Banat, and Oltenia), conquered by Trajan in the Dacian Wars (imperial proconsular province). Divided into Dacia Superior and Dacia Inferior in 158 by Antoninus Pius. Divided into three provinces (Tres Daciae) in 166 by Marcus Aurelius: Porolissensis, Apulensis and Malvensis (imperial procuratorial provinces). Abandoned by Aurelian in 271.
AD 103/114 - Epirus Nova (in western Greece and southern Albania), Epirus was originally under the province of Macedonia. It was placed under Achaia in 27 BC except for its northernmost part, which remained part of Macedonia. It became a separate province under Trajan, sometime between 103 and 114 AD, and was renamed Epirus Nova (New Epirus) (imperial procuratorial province).
AD 114 – Armenia, annexed by Trajan, who deposed its client king. In 118 Hadrian restored this client kingdom
AD 116 – Mesopotamia (Iraq) seized from the Parthians and annexed by Trajan, who invaded the Parthian Empire in late 115. Given back to the Parthians by Hadrian in 118. In 198 Septimius Severus conquered a small area in the north and named it Mesopotamia. It was attacked twice by the Persians (imperial praefectorial province).
AD 116 – Assyria, Trajan suppressed a revolt by Assyrians in Mesopotamia and created the province. Hadrian relinquished it in 118.
Under Septimius Severus
AD 193 – Numidia, was separated from Africa Proconsularis by Septimius Severus (imperial propraetorial province).
AD 194 – Syria Coele and Syria Phoenice, Septimius Severus divided Syria into these two units in the north and the south respectively. Imperial provinces (proconsular and propraetorial respectively).
Under Caracalla
AD 214 – Osrhoene, this kingdom (in northern Mesopotamia, in parts of today's Iraq, Syria and Turkey) was annexed.
Under Aurelian
AD 271 – Dacia Aureliana (most of Bulgaria and Serbia) created by Aurelian in the territory of the former Moesia Superior after his evacuation of Dacia Trajana beyond the River Danube.
Many of the above provinces were under Roman military control or under the rule of Roman clients for a long time before being officially constituted as civil provinces. Only the date of the official formation of the province is marked above, not the date of conquest.
Provinces of the late empire
Primary sources for lists of provinces
Early Roman Empire provinces
Germania (ca. 100)
Geography (Ptolemy) (ca. 140)
Late Roman Empire provinces
Laterculus Veronensis (ca. 310)
Notitia dignitatum (ca. 400–420)
Laterculus Polemii Silvii (ca. 430)
Synecdemus (ca. 520)
See also
Ancient geography
Classical antiquity
Early world maps
Ecumene
Geography
History of cartography
History of the Mediterranean region
Latin spelling and pronunciation
List of Graeco-Roman geographers
List of historical maps
Local government (ancient Roman)
References
Citations
Sources
Modern sources
Other sources
External links
Map of the Roman Empire in the year 300
https://web.archive.org/web/20060409205643/http://www.ancientlibrary.com/smith-dgra/
Historical regions
Provinces
|
```objective-c
#pragma once
#include <DataTypes/Serializations/ISerialization.h>
namespace DB
{
class SerializationNullable : public ISerialization
{
private:
SerializationPtr nested;
public:
explicit SerializationNullable(const SerializationPtr & nested_) : nested(nested_) {}
void enumerateStreams(
EnumerateStreamsSettings & settings,
const StreamCallback & callback,
const SubstreamData & data) const override;
void serializeBinaryBulkStatePrefix(
const IColumn & column,
SerializeBinaryBulkSettings & settings,
SerializeBinaryBulkStatePtr & state) const override;
void serializeBinaryBulkStateSuffix(
SerializeBinaryBulkSettings & settings,
SerializeBinaryBulkStatePtr & state) const override;
void deserializeBinaryBulkStatePrefix(
DeserializeBinaryBulkSettings & settings,
DeserializeBinaryBulkStatePtr & state,
SubstreamsDeserializeStatesCache * cache) const override;
void serializeBinaryBulkWithMultipleStreams(
const IColumn & column,
size_t offset,
size_t limit,
SerializeBinaryBulkSettings & settings,
SerializeBinaryBulkStatePtr & state) const override;
void deserializeBinaryBulkWithMultipleStreams(
ColumnPtr & column,
size_t limit,
DeserializeBinaryBulkSettings & settings,
DeserializeBinaryBulkStatePtr & state,
SubstreamsCache * cache) const override;
void serializeBinary(const Field & field, WriteBuffer & ostr, const FormatSettings & settings) const override;
void deserializeBinary(Field & field, ReadBuffer & istr, const FormatSettings & settings) const override;
void serializeBinary(const IColumn & column, size_t row_num, WriteBuffer & ostr, const FormatSettings & settings) const override;
void deserializeBinary(IColumn & column, ReadBuffer & istr, const FormatSettings & settings) const override;
void serializeTextEscaped(const IColumn & column, size_t row_num, WriteBuffer & ostr, const FormatSettings &) const override;
void deserializeTextEscaped(IColumn & column, ReadBuffer & istr, const FormatSettings &) const override;
bool tryDeserializeTextEscaped(IColumn & column, ReadBuffer & istr, const FormatSettings &) const override;
void serializeTextQuoted(const IColumn & column, size_t row_num, WriteBuffer & ostr, const FormatSettings &) const override;
void deserializeTextQuoted(IColumn & column, ReadBuffer & istr, const FormatSettings &) const override;
bool tryDeserializeTextQuoted(IColumn & column, ReadBuffer & istr, const FormatSettings &) const override;
void deserializeWholeText(IColumn & column, ReadBuffer & istr, const FormatSettings &) const override;
bool tryDeserializeWholeText(IColumn & column, ReadBuffer & istr, const FormatSettings &) const override;
void serializeTextCSV(const IColumn & column, size_t row_num, WriteBuffer & ostr, const FormatSettings &) const override;
/** It is questionable, how NULL values could be represented in CSV. There are three variants:
* 1. \N
* 2. empty string (without quotes)
* 3. NULL
* We support all of them (however, second variant is supported by CSVRowInputFormat, not by deserializeTextCSV).
* (see also input_format_defaults_for_omitted_fields and input_format_csv_unquoted_null_literal_as_null settings)
* In CSV, non-NULL string value, starting with \N characters, must be placed in quotes, to avoid ambiguity.
*/
void deserializeTextCSV(IColumn & column, ReadBuffer & istr, const FormatSettings & settings) const override;
bool tryDeserializeTextCSV(IColumn & column, ReadBuffer & istr, const FormatSettings & settings) const override;
void serializeTextJSON(const IColumn & column, size_t row_num, WriteBuffer & ostr, const FormatSettings &) const override;
void deserializeTextJSON(IColumn & column, ReadBuffer & istr, const FormatSettings &) const override;
bool tryDeserializeTextJSON(IColumn & column, ReadBuffer & istr, const FormatSettings &) const override;
void serializeText(const IColumn & column, size_t row_num, WriteBuffer & ostr, const FormatSettings &) const override;
void serializeTextXML(const IColumn & column, size_t row_num, WriteBuffer & ostr, const FormatSettings &) const override;
void deserializeTextRaw(IColumn & column, ReadBuffer & istr, const FormatSettings & settings) const override;
bool tryDeserializeTextRaw(IColumn & column, ReadBuffer & istr, const FormatSettings & settings) const override;
void serializeTextRaw(const IColumn & column, size_t row_num, WriteBuffer & ostr, const FormatSettings & settings) const override;
/// If Check for NULL and deserialize value into non-nullable column (and return true) or insert default value of nested type (and return false)
static bool deserializeNullAsDefaultOrNestedWholeText(IColumn & nested_column, ReadBuffer & istr, const FormatSettings & settings, const SerializationPtr & nested_serialization);
static bool deserializeNullAsDefaultOrNestedTextEscaped(IColumn & nested_column, ReadBuffer & istr, const FormatSettings & settings, const SerializationPtr & nested_serialization);
static bool deserializeNullAsDefaultOrNestedTextQuoted(IColumn & nested_column, ReadBuffer & istr, const FormatSettings &, const SerializationPtr & nested_serialization);
static bool deserializeNullAsDefaultOrNestedTextCSV(IColumn & nested_column, ReadBuffer & istr, const FormatSettings & settings, const SerializationPtr & nested_serialization);
static bool deserializeNullAsDefaultOrNestedTextJSON(IColumn & nested_column, ReadBuffer & istr, const FormatSettings &, const SerializationPtr & nested_serialization);
static bool deserializeNullAsDefaultOrNestedTextRaw(IColumn & nested_column, ReadBuffer & istr, const FormatSettings & settings, const SerializationPtr & nested_serialization);
/// If Check for NULL and deserialize value into non-nullable column or insert default value of nested type.
/// Return true if parsing was successful and false in case of any error.
static bool tryDeserializeNullAsDefaultOrNestedWholeText(IColumn & nested_column, ReadBuffer & istr, const FormatSettings & settings, const SerializationPtr & nested_serialization);
static bool tryDeserializeNullAsDefaultOrNestedTextEscaped(IColumn & nested_column, ReadBuffer & istr, const FormatSettings & settings, const SerializationPtr & nested_serialization);
static bool tryDeserializeNullAsDefaultOrNestedTextQuoted(IColumn & nested_column, ReadBuffer & istr, const FormatSettings &, const SerializationPtr & nested_serialization);
static bool tryDeserializeNullAsDefaultOrNestedTextCSV(IColumn & nested_column, ReadBuffer & istr, const FormatSettings & settings, const SerializationPtr & nested_serialization);
static bool tryDeserializeNullAsDefaultOrNestedTextJSON(IColumn & nested_column, ReadBuffer & istr, const FormatSettings &, const SerializationPtr & nested_serialization);
static bool tryDeserializeNullAsDefaultOrNestedTextRaw(IColumn & nested_column, ReadBuffer & istr, const FormatSettings & settings, const SerializationPtr & nested_serialization);
static void serializeNullEscaped(WriteBuffer & ostr, const FormatSettings & settings);
static bool tryDeserializeNullEscaped(ReadBuffer & istr, const FormatSettings & settings);
static void serializeNullQuoted(WriteBuffer & ostr);
static bool tryDeserializeNullQuoted(ReadBuffer & istr);
static void serializeNullCSV(WriteBuffer & ostr, const FormatSettings & settings);
static bool tryDeserializeNullCSV(ReadBuffer & istr, const FormatSettings & settings);
static void serializeNullJSON(WriteBuffer & ostr);
static bool tryDeserializeNullJSON(ReadBuffer & istr);
static void serializeNullRaw(WriteBuffer & ostr, const FormatSettings & settings);
static bool tryDeserializeNullRaw(ReadBuffer & istr, const FormatSettings & settings);
static void serializeNullText(WriteBuffer & ostr, const FormatSettings & settings);
static bool tryDeserializeNullText(ReadBuffer & istr);
static void serializeNullXML(WriteBuffer & ostr);
private:
struct SubcolumnCreator : public ISubcolumnCreator
{
const ColumnPtr null_map;
explicit SubcolumnCreator(const ColumnPtr & null_map_) : null_map(null_map_) {}
DataTypePtr create(const DataTypePtr & prev) const override;
SerializationPtr create(const SerializationPtr & prev) const override;
ColumnPtr create(const ColumnPtr & prev) const override;
};
};
}
```
|
Angous (; ) is a commune in the Pyrénées-Atlantiques department in the Nouvelle-Aquitaine region of southwestern France.
The inhabitants of the commune are known as Angousiens or Angousiennes
Geography
Angous is located some 5 km south-west of Navarrenx and 12 km north-east of Mauléon-Licharre. It can be accessed by the D2 road which runs from Navarrenx and forms the south-eastern border of the commune before continuing to Moncayolle-Larrory-Mendibieu. Access to the village is by the D69 road which runs off the D2 to the village. The commune consists of mainly farmland with patches of forest.
Located on the watershed of the Adour, the Serrot, a tributary of the Lausset, with many tributaries flows through the commune from south-west to north-east passing near the village. The Ruisseau de Lassere with many tributaries also flows from the south-west towards the northeast to the east of the village and forms part of the eastern border.
Places and Hamlets
Beigbédé
Bestit
Bois de Carrié
Bonnehoun
Bordenave
Cabane
Caillau
Carrié
Chincas
Claverie
Denis
Jaquet
Labadie
Labatut
Labourdette
Lagrave
Lahaderne
Larrieu
Lartigue
Lauga
Ligaray
Maréchal
Miranda
Mirassou
Montjoye
Mouliet
Nabarre (ruins)
Olive
Parfouby
Poumirau
Pucheu
Serbielle
Serrot
Trouilh
Neighbouring communes and villages
Toponymy
The commune name in Gascon is Angós which means "marshy terrain" according to Michel Grosclaude and Brigitte Jobbé-Duval
The following table details the origins of the commune name and other names in the commune.
Sources:
Raymond: Topographic Dictionary of the Department of Basses-Pyrenees, 1863, on the page numbers indicated in the table.
Grosclaude: Toponymic Dictionary of communes, Béarn, 2006
Cassini: Cassini Map from 1750
Ldh/EHESS/Cassini:
Origins:
Census: Census of Béarn
Reformation: Reformation of Béarn
Insinuations: Insinuations of the Diocese of Oloron
Notaries: Notaries of Navarrenx
Angous: Titles of Angous.
History
Paul Raymond noted on page 6 of the 1863 dictionary that the commune had a Lay Abbey, a vassal of the Viscount of Béarn. In 1385 there were 12 fires in Angous and it depended on the bailiwick of Navarrenx.
The barony of Gabaston, a vassal of the Viscount of Béarn, was made up of Angous, Navailles, and Susmiou.
Administration
List of Successive Mayors
Inter-communality
The commune is part of six inter-communal structures:
the Communauté de communes du Béarn des Gaves;
the inter-communal association for Gaves and of Saleys;
the mixed forestry association for the oak groves in the Basque and béarnais valleys;
the collection association of Navarrenx;
the AEP association of Navarrenx;
the energy association of Pyrénées-Atlantiques.
Demography
In 2017 the commune had 102 inhabitants.
Economy
The activity is directed mainly towards agriculture (livestock grazing, market gardening, and horticultural crops). The town is part of the Appellation d'origine contrôlée (AOC) zone of Ossau-iraty.
Culture and Heritage
Religious heritage
The Parish Church of Saint-André (1847) is registered as an historical monument.
Church Gallery
The sect Tabitha's place has a property of eleven hectares in the commune.
See also
Communes of the Pyrénées-Atlantiques department
References
External links
Angous on the 1750 Cassini Map
Communes of Pyrénées-Atlantiques
|
```hcl
resource "aws_security_group" "example-instance" {
vpc_id = aws_vpc.main.id
name = "allow-ssh"
description = "security group that allows ssh and all egress traffic"
egress {
from_port = 0
to_port = 0
protocol = "-1"
cidr_blocks = ["0.0.0.0/0"]
}
ingress {
from_port = 22
to_port = 22
protocol = "tcp"
cidr_blocks = ["0.0.0.0/0"]
}
tags = {
Name = "example-instance"
}
}
resource "aws_security_group" "allow-mariadb" {
vpc_id = aws_vpc.main.id
name = "allow-mariadb"
description = "allow-mariadb"
ingress {
from_port = 3306
to_port = 3306
protocol = "tcp"
security_groups = [aws_security_group.example-instance.id] # allowing access from our example instance
}
egress {
from_port = 0
to_port = 0
protocol = "-1"
cidr_blocks = ["0.0.0.0/0"]
self = true
}
tags = {
Name = "allow-mariadb"
}
}
```
|
Goiás is a Native Brazilian name, used by unspecified tribesmen to refer to themselves, derived from gua iá, "one like us".
The term may refer to:
Goiás, a state in Brazil.
Goiás, Goiás, a town in the state of Goiás.
Goiás Esporte Clube, an association football club from the state of Goiás.
See also
Goia (disambiguation)
Goya (disambiguation)
|
```css
/* nanum-myeongjo-400normal - latin */
@font-face {
font-family: 'Nanum Myeongjo';
font-style: normal;
font-display: swap;
font-weight: 400;
src:
local('Nanum Myeongjo Regular '),
local('Nanum Myeongjo-Regular'),
url('./files/nanum-myeongjo-latin-400.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/nanum-myeongjo-latin-400.woff') format('woff'); /* Modern Browsers */
}
/* nanum-myeongjo-700normal - latin */
@font-face {
font-family: 'Nanum Myeongjo';
font-style: normal;
font-display: swap;
font-weight: 700;
src:
local('Nanum Myeongjo Bold '),
local('Nanum Myeongjo-Bold'),
url('./files/nanum-myeongjo-latin-700.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/nanum-myeongjo-latin-700.woff') format('woff'); /* Modern Browsers */
}
/* nanum-myeongjo-800normal - latin */
@font-face {
font-family: 'Nanum Myeongjo';
font-style: normal;
font-display: swap;
font-weight: 800;
src:
local('Nanum Myeongjo ExtraBold '),
local('Nanum Myeongjo-ExtraBold'),
url('./files/nanum-myeongjo-latin-800.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/nanum-myeongjo-latin-800.woff') format('woff'); /* Modern Browsers */
}
```
|
```c++
// (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
// See path_to_url for the library home page.
//
// File : $RCSfile$
//
// Version : $Revision: 74248 $
//
// Description : inidiration interfaces to support manipulators and message output
// ***************************************************************************
#ifndef BOOST_TEST_TOOLS_DETAIL_INDIRECTIONS_HPP_112812GER
#define BOOST_TEST_TOOLS_DETAIL_INDIRECTIONS_HPP_112812GER
// Boost.Test
#include <boost/test/tools/detail/fwd.hpp>
#include <boost/test/tools/assertion_result.hpp>
#include <boost/test/detail/suppress_warnings.hpp>
//your_sha256_hash____________//
namespace boost {
namespace test_tools {
namespace tt_detail {
// ************************************************************************** //
// ************** assertion_evaluate indirection ************** //
// ************************************************************************** //
template<typename E>
struct assertion_evaluate_t {
assertion_evaluate_t( E const& e ) : m_e( e ) {}
operator assertion_result() { return m_e.evaluate( true ); }
E const& m_e;
};
//your_sha256_hash____________//
template<typename E>
inline assertion_evaluate_t<E>
assertion_evaluate( E const& e ) { return assertion_evaluate_t<E>( e ); }
//your_sha256_hash____________//
template<typename E, typename T>
inline assertion_evaluate_t<E>
operator<<( assertion_evaluate_t<E> const& ae, T const& ) { return ae; }
//your_sha256_hash____________//
// ************************************************************************** //
// ************** assertion_text indirection ************** //
// ************************************************************************** //
template<typename T>
inline unit_test::lazy_ostream const&
assertion_text( unit_test::lazy_ostream const& /*et*/, T const& m ) { return m; }
//your_sha256_hash____________//
inline unit_test::lazy_ostream const&
assertion_text( unit_test::lazy_ostream const& et, int ) { return et; }
//your_sha256_hash____________//
// ************************************************************************** //
// ************** assertion_evaluate indirection ************** //
// ************************************************************************** //
struct assertion_type {
operator check_type() { return CHECK_MSG; }
};
//your_sha256_hash____________//
template<typename T>
inline assertion_type
operator<<( assertion_type const& at, T const& ) { return at; }
//your_sha256_hash____________//
} // namespace tt_detail
} // namespace test_tools
} // namespace boost
#include <boost/test/detail/enable_warnings.hpp>
#endif // BOOST_TEST_TOOLS_DETAIL_INDIRECTIONS_HPP_112812GER
```
|
```arduino
/*
* This sketch shows the WiFi event usage
*
*/
/*
* WiFi Events
0 ARDUINO_EVENT_WIFI_READY < ESP32 WiFi ready
1 ARDUINO_EVENT_WIFI_SCAN_DONE < ESP32 finish scanning AP
2 ARDUINO_EVENT_WIFI_STA_START < ESP32 station start
3 ARDUINO_EVENT_WIFI_STA_STOP < ESP32 station stop
4 ARDUINO_EVENT_WIFI_STA_CONNECTED < ESP32 station connected to AP
5 ARDUINO_EVENT_WIFI_STA_DISCONNECTED < ESP32 station disconnected from AP
6 ARDUINO_EVENT_WIFI_STA_AUTHMODE_CHANGE < the auth mode of AP connected by ESP32 station changed
7 ARDUINO_EVENT_WIFI_STA_GOT_IP < ESP32 station got IP from connected AP
8 ARDUINO_EVENT_WIFI_STA_LOST_IP < ESP32 station lost IP and the IP is reset to 0
9 ARDUINO_EVENT_WPS_ER_SUCCESS < ESP32 station wps succeeds in enrollee mode
10 ARDUINO_EVENT_WPS_ER_FAILED < ESP32 station wps fails in enrollee mode
11 ARDUINO_EVENT_WPS_ER_TIMEOUT < ESP32 station wps timeout in enrollee mode
12 ARDUINO_EVENT_WPS_ER_PIN < ESP32 station wps pin code in enrollee mode
13 ARDUINO_EVENT_WIFI_AP_START < ESP32 soft-AP start
14 ARDUINO_EVENT_WIFI_AP_STOP < ESP32 soft-AP stop
15 ARDUINO_EVENT_WIFI_AP_STACONNECTED < a station connected to ESP32 soft-AP
16 ARDUINO_EVENT_WIFI_AP_STADISCONNECTED < a station disconnected from ESP32 soft-AP
17 ARDUINO_EVENT_WIFI_AP_STAIPASSIGNED < ESP32 soft-AP assign an IP to a connected station
18 ARDUINO_EVENT_WIFI_AP_PROBEREQRECVED < Receive probe request packet in soft-AP interface
19 ARDUINO_EVENT_WIFI_AP_GOT_IP6 < ESP32 ap interface v6IP addr is preferred
19 ARDUINO_EVENT_WIFI_STA_GOT_IP6 < ESP32 station interface v6IP addr is preferred
20 ARDUINO_EVENT_ETH_START < ESP32 ethernet start
21 ARDUINO_EVENT_ETH_STOP < ESP32 ethernet stop
22 ARDUINO_EVENT_ETH_CONNECTED < ESP32 ethernet phy link up
23 ARDUINO_EVENT_ETH_DISCONNECTED < ESP32 ethernet phy link down
24 ARDUINO_EVENT_ETH_GOT_IP < ESP32 ethernet got IP from connected AP
19 ARDUINO_EVENT_ETH_GOT_IP6 < ESP32 ethernet interface v6IP addr is preferred
25 ARDUINO_EVENT_MAX
*/
#include <WiFi.h>
const char *ssid = "Wokwi-GUEST";
const char *password = "";
// WARNING: This function is called from a separate FreeRTOS task (thread)!
void WiFiEvent(WiFiEvent_t event) {
Serial.printf("[WiFi-event] event: %d\n", event);
switch (event) {
case ARDUINO_EVENT_WIFI_READY: Serial.println("WiFi interface ready"); break;
case ARDUINO_EVENT_WIFI_SCAN_DONE: Serial.println("Completed scan for access points"); break;
case ARDUINO_EVENT_WIFI_STA_START: Serial.println("WiFi client started"); break;
case ARDUINO_EVENT_WIFI_STA_STOP: Serial.println("WiFi clients stopped"); break;
case ARDUINO_EVENT_WIFI_STA_CONNECTED: Serial.println("Connected to access point"); break;
case ARDUINO_EVENT_WIFI_STA_DISCONNECTED: Serial.println("Disconnected from WiFi access point"); break;
case ARDUINO_EVENT_WIFI_STA_AUTHMODE_CHANGE: Serial.println("Authentication mode of access point has changed"); break;
case ARDUINO_EVENT_WIFI_STA_GOT_IP:
Serial.print("Obtained IP address: ");
Serial.println(WiFi.localIP());
break;
case ARDUINO_EVENT_WIFI_STA_LOST_IP: Serial.println("Lost IP address and IP address is reset to 0"); break;
case ARDUINO_EVENT_WPS_ER_SUCCESS: Serial.println("WiFi Protected Setup (WPS): succeeded in enrollee mode"); break;
case ARDUINO_EVENT_WPS_ER_FAILED: Serial.println("WiFi Protected Setup (WPS): failed in enrollee mode"); break;
case ARDUINO_EVENT_WPS_ER_TIMEOUT: Serial.println("WiFi Protected Setup (WPS): timeout in enrollee mode"); break;
case ARDUINO_EVENT_WPS_ER_PIN: Serial.println("WiFi Protected Setup (WPS): pin code in enrollee mode"); break;
case ARDUINO_EVENT_WIFI_AP_START: Serial.println("WiFi access point started"); break;
case ARDUINO_EVENT_WIFI_AP_STOP: Serial.println("WiFi access point stopped"); break;
case ARDUINO_EVENT_WIFI_AP_STACONNECTED: Serial.println("Client connected"); break;
case ARDUINO_EVENT_WIFI_AP_STADISCONNECTED: Serial.println("Client disconnected"); break;
case ARDUINO_EVENT_WIFI_AP_STAIPASSIGNED: Serial.println("Assigned IP address to client"); break;
case ARDUINO_EVENT_WIFI_AP_PROBEREQRECVED: Serial.println("Received probe request"); break;
case ARDUINO_EVENT_WIFI_AP_GOT_IP6: Serial.println("AP IPv6 is preferred"); break;
case ARDUINO_EVENT_WIFI_STA_GOT_IP6: Serial.println("STA IPv6 is preferred"); break;
case ARDUINO_EVENT_ETH_GOT_IP6: Serial.println("Ethernet IPv6 is preferred"); break;
case ARDUINO_EVENT_ETH_START: Serial.println("Ethernet started"); break;
case ARDUINO_EVENT_ETH_STOP: Serial.println("Ethernet stopped"); break;
case ARDUINO_EVENT_ETH_CONNECTED: Serial.println("Ethernet connected"); break;
case ARDUINO_EVENT_ETH_DISCONNECTED: Serial.println("Ethernet disconnected"); break;
case ARDUINO_EVENT_ETH_GOT_IP: Serial.println("Obtained IP address"); break;
default: break;
}
}
// WARNING: This function is called from a separate FreeRTOS task (thread)!
void WiFiGotIP(WiFiEvent_t event, WiFiEventInfo_t info) {
Serial.println("WiFi connected");
Serial.println("IP address: ");
Serial.println(IPAddress(info.got_ip.ip_info.ip.addr));
}
void setup() {
Serial.begin(115200);
// delete old config
WiFi.disconnect(true);
delay(1000);
// Examples of different ways to register wifi events;
// these handlers will be called from another thread.
WiFi.onEvent(WiFiEvent);
WiFi.onEvent(WiFiGotIP, WiFiEvent_t::ARDUINO_EVENT_WIFI_STA_GOT_IP);
WiFiEventId_t eventID = WiFi.onEvent(
[](WiFiEvent_t event, WiFiEventInfo_t info) {
Serial.print("WiFi lost connection. Reason: ");
Serial.println(info.wifi_sta_disconnected.reason);
},
WiFiEvent_t::ARDUINO_EVENT_WIFI_STA_DISCONNECTED
);
// Remove WiFi event
Serial.print("WiFi Event ID: ");
Serial.println(eventID);
// WiFi.removeEvent(eventID);
Serial.println("Scan start");
// WiFi.scanNetworks will return the number of networks found.
int n = WiFi.scanNetworks();
Serial.println("Scan done");
if (n == 0) {
Serial.println("no networks found");
} else {
Serial.print(n);
Serial.println(" networks found");
for (int i = 0; i < n; ++i) {
// Print SSID for each network found
Serial.printf("%s\n", WiFi.SSID(i).c_str());
Serial.println();
delay(10);
}
}
Serial.println("");
// Delete the scan result to free memory for code below.
WiFi.scanDelete();
WiFi.begin(ssid, password);
Serial.println();
Serial.println();
Serial.println("Wait for WiFi... ");
}
void loop() {
delay(1000);
}
```
|
Katrina "Katie" Schlukebir (born April 29, 1975) is a former professional tennis player from the United States.
Biography
Schlukebir was born in Kalamazoo, Michigan, to insurance agent John and tennis instructor Kathy. On her father's side she is of German and Dutch descent. She is the eldest of three daughters. Her youngest sister, Kristen, also became a professional tennis player. The middle sister, Karie, played tennis at Indiana University, before her death from cancer in 2010.
A right-handed player, Schlukebir started out in tennis aged four, introduced to the sport by her mother. She was runner-up in the girls' doubles event at the 1992 US Open, with partner Julie Steven. Later she played on the collegiate team at Stanford University and in 1997 was a member of the championship winning side. Individually she was a four-time All-American and in the championship year of 1997 won Stanford's award for both "Sophomore Athlete of the Year" and "Woman of the Year". She graduated in 1997 with a degree in psychology, then joined the professional tour full-time.
On the professional circuit, she specialised as a doubles player and peaked at No. 46 in the world. She made two WTA Tour finals, with her only title coming at the 1999 Challenge Bell in Quebec, partnering Amy Frazier.
Schlukebir was a regular competitor in doubles draws at Grand Slam competitions. She made the women's doubles quarterfinals at the 1998 US Open with Amy Frazier, along the way accounting for sixth seeds Anna Kournikova and Larisa Neiland. In 1999, she played mixed doubles with Mike Bryan at the French Open, Wimbledon and US Open. Her best Grand Slam performance in the mixed doubles was a quarterfinal appearance, partnering Eric Taino at the 2000 Wimbledon Championships, where they were beaten by Lleyton Hewitt and Kim Clijsters.
Following her playing career, she worked as a coach for the USTA.
WTA career finals
Doubles: 2 (1 title, 1 runner-up)
ITF finals
Singles (2–1)
Doubles (12–4)
References
External links
1975 births
Living people
American female tennis players
Sportspeople from Kalamazoo, Michigan
Tennis people from Michigan
Stanford Cardinal women's tennis players
American people of German descent
American people of Dutch descent
|
The 1977–78 English football season was Aston Villa's 78th in the Football League and their third consecutive season in the top division.
Villa reached the quarter-final of the UEFA Cup where they went out 4–3 on aggregate against Barcelona. In the domestic league, however, they struggled, and Saunders started rebuilding the team.
Diary of the season
17 April 1978: Newcastle United lose at Aston Villa and are relegated to the Second Division.
2 May 1978: Wolverhampton Wanderers beat Aston Villa 3–1 to stay in the First Division at West Ham United's expense.
Villa lost both games in the Second City derby.
League table
Squad
All Aston Villa players: 1978
References
External links
AVFC History: 1977–78
Aston Villa F.C. seasons
Aston Villa F.C. season
|
```python
from unittest import mock
from boto3 import client
from mock import patch
from moto import mock_aws
from prowler.providers.aws.services.shield.shield_service import Protection
from tests.providers.aws.utils import (
AWS_ACCOUNT_NUMBER,
AWS_REGION_EU_WEST_1,
set_mocked_aws_provider,
)
# Mock generate_regional_clients()
def mock_generate_regional_clients(provider, service):
regional_client = provider._session.current_session.client(
service, region_name=AWS_REGION_EU_WEST_1
)
regional_client.region = AWS_REGION_EU_WEST_1
return {AWS_REGION_EU_WEST_1: regional_client}
# Patch every AWS call using Boto3 and generate_regional_clients to have 1 client
@patch(
"prowler.providers.aws.aws_provider.AwsProvider.generate_regional_clients",
new=mock_generate_regional_clients,
)
class Test_shield_advanced_protection_in_associated_elastic_ips:
@mock_aws
def test_no_shield_not_active(self):
# Shield Client
shield_client = mock.MagicMock
shield_client.enabled = False
from prowler.providers.aws.services.ec2.ec2_service import EC2
with mock.patch(
"prowler.providers.aws.services.shield.shield_service.Shield",
new=shield_client,
), mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=set_mocked_aws_provider([AWS_REGION_EU_WEST_1]),
), mock.patch(
"prowler.providers.aws.services.shield.shield_advanced_protection_in_associated_elastic_ips.shield_advanced_protection_in_associated_elastic_ips.ec2_client",
new=EC2(set_mocked_aws_provider([AWS_REGION_EU_WEST_1])),
):
# Test Check
from prowler.providers.aws.services.shield.shield_advanced_protection_in_associated_elastic_ips.shield_advanced_protection_in_associated_elastic_ips import (
shield_advanced_protection_in_associated_elastic_ips,
)
check = shield_advanced_protection_in_associated_elastic_ips()
result = check.execute()
assert len(result) == 0
@mock_aws
def test_shield_enabled_ip_protected(self):
# EC2 Client
ec2_client = client("ec2", region_name=AWS_REGION_EU_WEST_1)
resp = ec2_client.allocate_address(Domain="vpc", Address="127.38.43.222")
allocation_id = resp["AllocationId"]
elastic_ip_arn = f"arn:aws:ec2:{AWS_REGION_EU_WEST_1}:{AWS_ACCOUNT_NUMBER}:eip-allocation/{allocation_id}"
# Shield Client
shield_client = mock.MagicMock
shield_client.enabled = True
shield_client.region = AWS_REGION_EU_WEST_1
protection_id = "test-protection"
shield_client.protections = {
protection_id: Protection(
id=protection_id,
name="",
resource_arn=elastic_ip_arn,
protection_arn="",
region=AWS_REGION_EU_WEST_1,
)
}
from prowler.providers.aws.services.ec2.ec2_service import EC2
with mock.patch(
"prowler.providers.aws.services.shield.shield_service.Shield",
new=shield_client,
), mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=set_mocked_aws_provider([AWS_REGION_EU_WEST_1]),
), mock.patch(
"prowler.providers.aws.services.shield.shield_advanced_protection_in_associated_elastic_ips.shield_advanced_protection_in_associated_elastic_ips.ec2_client",
new=EC2(set_mocked_aws_provider([AWS_REGION_EU_WEST_1])),
):
# Test Check
from prowler.providers.aws.services.shield.shield_advanced_protection_in_associated_elastic_ips.shield_advanced_protection_in_associated_elastic_ips import (
shield_advanced_protection_in_associated_elastic_ips,
)
check = shield_advanced_protection_in_associated_elastic_ips()
result = check.execute()
assert len(result) == 1
assert result[0].region == AWS_REGION_EU_WEST_1
assert result[0].resource_id == allocation_id
assert result[0].resource_arn == elastic_ip_arn
assert result[0].status == "PASS"
assert (
result[0].status_extended
== f"Elastic IP {allocation_id} is protected by AWS Shield Advanced."
)
@mock_aws
def test_shield_enabled_ip_not_protected(self):
# EC2 Client
ec2_client = client("ec2", region_name=AWS_REGION_EU_WEST_1)
resp = ec2_client.allocate_address(Domain="vpc", Address="127.38.43.222")
allocation_id = resp["AllocationId"]
elastic_ip_arn = f"arn:aws:ec2:{AWS_REGION_EU_WEST_1}:{AWS_ACCOUNT_NUMBER}:eip-allocation/{allocation_id}"
# Shield Client
shield_client = mock.MagicMock
shield_client.enabled = True
shield_client.region = AWS_REGION_EU_WEST_1
shield_client.protections = {}
from prowler.providers.aws.services.ec2.ec2_service import EC2
with mock.patch(
"prowler.providers.aws.services.shield.shield_service.Shield",
new=shield_client,
), mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=set_mocked_aws_provider([AWS_REGION_EU_WEST_1]),
), mock.patch(
"prowler.providers.aws.services.shield.shield_advanced_protection_in_associated_elastic_ips.shield_advanced_protection_in_associated_elastic_ips.ec2_client",
new=EC2(set_mocked_aws_provider([AWS_REGION_EU_WEST_1])),
):
# Test Check
from prowler.providers.aws.services.shield.shield_advanced_protection_in_associated_elastic_ips.shield_advanced_protection_in_associated_elastic_ips import (
shield_advanced_protection_in_associated_elastic_ips,
)
check = shield_advanced_protection_in_associated_elastic_ips()
result = check.execute()
assert len(result) == 1
assert result[0].region == AWS_REGION_EU_WEST_1
assert result[0].resource_id == allocation_id
assert result[0].resource_arn == elastic_ip_arn
assert result[0].status == "FAIL"
assert (
result[0].status_extended
== f"Elastic IP {allocation_id} is not protected by AWS Shield Advanced."
)
@mock_aws
def test_shield_disabled_ip_not_protected(self):
# EC2 Client
ec2_client = client("ec2", region_name=AWS_REGION_EU_WEST_1)
resp = ec2_client.allocate_address(Domain="vpc", Address="127.38.43.222")
allocation_id = resp["AllocationId"]
_ = f"arn:aws:ec2:{AWS_REGION_EU_WEST_1}:{AWS_ACCOUNT_NUMBER}:eip-allocation/{allocation_id}"
# Shield Client
shield_client = mock.MagicMock
shield_client.enabled = False
shield_client.region = AWS_REGION_EU_WEST_1
shield_client.protections = {}
from prowler.providers.aws.services.ec2.ec2_service import EC2
with mock.patch(
"prowler.providers.aws.services.shield.shield_service.Shield",
new=shield_client,
), mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=set_mocked_aws_provider([AWS_REGION_EU_WEST_1]),
), mock.patch(
"prowler.providers.aws.services.shield.shield_advanced_protection_in_associated_elastic_ips.shield_advanced_protection_in_associated_elastic_ips.ec2_client",
new=EC2(set_mocked_aws_provider([AWS_REGION_EU_WEST_1])),
):
# Test Check
from prowler.providers.aws.services.shield.shield_advanced_protection_in_associated_elastic_ips.shield_advanced_protection_in_associated_elastic_ips import (
shield_advanced_protection_in_associated_elastic_ips,
)
check = shield_advanced_protection_in_associated_elastic_ips()
result = check.execute()
assert len(result) == 0
```
|
Fishkill is a town in the southwestern part of Dutchess County, New York, United States. It lies approximately north of New York City. The population was 24,226 at the 2010 census. Fishkill surrounds the city of Beacon, and contains a village, which is also named Fishkill.
The name Fishkill derives from the Dutch words vis kill, meaning "fish creek". The location of Fishkill was known as Tioranda by the Native American peoples. The name means "The place where two waters meet". Fishkill is one of the nine original towns in Dutchess County, and is best known today for its rich history dating to the American Revolutionary War period and scenic views of the Hudson Highlands.
History
In 1683 New York City merchants Francis Rombouts and Gulian Verplanck purchased in Dutchess County from the Wappinger confederacy of Native Americans for a quantity of goods including rum, powder, and tobacco. In 1685 it was granted as the royal Rombout Patent. Neither ever lived on the land, intending to use it only for fur trading. The first white settlers were Rombout's daughter, Catheryna, and her husband, Roger Brett, who built a mill at the mouth of Fishkill Creek as it flows into the Hudson River.
Originally, the boundaries of Fishkill extended far beyond the boundaries of the present-day Town of Fishkill. When the town was incorporated in 1788, Fishkill's land area included the present-day City of Beacon and Village of Fishkill, as well as the Town of Wappinger, Village of Wappingers Falls, Town of East Fishkill and a portion of the Town of LaGrange. During the 19th century, as other towns incorporated, Fishkill's area was reduced until the incorporation of the City of Beacon in 1913 resulted in Town boundaries approximate to modern town lines.
Fishkill lays claim to a strong Native American heritage, and a number of areas within the town retain their Native American names, including Matteawan Road and the hamlet of Wiccopee, which overlaps into the modern town of East Fishkill. Daniel Nimham, the final sachem of the Wappinger people, was born in the Wiccopee area in 1726. Nimham rose to prominence as both an advocate for Native American land rights and as a soldier, serving as both a spokesman arguing in England for the enforcement of land treaties, and the leader of the Stockbridge Militia, which fielded a force of approximately 300 Native American warriors of Wappinger and Mohican identity. The Stockbridge Militia fought on the side of the British in the French and Indian War, and then on the side of the Continental Army during the American Revolution. Nimham and his Stockbridge soldiers were some of America's first combat veterans. Nimham was killed at the Battle of Kingsbridge in what is now the Bronx on August 31, 1778.
Fishkill played a pivotal role in the American Revolutionary War when a huge military encampment known as the Fishkill Supply Depot was established one mile (1.6 km) south of the village of Fishkill to guard the mountain pass to the south. Signal fires lay in readiness on tops of the surrounding mountains. The Fishkill encampment became the main supply depot for the northern department of the Continental Army. The first copies of the New York State Constitution were printed at Fishkill in 1777. Mount Beacon, located in the town, earned its name for the signal fires at the summit which were used for Continental Army communications during the war.
As commander of the Continental Army, George Washington spent considerable time in Fishkill, and in 1778, noted Fishkill silversmith John Bailey crafted a sword for Washington near present-day Maurer-Geering Park. The sword was a particular favorite of Washington's, and he carried it for the remainder of the war. Upon his death, Washington bequeathed a sword to each of his five nephews, and nephew Samuel Washington received the Bailey sword. He donated it to Congress in 1843. The sword is now lies in the Smithsonian Institution, as part of the National Museum of American History.
In the 19th century, mills and factories sprang up in Glenham and Matteawan, bringing an influx of skilled weavers from the British Isles. The healthy economy came to an end in the post–Civil War depression, and the once thriving factories fell into decay. In 1931, Texaco purchased the old woolen mill site and established a research center there. Today, the town's economy is diverse, comprising tourism, medical care, retail and restaurants, warehouses, recreation spots and a wealth of small businesses.
In 1996, the animal rights group PETA suggested the town change its name to something less suggestive of violence toward fish. The name derives from the Dutch vis kill, meaning "fish creek." For this reason, the town declined. Town Supervisor Ozzy Albra has indicated he will not entertain changing the name of the town.
In 2021, the Town commissioned an eight-foot bronze statue depicting Daniel Nimham from noted Hudson Valley sculptor Michael Keropian. The statue was installed at the Arrowhead intersection of NY-52 and NY-82 (41° 32.685′ N, 73° 52.16′ W.) in May 2022 and dedicated on June 11, 2022. Town Supervisor Ozzy Albra hosted the ceremony which featured comments from elected officials, educators, the sculptor, and a number of special presentations by Native American community groups.
Government
The Town of Fishkill is overseen by a Town Supervisor a Town Council, comprising four Councilmembers. The Town Supervisor and Town Council are elected to four-year terms, and town law limits the Town Supervisor and Town Council to two terms of service. As of 2022, the Town Supervisor is Ozzy Albra, and the Town Council consists of Louise Daniele, John Forman, Carmine Istvan and Brian Wrye.
Tourism
Fishkill is home to a number of tourist locations, including a number of historically significant sites. Popular sites include:
Dutchess Stadium, home of the Hudson Valley Renegades, the High-A Minor League affiliate of the New York Yankees
SplashDown Beach, a seasonal water and amusement park
Van Wyck Homestead Museum and Fishkill Supply Depot
Mount Gulian
Stony Kill Farm
In 2021, it was announced the town would work with sculptor Michael Keropian to commission a statue of Wappinger tribal leader Daniel Nimham, as part of an effort by the town to promote historical tourism in Fishkill. The statue was installed in May 2022 and dedicated on June 11, 2022.
Geography
According to the United States Census Bureau, the town has a total area of , of which is land and , or 14.55%, is water. The elevation of the town varies from sea level along the Hudson River (Fishkill Waterfront, Fishkill Landing, Dutchess Junction) to above sea level (South Beacon Mountain).
The southern town line is the border between Dutchess and Putnam counties and between the towns of Fishkill and Philipstown. The western town line is defined by the Hudson River, across which lie the Orange County towns of Cornwall, New Windsor, and Newburgh, as well as the city of Newburgh. The city of Beacon is contained within the town, though Fishkill's area west of Beacon is mostly occupied by the Hudson. To the north is the town of Wappinger, and to the east is the town of East Fishkill.
The town's namesake, the Fishkill Creek, runs from east to west across the town and empties into the Hudson River. As the word Fishkill derives from the Dutch vis kill, meaning "fish creek," the English use of "Fishkill Creek" creates a bilingual tautology.
Interstate 84 passes through the town in an east-west direction, with access from Exits 41, 44, and 46 (old Exits 11, 12, and 13), and US 9 passes through both the town and village of Fishkill in a north-south direction.
Demographics
As of the census of 2000, there were 20,258 people, 6,856 households, and 4,264 families residing in the town. The population density was . There were 7,040 housing units at an average density of . The racial makeup of the town was 77.19% White, 14.13% African American, 0.19% Native American, 2.99% Asian, 0.02% Pacific Islander, 4.49% from other races, and 0.99% from two or more races. Of the population 10.47% were Hispanic or Latino of any race.
There were 6,856 households, out of which 27.7% had children under the age of 18 living with them, 51.0% were married couples living together, 8.1% had a woman whose husband does not live with her, and 37.8% were non-families. 32.5% of all households were made up of individuals, and 12.6% had someone living alone who was 65 years of age or older. The average household size was 2.35 and the average family size was 3.02.
In the town, the population was spread out, with 18.3% under the age of 18, 7.1% from 18 to 24, 38.1% from 25 to 44, 22.3% from 45 to 64, and 14.1% who were 65 years of age or older. The median age was 38 years.
The median income for a household in the town was $52,745, and the median income for a family was $63,574. Males had a median income of $42,106 versus $32,198 for females. The per capita income for the town was $22,662. 5.4% of the population and 3.4% of families were below the poverty line. Out of the total people living in poverty, 6.2% were under the age of 18 and 7.5% were 65 or older.
Sports
Fishkill is home to the Hudson Valley Renegades, a minor league baseball team affiliated with the New York Yankees, which plays in the new High-A East league. Previously the team was a member of the short-season New York–Penn League from 1994 to 2020, and had been an affiliate of the Tampa Bay Rays. The Renegades play at Heritage Financial Park, formerly called Dutchess Stadium.
Notable people
Elizabeth Allen 1929-2006, theatre, television and film actor and singer; lived in Fishkill prior to her death.
Catheryna Rombout Brett 1687-1764, landowner and businesswoman; owned a considerable portion of Dutchess County in the colonial period.
Elijah A. Briggs 1843-1922, American Civil War soldier and Medal of Honor recipient; lived in Fishkill for many years prior to his death.
Robert Kanigher 1915-2002, comic book, playwright, television and film writer for DC Comics noted for writing Wonder Woman and The Flash lived in Fishkill prior to his death.
Marquis de Lafayette 1757-1834, French noble and military leader who assisted Washington during the Revolutionary War; was nursed to health after a long illness in Fishkill.
Daniel Nimham 1726-1778, final sachem of the Wappinger people and American Revolutionary War combat veteran; born in Fishkill in 1726.
Margaret Sanger 1879-1966, birth control activist and sex educator had her summer home in Fishkill from the mid-1920s until 1949.
Benjamin Strong Jr. 1872-1928, banker and Governor of the Federal Reserve Bank of New York.
See also
Fishkill Correctional Facility
Mount Gulian
Stony Kill Farm
Van Wyck Homestead Museum
References
External links
Town of Fishkill official website
Village of Fishkill
Fishkill area information
Blodgett Memorial Library (Fishkill)
Fishkill Creek Watershed Committee
Rombout Fire Company
Fishkill Reformed Church
Fishkill Historical Society
Poughkeepsie–Newburgh–Middletown metropolitan area
Towns in Dutchess County, New York
Towns in New York (state)
New York (state) populated places on the Hudson River
Towns in the New York metropolitan area
|
Nadia Elizabeth Brown is an American political scientist. She is a University Scholar and professor of Political Science and African American Studies at Purdue University, where she is also affiliated with the department of Women's, Gender, and Sexuality Studies. In 2020 she was appointed Director of the Women's and Gender Studies Program at Georgetown University, with a term starting in August 2021. Brown is a scholar of American politics whose work focuses on identity politics, legislative studies, and Black women's studies, using the theory of intersectionality to study topics across multiple disciplines.
Education and early career
Brown studied political science at Howard University, obtaining a BA in 2004. She chose to study political science because of an interest in how power is distributed in society, and particularly how Black women engage in political activity. In 2010 she completed her PhD in political science at Rutgers University, specializing in Women and Politics and American Politics. She also received a Graduate Certificate in Women's and Gender Studies. From 2010 to 2013, she was a professor of political science and African American studies, and affiliated with women's studies, at St. Louis University.
Career
In 2014, Brown published the book Sisters in the Statehouse: Black Women and Legislative Decision Making, which studies how the policy preferences and legislative behavior of African American women legislators are influenced by experiences with racism and sexism during their lives, given the context that in 2013, only 239 of the 7,776 female legislators in the United States were African American women. The book was reviewed positively not just for its substantive findings, but also for its analytical approach, with Muireann O'Dwyer writing that it "delivered an answer to the enduring question of how exactly intersectionality can be brought to bear on the empirical questions of social science". Sisters in the Statehouse won the 2015 W.E.B. DuBois Distinguished Book Award, as well as awards from Purdue University and the Association for the Study of Black Women and Politics.
In 2016, Brown was appointed a University Scholar at Purdue University, an honor which is intended "to recognize outstanding mid-career faculty who are on an accelerated path for academic distinction". Brown was chosen as the American Political Science Association's Member of the Month for April 2019.
Brown is the lead editor of the journal Politics, Groups, and Identities, which she has noted may make her the first Black woman to be the sole lead editor of a political science journal. She has also been a member of the editorial board of the political science expert database Women Also Know Stuff.
Brown is an advocate for political scientists to communicate about their discipline with the media. She has published in The Washington Post, the Huffington Post, and Ozy, and been cited in outlets like The New York Times and The Washingtonian.
Selected works
Brown, Nadia E. and Danielle Casarez Lemi. 2021. Sister Style: The Politics of Appearance for Black Women Political Elites. Oxford University Press.
Brown, Nadia E. 2014. Sisters in the Statehouse: Black Women and Legislative Decision Making. Oxford University Press.
Selected awards
W.E.B. DuBois Distinguished Book Award (2015)
Purdue University Scholar (2016)
American Political Science Association Member of the Month (2019)
References
External links
Living people
Date of birth missing (living people)
21st-century African-American academics
21st-century American academics
American women political scientists
American political scientists
Howard University alumni
Purdue University faculty
Saint Louis University faculty
Year of birth missing (living people)
21st-century African-American women
|
Onslow Square is a garden square in South Kensington, London, England.
It is set back between the Old Brompton Road to the northwest and the Fulham Road to the southeast. To the north is South Kensington Underground station. To the south is the Royal Marsden Hospital. As well as the main square, the address covers the street to the southwest that turns into Onslow Gardens, and the street to the northwest that meets Pelham Street by South Kensington tube station.
History
The houses were built by Charles James Freake, on land belonging to Smith's Charity. His building agreement with the trustees of the charity stipulated that they should be stuccoed, and constructed to elevational designs and specifications provided by the trustees' architect and surveyor, George Basevi. The first four houses in the square, numbers 1,3,5, and 7, were begun in September 1845, and were occupied by 1847. The whole square was completed by 1865.
After the building of the first four houses, and Basevi’s sudden death in 1845, the style of the houses diverged from agreed design, using exposed grey stock brick, nonetheless of similar elevations and with substantial stucco dressings.
St Paul's Church
St Paul's Church in Onslow Square was created as a part of Sir Charles James Freake's development of the square. The church was built during 1859–60, designed by James Edmeston together with Charles Freake's office. In 1876, a church hall was constructed south of the church. This was extended in 1893. The church is now administered by Holy Trinity Brompton Church.
Notable people
Sir Albert Hastings Markham, KCB (1841–1918), explorer, author, and officer in the Royal Navy, lived at 4 Onslow Square as a child.
The architect Edwin Lutyens and his sister Mary Wemyss lived at number 16 as children.
The novelist William Makepeace Thackeray lived at 36 Onslow Square from 1853 to 1860. Here he wrote the last part of The Newcomes, the Lectures on the Four Georges, The Virginians, and some of The Adventures of Philip and The Roundabout Papers.
Vice-Admiral Robert FitzRoy (1805–1865), commander of HMS Beagle, on board which the naturalist Charles Darwin (1809–1882) also sailed, lived at 38 Onslow Square. Fitzroy lived at No 38 from 1854 to 1865, when he committed suicide (but in another residence in Norwood), through guilt for his part in casting doubt about the truth of the Bible.
Herbert Edward Ryle DD KCVO (1856–1925), later an Old Testament scholar and the Dean of Westminster, was born in the square on 25 May 1856.
Edmund Fisher (1872–1918), British architect, was born in Onslow Square.
John Parker (1799–1881), a barrister and Whig politician, died at 57 Onslow Square.
The architect William Railton, designer of Nelson’s Column, lived at 65 Onslow Square. His daughter married the Rev. Barclay Fowell Buxton (1860–1946), who was curate at Onslow Square from 1884 to 1887. The sculptor Baron Carlo Marochetti – who cast the lions for the column – lived at number 34, and had a workshop and foundry nearby in Sydney Mews.
Frederic John Sidney Parry (1810–1885), an entomologist, lived in Onslow Square.
John William Crombie (1858–1908), a Scottish woollen manufacturer, folklorist and Liberal Party politician, died in the square.
Robert Buhler RA (1916–1989), a Swiss landscape and portrait artist, lived at No. 38.
British billionaire Richard Caring lives in a "£40m mansion" with a two-storey basement, Park House, which replaced a 19th-century cottage that had been owned by Gert-Rudolf Flick, heir to German industrial wealth.
See also
Earl of Onslow
References
Squares in the Royal Borough of Kensington and Chelsea
South Kensington
Houses completed in 1878
Grade II listed houses in the Royal Borough of Kensington and Chelsea
Onslow Square
Communal gardens
Garden squares in London
|
Novosvitlivka () is a village in Voznesensk Raion, Mykolaiv Oblast in Southern Ukraine.
History
In 1886, 2,485 people lived in the German colony of Worms, Rohrbach Volost, Odesa County, Kherson Province, there were 260 farmsteads, 2 prayer houses, 2 schools, 8 benches and a steam mill. From 1925 to 1939, the village (under the name Rohrbach) was part of the Karl-Liebknecht German National District of the Mykolaiv District (since 1932, Odesa Oblast).
Until 18 July 2020, Novosvitlivka was located in Veselynove Raion. The raion was abolished in July 2020 as part of the administrative reform of Ukraine, which reduced the number of raions of Mykolaiv Oblast to four. The area of Veselynove Raion was merged into Voznesensk Raion.
References
Villages in Voznesensk Raion
|
Befeta is a town and commune in Madagascar. It belongs to the district of Ambohimahasoa, which is a part of Haute Matsiatra Region. The population of the commune was estimated to be approximately 13,000 in 2001 commune census.
Primary and junior level secondary education are available in town. The majority 80% of the population of the commune are farmers. The most important crops are rice and beans, while other important agricultural products are maize and grapes. Industry and services provide employment for 5% and 15% of the population, respectively.
References and notes
Populated places in Haute Matsiatra
|
Sturge Park was a cricket ground located on five acres of land adjacent to Plymouth, Montserrat. The ground, used by the Montserrat cricket team and infrequently by the Leeward Islands cricket team, was destroyed in the Soufrière Hills volcanic eruption of 1997. A replacement ground, the Salem Oval, was opened in 2000 on the north of the island.
History
Cricket was first recorded as being played on what would become Sturge Park in October 1925, when St Kitts played Antigua in the 1925/26 Hesketh Bell Shield. Montserrat first played there in the same competition against Dominica, before the ground held the final of the tournament between Montserrat and Antigua, with Montserrat winning. The ground was not officially given for recreational use until 1936, when The Montserrat Company, owned by the Sturge family, donated the ground to the Government of Montserrat. The ground was named in honour of Joseph Sturge and his son. In keeping with his keeping Quaker values, alcohol was not permitted to be sold at the ground, though this rule was later relaxed. The next recorded match to be played there wasn't until 1967, when first-class cricket was played there for the first time with the Leeward Islands playing the Windward Islands. This was also the first time first-class cricket had been played on Montserrat. Montserrat continued to use the ground throughout the 1970s, while the next first-class match to be played there came in 1976 when the Leeward Islands played the touring Indians.
The following year a Combined Leeward and Windward Islands team played a first-class match against Guyana in the 1976/77 Shell Shield. In 1978, the ground held its first List A match when the Leeward Islands played Trinidad and Tobago in the 1977/78 Geddes Grant/Harrison Line Trophy. Throughout the 1970s, the ground was continuously used by Montserrat in its minor matches against regional neighbours. A second List A match was played there in 1980, between the Leeward Islands and Trinidad and Tobago in the 1979/80 Geddes Grant/Harrison Line Trophy, while the following year a further first-class match was played there when the Leeward Islands played a touring England XI. The next first-class fixture there came two years later, when the Leeward Islands played Jamaica in the 1982/83 Shell Shield. Two further List A matches were played there in the 1980s, the first seeing the Leeward Islands play Guyana in the 1984/85 Geddes Grant/Harrison Line Trophy, while the second saw them play the Windward Islands in the 1987/88 competition. Again in use by Montserrat throughout the 1980s, first-class cricket would not return there until 1994, when the Leeward Islands played Trinidad and Tobago in the 1993/94 Red Stripe Cup. The previous year, it had held a List A match between the Leeward Islands and Barbados in the 1992/93 Geddes Grant Shield. Unknowingly at the time, these would be the last major matches to be played there.
Beginning in 1995, the Soufrière Hills volcano on the island began to erupt, causing great damage to large parts of the island. Cricket continued to be played at Sturge Park until 1997, with the last fixture seeing Montserrat play a minor match against Antigua and Barbuda in May. In June 1997, a major eruption of the volcano destroyed Plymouth and along with it Sturge Park, burying the ground under layers of ash. A replacement ground, the Salem Oval, was opened in 2000 on the north of the island.
Records
First-class
Highest team total: 422 by Leeward Islands v Jamaica, 1982/83
Lowest team total: 99 by Trinidad and Tobago v Leeward Islands, 1993/94
Highest individual innings: 156 by Richie Richardson for Leeward Islands v Jamaica, 1982/83
Best bowling in an innings: 6/65 by Andy Roberts for Leeward Islands, as above
List A
Highest team total: 188/5 (49.2 overs) by Leeward Islands v Trinidad and Tobago, 1979/80
Lowest team total: 117/9 (50 overs) by Windward Islands v Leeward Islands, 1987/88
Highest individual innings: 76 by Keith D'Heurieux for Trinidad and Tobago v Leeward Islands, 1979/80
Best bowling in an innings: 4/21 by Winston Benjamin for Leeward Islands v Barbados, 1992/93
See also
List of cricket grounds in the West Indies
References
External links
Sturge Park at CricketArchive
Sturge Park at ESPNcricinfo
Cricket grounds in Montserrat
1997 disestablishments in Montserrat
|
The Vernon Dusters were a minor league baseball team based in Vernon, Texas. From 1947 to 1952, the Dusters played exclusively as members of the Longhorn League, qualifying for the playoffs on three occasions. Hosting home games at Wilbarger Memorial Stadium, the Dusters were the only minor league based in Vernon, Texas.
History
Minor league baseball started in Vernon in 1947, when the Vernon "Dusters" became charter members of the six-team Class D level Longhorn League. The Ballinger Cats, Big Spring Broncs, Midland Indians, Odessa Oilers and Sweetwater Sports joined Vernon in beginning Longhorn League play on April 23, 1947.
In their first season of play, the Dusters finished in last place. With a 42–87 record, the Vernon Dusters placed sixth in their first season of play Longhorn League play. Vernon drew 30,758 fans at home games for the 1947 season.
In 1948, the San Angelo Colts and Del Rio Cowboys joined the Longhorn League as the league expanded to eight teams. The Vernon Dusters placed fourth in the eight–team league with a 76–64 record, playing under manager Lloyd Rigby, drawing 50,250 fans. In the playoffs, Vernon defeated the Big Spring Broncs four games to two to advance. In the Finals, the Vernon Dusters lost to the Midland Indians in seven games.
The Dusters qualified for the playoffs in 1949. The Dusters finished with a record of 72–66 in 1949, placing third in the Longhorn League. Vernon lost to the Midland Indians four games to one in their playoff series. Vernon drew 50,386 for the season.
In 1949, Monty Stratton pitched briefly for the Vernon Dusters. Stratton had been a major league pitcher, whom had his career affected after a 1939 hunting accident that necessitated his right leg being amputated below the knee. Stratton pitched a complete-game shutout for the Vernon Dusters on a wooden right leg. Stratton was the inspiration for the feature film The Stratton Story starring James Stewart. The film opened in theaters in June, 1949.
The 1950 Vernon Dusters finished with a record 83–70, placing fourth in the Longhorn League final standings. They lost to the Odessa Oilers four games to one in the playoffs. Vernon drew 46,099 fans for the season.
In 1951, the Vernon Dusters did not qualify for the playoffs. Vernon finished with a regular season record of 67–71 and a sixth-place finish. The team drew 36,686 home game fans in 1951.
In 1952, Vernon played their final season and finished last. The Vernon Dusters finished with a record of 45–95, placing last in the Longhorn League. Vernon drew 30,015 total home game fans for the season. The franchise folded after the 1952 season.
Vernon, Texas has not hosted another minor league team.
The ballpark
The Vernon Dusters hosted minor league home games at Wilbarger Memorial Stadium. The ballpark had a capacity of 3,000 in 1947 and 3,500 in 1950. Wilbarger Memorial Stadium was located at 1826 Pease Street, Main Street & Wilbarger Street in Vernon, Texas.
Timeline
Year–by–year records
Notable alumni
Joe Berry (1950–1951, MGR)
Jerry Fahr (1947–1948)
Jim King (1950)
Pat McLaughlin (1952, MGR)
Monty Stratton (1949) Feature film: The Stratton Story
See also
Vernon Dusters players
References
External links
Vernon Dusters - Baseball Reference
Defunct minor league baseball teams
Professional baseball teams in Texas
Vernon, Texas
Defunct baseball teams in Texas
Baseball teams established in 1947
Baseball teams disestablished in 1952
Longhorn League teams
|
Merrill Church Meigs (November 25, 1883January 26, 1968) was the publisher of the Chicago Herald and Examiner in the 1920s. Inspired to become a pilot by Charles Lindbergh's solo flight across the Atlantic Ocean, he became a booster of Chicago as a world center of aviation.
He gave flying lessons to President Harry S. Truman.
Life and career
Meigs was born in Poweshiek County, Iowa, the son of Church Paddleford Meigs and Julianna S. (Burrell) Meigs. He grew up on a farm near Malcom, Iowa, where he was more interested in the mechanical devices used to raise crops than actually farming. In 1901, he took a job as a salesman for the J.I. Case Threshing Machine Company in Racine, Wisconsin. Within a year, he was in charge of the company's sales for South America. Despite not having graduated from high school, Meigs was allowed to enroll at the University of Chicago, where he played football under Amos Alonzo Stagg and also played baseball and water polo. He was the starting left guard of the 1905 University of Chicago national championship team . While at the college, he would also be the campus correspondent for the Chicago Herald and Examiner, of which he would become the executive later in his life. During World War II, Meigs served on the Office of Production Management as the aircraft expert.
In time Meigs would become a senior vice president of the Hearst Corporation, publisher of the old Chicago American newspaper as well as becoming the head of the Chicago Aero Commission. Meigs insisted that in addition to Midway Airport (then called Municipal Airport) and O'Hare Field (then called Orchard-Douglas), the city needed an airfield within ten minutes of the Loop. It opened in December 1948 and was renamed Meigs Field in his honor the following year. Fifty-five years after the renaming, Meigs Field was demolished by order of then-Chicago mayor Richard M. Daley.
Meigs retired in 1962 and became a consultant to the newspaper industry. He died at age 84.
Sources
Meigs - The Man Who Loved to Fly, Reprinted from Friends of Meigs Field, Chicago, IL. Accessed on Meigs Family History and Genealogy website, December 16, 2007
References
1883 births
1968 deaths
American football guards
American newspaper executives
Chicago Maroons baseball players
Chicago Maroons football players
Businesspeople from Chicago
20th-century American businesspeople
|
```java
Java Virtual Machine
Difference between ```HashMap``` and ```Hashtable```
Uses of the `final` keyword
Catch multiple exceptions in a single `catch` block
Limit Accessibility of `Fields`
```
|
The Symphony No. 14 in G minor, Op. 135, by Dmitri Shostakovich was completed in the spring of 1969, and was premiered later that year. It is a work for soprano, bass and a small string orchestra with percussion, consisting of eleven linked settings of poems by four authors. Most of the poems deal with the theme of death, particularly that of unjust or early death. They were set in Russian, although two other versions of the work exist with the texts all back-translated from Russian either into their original languages or into German. The symphony is dedicated to Benjamin Britten (who gave the UK premiere the following year at Aldeburgh).
Instrumentation
Besides the soloists, the symphony is scored for a chamber orchestra consisting only of strings and percussion. The strings consist of ten violins, four violas, three cellos, and two double basses, and the percussion section (two players) includes wood block, castanets, whip, soprano, alto and tenor tom-toms, xylophone, tubular bells, vibraphone, and celesta. The percussion section does not include common instruments such as timpani, bass drum, cymbals, or triangle.
Movements
The work has eleven linked movements, each a setting of a poem, with a total duration of around 50 minutes:
The first movement begins with the violins playing a theme reminiscent of the Dies irae, which plays a prominent role in the history of Russian music. Fragments of the theme are developed in various sections throughout the symphony; it recurs in its entirety in the climactic penultimate movement.
The work shows Shostakovich's willingness to adopt new techniques. All but two of the movements include themes using tone rows, which he uses to convey a sense of the abstract. He also makes dramatic use of tone clusters, such as the fortissimo chord illustrating the lily growing from the suicide's mouth in the fourth movement.
Overview
Composition
The Fourteenth Symphony was a creative response to Modest Mussorgsky's Songs and Dances of Death, which Shostakovich had orchestrated in 1962. Like Mussorgsky, Shostakovich brings back the subject of death in various images and situations. The Mussorgsky cycle contains only four songs — too few to do justice to Mussorgsky's concept, Shostakovich felt. He proceeded to expand it by selecting 11 poems by Federico García Lorca, Guillaume Apollinaire, Wilhelm Küchelbecker and Rainer Maria Rilke.
Shostakovich attached great importance to this work, commenting in a letter to Glikman: "Everything that I have written until now over these long years has been a preparation for this work." He added that he intended the symphony to prove a counterweight to the positive presentation of death in music:
"In part, I am trying to polemicise with the great classics who touched upon the theme of death in their work.... Remember the death of Boris Godunov. When ... he dies, then a kind of brightening sets in. Remember Verdi's Otello. When the whole tragedy ends, and Desdemona and Otello die, we also experience a beautiful tranquility. Remember Aida. When the tragic demise of the hero and heroine occurs, it is softened with radiant music."
In Mussorgsky's song cycle Shostakovich found a model that spoke out against death; in his symphony, he attempted to expand this protest still further. The composer wrote in his preface to the score:
I want listeners to reflect upon my new symphony ... to realise that they must lead pure and fruitful lives for the glory of their Motherland, their people and the most progressive ideas motivating our socialist society. That is what I was thinking about as I wrote my new work. I want my listeners, as they leave the hall after hearing my symphony, to think that life is truly beautiful.
While Shostakovich's intent may have been to emphasise that life is truly beautiful, he did so by starkly underlining the opposite — that the end of life is ugly and irredeemably negative. Toward this end, Shostakovich's music is sober in nature, and the composer was soon to extend these ideas in his last four string quartets as musical reflections on the themes of suffering and death. As in his orchestration of Songs, his orchestration of the symphony is spare but extremely imaginative. His writing for the voice is in small intervals, with much tonal repetition and attention paid to natural declamation. This practice is taken directly from Mussorgsky.
Premieres
The work received its official premiere in Leningrad on 29 September 1969 by the Moscow Chamber Orchestra under Rudolf Barshai. Four singers were involved in the first presentations of the work: the sopranos Galina Vishnevskaya and Margarita Miroshnikova, and the basses and Yevgeny Vladimirov. An initial performance, preceding the official Moscow and Leningrad premieres, was given by Miroshnikova and Vladimirov, but sources differ as to the vocalists in the official premieres. The official premiere recording on Melodiya was with Miroshnikova and Vladimirov.
The pre-premiere performance was notable for the commotion caused in the audience by Pavel Apostolov, one of the composer's most vicious critics, who suffered a heart attack or stroke. He did not die during the concert, as is often claimed (Shostakovich himself thought this to be the case), but a month or so afterwards.
The UK premiere was held at the Aldeburgh Festival in 1970 and was conducted by the dedicatee, Benjamin Britten.
Criticism
The composer himself was initially unsure what to call the work, eventually designating it a symphony rather than a song cycle to emphasise the unity of the work musically and philosophically: most of the poems deal with the subject of mortality (he rejected the title oratorio because the work lacks a chorus; it is not a choral symphony for the same reason).
Not all the movements are linked; there are a few breaks between movements that effectively divide the work into a "conventional" four-movement structure.
Many at the time (including Aleksandr Solzhenitsyn and Lev Lebedinsky) criticised the work as too pessimistic. Wilson argues that on the contrary "through careful ordering of the texts [he] conveys a specific message of protest at the arbitrary power exercised by dictators in sending the innocent to their deaths" (p. 411).
Shostakovich reportedly answered his critics in Testimony:
[My critics] read this idea in the Fourteenth Symphony: "death is all-powerful." They wanted the finale to be comforting, to say that death is only the beginning. But it's not a beginning, it's the real end, there will be nothing afterwards, nothing. I feel you must look truth right in the eyes ... To deny death and its power is useless. Deny it or not, you'll die anyway ... It's stupid to protest against death as such, but you can and must protest against violent death. It's bad when people die before their time from disease or poverty, but it's worse when a man is killed by another man.
The absence from the symphony of redemption or transcendence drew protests not only in the Soviet Union but also in the West, where the work was considered both obsessive and limited spiritually. Shostakovich was determined to avoid false consolation. This intent was a prime stimulus in writing the work. Some have found that the work's embracing of human mortality has been expressed with tremendous clarity. Others have found the work bleakly pessimistic and, especially in its opening De Profundis, virtually nihilistic. Regardless of opinion, the Fourteenth in performance is agreed to be a profound and powerful experience.
Notes
References
Fanning, David, Notes to Deutsche Grammophon 437785, Mussorgsky: Songs and Dances of Death; Shostakovich: Symphony No. 14, Brigitte Fassbaender, mezzo-soprano; Ljuba Kazarnovskaya, soprano; Sergei Leiferkus, bass; Gothenburg Symphony Orchestra conducted by Neeme Järvi.
Maes, Francis, tr. Arnold J. Pomerans and Erica Pomerans, A History of Russian Music: From Kamarinskaya to Babi Yar (Berkeley, Los Angeles and London: University of California Press, 2002). .
Morton, Brian, Shostakovich: His Life and Music (London: Haus Publishing Ltd., 2007). .
Shostakovich, Dmitri (1970). Symphony No. 14 for soprano, bass and chamber music. MCA Music Publishing.
Shostakovich, Dmitri and Glikman, Isaak (2001). Story of a Friendship: The Letters of Dmitry Shostakovich to Isaak Glikman. Cornell Univ Press. .
ed. Volkov, Solomon, trans. Antonina W. Bouis, Testimony: The Memoirs of Dmitri Shostakovich (New York: Harper & Row, 1979). .
Wilson, Elizabeth (1994). Shostakovich: A Life Remembered. Princeton University Press. .
External links
Texts of the poems
Symphonies by Dmitri Shostakovich
Shostakovich 14
Compositions in G minor
1969 compositions
|
Lieutenant-General Michael Brennan (2 February 1896 – 24 October 1986) was the Chief of Staff of the Irish Defence Forces from October 1931 until January 1940.
Brennan was born in Meelick, County Clare, and joined the Irish Republican Brotherhood in 1911. Two years later, he helped form the Irish Volunteers in Limerick city and soon he was training men in and around Meelick. He took part in preparations for the Easter Rising and spent the next five years in and out of prison and trouble, becoming the first O/C, East Clare Brigade, and later in charge of all three Clare Brigades of the IRA. This became the First Western Division, which Éamon de Valera reputedly described as the "best in the country".
References
1896 births
1986 deaths
Irish Army generals
|
David Haines may refer to:
David Haines (aid worker) (1970–2014), British humanitarian aid worker
David Haines (artist) (born 1969), British artist
|
```objective-c
/* Test forward-decls for @protocols. */
/* Author: Ziemowit Laski <zlaski@apple.com>. */
/* { dg-do compile } */
/* One-line substitute for objc/objc.h */
typedef struct objc_object { struct objc_class *class_pointer; } *id;
@protocol Bar;
@protocol Boo;
@protocol Foo
- (id <Bar>)someMethod;
- (id <Baz>)anotherMethod; /* { dg-error "annot find protocol declaration" } */
@end
@protocol Bar <Boo>
- (id <Foo>)someOtherMethod;
- (id <Baz>)anotherMethod; /* { dg-error "annot find protocol declaration" } */
- (id <Boo>)yetAnotherMethod;
@end
/* The following worthy test is stubbed out until we can get the
harness to match correctly on the "compilation terminated" message
when running on GNU/Linux. sts 2001-08-01 */
#if 0
@protocol Boo <Bar> /* { /*dg*/-error "has circular dependency" } */
@end
#endif
```
|
Rha Woong-bae (24 July 1934 – 25 April 2022) was a South Korean politician and businessman who was the Chairman of the Hanbit Forum. He was also Finance and Economy Minister and Deputy Prime Minister of South Korea under President Kim Dae-jung. He served as Trade and Industry Minister in the 1980s.
He held a PhD (1968) from the Haas School of Business at the University of California, Berkeley.
References
1934 births
2022 deaths
Haas School of Business alumni
Government ministers of South Korea
Deputy Prime Ministers of South Korea
Finance ministers of South Korea
Members of the National Assembly (South Korea)
20th-century South Korean businesspeople
Presidents of universities and colleges in South Korea
Academic staff of Seoul National University
Seoul National University alumni
Stanford University alumni
University of California, Berkeley alumni
Businesspeople from Seoul
Naju Na clan
20th-century South Korean politicians
|
```c++
/*=============================================================================
file LICENSE_1_0.txt or copy at path_to_url
==============================================================================*/
#ifndef PHOENIX_OPERATOR_DETAIL_IO_HPP
#define PHOENIX_OPERATOR_DETAIL_IO_HPP
#include <boost/spirit/home/phoenix/operator/bitwise.hpp>
#include <boost/spirit/home/phoenix/core/reference.hpp>
#include <boost/utility/addressof.hpp>
#include <boost/utility/enable_if.hpp>
#include <iostream>
namespace boost { namespace phoenix { namespace detail
{
typedef char(&no)[1];
typedef char(&yes)[2];
template <typename CharType, typename CharTrait>
yes ostream_test(std::basic_ostream<CharType, CharTrait>*);
no ostream_test(...);
template <typename CharType, typename CharTrait>
yes istream_test(std::basic_istream<CharType, CharTrait>*);
no istream_test(...);
template <typename T>
struct is_ostream
{
static T x;
BOOST_STATIC_CONSTANT(bool,
value = sizeof(detail::ostream_test(boost::addressof(x))) == sizeof(yes));
};
template <typename T>
struct is_istream
{
static T x;
BOOST_STATIC_CONSTANT(bool,
value = sizeof(detail::istream_test(boost::addressof(x))) == sizeof(yes));
};
template <typename T0, typename T1>
struct enable_if_ostream :
enable_if<
detail::is_ostream<T0>
, actor<
typename as_composite<
shift_left_eval
, actor<reference<T0> >
, actor<T1>
>::type
>
>
{};
template <typename T0, typename T1>
struct enable_if_istream :
enable_if<
detail::is_istream<T0>
, actor<
typename as_composite<
shift_right_eval
, actor<reference<T0> >
, actor<T1>
>::type
>
>
{};
typedef std::ios_base& (*iomanip_type)(std::ios_base&);
typedef std::istream& (*imanip_type)(std::istream&);
typedef std::ostream& (*omanip_type)(std::ostream&);
}}}
#endif
```
|
```c++
#pragma once
// (See path_to_url
#include <compare>
#include <functional>
#include <iostream>
#include <type_safe/strong_typedef.hpp>
namespace pqrs {
namespace osx {
namespace iokit_registry_entry_id {
struct value_t : type_safe::strong_typedef<value_t, uint64_t>,
type_safe::strong_typedef_op::equality_comparison<value_t>,
type_safe::strong_typedef_op::relational_comparison<value_t> {
using strong_typedef::strong_typedef;
constexpr auto operator<=>(const value_t& other) const {
return type_safe::get(*this) <=> type_safe::get(other);
}
};
inline std::ostream& operator<<(std::ostream& stream, const value_t& value) {
return stream << type_safe::get(value);
}
} // namespace iokit_registry_entry_id
} // namespace osx
} // namespace pqrs
namespace std {
template <>
struct hash<pqrs::osx::iokit_registry_entry_id::value_t> : type_safe::hashable<pqrs::osx::iokit_registry_entry_id::value_t> {
};
} // namespace std
```
|
The Artful Dodger is a 2023 television series produced by Beach Road Pictures and Curio Pictures for streaming service Disney+ Star. A spin-off featuring characters from the Charles Dickens classic book Oliver Twist (1838). It features Thomas Brodie-Sangster as the eponymous Artful Dodger and David Thewlis as Fagin. The eight-part series is created by James McNamara, David Maher and David Taylor. It is directed and produced by Jeffrey Walker. Also directing are Corrie Chen and Gracie Otto.
Synopsis
In Australia in the 1850's, Jack Dawkins works as a seemingly respectable surgeon. However, when an old acquaintance resurfaces, his penchant for a life of crime from his time as a London-based pickpocket called Artful Dodger, also returns.
Cast
Thomas Brodie-Sangster as Artful Dodger
David Thewlis as Fagin
Maia Mitchell as Lady Belle Fox
Damon Herriman
Miranda Tapsell
Huw Higginson
Susie Porter
Damien Garvey
Andrea Demetriade
Jessica De Gouw
Kym Gyngell
Luke Carroll
Tim Minchin
Lucy-Rose Leonard
Jude Hyland
Nicholas Burton
Finn Treacy
Albert Latailakepa
Episodes
Production
The project was announced in 2022. The eight-part series is a co-production between Sony Pictures Television's Curio Pictures and Beach Road Pictures. Jo Porter represents Curio Pictures as executive producer, while David Maher and David Taylor executive produce for Beach Road Pictures.
It is created by James McNamara, David Maher and David Taylor. Writers on the series include McNamara, Andrew Knight, Vivienne Walshe and Dan Knight, with Miranda Tapsell a story consultant. It is produced by Jeffrey Walker who is also a director, alongside Corrie Chen and Gracie Otto.
Casting
In November 2022, the lead cast was confirmed as including David Thewlis, Thomas Brodie-Sangster and Maia Mitchell.
Filming
Filming took place in Sydney, New South Wales.
Broadcast
The series is set to air in Australia on streaming service Disney+ Star on 29 November 2023.
References
External links
2023 Australian television series debuts
Upcoming comedy television series
Star (Disney+) original programming
English-language television shows
Television series by Sony Pictures Television
Television series set in the 19th century
Television shows based on Oliver Twist
Television shows filmed in Australia
|
Major-General the Hon. John Edward Lindley (15 September 1860 – 7 April 1925) was a British Army officer.
Military career
Born the son of Nathaniel Lindley, Baron Lindley and Sarah Katherine Teale, Lindley was commissioned into the South Staffordshire Regiment but transferred to the 1st The Royal Dragoons on 19 November 1881. After serving in the Second Boer War, he became Adjutant-General at Northern Command in 1903, Commandant of the Cavalry School in 1905 and commander of the 3rd Cavalry Brigade in 1907. He went on to become General Officer Commanding the Welsh Division in October 1914. He landed with his division at Suvla Bay on 6 August 1915 during the Gallipoli campaign of the First World War, in which action his division suffered significant losses: he voluntarily handed over his command, saying that he had "lost control", on 16 August 1915.
References
1860 births
1925 deaths
British Army generals of World War I
South Staffordshire Regiment officers
1st The Royal Dragoons officers
Sons of life peers
British Army major generals
British Army personnel of the Second Boer War
|
```javascript
import React, { Component, PropTypes } from 'react'
import { Link } from 'react-router'
import OptBtnGroup from 'COMPONENT/Msg/OptBtnGroup'
import dateTimeFormatter from 'UTIL/dateTimeFormatter'
import msgService from 'SERVICE/msgService'
export default class MsgDetail extends Component {
/**
* Context path_to_url
* this.context.router this.props.history
* Warning: [react-router] `props.history` and `context.history` are deprecated. Please use `context.router`. path_to_url
*/
static contextTypes = {
router: PropTypes.object.isRequired
}
constructor (props, context) {
super(props, context)
this.state = { msg: {} }
}
componentWillMount() {
// P.S: Vue Demo API
// state
// state
let { msg: { msgs }, params: { msgId } } = this.props
let msg = msgs.filter(({ id }) => id === msgId)[0]
msg ? this.setState({ msg }) : this.fetchMsgFromAPI(msgId)
}
fetchMsgFromAPI (msgId) {
msgService.fetch({ msgId }).then(msg => {
if (!msg) return this.context.router.replace('/msg')
this.setState({ msg })
})
}
render () {
let { userData, delMsg } = this.props
let msg = this.state.msg
return (
<div className="panel panel-warning">
<div className="panel-heading">
<strong>{ msg.title }</strong>
<span className="badge pull-right">
{ dateTimeFormatter(msg.time) }
</span>
<br/>
<Link to={`/msg?author=${msg.author}`}>
<i>{ msg.author }</i>
</Link>
<OptBtnGroup
msgId={msg.id}
isAuthor={userData && userData.username === msg.author}
delMsg={delMsg}
parentName="MsgDetail">
<button /* Vue slot */
className="btn btn-primary btn-xs"
onClick={() => this.context.router.goBack()}>
</button>
</OptBtnGroup>
</div>
<div className="panel-body">
{ msg.content }
</div>
</div>
)
}
}
```
|
```smalltalk
namespace Volo.Abp.ExceptionHandling;
public interface IHasErrorDetails
{
string? Details { get; }
}
```
|
58th (Middlesex) Searchlight Regiment, Royal Artillery was an air defence unit of Britain's Territorial Army (TA) raised just before World War II. It defended the East Midlands of England during The Blitz, and later served as infantry in North West Europe at the end of the war, converting to the anti-aircraft (AA) artillery role postwar.
Origin
This searchlight unit was formed as part of the doubling in size of the TA at the time of the Munich Crisis in late 1938. Formally, it was a duplicate of 36th (Middlesex) Anti-Aircraft Battalion, Royal Engineers, based on 344 AA Company at Harrow, which was transferred from 36th AA Battalion to provide a cadre of trained men. Two new companies were then formed to give the unit the following organisation:
58th (Middlesex) Anti-Aircraft Battalion, Royal Engineers
HQ at Elmgrove Road, Harrow
344 AA Company at Harrow
425 AA Company at Drill Hall, Roxeth, South Harrow
426 AA Company at Harrow
The first commanding officer was Lt-Col Edward Boggis, MBE, who had been officer commanding 344th AA Company.
World War II
Mobilisation
In February 1939 the existing AA defences came under the control of a new Anti-Aircraft Command. In June a partial mobilisation of TA units was begun in a process known as 'couverture', whereby each AA unit did a month's tour of duty in rotation to man selected AA and searchlight positions. On 24 August, ahead of the declaration of war, AA Command was fully mobilised at its war stations. The outbreak of World War II saw 58 AA Battalion forming part of 40th Anti-Aircraft Brigade in 2nd AA Division. Based at RAF Duxford, the brigade was responsible for providing AA defence for RAF airfields in East Anglia. In April 1940, 58th moved to come under the command of 39 AA Bde.
Battle of Britain and Blitz
On 1 August 1940 the Royal Engineers' AA battalions were transferred to the Royal Artillery (RA), being redesignated searchlight regiments, and the companies became batteries. By this time 58th (Middlesex) had been moved to 32nd (Midland) Anti-Aircraft Brigade, still in 2 AA Division, but now responsible for AA defence of the East Midlands during the forthcoming Blitz.
A new 511 S/L Bty was formed for the regiment in late 1940. Initially it was attached to the 40th (Sherwood Foresters) S/L Rgt and remained in 39 AA Bde, coming under command of 30th (Surrey) S/L Rgt from 8 January (when it was considered operationally active) until 12 May 1941, when it rejoined 58th S/L Rgt. The battery permanently joined 30th (Surrey) S/L Rgt in early 1942. The regiment also supplied a cadre of experienced officers and men to 233rd S/L Training Rgt at Saighton Camp where it provided the basis for a new 539 S/L Bty formed on 12 December 1940. This battery later joined a newly-forming 88th S/L Rgt.
In 1941 the searchlight layout over the Midlands was reorganised, so that any hostile raid approaching the Gun Defended Areas (GDA) around the towns must cross more than one searchlight belt, and then within the GDAs the concentration of lights was increased.
344th Battery
On 19 April 1943, 344th Bty received orders to train for a mobile role, and after this training it joined 100 AA Bde on 30 June. 100 AA Bde was one of the formations slated to participate in Operation Overlord (the Allied invasion of Normandy planned for 1944) and shortly afterwards the battery became formally independent of 58 S/L regiment. 344th Independent S/L Bty proceeded to Normandy in July 1944 where it pioneered the use of searchlights to create artificial moonlight, otherwise known as movement light or 'Monty's Moonlight', to aid movement in night operations by 21st Army Group. In February 1945 it changed its title to 344th Independent Moonlight Bty and split off a separate 581st Independent Moonlight Battery.
Operation Diver
Meanwhile, the rest of 58th S/L Regt (425 and 426 Btys) had remained with AA Command. In May 1944 it was joined by 314 (Kent) S/L Bty from 29th (Kent) S/L Rgt. Then on 1 June E Troop of 372 S/L Bty of 43rd (5th Duke of Wellington's Regiment) S/L Rgt joined and became E Trp of 425 S/L Bty. Soon after D Day in June 1944 the bombardment of London by German V-1 flying bombs began, and AA Command was engaged in the efforts to combat them (Operation Diver). Much of AA Command's strength was repositioned on the South Coast of England to engage the V-1s as they came in over the sea. In the centre of the line at Dungeness were four Z Batteries, each of 64 twin 3-inch rocket-launchers. Z Batteries defending towns were by 1944 largely manned by shifts of part-time members of the Home Guard, but for these frontline batteries the detachments were provided by 58th S/L Regiment, which had been hastily trained in the new role.
The most severe phase of V1 attacks on the UK ended in September 1944 after the launching sites were overrun by the advance of 21st Army Group along the coast of France and Belgium.
Infantry role
By the end of 1944, the German Luftwaffe was suffering from such shortages of pilots, aircraft and fuel that serious aerial attacks on the United Kingdom could be discounted and the War Office began reorganising surplus anti-aircraft regiments in the UK into infantry battalions for duties in the rear areas. 58th Searchlight Regiment was one of the units selected for conversion, and on 9 November 1944 it was ordered to convert, being redesignated 58th (Middlesex) Garrison Regiment, RA. (314 Searchlight Bty became independent and eventually rejoined 29th S/L Rgt.)
Meanwhile, 21st Army Group fighting in North West Europe was suffering a severe manpower shortage, particularly among the infantry. In January 1945, the War Office accelerated the conversion of surplus artillery into infantry units, primarily for line of communication and occupation duties, thereby releasing trained infantry for frontline service. 58 Garrison Regiment was redesignated again, becoming 611 (Middlesex) Infantry Regiment, RA in February. It went to North West Europe the following month and did duty with Second Army until after VE Day. It was placed in suspended animation on 31 October 1945.
Postwar
When the TA was reconstituted on 1 January 1947 the regiment reformed as 593 (Middlesex) (Mixed) Heavy Anti-Aircraft Regiment, RA at Harrow, ('mixed' indicating that it was composed partly of members of the Women's Royal Army Corps). Its title was later changed to 593 (Harrow) HAA Regiment. It was assigned to 82 AA Bde based at Heston
On 10 March 1955 Anti-Aircraft Command was disbanded, and many of its TA regiments were reduced: 593 HAA Regiment was placed in suspended animation, and completely disbanded on 4 July that year.
Badge
During 1941, the regiment adopted as its arm badge a blue Cornflower embroidered on a khaki disc. The cornflower is the traditional buttonhole worn by supporters of Harrow School at the Eton-Harrow match, the annual cricket match against Eton College held at Lord's Cricket Ground. The regiment and its successors continued to wear the badge until disbandment in 1955.
Notes
References
Maj L. F. Ellis, History of the Second World War, United Kingdom Military Series: Victory in the West, Vol II: The Defeat of Germany, London: HM Stationery Office, 1968/Uckfield: Naval & Military, 2004, .
Gen Sir Martin Farndale, History of the Royal Regiment of Artillery: The Years of Defeat: Europe and North Africa, 1939–1941, Woolwich: Royal Artillery Institution, 1988/London: Brasseys, 1996, .
J.B.M. Frederick, Lineage Book of British Land Forces 1660–1978, Vol II, Wakefield: Microform Academic, 1984, .
Norman E. H. Litchfield, The Territorial Artillery 1908–1988 (Their Lineage, Uniforms and Badges), Nottingham: Sherwood Press, 1992, .
Brig N. W. Routledge, History of the Royal Regiment of Artillery: Anti-Aircraft Artillery 1914–55, London: Royal Artillery Institution/Brassey's, 1994, .
Graham E. Watson & Richard A. Rinaldi, The Corps of Royal Engineers: Organization and Units 1889–2018, Tiger Lily Books, 2018, .
Online sources
British Army units from 1945 on
British Military History
Orders of Battle at Patriot Files
Sir Frederick Pile's despatch: "The Anti-Aircraft Defence of the United Kingdom from 28th July, 1939, to 15th April, 1945" London Gazette 18 December 1947.
The Royal Artillery 1939–45
Graham Watson, The Territorial Army 1947
Military units and formations established in 1938
Military units and formations in Harrow, Middlesex
Military units and formations in London
Military units and formations in Middlesex
Searchlight regiments of the Royal Artillery
Military units and formations disestablished in 1955
|
```objective-c
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: google/protobuf/unittest_import_public.proto
#ifndef your_sha256_hash_INCLUDED
#define your_sha256_hash_INCLUDED
#include <string>
#include <google/protobuf/stubs/common.h>
#if GOOGLE_PROTOBUF_VERSION < 3001000
#error This file was generated by a newer version of protoc which is
#error incompatible with your Protocol Buffer headers. Please update
#error your headers.
#endif
#if 3001000 < GOOGLE_PROTOBUF_MIN_PROTOC_VERSION
#error This file was generated by an older version of protoc which is
#error incompatible with your Protocol Buffer headers. Please
#error regenerate this file with a newer version of protoc.
#endif
#include <google/protobuf/arena.h>
#include <google/protobuf/arenastring.h>
#include <google/protobuf/generated_message_util.h>
#include <google/protobuf/metadata.h>
#include <google/protobuf/message.h>
#include <google/protobuf/repeated_field.h>
#include <google/protobuf/extension_set.h>
#include <google/protobuf/unknown_field_set.h>
// @@protoc_insertion_point(includes)
namespace protobuf_unittest_import {
// Internal implementation detail -- do not call these.
void your_sha256_hash2eproto();
void your_sha256_hashblic_2eproto();
void your_sha256_hashic_2eproto();
void your_sha256_hashblic_2eproto();
class PublicImportMessage;
// ===================================================================
class PublicImportMessage : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:protobuf_unittest_import.PublicImportMessage) */ {
public:
PublicImportMessage();
virtual ~PublicImportMessage();
PublicImportMessage(const PublicImportMessage& from);
inline PublicImportMessage& operator=(const PublicImportMessage& from) {
CopyFrom(from);
return *this;
}
inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
return _internal_metadata_.unknown_fields();
}
inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
return _internal_metadata_.mutable_unknown_fields();
}
static const ::google::protobuf::Descriptor* descriptor();
static const PublicImportMessage& default_instance();
static const PublicImportMessage* internal_default_instance();
void Swap(PublicImportMessage* other);
// implements Message ----------------------------------------------
inline PublicImportMessage* New() const { return New(NULL); }
PublicImportMessage* New(::google::protobuf::Arena* arena) const;
void CopyFrom(const ::google::protobuf::Message& from);
void MergeFrom(const ::google::protobuf::Message& from);
void CopyFrom(const PublicImportMessage& from);
void MergeFrom(const PublicImportMessage& from);
void Clear();
bool IsInitialized() const;
size_t ByteSizeLong() const;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input);
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* output) const;
::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const {
return InternalSerializeWithCachedSizesToArray(false, output);
}
int GetCachedSize() const { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const;
void InternalSwap(PublicImportMessage* other);
void UnsafeMergeFrom(const PublicImportMessage& from);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return _internal_metadata_.arena();
}
inline void* MaybeArenaPtr() const {
return _internal_metadata_.raw_arena_ptr();
}
public:
::google::protobuf::Metadata GetMetadata() const;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// optional int32 e = 1;
bool has_e() const;
void clear_e();
static const int kEFieldNumber = 1;
::google::protobuf::int32 e() const;
void set_e(::google::protobuf::int32 value);
// @@protoc_insertion_point(class_scope:protobuf_unittest_import.PublicImportMessage)
private:
inline void set_has_e();
inline void clear_has_e();
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::internal::HasBits<1> _has_bits_;
mutable int _cached_size_;
::google::protobuf::int32 e_;
friend void your_sha256_hashblic_2eproto_impl();
friend void your_sha256_hash2eproto_impl();
friend void your_sha256_hashic_2eproto();
friend void your_sha256_hashblic_2eproto();
void InitAsDefaultInstance();
};
extern ::google::protobuf::internal::ExplicitlyConstructed<PublicImportMessage> PublicImportMessage_default_instance_;
// ===================================================================
// ===================================================================
#if !PROTOBUF_INLINE_NOT_IN_HEADERS
// PublicImportMessage
// optional int32 e = 1;
inline bool PublicImportMessage::has_e() const {
return (_has_bits_[0] & 0x00000001u) != 0;
}
inline void PublicImportMessage::set_has_e() {
_has_bits_[0] |= 0x00000001u;
}
inline void PublicImportMessage::clear_has_e() {
_has_bits_[0] &= ~0x00000001u;
}
inline void PublicImportMessage::clear_e() {
e_ = 0;
clear_has_e();
}
inline ::google::protobuf::int32 PublicImportMessage::e() const {
// @@protoc_insertion_point(field_get:protobuf_unittest_import.PublicImportMessage.e)
return e_;
}
inline void PublicImportMessage::set_e(::google::protobuf::int32 value) {
set_has_e();
e_ = value;
// @@protoc_insertion_point(field_set:protobuf_unittest_import.PublicImportMessage.e)
}
inline const PublicImportMessage* PublicImportMessage::internal_default_instance() {
return &PublicImportMessage_default_instance_.get();
}
#endif // !PROTOBUF_INLINE_NOT_IN_HEADERS
// @@protoc_insertion_point(namespace_scope)
} // namespace protobuf_unittest_import
// @@protoc_insertion_point(global_scope)
#endif // your_sha256_hash_INCLUDED
```
|
```python
"""
Functions that ignore NaN.
Functions
---------
- `nanmin` -- minimum non-NaN value
- `nanmax` -- maximum non-NaN value
- `nanargmin` -- index of minimum non-NaN value
- `nanargmax` -- index of maximum non-NaN value
- `nansum` -- sum of non-NaN values
- `nanprod` -- product of non-NaN values
- `nancumsum` -- cumulative sum of non-NaN values
- `nancumprod` -- cumulative product of non-NaN values
- `nanmean` -- mean of non-NaN values
- `nanvar` -- variance of non-NaN values
- `nanstd` -- standard deviation of non-NaN values
- `nanmedian` -- median of non-NaN values
- `nanpercentile` -- qth percentile of non-NaN values
"""
from __future__ import division, absolute_import, print_function
import warnings
import numpy as np
from numpy.lib.function_base import _ureduce as _ureduce
__all__ = [
'nansum', 'nanmax', 'nanmin', 'nanargmax', 'nanargmin', 'nanmean',
'nanmedian', 'nanpercentile', 'nanvar', 'nanstd', 'nanprod',
'nancumsum', 'nancumprod'
]
def _replace_nan(a, val):
"""
If `a` is of inexact type, make a copy of `a`, replace NaNs with
the `val` value, and return the copy together with a boolean mask
marking the locations where NaNs were present. If `a` is not of
inexact type, do nothing and return `a` together with a mask of None.
Note that scalars will end up as array scalars, which is important
for using the result as the value of the out argument in some
operations.
Parameters
----------
a : array-like
Input array.
val : float
NaN values are set to val before doing the operation.
Returns
-------
y : ndarray
If `a` is of inexact type, return a copy of `a` with the NaNs
replaced by the fill value, otherwise return `a`.
mask: {bool, None}
If `a` is of inexact type, return a boolean mask marking locations of
NaNs, otherwise return None.
"""
a = np.array(a, subok=True, copy=True)
if a.dtype == np.object_:
# object arrays do not support `isnan` (gh-9009), so make a guess
mask = a != a
elif issubclass(a.dtype.type, np.inexact):
mask = np.isnan(a)
else:
mask = None
if mask is not None:
np.copyto(a, val, where=mask)
return a, mask
def _copyto(a, val, mask):
"""
Replace values in `a` with NaN where `mask` is True. This differs from
copyto in that it will deal with the case where `a` is a numpy scalar.
Parameters
----------
a : ndarray or numpy scalar
Array or numpy scalar some of whose values are to be replaced
by val.
val : numpy scalar
Value used a replacement.
mask : ndarray, scalar
Boolean array. Where True the corresponding element of `a` is
replaced by `val`. Broadcasts.
Returns
-------
res : ndarray, scalar
Array with elements replaced or scalar `val`.
"""
if isinstance(a, np.ndarray):
np.copyto(a, val, where=mask, casting='unsafe')
else:
a = a.dtype.type(val)
return a
def _remove_nan_1d(arr1d, overwrite_input=False):
"""
Equivalent to arr1d[~arr1d.isnan()], but in a different order
Presumably faster as it incurs fewer copies
Parameters
----------
arr1d : ndarray
Array to remove nans from
overwrite_input : bool
True if `arr1d` can be modified in place
Returns
-------
res : ndarray
Array with nan elements removed
overwrite_input : bool
True if `res` can be modified in place, given the constraint on the
input
"""
c = np.isnan(arr1d)
s = np.nonzero(c)[0]
if s.size == arr1d.size:
warnings.warn("All-NaN slice encountered", RuntimeWarning, stacklevel=4)
return arr1d[:0], True
elif s.size == 0:
return arr1d, overwrite_input
else:
if not overwrite_input:
arr1d = arr1d.copy()
# select non-nans at end of array
enonan = arr1d[-s.size:][~c[-s.size:]]
# fill nans in beginning of array with non-nans of end
arr1d[s[:enonan.size]] = enonan
return arr1d[:-s.size], True
def _divide_by_count(a, b, out=None):
"""
Compute a/b ignoring invalid results. If `a` is an array the division
is done in place. If `a` is a scalar, then its type is preserved in the
output. If out is None, then then a is used instead so that the
division is in place. Note that this is only called with `a` an inexact
type.
Parameters
----------
a : {ndarray, numpy scalar}
Numerator. Expected to be of inexact type but not checked.
b : {ndarray, numpy scalar}
Denominator.
out : ndarray, optional
Alternate output array in which to place the result. The default
is ``None``; if provided, it must have the same shape as the
expected output, but the type will be cast if necessary.
Returns
-------
ret : {ndarray, numpy scalar}
The return value is a/b. If `a` was an ndarray the division is done
in place. If `a` is a numpy scalar, the division preserves its type.
"""
with np.errstate(invalid='ignore', divide='ignore'):
if isinstance(a, np.ndarray):
if out is None:
return np.divide(a, b, out=a, casting='unsafe')
else:
return np.divide(a, b, out=out, casting='unsafe')
else:
if out is None:
return a.dtype.type(a / b)
else:
# This is questionable, but currently a numpy scalar can
# be output to a zero dimensional array.
return np.divide(a, b, out=out, casting='unsafe')
def nanmin(a, axis=None, out=None, keepdims=np._NoValue):
"""
Return minimum of an array or minimum along an axis, ignoring any NaNs.
When all-NaN slices are encountered a ``RuntimeWarning`` is raised and
Nan is returned for that slice.
Parameters
----------
a : array_like
Array containing numbers whose minimum is desired. If `a` is not an
array, a conversion is attempted.
axis : int, optional
Axis along which the minimum is computed. The default is to compute
the minimum of the flattened array.
out : ndarray, optional
Alternate output array in which to place the result. The default
is ``None``; if provided, it must have the same shape as the
expected output, but the type will be cast if necessary. See
`doc.ufuncs` for details.
.. versionadded:: 1.8.0
keepdims : bool, optional
If this is set to True, the axes which are reduced are left
in the result as dimensions with size one. With this option,
the result will broadcast correctly against the original `a`.
If the value is anything but the default, then
`keepdims` will be passed through to the `min` method
of sub-classes of `ndarray`. If the sub-classes methods
does not implement `keepdims` any exceptions will be raised.
.. versionadded:: 1.8.0
Returns
-------
nanmin : ndarray
An array with the same shape as `a`, with the specified axis
removed. If `a` is a 0-d array, or if axis is None, an ndarray
scalar is returned. The same dtype as `a` is returned.
See Also
--------
nanmax :
The maximum value of an array along a given axis, ignoring any NaNs.
amin :
The minimum value of an array along a given axis, propagating any NaNs.
fmin :
Element-wise minimum of two arrays, ignoring any NaNs.
minimum :
Element-wise minimum of two arrays, propagating any NaNs.
isnan :
Shows which elements are Not a Number (NaN).
isfinite:
Shows which elements are neither NaN nor infinity.
amax, fmax, maximum
Notes
-----
NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
(IEEE 754). This means that Not a Number is not equivalent to infinity.
Positive infinity is treated as a very large number and negative
infinity is treated as a very small (i.e. negative) number.
If the input has a integer type the function is equivalent to np.min.
Examples
--------
>>> a = np.array([[1, 2], [3, np.nan]])
>>> np.nanmin(a)
1.0
>>> np.nanmin(a, axis=0)
array([ 1., 2.])
>>> np.nanmin(a, axis=1)
array([ 1., 3.])
When positive infinity and negative infinity are present:
>>> np.nanmin([1, 2, np.nan, np.inf])
1.0
>>> np.nanmin([1, 2, np.nan, np.NINF])
-inf
"""
kwargs = {}
if keepdims is not np._NoValue:
kwargs['keepdims'] = keepdims
if type(a) is np.ndarray and a.dtype != np.object_:
# Fast, but not safe for subclasses of ndarray, or object arrays,
# which do not implement isnan (gh-9009), or fmin correctly (gh-8975)
res = np.fmin.reduce(a, axis=axis, out=out, **kwargs)
if np.isnan(res).any():
warnings.warn("All-NaN slice encountered", RuntimeWarning, stacklevel=2)
else:
# Slow, but safe for subclasses of ndarray
a, mask = _replace_nan(a, +np.inf)
res = np.amin(a, axis=axis, out=out, **kwargs)
if mask is None:
return res
# Check for all-NaN axis
mask = np.all(mask, axis=axis, **kwargs)
if np.any(mask):
res = _copyto(res, np.nan, mask)
warnings.warn("All-NaN axis encountered", RuntimeWarning, stacklevel=2)
return res
def nanmax(a, axis=None, out=None, keepdims=np._NoValue):
"""
Return the maximum of an array or maximum along an axis, ignoring any
NaNs. When all-NaN slices are encountered a ``RuntimeWarning`` is
raised and NaN is returned for that slice.
Parameters
----------
a : array_like
Array containing numbers whose maximum is desired. If `a` is not an
array, a conversion is attempted.
axis : int, optional
Axis along which the maximum is computed. The default is to compute
the maximum of the flattened array.
out : ndarray, optional
Alternate output array in which to place the result. The default
is ``None``; if provided, it must have the same shape as the
expected output, but the type will be cast if necessary. See
`doc.ufuncs` for details.
.. versionadded:: 1.8.0
keepdims : bool, optional
If this is set to True, the axes which are reduced are left
in the result as dimensions with size one. With this option,
the result will broadcast correctly against the original `a`.
If the value is anything but the default, then
`keepdims` will be passed through to the `max` method
of sub-classes of `ndarray`. If the sub-classes methods
does not implement `keepdims` any exceptions will be raised.
.. versionadded:: 1.8.0
Returns
-------
nanmax : ndarray
An array with the same shape as `a`, with the specified axis removed.
If `a` is a 0-d array, or if axis is None, an ndarray scalar is
returned. The same dtype as `a` is returned.
See Also
--------
nanmin :
The minimum value of an array along a given axis, ignoring any NaNs.
amax :
The maximum value of an array along a given axis, propagating any NaNs.
fmax :
Element-wise maximum of two arrays, ignoring any NaNs.
maximum :
Element-wise maximum of two arrays, propagating any NaNs.
isnan :
Shows which elements are Not a Number (NaN).
isfinite:
Shows which elements are neither NaN nor infinity.
amin, fmin, minimum
Notes
-----
NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
(IEEE 754). This means that Not a Number is not equivalent to infinity.
Positive infinity is treated as a very large number and negative
infinity is treated as a very small (i.e. negative) number.
If the input has a integer type the function is equivalent to np.max.
Examples
--------
>>> a = np.array([[1, 2], [3, np.nan]])
>>> np.nanmax(a)
3.0
>>> np.nanmax(a, axis=0)
array([ 3., 2.])
>>> np.nanmax(a, axis=1)
array([ 2., 3.])
When positive infinity and negative infinity are present:
>>> np.nanmax([1, 2, np.nan, np.NINF])
2.0
>>> np.nanmax([1, 2, np.nan, np.inf])
inf
"""
kwargs = {}
if keepdims is not np._NoValue:
kwargs['keepdims'] = keepdims
if type(a) is np.ndarray and a.dtype != np.object_:
# Fast, but not safe for subclasses of ndarray, or object arrays,
# which do not implement isnan (gh-9009), or fmax correctly (gh-8975)
res = np.fmax.reduce(a, axis=axis, out=out, **kwargs)
if np.isnan(res).any():
warnings.warn("All-NaN slice encountered", RuntimeWarning, stacklevel=2)
else:
# Slow, but safe for subclasses of ndarray
a, mask = _replace_nan(a, -np.inf)
res = np.amax(a, axis=axis, out=out, **kwargs)
if mask is None:
return res
# Check for all-NaN axis
mask = np.all(mask, axis=axis, **kwargs)
if np.any(mask):
res = _copyto(res, np.nan, mask)
warnings.warn("All-NaN axis encountered", RuntimeWarning, stacklevel=2)
return res
def nanargmin(a, axis=None):
"""
Return the indices of the minimum values in the specified axis ignoring
NaNs. For all-NaN slices ``ValueError`` is raised. Warning: the results
cannot be trusted if a slice contains only NaNs and Infs.
Parameters
----------
a : array_like
Input data.
axis : int, optional
Axis along which to operate. By default flattened input is used.
Returns
-------
index_array : ndarray
An array of indices or a single index value.
See Also
--------
argmin, nanargmax
Examples
--------
>>> a = np.array([[np.nan, 4], [2, 3]])
>>> np.argmin(a)
0
>>> np.nanargmin(a)
2
>>> np.nanargmin(a, axis=0)
array([1, 1])
>>> np.nanargmin(a, axis=1)
array([1, 0])
"""
a, mask = _replace_nan(a, np.inf)
res = np.argmin(a, axis=axis)
if mask is not None:
mask = np.all(mask, axis=axis)
if np.any(mask):
raise ValueError("All-NaN slice encountered")
return res
def nanargmax(a, axis=None):
"""
Return the indices of the maximum values in the specified axis ignoring
NaNs. For all-NaN slices ``ValueError`` is raised. Warning: the
results cannot be trusted if a slice contains only NaNs and -Infs.
Parameters
----------
a : array_like
Input data.
axis : int, optional
Axis along which to operate. By default flattened input is used.
Returns
-------
index_array : ndarray
An array of indices or a single index value.
See Also
--------
argmax, nanargmin
Examples
--------
>>> a = np.array([[np.nan, 4], [2, 3]])
>>> np.argmax(a)
0
>>> np.nanargmax(a)
1
>>> np.nanargmax(a, axis=0)
array([1, 0])
>>> np.nanargmax(a, axis=1)
array([1, 1])
"""
a, mask = _replace_nan(a, -np.inf)
res = np.argmax(a, axis=axis)
if mask is not None:
mask = np.all(mask, axis=axis)
if np.any(mask):
raise ValueError("All-NaN slice encountered")
return res
def nansum(a, axis=None, dtype=None, out=None, keepdims=np._NoValue):
"""
Return the sum of array elements over a given axis treating Not a
Numbers (NaNs) as zero.
In NumPy versions <= 1.8.0 Nan is returned for slices that are all-NaN or
empty. In later versions zero is returned.
Parameters
----------
a : array_like
Array containing numbers whose sum is desired. If `a` is not an
array, a conversion is attempted.
axis : int, optional
Axis along which the sum is computed. The default is to compute the
sum of the flattened array.
dtype : data-type, optional
The type of the returned array and of the accumulator in which the
elements are summed. By default, the dtype of `a` is used. An
exception is when `a` has an integer type with less precision than
the platform (u)intp. In that case, the default will be either
(u)int32 or (u)int64 depending on whether the platform is 32 or 64
bits. For inexact inputs, dtype must be inexact.
.. versionadded:: 1.8.0
out : ndarray, optional
Alternate output array in which to place the result. The default
is ``None``. If provided, it must have the same shape as the
expected output, but the type will be cast if necessary. See
`doc.ufuncs` for details. The casting of NaN to integer can yield
unexpected results.
.. versionadded:: 1.8.0
keepdims : bool, optional
If this is set to True, the axes which are reduced are left
in the result as dimensions with size one. With this option,
the result will broadcast correctly against the original `a`.
If the value is anything but the default, then
`keepdims` will be passed through to the `mean` or `sum` methods
of sub-classes of `ndarray`. If the sub-classes methods
does not implement `keepdims` any exceptions will be raised.
.. versionadded:: 1.8.0
Returns
-------
nansum : ndarray.
A new array holding the result is returned unless `out` is
specified, in which it is returned. The result has the same
size as `a`, and the same shape as `a` if `axis` is not None
or `a` is a 1-d array.
See Also
--------
numpy.sum : Sum across array propagating NaNs.
isnan : Show which elements are NaN.
isfinite: Show which elements are not NaN or +/-inf.
Notes
-----
If both positive and negative infinity are present, the sum will be Not
A Number (NaN).
Examples
--------
>>> np.nansum(1)
1
>>> np.nansum([1])
1
>>> np.nansum([1, np.nan])
1.0
>>> a = np.array([[1, 1], [1, np.nan]])
>>> np.nansum(a)
3.0
>>> np.nansum(a, axis=0)
array([ 2., 1.])
>>> np.nansum([1, np.nan, np.inf])
inf
>>> np.nansum([1, np.nan, np.NINF])
-inf
>>> np.nansum([1, np.nan, np.inf, -np.inf]) # both +/- infinity present
nan
"""
a, mask = _replace_nan(a, 0)
return np.sum(a, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
def nanprod(a, axis=None, dtype=None, out=None, keepdims=np._NoValue):
"""
Return the product of array elements over a given axis treating Not a
Numbers (NaNs) as ones.
One is returned for slices that are all-NaN or empty.
.. versionadded:: 1.10.0
Parameters
----------
a : array_like
Array containing numbers whose product is desired. If `a` is not an
array, a conversion is attempted.
axis : int, optional
Axis along which the product is computed. The default is to compute
the product of the flattened array.
dtype : data-type, optional
The type of the returned array and of the accumulator in which the
elements are summed. By default, the dtype of `a` is used. An
exception is when `a` has an integer type with less precision than
the platform (u)intp. In that case, the default will be either
(u)int32 or (u)int64 depending on whether the platform is 32 or 64
bits. For inexact inputs, dtype must be inexact.
out : ndarray, optional
Alternate output array in which to place the result. The default
is ``None``. If provided, it must have the same shape as the
expected output, but the type will be cast if necessary. See
`doc.ufuncs` for details. The casting of NaN to integer can yield
unexpected results.
keepdims : bool, optional
If True, the axes which are reduced are left in the result as
dimensions with size one. With this option, the result will
broadcast correctly against the original `arr`.
Returns
-------
nanprod : ndarray
A new array holding the result is returned unless `out` is
specified, in which case it is returned.
See Also
--------
numpy.prod : Product across array propagating NaNs.
isnan : Show which elements are NaN.
Examples
--------
>>> np.nanprod(1)
1
>>> np.nanprod([1])
1
>>> np.nanprod([1, np.nan])
1.0
>>> a = np.array([[1, 2], [3, np.nan]])
>>> np.nanprod(a)
6.0
>>> np.nanprod(a, axis=0)
array([ 3., 2.])
"""
a, mask = _replace_nan(a, 1)
return np.prod(a, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
def nancumsum(a, axis=None, dtype=None, out=None):
"""
Return the cumulative sum of array elements over a given axis treating Not a
Numbers (NaNs) as zero. The cumulative sum does not change when NaNs are
encountered and leading NaNs are replaced by zeros.
Zeros are returned for slices that are all-NaN or empty.
.. versionadded:: 1.12.0
Parameters
----------
a : array_like
Input array.
axis : int, optional
Axis along which the cumulative sum is computed. The default
(None) is to compute the cumsum over the flattened array.
dtype : dtype, optional
Type of the returned array and of the accumulator in which the
elements are summed. If `dtype` is not specified, it defaults
to the dtype of `a`, unless `a` has an integer dtype with a
precision less than that of the default platform integer. In
that case, the default platform integer is used.
out : ndarray, optional
Alternative output array in which to place the result. It must
have the same shape and buffer length as the expected output
but the type will be cast if necessary. See `doc.ufuncs`
(Section "Output arguments") for more details.
Returns
-------
nancumsum : ndarray.
A new array holding the result is returned unless `out` is
specified, in which it is returned. The result has the same
size as `a`, and the same shape as `a` if `axis` is not None
or `a` is a 1-d array.
See Also
--------
numpy.cumsum : Cumulative sum across array propagating NaNs.
isnan : Show which elements are NaN.
Examples
--------
>>> np.nancumsum(1)
array([1])
>>> np.nancumsum([1])
array([1])
>>> np.nancumsum([1, np.nan])
array([ 1., 1.])
>>> a = np.array([[1, 2], [3, np.nan]])
>>> np.nancumsum(a)
array([ 1., 3., 6., 6.])
>>> np.nancumsum(a, axis=0)
array([[ 1., 2.],
[ 4., 2.]])
>>> np.nancumsum(a, axis=1)
array([[ 1., 3.],
[ 3., 3.]])
"""
a, mask = _replace_nan(a, 0)
return np.cumsum(a, axis=axis, dtype=dtype, out=out)
def nancumprod(a, axis=None, dtype=None, out=None):
"""
Return the cumulative product of array elements over a given axis treating Not a
Numbers (NaNs) as one. The cumulative product does not change when NaNs are
encountered and leading NaNs are replaced by ones.
Ones are returned for slices that are all-NaN or empty.
.. versionadded:: 1.12.0
Parameters
----------
a : array_like
Input array.
axis : int, optional
Axis along which the cumulative product is computed. By default
the input is flattened.
dtype : dtype, optional
Type of the returned array, as well as of the accumulator in which
the elements are multiplied. If *dtype* is not specified, it
defaults to the dtype of `a`, unless `a` has an integer dtype with
a precision less than that of the default platform integer. In
that case, the default platform integer is used instead.
out : ndarray, optional
Alternative output array in which to place the result. It must
have the same shape and buffer length as the expected output
but the type of the resulting values will be cast if necessary.
Returns
-------
nancumprod : ndarray
A new array holding the result is returned unless `out` is
specified, in which case it is returned.
See Also
--------
numpy.cumprod : Cumulative product across array propagating NaNs.
isnan : Show which elements are NaN.
Examples
--------
>>> np.nancumprod(1)
array([1])
>>> np.nancumprod([1])
array([1])
>>> np.nancumprod([1, np.nan])
array([ 1., 1.])
>>> a = np.array([[1, 2], [3, np.nan]])
>>> np.nancumprod(a)
array([ 1., 2., 6., 6.])
>>> np.nancumprod(a, axis=0)
array([[ 1., 2.],
[ 3., 2.]])
>>> np.nancumprod(a, axis=1)
array([[ 1., 2.],
[ 3., 3.]])
"""
a, mask = _replace_nan(a, 1)
return np.cumprod(a, axis=axis, dtype=dtype, out=out)
def nanmean(a, axis=None, dtype=None, out=None, keepdims=np._NoValue):
"""
Compute the arithmetic mean along the specified axis, ignoring NaNs.
Returns the average of the array elements. The average is taken over
the flattened array by default, otherwise over the specified axis.
`float64` intermediate and return values are used for integer inputs.
For all-NaN slices, NaN is returned and a `RuntimeWarning` is raised.
.. versionadded:: 1.8.0
Parameters
----------
a : array_like
Array containing numbers whose mean is desired. If `a` is not an
array, a conversion is attempted.
axis : int, optional
Axis along which the means are computed. The default is to compute
the mean of the flattened array.
dtype : data-type, optional
Type to use in computing the mean. For integer inputs, the default
is `float64`; for inexact inputs, it is the same as the input
dtype.
out : ndarray, optional
Alternate output array in which to place the result. The default
is ``None``; if provided, it must have the same shape as the
expected output, but the type will be cast if necessary. See
`doc.ufuncs` for details.
keepdims : bool, optional
If this is set to True, the axes which are reduced are left
in the result as dimensions with size one. With this option,
the result will broadcast correctly against the original `a`.
If the value is anything but the default, then
`keepdims` will be passed through to the `mean` or `sum` methods
of sub-classes of `ndarray`. If the sub-classes methods
does not implement `keepdims` any exceptions will be raised.
Returns
-------
m : ndarray, see dtype parameter above
If `out=None`, returns a new array containing the mean values,
otherwise a reference to the output array is returned. Nan is
returned for slices that contain only NaNs.
See Also
--------
average : Weighted average
mean : Arithmetic mean taken while not ignoring NaNs
var, nanvar
Notes
-----
The arithmetic mean is the sum of the non-NaN elements along the axis
divided by the number of non-NaN elements.
Note that for floating-point input, the mean is computed using the same
precision the input has. Depending on the input data, this can cause
the results to be inaccurate, especially for `float32`. Specifying a
higher-precision accumulator using the `dtype` keyword can alleviate
this issue.
Examples
--------
>>> a = np.array([[1, np.nan], [3, 4]])
>>> np.nanmean(a)
2.6666666666666665
>>> np.nanmean(a, axis=0)
array([ 2., 4.])
>>> np.nanmean(a, axis=1)
array([ 1., 3.5])
"""
arr, mask = _replace_nan(a, 0)
if mask is None:
return np.mean(arr, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
if dtype is not None:
dtype = np.dtype(dtype)
if dtype is not None and not issubclass(dtype.type, np.inexact):
raise TypeError("If a is inexact, then dtype must be inexact")
if out is not None and not issubclass(out.dtype.type, np.inexact):
raise TypeError("If a is inexact, then out must be inexact")
cnt = np.sum(~mask, axis=axis, dtype=np.intp, keepdims=keepdims)
tot = np.sum(arr, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
avg = _divide_by_count(tot, cnt, out=out)
isbad = (cnt == 0)
if isbad.any():
warnings.warn("Mean of empty slice", RuntimeWarning, stacklevel=2)
# NaN is the only possible bad value, so no further
# action is needed to handle bad results.
return avg
def _nanmedian1d(arr1d, overwrite_input=False):
"""
Private function for rank 1 arrays. Compute the median ignoring NaNs.
See nanmedian for parameter usage
"""
arr1d, overwrite_input = _remove_nan_1d(arr1d,
overwrite_input=overwrite_input)
if arr1d.size == 0:
return np.nan
return np.median(arr1d, overwrite_input=overwrite_input)
def _nanmedian(a, axis=None, out=None, overwrite_input=False):
"""
Private function that doesn't support extended axis or keepdims.
These methods are extended to this function using _ureduce
See nanmedian for parameter usage
"""
if axis is None or a.ndim == 1:
part = a.ravel()
if out is None:
return _nanmedian1d(part, overwrite_input)
else:
out[...] = _nanmedian1d(part, overwrite_input)
return out
else:
# for small medians use sort + indexing which is still faster than
# apply_along_axis
# benchmarked with shuffled (50, 50, x) containing a few NaN
if a.shape[axis] < 600:
return _nanmedian_small(a, axis, out, overwrite_input)
result = np.apply_along_axis(_nanmedian1d, axis, a, overwrite_input)
if out is not None:
out[...] = result
return result
def _nanmedian_small(a, axis=None, out=None, overwrite_input=False):
"""
sort + indexing median, faster for small medians along multiple
dimensions due to the high overhead of apply_along_axis
see nanmedian for parameter usage
"""
a = np.ma.masked_array(a, np.isnan(a))
m = np.ma.median(a, axis=axis, overwrite_input=overwrite_input)
for i in range(np.count_nonzero(m.mask.ravel())):
warnings.warn("All-NaN slice encountered", RuntimeWarning, stacklevel=3)
if out is not None:
out[...] = m.filled(np.nan)
return out
return m.filled(np.nan)
def nanmedian(a, axis=None, out=None, overwrite_input=False, keepdims=np._NoValue):
"""
Compute the median along the specified axis, while ignoring NaNs.
Returns the median of the array elements.
.. versionadded:: 1.9.0
Parameters
----------
a : array_like
Input array or object that can be converted to an array.
axis : {int, sequence of int, None}, optional
Axis or axes along which the medians are computed. The default
is to compute the median along a flattened version of the array.
A sequence of axes is supported since version 1.9.0.
out : ndarray, optional
Alternative output array in which to place the result. It must
have the same shape and buffer length as the expected output,
but the type (of the output) will be cast if necessary.
overwrite_input : bool, optional
If True, then allow use of memory of input array `a` for
calculations. The input array will be modified by the call to
`median`. This will save memory when you do not need to preserve
the contents of the input array. Treat the input as undefined,
but it will probably be fully or partially sorted. Default is
False. If `overwrite_input` is ``True`` and `a` is not already an
`ndarray`, an error will be raised.
keepdims : bool, optional
If this is set to True, the axes which are reduced are left
in the result as dimensions with size one. With this option,
the result will broadcast correctly against the original `a`.
If this is anything but the default value it will be passed
through (in the special case of an empty array) to the
`mean` function of the underlying array. If the array is
a sub-class and `mean` does not have the kwarg `keepdims` this
will raise a RuntimeError.
Returns
-------
median : ndarray
A new array holding the result. If the input contains integers
or floats smaller than ``float64``, then the output data-type is
``np.float64``. Otherwise, the data-type of the output is the
same as that of the input. If `out` is specified, that array is
returned instead.
See Also
--------
mean, median, percentile
Notes
-----
Given a vector ``V`` of length ``N``, the median of ``V`` is the
middle value of a sorted copy of ``V``, ``V_sorted`` - i.e.,
``V_sorted[(N-1)/2]``, when ``N`` is odd and the average of the two
middle values of ``V_sorted`` when ``N`` is even.
Examples
--------
>>> a = np.array([[10.0, 7, 4], [3, 2, 1]])
>>> a[0, 1] = np.nan
>>> a
array([[ 10., nan, 4.],
[ 3., 2., 1.]])
>>> np.median(a)
nan
>>> np.nanmedian(a)
3.0
>>> np.nanmedian(a, axis=0)
array([ 6.5, 2., 2.5])
>>> np.median(a, axis=1)
array([ 7., 2.])
>>> b = a.copy()
>>> np.nanmedian(b, axis=1, overwrite_input=True)
array([ 7., 2.])
>>> assert not np.all(a==b)
>>> b = a.copy()
>>> np.nanmedian(b, axis=None, overwrite_input=True)
3.0
>>> assert not np.all(a==b)
"""
a = np.asanyarray(a)
# apply_along_axis in _nanmedian doesn't handle empty arrays well,
# so deal them upfront
if a.size == 0:
return np.nanmean(a, axis, out=out, keepdims=keepdims)
r, k = _ureduce(a, func=_nanmedian, axis=axis, out=out,
overwrite_input=overwrite_input)
if keepdims and keepdims is not np._NoValue:
return r.reshape(k)
else:
return r
def nanpercentile(a, q, axis=None, out=None, overwrite_input=False,
interpolation='linear', keepdims=np._NoValue):
"""
Compute the qth percentile of the data along the specified axis,
while ignoring nan values.
Returns the qth percentile(s) of the array elements.
.. versionadded:: 1.9.0
Parameters
----------
a : array_like
Input array or object that can be converted to an array.
q : float in range of [0,100] (or sequence of floats)
Percentile to compute, which must be between 0 and 100
inclusive.
axis : {int, sequence of int, None}, optional
Axis or axes along which the percentiles are computed. The
default is to compute the percentile(s) along a flattened
version of the array. A sequence of axes is supported since
version 1.9.0.
out : ndarray, optional
Alternative output array in which to place the result. It must
have the same shape and buffer length as the expected output,
but the type (of the output) will be cast if necessary.
overwrite_input : bool, optional
If True, then allow use of memory of input array `a` for
calculations. The input array will be modified by the call to
`percentile`. This will save memory when you do not need to
preserve the contents of the input array. In this case you
should not make any assumptions about the contents of the input
`a` after this function completes -- treat it as undefined.
Default is False. If `a` is not already an array, this parameter
will have no effect as `a` will be converted to an array
internally regardless of the value of this parameter.
interpolation : {'linear', 'lower', 'higher', 'midpoint', 'nearest'}
This optional parameter specifies the interpolation method to
use when the desired quantile lies between two data points
``i < j``:
* linear: ``i + (j - i) * fraction``, where ``fraction`` is
the fractional part of the index surrounded by ``i`` and
``j``.
* lower: ``i``.
* higher: ``j``.
* nearest: ``i`` or ``j``, whichever is nearest.
* midpoint: ``(i + j) / 2``.
keepdims : bool, optional
If this is set to True, the axes which are reduced are left in
the result as dimensions with size one. With this option, the
result will broadcast correctly against the original array `a`.
If this is anything but the default value it will be passed
through (in the special case of an empty array) to the
`mean` function of the underlying array. If the array is
a sub-class and `mean` does not have the kwarg `keepdims` this
will raise a RuntimeError.
Returns
-------
percentile : scalar or ndarray
If `q` is a single percentile and `axis=None`, then the result
is a scalar. If multiple percentiles are given, first axis of
the result corresponds to the percentiles. The other axes are
the axes that remain after the reduction of `a`. If the input
contains integers or floats smaller than ``float64``, the output
data-type is ``float64``. Otherwise, the output data-type is the
same as that of the input. If `out` is specified, that array is
returned instead.
See Also
--------
nanmean, nanmedian, percentile, median, mean
Notes
-----
Given a vector ``V`` of length ``N``, the ``q``-th percentile of
``V`` is the value ``q/100`` of the way from the minimum to the
maximum in a sorted copy of ``V``. The values and distances of
the two nearest neighbors as well as the `interpolation` parameter
will determine the percentile if the normalized ranking does not
match the location of ``q`` exactly. This function is the same as
the median if ``q=50``, the same as the minimum if ``q=0`` and the
same as the maximum if ``q=100``.
Examples
--------
>>> a = np.array([[10., 7., 4.], [3., 2., 1.]])
>>> a[0][1] = np.nan
>>> a
array([[ 10., nan, 4.],
[ 3., 2., 1.]])
>>> np.percentile(a, 50)
nan
>>> np.nanpercentile(a, 50)
3.5
>>> np.nanpercentile(a, 50, axis=0)
array([ 6.5, 2., 2.5])
>>> np.nanpercentile(a, 50, axis=1, keepdims=True)
array([[ 7.],
[ 2.]])
>>> m = np.nanpercentile(a, 50, axis=0)
>>> out = np.zeros_like(m)
>>> np.nanpercentile(a, 50, axis=0, out=out)
array([ 6.5, 2., 2.5])
>>> m
array([ 6.5, 2. , 2.5])
>>> b = a.copy()
>>> np.nanpercentile(b, 50, axis=1, overwrite_input=True)
array([ 7., 2.])
>>> assert not np.all(a==b)
"""
a = np.asanyarray(a)
q = np.asanyarray(q)
# apply_along_axis in _nanpercentile doesn't handle empty arrays well,
# so deal them upfront
if a.size == 0:
return np.nanmean(a, axis, out=out, keepdims=keepdims)
r, k = _ureduce(a, func=_nanpercentile, q=q, axis=axis, out=out,
overwrite_input=overwrite_input,
interpolation=interpolation)
if keepdims and keepdims is not np._NoValue:
return r.reshape(q.shape + k)
else:
return r
def _nanpercentile(a, q, axis=None, out=None, overwrite_input=False,
interpolation='linear'):
"""
Private function that doesn't support extended axis or keepdims.
These methods are extended to this function using _ureduce
See nanpercentile for parameter usage
"""
if axis is None or a.ndim == 1:
part = a.ravel()
result = _nanpercentile1d(part, q, overwrite_input, interpolation)
else:
result = np.apply_along_axis(_nanpercentile1d, axis, a, q,
overwrite_input, interpolation)
# apply_along_axis fills in collapsed axis with results.
# Move that axis to the beginning to match percentile's
# convention.
if q.ndim != 0:
result = np.moveaxis(result, axis, 0)
if out is not None:
out[...] = result
return result
def _nanpercentile1d(arr1d, q, overwrite_input=False, interpolation='linear'):
"""
Private function for rank 1 arrays. Compute percentile ignoring NaNs.
See nanpercentile for parameter usage
"""
arr1d, overwrite_input = _remove_nan_1d(arr1d,
overwrite_input=overwrite_input)
if arr1d.size == 0:
return np.full(q.shape, np.nan)[()] # convert to scalar
return np.percentile(arr1d, q, overwrite_input=overwrite_input,
interpolation=interpolation)
def nanvar(a, axis=None, dtype=None, out=None, ddof=0, keepdims=np._NoValue):
"""
Compute the variance along the specified axis, while ignoring NaNs.
Returns the variance of the array elements, a measure of the spread of
a distribution. The variance is computed for the flattened array by
default, otherwise over the specified axis.
For all-NaN slices or slices with zero degrees of freedom, NaN is
returned and a `RuntimeWarning` is raised.
.. versionadded:: 1.8.0
Parameters
----------
a : array_like
Array containing numbers whose variance is desired. If `a` is not an
array, a conversion is attempted.
axis : int, optional
Axis along which the variance is computed. The default is to compute
the variance of the flattened array.
dtype : data-type, optional
Type to use in computing the variance. For arrays of integer type
the default is `float32`; for arrays of float types it is the same as
the array type.
out : ndarray, optional
Alternate output array in which to place the result. It must have
the same shape as the expected output, but the type is cast if
necessary.
ddof : int, optional
"Delta Degrees of Freedom": the divisor used in the calculation is
``N - ddof``, where ``N`` represents the number of non-NaN
elements. By default `ddof` is zero.
keepdims : bool, optional
If this is set to True, the axes which are reduced are left
in the result as dimensions with size one. With this option,
the result will broadcast correctly against the original `a`.
Returns
-------
variance : ndarray, see dtype parameter above
If `out` is None, return a new array containing the variance,
otherwise return a reference to the output array. If ddof is >= the
number of non-NaN elements in a slice or the slice contains only
NaNs, then the result for that slice is NaN.
See Also
--------
std : Standard deviation
mean : Average
var : Variance while not ignoring NaNs
nanstd, nanmean
numpy.doc.ufuncs : Section "Output arguments"
Notes
-----
The variance is the average of the squared deviations from the mean,
i.e., ``var = mean(abs(x - x.mean())**2)``.
The mean is normally calculated as ``x.sum() / N``, where ``N = len(x)``.
If, however, `ddof` is specified, the divisor ``N - ddof`` is used
instead. In standard statistical practice, ``ddof=1`` provides an
unbiased estimator of the variance of a hypothetical infinite
population. ``ddof=0`` provides a maximum likelihood estimate of the
variance for normally distributed variables.
Note that for complex numbers, the absolute value is taken before
squaring, so that the result is always real and nonnegative.
For floating-point input, the variance is computed using the same
precision the input has. Depending on the input data, this can cause
the results to be inaccurate, especially for `float32` (see example
below). Specifying a higher-accuracy accumulator using the ``dtype``
keyword can alleviate this issue.
For this function to work on sub-classes of ndarray, they must define
`sum` with the kwarg `keepdims`
Examples
--------
>>> a = np.array([[1, np.nan], [3, 4]])
>>> np.var(a)
1.5555555555555554
>>> np.nanvar(a, axis=0)
array([ 1., 0.])
>>> np.nanvar(a, axis=1)
array([ 0., 0.25])
"""
arr, mask = _replace_nan(a, 0)
if mask is None:
return np.var(arr, axis=axis, dtype=dtype, out=out, ddof=ddof,
keepdims=keepdims)
if dtype is not None:
dtype = np.dtype(dtype)
if dtype is not None and not issubclass(dtype.type, np.inexact):
raise TypeError("If a is inexact, then dtype must be inexact")
if out is not None and not issubclass(out.dtype.type, np.inexact):
raise TypeError("If a is inexact, then out must be inexact")
# Compute mean
if type(arr) is np.matrix:
_keepdims = np._NoValue
else:
_keepdims = True
# we need to special case matrix for reverse compatibility
# in order for this to work, these sums need to be called with
# keepdims=True, however matrix now raises an error in this case, but
# the reason that it drops the keepdims kwarg is to force keepdims=True
# so this used to work by serendipity.
cnt = np.sum(~mask, axis=axis, dtype=np.intp, keepdims=_keepdims)
avg = np.sum(arr, axis=axis, dtype=dtype, keepdims=_keepdims)
avg = _divide_by_count(avg, cnt)
# Compute squared deviation from mean.
np.subtract(arr, avg, out=arr, casting='unsafe')
arr = _copyto(arr, 0, mask)
if issubclass(arr.dtype.type, np.complexfloating):
sqr = np.multiply(arr, arr.conj(), out=arr).real
else:
sqr = np.multiply(arr, arr, out=arr)
# Compute variance.
var = np.sum(sqr, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
if var.ndim < cnt.ndim:
# Subclasses of ndarray may ignore keepdims, so check here.
cnt = cnt.squeeze(axis)
dof = cnt - ddof
var = _divide_by_count(var, dof)
isbad = (dof <= 0)
if np.any(isbad):
warnings.warn("Degrees of freedom <= 0 for slice.", RuntimeWarning, stacklevel=2)
# NaN, inf, or negative numbers are all possible bad
# values, so explicitly replace them with NaN.
var = _copyto(var, np.nan, isbad)
return var
def nanstd(a, axis=None, dtype=None, out=None, ddof=0, keepdims=np._NoValue):
"""
Compute the standard deviation along the specified axis, while
ignoring NaNs.
Returns the standard deviation, a measure of the spread of a
distribution, of the non-NaN array elements. The standard deviation is
computed for the flattened array by default, otherwise over the
specified axis.
For all-NaN slices or slices with zero degrees of freedom, NaN is
returned and a `RuntimeWarning` is raised.
.. versionadded:: 1.8.0
Parameters
----------
a : array_like
Calculate the standard deviation of the non-NaN values.
axis : int, optional
Axis along which the standard deviation is computed. The default is
to compute the standard deviation of the flattened array.
dtype : dtype, optional
Type to use in computing the standard deviation. For arrays of
integer type the default is float64, for arrays of float types it
is the same as the array type.
out : ndarray, optional
Alternative output array in which to place the result. It must have
the same shape as the expected output but the type (of the
calculated values) will be cast if necessary.
ddof : int, optional
Means Delta Degrees of Freedom. The divisor used in calculations
is ``N - ddof``, where ``N`` represents the number of non-NaN
elements. By default `ddof` is zero.
keepdims : bool, optional
If this is set to True, the axes which are reduced are left
in the result as dimensions with size one. With this option,
the result will broadcast correctly against the original `a`.
If this value is anything but the default it is passed through
as-is to the relevant functions of the sub-classes. If these
functions do not have a `keepdims` kwarg, a RuntimeError will
be raised.
Returns
-------
standard_deviation : ndarray, see dtype parameter above.
If `out` is None, return a new array containing the standard
deviation, otherwise return a reference to the output array. If
ddof is >= the number of non-NaN elements in a slice or the slice
contains only NaNs, then the result for that slice is NaN.
See Also
--------
var, mean, std
nanvar, nanmean
numpy.doc.ufuncs : Section "Output arguments"
Notes
-----
The standard deviation is the square root of the average of the squared
deviations from the mean: ``std = sqrt(mean(abs(x - x.mean())**2))``.
The average squared deviation is normally calculated as
``x.sum() / N``, where ``N = len(x)``. If, however, `ddof` is
specified, the divisor ``N - ddof`` is used instead. In standard
statistical practice, ``ddof=1`` provides an unbiased estimator of the
variance of the infinite population. ``ddof=0`` provides a maximum
likelihood estimate of the variance for normally distributed variables.
The standard deviation computed in this function is the square root of
the estimated variance, so even with ``ddof=1``, it will not be an
unbiased estimate of the standard deviation per se.
Note that, for complex numbers, `std` takes the absolute value before
squaring, so that the result is always real and nonnegative.
For floating-point input, the *std* is computed using the same
precision the input has. Depending on the input data, this can cause
the results to be inaccurate, especially for float32 (see example
below). Specifying a higher-accuracy accumulator using the `dtype`
keyword can alleviate this issue.
Examples
--------
>>> a = np.array([[1, np.nan], [3, 4]])
>>> np.nanstd(a)
1.247219128924647
>>> np.nanstd(a, axis=0)
array([ 1., 0.])
>>> np.nanstd(a, axis=1)
array([ 0., 0.5])
"""
var = nanvar(a, axis=axis, dtype=dtype, out=out, ddof=ddof,
keepdims=keepdims)
if isinstance(var, np.ndarray):
std = np.sqrt(var, out=var)
else:
std = var.dtype.type(np.sqrt(var))
return std
```
|
Sphaeromias longipennis is a species of biting midges, insects in the family Ceratopogonidae.
References
Further reading
External links
Ceratopogonidae
|
Through the Dark is a 1924 American silent mystery crime drama film directed by George W. Hill, and starring Colleen Moore and Forrest Stanley as the popular jewel thief and sometimes detective character Boston Blackie. The film's scenario, written by Frances Marion, is based on the short story "The Daughter of Mother McGinn" by Jack Boyle, which appeared in serial form in Cosmopolitan. The film was produced by William Randolph Hearst's Cosmopolitan Productions and distributed through Goldwyn Pictures.
Plot
As described in a film magazine review, during a rebellion of prisoners at the San Quentin State Prison, Boston Blackie makes a lightning escape aided by Mary McGinn while chased prison guards. Mary is a school girl, unaware that her brothers are crooks. She is expelled from school. Blackie rejoins his gang and takes refuge in Mother McGinn's house, where he again meets Mary. She devotes herself to making Blackie go straight and wins her point.
Cast
Censorship
The film was banned by the British Board of Film Censors upon its release for its depiction of unspecified "taboo" subject matter.
Preservation
An incomplete print of Through the Dark is preserved at the Library of Congress.
References
External links
Lantern slide
1924 films
1924 crime drama films
1920s mystery drama films
American independent films
American mystery drama films
American silent feature films
American black-and-white films
Films based on short fiction
Films directed by George Hill
Goldwyn Pictures films
1920s independent films
Boston Blackie films
1920s American films
Silent American crime drama films
Silent mystery drama films
|
```xml
import React from 'react';
import logo from './logo.svg';
import './App.css';
function App() {
return (
<div className="App">
<header className="App-header">
<img src={logo} className="App-logo" alt="logo" />
<p>
Edit <code>src/App.tsx</code> and save to reload.
</p>
<a
className="App-link"
href="path_to_url"
target="_blank"
rel="noopener noreferrer"
>
Learn React
</a>
</header>
</div>
);
}
export default App;
```
|
```kotlin
/*
* that can be found in the LICENSE file.
*/
package kotlin.sequences
import kotlin.comparisons.*
import kotlin.native.internal.FixmeConcurrency
@FixmeConcurrency
internal actual class ConstrainedOnceSequence<T> actual constructor(sequence: Sequence<T>) : Sequence<T> {
// TODO: not MT friendly.
private var sequenceRef : Sequence<T>? = sequence
override actual fun iterator(): Iterator<T> {
val sequence = sequenceRef
if (sequence == null) throw IllegalStateException("This sequence can be consumed only once.")
sequenceRef = null
return sequence.iterator()
}
}
```
|
Jumbo () is a supermarket chain in the Netherlands and Belgium. It is part of the privately owned Van Eerd Group. Van Eerd was originally a grocery wholesale company established in 1921. With 740 stores and a market share of about 22%, Jumbo is the second largest supermarket chain in the Netherlands, behind Albert Heijn.
History
On 18 October 1979, Jan and Anita Meurs opened the first Jumbo supermarket in a former church building in Tilburg. It was named after the elephant Jumbo as an act of one-upping the name of a local rival store called Torro, which belonged to Van Eerd. In 1983, Van Eerd bought the Jumbo store from the Meurs family and subsequently expanded, first in the southern provinces, then nationwide.
, 77 establishments have been opened throughout the Netherlands. Together, they have a market share of 3.4% in the Netherlands as of 1 January 2006. The head office and distribution centre are situated in Veghel. Jumbo has three regional distribution centres: Beilen, Drachten, and Den Bosch. With the opening of Jumbo in Valthermond, Drenthe in October 2005, there is a Jumbo in every province of the Netherlands. Until the acquisition of C1000, relatively few Jumbos were in the Randstad.
In September 2011, CVC announced that they would sell the C1000 supermarket chain. On 23 November 2011, it was announced that Jumbo would take over all C1000 stores. As a consequence, Jumbo became the second largest supermarket chain in the Netherlands, after Albert Heijn.
On 26 January 2016, Jumbo announced that it had acquired V&D's restaurant chain, La Place, out of bankruptcy for an undisclosed amount of money.
In March 2023, Jumbo announced Ton van Veen as the new CEO to replace Frits van Eerd. van Eerd stepped down as CEO in October 2022 after being investigated for money laundering.
Sports sponsorship
On 23 October 2014, Jumbo announced it would be a major sponsor of the UCI World Tour professional cycling team, Belkin Pro Cycling, which became LottoNL–Jumbo and in 2019, Team Jumbo-Visma.
Jumbo has been sponsoring Max Verstappen since 2013 when Verstappen was racing in Formula 3.
In 2017-2019, Jumbo was a major sponsor of Racing Team Nederland that entered the European Le Mans Series in 2017 and the FIA World Endurance Championship in 2018-2019 and 2019–2020.
In September 2022, company CEO Frits van Eerd was arrested amid ongoing investigations into money laundering that was carried out through real estate transactions, automotive trade and sponsorship in motocross. Jumbo commissioned an independent investigation into its sponsorship activities and found no criminal offenses or irregularities. Following the controversy, Jumbo announced in January 2023 that it will end most of their motorsport sponsorship but will continue support Formula One World Champion Verstappen.
In June 2023, Jumbo announced that they will end the sponsorship deals with Verstappen and Team Jumbo-Visma after the current season. While the sponsorship for Team Jumbo-Visma will end in 2024, the company will be open for an early departure if the team is able to secure a new major sponsor. Jumbo will also no longer sponsor the Dutch Grand Prix. The decision to end all sports sponsorship is a part of new CEO Ton van Veen’s strategy for the company.
References
External links
Retail companies of the Netherlands
Supermarkets of the Netherlands
Companies based in North Brabant
Meierijstad
|
Watson Jones was an American sound engineer. He was nominated for an Academy Award in the category Best Sound Recording for the film Not as a Stranger.
Selected filmography
Not as a Stranger (1955)
References
External links
Year of birth missing
Year of death missing
American audio engineers
|
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// This file has been auto-generated by code_generator_v8.py. DO NOT MODIFY!
#ifndef V8FederatedCredentialRequestOptions_h
#define V8FederatedCredentialRequestOptions_h
#include "bindings/core/v8/ToV8.h"
#include "bindings/core/v8/V8Binding.h"
#include "modules/ModulesExport.h"
#include "modules/credentialmanager/FederatedCredentialRequestOptions.h"
#include "platform/heap/Handle.h"
namespace blink {
class ExceptionState;
class V8FederatedCredentialRequestOptions {
public:
MODULES_EXPORT static void toImpl(v8::Isolate*, v8::Local<v8::Value>, FederatedCredentialRequestOptions&, ExceptionState&);
};
v8::Local<v8::Value> toV8(const FederatedCredentialRequestOptions&, v8::Local<v8::Object>, v8::Isolate*);
MODULES_EXPORT bool toV8FederatedCredentialRequestOptions(const FederatedCredentialRequestOptions&, v8::Local<v8::Object> dictionary, v8::Local<v8::Object> creationContext, v8::Isolate*);
template<class CallbackInfo>
inline void v8SetReturnValue(const CallbackInfo& callbackInfo, FederatedCredentialRequestOptions& impl)
{
v8SetReturnValue(callbackInfo, toV8(impl, callbackInfo.Holder(), callbackInfo.GetIsolate()));
}
template <>
struct NativeValueTraits<FederatedCredentialRequestOptions> {
static FederatedCredentialRequestOptions nativeValue(v8::Isolate*, v8::Local<v8::Value>, ExceptionState&);
};
} // namespace blink
#endif // V8FederatedCredentialRequestOptions_h
```
|
La Grande Écurie et la Chambre du Roy is a French musical ensemble, based in Tourcoing, France, that performs using period instruments. The group was founded in 1966 by Jean-Claude Malgoire and led by him until his death in April of 2018. Alexis Kossenko, flutist and conductor, was named music director of the group in October 2019 While the ensemble has performed a wide repertoire from a variety of musical periods, the group has drawn particular acclaim for their performances of baroque music and the works of Wolfgang Amadeus Mozart. The group has toured 5 continents and has made more than 100 recordings. The ensemble's recording of Antonio Vivaldi's Motezuma was awarded the Victoires de la musique classique in 1992. Their recording of Vivaldi's Vêpres pour la Nativité de la Vierge won the Grand Prix du Disque. The ensemble is supported financially by the France's Ministry of Culture and the city of Tourcoing.
Discography
Live video recording - 2004 - Claudio Monteverdi - L'Orfeo - Théâtre Municipal de Tourcoing - Jean-Claude Malgoire (Conductor) Cast: Kobie van Rensburg, Cyrille Gerstenhaber, Philippe Jaroussky, Bernard Deletré - Dynamic Cat. 33477, DVD
References
Baroque music groups
French instrumental groups
Musical groups established in 1966
1966 establishments in France
|
```xml
import { deepEqual } from 'assert';
import { appendRoutesToPhase } from '../src/append';
import { Route } from '../src/types';
test('appendRoutesToPhase `routes=null` and `newRoutes=[]`', () => {
const routes = null;
const newRoutes: Route[] = [];
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected: Route[] = [];
deepEqual(actual, expected);
});
test('appendRoutesToPhase `routes=null` and one `newRoutes`', () => {
const routes = null;
const newRoutes = [{ src: '/foo', dest: '/bar' }];
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [{ handle: 'filesystem' }, ...newRoutes];
deepEqual(actual, expected);
});
test('appendRoutesToPhase `routes=[]` and `newRoutes=null`', () => {
const routes: Route[] = [];
const newRoutes = null;
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected: Route[] = [];
deepEqual(actual, expected);
});
test('appendRoutesToPhase `routes=[]` and `newRoutes=[]`', () => {
const routes: Route[] = [];
const newRoutes: Route[] = [];
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected: Route[] = [];
deepEqual(actual, expected);
});
test('appendRoutesToPhase one routes, zero newRoutes', () => {
const routes = [{ src: '/foo', dest: '/bar' }];
const newRoutes: Route[] = [];
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = routes;
deepEqual(actual, expected);
});
test('appendRoutesToPhase zero routes, one newRoutes', () => {
const routes: Route[] = [];
const newRoutes = [{ src: '/foo', dest: '/bar' }];
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [{ handle: 'filesystem' }, ...newRoutes];
deepEqual(actual, expected);
});
test('appendRoutesToPhase two routes in phase', () => {
const routes: Route[] = [
{ handle: 'filesystem' },
{ src: '/first', dest: '/one' },
];
const newRoutes = [{ src: '/new', dest: '/to' }];
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [
{ handle: 'filesystem' },
{ src: '/first', dest: '/one' },
{ src: '/new', dest: '/to' },
];
deepEqual(actual, expected);
});
test('appendRoutesToPhase two routes out of phase', () => {
const routes: Route[] = [
{ handle: 'resource' },
{ src: '/first', dest: '/one' },
];
const newRoutes = [{ src: '/new', dest: '/to' }];
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [
{ handle: 'resource' },
{ src: '/first', dest: '/one' },
{ handle: 'filesystem' },
{ src: '/new', dest: '/to' },
];
deepEqual(actual, expected);
});
test('appendRoutesToPhase one routes before, two routes in phase', () => {
const routes: Route[] = [
{ src: '/first', dest: '/one' },
{ handle: 'filesystem' },
{ src: '/second', dest: '/two' },
];
const newRoutes = [{ src: '/new', dest: '/to' }];
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [
{ src: '/first', dest: '/one' },
{ handle: 'filesystem' },
{ src: '/second', dest: '/two' },
{ src: '/new', dest: '/to' },
];
deepEqual(actual, expected);
});
test('appendRoutesToPhase one routes before, two routes in phase, two routes in different phase', () => {
const routes: Route[] = [
{ src: '/first', dest: '/one' },
{ handle: 'filesystem' },
{ src: '/second', dest: '/two' },
{ handle: 'miss' },
{ src: '/third', dest: '/three' },
];
const newRoutes = [{ src: '/new', dest: '/to' }];
const phase = 'filesystem';
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [
{ src: '/first', dest: '/one' },
{ handle: 'filesystem' },
{ src: '/second', dest: '/two' },
{ src: '/new', dest: '/to' },
{ handle: 'miss' },
{ src: '/third', dest: '/three' },
];
deepEqual(actual, expected);
});
test('appendRoutesToPhase to null phase', () => {
const routes: Route[] = [
{ src: '/first', dest: '/one' },
{ src: '/second', dest: '/two' },
{ handle: 'filesystem' },
{ src: '/third', dest: '/three' },
];
const newRoutes = [{ src: '/new', dest: '/to' }];
const phase = null;
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [
{ src: '/first', dest: '/one' },
{ src: '/second', dest: '/two' },
{ src: '/new', dest: '/to' },
{ handle: 'filesystem' },
{ src: '/third', dest: '/three' },
];
deepEqual(actual, expected);
});
test('appendRoutesToPhase to null phase with no handle', () => {
const routes: Route[] = [
{ src: '/first', dest: '/one' },
{ src: '/second', dest: '/two' },
];
const newRoutes = [{ src: '/new', dest: '/to' }];
const phase = null;
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [
{ src: '/first', dest: '/one' },
{ src: '/second', dest: '/two' },
{ src: '/new', dest: '/to' },
];
deepEqual(actual, expected);
});
test('appendRoutesToPhase to null phase with two new routes ', () => {
const routes: Route[] = [
{ src: '/first', dest: '/one' },
{ src: '/second', dest: '/two' },
{ handle: 'filesystem' },
{ src: '/third', dest: '/three' },
];
const newRoutes = [
{ src: '/new1', dest: '/to1' },
{ src: '/new2', dest: '/to2' },
];
const phase = null;
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [
{ src: '/first', dest: '/one' },
{ src: '/second', dest: '/two' },
{ src: '/new1', dest: '/to1' },
{ src: '/new2', dest: '/to2' },
{ handle: 'filesystem' },
{ src: '/third', dest: '/three' },
];
deepEqual(actual, expected);
});
test('appendRoutesToPhase to null phase `routes=[]`', () => {
const routes: Route[] = [];
const newRoutes = [{ src: '/new', dest: '/to' }];
const phase = null;
const actual = appendRoutesToPhase({ routes, newRoutes, phase });
const expected = [{ src: '/new', dest: '/to' }];
deepEqual(actual, expected);
});
```
|
```java
package io.virtualapp.home.repo;
import android.content.Context;
import com.lody.virtual.remote.InstallResult;
import org.jdeferred.Promise;
import java.io.File;
import java.util.List;
import io.virtualapp.home.models.AppData;
import io.virtualapp.home.models.AppInfo;
import io.virtualapp.home.models.AppInfoLite;
/**
* @author Lody
* @version 1.0
*/
public interface AppDataSource {
/**
* @return All the Applications we Virtual.
*/
Promise<List<AppData>, Throwable, Void> getVirtualApps();
/**
* @param context Context
* @return All the Applications we Installed.
*/
Promise<List<AppInfo>, Throwable, Void> getInstalledApps(Context context);
Promise<List<AppInfo>, Throwable, Void> getStorageApps(Context context, File rootDir);
InstallResult addVirtualApp(AppInfoLite info);
boolean removeVirtualApp(String packageName, int userId);
}
```
|
Janczowice is a village in the administrative district of Gmina Łagiewniki, within Dzierżoniów County, Lower Silesian Voivodeship, in south-western Poland.
It lies approximately north-east of Dzierżoniów, and south-west of the regional capital Wrocław.
References
Janczowice
|
```html
<!DOCTYPE HTML>
<html lang="" >
<head>
<meta charset="UTF-8">
<meta content="text/html; charset=utf-8" http-equiv="Content-Type">
<title>20170414 </title>
<meta http-equiv="X-UA-Compatible" content="IE=edge" />
<meta name="description" content="">
<meta name="generator" content="GitBook 3.2.2">
<link rel="stylesheet" href="../../gitbook/style.css">
<link rel="stylesheet" href="../../gitbook/gitbook-plugin-highlight/website.css">
<link rel="stylesheet" href="../../gitbook/gitbook-plugin-search/search.css">
<link rel="stylesheet" href="../../gitbook/gitbook-plugin-fontsettings/website.css">
<meta name="HandheldFriendly" content="true"/>
<meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no">
<meta name="apple-mobile-web-app-capable" content="yes">
<meta name="apple-mobile-web-app-status-bar-style" content="black">
<link rel="apple-touch-icon-precomposed" sizes="152x152" href="../../gitbook/images/apple-touch-icon-precomposed-152.png">
<link rel="shortcut icon" href="../../gitbook/images/favicon.ico" type="image/x-icon">
<link rel="next" href="15.html" />
<link rel="prev" href="13.html" />
</head>
<body>
<div class="book">
<div class="book-summary">
<div id="book-search-input" role="search">
<input type="text" placeholder="Type to search" />
</div>
<nav role="navigation">
<ul class="summary">
<li>
<a href="path_to_url" target="_blank" class="custom-link">WEB</a>
</li>
<li class="divider"></li>
<li class="chapter " data-level="1.1" data-path="../../">
<a href="../../">
</a>
</li>
<li class="chapter " data-level="1.2" data-path="../../INTRO.html">
<a href="../../INTRO.html">
</a>
</li>
<li class="chapter " data-level="1.3" >
<span>
20173
</span>
<ul class="articles">
<li class="chapter " data-level="1.3.1" data-path="../03/01.html">
<a href="../03/01.html">
20170301
</a>
</li>
<li class="chapter " data-level="1.3.2" data-path="../03/02.html">
<a href="../03/02.html">
20170302
</a>
</li>
<li class="chapter " data-level="1.3.3" data-path="../03/03.html">
<a href="../03/03.html">
20170303
</a>
</li>
<li class="chapter " data-level="1.3.4" data-path="../03/04.html">
<a href="../03/04.html">
20170304
</a>
</li>
<li class="chapter " data-level="1.3.5" data-path="../03/05.html">
<a href="../03/05.html">
20170305
</a>
</li>
<li class="chapter " data-level="1.3.6" data-path="../03/06.html">
<a href="../03/06.html">
20170306
</a>
</li>
<li class="chapter " data-level="1.3.7" data-path="../03/07.html">
<a href="../03/07.html">
20170307
</a>
</li>
<li class="chapter " data-level="1.3.8" data-path="../03/08.html">
<a href="../03/08.html">
20170308
</a>
</li>
<li class="chapter " data-level="1.3.9" data-path="../03/09.html">
<a href="../03/09.html">
20170309
</a>
</li>
<li class="chapter " data-level="1.3.10" data-path="../03/10.html">
<a href="../03/10.html">
20170310
</a>
</li>
<li class="chapter " data-level="1.3.11" data-path="../03/11.html">
<a href="../03/11.html">
20170311
</a>
</li>
<li class="chapter " data-level="1.3.12" data-path="../03/12.html">
<a href="../03/12.html">
20170312
</a>
</li>
<li class="chapter " data-level="1.3.13" data-path="../03/13.html">
<a href="../03/13.html">
20170313
</a>
</li>
<li class="chapter " data-level="1.3.14" data-path="../03/14.html">
<a href="../03/14.html">
20170314
</a>
</li>
<li class="chapter " data-level="1.3.15" data-path="../03/15.html">
<a href="../03/15.html">
20170315
</a>
</li>
<li class="chapter " data-level="1.3.16" data-path="../03/16.html">
<a href="../03/16.html">
20170316
</a>
</li>
<li class="chapter " data-level="1.3.17" data-path="../03/17.html">
<a href="../03/17.html">
20170317
</a>
</li>
<li class="chapter " data-level="1.3.18" data-path="../03/18.html">
<a href="../03/18.html">
20170318
</a>
</li>
<li class="chapter " data-level="1.3.19" data-path="../03/19.html">
<a href="../03/19.html">
20170319
</a>
</li>
<li class="chapter " data-level="1.3.20" data-path="../03/20.html">
<a href="../03/20.html">
20170320
</a>
</li>
<li class="chapter " data-level="1.3.21" data-path="../03/21.html">
<a href="../03/21.html">
20170321
</a>
</li>
<li class="chapter " data-level="1.3.22" data-path="../03/22.html">
<a href="../03/22.html">
20170322
</a>
</li>
<li class="chapter " data-level="1.3.23" data-path="../03/23.html">
<a href="../03/23.html">
20170323
</a>
</li>
<li class="chapter " data-level="1.3.24" data-path="../03/24.html">
<a href="../03/24.html">
20170324
</a>
</li>
<li class="chapter " data-level="1.3.25" data-path="../03/25.html">
<a href="../03/25.html">
20170325
</a>
</li>
<li class="chapter " data-level="1.3.26" data-path="../03/26.html">
<a href="../03/26.html">
20170326
</a>
</li>
<li class="chapter " data-level="1.3.27" data-path="../03/27.html">
<a href="../03/27.html">
20170327
</a>
</li>
<li class="chapter " data-level="1.3.28" data-path="../03/28.html">
<a href="../03/28.html">
20170328
</a>
</li>
</ul>
</li>
<li class="chapter " data-level="1.4" >
<span>
20174
</span>
<ul class="articles">
<li class="chapter " data-level="1.4.1" data-path="01.html">
<a href="01.html">
20170401
</a>
</li>
<li class="chapter " data-level="1.4.2" data-path="02.md">
<span>
20170402
</a>
</li>
<li class="chapter " data-level="1.4.3" data-path="03.html">
<a href="03.html">
20170403
</a>
</li>
<li class="chapter " data-level="1.4.4" data-path="04.html">
<a href="04.html">
20170404
</a>
</li>
<li class="chapter " data-level="1.4.5" data-path="05.html">
<a href="05.html">
20170405
</a>
</li>
<li class="chapter " data-level="1.4.6" data-path="06.html">
<a href="06.html">
20170406
</a>
</li>
<li class="chapter " data-level="1.4.7" data-path="07.html">
<a href="07.html">
20170407
</a>
</li>
<li class="chapter " data-level="1.4.8" data-path="08.html">
<a href="08.html">
20170408
</a>
</li>
<li class="chapter " data-level="1.4.9" data-path="09.html">
<a href="09.html">
20170409
</a>
</li>
<li class="chapter " data-level="1.4.10" data-path="10.md">
<span>
20170410
</a>
</li>
<li class="chapter " data-level="1.4.11" data-path="11.html">
<a href="11.html">
20170411
</a>
</li>
<li class="chapter " data-level="1.4.12" data-path="12.html">
<a href="12.html">
20170412
</a>
</li>
<li class="chapter " data-level="1.4.13" data-path="13.html">
<a href="13.html">
20170413
</a>
</li>
<li class="chapter active" data-level="1.4.14" data-path="14.html">
<a href="14.html">
20170414
</a>
</li>
<li class="chapter " data-level="1.4.15" data-path="15.html">
<a href="15.html">
20170415
</a>
</li>
<li class="chapter " data-level="1.4.16" data-path="16.html">
<a href="16.html">
20170416
</a>
</li>
<li class="chapter " data-level="1.4.17" data-path="17.html">
<a href="17.html">
20170417
</a>
</li>
<li class="chapter " data-level="1.4.18" data-path="18.html">
<a href="18.html">
20170418
</a>
</li>
<li class="chapter " data-level="1.4.19" data-path="19.html">
<a href="19.html">
20170419
</a>
</li>
<li class="chapter " data-level="1.4.20" data-path="20.html">
<a href="20.html">
20170420
</a>
</li>
<li class="chapter " data-level="1.4.21" data-path="21.html">
<a href="21.html">
20170421
</a>
</li>
<li class="chapter " data-level="1.4.22" data-path="22.html">
<a href="22.html">
20170422
</a>
</li>
<li class="chapter " data-level="1.4.23" data-path="23.html">
<a href="23.html">
20170423
</a>
</li>
<li class="chapter " data-level="1.4.24" data-path="24.html">
<a href="24.html">
20170424
</a>
</li>
<li class="chapter " data-level="1.4.25" data-path="25.html">
<a href="25.html">
20170425
</a>
</li>
<li class="chapter " data-level="1.4.26" data-path="26.html">
<a href="26.html">
20170426
</a>
</li>
<li class="chapter " data-level="1.4.27" data-path="27.html">
<a href="27.html">
20170427
</a>
</li>
<li class="chapter " data-level="1.4.28" data-path="28.html">
<a href="28.html">
20170428
</a>
</li>
</ul>
</li>
<li class="chapter " data-level="1.5" >
<span>
20175
</span>
<ul class="articles">
<li class="chapter " data-level="1.5.1" data-path="../05/01.html">
<a href="../05/01.html">
20170501
</a>
</li>
<li class="chapter " data-level="1.5.2" data-path="../05/02.html">
<a href="../05/02.html">
20170502
</a>
</li>
<li class="chapter " data-level="1.5.3" data-path="../05/03.html">
<a href="../05/03.html">
20170503
</a>
</li>
<li class="chapter " data-level="1.5.4" data-path="../05/04.html">
<a href="../05/04.html">
20170504
</a>
</li>
<li class="chapter " data-level="1.5.5" data-path="../05/05.html">
<a href="../05/05.html">
20170505
</a>
</li>
<li class="chapter " data-level="1.5.6" data-path="../05/06.html">
<a href="../05/06.html">
20170506
</a>
</li>
<li class="chapter " data-level="1.5.7" data-path="../05/07.html">
<a href="../05/07.html">
20170507
</a>
</li>
<li class="chapter " data-level="1.5.8" data-path="../05/08.html">
<a href="../05/08.html">
20170508
</a>
</li>
<li class="chapter " data-level="1.5.9" data-path="../05/09.html">
<a href="../05/09.html">
20170509
</a>
</li>
<li class="chapter " data-level="1.5.10" data-path="../05/10.html">
<a href="../05/10.html">
20170510
</a>
</li>
<li class="chapter " data-level="1.5.11" data-path="../05/11.html">
<a href="../05/11.html">
20170511
</a>
</li>
<li class="chapter " data-level="1.5.12" data-path="../05/12.html">
<a href="../05/12.html">
20170512
</a>
</li>
<li class="chapter " data-level="1.5.13" data-path="../05/13.html">
<a href="../05/13.html">
20170513
</a>
</li>
<li class="chapter " data-level="1.5.14" data-path="../05/14.html">
<a href="../05/14.html">
20170514
</a>
</li>
<li class="chapter " data-level="1.5.15" data-path="../05/15.html">
<a href="../05/15.html">
20170515
</a>
</li>
<li class="chapter " data-level="1.5.16" data-path="../05/16.html">
<a href="../05/16.html">
20170516
</a>
</li>
<li class="chapter " data-level="1.5.17" data-path="../05/17.html">
<a href="../05/17.html">
20170517
</a>
</li>
<li class="chapter " data-level="1.5.18" data-path="../05/18.html">
<a href="../05/18.html">
20170518
</a>
</li>
<li class="chapter " data-level="1.5.19" data-path="../05/19.html">
<a href="../05/19.html">
20170519
</a>
</li>
<li class="chapter " data-level="1.5.20" data-path="../05/20.html">
<a href="../05/20.html">
20170520
</a>
</li>
<li class="chapter " data-level="1.5.21" data-path="../05/21.html">
<a href="../05/21.html">
20170521
</a>
</li>
<li class="chapter " data-level="1.5.22" data-path="../05/22.html">
<a href="../05/22.html">
20170522
</a>
</li>
<li class="chapter " data-level="1.5.23" data-path="../05/23.md">
<span>
20170523
</a>
</li>
<li class="chapter " data-level="1.5.24" data-path="../05/24.md">
<span>
20170524
</a>
</li>
<li class="chapter " data-level="1.5.25" data-path="../05/25.md">
<span>
20170525
</a>
</li>
<li class="chapter " data-level="1.5.26" data-path="../05/26.md">
<span>
20170526
</a>
</li>
<li class="chapter " data-level="1.5.27" data-path="../05/27.md">
<span>
20170527
</a>
</li>
<li class="chapter " data-level="1.5.28" data-path="../05/28.md">
<span>
20170528
</a>
</li>
</ul>
</li>
<li class="divider"></li>
<li>
<a href="path_to_url" target="blank" class="gitbook-link">
Published with GitBook
</a>
</li>
</ul>
</nav>
</div>
<div class="book-body">
<div class="body-inner">
<div class="book-header" role="navigation">
<!-- Title -->
<h1>
<i class="fa fa-circle-o-notch fa-spin"></i>
<a href="../.." >20170414</a>
</h1>
</div>
<div class="page-wrapper" tabindex="-1" role="main">
<div class="page-inner">
<div id="book-search-results">
<div class="search-noresults">
<section class="normal markdown-section">
<h1 id="20170414-码农日报"><a href="14.html">20170414 码农日报</a></h1>
<p><a href="path_to_url" target="_blank">前端日报</a>栏目数据来自<a href="path_to_url" target="_blank">码农头条</a>（我开发的爬虫），每日分享前端、移动开发、设计、资源和资讯等，为开发者提供动力，点击Star按钮来关注这个项目，点击Watch来收听每日的更新<a href="path_to_url" target="_blank">Github主页</a></p>
<ul>
<li><a href="path_to_url" target="_blank">vue2 图片选择组件，支持多选和拖放</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">超越浏览器：从 web 应用到桌面应用</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">js中的this总结</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">Node.js, Express.js 搭建 HTTP/2 服务器</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">JavaScript 需要检查变量类型吗</a> （SegmentFault）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">vue-devtools 必备开发工具</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">React Native 性能之谜</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">GitHub 风格的 Markdown 正式规范发布</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">Slack 的 TypeScript 之路</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">实现一个前端模板引擎</a> （稀土掘金）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">移动端Vue.js图片预览插件</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">HTTP状态码: 301/302/303/307</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">在 Node.js 中引入模块：你所需要知道的一切都在这里</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">合理的可视化图表设计</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">php通过共享内存，控制mysql连接数，多进程插入数据（pcnt学习四）</a> （SegmentFault）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">使用开发者工具在浏览器中调整设计</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">团队开发Git分支管理策略</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">Gomoku：使用 Swoole 实现的在线五子棋项目</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">Serverless 架构（六）</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">Android & 卡顿 & App</a> （开发者头条）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">用 Swift 绘制漂亮的 Julia 分形图</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">实现一个简单但有趣的 AR 效果（Web）</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">Swift 代码小抄</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">渐进式开发光伏云系统实践（二）：MongoDB</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">Angular 4.x 自定义表单控件</a> （稀土掘金）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">Javascript OOP — 深入理解函数</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">PHP面试中常见的字符串与文件操作题目</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">Angular Material 之 Get Started</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">一道简单的算法题</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">伴随春天而来的 Swift 3.1</a> （开发者头条）</li>
</ul>
<p>日报维护作者：<a href="path_to_url" target="_blank">前端开发博客</a> </p>
</section>
</div>
<div class="search-results">
<div class="has-results">
<h1 class="search-results-title"><span class='search-results-count'></span> results matching "<span class='search-query'></span>"</h1>
<ul class="search-results-list"></ul>
</div>
<div class="no-results">
<h1 class="search-results-title">No results matching "<span class='search-query'></span>"</h1>
</div>
</div>
</div>
</div>
</div>
</div>
<a href="13.html" class="navigation navigation-prev " aria-label="Previous page: 20170413">
<i class="fa fa-angle-left"></i>
</a>
<a href="15.html" class="navigation navigation-next " aria-label="Next page: 20170415">
<i class="fa fa-angle-right"></i>
</a>
</div>
<script>
var gitbook = gitbook || [];
gitbook.push(function() {
gitbook.page.hasChanged({"page":{"title":"20170414","level":"1.4.14","depth":2,"next":{"title":"20170415","level":"1.4.15","depth":2,"path":"2017/04/15.md","ref":"2017/04/15.md","articles":[]},"previous":{"title":"20170413","level":"1.4.13","depth":2,"path":"2017/04/13.md","ref":"2017/04/13.md","articles":[]},"dir":"ltr"},"config":{"plugins":[],"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"},"pluginsConfig":{"highlight":{},"search":{},"lunr":{"maxIndexSize":1000000,"ignoreSpecialCharacters":false},"sharing":{"facebook":true,"twitter":true,"google":false,"weibo":false,"instapaper":false,"vk":false,"all":["facebook","google","twitter","weibo","instapaper"]},"fontsettings":{"theme":"white","family":"sans","size":2},"theme-default":{"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"},"showLevel":false}},"theme":"default","pdf":{"pageNumbers":true,"fontSize":12,"fontFamily":"Arial","paperSize":"a4","chapterMark":"pagebreak","pageBreaksBefore":"/","margin":{"right":62,"left":62,"top":56,"bottom":56}},"structure":{"langs":"LANGS.md","readme":"README.md","glossary":"GLOSSARY.md","summary":"SUMMARY.md"},"variables":{},"title":"","links":{"sidebar":{"WEB":"path_to_url"},"sharing":{"google":null,"facebook":null,"twitter":null,"weibo":null,"all":null}},"gitbook":"*","description":"Watch path_to_url"},"file":{"path":"2017/04/14.md","mtime":"2017-05-07T07:24:15.086Z","type":"markdown"},"gitbook":{"version":"3.2.2","time":"2017-05-23T14:32:08.524Z"},"basePath":"../..","book":{"language":""}});
});
</script>
</div>
<script src="../../gitbook/gitbook.js"></script>
<script src="../../gitbook/theme.js"></script>
<script src="../../gitbook/gitbook-plugin-search/search-engine.js"></script>
<script src="../../gitbook/gitbook-plugin-search/search.js"></script>
<script src="../../gitbook/gitbook-plugin-lunr/lunr.min.js"></script>
<script src="../../gitbook/gitbook-plugin-lunr/search-lunr.js"></script>
<script src="../../gitbook/gitbook-plugin-sharing/buttons.js"></script>
<script src="../../gitbook/gitbook-plugin-fontsettings/fontsettings.js"></script>
</body>
</html>
```
|
Dine Potter (born 4 September 1975) is an Antigua and Barbuda sprinter. She competed in the women's 4 × 100 metres relay at the 1996 Summer Olympics.
References
1975 births
Living people
Athletes (track and field) at the 1996 Summer Olympics
Antigua and Barbuda female sprinters
Olympic athletes for Antigua and Barbuda
Place of birth missing (living people)
Olympic female sprinters
|
```objective-c
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
//
// This Source Code Form is subject to the terms of the Mozilla
// with this file, You can obtain one at path_to_url
#ifndef EIGEN_PACKET_MATH_CUDA_H
#define EIGEN_PACKET_MATH_CUDA_H
namespace Eigen {
namespace internal {
// Make sure this is only available when targeting a GPU: we don't want to
// introduce conflicts between these packet_traits definitions and the ones
// we'll use on the host side (SSE, AVX, ...)
#if defined(__CUDACC__) && defined(EIGEN_USE_GPU)
template<> struct is_arithmetic<float4> { enum { value = true }; };
template<> struct is_arithmetic<double2> { enum { value = true }; };
template<> struct packet_traits<float> : default_packet_traits
{
typedef float4 type;
typedef float4 half;
enum {
Vectorizable = 1,
AlignedOnScalar = 1,
size=4,
HasHalfPacket = 0,
HasDiv = 1,
HasSin = 0,
HasCos = 0,
HasLog = 1,
HasExp = 1,
HasSqrt = 1,
HasRsqrt = 1,
HasLGamma = 1,
HasDiGamma = 1,
HasZeta = 1,
HasPolygamma = 1,
HasErf = 1,
HasErfc = 1,
HasIGamma = 1,
HasIGammac = 1,
HasBetaInc = 1,
HasBlend = 0,
};
};
template<> struct packet_traits<double> : default_packet_traits
{
typedef double2 type;
typedef double2 half;
enum {
Vectorizable = 1,
AlignedOnScalar = 1,
size=2,
HasHalfPacket = 0,
HasDiv = 1,
HasLog = 1,
HasExp = 1,
HasSqrt = 1,
HasRsqrt = 1,
HasLGamma = 1,
HasDiGamma = 1,
HasZeta = 1,
HasPolygamma = 1,
HasErf = 1,
HasErfc = 1,
HasIGamma = 1,
HasIGammac = 1,
HasBetaInc = 1,
HasBlend = 0,
};
};
template<> struct unpacket_traits<float4> { typedef float type; enum {size=4, alignment=Aligned16}; typedef float4 half; };
template<> struct unpacket_traits<double2> { typedef double type; enum {size=2, alignment=Aligned16}; typedef double2 half; };
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pset1<float4>(const float& from) {
return make_float4(from, from, from, from);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pset1<double2>(const double& from) {
return make_double2(from, from);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 plset<float4>(const float& a) {
return make_float4(a, a+1, a+2, a+3);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 plset<double2>(const double& a) {
return make_double2(a, a+1);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 padd<float4>(const float4& a, const float4& b) {
return make_float4(a.x+b.x, a.y+b.y, a.z+b.z, a.w+b.w);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 padd<double2>(const double2& a, const double2& b) {
return make_double2(a.x+b.x, a.y+b.y);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 psub<float4>(const float4& a, const float4& b) {
return make_float4(a.x-b.x, a.y-b.y, a.z-b.z, a.w-b.w);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 psub<double2>(const double2& a, const double2& b) {
return make_double2(a.x-b.x, a.y-b.y);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pnegate(const float4& a) {
return make_float4(-a.x, -a.y, -a.z, -a.w);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pnegate(const double2& a) {
return make_double2(-a.x, -a.y);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pconj(const float4& a) { return a; }
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pconj(const double2& a) { return a; }
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pmul<float4>(const float4& a, const float4& b) {
return make_float4(a.x*b.x, a.y*b.y, a.z*b.z, a.w*b.w);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pmul<double2>(const double2& a, const double2& b) {
return make_double2(a.x*b.x, a.y*b.y);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pdiv<float4>(const float4& a, const float4& b) {
return make_float4(a.x/b.x, a.y/b.y, a.z/b.z, a.w/b.w);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pdiv<double2>(const double2& a, const double2& b) {
return make_double2(a.x/b.x, a.y/b.y);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pmin<float4>(const float4& a, const float4& b) {
return make_float4(fminf(a.x, b.x), fminf(a.y, b.y), fminf(a.z, b.z), fminf(a.w, b.w));
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pmin<double2>(const double2& a, const double2& b) {
return make_double2(fmin(a.x, b.x), fmin(a.y, b.y));
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pmax<float4>(const float4& a, const float4& b) {
return make_float4(fmaxf(a.x, b.x), fmaxf(a.y, b.y), fmaxf(a.z, b.z), fmaxf(a.w, b.w));
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pmax<double2>(const double2& a, const double2& b) {
return make_double2(fmax(a.x, b.x), fmax(a.y, b.y));
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pload<float4>(const float* from) {
return *reinterpret_cast<const float4*>(from);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pload<double2>(const double* from) {
return *reinterpret_cast<const double2*>(from);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 ploadu<float4>(const float* from) {
return make_float4(from[0], from[1], from[2], from[3]);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 ploadu<double2>(const double* from) {
return make_double2(from[0], from[1]);
}
template<> EIGEN_STRONG_INLINE float4 ploaddup<float4>(const float* from) {
return make_float4(from[0], from[0], from[1], from[1]);
}
template<> EIGEN_STRONG_INLINE double2 ploaddup<double2>(const double* from) {
return make_double2(from[0], from[0]);
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void pstore<float>(float* to, const float4& from) {
*reinterpret_cast<float4*>(to) = from;
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void pstore<double>(double* to, const double2& from) {
*reinterpret_cast<double2*>(to) = from;
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void pstoreu<float>(float* to, const float4& from) {
to[0] = from.x;
to[1] = from.y;
to[2] = from.z;
to[3] = from.w;
}
template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void pstoreu<double>(double* to, const double2& from) {
to[0] = from.x;
to[1] = from.y;
}
template<>
EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE float4 ploadt_ro<float4, Aligned>(const float* from) {
#if defined(__CUDA_ARCH__) && __CUDA_ARCH__ >= 350
return __ldg((const float4*)from);
#else
return make_float4(from[0], from[1], from[2], from[3]);
#endif
}
template<>
EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE double2 ploadt_ro<double2, Aligned>(const double* from) {
#if defined(__CUDA_ARCH__) && __CUDA_ARCH__ >= 350
return __ldg((const double2*)from);
#else
return make_double2(from[0], from[1]);
#endif
}
template<>
EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE float4 ploadt_ro<float4, Unaligned>(const float* from) {
#if defined(__CUDA_ARCH__) && __CUDA_ARCH__ >= 350
return make_float4(__ldg(from+0), __ldg(from+1), __ldg(from+2), __ldg(from+3));
#else
return make_float4(from[0], from[1], from[2], from[3]);
#endif
}
template<>
EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE double2 ploadt_ro<double2, Unaligned>(const double* from) {
#if defined(__CUDA_ARCH__) && __CUDA_ARCH__ >= 350
return make_double2(__ldg(from+0), __ldg(from+1));
#else
return make_double2(from[0], from[1]);
#endif
}
template<> EIGEN_DEVICE_FUNC inline float4 pgather<float, float4>(const float* from, Index stride) {
return make_float4(from[0*stride], from[1*stride], from[2*stride], from[3*stride]);
}
template<> EIGEN_DEVICE_FUNC inline double2 pgather<double, double2>(const double* from, Index stride) {
return make_double2(from[0*stride], from[1*stride]);
}
template<> EIGEN_DEVICE_FUNC inline void pscatter<float, float4>(float* to, const float4& from, Index stride) {
to[stride*0] = from.x;
to[stride*1] = from.y;
to[stride*2] = from.z;
to[stride*3] = from.w;
}
template<> EIGEN_DEVICE_FUNC inline void pscatter<double, double2>(double* to, const double2& from, Index stride) {
to[stride*0] = from.x;
to[stride*1] = from.y;
}
template<> EIGEN_DEVICE_FUNC inline float pfirst<float4>(const float4& a) {
return a.x;
}
template<> EIGEN_DEVICE_FUNC inline double pfirst<double2>(const double2& a) {
return a.x;
}
template<> EIGEN_DEVICE_FUNC inline float predux<float4>(const float4& a) {
return a.x + a.y + a.z + a.w;
}
template<> EIGEN_DEVICE_FUNC inline double predux<double2>(const double2& a) {
return a.x + a.y;
}
template<> EIGEN_DEVICE_FUNC inline float predux_max<float4>(const float4& a) {
return fmaxf(fmaxf(a.x, a.y), fmaxf(a.z, a.w));
}
template<> EIGEN_DEVICE_FUNC inline double predux_max<double2>(const double2& a) {
return fmax(a.x, a.y);
}
template<> EIGEN_DEVICE_FUNC inline float predux_min<float4>(const float4& a) {
return fminf(fminf(a.x, a.y), fminf(a.z, a.w));
}
template<> EIGEN_DEVICE_FUNC inline double predux_min<double2>(const double2& a) {
return fmin(a.x, a.y);
}
template<> EIGEN_DEVICE_FUNC inline float predux_mul<float4>(const float4& a) {
return a.x * a.y * a.z * a.w;
}
template<> EIGEN_DEVICE_FUNC inline double predux_mul<double2>(const double2& a) {
return a.x * a.y;
}
template<> EIGEN_DEVICE_FUNC inline float4 pabs<float4>(const float4& a) {
return make_float4(fabsf(a.x), fabsf(a.y), fabsf(a.z), fabsf(a.w));
}
template<> EIGEN_DEVICE_FUNC inline double2 pabs<double2>(const double2& a) {
return make_double2(fabs(a.x), fabs(a.y));
}
EIGEN_DEVICE_FUNC inline void
ptranspose(PacketBlock<float4,4>& kernel) {
float tmp = kernel.packet[0].y;
kernel.packet[0].y = kernel.packet[1].x;
kernel.packet[1].x = tmp;
tmp = kernel.packet[0].z;
kernel.packet[0].z = kernel.packet[2].x;
kernel.packet[2].x = tmp;
tmp = kernel.packet[0].w;
kernel.packet[0].w = kernel.packet[3].x;
kernel.packet[3].x = tmp;
tmp = kernel.packet[1].z;
kernel.packet[1].z = kernel.packet[2].y;
kernel.packet[2].y = tmp;
tmp = kernel.packet[1].w;
kernel.packet[1].w = kernel.packet[3].y;
kernel.packet[3].y = tmp;
tmp = kernel.packet[2].w;
kernel.packet[2].w = kernel.packet[3].z;
kernel.packet[3].z = tmp;
}
EIGEN_DEVICE_FUNC inline void
ptranspose(PacketBlock<double2,2>& kernel) {
double tmp = kernel.packet[0].y;
kernel.packet[0].y = kernel.packet[1].x;
kernel.packet[1].x = tmp;
}
#endif
} // end namespace internal
} // end namespace Eigen
#endif // EIGEN_PACKET_MATH_CUDA_H
```
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package v1beta2
// This file contains a collection of methods that can be used from go-restful to
// generate Swagger API documentation for its models. Please read this PR for more
// information on the implementation: path_to_url
//
// TODOs are ignored from the parser (e.g. TODO(andronat):... || TODO:...) if and only if
// they are on one line! For multiple line or blocks that you want to ignore use ---.
// Any context after a --- is ignored.
//
// Those methods can be generated by using hack/update-generated-swagger-docs.sh
// AUTO-GENERATED FUNCTIONS START HERE. DO NOT EDIT.
var map_ControllerRevision = map[string]string{
"": "DEPRECATED - This group version of ControllerRevision is deprecated by apps/v1/ControllerRevision. See the release notes for more information. ControllerRevision implements an immutable snapshot of state data. Clients are responsible for serializing and deserializing the objects that contain their internal state. Once a ControllerRevision has been successfully created, it can not be updated. The API Server will fail validation of all requests that attempt to mutate the Data field. ControllerRevisions may, however, be deleted. Note that, due to its use by both the DaemonSet and StatefulSet controllers for update and rollback, this object is beta. However, it may be subject to name and representation changes in future releases, and clients should not depend on its stability. It is primarily for internal use by controllers.",
"metadata": "Standard object's metadata. More info: path_to_url#metadata",
"data": "Data is the serialized representation of the state.",
"revision": "Revision indicates the revision of the state represented by Data.",
}
func (ControllerRevision) SwaggerDoc() map[string]string {
return map_ControllerRevision
}
var map_ControllerRevisionList = map[string]string{
"": "ControllerRevisionList is a resource containing a list of ControllerRevision objects.",
"metadata": "More info: path_to_url#metadata",
"items": "Items is the list of ControllerRevisions",
}
func (ControllerRevisionList) SwaggerDoc() map[string]string {
return map_ControllerRevisionList
}
var map_DaemonSet = map[string]string{
"": "DEPRECATED - This group version of DaemonSet is deprecated by apps/v1/DaemonSet. See the release notes for more information. DaemonSet represents the configuration of a daemon set.",
"metadata": "Standard object's metadata. More info: path_to_url#metadata",
"spec": "The desired behavior of this daemon set. More info: path_to_url#spec-and-status",
"status": "The current status of this daemon set. This data may be out of date by some window of time. Populated by the system. Read-only. More info: path_to_url#spec-and-status",
}
func (DaemonSet) SwaggerDoc() map[string]string {
return map_DaemonSet
}
var map_DaemonSetCondition = map[string]string{
"": "DaemonSetCondition describes the state of a DaemonSet at a certain point.",
"type": "Type of DaemonSet condition.",
"status": "Status of the condition, one of True, False, Unknown.",
"lastTransitionTime": "Last time the condition transitioned from one status to another.",
"reason": "The reason for the condition's last transition.",
"message": "A human readable message indicating details about the transition.",
}
func (DaemonSetCondition) SwaggerDoc() map[string]string {
return map_DaemonSetCondition
}
var map_DaemonSetList = map[string]string{
"": "DaemonSetList is a collection of daemon sets.",
"metadata": "Standard list metadata. More info: path_to_url#metadata",
"items": "A list of daemon sets.",
}
func (DaemonSetList) SwaggerDoc() map[string]string {
return map_DaemonSetList
}
var map_DaemonSetSpec = map[string]string{
"": "DaemonSetSpec is the specification of a daemon set.",
"selector": "A label query over pods that are managed by the daemon set. Must match in order to be controlled. It must match the pod template's labels. More info: path_to_url#label-selectors",
"template": "An object that describes the pod that will be created. The DaemonSet will create exactly one copy of this pod on every node that matches the template's node selector (or on every node if no node selector is specified). More info: path_to_url#pod-template",
"updateStrategy": "An update strategy to replace existing DaemonSet pods with new pods.",
"minReadySeconds": "The minimum number of seconds for which a newly created DaemonSet pod should be ready without any of its container crashing, for it to be considered available. Defaults to 0 (pod will be considered available as soon as it is ready).",
"revisionHistoryLimit": "The number of old history to retain to allow rollback. This is a pointer to distinguish between explicit zero and not specified. Defaults to 10.",
}
func (DaemonSetSpec) SwaggerDoc() map[string]string {
return map_DaemonSetSpec
}
var map_DaemonSetStatus = map[string]string{
"": "DaemonSetStatus represents the current status of a daemon set.",
"currentNumberScheduled": "The number of nodes that are running at least 1 daemon pod and are supposed to run the daemon pod. More info: path_to_url",
"numberMisscheduled": "The number of nodes that are running the daemon pod, but are not supposed to run the daemon pod. More info: path_to_url",
"desiredNumberScheduled": "The total number of nodes that should be running the daemon pod (including nodes correctly running the daemon pod). More info: path_to_url",
"numberReady": "The number of nodes that should be running the daemon pod and have one or more of the daemon pod running and ready.",
"observedGeneration": "The most recent generation observed by the daemon set controller.",
"updatedNumberScheduled": "The total number of nodes that are running updated daemon pod",
"numberAvailable": "The number of nodes that should be running the daemon pod and have one or more of the daemon pod running and available (ready for at least spec.minReadySeconds)",
"numberUnavailable": "The number of nodes that should be running the daemon pod and have none of the daemon pod running and available (ready for at least spec.minReadySeconds)",
"collisionCount": "Count of hash collisions for the DaemonSet. The DaemonSet controller uses this field as a collision avoidance mechanism when it needs to create the name for the newest ControllerRevision.",
"conditions": "Represents the latest available observations of a DaemonSet's current state.",
}
func (DaemonSetStatus) SwaggerDoc() map[string]string {
return map_DaemonSetStatus
}
var map_DaemonSetUpdateStrategy = map[string]string{
"": "DaemonSetUpdateStrategy is a struct used to control the update strategy for a DaemonSet.",
"type": "Type of daemon set update. Can be \"RollingUpdate\" or \"OnDelete\". Default is RollingUpdate.",
"rollingUpdate": "Rolling update config params. Present only if type = \"RollingUpdate\".",
}
func (DaemonSetUpdateStrategy) SwaggerDoc() map[string]string {
return map_DaemonSetUpdateStrategy
}
var map_Deployment = map[string]string{
"": "DEPRECATED - This group version of Deployment is deprecated by apps/v1/Deployment. See the release notes for more information. Deployment enables declarative updates for Pods and ReplicaSets.",
"metadata": "Standard object metadata.",
"spec": "Specification of the desired behavior of the Deployment.",
"status": "Most recently observed status of the Deployment.",
}
func (Deployment) SwaggerDoc() map[string]string {
return map_Deployment
}
var map_DeploymentCondition = map[string]string{
"": "DeploymentCondition describes the state of a deployment at a certain point.",
"type": "Type of deployment condition.",
"status": "Status of the condition, one of True, False, Unknown.",
"lastUpdateTime": "The last time this condition was updated.",
"lastTransitionTime": "Last time the condition transitioned from one status to another.",
"reason": "The reason for the condition's last transition.",
"message": "A human readable message indicating details about the transition.",
}
func (DeploymentCondition) SwaggerDoc() map[string]string {
return map_DeploymentCondition
}
var map_DeploymentList = map[string]string{
"": "DeploymentList is a list of Deployments.",
"metadata": "Standard list metadata.",
"items": "Items is the list of Deployments.",
}
func (DeploymentList) SwaggerDoc() map[string]string {
return map_DeploymentList
}
var map_DeploymentSpec = map[string]string{
"": "DeploymentSpec is the specification of the desired behavior of the Deployment.",
"replicas": "Number of desired pods. This is a pointer to distinguish between explicit zero and not specified. Defaults to 1.",
"selector": "Label selector for pods. Existing ReplicaSets whose pods are selected by this will be the ones affected by this deployment. It must match the pod template's labels.",
"template": "Template describes the pods that will be created.",
"strategy": "The deployment strategy to use to replace existing pods with new ones.",
"minReadySeconds": "Minimum number of seconds for which a newly created pod should be ready without any of its container crashing, for it to be considered available. Defaults to 0 (pod will be considered available as soon as it is ready)",
"revisionHistoryLimit": "The number of old ReplicaSets to retain to allow rollback. This is a pointer to distinguish between explicit zero and not specified. Defaults to 10.",
"paused": "Indicates that the deployment is paused.",
"progressDeadlineSeconds": "The maximum time in seconds for a deployment to make progress before it is considered to be failed. The deployment controller will continue to process failed deployments and a condition with a ProgressDeadlineExceeded reason will be surfaced in the deployment status. Note that progress will not be estimated during the time a deployment is paused. Defaults to 600s.",
}
func (DeploymentSpec) SwaggerDoc() map[string]string {
return map_DeploymentSpec
}
var map_DeploymentStatus = map[string]string{
"": "DeploymentStatus is the most recently observed status of the Deployment.",
"observedGeneration": "The generation observed by the deployment controller.",
"replicas": "Total number of non-terminated pods targeted by this deployment (their labels match the selector).",
"updatedReplicas": "Total number of non-terminated pods targeted by this deployment that have the desired template spec.",
"readyReplicas": "Total number of ready pods targeted by this deployment.",
"availableReplicas": "Total number of available pods (ready for at least minReadySeconds) targeted by this deployment.",
"unavailableReplicas": "Total number of unavailable pods targeted by this deployment. This is the total number of pods that are still required for the deployment to have 100% available capacity. They may either be pods that are running but not yet available or pods that still have not been created.",
"conditions": "Represents the latest available observations of a deployment's current state.",
"collisionCount": "Count of hash collisions for the Deployment. The Deployment controller uses this field as a collision avoidance mechanism when it needs to create the name for the newest ReplicaSet.",
}
func (DeploymentStatus) SwaggerDoc() map[string]string {
return map_DeploymentStatus
}
var map_DeploymentStrategy = map[string]string{
"": "DeploymentStrategy describes how to replace existing pods with new ones.",
"type": "Type of deployment. Can be \"Recreate\" or \"RollingUpdate\". Default is RollingUpdate.",
"rollingUpdate": "Rolling update config params. Present only if DeploymentStrategyType = RollingUpdate.",
}
func (DeploymentStrategy) SwaggerDoc() map[string]string {
return map_DeploymentStrategy
}
var map_ReplicaSet = map[string]string{
"": "DEPRECATED - This group version of ReplicaSet is deprecated by apps/v1/ReplicaSet. See the release notes for more information. ReplicaSet ensures that a specified number of pod replicas are running at any given time.",
"metadata": "If the Labels of a ReplicaSet are empty, they are defaulted to be the same as the Pod(s) that the ReplicaSet manages. Standard object's metadata. More info: path_to_url#metadata",
"spec": "Spec defines the specification of the desired behavior of the ReplicaSet. More info: path_to_url#spec-and-status",
"status": "Status is the most recently observed status of the ReplicaSet. This data may be out of date by some window of time. Populated by the system. Read-only. More info: path_to_url#spec-and-status",
}
func (ReplicaSet) SwaggerDoc() map[string]string {
return map_ReplicaSet
}
var map_ReplicaSetCondition = map[string]string{
"": "ReplicaSetCondition describes the state of a replica set at a certain point.",
"type": "Type of replica set condition.",
"status": "Status of the condition, one of True, False, Unknown.",
"lastTransitionTime": "The last time the condition transitioned from one status to another.",
"reason": "The reason for the condition's last transition.",
"message": "A human readable message indicating details about the transition.",
}
func (ReplicaSetCondition) SwaggerDoc() map[string]string {
return map_ReplicaSetCondition
}
var map_ReplicaSetList = map[string]string{
"": "ReplicaSetList is a collection of ReplicaSets.",
"metadata": "Standard list metadata. More info: path_to_url#types-kinds",
"items": "List of ReplicaSets. More info: path_to_url",
}
func (ReplicaSetList) SwaggerDoc() map[string]string {
return map_ReplicaSetList
}
var map_ReplicaSetSpec = map[string]string{
"": "ReplicaSetSpec is the specification of a ReplicaSet.",
"replicas": "Replicas is the number of desired replicas. This is a pointer to distinguish between explicit zero and unspecified. Defaults to 1. More info: path_to_url#what-is-a-replicationcontroller",
"minReadySeconds": "Minimum number of seconds for which a newly created pod should be ready without any of its container crashing, for it to be considered available. Defaults to 0 (pod will be considered available as soon as it is ready)",
"selector": "Selector is a label query over pods that should match the replica count. Label keys and values that must match in order to be controlled by this replica set. It must match the pod template's labels. More info: path_to_url#label-selectors",
"template": "Template is the object that describes the pod that will be created if insufficient replicas are detected. More info: path_to_url#pod-template",
}
func (ReplicaSetSpec) SwaggerDoc() map[string]string {
return map_ReplicaSetSpec
}
var map_ReplicaSetStatus = map[string]string{
"": "ReplicaSetStatus represents the current status of a ReplicaSet.",
"replicas": "Replicas is the most recently oberved number of replicas. More info: path_to_url#what-is-a-replicationcontroller",
"fullyLabeledReplicas": "The number of pods that have labels matching the labels of the pod template of the replicaset.",
"readyReplicas": "The number of ready replicas for this replica set.",
"availableReplicas": "The number of available replicas (ready for at least minReadySeconds) for this replica set.",
"observedGeneration": "ObservedGeneration reflects the generation of the most recently observed ReplicaSet.",
"conditions": "Represents the latest available observations of a replica set's current state.",
}
func (ReplicaSetStatus) SwaggerDoc() map[string]string {
return map_ReplicaSetStatus
}
var map_RollingUpdateDaemonSet = map[string]string{
"": "Spec to control the desired behavior of daemon set rolling update.",
"maxUnavailable": "The maximum number of DaemonSet pods that can be unavailable during the update. Value can be an absolute number (ex: 5) or a percentage of total number of DaemonSet pods at the start of the update (ex: 10%). Absolute number is calculated from percentage by rounding up. This cannot be 0. Default value is 1. Example: when this is set to 30%, at most 30% of the total number of nodes that should be running the daemon pod (i.e. status.desiredNumberScheduled) can have their pods stopped for an update at any given time. The update starts by stopping at most 30% of those DaemonSet pods and then brings up new DaemonSet pods in their place. Once the new pods are available, it then proceeds onto other DaemonSet pods, thus ensuring that at least 70% of original number of DaemonSet pods are available at all times during the update.",
}
func (RollingUpdateDaemonSet) SwaggerDoc() map[string]string {
return map_RollingUpdateDaemonSet
}
var map_RollingUpdateDeployment = map[string]string{
"": "Spec to control the desired behavior of rolling update.",
"maxUnavailable": "The maximum number of pods that can be unavailable during the update. Value can be an absolute number (ex: 5) or a percentage of desired pods (ex: 10%). Absolute number is calculated from percentage by rounding down. This can not be 0 if MaxSurge is 0. Defaults to 25%. Example: when this is set to 30%, the old ReplicaSet can be scaled down to 70% of desired pods immediately when the rolling update starts. Once new pods are ready, old ReplicaSet can be scaled down further, followed by scaling up the new ReplicaSet, ensuring that the total number of pods available at all times during the update is at least 70% of desired pods.",
"maxSurge": "The maximum number of pods that can be scheduled above the desired number of pods. Value can be an absolute number (ex: 5) or a percentage of desired pods (ex: 10%). This can not be 0 if MaxUnavailable is 0. Absolute number is calculated from percentage by rounding up. Defaults to 25%. Example: when this is set to 30%, the new ReplicaSet can be scaled up immediately when the rolling update starts, such that the total number of old and new pods do not exceed 130% of desired pods. Once old pods have been killed, new ReplicaSet can be scaled up further, ensuring that total number of pods running at any time during the update is at most 130% of desired pods.",
}
func (RollingUpdateDeployment) SwaggerDoc() map[string]string {
return map_RollingUpdateDeployment
}
var map_RollingUpdateStatefulSetStrategy = map[string]string{
"": "RollingUpdateStatefulSetStrategy is used to communicate parameter for RollingUpdateStatefulSetStrategyType.",
"partition": "Partition indicates the ordinal at which the StatefulSet should be partitioned. Default value is 0.",
}
func (RollingUpdateStatefulSetStrategy) SwaggerDoc() map[string]string {
return map_RollingUpdateStatefulSetStrategy
}
var map_Scale = map[string]string{
"": "Scale represents a scaling request for a resource.",
"metadata": "Standard object metadata; More info: path_to_url#metadata.",
"spec": "defines the behavior of the scale. More info: path_to_url#spec-and-status.",
"status": "current status of the scale. More info: path_to_url#spec-and-status. Read-only.",
}
func (Scale) SwaggerDoc() map[string]string {
return map_Scale
}
var map_ScaleSpec = map[string]string{
"": "ScaleSpec describes the attributes of a scale subresource",
"replicas": "desired number of instances for the scaled object.",
}
func (ScaleSpec) SwaggerDoc() map[string]string {
return map_ScaleSpec
}
var map_ScaleStatus = map[string]string{
"": "ScaleStatus represents the current status of a scale subresource.",
"replicas": "actual number of observed instances of the scaled object.",
"selector": "label query over pods that should match the replicas count. More info: path_to_url#label-selectors",
"targetSelector": "label selector for pods that should match the replicas count. This is a serializated version of both map-based and more expressive set-based selectors. This is done to avoid introspection in the clients. The string will be in the same format as the query-param syntax. If the target type only supports map-based selectors, both this field and map-based selector field are populated. More info: path_to_url#label-selectors",
}
func (ScaleStatus) SwaggerDoc() map[string]string {
return map_ScaleStatus
}
var map_StatefulSet = map[string]string{
"": "DEPRECATED - This group version of StatefulSet is deprecated by apps/v1/StatefulSet. See the release notes for more information. StatefulSet represents a set of pods with consistent identities. Identities are defined as:\n - Network: A single stable DNS and hostname.\n - Storage: As many VolumeClaims as requested.\nThe StatefulSet guarantees that a given network identity will always map to the same storage identity.",
"spec": "Spec defines the desired identities of pods in this set.",
"status": "Status is the current status of Pods in this StatefulSet. This data may be out of date by some window of time.",
}
func (StatefulSet) SwaggerDoc() map[string]string {
return map_StatefulSet
}
var map_StatefulSetCondition = map[string]string{
"": "StatefulSetCondition describes the state of a statefulset at a certain point.",
"type": "Type of statefulset condition.",
"status": "Status of the condition, one of True, False, Unknown.",
"lastTransitionTime": "Last time the condition transitioned from one status to another.",
"reason": "The reason for the condition's last transition.",
"message": "A human readable message indicating details about the transition.",
}
func (StatefulSetCondition) SwaggerDoc() map[string]string {
return map_StatefulSetCondition
}
var map_StatefulSetList = map[string]string{
"": "StatefulSetList is a collection of StatefulSets.",
}
func (StatefulSetList) SwaggerDoc() map[string]string {
return map_StatefulSetList
}
var map_StatefulSetSpec = map[string]string{
"": "A StatefulSetSpec is the specification of a StatefulSet.",
"replicas": "replicas is the desired number of replicas of the given Template. These are replicas in the sense that they are instantiations of the same Template, but individual replicas also have a consistent identity. If unspecified, defaults to 1.",
"selector": "selector is a label query over pods that should match the replica count. It must match the pod template's labels. More info: path_to_url#label-selectors",
"template": "template is the object that describes the pod that will be created if insufficient replicas are detected. Each pod stamped out by the StatefulSet will fulfill this Template, but have a unique identity from the rest of the StatefulSet.",
"volumeClaimTemplates": "volumeClaimTemplates is a list of claims that pods are allowed to reference. The StatefulSet controller is responsible for mapping network identities to claims in a way that maintains the identity of a pod. Every claim in this list must have at least one matching (by name) volumeMount in one container in the template. A claim in this list takes precedence over any volumes in the template, with the same name.",
"serviceName": "serviceName is the name of the service that governs this StatefulSet. This service must exist before the StatefulSet, and is responsible for the network identity of the set. Pods get DNS/hostnames that follow the pattern: pod-specific-string.serviceName.default.svc.cluster.local where \"pod-specific-string\" is managed by the StatefulSet controller.",
"podManagementPolicy": "podManagementPolicy controls how pods are created during initial scale up, when replacing pods on nodes, or when scaling down. The default policy is `OrderedReady`, where pods are created in increasing order (pod-0, then pod-1, etc) and the controller will wait until each pod is ready before continuing. When scaling down, the pods are removed in the opposite order. The alternative policy is `Parallel` which will create pods in parallel to match the desired scale without waiting, and on scale down will delete all pods at once.",
"updateStrategy": "updateStrategy indicates the StatefulSetUpdateStrategy that will be employed to update Pods in the StatefulSet when a revision is made to Template.",
"revisionHistoryLimit": "revisionHistoryLimit is the maximum number of revisions that will be maintained in the StatefulSet's revision history. The revision history consists of all revisions not represented by a currently applied StatefulSetSpec version. The default value is 10.",
}
func (StatefulSetSpec) SwaggerDoc() map[string]string {
return map_StatefulSetSpec
}
var map_StatefulSetStatus = map[string]string{
"": "StatefulSetStatus represents the current state of a StatefulSet.",
"observedGeneration": "observedGeneration is the most recent generation observed for this StatefulSet. It corresponds to the StatefulSet's generation, which is updated on mutation by the API Server.",
"replicas": "replicas is the number of Pods created by the StatefulSet controller.",
"readyReplicas": "readyReplicas is the number of Pods created by the StatefulSet controller that have a Ready Condition.",
"currentReplicas": "currentReplicas is the number of Pods created by the StatefulSet controller from the StatefulSet version indicated by currentRevision.",
"updatedReplicas": "updatedReplicas is the number of Pods created by the StatefulSet controller from the StatefulSet version indicated by updateRevision.",
"currentRevision": "currentRevision, if not empty, indicates the version of the StatefulSet used to generate Pods in the sequence [0,currentReplicas).",
"updateRevision": "updateRevision, if not empty, indicates the version of the StatefulSet used to generate Pods in the sequence [replicas-updatedReplicas,replicas)",
"collisionCount": "collisionCount is the count of hash collisions for the StatefulSet. The StatefulSet controller uses this field as a collision avoidance mechanism when it needs to create the name for the newest ControllerRevision.",
"conditions": "Represents the latest available observations of a statefulset's current state.",
}
func (StatefulSetStatus) SwaggerDoc() map[string]string {
return map_StatefulSetStatus
}
var map_StatefulSetUpdateStrategy = map[string]string{
"": "StatefulSetUpdateStrategy indicates the strategy that the StatefulSet controller will use to perform updates. It includes any additional parameters necessary to perform the update for the indicated strategy.",
"type": "Type indicates the type of the StatefulSetUpdateStrategy. Default is RollingUpdate.",
"rollingUpdate": "RollingUpdate is used to communicate parameters when Type is RollingUpdateStatefulSetStrategyType.",
}
func (StatefulSetUpdateStrategy) SwaggerDoc() map[string]string {
return map_StatefulSetUpdateStrategy
}
// AUTO-GENERATED FUNCTIONS END HERE
```
|
```javascript
const weightedSearchAlgorithm = require("../pathfindingAlgorithms/weightedSearchAlgorithm");
const unweightedSearchAlgorithm = require("../pathfindingAlgorithms/unweightedSearchAlgorithm");
function launchInstantAnimations(board, success, type, object, algorithm, heuristic) {
let nodes = object ? board.objectNodesToAnimate.slice(0) : board.nodesToAnimate.slice(0);
let shortestNodes;
for (let i = 0; i < nodes.length; i++) {
if (i === 0) {
change(nodes[i]);
} else {
change(nodes[i], nodes[i - 1]);
}
}
if (object) {
board.objectNodesToAnimate = [];
if (success) {
board.drawShortestPath(board.object, board.start, "object");
board.clearNodeStatuses();
let newSuccess;
if (type === "weighted") {
newSuccess = weightedSearchAlgorithm(board.nodes, board.object, board.target, board.nodesToAnimate, board.boardArray, algorithm, heuristic);
} else {
newSuccess = unweightedSearchAlgorithm(board.nodes, board.object, board.target, board.nodesToAnimate, board.boardArray, algorithm);
}
launchInstantAnimations(board, newSuccess, type);
shortestNodes = board.objectShortestPathNodesToAnimate.concat(board.shortestPathNodesToAnimate);
} else {
console.log("Failure.");
board.reset();
return;
}
} else {
board.nodesToAnimate = [];
if (success) {
if (board.isObject) {
board.drawShortestPath(board.target, board.object);
} else {
board.drawShortestPath(board.target, board.start);
}
shortestNodes = board.objectShortestPathNodesToAnimate.concat(board.shortestPathNodesToAnimate);
} else {
console.log("Failure");
board.reset();
return;
}
}
let j;
for (j = 0; j < shortestNodes.length; j++) {
if (j === 0) {
shortestPathChange(shortestNodes[j]);
} else {
shortestPathChange(shortestNodes[j], shortestNodes[j - 1]);
}
}
board.reset();
if (object) {
shortestPathChange(board.nodes[board.target], shortestNodes[j - 1]);
board.objectShortestPathNodesToAnimate = [];
board.shortestPathNodesToAnimate = [];
board.clearNodeStatuses();
let newSuccess;
if (type === "weighted") {
newSuccess = weightedSearchAlgorithm(board.nodes, board.object, board.target, board.nodesToAnimate, board.boardArray, algorithm);
} else {
newSuccess = unweightedSearchAlgorithm(board.nodes, board.object, board.target, board.nodesToAnimate, board.boardArray, algorithm);
}
launchInstantAnimations(board, newSuccess, type);
} else {
shortestPathChange(board.nodes[board.target], shortestNodes[j - 1]);
board.objectShortestPathNodesToAnimate = [];
board.shortestPathNodesToAnimate = [];
}
function change(currentNode, previousNode) {
let currentHTMLNode = document.getElementById(currentNode.id);
let relevantClassNames = ["start", "shortest-path", "instantshortest-path", "instantshortest-path weight"];
if (previousNode) {
let previousHTMLNode = document.getElementById(previousNode.id);
if (!relevantClassNames.includes(previousHTMLNode.className)) {
if (object) {
previousHTMLNode.className = previousNode.weight === 15 ? "instantvisitedobject weight" : "instantvisitedobject";
} else {
previousHTMLNode.className = previousNode.weight === 15 ? "instantvisited weight" : "instantvisited";
}
}
}
}
function shortestPathChange(currentNode, previousNode) {
let currentHTMLNode = document.getElementById(currentNode.id);
if (type === "unweighted") {
currentHTMLNode.className = "shortest-path-unweighted";
} else {
if (currentNode.direction === "up") {
currentHTMLNode.className = "shortest-path-up";
} else if (currentNode.direction === "down") {
currentHTMLNode.className = "shortest-path-down";
} else if (currentNode.direction === "right") {
currentHTMLNode.className = "shortest-path-right";
} else if (currentNode.direction === "left") {
currentHTMLNode.className = "shortest-path-left";
}
}
if (previousNode) {
let previousHTMLNode = document.getElementById(previousNode.id);
previousHTMLNode.className = previousNode.weight === 15 ? "instantshortest-path weight" : "instantshortest-path";
} else {
let element = document.getElementById(board.start);
element.className = "startTransparent";
}
}
};
module.exports = launchInstantAnimations;
```
|
Aroga aristotelis is a moth of the family Gelechiidae. It is found in France, Spain, Italy, Ukraine, Romania, Bulgaria and Greece, as well as on Crete, Sicily and the Canary Islands. It has also been recorded from Turkey, Israel, the Ural Mountains, Iran and Turkmenistan.
The larvae feed on Astragalus echinus. They mine the leaves of their host plant. The larvae live in a silken tube covered with sand. This tube runs from the ground to the lower leaves of the host, where larval feeding causes fleck mines. Pupation takes place outside of the mine. The larvae reach a length of 17–18 mm. They a pale greyish green body with white lines and a black brown head. The larvae can be found from May to June.
References
Moths described in 1876
Aroga
Moths of Europe
Moths of Asia
|
Charles Vanbrugh (c. 1680 – 2 November 1740) was an officer of the Royal Navy and member of parliament for Plymouth.
Born in Chester, Charles Vanbrugh was baptised at Holy Trinity, Chester on 27 February 1679/1680. In June 1721 he married Ann Burt of Knightsbridge. They had three or more children but only one recorded surviving son, Edward Vanbrugh (1722 – 1802).
On 21 February 1708 he was appointed captain of HMS Feversham. Vanbrugh was aged 28. In 1709 he was replaced by Captain Robert Paston under whose command the Feversham was shipwrecked on 7 October 1711 with the loss of 102 lives. Feversham was on a voyage from the Gulf of St. Lawrence to New York City after participating in Admiral Hovenden Walker's disastrous expedition to Quebec.
Charles was the elder of the two youngest brothers to the dramatist and architect John Vanbrugh. Their mother had a daughter by a previous marriage then 19 children (10 more daughters) by Giles Vanbrugh. The youngest brother, Philip, was also in the Royal Navy.
John Vanbrugh built Charles a house beside his "castle" in Greenwich and it was known as the Mince-Pie House (demolished 1902). John's house in Whitehall had been known as The Goose-Pie House. Philip's Greenwich house nearby was known as The Nunnery (demolished 1911).
Parliament
Vanbrugh stood at a by-election for the Plymouth seat in 1739 representing the Admiralty interest. There was a dispute as to which Plymouth persons were eligible to vote for members of parliament. Unsuccessful in the election he petitioned the House of Commons regarding the eligibility of the seat's voters and eventually replaced the elected candidate by Order of the House 17 January 1739 – 1740.
However Vanbrugh died in November the same year and was buried in the Vanbrugh family vault a week later 9 November 1740. Ann his wife died less than 1 months after and, aged 40, was buried there 25 September 1749.
References
External links
design for Mince-Pie House
photograph of The Nunnery
1680 births
1740 deaths
Members of the Parliament of Great Britain for Plymouth
British MPs 1734–1741
People from Chester
|
The 1991 Chatham Cup was the 64th annual nationwide knockout football competition in New Zealand.
Up to the last 16 of the competition, the cup was run in three regions (northern, central, and southern), with an open draw from the quarter-finals on. National League teams received a bye until the third round (last 64). In all, a record 174 teams took part in the competition.
Tawa reached the final 16 by unusual means. They were defeated by New Plymouth Old Boys in the third round, but New Plymouth Old Boys were disqualified after the draw for the final 32 was made, which would have seen them playing against Rongotai College. Tawa were reinstated as winners of the third round match, but Rongotai refused to play against them, claiming that they should have been awarded the match against NPOB by default. Tawa were thus deemed to have won the fourth round game by a walkover.
The 1991 final
The league/cup double was completed for the fifth time, with Christchurch United becoming the second club to achieve the feat twice, having previously won the double in 1975. This was the last occasion that the double was won with the old New Zealand National Soccer League, as this was disbanded at the end of the 1992 season.
Results
Third Round
* Won on penalties by Ngongotaha (6-5), Stop Out (4-1), and Waterside (5-3)
† New Plymouth OB disqualified for rule infringement
Fourth Round
* Won on penalties by Stop Out (8-7)
Fifth Round
Sixth Round
* Won on penalties by Wellington United (5-4)
Semi-finals
Final
References
Rec.Sport.Soccer Statistics Foundation New Zealand 1991 page
UltimateNZSoccer website 1991 Chatham Cup page
Chatham Cup
Chatham Cup
Chatham Cup
|
Sechrest is a surname. Notable people with the surname include:
Donald Sechrest (1933–2006), American golfer and golf course architect
Jason Sechrest (born 1979), American writer and actor
Larry J. Sechrest (1946–2008), American economist
Lee Sechrest (1929–2015), American psychologist
|
The Dissolution of Colleges Act 1545 (37 Hen. 8. c. 4) was an Act of the Parliament of England.
Sections 13 and 16 were repealed by section 1(1) of, and Schedule 1 to, the Statute Law Revision Act 1950.
The whole Act, so far as unrepealed, was repealed by section 1 of, and Part II of the Schedule to, the Statute Law (Repeals) Act 1969.
References
Halsbury's Statutes,
See also
Chantry § Abolition of Chantries Acts, 1545 and 1547
Acts of the Parliament of England (1485–1603)
1545 in law
1545 in England
|
San Roque de Cumbaza (also known as San Roque) is a town in the San Martín Region of Peru, approximately a 45-minute drive northwest of the city of Tarapoto. Located in the Amazon rainforest, San Roque is home to a small community of people who mainly work in agriculture. Near the headwaters of the Cumbaza river, San Roque borders the Cordillera Escalera regional conservation area, a small mountain range in the low-jungle. The flora and fauna surrounding the town attract Tarapotinos each weekend to swim and relax alongside the river.
History
In 1875, a family from Lamas, Peru named the town of San Roque after the Catholic Saint, Saint Roch. While the town has officially existed since the mid-eighteenth century, traces of earlier human presence are evident by the discovery of stone axes. Early inhabitants were drawn to the area due to the abundance of fish and local wildlife that find natural refuge in the mountains of the Cordillera Escalera. First peoples included the Tananta and the Amasifuen. During the 20th century, several Mestizo families emigrated from the city of Lamas and began to farm in the area. Many of these families continue to live in San Roque and have been fundamental in establishing the present-day town.
The actual site of the town was originally built along the banks of the river, known as the Pampa. However, in 1910 a devastating flood swept through San Roque and claimed many lives, convincing the remaining San Roquíños to relocate the town higher up the mountain. The Pampa site now serves as a recreational area (see Tourism below).
In 1965, San Roque de Cumbaza District became a municipal district, with the town of San Roque as its capital. The jurisdictional boundaries of the district also include the towns of Auacaloma, Chiricyacu, Aviación, and Chunchiwi. The most recent census (2007) noted 1508 people living inside the district.
Geography
Altitude
San Roque is located 830m above sea level.
Climate
San Roque experiences an average temperature of 22 °C; daytime highs may reach 30 °C, but evenings are typically cooler when temperatures range between 15 and 20 °C.
Annual precipitation for the area is 841 mm; the main rainy season occurs from January to mid-March, but rain showers should be expected throughout the year.
Flora
Orchids
The San Martín Region in general is known for its orchids. For example, the capital of the region, Moyobamba, is also known as the city of orchids. In San Roque you can find varieties of orchids such as Scuticaria salesiana, Oncidium heterantha, and Sobralia setigera, among others.
Medicinal plants
Traditional medicines are used by some San Roquiños to treat a variety of ailments, ranging from the common cold to diabetes. Some of these local medicinal plants include achicoris, ojé (Ficus insipida), ortiga, hierba mora, and pamporégano.
Fauna
Due to the small human population and the nearby conservation area, San Roque and its surrounding area are home to a wide variety of tropical butterflies, birds, reptiles and mammals. These include but are not limited to:
Butterflies
Heliconius, parides, caligo, morpho, and heraclides.
Birds
Myiozetetes similis, Thraupis episcopus, Nyctibius spp., Ortalis guttata, Elanoides forficatus, Colaptes punctigula, Aburria aburri, Crypturellus soui, Crotophaga ani, Ortalis guttata, and Cacicus cela.
Reptiles
Esmeralda boa, coral snake, rainbow boa, and iguana iguana.
Mammals
Chironectes minimus, Didelphis marsupialis, Dasypus novemcinctus, Alouatta seniculus, Nasua nasua, and Potos flavus.
Culture
Religion
Catholicism was the dominant religion in the town of San Roque between the mid-nineteenth century until 1930, when the arrival of the Adventist and Evangelical church diversified local religion. It is also home to Huamanwasi Ashram, a center of traditional medicine which also teaches yoga.
Festivals and events
San Roque celebrates Patron Saint's Day every July 27 to the 31st. The community hosts cultural activities and sporting events, but does not include many religious observances.
Since 2010, a private company has held an annual marathon in early November, which begins and finishes in San Roque. The event attracts runners from around Peru, and San Roquiños offer a farmer's market, organize la Festival de la PANI, and sell food and drinks.
Food and drink
Most San Roquiños are agriculturists; meals in San Roque are often very filling, and mainly consist of protein and carbohydrates. Typical dishes in San Roque include juane, inchicapi, timbuchi de shitari, plantanapi, cutacho, tacacho, and uchucuta.
Classic selva (jungle) drinks include chicha de maiz, masato, chuchuhuasi, indanachado, uvachado, and vino de uva, a locally grown wine also known as borgoño.
Several families offer lunch and dinner at their in-home restaurants, while local bodegas sell fruit, vegetables, and other staples such as rice and bread.
Art
San Roque de Cumbaza is home to the Sachaqa Centro de Arte, an art center which hosts both Peruvian artists and artists from abroad through their residency program.
Economy
Agriculture
San Roque's economy depends predominately on agriculture. Campensiños (farmers) produce mainly coco, coffee, yucca, plantains, peanuts, rice and corn in their chacras (fields). Other crops include a variety of tropical fruits, vegetables, and wild herbs.
Tourism
Over the past several years, San Roque has been involved in two regional tourism projects, and has a burgeoning cultural tourism and ecotourism sector.
Local guides, small restaurants, and municipal and private operators offer tourism and hospitality services in San Roque.
The Pampa
The original town site, the Pampa, is now San Roque's main recreational area, receiving the majority of tourists’ attention. Stretching for a kilometer along the Rio de Cumbaza, the Pampa includes a soccer field, la PANI, a playground, and the municipal garden, bungalows, and hostel. Throughout this area, the community has situated benches and tiny palm huts among the trees for visitors to rest beside the river. Finally, the farthest end of the Pampa offers la Mazona, a jumping platform 7 meters above a natural pool in the river 8 meters deep. Beyond this point is la Isla de Amor, an island in the river steeped in local legend, and the tiny waterfall Mishquiyacu (pronounced Mish-ki-yeah-ku) meaning “rich waters.”
Above and beyond San Roque
Located further up the mountain slopes, the community has built two miradores, wooden lookout towers that offer a vista of the Cordillera Escalera, the town of Chiricyacu, and even the lights of Tarapoto and Lamas. The larger of the two lookouts has a second story, allowing guided groups to camp overnight along the filo (ridge). Swallow-tailed kites and black vultures are often seen riding the air swells around the miradores.
The trails that lead to the miradores continue to Añaquihui (pronounced an-a-ki-wui), a clear mountain stream, as well as Toroyacu, a 100-meter waterfall deep in the jungle. Guides offer trekking to both sites and are mandatory; Añaquihui is located in the reserve and cared for by the NAPO organization, while Toroyacu is a sacred place cared for by the people of Chiricyacu. The former is a half-day trip hike round trip, while the latter is an overnight excursion. Also of note are two large, natural stone “roads” known as Atunrumi de Yuractio and Atunrumi Mayor, which act as waterways en route to Toroyacu.
Lastly, guides offer hikes from San Roque to the surrounding native communities, where local hosts offer food, stories, and cultural workshops such as ceramic making.
Infrastructure
Education
There is one school in San Roque, Educational Institute N• 0303, which provides primary education. The school's youth environmental brigade offers guided tours of la PANI.
Healthcare
The local clinic (La Posta Sanitaria) offers basic first aid. People with serious healthcare concerns are recommended to go to Tarapoto.
Transportation
San Roque is accessible from Tarapoto via a well-travelled but unpaved road.
Public transportation is available through colectivos (share taxis), which cost about 6 Peruvian soles each way. The colectivos depart Tarapoto from the district of Morales roughly every two hours from 6 a.m. until 5 p.m.
Returning to Tarapoto, colectivos leave the upper plaza beginning at 4:30 a.m. and continue to depart every two hours until 4:30 p.m.
The road forms a loop, with Tarapoto and San Roque at opposite points. The western half of the loop passes through Auacaloma, while the eastern half runs through San Pedro, with access to San Antonio. Both routes are used by the colectivas.
An armed community watch guards the entrance of the road and will usually request a donation upon entry; it is not mandatory, but 1 Peruvian sol is a recommended contribution.
References
Populated places in the San Martín Region
|
Lee & Man Paper Manufacturing Limited () is a Hong Kong-listed Chinese private papermaking company engaged in the manufacturing of packaging paper, such as linerboard and containerboard, and wood pulp. It has paper production plants in Guangdong, Jiangsu and Jiangxi provinces, as well as in the city of Chongqing and in Vietnam. The company employs about 4,000 people. It was established in 1994 and listed on the Hong Kong Stock Exchange in 2003.
External links
Lee & Man Paper Manufacturing Limited
Companies listed on the Hong Kong Stock Exchange
Manufacturing companies of Hong Kong
Companies based in Dongguan
Manufacturing companies established in 1994
Pulp and paper companies of China
Privately held companies of China
Papermaking in China
|
Beed railway station is an upcoming railway station in Beed district, Maharashtra. Its code is BEED. It will serve Beed city. The station consists of one platform. The work on this rail line is expected to be finished year 2023.
First train from Ahmednagar to Narayandoho ran on 19 March 2017.
Second train run 26 Feb 2019 Ahmednagar to Solapurwadi 37 km
Third run fro. Solapurwadi to Ashti on 29 Dec 2021,
References
Railway stations in Beed district
Solapur railway division
Proposed railway stations in India
Proposed infrastructure in Maharashtra
|
```xml
import { orderBy } from 'lodash';
import { searchUtils } from '@verdaccio/core';
export function removeDuplicates(results: searchUtils.SearchPackageItem[]) {
const pkgNames: any[] = [];
const orderByResults = orderBy(results, ['verdaccioPrivate', 'asc']);
return orderByResults.filter((pkg) => {
if (pkgNames.includes(pkg?.package?.name)) {
return false;
}
pkgNames.push(pkg?.package?.name);
return true;
});
}
```
|
```javascript
ace.define("ace/theme/vibrant_ink",["require","exports","module","ace/lib/dom"], function(require, exports, module) {
exports.isDark = true;
exports.cssClass = "ace-vibrant-ink";
exports.cssText = ".ace-vibrant-ink .ace_gutter {\
background: #1a1a1a;\
color: #BEBEBE\
}\
.ace-vibrant-ink .ace_print-margin {\
width: 1px;\
background: #1a1a1a\
}\
.ace-vibrant-ink {\
background-color: #0F0F0F;\
color: #FFFFFF\
}\
.ace-vibrant-ink .ace_cursor {\
color: #FFFFFF\
}\
.ace-vibrant-ink .ace_marker-layer .ace_selection {\
background: #6699CC\
}\
.ace-vibrant-ink.ace_multiselect .ace_selection.ace_start {\
box-shadow: 0 0 3px 0px #0F0F0F;\
}\
.ace-vibrant-ink .ace_marker-layer .ace_step {\
background: rgb(102, 82, 0)\
}\
.ace-vibrant-ink .ace_marker-layer .ace_bracket {\
margin: -1px 0 0 -1px;\
border: 1px solid #404040\
}\
.ace-vibrant-ink .ace_marker-layer .ace_active-line {\
background: #333333\
}\
.ace-vibrant-ink .ace_gutter-active-line {\
background-color: #333333\
}\
.ace-vibrant-ink .ace_marker-layer .ace_selected-word {\
border: 1px solid #6699CC\
}\
.ace-vibrant-ink .ace_invisible {\
color: #404040\
}\
.ace-vibrant-ink .ace_keyword,\
.ace-vibrant-ink .ace_meta {\
color: #FF6600\
}\
.ace-vibrant-ink .ace_constant,\
.ace-vibrant-ink .ace_constant.ace_character,\
.ace-vibrant-ink .ace_constant.ace_character.ace_escape,\
.ace-vibrant-ink .ace_constant.ace_other {\
color: #339999\
}\
.ace-vibrant-ink .ace_constant.ace_numeric {\
color: #99CC99\
}\
.ace-vibrant-ink .ace_invalid,\
.ace-vibrant-ink .ace_invalid.ace_deprecated {\
color: #CCFF33;\
background-color: #000000\
}\
.ace-vibrant-ink .ace_fold {\
background-color: #FFCC00;\
border-color: #FFFFFF\
}\
.ace-vibrant-ink .ace_entity.ace_name.ace_function,\
.ace-vibrant-ink .ace_support.ace_function,\
.ace-vibrant-ink .ace_variable {\
color: #FFCC00\
}\
.ace-vibrant-ink .ace_variable.ace_parameter {\
font-style: italic\
}\
.ace-vibrant-ink .ace_string {\
color: #66FF00\
}\
.ace-vibrant-ink .ace_string.ace_regexp {\
color: #44B4CC\
}\
.ace-vibrant-ink .ace_comment {\
color: #9933CC\
}\
.ace-vibrant-ink .ace_entity.ace_other.ace_attribute-name {\
font-style: italic;\
color: #99CC99\
}\
.ace-vibrant-ink .ace_indent-guide {\
background: url(data:image/png;base64,your_sha256_hashYNDTc/oPAALPAZ7hxlbYAAAAAElFTkSuQmCC) right repeat-y\
}";
var dom = require("../lib/dom");
dom.importCssString(exports.cssText, exports.cssClass);
});
```
|
Mammilla simiae is a species of predatory sea snail, a marine gastropod mollusk in the family Naticidae, the moon snails.
Description
Distribution
This species occurs in the Indian Ocean off Madagascar, Aldabra and the Mascarene Basin.
References
Dautzenberg, Ph. (1929). Contribution à l'étude de la faune de Madagascar: Mollusca marina testacea. Faune des colonies françaises, III(fasc. 4). Société d'Editions géographiques, maritimes et coloniales: Paris. 321-636, plates IV-VII pp
Taylor, J.D. (1973). Provisional list of the mollusca of Aldabra Atoll.
Kilburn, R.N. & Rippey, E. (1982) Sea Shells of Southern Africa. Macmillan South Africa, Johannesburg, xi + 249 pp.
Drivas, J. & M. Jay (1988). Coquillages de La Réunion et de l'île Maurice
Kabat A.R., Finet Y. & Way K. (1997) Catalogue of the Naticidae (Mollusca: Gastropoda) described by C.A. Récluz, including the location of the type specimens. Apex 12(1): 15-26.
Steyn, D.G. & Lussi, M. (1998) Marine Shells of South Africa. An Illustrated Collector’s Guide to Beached Shells. Ekogilde Publishers, Hartebeespoort, South Africa, ii + 264 pp. page(s): 50
Kabat A.R. (2000) Results of the Rumphius Biohistorical Expedition to Ambon (1990). Part 10. Mollusca, Gastropoda, Naticidae. Zoologische Mededelingen 73(25): 345-380.
Hollman M. (2008) Naticidae. In Poppe G.T. (ed.) Philippine marine mollusks, vol. 1: 482-501, pls 186-195. Hackenheim: Conchbooks.
Torigoe K. & Inaba A. (2011) Revision on the classification of Recent Naticidae. Bulletin of the Nishinomiya Shell Museum 7: 133 + 15 pp., 4 pls.
External links
Naticidae
Gastropods described in 1838
|
TVP3 Opole is one of the regional branches of the TVP, Poland's public television broadcaster. It serves the entire Opole Voivodeship.
External links
Telewizja Polska
Television channels and stations established in 2005
Mass media in Opole
|
Waldeck is an unincorporated community in northern Fayette County, Texas, United States. Originally known as Long Prairie, the town is predominantly German and was named after Count Ludwig Joseph von Boos-Waldeck who purchased lands in the area in 1843 on behalf of the Adelsverein.
External links
WALDECK, TX Handbook of Texas Online.
Unincorporated communities in Fayette County, Texas
Unincorporated communities in Texas
1843 establishments in the Republic of Texas
|
Maureen Flanagan (born 1941), best known by her stage name, Flanagan, was an early tabloid model.
She was encouraged to take up a career in modelling by photographer Don McCullin, who took her first modelling shots. She had an acting career in the late 1960s and early 1970s, mainly in bit parts on The Benny Hill Show, Monty Python's Flying Circus, and several British sex comedies. She also played the lead role in the Danish film The Loves of Cynthia (a.k.a. Cynthia’s Sister) in 1971.
After her acting career ended, Flanagan remained in the public eye, owing to her association with the Kray Twins and her efforts to secure their release. Her involvement with the Kray family went back to her time as hairdresser for the twins' mother Violet. She also wrote the book Intimate Secrets of an Escort Girl (Everest books, 1974). The book was serialized in the magazine Tit-Bits, accompanied by a blurb which said “Britain’s most photographed model lays bare the facts of her working life in the sauciest story of the year.” Her memoir, One of the Family, was published in 2015.
In 1997, Flanagan made a one-off return to nude modeling as a mature woman, posing fully nude in the magazine Men's World. In the accompanying interview she said her second husband had recently died after a heart transplant operation, and that she was busy raising a 16-year-old son.
Acting roles
Monty Python's Flying Circus (TV, 1969, 1970)
Groupie Girl (1970)
The Love Pill (1971)
The Loves of Cynthia (1971)
The Love Box (1972)
Dracula AD 1972 (1972)
The Benny Hill Show (TV, 1972)
Zodiac (TV, 1974)
On the Game (1974)
Magazine covers
King (1972) Issue 2
Rex (1971) Vol.1 Issue. 29 “Sex and the Single Actress”
Titbits (October 1974) Issue. 4625 "Flanagan's Secrets of an Escort Girl"
References
1941 births
Living people
Page 3 girls
|
Feodor Vassilyev (, older spelling: ; 1782) was a peasant from Shuya, Russia. His first wife is said to have lived to be 76, and between 1725 and 1765, have had 69 children (16 pairs of twins, 7 sets of triplets, and 4 sets of quadruplets); 67 of them survived infancy with the loss of one set of twins: the record for most children born to a single woman. However, their names, dates of birth, and dates of death are all unknown.
Vassilyev said he also had 18 children with his second wife (6 pairs of twins and 2 sets of triplets), making him allegedly a father of 87 children in total.
The data about Vassilyev's children are included in the Guinness Book of World Records.
Sources
The first published account about Feodor Vassilyev's children appeared in a 1783 issue of The Gentleman's Magazine (Vol. 53 p. 753, London, 1783) and states that the information "however astonishing, may be depended upon, as it came directly from an English merchant in St Petersburg to his relatives in England, who added that the peasant was to be introduced to the Empress". The same numbers were given in 1788 commentary on Russian history and in an 1834 book by , Saint Petersburg Panorama.
Skepticism
Several published sources raised doubts as to the veracity of these statements. According to a 1933 article by Julia Bell in Biometrika, a 1790 book of B. F. J. Hermann Statistische Schilderung von Rußland did provide the statements about Feodor Vassilyev's children but "with a caution". Bell also notes that the case was reported by The Lancet in an 1878 article about the study of twins. The Lancet article states that the French Academy of Sciences attempted to verify the statements about Vassilyev's children and contacted "M. Khanikoff of the Imperial Academy of St. Petersburg for advice as to the means they should pursue, but were told by him that all investigation was superfluous, that members of the family still lived in Moscow and that they had been the object of favors from the Government". Bell concludes that Vassilyev's case "must be regarded as under suspicion".
Similarly, in her book Quadruplets and Higher Multiple Births (1989), Marie Clay of the University of Auckland notes: "Sadly, this evasion of proper investigation seems, in retrospect, to have dealt a terminal blow to our chances of ever establishing the true detail of this extraordinary case".
See also
List of multiple births
List of people with the most children
References
1707 births
1782 deaths
History of human sexuality
People from Shuya
Multiple births
18th-century people from the Russian Empire
|
Carbonnelle is a surname. Notable people with the surname include:
André Carbonnelle (1923–2015), Belgian field hockey player
Eddy Carbonnelle (1926–2004), Belgian field hockey player
Ignatius Carbonnelle (1829–1889), Belgian Jesuit and mathematician
See also
Carbonell (surname)
|
```java
package ai.verta.modeldb.common.exceptions;
import ai.verta.modeldb.common.CommonUtils;
import io.grpc.StatusRuntimeException;
import jakarta.servlet.*;
import jakarta.servlet.http.HttpServletResponse;
import java.io.IOException;
import org.springframework.stereotype.Component;
@Component
public class ExceptionFilter implements Filter {
@Override
public void doFilter(
ServletRequest servletRequest, ServletResponse servletResponse, FilterChain filterChain)
throws IOException, ServletException {
try {
filterChain.doFilter(servletRequest, servletResponse);
} catch (RuntimeException ex) {
StatusRuntimeException status = CommonUtils.logError(ex);
final var httpCode = ModelDBException.httpStatusFromCode(status.getStatus().getCode());
((HttpServletResponse) servletResponse).sendError(httpCode.value(), status.getMessage());
}
}
}
```
|
The Parsis (aka Parsees) cricket team was an Indian first-class cricket team which took part in the annual Bombay tournament. The team was founded by members of the Zoroastrian community in Bombay. It is affiliated to Mumbai Cricket Association.
Many players of Parsis cricket team played for Mumbai cricket team, India national cricket team.
Bombay Quadrangular
The Parsis competed in the Bombay tournament from its outset in 1877, when they challenged the Europeans cricket team at the Bombay Gymkhana to a two-day match. At this time, the competition was known as the Presidency Match. It was recognised as a first-class tournament from 1892–93 until its final staging in 1945–46. The Parsis won the first-class tournament outright 10 times, and shared victory 11 times.
Tours of England
The Parsis made two tours of England in the 1880s, though none of the matches have been recognised as first-class. See: Parsis cricket team in England in 1886 and Parsis cricket team in England in 1888.
Notable players
Following is the list of notable players who played or playing for Parsi cricket team/Parsi Gymkhana :
Polly Umrigar
Farokh Engineer
Suryakumar Yadav
References
Sources
Vasant Raiji, India's Hambledon Men, Tyeby Press, 1986
Mihir Bose, A History of Indian Cricket, Andre-Deutsch, 1990
Ramachandra Guha, A Corner of a Foreign Field – An Indian History of a British Sport, Picador, 2001
1877 establishments in India
Cricket clubs established in 1877
Former senior cricket clubs of India
Indian first-class cricket teams
Parsi culture
|
Swimmin' Pools, Movie Stars... is an album by the American musician Dwight Yoakam, released in 2016. Yoakam considered it his first bluegrass album. Aside from the cover of "Purple Rain", the album is a collection of bluegrass versions of older Yoakam songs.
The album peaked at No. 62 on the Billboard 200.
Production
The album was produced by Yoakam, Gary Paczosa, and Jon Randall. Yoakam and his band recorded their cover of "Purple Rain" on the day that Prince died—Yoakam saw the news on television as he was leaving for the studio.
Critical reception
The Sydney Morning Herald called Swimmin' Pools, Movie Stars... a "slightly urbanised, perfectly played bluegrass album." The Morning Star thought that the rendition of "Guitars, Cadillacs" "doesn’t have the impact of the original or the twang, but it has the sway of the fiddles that play off Yoakam’s reverb-laden voice sweetly."
The Knoxville News Sentinel praised the "A-list players," but concluded that "in the end, Swimmin' Pools, Movie Stars ... feels more like a lovable novelty than a lasting statement." The Seattle Times determined that "what is clear is the care Yoakam and his cohorts took in translating some fairly deep cuts into satisfying bluegrass tunes."
AllMusic wrote that "while the notion of Yoakam doing a bluegrass cover of 'Purple Rain' might sound like a high concept hipster joke, he wrings loneliness and loss from that tune with a delivery that's moving without becoming histrionic." The Santa Fe New Mexican also praised the cover, writing: "Without a trace of irony he finds the soul of the song and makes it into the perfect hillbilly tribute to the ascended master from Minneapolis."
Track listing
References
Sugar Hill Records albums
Albums produced by Jon Randall
Dwight Yoakam albums
2016 albums
|
Stewart Davidson (1 June 1889 – 26 December 1960) was a Scottish professional football who played as a right half for Aberdeen and Middlesbrough.
Early and personal life
Davidson was born in Aberdeen on 1 April 1889. He worked as a legal clerk.
Career
After playing for Aberdeen, Davidson was signed by Middlesbrough manager Tom Mcintosh on 17 April 1913 for a fee of £675. He played 76 league games across two seasons prior to the outbreak of World War One. During the war, Davidson played as a wartime guest player for Manchester City, and although wounded during the war, was able to continue his football career after the end of the war in 1918. He became Middlesbrough club captain in 1920, and earned his first and only cap for Scotland against England in 1921.
In summer 1923, Davidson was deemed surplus to requirements at Middlesbrough and returned to his former club Aberdeen. He was later player-manager of Forres Mechanics and coached for the Kent F.A., before became assistant manager to ex-teammate Billy Birrell at Chelsea from 1939 to 1957.
Career statistics
Club
International
References
1889 births
1960 deaths
Footballers from Aberdeen
Scottish men's footballers
Scottish football managers
Men's association football wingers
Aberdeen F.C. players
Middlesbrough F.C. players
Forres Mechanics F.C. players
Manchester City F.C. wartime guest players
Highland Football League players
Chelsea F.C. non-playing staff
Scottish Football League players
Scotland men's international footballers
English Football League players
Men's association football wing halves
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package io.qameta.allure;
import io.qameta.allure.core.Configuration;
import io.qameta.allure.core.LaunchResults;
import java.io.IOException;
import java.nio.file.Path;
import java.util.List;
/**
* Composite aggregator extension. Can be used to process the list of aggregator.
*
* @since 2.0
* @deprecated for removal. Use {@link CompositeAggregator2} instead.
*/
@Deprecated
public class CompositeAggregator implements Aggregator {
private final List<Aggregator> aggregators;
public CompositeAggregator(final List<Aggregator> aggregators) {
this.aggregators = aggregators;
}
@Override
public void aggregate(final Configuration configuration,
final List<LaunchResults> launchesResults,
final Path outputDirectory) throws IOException {
for (Aggregator aggregator : aggregators) {
aggregator.aggregate(configuration, launchesResults, outputDirectory);
}
}
}
```
|
(Back and forth) is an operatic 'sketch' (Op. 45a) in one scene by Paul Hindemith, with a German libretto by Marcellus Schiffer. It acts as a parody of conventional opera tropes featuring a coloratura ariette, a jealousy duet, and a terzet for the tenor, baritone and bass.
Hindemith wrote the piece for a collection of miniature operas presented on 17 July 1927 at the Baden-Baden Music Festival in the Theater Baden-Baden. The work lasts for just 12 minutes. Other short works by Darius Milhaud (), Kurt Weill (Mahagonny-Songspiel) and Ernst Toch () were performed the same evening. The performance was re-enacted in October 2013 by the Gotham Chamber Opera in New York City. On 9 August 1940 the piece would be performed at the Tanglewood summer music academy with Hindemith himself playing one of the piano parts. He then directed three stage performances of the work at the Hartt School of Music in Hartford, Connecticut on 12, 13 and 14 May 1942.
Instrumentation
Flute
Clarinet
Alto Saxophone
Bassoon
Trumpet
Trombone
1 Four Handed Piano
1 Two Handed Piano
Harmonium (Behind the Stage)
Roles
Synopsis
In a kind of dramatic palindrome, a tragedy unfolds involving jealousy, murder and suicide, which is then replayed with the lines sung in reverse order to produce a happy ending.
Robert (tenor), returns home unexpectedly, and finds that his wife Helene (soprano) has received a letter from an unnamed lover. He flies into a jealous rage and shoots her. After her dead body is carried off by the Professor (baritone) and the Ambulance Man (bass), Robert throws himself out of his window. A wise man enters the stage, and deplores the tragedy. He then causes time to run backwards, causing the music and the text to also run backwards, ending the opera happily before Helene was killed.
Musical style and structure
The opera is notable for its structure, which has the music of the opera run backwards halfway through the opera. The piece uses the idea of retrograde overall throughout the piece but does not use it in individual phrases of text or music. For example the first line of text in the opera "Guten Morgen, liebe Tante," does not get reversed as "Tante Liebe, Morgen Guten," but remains the same. Rather it is the order of phrases that is reversed so that "Guten Morgen, liebe Tante" is both the first and last lines of the opera. This also keeps the internal syntax of sentences. With regards to musical phrases, musicologist Alexandra Monchick notes that:"A literal palindrome of the music would have ramifications for the quasi-tonal. A few years later Alban Berg produced an exact palindrome for the movie sequence in his opera Lulu (1929-1934). Since Lulu was a twelve tone opera, not dependent on tonal hierarchies, Berg was able to replicate an exact palindrome at the pitch class level, without a breakdown of logical musical language. However this was not possible for Hindemith in this instance. As in most of his works, Hindemith's musical language in Hin and Zurück is tonally centered without being diatonic. The piece is based around A, the key in which the overture begins... The musical numbers also form a palindrome. Hindemith divides the opera into baroque-like short numbers: Prelude, Ariette, Duett, Terzett and their recapitulations after the Sages Monologue."The tonal scheme of the opera is:
During the first Terzett, the harmony gradually moves by minor thirds from the key of E to the distant key of A-flat for the sages monologue. During the recapitulations, the music returns to E for the second Terzett, but instead of returning to the key of A for the second Prelude, the music instead goes to the key of G sharp, which is the leading tone to A. "Instead of forming a satisfying dramatic circle back to the tonic, the resolution is more of a dramatic spiral. This perhaps signifies that people's actions can never be completely undone...Also, the ending in the G-sharp key area is an enharmonic equivalent of A-flat, the key of the Sage's Monologue, evoking once again the cause of this reversed ending."
Recordings
References
External links
https://www.youtube.com/watch?v=iOb1r5hlTgg (Television Performance)
Operas by Paul Hindemith
German-language operas
Operas
1927 operas
Zeitoper
One-act operas
|
```yaml
apiVersion: release-notes/v2
kind: feature
area: telemetry
issue:
- 24284
releaseNotes:
- |
**Added** experimental support for Telemetry API.
```
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.shardingsphere.test.it.sql.parser.internal.asserts.statement.dal.impl;
import lombok.AccessLevel;
import lombok.NoArgsConstructor;
import org.apache.shardingsphere.sql.parser.statement.core.statement.dal.ShowDatabasesStatement;
import org.apache.shardingsphere.test.it.sql.parser.internal.asserts.SQLCaseAssertContext;
import org.apache.shardingsphere.test.it.sql.parser.internal.asserts.segment.show.ShowFilterAssert;
import org.apache.shardingsphere.test.it.sql.parser.internal.cases.parser.jaxb.statement.dal.ShowDatabasesStatementTestCase;
/**
* Show databases statement assert.
*/
@NoArgsConstructor(access = AccessLevel.PRIVATE)
public final class ShowDatabasesStatementAssert {
/**
* Assert show databases statement is correct with expected parser result.
*
* @param assertContext assert context
* @param actual actual show databases statement
* @param expected expected show databases statement test case
*/
public static void assertIs(final SQLCaseAssertContext assertContext, final ShowDatabasesStatement actual, final ShowDatabasesStatementTestCase expected) {
if (actual.getFilter().isPresent()) {
ShowFilterAssert.assertIs(assertContext, actual.getFilter().get(), expected.getFilter());
}
}
}
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.