text stringlengths 1 22.8M |
|---|
{{DISPLAYTITLE:CH4N2}}
The molecular formula CH4N2 (molar mass: 44.06 g/mol, exact mass: 44.0375 u) may refer to:
Ammonium cyanide
Diaziridine |
Grand Theft Auto 2 is an action-adventure game, developed by DMA Design and published by Rockstar Games in October 1999, for Microsoft Windows and the PlayStation, and the Dreamcast and Game Boy Color in 2000. It is the sequel to 1997's Grand Theft Auto, and the second main instalment of the Grand Theft Auto series. Set within a retrofuturistic metropolis known as "Anywhere City", the game focuses on players taking the role of a criminal as they roam an open world, conducting jobs for various crime syndicates and having free rein to do whatever they wish to achieve their goal. The game's intro is unique for a title in the series, as it involved live-action scenes filmed by Rockstar Games.
Grand Theft Auto 2 received mixed reviews for most platforms, and negative reviews for the Game Boy Color, but was a moderate commercial success. While the soundtrack and some gameplay elements, such as the gang loyalty system, were praised, the graphics, controls, and setting received a more mixed game response. The game was also criticized for failing to innovate the formula established by its predecessor, despite several improvements it brought. Grand Theft Auto 2 was followed by 2001's Grand Theft Auto III, which started a new era for the series, while the game itself was re-released on Steam in January 2008.
Gameplay
Like its predecessor Grand Theft Auto, the game focuses on players completing a series of levels, each requiring a set target score being achieved in order to progress to the next stage. Points are awarded from various criminal actions such as destroying cars, selling vehicles, and completing missions for various crime syndicates, with the latter awarding more points than doing simple criminal actions. Creating chaos from their crimes will cause the player to be wanted by the police who will hound the player to arrest or kill them, with higher wanted levels increasing the level of response used. Being arrested or dying loses the player any equipment they found, and impacts their multiplier bonus.
Grand Theft Auto 2s setting is unique for the series: a retrofuturistic metropolis referred to as "Anywhere, USA", which is divided into three districts (Downtown, Residential, and Industrial) that players will switch between as they progress through the game. The time period the game is set in is not specified—conflicting sources suggest anything from "three weeks into the future", to the year being 2013, despite in-game references to the "new millenium" that is coming (implying the game takes place around its time of release, in 1999).
The game introduced several features and improvements to the series. Players can save their game during a playthrough of a level by visiting the church they start at, but must pay a set number of points to do so. Jobs on offer come from three different syndicates—each level features two unique syndicates, alongside a third syndicate present in all levels. By doing jobs for a syndicate and successfully completing them, the player gains respect with that syndicate, allowing them to take on tougher jobs with enough respect, but lose it with their chief rivals, locking them out of their jobs and making the syndicate's members hostile to the player. Other improvements include vehicles and pedestrians being more interactive with the game's environment—such as gang members engaging in fights with police—the presence of other criminals (such as muggers), a health meter, garages that can modify vehicles with special improvements, a selection of side missions ranging from running a taxi to driving a semi-truck, and groups of 'hidden' packages to find across the level.
GTA 2 – The Movie
The game was developed with an eight-minute short film of live-action footage, filmed within New York City. The short film was devised as an introductory sequence for the game, and was made available on Rockstar Games's website. The film follows a criminal named Claude Speed (played by Scott Maslen), who conducts jobs around Anywhere City for several criminal syndicates, until his actions eventually catch up and he is killed by an assassin from one of the gangs he robbed. The film was based on a screenplay by Dan Houser, and directed by Alex De Rakoff.
Soundtrack
Each area features five radio stations from a pool of eleven, one of which is heard as the player drives most vehicles in-game. Changing radio stations for preference is possible. "Head Radio" was present in the original Grand Theft Auto, Grand Theft Auto III and Grand Theft Auto: Liberty City Stories. Each gang has its own radio station that transmits within a limited area. Police vehicles, ambulances, fire trucks and tanks had no ability to listen to the radio channels. Instead, the player would hear the radio transmitter of the emergency services.
All the music and the ads included in the game are exclusive, following the tradition of previous games. People in charge of the musical content were Craig Conner, Stuart Ross, Paul Scargill, Colin Anderson, Bert Reid and Moving Shadow. Some of these producers would keep their work on subsequent GTA releases.
The Game Boy Color version uses some real songs, one of which is a sped up version of "Back in Black" by AC/DC. The Character Selection theme is an old Brazilian song titled "Chega de Saudade".
Reception
Grand Theft Auto 2s computer version received a "Silver" sales award from the Entertainment and Leisure Software Publishers Association (ELSPA), indicating sales of at least 100,000 copies in the United Kingdom. The game's PlayStation version received a "Platinum" sales award (300,000 or more units in the United Kingdom) from ELSPA.
Grand Theft Auto 2 was released to mixed reviews. The game's graphics received mixed reactions from critics, who noted that they had barely any difference to the graphics in the original game. IGN's Tal Blevins called them "average at best", and that the scenery is "hard to appreciate". Jeff Gerstmann of GameSpot said that the "graphics look a bit plain." The game's soundtrack received positive feedback, with Jeff Gerstmann calling it a "great soundtrack", and that it "closely [mirrors] the station-style of the original game". Tal Blevins of IGN called it "one of the best features" of the game.
Grand Theft Auto 2s gameplay elements received mixed reactions. IGN's Jeremy Dunham said that the gameplay is "where the game really takes a punch to the stomach", and that it "could've been a lot better." Tal Blevins called it "simple, but effective." Jeff Gerstmann said that "even though the gameplay is largely the same as in the previous GTA, it's still a lot of fun." Edge highlighted the game's story development and inventive missions, stating that Grand Theft Auto 2 "manages to draw you deep into the complexities of its world".
Blake Fischer reviewed the Dreamcast version of the game for Next Generation, rating it two stars out of five, and stated that it is "A great idea that, for one reason or another, never really gets into a must-play game."
Notes
References
Bibliography
External links
1999 video games
Action-adventure games
Dreamcast games
Freeware games
Game Boy Color games
2
Open-world video games
Organized crime video games
PlayStation (console) games
Rockstar Games games
Top-down video games
Video games developed in the United Kingdom
Video game sequels
Windows games
Video games set in 2013
Video games set in the United States
Multiplayer and single-player video games
Retrofuturistic video games
Video games written by Dan Houser
Works about the Yakuza |
```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
}
``` |
Price Waterhouse v Kwan [2000] 3 NZLR 39 is a cited case in New Zealand regarding liability for negligent misstatements.
Background
Price Waterhouse were the auditors of a law firm. It was later claimed that Price Waterhouse were negligent in their audits resulting in them losing their investments.
Held
As the purpose of the audits was for the protection of clients money, there was sufficient proximity to hold that PW owed them a duty of care, and were accordingly ordered to pay damages.
References
Court of Appeal of New Zealand cases
New Zealand tort case law
2003 in New Zealand law
2003 in case law
PricewaterhouseCoopers |
NGC 4145 is a barred spiral galaxy located in the Ursa Major galaxy cluster, 68 million light years from the Earth. The galaxy has little star formation, except on its outer edges. Due to the loss of energy that occurs without star formation, some astronomers predict that the galaxy will degenerate into a lenticular galaxy in the near future. However, the galaxy's interaction with NGC 4151 may "maintain [its] star formation".
References
External links
4145
Barred spiral galaxies
Ursa Major Cluster
Canes Venatici
038693 |
Tachynectes is an extinct genus of prehistoric ray-finned fish that lived from the Turonian to the Campanian.
See also
Prehistoric fish
List of prehistoric bony fish
References
Late Cretaceous fish
Elopiformes
Prehistoric ray-finned fish genera |
As of 2015, there is only one translation of the Tirukkural available in Swedish.
History of translations
The translation by Yngve Frykholm in 1971 is the only translation of the Tirukkural into Swedish. It was published under the title "Tirukkural sydindisk levnadsvisdom, statskunskap och kärlekskonst sammanfattad i 1330 epigram av tamilskalden Tiruvalluvar". It is a complete translation in prose.
Translations
See also
Tirukkural translations
List of Tirukkural translations by language
References
External links
Swedish
Translations into Swedish |
Defending champion Iga Świątek defeated Aryna Sabalenka in a rematch of the previous year's final, 6–3, 6–4 to win the singles tennis title at the 2023 Stuttgart Open. The final marked the first time the top two players in the world contested a WTA Tour final since the 2018 Australian Open, and the first such match overall since 2019 WTA Finals. This was also the first time since 2005 that the two defending Stuttgart finalists returned to contest the following year's final.
Seeds
The top four seeds received a bye into the second round.
Draw
Finals
Top half
Bottom half
Qualifying
Seeds
Qualifiers
Lucky loser
Qualifying draw
First qualifier
Second qualifier
Third qualifier
Fourth qualifier
References
External links
Main draw
Qualifying draw
2023 WTA Tour |
In baseball, a home run is scored when the ball is hit so far that the batter is able to circle all the bases ending at home plate, scoring himself plus any runners already on base, with no errors by the defensive team on the play. An automatic home run is achieved by hitting the ball on the fly over the outfield fence in fair territory. More rarely, an inside-the-park home run occurs when the hitter reaches home plate while the baseball remains in play on the field. In Major League Baseball (MLB), a player in each league wins the home run title each season by hitting the most home runs that year. Only home runs hit in a particular league count towards that league's seasonal lead. Mark McGwire, for example, hit 58 home runs in 1997, more than any other player that year. However, McGwire was traded from the American League's (AL) Oakland Athletics to the National League's (NL) St. Louis Cardinals midway through the season and his individual AL and NL home run totals (34 and 24, respectively) did not qualify to lead either league.
The first home run champion in the National League was George Hall. In the league's inaugural 1876 season, Hall hit five home runs for the short-lived National League Philadelphia Athletics. In 1901, the American League was established and Hall of Fame second baseman Nap Lajoie led it with 14 home runs for the American League Philadelphia Athletics. Over the course of his 22-season career, Babe Ruth led the American League in home runs twelve times. Mike Schmidt and Ralph Kiner have the second and third most home run titles respectively, Schmidt with eight and Kiner with seven, all won in the National League. Kiner's seven consecutive titles from 1946 to 1952 are also the most consecutive home run titles by any player.
Ruth set the Major League Baseball single-season home run record four times, first at 29 (1919), then 54 (1920), 59 (1921), and finally 60 (1927). Ruth's 1920 and 1921 seasons are tied for the widest margin of victory for a home run champion as he topped the next highest total by 35 home runs in each season. The single season mark of 60 stood for 34 years until Roger Maris hit 61 home runs in 1961 for which MLB assigned an asterisk until reversing themselves in 1991 citing Maris had accomplished his record in a longer season. Maris' mark was broken 37 years later by both Mark McGwire and Sammy Sosa during the 1998 home run record chase, with McGwire ultimately setting a new record of 70. Barry Bonds, who also has the most career home runs, then broke that mark, setting the current single season record of 73 in 2001. . The 1998 and 2001 seasons each had four players hit 50 or more home runs – Greg Vaughn, Ken Griffey Jr., Sosa, and McGwire in 1998 and Alex Rodriguez, Luis Gonzalez, Sosa, and Bonds in 2001. A player has hit 50 or more home runs 42 times, 25 times since 1990. The lowest home run total to lead a major league was four, recorded in the NL by Lip Pike in 1877 and Paul Hines in 1878.
On October 4, 2022 Aaron Judge hit his 62nd homerun of the year off Jesús Tinoco of the Texas Rangers passing Roger Maris for the AL home run record 61 years after Maris set it and making him only the sixth person to hit at least 60.
In 2023, Shohei Ohtani became the first Japanese-born player ever to win a major league home run title, leading the AL with 44 home runs.
Key
American League
National League
Other major leagues
See also
Babe Ruth Home Run Award (discontinued) – awarded to the MLB home-run leader
Josh Gibson Legacy Award – awarded to the AL and NL home-run leaders
Mel Ott Award – awarded to the NL home-run leader
61* - film depicting Maris' record setting 61 home runs in 1961
Footnotes
Recognized "major leagues" include the current American and National Leagues and several defunct leagues – the American Association, the Federal League, the Players' League, and the Union Association.
References
General
Specific
Home run champions
Major League Baseball records
Home run |
```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
``` |
Alter Ego is a role-playing video game developed and published by Activision in 1986. It was created by Peter J. Favaro for the Commodore 64, DOS, Apple II, and the Apple Macintosh. The game allows the user to make decisions for an imaginary person (being therefore the player's alter ego) and shows what possible consequences these decisions could have on that person. Alter Ego was released in both male and female versions, each using a different set of experiences.
Gameplay
The player's alter ego begins the game as an infant; the game presents the user with a tree diagram with nodes, each labeled with an icon. The player chooses an icon representing an "experience" or situation to explore. Each icon bears a symbol showing what kind of experience it represents (for example, a heart denotes an emotional event). After making a choice in each node, the user is moved back to the tree with that node marked as completed. In this manner, the user progresses through the alter ego's entire life and examines what impact their decisions had. In the process of playing the game, the player's alter ego proceeds through seven phases with their respective experiences: infancy, childhood, adolescence, young adulthood, adulthood, middle adulthood, and old age. Some of these experiences are disturbing, and can even lead to premature death (such as being raped and killed by a child molester), though most tend to be humorous.
Alter Ego keeps track of certain player statistics throughout the game, which in turn affect the alter ego's ability to succeed at certain choices. For example, in the high school segment, the player might be given the choice of trying out for the school baseball team, or deciding instead to crack down and study harder to improve in math. This decision might change the alter ego's "Physical", "Confidence", and "Intellectual" statistics, which in future experiences might influence the alter ego's ability to get into college or succeed in social situations.
Reception
Johnny Wilson of Computer Gaming World described the game as "a delightful, humorous and thought-provoking exercise in decision-making, value exploration and evaluation, and vicarious wish-fulfillment." He raised minor qualms concerning the disconnect between past experiences and current situations, and the mild tendency of the game to be "preachy". The magazine's Charles Ardai described it as "fascinating the first time out" but repetitive later. Info gave the Commodore 64 version five stars out of five, describing it as "some of the most broadly therapeutic and consciousness-raising software available", and "very entertaining". The reviewer concluded "I would recommend this wholesome software to anyone old enough to read".
The game was also positively reviewed by Zzap!64 magazine.
Reviews
Isaac Asimov's Science Fiction Magazine v10 n10 (1986 10)
References
External links
Images of Alter Ego package, manual and screen for Commodore 64 version
Play the game online
https://www.retrogames.cz/play_727-DOS.php
1986 video games
Activision games
Apple II games
Commodore 64 games
DOS games
Art games
Social simulation video games
Classic Mac OS games
Video games developed in the United States |
Fan Weijun (, born 20 November 1978), is a former Chinese-born Hong Kong professional footballer. He was capable of playing at all outfield positions.
On 3 July 2014, Fan was charged with conspiracy to defraud in relation to a Senior Shield match the prior season. Later, on 24 September, he was acquitted by the Eastern Court.
Career statistics
Club
As of 14 May 2008
References
External links
1978 births
Living people
Chinese men's footballers
Hong Kong men's footballers
Footballers from Shanghai
Beijing Chengfeng F.C. players
Sichuan First City F.C. players
Chinese Super League players
China League One players
Expatriate men's footballers in Hong Kong
Chinese expatriate sportspeople in Hong Kong
Hong Kong First Division League players
South China AA players
Hong Kong Rangers FC players
Happy Valley AA players
Men's association football utility players
Hong Kong League XI representative players |
The 1942 municipal election was held November 12, 1942 to elect a mayor and five aldermen to sit on Edmonton City Council, three trustees to sit on the public school board and five trustees to sit on the separate school board. Voters also approved an eight-hour day for firefighters. The election would normally have been held on November 11 (the rule at the time being that the municipal election would be held on the second Wednesday of November), but was delayed by a day owing to the Armistice Day holiday.
There were ten aldermen on city council, but five of the positions were already filled: Harry Ainlay (SS), James McCrie Douglas (SS), Gwendolen Clarke, Charles Gariepy, Guy Patterson were all elected to two-year terms in 1941 and were still in office.
There were seven trustees on the public school board, but four of the positions were already filled: Melvin Downey (SS), Roy Sutherland, Albert Ottewell (SS), and James Hyndman had been elected to two-year terms in 1941 and were still in office. On the separate board, two of the seven seats were occupied: Thomas Malone and William Wilde (SS) had been elected in 1941 and were still in office. Robert Tighe and Romeo Bouchard had also been elected in 1941, but Tighe had died and Bouchard had resigned. Accordingly, Joseph Gallant and J O Pilon were elected to one-year terms.
Voter turnout
There were 8,208 ballots cast out of 57,889 eligible voters, for a voter turnout of 14.2%.
Results
bold or indicates elected
italics indicate incumbent
"SS", where data is available, indicates representative for Edmonton's South Side, with a minimum South Side representation instituted after the city of Strathcona, south of the North Saskatchewan River, amalgamated into Edmonton on February 1, 1912.
Mayor
John Wesley Fry was acclaimed to a sixth term as mayor.
Aldermen
Public school trustees
Separate (Catholic) school trustees
Firefighter Work Hours Plebiscite
Do you approve of Bylaw No. 1019, establishing an eight-hour day for the members of the Edmonton Fire Department, to commence within one year next following the cessation of hostilities in the present war?
Yes - 5,818
No - 2,262
References
Election History, City of Edmonton: Elections and Census Office
1942
1942 elections in Canada
1942 in Alberta |
Group E of the EuroBasket 2013 took place between 11 and 15 September 2013. The group played all of its games at Arena Stožice in Ljubljana, Slovenia.
The group composed of the best three teams from Group A and B. The four best ranked teams advanced to the knockout stage.
Standings
|}
All times are local (UTC+2)
11 September
Latvia vs. Ukraine
Belgium vs. Serbia
Lithuania vs. France
13 September
Lithuania vs. Belgium
Ukraine vs. Serbia
France vs. Latvia
15 September
Latvia vs. Belgium
Ukraine vs. Lithuania
Serbia vs. France
External links
Standings and fixtures
Group E
2013–14 in French basketball
2013–14 in Ukrainian basketball
2013–14 in Serbian basketball
2013–14 in Latvian basketball
2013–14 in Belgian basketball |
Madron (Mangfallgebirge) is a mountain of Bavaria, Germany.
Mountains of Bavaria
Mountains of the Alps |
Jarreau (pronounced Jah Row) is an unincorporated community in the 7th Ward of Pointe Coupee Parish, Louisiana, United States. Jarreau is located approximately 30 miles northwest of Baton Rouge, and is a part of the Baton Rouge metropolitan area. The community is located on the banks of False River. It is situated on the southern end of this ox-bow lake, in an area known as "The Island". The community is served by Louisiana Highway 413, known locally as Island Road. The Jarreau Post Office (ZIP code 70749) is located on Boulevard D' Isle. Several local businesses (including Parrot's Bar and Horseshoe Auto Parts) were featured in scenes in the Billy Bob Thornton film "The Badge" (2002). The area is also known for fishing and boating with the main publicly accessible boat launch on the southern end of False River (Jerry's Landing) being located here.
History
The community is named for Elie Jarreau, the community's first postmaster. The area's first post office was opened in July, 1912. Elie Jarreau served as postmaster for the next 40 years.
References
External links
Jarreau Boundary Map
Baton Rouge metropolitan area
Unincorporated communities in Pointe Coupee Parish, Louisiana
Unincorporated communities in Louisiana
bg:Летсуърт |
A Horse Fly Fleas is a 1947 Warner Bros. Looney Tunes cartoon short. It was written by Warren Foster and directed by Robert McKimson. The short was released on December 13, 1947.
The short stars A. Flea, the nearly-microscopic protagonist of An Itch in Time from 1943. It is rarely aired in television due to stereotypical portrayals of Native Americans.
Originally released in Cinecolor, the cartoon was reissued in three-strip Technicolor during the 1955–56 season.
Plot
A Flea tries to find a good home. He is accompanied by a horse fly. They settle on a dog, not knowing that he house an Indian flea.
Home media
This cartoon was released on DVD and Blu-ray with the original titles and Cinecolor version restored on the Looney Tunes Platinum Collection: Volume 2.
References
External links
1947 animated films
1947 short films
1947 films
1940s Warner Bros. animated short films
Looney Tunes shorts
Films directed by Robert McKimson
Animated films about insects
Films scored by Carl Stalling
Film controversies
Native American-related controversies in film
Race-related controversies in animation
Race-related controversies in film
Cinecolor films
Films produced by Edward Selzer |
"Moonlight" is a song by Colombian-American singer Kali Uchis. It was released on February 23, 2023 as the second and final single from her third studio album, Red Moon in Venus.
Background
On November 20, 2022, Uchis first teased "Moonlight" through her TikTok account.
Music video
The official music video was officially released on April 20, 2023, a date associated with cannabis-oriented celebrations, which could be a parallelism to the song's lyrics. It was directed by Colin Tilley and Sarah McColgan.
Legacy
In August 2023, the song received viral media attention after being featured in various edited clips depicting an anime boy turning into a girl from the music video for "Colors" by Hiroyuki Sawano and Motohiro Hata.
Charts
Certifications
Release history
References
2023 singles
2023 songs
Geffen Records singles
Kali Uchis songs
Songs written by Benny Blanco
Songs written by Cashmere Cat
Songs written by Kali Uchis
Song recordings produced by Benny Blanco
Song recordings produced by Cashmere Cat
Song recordings produced by Leon Michels |
```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);
``` |
Sidi Ali Bounab is a mountain in Algeria, about 800 m in height, shared between the wilayas of Tizi Ouzou and Boumerdes. It overlooks the plain of Tadmaït. Its forests are composed mainly of cork oak.
In 1949 it was the scene of a "punitive expedition" by French gendarmes against the villages of the mountain.
Notes
Mountains of Algeria |
Mawlamyine (also spelled Mawlamyaing; , ; ; , ), formerly Moulmein, is the fourth-largest city in Myanmar (Burma), south east of Yangon and south of Thaton, at the mouth of Thanlwin (Salween) River. Mawlamyine was an ancient city and the first capital of British Burma. The city is currently the capital and largest city of Mon State and the main trading centre and seaport in south eastern Myanmar.
Etymology and legend
The Mon name which was previously used for Mawlamyine, Moulmein (; ) means "damaged eye" or "one-eyed man." According to legend, a Mon king had a powerful third eye in the centre of his forehead, able to see what was happening in neighbouring kingdoms. The daughter of one of the neighbouring kings was given in marriage to the three-eyed king and managed to destroy the third eye. The Burmese name "Mawlamyine" is believed to be a corruption of the Mon name.
Moulmein was also spelled as Maulmain or Moulmain or Maulmein in some records of the 19th century. The people of Moulmein were referred as Moulmeinian.
History
Early history
Early Mon reigns
According to Kalyani Inscriptions erected by King Dhammazedi of Hanthawaddy Pegu in 1479, Mawlamyine was mentioned among the ‘32 myo’ or thirty-two Mon cities within the Martaban division. Binnya U, a deputy of Viceroy Saw Binnya, was one of the notable governors of Mawlamyine in the early history of the city.
Toungoo dynasty
In May 1541, King Tabinshwehti and his deputy Bayinnaung captured Mawlamyine. During the reign of Bayinnaung, Toungoo Empire became the largest empire in the history of Southeast Asia. After his passing in 1581, his son Nanda Bayin and successors faced with rebellion by Lan Na, Siam, Lan Xang and renewed Portuguese incursions. In 1594, the governor of Mawlamyine who being in league with Siamese King Naresuan revolted against Toungoo court. Since then, the city became under the control of Siam (present-day Thailand) until 1614.
Konbaung dynasty
In 1760, General Minkhaung Nawrahta of the Royal Burmese Army repaired Mawlamyine on his way back from Burmese–Siamese War in Ayutthaya (former capital of Thailand). Kyaikthanlan Pagoda Inscription hinted that in 1764 (1125 ME), General Maha Nawrahta repaired Kyaikthanlan Pagoda on his way to capture Tavoy, and before finishing the repairment, Mawlamyine faced utter destruction.
Colonial Moulmein (1824–1948)
Mawlamyine was the first capital of British Burma between 1826 and 1852 after the Tanintharyi (Tenassarim) coast, along with Arakan, was ceded to Britain under the Treaty of Yandabo at the end of the First Anglo-Burmese War. After the first Anglo-Burmese war, the British made it their capital between 1826 and 1852, building government offices, churches and a massive prison. They started business enterprises and the country's first newspaper, The Maulmain Chronicle. Between 1826 and 1862, colonial Mawlamyine was the center of British Burma and the first port city that became a strategically important area and a geographical nodal point for the newly occupied British territory in Southeast Asia. Ever since the first British occupation in 1824, the growth and prosperity of Mawlamyine had steadily increased due to timber trade. Nevertheless, the decline in prosperity of Mawlamyine began when the supply of marketable timber from Salween Valley started to decrease in the 1890s.
During British colonial times, Germany, Siam, Persia, Denmark, Norway and Sweden opened and maintained consulates in Mawlamyine led by either consuls or vice-consuls while Italy and the United States placed consular agencies in Mawlamyine. German explorer Johann Wilhelm Helfer's landing at Moulmein shore on 8 February 1837 made him as the first German to arrive Burma in the history.
Mawlamyine was the setting of George Orwell's famous 1936 memoir Shooting an Elephant. The essay opens with the striking words:
"In Moulmein, in Lower Burma, I was hated by large numbers of people—the only time in my life that I have been important enough for this to happen to me."
During colonial times, Moulmein had a substantial Anglo-Burmese population. An area of the city was known as "Little England" due to the large Anglo-Burmese community, many of them running rubber plantations. This has since dwindled to a handful of families as most have left for the UK or Australia.
It was probably best known to English speakers through the opening lines of Rudyard Kipling's poem Mandalay:
"By the old Moulmein pagoda, lookin' lazy at the sea
There's a Burma girl a-settin', and I know she thinks o' me".
During WWII, the city and the Tanintharyi Region were the first objectives during the Japanese invasion of Burma.
"The old Moulmein pagoda" - Kyaik Than Lan
The "old Moulmein pagoda" Kipling cites is thought to be the Kyaik Than Lan (also spelled Kyaikthanlan) pagoda in Mawlamyine. It stands on a ridge, giving a panoramic view of the city, and is surrounded by 34 smaller temples. Among its sacred treasures is a hair relic of Buddha, received from a hermit in Thaton, as well as a tooth relic conveyed from Sri Lanka by a delegation of monks in ancient times.
Contemporary Mawlamyine
Soon after Burma's independence in 1948, the city fell into the hands of Karen insurgents. The Myanmar military retook the city with the help of UBS Mayu in 1950. Later, many colonial names of streets and parks of the city were changed to more nationalistic Burmese names. Mawlamyine stood as the third-largest city of Myanmar until the recent rise of Naypyidaw.
Geography
Mawlamyine is in the Salween River delta, where the mouth of the Salween is sheltered by Bilugyun Island as it enters the Gulf of Martaban and the Andaman Sea. It is flanked by low hills dotted with ancient pagodas to the east and west.
Climate
Mawlamyine has a tropical monsoon climate (Köppen: Am) similar to the climates of Dawei and Sittwe. There is a lengthy dry season between mid-November and mid-April, and an extremely wet season due to the southwest monsoon between mid-April and mid-November. Between June and August when the surface westerly winds are strongest and supersaturated air is advected onto the nearby mountains, Mawlamyine averages around of rain per month.
Transport
Airport
Mawlamyine Airport has regular flights to Yangon (Rangoon).
Bus and taxis
Mawlamyine is the main gateway to south eastern Myanmar. Thanlwin Bridge, the longest road and rail bridge in Myanmar is the most prominent landmark in the area. It stretches over the Thanlwin River connecting the country's south eastern region with Yangon. The city has a central highway bus station. The city is connected to Pa-an in Kayin State in the north-east and Dawei and Myeik in Tanintharyi Division in the south by road. Via Kawkareik, the city is also connected with Thai-Myanmar border town Myawaddy. Newly opened Bogyoke Aung San Bridge (Bilu Kyun) connects Mawlamyine with nearby Bilu island, lies about 500 metres west off the shore of Mawlamyine.
In Mawlamyine, motorcycles and tuk-tuk (Thone Bee in Burmese) motorized tricycles cumulatively registered for use as taxis. Mawlamyine is also served by bus networks which radiate mostly from the north to the south.
Railways
It was the rail head to Ye, linked to Yangon by rail only from Mottama (Martaban) across the river by ferry, but today connected by the Thanlwin Bridge (Mawlamyine) opened in April 2006.
Mawlamyine Railway Station, which was reportedly built to the standards of an "ASEAN railway station", is the terminus of Myanmar Railways' Bago-Mawlamyine-Dawei line from Yangon.
Water transport
In colonial era, Mawlamyine (then Moulmein) port was served by European shipping companies including Scottish-owned British-India Steam Navigation Company and Irrawaddy Flotilla Company.
The port was important not only for inland navigation but also for international shipping. Rice and teak from sawmills at Mawlamyine were exported worldwide by those shipping companies. The 1880 handbook of British-India Steam Navigation Company listed:
Calcutta - Rangoon - Moulmein (started in 1857)
Moulmein - Penang - Malacca - Singapore (started in 1862)
Moulmein - Penang - Colombo - Bombay lines in operations.
In 1894, the journey between Barr Street Jetty of Rangoon to the Main Wharf of Moulmein took about nine hours at a fare of 10 Rupees for second class.
Nowadays, although much diminished from its past prominence, water-based transport still plays an important role in connecting between Mawlamyine and the immediate upstream towns. The Port of Mawlamyine is currently under the management of Myanma Port Authority and is located on the Thanlwin River about 28 nautical miles inland from the Kyaikkhame point on the Gulf of Martaban, 2 kilometers from Mawlamyine railway station.
Cityscape
Around the city
Heritage buildings
Kyaikthanlan Pagoda: It was built in 875 AD during the reign of Mon King Mutpi Raja, it was raised from its original height of to the present by successive kings including Wareru, founder of the Kingdom of Hanthawaddy Pegu. In 1831, to prevent Moulmein's identity from fading away, Sitke Maung Htaw Lay, who later served as Magistrate of Moulmein restored the pagoda with the funds raised by public subscriptions. Being situated on the range of hill, the pagoda overlooks the city, nearby islands, Gulf of Martaban, surrounding rivers and the limestone mountains of Kayin State in the east. Rudyard Kipling is believed to have written his famous "Lookin' lazy at the sea" line at this pagoda in 1890.
U-zina Pagoda: The pagoda is one of the principal pagodas situated on the range of hill. According to legend, the pagoda contains a hair of Buddha and was built during the reign of King Ashoka, the great protector of Buddhism. The U-zina pagoda was named after the sage, U-zina who restored it in 1838. Prior to this the pagoda had been known as Kyaik Pa-dhan pagoda.
Princess Ashin Hteik Suhpaya's tomb: Princess Ashin Hteik Suhpaya (also known as Princess Myat Phaya Galay) who was the fourth daughter of King Thibaw, the last king of Konbaung dynasty returned to Burma from exile in 1915 and lived at her mansion on West Cantonment Road, Mawlamyine until her death in 1936. Her tomb is located near Kyaikthanlan Pagoda. The remains of her son, Prince Taw Phaya Nge and her daughter, Princess Hteik Su Phaya Htwe were also buried in the tomb in the later years.
First Baptist Church: The church is Myanmar's first Baptist church and it was initially built in 1827 by the legendary Adoniram Judson, a 19th-century American missionary who compiled the first Burmese-English dictionary. The church is regarded as a landmark for its significance to the Baptist movement worldwide.
St Matthew's Church: It was the first English Church (Anglican Church) built in Myanmar. It was initially erected in 1832 and the current handsome structure was rebuilt in 1887. It was designed and restored by the English architects James Piers St Aubyn and Henry J. Wadling of London and the foundation stone was laid by Sir Charles Crosthwaite, then Chief Commissioner of Burma. It is of red brick, the capitals of interior pillars being stone, and is said to be a model of English Church at Dresden. George Orwell attended the church during his days as Imperial Policeman in Moulmein in 1926 and the church compound has grave stones of his relatives. During the Japanese conquest of Burma in WWII, the Japanese Army stored salt in the church. Though the church is still in use, it is in a state of decay and is in urgent need of conservation.
St Patrick's Church: The St Patrick's Roman Catholic church was built in 1829; the French people constructed the clock tower of the church around 1854. St Patrick's school in the church compound was once a boarding school for the children of the elite in colonial times. The tragic love story of Thailand's Prince Sukkasem, the heir to the Lanna throne, and a Mon commoner girl started during his time at this school in the 1890s and was immortalised in Thai folk song and Thai literature.
Police Commissioner Headquarters: Built in 1826 on a hill in Than Lwin Park. The impressive colonial building was the place where George Orwell worked as Assistant District Superintendent in 1926.
Old Moulmein Prison: The Mawlamyine's colonial-era prison was initially built in the 1830s. Sir Richard Hieram Sankey, an Irish military engineer who is credited with designing much of the infrastructure of the Indian city of Bangalore, used to work at this prison as Superintendent of the jail in 1860. George Orwell was believed to have witnessed hanging there and it is the setting of his short story "A Hanging (1931)". During WWII, following the Fall of Singapore in 1942, Allied soldiers transferred from Changi Prison were held in the Moulmein Prison by the Imperial Japanese Army before they were sent to the notorious death railway construction. In 2015, the prison was closed and relocated to a new facility near Yedwingone village in Kyaikmawyaw township.
Yadanabonmyint Monastery: It is also known as Queen Seindon Monastery. It is known for its craftsmanship.
Islands
Bilu Island (Belu-kyun): The local meaning of the island's name is Ogre Island. The island is famous for handicraft and Mon traditional culture.
Gaungsay Kyun Island (Shampoo Island): A tiny island lies between Mottama and the north bank of Mawlamyine is called Gaungsay Kyun island, literally: "Head Washing Island". In ancient times, the clear pristine water obtained from a small rocky outcrop of the island was carried to the palace and used by Burmese kings at royal hair-washing ceremonies during Thingyan. In colonial days, the island was known in its European name "Crow Island" for being the home of all the crows in the city.
Others
Mon State Cultural Museum (Mon Ethnic Cultural Museum)
Mottama (formerly Martaban): A small town located opposite to the north bank of Mawlamyine was the first capital of the Hanthawaddy Kingdom in the 13th and 14th centuries after the collapse of Pagan (Bagan) Empire in 1287. During Burmese–Siamese wars between the 16th and 18th centuries, Martaban was an important rallying spot for Burmese troops moving from Upper Burma to sack Ayutthaya Kingdom. Between 2nd-century BCE and 15th-century CE, Martaban was a main trading port in the historic Maritime Silk Road that connects Korea, China, Southeast Asia, the Indian subcontinent, Ceylon, Arabian peninsula, Horn of Africa and all the way to Egypt and eventually Rome or Europe. The Martaban jars were imported and got its namesake from this Martaban port city as early as the fourteenth century.
Pa-Auk Forest Monastery : The main monastery complex and meditation centre is located in a forest near Pa-Auk village along the Taung Nyo Mountain range 15 kilometers southeast of Mawlamyine. The monastery is known for the practice of meditation. 500–1000 meditators from over 20 countries reside in the monastery.
Win Sein reclining Buddha: 29 km south of Mawlamyine is the world's largest reclining Buddha at Mudon. It is approached by a roadway with 500 life size statues of Arahant disciples of Buddha and a hall whose chamber walls display scenes of Buddha's lifetime, and the underworld.
Thanbyuzayat War Cemetery: 64 kilometers south of Mawlamyine is prisoners-of-war cemetery and the notorious death railway connected with the Bridge over the River Kwai. The cemetery contains the graves of 3,770 British, Australian, Dutch and other soldiers. It was formally opened on 10 December 1946 by General Aung San and then Governor Sir Hubert Rance.
Economy
Mawlamyine is famous for its tropical fruits and for its cuisine as indicated in the popular Burmese expression, "Mandalay for the speaking, Yangon for the bragging, and Mawlamyine for the eating." (မန္တလေးစကား ရန်ကုန်အကြွား မော်လမြိုင်အစား) Among its tropical fruits, Mawlamyine pomelo, durian and rambutan are traded countrywide.
Mawlamyine had several sawmills and rice mills as teak and rice were transported down the Salween. It was once a busy shipbuilding center and remains an important port. At least one major British shipping line had some of their ships built here. The teak "country-built" ships generally had a longer service life than those constructed from European hardwoods. The city had a solar-powered plant for extracting salt from seawater and a diesel electric plant. On the night of 1 December 2008, a fire that started from a floating restaurant destroyed the larger of city's two markets called the lower bazaar.
Industry
The city has two industrial zones. Of two, the newly opened Kyauktan industrial zone features a variety of different business enterprises, including zinc, barbed wire, ready-mix cement, food and drink production, textiles, gold purification, ice factories, shoe production facilities, furniture enterprise, plastic enterprises, cool seafood storage and car accessory businesses.
As a cross-border investment, the state-of-the-art combined-cycle gas power plant in Mawlamyine was constructed by Singapore's United Overseas Bank (UOB) backed Singapore company Asiatech Energy. The Mawlamyine power plant brings a sustainable supply of power to residents and businesses in Mon State.
In July 2017, to make the country's oil and gas industry more efficient, the Myanmar Investment Commission (MIC) granted an approval to a subsidiary of Singapore-based firm to construct an offshore supply base in the 46 acres of river front land of Mawlamyine. It would provide a wide range of services to the operators of oil and gas fields in the waters off the coast in the Bay of Bengal.
Transport hub
Mawlamyine is the western terminus and an important part of the East-West Economic Corridor. The 1450-kilometre east–west economic corridor links the South China Sea at Da Nang to Mawlamyine through Laos and Thailand. By using the East-West Economic Corridor, the travel time between Bangkok and Yangon is just three days, compared with the two to three weeks needed for conventional marine transportation via the Straits of Malacca. Japan's Nippon Express started land transportation services between Thailand and Myanmar in 2016.
Flora and fauna
Culture
Mawlamyine provides a multicultural dimension despite a Buddhist Mon majority. Buddhist cultural dominance is as old as Mawlamyine, but the British annexation and American missionaries in the early 19th century introduced Christianity. Many of the relics of the British Raj remain along with Hindu temples, Chinese temples, mosques and even a slice of Americana, reflecting Mawlamyine's great diversity.
The First Baptist Church in Mawlamyine was constructed in 1827 by the legendary Adoniram Judson, the first Caucasian Protestant missionary sent from North America to Myanmar. The building is a masterful blend of Western and local elements, with the materials and building technology speaking directly to Mon cultural traditions and crafts expertise. In 2015, the U.S. Embassy in Myanmar announced that it gave an award of $125,000 to World Monuments Fund (WMF) to restore the historic First Baptist Church in Mawlamyine through the Ambassadors Fund for Cultural Preservation.
The Mon State Cultural Museum exhibits the ancient cultural relics of Mon people and divans used by a Konbaung princess who resided in Mawlamyine.
Education
Mawlamyine has 13 public high schools, two institutes, a college and three universities.
The University of Mawlamyine, established in 1953, is the major university for the south eastern region and offers both bachelor's and master's degree programs in liberal arts and sciences. It is the third oldest Arts and Science university in the country after the University of Yangon (est. 1878) and the University of Mandalay (est. 1925). It is one of the few universities in Myanmar that offers a degree in Marine Science. Its Marine Science Laboratory in Setse, a coastal town about 83 km south of Mawlamyine, was the first of its kind in Myanmar. Technological University (Mawlamyine) offers technological and engineering courses. The Mawlamyine campus of Yezin Agricultural University, administered by Ministry of Agriculture, Livestock and Irrigation (MOALI), offers agriculture courses. Government Technical Institute (Mawlamyine) offers vocational engineering courses located in outskirts of the city. Mawlamyine Education College and Mawlamyine Institute of Education are also located in the city.
The St. Patrick's School (now B.E.H.S. No. 5) founded by the De La Salle Brothers in 1860, Morton Lane-Judson School, (formerly Morton Lane Girls' School, now B.E.H.S No.6) founded in 1867 and Shin Maha Buddhaghosa National School (now B.E.H.S. No.9) founded in 1899 are a few of the oldest public high schools in Myanmar.
The first international student of Bucknell University, Class of 1864, Maung Shaw Loo was the first Burmese physician of Western medicine and the first Burmese to study Western medicine in the United States.
Sports
The 10,000-seat Yamanya Stadium is one of the main venues for local and regional football tournaments. The stadium is also a home for Southern Myanmar F.C., a Myanmar National League (MNL) football club.
Health care
Public Hospitals
Mawlamyine Women and Children Hospital (former Ellen Mitchell Memorial Hospital)
Mawlamyine General Hospital
Mawlamyine Christian Leprosy Hospital
Mawlamyine University Hospital
Mawlamyine Traditional Medicine Hospital
International relations
Sister cities
Mawlamyine established a Friendship City agreement with Fort Wayne, Indiana, United States in 2016. A student exchange program between Mawlamyine University and IPFW of Fort Wayne began in 2017.
Others
A primary road in Novena, Singapore and a road (Solok Moulmein) in George Town, Malaysia were named after the city's old name, Moulmein.
Gallery
See also
University of Mawlamyine
Thanlwin Bridge (Mawlamyine)
Mon people
Attaran Bridge (Mawlamyine)
Sittoung Bridge (Bilin)
Kyaiktiyo Pagoda
Pa-Auk Sayadaw
References
External links
Photos of Moulmein
Mawlamyine
Weather forecast Weather Underground
Tide table Tides Chart
Township capitals of Myanmar
Populated places in Mon State
Old Cities of Mon people
Ports and harbours of Myanmar
Ports and harbours of the Indian Ocean |
Benjamin Mark Seymour (born 16 April 1999) is an English professional footballer who plays as a forward for National League South club Hampton & Richmond Borough.
Career
In April 2017, after progressing through Exeter City's academy, Seymour signed his first professional contract with the club. On 18 July 2017, Seymour signed for National League South club Weston-super-Mare on loan. Seymour made eight appearances for Weston-super-Mare, joining Southern League West club Bideford at the culmination of his loan with Weston-super-Mare. At Bideford, Seymour scored 21 league goals in 33 games during the 2017–18 season. Ahead of the 2018–19 season, Seymour returned to the National League South, signing for Gloucester City on loan. After one goal in twelve appearances for the club, Seymour joined Southern League club Dorchester Town on loan, scoring 14 goals in 26 games in the remainder of the season for the club. On 13 August 2019, Seymour made his professional debut for Exeter, starting in a 4–1 EFL Cup loss against Coventry City. He then made his league debut as a late substitute in a 2–2 draw against Leyton Orient. He scored his first goal for Exeter in an EFL Trophy tie against Swindon Town on 6 October 2020.
On 30 September 2021, Seymour along with Jordan Dyer joined National League club Yeovil Town on a one-month loan deal.
On 21 January 2022, Seymour joined National League South side Bath City on loan for the remainder of the 2021–22 season. Following Exeter's promotion at the end of the 2021–22 season, Seymour was released by the club.
Following his release from Exeter City, Seymour signed for Southern League Premier Division South side Plymouth Parkway.
On 24 May 2023, Seymour agreed to join National League South side, Hampton & Richmond Borough ahead of the 2023–24 campaign.
Career statistics
References
1999 births
Living people
Footballers from Watford
Men's association football forwards
English men's footballers
Exeter City F.C. players
Weston-super-Mare A.F.C. players
Bideford A.F.C. players
Gloucester City A.F.C. players
Dorchester Town F.C. players
Yeovil Town F.C. players
Bath City F.C. players
Plymouth Parkway F.C. players
Hampton & Richmond Borough F.C. players
English Football League players
National League (English football) players
Southern Football League players |
The Finnish women's national under-18 ice hockey team () is the national women's junior ice hockey team of Finland, which represents Finland at the International Ice Hockey Federation's Ice Hockey U18 Women's World Championship and other international U18 tournaments. The team is officially nicknamed the () and the nickname is regularly used in Finnish language media.
U18 Women's World Championship record
Team
Current roster
Roster for the 2023 IIHF U18 Women's World Championship.
Head coach: Mira KuismaAssistant coaches: Heikki Kemppainen, Juho Lehto, Aku Perala (goalkeeper)
World Championship player awards
Best Defenseman
2020: Nelli Laitinen
Best Forward
2019: Elisa Holopainen
Best Goaltender
2011: Isabella Portnoj
2022: Emilia Kyrkkö
All-Star Team
2013: Emma Nuutinen (F)
2019: Elisa Holopainen (F), Nelli Laitinen (D)
2020: Sanni Rantala (D)
2021: Emilia Kyrkkö (G), Sanni Vanhanen (F)
2023: Pauliina Salonen (F)
Top-3 Players on Team
2008: Piia Räty (G), Linda Välimäki (F), Maiju Yliniemi (F)
2009: Susanna Airaksinen (G), Tiina Saarimäki (D), Tea Villilä (D)
2010: Isa Rahunen (D), Salla Rantanen (F), Susanna Tapani (F)
2011: Isabella Portnoj (G), Susanna Tapani (F), Saana Valkama (F)
2012: Anna Kilponen (D), Johanna Koivisto (D), Anni Rantanen (D)
2013: Anna Kilponen (D), Emma Nuutinen (F), Eveliina Suonpää (G)
2014: Anni Keisala (G), Marjut Klemola (D), Emmi Rakkolainen (F)
2015: Sanni Hakala (F), Anni Keisala (G), Nelli Salomäki (F)
2016: Sini Karjalainen (D), Petra Nieminen (F), Tiia Pajarinen (G)
2017: Sini Karjalainen (D), Jenniina Nylund (F), Jenna Silvonen (G)
2018: Sanni Ahola (G), Elisa Holopainen (F), Nelli Laitinen (D)
2019: Elisa Holopainen (F), Nelli Laitinen (D), Sanni Rantala (D)
2020: Nelli Laitinen (D), Sanni Rantala (D), Kiira Yrjänen (F)
2022: Oona Havana (F), Emilia Kyrkkö (G), Sanni Vanhanen (F)
2023: Pauliina Salonen (F), Tuuli Tallinen (D), Sanni Vanhanen (F)
References
Notes
See also
Finland women's national ice hockey team
Naisten Liiga
Women's ice hockey in Finland
Under
Women's national under-18 ice hockey teams |
The Josh Billings RunAground is one of the oldest triathlons, second only to Eppie's Great Race in California. It has been held in Southern Berkshire County, Massachusetts since 1976. The race consists of a 27 mile bike ride, 5 mile canoe/kayak sprint, and a 6.0 mile run. The race is named after Josh Billings, whose saying "To finish is to win" has become the motto of the race.
External links
The Great Josh Billings RunAground
Triathlon competitions
Triathlon in the United States
Recurring sporting events established in 1976
Annual sporting events in the United States
Sports competitions in Massachusetts
Tourist attractions in Berkshire County, Massachusetts
1976 establishments in Massachusetts |
The Communauté d'agglomération de la Baie de Somme is a communauté d'agglomération in the Somme département and in the Hauts-de-France région of France. It was formed on 1 January 2017 by the merger of the former Communauté de communes de l’Abbevillois, the Communauté de communes de la Région d'Hallencourt and the Communauté de communes Baie de Somme Sud. Its area is 398.6 km2. Its population was 48,903 in 2018, of which 22,837 in Abbeville.
Composition
This Communauté d'agglomération comprises 43 communes:
Abbeville
Arrest
Bailleul
Bellancourt
Bettencourt-Rivière
Boismont
Bray-lès-Mareuil
Brutelles
Cambron
Caours
Cayeux-sur-Mer
Citerne
Condé-Folie
Doudelainville
Drucat
Eaucourt-sur-Somme
Épagne-Épagnette
Érondelle
Estrébœuf
Fontaine-sur-Somme
Franleu
Frucourt
Grand-Laviers
Hallencourt
Huppy
Lanchères
Liercourt
Limeux
Longpré-les-Corps-Saints
Mareuil-Caubert
Mérélessart
Mons-Boubert
Neufmoulin
Pendé
Saigneville
Saint-Blimont
Saint-Valery-sur-Somme
Sorel-en-Vimeu
Vauchelles-les-Quesnoy
Vaudricourt
Vaux-Marquenneville
Wiry-au-Mont
Yonval
References
Baie de Somme
Baie de Somme
Abbeville |
The Acton–Northolt line (ANL), historically known as the New North main line (NNML), is a railway line in West London, England. Built between 1903 and 1906, it runs from the Great Western Main Line at Old Oak Common TMD to the Chiltern Main Line at South Ruislip, alongside the West Ruislip branch of the London Underground Central line, for a distance of around .
History
It opened in 1903 as part of a joint project by the Great Central Railway (GCR) and the Great Western Railway (GWR) to improve their termini's access from London to the Midlands and North of England, especially relative to the London and North Western Railway (LNWR). It begins at Old Oak Junction on the Great Western Main Line (GWML) from Paddington and runs via Greenford to join what is now the Chiltern Main Line at Northolt Junction, southeast of South Ruislip.
The line joined the Great Western and Great Central Joint Railway between West Ruislip and Denham station in 1906. Its original name was "Denham – Junction for Uxbridge" as it was planned to be a stop on the shuttle service between Gerrards Cross and Uxbridge High Street. The latter was closed in 1964 and later demolished.
Since 1948 the West Ruislip branch of the London Underground Central line has run alongside it.
In the past it carried many trains to the northwest, and it was heavily used in the 1960s when electrification work restricted capacity on the West Coast Main Line (WCML); but when that project was completed, express services from London to Birmingham on the GWR/GCR route were discontinued as part of the Beeching cuts. All local trains on the route were diverted to Marylebone via Sudbury in 1963, and Greenford station on the New North Main Line was closed.
In the early 1990s the New North route was reduced to a single-track layout between Old Oak Common and Park Royal and between Greenford and South Ruislip. No improvement work has been carried out on the line since then.
Plans at this date to close Greenford East signal box and its semaphore signals, with upgraded signalling controlled by Slough and Marylebone signalling centres, were postponed indefinitely as decline of rail traffic controlled by Greenford East did not justify the cost.
In 2018 the section between Park Royal Sidings and Old Oak Common was closed for construction of HS2 and the connection with the GWML at Old Oak Common was severed.
Modern use
As described, the Central line has largely replaced its business.
Until December 2018 it was used for goods trains carrying refuse from London and was a diversionary route when the normal lines to Marylebone or Paddington were closed. Chiltern Railways operated a token service to and from Paddington on weekdays; the 10:57 from South Ruislip and 11:35 return which continued forward from South Ruislip, terminating at High Wycombe. It was replaced by service to West Ealing via the Greenford line. The line from Greenford to Park Royal is still used for goods trains carrying refuse from London.
For operational reasons such as balancing wheel wear, trains including those of Heathrow Express which were affected by tight track at Heathrow Junction have been turned using the London end of the NNML, its triangular junction with the Greenford Branch Line and the GWML through Ealing. At weekends between 2008 and 2011 when major engineering works were taking place on the West Coast Main Line, it was also used by Virgin Trains' London Euston to Birmingham International Blockade Buster service, which ran via Willesden, Acton Main Line, Ealing Broadway, Greenford, High Wycombe, Banbury and Coventry using Super Voyager sets up to 15 carriages long. At other times it was used by Chiltern Main Line services when the route to Marylebone was blocked; or by GWML services (via Banbury and Didcot) if the line through is blocked.
The route is also used for testing out new trains and for the training of new drivers.
The line is now officially known as the Acton to Northolt Line, and carries the Engineer's Line Reference code of ANL.
Ruislip Waste Transfer
A siding was built in 1980 to serve the then-new waste transfer station at Victoria Road, South Ruislip.
Future developments
Old Oak Common station is proposed for the combined part of the route with the GWML, for connections to and from the Elizabeth line. Additional tunnelling under the New North Main Line will keep the line free for other potential passenger services, as in the April 2013 published decision by High Speed 2 and the Department for Transport to recommend further bore tunnelling under the of the 'Northolt Corridor' within the London Borough of Ealing.
The tunnel will minimise traffic and noise blight which a surface route would otherwise have caused. The further bore tunnelling will link up the tunnels already planned beneath South Ruislip and Ruislip Gardens and Old Oak Common to North Acton. HS2 Ltd found in a study it had undertaken that bore tunnelling this stretch of the HS2 route would take 15 months less than constructing a surface HS2 route through this area and be at least cost-neutral. Cost neutrality flows from avoiding 20 bridge replacements, particularly years to replace road over rail bridges at the Hanger Lane Gyratory System, amenity disruption, the construction of intermediate tunnel portals and the likelihood of substantial compensation payments. The tunnelling will mean the New North Main Line is severed twice. It has not been decided whether the line will be restored once construction is complete.
A think tank with lobby group support has suggested that the line be used as part of services linking High Speed 1 to Heathrow Airport.
The London Mayor has responded to a proposal that the line becomes an additional branch of Crossrail.
In a summary report by Network Rail which was released in 2017 proposed that by 2043 that there should be a new terminal at Old Oak Common. This would mean an upgrade of the line to allow regular trains to once again run to the GWML replacing the current parliamentary service which runs from High Wycombe to West Ealing. Up to 4 trains per hour could run to Old Oak Common by 2043. The proposed upgrade would see redoubling of the line to a two-track railway with the possibility of line-speed improvements into the one or more platforms that could be provided at 'Old Oak Common' for the Chiltern Main Line. The number of platforms would depend on the number of services.
The line's former stations and sidings
Ruislip Gardens tube station
The tracks through the station were laid by the Great Western and Great Central Joint Railway with services starting on 2 April 1906, although there was no station at Ruislip Gardens at that time. The station opened on 9 July 1934.
As part of the 1935–40 New Works Programme, Central line services were projected westwards from a new junction, west of North Acton on the line to Ealing Broadway. The original intention was to extend the service as far as Denham, but work was delayed by World War II and the terminus of the extension was cut back to West Ruislip, with services starting on 21 November 1948.
Mainline services calling at Ruislip Gardens ceased in 1958 and the mainline station closed, the Central line station remaining open. Until recently the entrance to a passenger stairwell was visible on the London-bound side of the Network Rail tracks.
Northolt facilities
Northolt goods yard and carriage sidings
These served several local businesses and were also used to store spare British Rail and London Underground stock on occasion. They were abandoned in the early 1990s.
Northolt Halt and station
Northolt Halt, located on the opposite side of the road bridge from the current Northolt tube station, was opened by the GWR in 1907. It was later renamed "Northolt (for West End) Halt", before gaining station status under its original shorter name. It was closed in 1948 following the extension of the Central line to West Ruislip, the current tube station opening on 21 November 1948.
Greenford facilities
British Bath Company siding
This siding served the British Bath Company factory beside the Paddington Branch of the Grand Union Canal. It was lifted when the factory closed in the late 1970s, and the area is now occupied by Fairway Industrial Estate.
Kelvin Construction siding
This siding served the Kelvin Construction factory, next to that of the British Bath Company. The area is now occupied by Kelvin Industrial Estate.
Aladdin Industries siding
This siding served the Aladdin lamp factory, a short distance south of the British Bath Company and Kelvin factories. It was lifted when the factory closed in the early 1980s (although the main factory building is still extant), and the area is now occupied by a business park.
A Rugby Cement Terminal was immediately to the west of the former Greenford station up platform. This closed in about 1990.
Greenford station
The original Greenford station was opened by the Great Western Railway on 1 October 1904.
The present station, adjacent to the original, was built as part of the Central line extension of the 1935-40 New Works Programme of the London Passenger Transport Board. It opened on 30 June 1947 after delay due to World War II. Service at the original station was gradually reduced and it was closed in 1963.
Greenford freight sidings
These served several local businesses, but were closed in the 1990s.
Perivale facilities
Perivale GPO sidings
These originally served the local Royal Mail distribution centre and sorting office, but were disused for this purpose for decades until eventual closure in the early 2000s.
Perivale Halt railway station
The Great Western Railway opened "Perivale Halt" on 2 May 1904. It closed on 15 June 1947, after the extension of the Central line to Ruislip. It had long wooden platforms and pagoda shelters, on an embankment reached by sloping paths west of Horsenden Lane South. The steam "push-and-pull" passenger service ran to Paddington; the line (the last main line to be built before High Speed 1) was shared with freight and with express trains to Birmingham (2 hours non-stop). Until the late 1920s, Perivale was entirely rural, despite its proximity to Ealing.
A Lens of Sutton photograph of the station is on page 77 of The forgotten Stations of Greater London by J.E. Connor and B.L. Halford (Connor and Butler) (). There was a similar halt at South Greenford before it was modernised by Network SouthEast.
The current London Underground station was opened on 30 June 1947.
Sanderson & Sons sidings
These sidings served the Perivale factory of wallpaper firm Arthur Sanderson & Sons. They were lifted following the closure of the factory in the early 1970s.
Hanger Lane facilities
Twyford Abbey Halt and Brentham station
Twyford Abbey Halt, located just to the east of the current Hanger Lane tube station, was opened by the GWR on 1 May 1904. It was closed on 1 May 1911 and replaced by Brentham station, located to the west. This station, later renamed "Brentham (for North Ealing)", was closed between 1915 and 1920 due to World War I economies, and closed altogether in 1947 when the Central line was extended to West Ruislip. The current tube station, which opened on 30 June 1947, was called Hanger Lane as it was near that road.
Hanger Lane sidings
These few sidings were used by both London Underground and local businesses. They have now been mostly removed and the remaining one was heavily overgrown as of 2008.
Park Royal facilities
Brentham for North Ealing and Greystoke Park
Brentham for North Ealing and Greystoke Park was a railway station in the Park Royal district of London, on the New North Main Line. It opened as on 1 May 1911 as a replacement for Twyford Abbey Halt, but closed on 15 June 1947 in advance of the opening of the extension of the Central Line from North Acton to Greenford on 30 June 1947 and its subsequent replacement by Hanger Lane.
Park Royal West Halt
This halt was open between 1932 and 1947. It was located just to the east of the bridge carrying the London Underground Piccadilly line.
Park Royal Guinness brewery and sidings
These served the now demolished local Guinness plant, but were closed by the early 1990s. The sidings are currently used for aggregate trains supplying a Lafarge Tarmac depot.
Three possible transport services have been proposed for the area; the West London Orbital, Fastbus and the North and West London Light railway.
In 2004, the multinational company Diageo agreed to build extra Central line platforms at Park Royal tube station, as part of its First Central business park, built on the site of the former Guinness brewery. As of 2010, this had not yet happened.
Park Royal station
Park Royal station opened with the line in 1903, and closed in 1937. It should not be confused with the current station of the same name on the Piccadilly line, which opened in 1931.
British Can Company sidings
These sidings served the Acton factory of the British Can Company (later taken over by Metal Box & Printing Industries), as well as the adjacent Walters' Palm Toffee factory. They were lifted in the mid-1960s, although the bridge that carried them over the Central line is still extant.
The Fiat (England) siding
Long since closed.
Joseph's siding
Long since closed.
The Marcon Topmix stone terminal sidings
They both served the Marcon Topmix stone works, but were mothballed in the late 2000s (decade).
North Acton tube station
The joint New North Main Line (NNML) of the Great Central and Great Western opened in 1903 and its North Acton Halt followed in 1904 however this only remained open until 1913. A new station opened in 1923 concurrent with the Central London Railway station but closed on 30 June 1947 when local services on the line were withdrawn.
The Central London Railway (the precursor of the Central line) opened its adjoining North Acton station in 1923 on its 1920 extension to Ealing Broadway. As Transport for London explains:
North of the Central line tracks were two freight lines, removed in the 1960s, running alongside the Central line as far as White City. To the north of those at a slightly higher level were the two tracks of the NNML. The footbridge to the NNML platforms is on the extreme left of this 1933 photograph.
The NNML platforms closed when the Central line was extended on new track from North Acton to Greenford station in 1947. Between South Ruislip station and Old Oak Junction, the GWR line was progressively run down, and in many places reduced to single-track, including the stretch running past the tube station. From May 2008 only freight trains and a token once-daily passenger service provided by Chiltern Railways used this stretch of line until closure in December 2018.
Old Oak Lane Halt railway station
Old Oak Lane Halt railway station was opened by the Great Western Railway in 1906 within the complex of lines at the south east end of the New North Main Line, a location with low potential for passenger traffic. It closed in 1947 without a replacement when the Central line of London Underground was extended from North Acton to West Ruislip alongside the NNML under the 1935-1940 New Works Programme delayed by World War II.
References
See also
High Speed 2
North and West London Light Railway (proposal)
List of closed railway stations in London
Railway lines in London
Railway lines constructed by the Great Western Railway
Great Central Railway
Disused railway stations in the London Borough of Ealing
Standard gauge railways in England |
```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;
};
};
}
``` |
Listen Here! is an album by Eddie Palmieri. In 2006, the album won Palmieri the Grammy Award for Best Latin Jazz Album.
Track listing
"In Flight" (Palmieri) – 5:41
"Listen Here" (Eddie Harris) – 7:19
"Vals con Bata" (Palmieri) – 5:15
"Tema Para Eydie" (Palmieri) – 4:25
"Tin Tin Deo" (Gil Fuller, Chano Pozo) – 6:21
"In Walked Bud" (Thelonious Monk) – 5:59
"La Gitana" (Palmieri) – 7:15
"Nica's Dream" (Horace Silver) – 5:52
"Mira Flores" (Palmieri) – 5:49
"EP Blues" (Palmieri) – 8:18
Personnel
Eddie Palmieri - piano
Nicholas Payton, Brian Lynch - trumpet
Conrad Herwig, Doug Beavers - trombone
Donald Harrison, Ivan Renta - alto saxophone
Michael Brecker, David Sanchez - tenor saxophone
John Scofield - guitar
Regina Carter - violin
John Benítez, Christian McBride - bass
Horacio "El Negro" Hernández - drums
Giovanni Hidalgo - percussion
References
2005 albums
Eddie Palmieri albums
Concord Records albums
Grammy Award for Best Latin Jazz Album |
Entovalva nhatrangensis is a species of small marine bivalve mollusc in the family Lasaeidae. It was first described in 2010 and its specific name "nhatrangensis" derives from the locality where it was originally found, Nha Trang Bay in Vietnam. It lives inside the oesophagus of certain species of sea cucumbers. It is considered to be an endosymbiont rather than a parasite because it does not harm its host.
Description
Entovalva nhatrangensis can grow to about in length. It has a very small, delicate shell which is internal, being entirely enclosed by large folds of the mantle which fuse above the hinge. The gills are small but their structure is similar to those of other free-living bivalves. The foot extends permanently from the ventral side of the animal. This is relatively large compared to other bivalves and contains the visceral mass and the gonads. Entovalva nhatrangensis can be distinguished from the other three previously described species in the genus Entovalva by the different shape of its body and foot, and by the fact that its outer body epithelium is distinctively folded.
Biology
Entovalva nhatrangensis is an endosymbiont living inside the oesophagus of a sea cucumber. In a research study undertaken in 2010, 23 sea cucumbers known as brown sandfish (Holothuria spinifera) were gathered from shallow waters in Nha Trang Bay in Vietnam. Of these, 22 were found to harbour the bivalve in their oesophagus. The average number of molluscs per host was 84 with a range of 1 to 167. Another sea cucumber, Holothuria leucospilota, also acts as a host to the bivalve but of 30 specimens collected from the same locality, only one was found to harbour any of them, and that one contained just 5 molluscs.
It was at first surmised that Entovalva nhatrangensis might absorb nutrients through its epithelium. This idea was rejected however because the surface of the mantle is covered by a thin cuticle, which would make absorption difficult. The stomach was found to contain diatoms, therefore it is likely that the bivalve uses its gills to filter them and other fine organic particles from the contents of the sea cucumber's gut in which it is immersed.
Entovalva nhatrangensis is a protandric hermaphrodite. This means that it starts life as a male and later becomes a female. Fertilization takes place when a male inserts spermatophores (bundles of sperm) into the gill cavity of a female. It is unclear how this is done but it seems likely that the male, always smaller than the female, makes its way into the siphon of the female to deposit them in the required position. The eggs are fertilized as they emerge from the genital pore into the siphon. The resulting larvae are brooded in the siphon until they are released as D-larvae with their rudimentary shells already formed. It is surmised that the larvae pass through the sea cucumbers gut and out through its anus before becoming planktonic for a period.
References
Lasaeidae
Molluscs of the Pacific Ocean
Molluscs described in 2010 |
FC Eintracht Bamberg is a German association football club from the city of Bamberg, Bavaria. The footballers are part of a sports club formed on 1 April 2006 out of the union of 1. FC Bamberg and TSV Eintracht Bamberg. With over 1,500 members it is one of the largest sports associations in the Upper Franconia region of the state and has departments for bowling, karate, gymnastics, table tennis, tennis, and volleyball.
History
The two founding clubs initially held discussions around the possibility of a merger in the summer of 2005, but the talks failed when the proposal did not receive the necessary three-quarters majority support of the membership of TSV Eintracht. In January 2006, after another half-year of discussion and lobbying, Eintrachts membership overwhelmingly agreed to the merger, while the membership of FC Bamberg followed suit in March.
The newly merged side took up the place of FC in the Bayernliga (IV) and earned an unexpectedly good 5th place result. In the following season, the club stayed on course for a top-four finish, which would have meant Regionalliga Süd qualification, for most of the season but failed in the end, finishing fifth again. However, the insolvency of the Sportfreunde Siegen and the fact that the SpVgg Bayreuth was refused a licence meant, Bamberg did still move up to the Regionalliga.Aufstieg Regionalliga Süd (in German) Weltfussball.de, accessed: 13 June 2008
The club finished in mid-table in the 2008–09 Regionalliga season. The club had to declare insolvency at the end of the 2009–10 season and folded. However, a new club was formed immediately under the name of FC Eintracht Bamberg 2010 and entered the Bayernliga for 2010–11.
At the end of the 2011–12 season the club managed to finish in the top nine of the Bayernliga and thereby directly qualified for the new tier four Regionalliga Bayern. In this league the club finished 13th and 10th in its first two seasons there. The team came last in the league in 2014–15 and was relegated from the Regionalliga to the Bayernliga where it came last once more in the following season and was relegated to the Landesliga. The club had to declare insolvency once more in March 2016.
Stadium
1. FC Eintracht Bamberg plays in the Fuchs-Park-Stadion (previously Hauptkampfbahn im Volkspark) which served as the home ground of FC prior to the merger. The stadium was opened in 1926 and expanded in 1938 to accommodate 22,600 spectators. The record attendance of 27,000 was established in an amateur contest between Germany and France (1:1) on 2 May 1964.
Honours
The club's honours:
League
1. FC Eintracht Bamberg
Amateurliga Bayern (III)
Champions: 1946, 1948 (N), 1950, 1957 (N), 1958 (N), 1963 (N)
Runners-up: 1961 (N)
Landesliga Bayern-Nord (IV)
Champions: 1975, 1981
Runners-up: 2004, 2006
Bezirksoberliga Oberfranken (V-VI)
Champions: 2008‡
Runners-up: 1992, 1997
(N) = Northern division
Eintracht Bamberg
Landesliga Bayern-Nordost (VI)
Champions: 2019
Bezirksliga Oberfranken West (VII)
Champions: 2018‡
Cup
Oberfranken Cup Winners: 2002
Youth
Bavarian Under 19 championship Runners-up: 2006
Bavarian Under 17 championship'
Runners-up: 2004
‡ Reserve team
Players
Recent managers
Recent managers of the club:
Recent seasons
The recent season-by-season performance of the club:
1. FC Bamberg
The final placings of 1. FC Bamberg:
Eintracht Bamberg
Reserve team
With the introduction of the Bezirksoberligas in 1988 as the new fifth tier, below the Landesligas, all leagues below dropped one tier. With the introduction of the Regionalligas in 1994 and the 3. Liga in 2008 as the new third tier, below the 2. Bundesliga, all leagues below dropped one tier. With the establishment of the Regionalliga Bayern as the new fourth tier in Bavaria in 2012 the Bayernliga was split into a northern and a southern division, the number of Landesligas expanded from three to five and the Bezirksoberligas abolished. All leagues from the Bezirksligas onwards were elevated one tier.
References
External links
Official website
FC Eintracht Bamberg on Weltfussball.de
Association football clubs established in 2006
Association football clubs disestablished in 2010
Association football clubs established in 2010
Bamberg
Football in Upper Franconia
2006 establishments in Germany
2010 disestablishments in Germany
2010 establishments in Germany |
Germany is Europe's largest and the world's 6th greatest single emitter of CO2. In July 2007, Germany had the largest European population, with 82.4 million people. Germany imports most of its materials and energy sources, and in 2004 imported 2.135 million barrels of oil and 85.02 billion m³ (2003) of natural gas a day. In 2004, Germany emitted 886 million metric tonnes of CO2. In 2004, there were approximately 45 million registered cars in Germany.
Between March 1998 and March 1999, 84 countries including Germany signed the Kyoto Protocol. In March 2002, the Bundestag unanimously ratified Kyoto. In May 2002, the European Union submitted the articles of ratification for all 15 of its then member states.
As an Annex II nation, Germany's commitment to the UNFCCC with respect to Kyoto was to reduce emissions as well as to provide an economic crutch to developing nations via Clean Development Mechanisms.
In November 2006, Germany's planned annual quota was 482 million metric tonnes of CO2. German Greenhouse Gas Emissions reduced by 17.2% from 1990 to 2004, according to UNFCCC. Germany actively promotes government carbon funds and supports multilateral carbon funds that are intent on purchasing Carbon Credits from non-Annex I parties. Government organizations work closely with major utility, energy, oil and gas, and chemicals conglomerates to try to acquire as many Greenhouse Gas Certificates as cheaply as possible.
Since signing and ratifying the protocol, Germany has committed to reducing its emissions to 21% below 1990 levels between 2008 and 2012. In November 2008, a study found that Germany had already reduced its greenhouse gas emissions by 22.4%, which means it already reached its Kyoto Emissions Commitments.
Some of Germany's achievements since signing the protocol
So far Germany has reduced CO2 emissions by 22.4%.
Germany has topped world production in wind energy with more than 16,000 wind turbines, which generate 39% of the world's total wind power.
Germany played a key role in installing 64% of the solar energy generation capacity in 2003.
Germany has also signed a climate change agreement alongside Israel, Jordan, and Egypt. This agreement is designed to make it easier and cheaper for industrialized countries such as Germany to meet their greenhouse gas emission reduction targets under the protocol.
Next steps
Germany plans to generate 20% of its energy from renewable energy sources by 2020.http://www.bmu.de/english/current_press_releases/pm/46293.php
References
External links
Germany Info
Un Foundation
Climate change in Germany |
Teragram may refer to:
1012 grams, or 109 kilograms, or 1 megatonne
Teragram Corporation
See also
Orders of magnitude (mass) |
```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);
}
``` |
Karnak is a temple complex and a village near Luxor, Egypt.
Karnak or similar may also refer to:
Karnak
Karnak (band), from São Paulo, Brazil
Karnak (comics), an Inhuman in the Marvel Universe
Karnak, Illinois, a village in Pulaski County, Illinois, United States
Karnak (typeface), a typeface by R. Hunter Middleton
Karnak Mountain, Purcell Mountains, Canada
Karnak, Griggs County, North Dakota
Karnak, the Antarctic retreat of Ozymandias in the comic book series Before Watchmen: Ozymandias
Big Karnak, an arcade video game released in 1991 by Gaelco
Queen Karnak, a fictional character in the video game Final Fantasy V
S.S. Karnak, a fictional ship in the novel by Agatha Christie Death on the Nile
SS Karnak (1898), a French passenger ship
Carnac
Carnac, the village and commune in northwestern France
Carnac stones, a collection of monolithic sites around the village
Carnac the Magnificent, a recurring comedic role played by Johnny Carson on The Tonight Show Starring Johnny Carson
The Carnac and Rivett-Carnac families, including:
John Carnac (1716 – 29 November 1800), British Commander-in-Chief of India
James Rivett-Carnac (1784–1846), Commander-in-Chief of India
John Rivett-Carnac (1796–1869), Royal Navy admiral and explorer of Western Australia
Rivett-Carnac baronets
Carnac Island, a nature reserve near Fremantle, Western Australia
Carnac (The Silver Sequence), a fictional character in the book series The Silver Sequence
Rudolf Carnap (1891–1970), German philosopher
Other
Karnack, Texas, USA
KARNAC, Knowledge Aided Retrieval in Activity Context, terrorist profiling
Qaanaaq, a place in northwest Greenland
See also
Carnacki, a fictional occult detective created by William Hope |
The 2nd Cavalry Brigade was a brigade of the British Army. It served in the Napoleonic Wars (2nd Union Cavalry Brigade), the Boer War and in the First World War when it was assigned to the 1st Cavalry Division.
Prior to World War I the brigade was based at Tidworth Camp in England; and originally consisted of three cavalry regiments and a Royal Engineers signal troop. After the declaration of war in August 1914, the brigade was deployed to the Western Front in France, where an artillery battery joined the brigade the following September and a Machine Gun Squadron in February 1916.
History
Napoleonic Wars
From June 1809, Wellington organized his cavalry into one, later two, cavalry divisions (1st and 2nd) for the Peninsular War. These performed a purely administrative, rather than tactical, role; the normal tactical headquarters were provided by brigades commanding two, later usually three, regiments. The cavalry brigades were named for the commanding officer, rather than numbered. For the Hundred Days Campaign, he numbered his British cavalry brigades in a single sequence, 1st to 7th. The 2nd Cavalry Brigade consisted of:
1st (Royal) Regiment of Dragoons
2nd Regiment of Dragoons (Royal Scots Greys)
6th (Inniskilling) Dragoons
As the brigade consisted of regiments from England (1st Dragoons), Scotland (2nd Dragoons) and Ireland (6th Dragoons), it was known as the 2nd (Union) Cavalry Brigade.
Boer War
The brigade was reformed for the Boer War. During the Battle of Paardeberg, the brigade commanded:
6th Dragoon Guards (Carabiners)
2nd Dragoons (Royal Scots Greys)
6th (Inniskilling) Dragoons
New Zealanders
Australians
G and P Batteries, Royal Horse Artillery
World War I
4th (Royal Irish) Dragoon Guards
9th (Queen’s Royal) Lancers
18th (Queen Mary’s Own) Hussars
2nd Signal Troop, Royal Engineers
H Battery, Royal Horse Artillery from 28 September 1914
2nd Cavalry Brigade Machine Gun Squadron Machine Gun Corps
Commanders
The commanders of the 2nd Cavalry Brigade during the First World War were:
Brigadier-General H. de B. de Lisle (At mobilization)
Brigadier-General R. L. Mullens (12 October 1914)
Brigadier-General D. J. E. Beale-Browne (26 October 1915)
Brigadier-General A. Lawson (16 April 1918)
See also
Order of battle of the Waterloo Campaign
British Army during World War I
British Cavalry Corps order of battle 1914
British cavalry during the First World War
Notes
References
Bibliography
External links
Cavalry brigades of the British Army
Military units and formations established in 1815
Military units and formations disestablished in 1815
Military units and formations established in 1899
Military units and formations disestablished in 1902
Military units and formations established in 1914
Military units and formations disestablished in 1919 |
```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
``` |
The 2016 Jinyuan Cup was a professional tennis tournament played on outdoor hard courts. It was the third edition of the tournament and part of the 2016 ITF Women's Circuit, offering a total of $50,000 in prize money. It took place in Zhengzhou, China, on 16–22 May 2016.
Singles main draw entrants
Seeds
1 Rankings as of 9 May 2016.
Other entrants
The following players received wildcards into the singles main draw:
Kang Jiaqi
Tang Haochen
The following players received entry from the qualifying draw:
Feng Shuo
Guo Shanshan
Kim Na-ri
Wang Yan
Champions
Singles
Anastasia Pivovarova def. Lu Jingjing, 6–4, 6–4
Doubles
Xun Fangying / You Xiaodi def. Akgul Amanmuradova / Michaela Hončová, 1–6, 6–2, [10–7]
External links
2016 Jinyuan Cup at ITFtennis.com
Official website
2016 ITF Women's Circuit
2016 in Chinese tennis
Zhengzhou Open |
Pentwyn Farm Grasslands is a nature reserve, and a series of agricultural fields, in Monmouthshire, southeast Wales. It was designated a Site of Special Scientific Interest (SSSI) in 1993, noted for its biological characteristics.
Geography
The SSSI, spread over 3 separate enclosed spaces, is located within the community of Mitchel Troy, south of the town of Monmouth. They are centred on Pentwyn Farm, to the north of the village of Penallt.
The site is owned by the Gwent Wildlife Trust as well as private individuals. The grasslands lie on top of the local red sandstone and brown earth soils. The ground generally slopes in a southerly direction, but one field does slope to the north.
Wildlife and ecology
The traditionally-managed, unimproved neutral grassland, that Pentwyn Farm supports, is one of the largest in the area and is of importance as this type of grassland is in decline within Britain. The flora that dominates this reserve is the common knapweed (Centaurea nigra), common bent (Agrostis capillaris), meadow vetchling (Lathyrus pratensis), red fescue (Festuca rubra) and sweet vernal grass (Anthoxanthum odoratum), with cock's-foot (Dactylis glomerata) and crested dog's-tail (Cynosurus cristatus) preferring low-lying areas. Also present are red clover (Trifolium pratense) and common bird's-foot trefoil (Lotus corniculatus), the latter having a more sporadic distribution on the site.
Green-winged orchids (Anacamptis morio) are also present on the site, in one of the largest populations within the vice-county of Monmouthshire. This orchid is becoming increasingly uncommon within Monmouthshire as well as nationally. Other orchids found on the reserve include the common spotted (Dactylorhiza fuchsii), common twayblade (Neottia ovata) and the greater butterfly (Platanthera chlorantha).
The hedgerows of the field system provide an ideal habitat for dormice and also offer food for overwintering fieldfares and redwings.
Gallery
References
Nature reserves in Monmouthshire
Sites of Special Scientific Interest in Monmouthshire
Sites of Special Scientific Interest notified in 1993
Farms in Wales
Meadows in Wales |
Apples and oranges is an idiom comparing apples and oranges.
Apples and oranges may also refer to:
"Apples and Oranges" (song), a 1967 song by Pink Floyd
Apples & Oranges, an album by Postmen
Apples & Oranges, a 2007 album by Stacy Clark
Apples & Oranges, a play by Alfred Uhry
"Appels + Oranjes", a song by The Smashing Pumpkins from Adore
Apples and Oranges, painting by Paul Cézanne
See also
Apples and Pears (disambiguation) |
Gertrud Pätsch (born 22 January 1910 in Hannover as Gertrud Kettler; died 14 December 1994 in Jena) was a German ethnologist and philologist, who rendered service in the area of Kartvelian studies.
In 1937 she graduated in Munster with a degree in the Old Georgian language. After the Second World War she left the western sector of Germany for East Berlin, where she earned a habilitation at the Humboldt University of Berlin in Indonesian linguistics. She taught in Berlin until she moved to the Friedrich Schiller University in Jena in 1960, where she founded the Kartvelologian faculty. After her retirement she worked for two years at the Tbilisi State University in Georgia. She published books and many articles in journals, such as Bedi Kartlisa. Revue de Kartvélologie. Towards the end of her life, Pätsch translated many pieces of Georgian literature, such as Shota Rustaveli's poem
"The Knight in the Panther's Skin". She worked diligently for cultural exchanges between the German Democratic Republic and Georgia. She even had the Georgian alphabet engraved in the stairwell of her home in Jena, where she also had built a guest house for such visitors as Konstantine Gamsakhurdia.
Further reading
German ethnologists
German philologists
Women ethnologists
20th-century women scientists
Writers from Hanover
1994 deaths
1910 births
Kartvelian studies scholars
20th-century philologists |
Hwaeomsa (Sino-Korean: hwa-eom-sa 華嚴寺, literally "Flower Garland Temple") is a head temple of the Jogye Order of Korean Buddhism. It is located on the slopes of Jirisan, in Masan-myeon, Gurye County, in South Jeolla Province, South Korea.
History
An Avatamsaka Sanctuary with 1,000 Years of History
Hwaeomsa Temple (Korean: 화엄사, Chinese: 華嚴寺, Pronounced “Hwa-eom-sa”) was established in 544 by Ven. Yeongi Josa. It was expanded in 643 by Ven. Jajang Yulsa, when the Sakyamuni Relic Pagoda, Seven-Story Pagoda, and a stone lantern were added. During the reign of King Munmu, by royal decree, Ven. Uisang Daesa inscribed the Eighty-Fascicle Avataṃsaka Sutra, on stone tablets and preserved them here. In 875, Ven. Doseon Guksa expanded the temple again.
In 943 during the Goryeo era, honoring the deathbed wish of Ven. Doseon Guksa, the state began to first establish 500 Seon temples, followed by 3,800 “Bibo-sachal,” at sites where bad geomantic energy needed to be transformed. Hwaeomsa Temple was the first temple to be renovated. There were four more renovations thereafter during the reigns of King Gwangjong, King Munjong, King Injong and King Chungsuk.
In 1593, most of Hwaeomsa Temple's buildings were burned to the ground in the Japanese invasion. However, the temple still preserves pieces of Ven. Uisang Daesa's stone tablets inscribed with sutras, “Hwaeom Seokgyeong (Treasure No. 1040)” which were left from the tablets shattered in the fire set by the invaders. Later, Ven. Byeogam Gakseong reconstructed some of the buildings, including the Main Buddha Hall (1630-1636).
In 1701, in the 27th year of King Sukjong's reign, the reconstruction of Hwaeomsa Temple was completed, and the king designated it the great temple of the combined schools of doctrine and meditation. Buildings and gates completed at this time were: Daeungjeon, Gakhwangjeon, Bojeru, Myungbujeon, Wontongjeon, Yeongsanjeong, Eunghyanggak, Jeongmugdang, Geumgangmun and Cheonwangmun.
Cultural properties
Of the wealth of cultural properties owned by Hwaeomsa Temple, the first one to catch the eye is Gakhwangjeon Hall (National Treasure No. 67), which literally means “a building where enlightened kings reside.” Though it was built during the reign of Joseon's King Sukjong, under a state policy that promoted Confucianism and suppressed Buddhism, Gakhwangjeon's size is only exceeded by Geunjeongjeon, the palace building where the king took care of official business. Gakhwangjeon was built on the former site of Jangnyukjeon, which had been burnt down, and King Sukjong gave the name of “Gakhwangjeon” to the newly built hall.
In front of Gakhwangjeon stands a giant Stone Lantern (National Treasure No. 12), befitting the size of Gakhwangjeon. Thought to have been sculpted during the United Silla era, it is 6.4 meters (21 feet) high, and 2.8 meters (9 feet) in diameter. Slightly up and to the left of Gakhwangjeon stands the Four-Lion Three-Story Stone Pagoda (National Treasure No. 35) carved in granite. Among non-standard pagodas, it is considered to have a higher degree of completeness, along with Dabotap Pagoda at Bulguksa Temple. Four lions make up the foundation and support the whole pagoda. In the center of the four lions stands Ven. Yeongi Josa's mother to whom, on his knees, he is offering tea out of deep filial piety.
Other cultural objects of Hwaeomsa include: Scroll Painting of the Vulture Peak Assembly (National Treasure No. 301); Eastern Five-Story Stone Pagoda (Treasure No. 132); Western Five-Story Stone Pagoda (Treasure No. 133); Daeungjeon Hall (Treasure No. 299); Lion Pagoda in front of Wontongjeon Hall (Treasure No. 300); Reliquaries from the Western Five-Story Stone Pagoda (Treasure No. 1348); Scroll Painting of the Vairocana Buddha Triad in Daeungjeon Hall (Treasure No. 1363); and Seated Wooden Vairocana Buddha Triad (Treasure No. 1548).
Two trees here have been designated natural monuments: the Winter-Flowering (Natural Monument No. 38) and the Plum Tree (Natural Monument No. 485). Seon Master Buyong Yeonggwan composed a poem about this plum tree.
Tourism
It also offers temple stay programs where visitors can experience Buddhist culture.
Gallery
See also
Hwaeom
Korean Buddhist temples
Religion in South Korea
Ssanggyesa, another major temple on Jiri-san
References
External links
Tour2Korea profile
David A. Mason's 4 pages on Hwaeom-sa and its associated Hermitages
Asian Historical Architecture: Hwaeomsa Temple
Buddhist temples in South Korea
Buddhist temples of the Jogye Order
Gurye County
6th-century Buddhist temples
6th-century establishments in Korea
Religious organizations established in the 6th century
544 establishments
Temples that participate in Templestay |
Ophiclinops hutchinsi, the Earspot snakeblenny, is a species of clinid native to reefs with seagrass or weed growth at depths of from along the coast of south east Western Australia.
Etymology
The specific epithet "hutchinsi" honours J. Barry Hutchins, whom the authors credit with collecting the type specimens for the species.
Description
This species can reach a maximum length of TL. They are primarily a mottled brown in colouring.
References
hutchinsi
Fish described in 1980
Taxa named by Victor G. Springer |
The cabinet of Harri Holkeri was the 64th government of Finland, which existed from 30 April 1987 to 26 April 1991. It was a majority government formed by the National Coalition Party, the Social Democratic Party, the Swedish People's Party, and the Rural Party. The cabinet's Prime Minister was Harri Holkeri. The Rural Party left the coalition in August 1990 because it disagreed with the government's pension funding plan.
Ministers
References
Holkeri
1987 establishments in Finland
1991 disestablishments in Finland
Cabinets established in 1987
Cabinets disestablished in 1991 |
Lygodesmia, called skeletonplant, is a genus of North American flowering plants in the tribe Cichorieae within the family Asteraceae.
The name derives from the Greek lygos, a pliant twig, and desme, a bundle, because of the fascicled twiggy or rush-like stems of the plants.
Species
Lygodesmia aphylla - FL GA AL
Lygodesmia arizonica - AZ NM CO UT
Lygodesmia dianthopsis - AZ UT NV ID
Lygodesmia doloresensis - CO UT
Lygodesmia entrada - UT
Lygodesmia grandiflora - AZ NM CO UT WY
Lygodesmia juncea - widespread across western Canada + western United States
Lygodesmia ramosissima - AZ TX Chihuahua, Durango, Sonora
Lygodesmia texana - TX OK NM Coahuila, Nuevo León
References
External links
USDA Plants Profile: Lygodesmia
Southwest Colorado Wildflowers
Florida Plant Atlas
Natural Medicinal Herbs, Skeleton Weed, Lygodesmia juncea
Ladybird Johnson Wildflower Center, University of Texas, Lygodesmia texana
Minnesota Wildflowers, Lygodesmia juncea (Skeletonweed)
Asteraceae genera
Flora of Northern America |
```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`
``` |
Union Ridge School District 86 is a school district located in Harwood Heights, Illinois, United States.
References
External links
School districts in Cook County, Illinois |
Dr. Shahzad Waseem () is a Pakistani politician who was the former Leader of the House for the Senate of Pakistan serving from 4 June 2020 to 20 April 2022. He has been a member of Senate of Pakistan from Punjab since October 2018.
Political career
Dr. Shahzad Waseem is a Pakistani politician who is the current Leader of the Opposition in the Senate of Pakistan since 20 April 2022. He was appointed as Leader of the House for Senate of Pakistan by former Prime Minister Imran Khan.He served as Leader of the House from 4 June 2020 to 20 April 2022.
Waseem has been elected to the Senate of Pakistan from Punjab on the seat vacated by Chaudhry Mohammad Sarwar representing Pakistan Tehreek-e-Insaf. The election was held on 3 October 2018 between him and Khawaja Ahmed Hassan of Pakistan Muslim League (N). Waseem secured 181 votes compared to 169 for Hassan.
He is the member of following standing committees of Senate since elected in 2018:
Standing Committees on Foreign Affairs.
Standing Committees on Interior.
Standing Committees on Kashmir Affairs.
Standing Committees on Information Technology.
Standing Committees on Housing and Works.
He has served as the advisor to The Chairman PTI on Diplomatic Relations. He was handling External Publicity and International Relations department within the party.
He has served as the State Minister for Interior from 2003 till 2006. As State Minister Interior, he supervised Nadra's transformation towards digital era and Machine Readable Passport initiative. Actively contributed in development of Islamabad as modern metropolis, Police Reforms and also in the management of earthquake in 2006.
Dr. Shahzad was also a Member of the Senate of Pakistan from 2003 till 2006.
From 2003 until 2006 he was serving in the following Standing Committees in the Senate:
Standing Committee on Establishment and Cabinet Division. (Chairman Committee)
Standing Committee on Women Development.
Standing Committee on Sports and Culture.
Standing Committee on Youth Affairs.
Standing Committee on Health.
Standing Committee on Interior.
References
Living people
Pakistan Tehreek-e-Insaf politicians
Politicians from Punjab, Pakistan
Year of birth missing (living people) |
Şerbettar can refer to:
Şerbettar, Havsa
Şerbettar railway station |
```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
``` |
Evette Huntley Branson (née Flindt; 12 July 1924 – 8 January 2021) was a British philanthropist, child welfare advocate, and the mother of Richard Branson.
Life and career
Branson was born in Edmonton, Middlesex, England, the daughter of Dorothy Constance (née Jenkins) (19 June 1898 - August 1997) and Major Rupert Ernest Huntley Flindt (11 St Faith's-road, West Norwood, 28 December 1890 - 19 October 1966). As a young adult, she served in the Women's Royal Naval Service (WRENS) during World War II. After the war ended, she toured West Germany as a ballet dancer with Entertainments National Service Association (ENSA). She later became an airline hostess for British South American Airways. After marrying, Branson ran a real estate property business and was a military police officer and probation officer. She also wrote novels and children's books.
In 2013 Branson published her autobiography, Mum's the Word: The High-Flying Adventures of Eve Branson.
Branson established the Eve Branson Foundation and served as its director.
Branson was a member of the board of directors of the International Centre for Missing & Exploited Children ("ICMEC"), the goal of which is to help find missing children, and to stop the exploitation of children. She was a founding member of ICMEC's board of directors in 1999, seeking to generate awareness of the centre's work, and her son Richard was ICMEC's founding sponsor.
Personal life and death
She married, in Frimley, Surrey, on 15 October 1949, Edward James "Ted" Branson, born on 10 March 1918, a former Cavalryman, son of Sir George Arthur Harwin Branson and wife Mona Joyce Bailey. He died on 19 March 2011 in his sleep at the age of 93.
In 2011, Branson escaped a fire at her son's Caribbean home on Necker Island.
Branson died from COVID-19 complications on 8 January 2021, during the COVID-19 pandemic in the United Kingdom at the age of 96. A celebration of her life was posted online by her son Richard. He revealed that he owed his career to his mother, explaining that she had found a necklace in the 1960s and after the police let her keep the jewellery, because nobody had claimed it, she sold it and gave him the funds. "Without that £100, I could never have started Virgin," he said.
Legacy
The VMS Eve the carrier mothership for Virgin Galactic and launch platform for SpaceShipTwo-based Virgin SpaceShips (Tail number: N348MS) was named in her honour by Virgin Galactic and her son Sir Richard Branson.
A new Airbus A350-1000, G-VEVE - Fearless Lady has been named in her honour and will be delivered to Virgin Atlantic in December 2021 as the first aircraft optimised for the airline's leisure routes.
References
External links
The Eve Branson Foundation
Eve Branson obituary at The Times (subscription required)
1924 births
2021 deaths
People from Edmonton, London
Royal Navy personnel of World War II
English ballerinas
Flight attendants
British police officers
British women police officers
British women children's writers
Women's Royal Naval Service ratings
Deaths from the COVID-19 pandemic in England
20th-century English women
20th-century English people |
```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
``` |
Central Railroad & Banking Co. of Ga. v. Pettus, 113 U.S. 116 (1885), was an appeal from a decree of the Circuit Court of the United States for the Middle district of Alabama in favor of the appellees, Pettus & Dawson and Watts & Sons, adjudging them entitled to the sum of, 161.21, and interest thereon at eight percent per annum from March 7, 1881, with lien, to secure its payment, upon the roadbed, depots, side tracks, turnouts, trestles, and bridges owned and used by the appellants, corporations of the State of Georgia, in operating the railroad formerly belonging to the Montgomery and West Point Railroad Company, an Alabama corporation, and which extends from Montgomery to West Point with a branch from Opelika to Columbus. This property was directed to be exposed to sale unless within a given time the said amount was paid. This suit is the outgrowth of certain litigation in the courts of Alabama relating to the before-mentioned and other railroad property in which the appellants are interested.
Summary
On September 1, 1870, the Western Railroad Company, an Alabama corporation, purchased and took possession of the railroad (main line and branch) and all other property of the Montgomery and West Point Railroad Company, one of the terms and conditions of such purchase being, as was claimed, that the former company assumed the payment of all outstanding debts and obligations of the latter and agreed to issue its capital stock, dollar for dollar, in exchange for stock of the Montgomery and West Point Railroad Company outstanding.
It was a part of that arrangement that the last-named company should, as it subsequently did, surrender its charter to the state. When this purchase was made, there were, upon the franchises and property of the latter company, two mortgages to secure bonds proposed to be issued—one, June 1866, for 0,000, bonds for the whole of which were issued; the other, May 1, 1868, for 0,000, bonds for, 000 of which were issued. It had also outstanding bonds issued in 1866 and 1867, not secured by mortgage or otherwise. The Western Railroad Company had at the time of its purchase a mortgage of date September 15, 1868, upon its own property and franchises to secure 0,000 of bonds then, or at some subsequent period, guaranteed by the present appellants.
On September 15, 1870, that company executed to Morris and Lowery, trustees, a mortgage upon its property and franchises (including the property transferred to it by the Montgomery and West Point Railroad Company), to secure the payment of, 200,000 of bonds, thereafter to be issued, and of which a large amount was issued, and their payment was also guaranteed by the appellants.
Subsequently, on March 31, 1874, those trustees commenced a suit in the Chancery Court of Montgomery County, Alabama, against the Western Railroad Company, the present appellants, the surviving trustees in the mortgages executed by the Montgomery and West Point Railroad Company, and others. Its object was to procure a sale of the property of the former company, including that purchased from the latter company. A final decree was passed December 18, 1874, ordering a sale, subject, however, to a lien, in respect of the property formerly owned by the last-named company, in favor of the holders of its mortgage bonds, according to their respective priorities, and, in respect of the property of the Western Railroad Company, to a lien in favor of the holders of bonds secured by its mortgage of September 15, 1868. The sale was had, the present appellants becoming the purchasers.
On May 8, 1875, Branch, Sons & Co., H. P. Hoadely, and C. S. Plank—holding bonds of the (old) Montgomery and West Point Railroad Company not secured by mortgage—through Pettus & Dawson and Watts & Sons, their solicitors, exhibited a bill in equity in the same court against the present appellants, the Western Railroad Company, the Montgomery and West Point Railroad Company, and others. They sued for themselves as well as for all other creditors of the last-named company who should come in and make themselves complainants and contribute to the expenses of the suit. Such proceedings were had—the Georgia corporations appearing and making defense—that on May 1, 1877, a final decree was entered by which it was, among other things, adjudged that "the unsecured creditors of the Montgomery and West Point Railroad Company, to which class complainants belong, have a lien" upon the property transferred by it to the Western Railroad Company; that such lien was subordinate to those for the bonds issued under the several mortgages executed by the Montgomery and West Point Railroad Company that were outstanding and unpaid, but superior to that of the mortgage executed by the Western Railroad Company after its said purchase, so far as the property of the Montgomery and West Point Railroad Company was covered by that mortgage, and that the property of all kinds, belonging to the latter company, be sold to satisfy its debts according to priority.
The cause was referred to a register to ascertain and report the amounts due to the complainants and to such other unsecured creditors of the Montgomery and West Point Railroad Company as should prove their claims pursuant to the decree; also the amounts due to holders of bonds issued under its several mortgages. Upon appeal by the two Georgia corporations to the Supreme Court of Alabama, that decree was affirmed. The register thereafter proceeded with its execution. Numerous parties, including the complainants, appeared before him and had their claims registered, the creditors in each instance retaining in their own custody the evidence of their respective demands. The aggregate amount of such claims was very large.
On April 15, 1879, the register not having made his report upon these claims, Pettus & Dawson and Watts & Sons, by leave of the court, filed in the cause their joint petition, alleging in substance that as solicitors specially employed by the complainants, Branch, Sons & Co., Hoadley, and Plank, they prepared and filed the original bill, as well in behalf of themselves as of all other unsecured creditors of the Montgomery and West Point Railroad Company who should come in and contribute to the expenses of the suit; conducted the proceedings to a final decree; represented the same interests in the Supreme Court of Alabama; that their relations to the suit were well known to the Georgia corporations during the whole period of the litigation; that pending the reference before the register, after the rights of complainants and all creditors of the same class had been established by the final decree, those corporations made a secret arrangement with their immediate clients, whereby the claims of the latter were paid in full, principal and interest, and whereby also Branch, Sons & Co. and their co-complainants agreed to withhold from their solicitors the fact of such settlement until the Georgia corporations could buy or settle all other claims of the unsecured creditors of the Montgomery and West Point Railroad Company; that "afterwards said two Georgia companies, defendants to this suit, did buy up or settle the other claims, which had been filed in the cause, under said decree," and, "either jointly or separately, thereby acquired possession and control of said claims so filed;" that they also purchased and settled a large amount of claims, which might have been, but were not, filed with the register; that at the time of such purchase, said Georgia corporations had actual notice that petitioners, as solicitors in that suit, claimed reasonable compensation for such services as they rendered in behalf of the unsecured creditors of the Montgomery and West Point Railroad Company (other than complainants) who should come in and take the benefit of the final decree, and also the benefit of any lien upon said property that should be declared in favor of those creditors, and that in equity they
"were the assignees of a part of each claim as filed to the amount of the reasonable value of the services rendered in said cause by petitioners for the benefit of each holder and owner of such claims respectively."
The prayer of the petition was that an account be taken of the sums thus due to them as solicitors representing the unsecured creditors of the Montgomery and West Point Railroad Company (except the complainants and other named creditors with whom they had special contracts for fees) who received the benefit of their services; that they be declared to have a lien for the value of such services on all the property of that company which had come into the possession of the Georgia corporations, and that so much of it as may be necessary for that purpose be sold to meet the amounts due them.
The register reported, on April 22, 1879, that there were then no bonds or claims in the registry, except one claim, filed in court, as to which he did not report because no one had appeared and requested that it be audited.
Subsequently, April 24, 1879, the Georgia corporations presented their joint petition for the removal of the suit commenced against them by Pettus & Dawson and Watts & Sons (they being the only defendants to the petition filed by the latter) to the circuit court of the United States, in which court it was docketed, and, after answer by the defendants and proof taken, proceeded to final decree. When the cause was removed from the state court, nothing practically remained for determination between the parties to the record except the claim of appellees, citizens of Alabama, to a lien upon the property in question owned by the two Georgia corporations.
Findings
The court below did not err in declaring a lien upon the property in question to secure such compensation as appellees were entitled to receive, for according to the law of Alabama, by one of whose courts the original decree was rendered and by which law this question must be determined, an attorney at law or solicitor in chancery has a lien upon a judgment or decree obtained for a client to the extent the latter has agreed to pay him, or, if there has been no specific agreement for compensation, to the extent to which he is entitled to recover, viz., reasonable compensation for the services rendered. Ex Parte Lehman, 59 Ala. 632; Warfield v. Campbell, 38 Ala. 527. That lien could not be defeated by the corporations which owned the property purchasing the claims that were filed by creditors under the decree. The lien of the solicitor rests by the law of that state upon the basis that he is to be regarded as an assignee of the judgment or decree, to the extent of his fees, from the date of its rendition. This right of the solicitors is superior to any which the defendant corporations acquired subsequent to the decree by the purchase of the claims of unsecured creditors.
It remained only to consider whether the sum allowed appellees was too great. The decree gave them an amount equal to ten percent upon the aggregate principal and interest of the bonds and coupons filed in the cause, excluding those in respect of which there was, between appellees and complainants and others, special contracts for compensation. It is shown that appellees had with the complainants contracts for small retainers and five percent upon the sums realized by the suit. We perceive no reason for this discrimination against creditors who were not parties except by filing their claims after decree. One-half the sum allowed was, under all the circumstances, sufficient.
Decree reversal
The decree was reversed and the cause remanded with directions to modify the decree so as to award to appellees only the sum of, 580, with interest from March 7, 1881, with the benefit of the lien upon the property as established by the decree. Each party will pay his costs in this Court and one-half the cost of printing the record.
See also
List of United States Supreme Court cases, volume 113
References
External links
United States Supreme Court cases
United States Supreme Court cases of the Waite Court
Railway litigation in 1885
1885 in United States case law
Central of Georgia Railway |
Journey to the Center of Your Wallet is the second studio album written and performed by the Humpers.
Track listing
"This Measly Dimension"
"Freak Magnet"
"You Give Good Headache"
"Watching You, (I'm)"
"Space Station Love"
"Bombs Away"
"Dope on a Rope"
"Dead Last"
"Blow"
"Do the Wrong Thing"
"Crank Call"
"Up Yer Heart"
"Motorhead"
1995 albums
The Humpers albums |
```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; }
}
``` |
Hypaedalea butleri is a moth of the family Sphingidae. It is known from forests from Sierra Leone to Congo and Uganda.
The length of the forewings is 25–27 mm for males and females. The thorax has a large green median dorsal patch that extends onto the head and is laterally bordered by a brown line. The abdomen is pale yellowish-brown. The thorax and abdomen are buff-yellow ventrally. The forewing upperside is purplish-brown with irregular narrow dark brown transverse lines, a minute discal spot and a broad well defined very irregular dark purple brown marginal band. The hindwing upperside is uniformly dark brown.
References
Macroglossini
Moths described in 1894
Moths of Africa
Insects of West Africa
Insects of Uganda
Insects of the Central African Republic
Fauna of Gabon |
Erich Maren Schlaikjer ( ; November 22, 1905 in Newtown, Ohio – November 5, 1972) was an American geologist and dinosaur hunter. Assisting Barnum Brown, he co-described Pachycephalosaurus and what is now Montanoceratops. Other discoveries include Miotapirus and a new species of Mesohippus.
Schlaikjer attended Harvard University, where he graduated with a bachelor's degree in 1929. He received master’s and doctoral degrees from Columbia University in 1931 and in 1935, respectively.
Honors
Selected highlights of honors:
Parmentier Scholar, Harvard University 1924 to 1925.
University Fellow, Columbia University, 1931 to 1932.
Cressy Morrison Prize, New York Academy of Science, 1939.
Fellow of The Geological Society of America, 1939.
Fellow of the Paleontological Society of America, 1940.
Fellow of the American Association for the Advancement of Science.
Who’s Who in America, 1949 Supplement, 1950 edition to date.
Publications
Schlaikjer EM. (1931) Description of a new Mesohippus from the White River formation of South Dakota: New England Zool. Club Proc., 12, pp35–36.
Schlaikjer EM. (1932) The osteology of Mesohippus barbouri: Mus. Comp. Zool. Bull., 72, pp391–410.
Brown B, Schlaikjer EM. (1937) The skeleton of Styracosaurus with the description of a new species: Am. Mus. Novitates. 955 p1-12.
External links
Erich Maren Schlaikjer website family website
References
20th-century American geologists
American paleontologists
1905 births
1972 deaths
Harvard University alumni
Columbia University alumni |
```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
``` |
Mauesia cornuta is a species of beetle in the family Cerambycidae. It was described by Lane in 1956. It is known from French Guiana and Brazil.
References
Mauesiini
Beetles described in 1956 |
Sancourt may refer to the following communes in France:
Sancourt, Eure, in the Eure département
Sancourt, Nord, in the Nord département
Sancourt, Somme, in the Somme département |
Stefano Vukov (born 27 March 1987) is a Croatian tennis coach and former player. He has coached Women's Tennis Association (WTA) player Elena Rybakina since 2019.
Early life and playing career
Vukov was born in Rijeka, Croatia in 1987. His mother is a dentist and his father is a software engineer. He started playing tennis at age 12, but his family prioritized education, so he graduated from college while continuing to aspire to professional tennis. Vukov played mostly on the ITF Futures Circuit, reaching a career-high Association of Tennis Professionals (ATP) ranking of No. 1122 in 2007, and retired from playing in 2009. A couple years after that, he began to professionally coach at a tennis facility in Florida, working with future WTA Tour players such as Sachia Vickery, Renata Zarazúa, and Anhelina Kalinina.
Coaching career
In February 2019, Elena Rybakina, then ranked just within the WTA's top 200, hired Vukov to replace Moscow-based coach Andrei Chesnokov as her first traveling coach. Rybakina credited Vukov, known for his analytic expertise, with helping to improve her game; she rose quickly through the rankings, cracking the top 30 and winning her first two WTA Tour titles by early the next year. After Rybakina won her first major title at the 2022 Wimbledon Championships, Vukov followed through on a two-year-old bet to get a tattoo of Rybakina's name if she ever won Wimbledon.
Vukov's "frantic and intense" style of on-court coaching of the typically stoical Rybakina has drawn attention. Vukov has said he "know[s] very well how to get Elena angry" to energize her and how to help her tactically focus, with a mutual understanding "to push her even when she does not want to be pushed", but recognizes that to outsiders it can seem like "too much". During Rybakina's run at the 2023 Australian Open, where she eventually lost in the final to Aryna Sabalenka, Vukov attracted public criticism for his seemingly harsh midmatch comments from the player's box. In a social media post, Rybakina defended Vukov, saying that their relationship remains positive and that she appreciates his input.
References
External links
1987 births
Living people
Sportspeople from Rijeka
Croatian male tennis players
Croatian tennis coaches |
```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()
}
}
``` |
Euglandina binneyana is a species of large predatory air-breathing land snail, a terrestrial pulmonate gastropod mollusk in the family Spiraxidae.
References
Spiraxidae
Gastropods described in 1845 |
The Battle of Rarańcza was fought between Polish Legionnaires, and Austria-Hungary, from February 15 to 16, 1918, near Rarańcza in Bukovina, and ended with a Polish victory.
Background
The Brest-Litovsk Treaty, which was being negotiated on February 9, 1918, did not appear to benefit the idea of a nation state for Poland. This treaty, signed between the Central Powers (including Austria-Hungary) and the Ukrainian People's Republic on February 9, 1918, transferred the province of Chełm to the Ukrainian state. Poles, meanwhile, believed that the town of Chełm and surrounding lands should be under Polish control.
The Polish forces, part of the Austro-Hungarian Army stationed on the border of Bessarabia, were increasingly restless. They were relatively spread out throughout the region over a frontline 250 km in length. They consisted of the Polish Auxiliary Corps (known as the II Brigade of Polish Legionnaires up till the recent oath crisis), as well as some additional Polish units. The Poles, having received the information about the treaty on February 12, and expecting, in the aftermath of the treaty further weakening of the Polish units, decided on the February 14 to join forces with the Polish First Army Corps in Russia by crossing the Austrian-Russian front lines. Only a few, including general Zygmunt Zieliński, proposed taking no action, however even Zieliński unofficially supported the mutiny.
Battle
Polish units, mostly the 2nd and 3rd Regiment under the command of Józef Haller de Hallenburg, attempted to break through the Austrian lines on February 15 to 16, 1918. Austrian forces were ordered to stop them, and fighting ensued in several places (while in others Austrian units withdrew). The main Polish units broke through the Austro-Hungarian Army near a town called Rarańcza, located in Bukovina, but the rear units with wagons were stopped by an armored train, and eventually disarmed and arrested.
Aftermath
The Legionnaires won the battle, but estimates of their losses vary: according to historian Jerzy Lerski they suffered "great losses", but Gawlik states there were only 16 casualties, while over 900 soldiers of the Auxiliary Corps and other Polish soldiers from other formations - about 4,000 total - were arrested). 86 officers and NCOs were later put to trial by the Austro-Hungarian government, but Charles I of Austria-Hungary ordered the trial to be stopped, and a few weeks later Austria-Hungary was no more.
Some (according to Gawlik, about 1,600) of Haller's troops were able to make it through the front lines into already abandoned Russian trenches, and on March 5 were absorbed into the Polish Second Corps, whilst many were captured and imprisoned by the Austrians. The remaining troops under general Haller would be defeated in May by the Germans in the battle of Kaniów.
Footnotes
References
Conflicts in 1918
Battles of the Eastern Front (World War I)
Battles of World War I involving Austria-Hungary
Battles of World War I involving Poland
Polish Legions in World War I |
```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
``` |
Madhya Pradesh Congress Committee (MPCC) is the Pradesh Congress Committee (state wing) of the Indian National Congress (INC) serving in the state of Madhya Pradesh. It is responsible for organizing and coordinating the party's activities and campaigns within the state, as well as selecting candidates for local, state, and national elections Current President of MPCC is Kamal Nath.
Structure and composition
Madhya Pradesh Legislative Assembly election
List of state presidents
List of chief ministers
Electoral performance
Factions
Madhya Pradesh Vikas Congress was a faction in the Congress Party from 1996 to 1998. MPVC was founded by former aviation minister Madhavrao Scindia, after he was refused an INC ticket for the 1996 Lok Sabha elections.
Scindia won a seat as an MPVC candidate as a result of hard work & strong campaign led by his workers & followers who had also resigned from INC.
In 1998 MPVC merged into Indian National Congress.
See also
Indian National Congress
Congress Working Committee
All India Congress Committee
Pradesh Congress Committee
Madhya Pradesh Youth Congress
Notes
References
External links
Madhya Pradesh Congress Committee, Official website
Indian National Congress, Official website
Indian National Congress by state or union territory
Politics of Madhya Pradesh |
The year 1965 in architecture involved some significant architectural events and new buildings.
Events
Reconstruction of Skopje in Yugoslavia planned by Kenzō Tange and team.
Buildings and structures
Buildings opened
August 15 – Cathedral of Our Lady Assumed into Heaven and St Nicholas, Galway, Ireland, designed by John J. Robinson, is dedicated.
September – Toronto City Hall in Toronto, Ontario, Canada.
October 6
Skylon Tower in Niagara Falls, designed by B+H Architects.
Post Office Tower in London, UK, designed by Eric Bedford and G. R. Yeats and topped out in 1964, is officially opened by Prime Minister Harold Wilson.
October 28 – Gateway Arch (opened as Jefferson National Expansion Memorial) in St. Louis, Missouri, designed by Eero Saarinen.
November 19 – Arctic Cathedral, Tromsø, Norway, designed by Jan Inge Hovig, is dedicated.
December 28 – Museo de Arte de Ponce, Puerto Rico, designed by Edward Durell Stone.
Shalom Meir Tower in Tel-Aviv, Israel, designed by Yitzhak Pearlstein, Gideon Ziv and Meir Levy.
The first phase of the University of California, Irvine campus, designed by William Pereira.
The first phase of the University of California, Santa Cruz campus, designed by John Carl Warnecke.
Buildings completed
Akosombo Dam, Ghana.
Holyoke Center at Harvard University, Boston, United States, designed by Josep Lluís Sert.
Richard J. Daley Center in Chicago, United States, designed by Jacques Brownson of C. F. Murphy Associates.
NASA Vertical Assembly Building at Kennedy Space Center Launch Complex 39, Florida, United States.
Seinajoki Town Hall in Finland, designed by Alvar Aalto.
St Michael and All Angels Church, Woodchurch, Birkenhead, England, designed by Richard O'Mahony of F. X. Velarde Partners.
Nozema Zendstation, The Hague, Netherlands.
Elephant and Rhinoceros Pavilion, London Zoo, designed by Hugh Casson and Neville Conder.
Awards
Architecture Firm Award – Wurster, Bernardi & Emmons
RAIA Gold Medal – Osborn McCutcheon
RIBA Royal Gold Medal – Kenzo Tange
Births
April 13 – Patricio Pouchulu, Argentine architect
Diébédo Francis Kéré, Burkinabè architect
Monica Ponce de Leon, Venezuelan-born architect and educator
Kerstin Thompson, Australian architect
Deaths
January 11 – Florestano Di Fausto, Italian architect working around the Mediterranean (born 1890)
January 23 – Ingrid Wallberg, Swedish architect (born 1890)
May 10 – Karl Burman, Ukrainian-Estonian architect and painter (born 1882)
June 21 – Kay Fisker, Danish architect, designer and educator (born 1893)
August 6 – Donald McMorran, English neo-Georgian architect (born 1904)
August 27 – Le Corbusier (Charles Edouard Jeanneret), Swiss-French architect, designer, painter, urban planner and writer (born 1887)
September 13 – Louis Laybourne Smith, Australian architect and educator (born 1880)
November 30 – William Strudwick Arrasmith, American architect, designer of Greyhound bus stations (born 1898)
References
20th-century architecture |
On September 5, 1985, at 9:20 am member of the Delhi Metropolitan Council, close associate of Sanjay Gandhi, and Congress leader Arjun Dass was assassinated by 3 Sikhs in Delhi. The assassins were Harjinder Singh Jinda, Sukhdev Singh Sukha, and another member of Jinda's gang. They killed Dass in revenge for his role in the 1984 anti-Sikh riots. Along with Arjun Dass his bodyguard, a constable, was killed and 6 others were injured.
Background
Anti-Sikh riots
1984 anti-Sikh riots were a series of organized pogroms against Sikhs in India following the assassination of Indira Gandhi by her Sikh bodyguards. Government estimates project that about 2,800 Sikhs were killed in Delhi and 3,350 nationwide, whilst independent sources estimate the number of deaths at about 8,000–17,000.
Arjun Das was identified by eyewitnesses and human rights groups as leading mobs in the massacres. A mob led by him defecated on the Sikh holy book and living Guru, Guru Granth Sahib.
Hit-list
Harjinder Singh Jinda, and Sukhdev Singh Sukha soon after the riots created a hit list of politicians believed to be part of the violence. The names were H.K.L. Bhagat, Lalit Maken, Jagdish Tytler, Sajjan Kumar, Dharam Das Shastri, Jasbir Singh Jatt, Arjun Dass, and K.C. Pant.
Assassination of Lalit Maken
On July 31, 1985, Congress(I) Member of Parliament Lalit Maken was assassinated, when he was moving towards his car parked across the road from his house in Kirti Nagar, Delhi. Maken's wife Geetanjali and a visitor, Balkishan, were also caught in the firing and died. The assailants escaped on their scooters. Lalit Maken was considered to be involved in the killings of Sikhs during 1984 Anti-Sikh riots. In a 31-page booklet titled 'Who Are The Guilty', People's Union for Civil Liberties (PUCL) listed 227 people who led the mobs, which killed up to 18,000 Sikhs over three days. Lalit Maken's name was third on the list. The assassins were Harjinder Singh Jinda, and Sukhdev Singh Sukha.
Assassination
On September 5, 1985, Jinda, Sukha, and the other Singh made their way to Arjun Dass' auto parts shop which was in a crowded marketplace. Jinda and Sukha were on a stole scooter while Nimma was on a three-wheeler. They had removed all identifiers of the vehicles. Jinda had a .55 revolver. Sukha had a .38 revolver and the other had a 9mm stengun. Once they reached Dass' shop Jinda continued to sit on the scooter as the getaway driver. Sukha shot Dass' guard in the head killing him instantly. The other Singh shot another guard. Both then unloaded fire into Arjun Dass. In total, they fired 29 bullets. All of them quickly fled the scene. While fleeing the assassins yelled, "Long live Khalistan."
Aftermath
5 minutes after the killing, a police jeep was sent to the scene. After emergency treatment, Arjun Dass was pronounced dead at the All India Institute of Medical Science. Roadblocks were set up in Delhi and neighboring districts an hour after the killing. After the killing, the Home Ministry began plans to create anti-terrorist squads in key cities. Other politicians who led mobs in the anti-Sikh riots were provided security in reaction to Dass' killing. The homes of MP Jagdish Tytler, former MP Dharam Das Shastri, and Minister of Parliamentary Affairs H.K.L. Bhagat were given security from the Special Frontier Force. All 3 were named in the paper 'Who Are The Guilty'. More than 2,000 men with Stenguns, carbines and West German sub-machine guns and with 500 vehicles were assigned to guard individuals believed to be on the Sikh's hit-list. They were gathered from the Central Reserve Police Force, National Security Guard, Delhi Armed Police, Border Security Force, and Intelligence Bureau. Some were placed in the Very Very High Security Risk (VVHSR) category, such as Prime Minister Rajiv Gandhi, H.K.L. Bhagat, Jagdish Tytler. The latter 2 were named in 'Who Are The Guilty'. In another category named Very High Security Risk (VHSR) 2 involved in the riots were given security. Them being former MP Sajjan Kumar, and Dharam Das Shastri.
References
1984 anti-Sikh riots
1985 mass shootings in Asia
Mass shootings in India
September 1985 events in Asia
1985 murders in India
Khalistan movement |
Frank Lopes Jr. (born December 22, 1994), known professionally as Hobo Johnson, is an American vocalist and frontman of Hobo Johnson & the LoveMakers.
Early life
Lopes is a Mexican/Portuguese-American from California. When he was 19, he was kicked out of his house by his father and subsequently lived in his car. For a stretch of time, Lopes worked at a pizza restaurant in Sacramento, but he soon quit to pursue his passion for music. He is a fan of the Sacramento Kings and has referenced them in the lyrics to his song "Sacramento Kings Anthem (We're Not That Bad)", written about the struggles the Kings have in the NBA.
Music career
Early work and The Rise of Hobo Johnson (2015–2017)
At age 15, Lopes began performing music and hip-hop. He came up with his stage name "Homeless Johnson" but soon made it "Hobo Johnson" while living in his car, a 1994 Toyota Corolla, and named his 2015 debut album in honor of his car. Starting in December 2016, he released a series of live recordings on YouTube subtitled "Live from Oak Park".
In 2016, he released the album The Rise of Hobo Johnson independently, but later created a new version of the album in 2017 which had changes to the production and a different tracklist. After the release of the second version of "The Rise Of Hobo Johnson", Lopes signed to Reprise Records. That year, he won four Sacramento Area Music Awards: Artist of the Year, Best Hip-Hop/Rap, Best Emcee and Best New Artist.
Tiny Desk Concert, "Peach Scone", and The Fall of Hobo Johnson (2018–2019)
Hobo Johnson and the LoveMakers released a music video on Facebook as part of NPR's Tiny Desk Contest on March 7, 2018. The song "Peach Scone" collected millions of views in just a few weeks. Following the attention of the "Peach Scone" video, their album The Rise of Hobo Johnson charted at #11 on the Billboard Heatseekers Chart for the week ending March 31, 2018. At this time, Lopes also drew criticism from the Sacramento chapter of Black Lives Matter, who accused him of using Oak Park's name without consent and of cultural appropriation. On May 12, they staged a small protest that delayed the beginning of his sold-out show at Sacramento's Ace of Spades nightclub.
While not winning the Tiny Desk Contest, Hobo Johnson & the LoveMakers appeared on Tiny Desk on an episode released on September 12, 2018.
In 2018, the band toured North America and Europe and appeared at Australia's Falls Music & Arts Festival. In 2019, the band appeared at Bonnaroo Music and Arts Festival in Manchester, Tennessee.
In 2019 he released the singles "Typical Story" and "UglyKid" from the album The Fall of Hobo Johnson, which was released by Warner Records on September 13, 2019. That same day, EA Sports released the video game NHL 20, which featured the single "Typical Story" on its soundtrack.
The Revenge of Hobo Johnson, Hobo Johnson Alienates His Fanbase, and hiatus (2021–present)
Lopes released the single "I Want to See the World" in June, 2021. He announced that the album The Revenge of Hobo Johnson would follow later that month.
The Revenge of Hobo Johnson was subsequently released on June 23, 2021. On August 1, 2021 he released the album Hobo Johnson Alienates His Fanbase.
In 2022, Lopes canceled several upcoming tours and broke up the LoveMakers band, citing a focus on school over music.
In 2023, Lopes began performing shows again and released a new song on Instagram and YouTube, titled Sacramento 12 Step.
Hobo Johnson & the LoveMakers
Current members
Frank Lopes Jr. – lead vocals, guitar, keyboards, production
Derek Lynch – guitar
Jordan Moore – guitar, keyboards
David Baez-Lopez – bass guitar
Ben Lerch – drums
Jmsey – keyboard, guitar
Discography
Studio albums
Singles
Music videos
As a featured artist
References
External links
Rappers from Sacramento, California
West Coast hip hop musicians
Living people
American rappers of Mexican descent
American musicians of Portuguese descent
21st-century American rappers
1994 births
Reprise Records artists
Warner Records artists
People from Loomis, California |
```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>
``` |
The Oratory of Saint Lawrence () is a Baroque oratory of Palermo. It is located near the Basilica of Saint Francis of Assisi, in the quarter of the Kalsa, within the historic centre of Palermo.
The oratory was built in 1569 to replace a former smaller church dedicated to St Lawrence. Construction was funded by a confraternity of mainly Genovese merchants, and linked to Conventual Franciscans. In 1699-1706, Giacomo Serpotta realized a sumptuous stucco decoration, depicting the life of St Francis.
The oratory is particularly famous because of the masterpiece altarpiece Nativity with St. Francis and St. Lawrence (1600 or 1609) by Caravaggio. This important painting was stolen, probably by Cosa Nostra, on October 18, 1969. It has never been recovered. In 2015 a hi-tech replica of the altarpiece was placed inside the oratory.
References
Lorenzo
Baroque architecture in Palermo
16th-century Roman Catholic church buildings in Italy |
```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;
``` |
William H. Reid is an American forensic psychiatrist based in Texas. Reid has given expert witness testimony on several high-profile legal cases and has contributed to various academic publications.
Early life
Reid graduated with a B.A. in psychology in 1966 and completed his M.D. medical degree in 1970, both at the University of Minnesota. He undertook a psychiatric residency at the University of California, Davis, between 1970 and 1975, interrupted for military service. He then obtained a Master of Public Health (M.P.H) qualification from the University of California, Berkeley in 1975.
Career
Reid is a professor at Texas Tech University Health Sciences Center, the Texas A&M College of Medicine, and the University of Texas Dell Medical School. He was the Medical Director of the Texas Department of Mental Health and Mental Retardation from 1989 to 1996. He has authored or co-authored over 300 publications and abstracts, and 17 books.
For the 2015 trial of James Holmes for the 2012 Aurora, Colorado shooting, Reid reported around 300 hours of preparation and conducted 22 hours of interviews which were shown in their entirety to the jury. He reportedly was paid $500,000. He nearly caused a mistrial by immediately openly opining that Holmes met the legal standard of sanity. The BBC in 2017 reported that Reid had told them the shooting "was completely unrelated to the medication. For me, it was a result of mental illness."
In 2005 Reid supported psychiatrist Park Dietz over false testimony that had contributed to a guilty verdict and a possible execution of Andrea Yates. Dietz had testified that Yates got the idea of drowning children and claiming postpartum psychosis from a recent episode of Law and Order, a TV show Dietz had consulted on, but later admitted such an episode didn't exist and that Yates hadn't told him she watched the show. Reid called it an 'accident' and 'off-the-cuff answer' that shouldn't affect Dietz's credibility, blaming the prosecutor for exploiting it.
In 2001 Reid reported on statistics resulting from a law in Texas that all deaths within two weeks of Electroconvulsive therapy be reported to the department of mental health and retardation; the article concluded that "The mortality rate associated with ECT (less than two per 100,000 treatments) in Texas is extremely low" and opposed the reporting of deaths within two weeks. A 2010 British study reported the Reid article as concluding that suicides after ECT were unrelated to the ECT, but were themselves "unable to determine whether ECT suicides occurred due to relapse or to the receipt of ECT".
In 1999 Reid published an informal survey of psychiatrists who had personally, or knew of relatives who had personally, undergone electroconvulsive therapy. Reid reported in abstract that based on the psychiatrists' informal perceptions, "Almost all patients had moderate to excellent improvement" while clarifying in the full text that this was "sometimes with lasting relief". Reid alleged that later limited availability of ECT contributed to two suicides.
In 1998 Reid, along with an economist from Novartis pharmaceutical company, reported a significantly lower rate of suicides in patients prescribed clozapine. Yale professor of psychiatry Michael Sernyak and others have critiqued the statistical comparison for excluding suicides by people who had discontinued clozapine, a factor potentially linked to suicide, as well as not systematically establishing the basic demographic equivalence of the groups.
References
Living people
American forensic psychiatrists
Texas Tech University faculty
University of Minnesota College of Liberal Arts alumni
Year of birth missing (living people)
University of Minnesota Medical School alumni |
is a city located in Aichi Prefecture, Japan. , the city had an estimated population of 44,589 in 18,185 households and a population density of 910 persons per km². The total area of the city is . The between of the border, and neighboring town of Kanie.
Geography
Yatomi is located in the coastal flatlands of far western Aichi Prefecture, bordering Mie Prefecture on the west. It has a short coastline with Mikawa Bay on the Pacific Ocean to the southeast.
Climate
The city has a climate characterized by hot and humid summers, and relatively mild winters (Köppen climate classification Cfa). The average annual temperature in Yatomi is 15.6 °C. The average annual rainfall is 1677 mm with September as the wettest month. The temperatures are highest on average in August, at around 27.7 °C, and lowest in January, at around 4.5 °C.
Demographics
Per Japanese census data, the population of Yatomi has grown steadily over the past 60 years.
Surrounding municipalities
Aichi Prefecture
Aisai
Kanie
Tobishima
Mie Prefecture
Kuwana
Kisosaki
History
Middle Ages
The area name of Yatomi appears in Kamakura period documents, as part of ancient Owari Province.
Early modern period
During the Edo period, the area was noted for raising ornamental goldfish.
Late modern period
During the Meiji period, the area was organized into villages under Kasai District, Aichi Prefecture, with the establishment of the modern municipalities system.
Kasai District later became Ama District, Aichi.
Yatomi was proclaimed a town on August 26, 1903.
Contemporary history
The Isewan Typhoon of September 26, 1959, created extensive damage to the area.
Efforts to merge Yatomi with the neighboring town of Kanie failed in 2004 over a dispute on the naming of the new entity.
The city of Yatomi was founded on April 1, 2006, from the merger between the former town of Yatomi, absorbing the village of Jūshiyama (both from Ama District).
Government
Yatomi has a mayor-council form of government with a directly elected mayor and a unicameral city legislature of 16 members. The city contributes two members to the Aichi Prefectural Assembly. In terms of national politics, the city is part of Aichi District 9 of the lower house of the Diet of Japan.
External relations
Twin towns – Sister cities
National
Disaster Alliance city
Urayasu (Chiba Prefecture, Kantō region)
since September 27, 2012
Education
Schools
Yatomi has eight public elementary schools and three public junior high schools operated by the city government, and one public high school operated by the Aichi Prefectural Board of Education. There is also one private high school.
Economy
Yatomi is a regional commercial center, and is noted for hothouse agriculture. Main agricultural products include rice, wheat, lettuce, tomatoes, and carnations.
Transportation
Railways
Conventional lines
Central Japan Railway Company
Kansai Main Line: - -
Kintetsu
Nagoya Line: - -
Meitetsu
Bisai Line: – -
Roads
Expressways
Higashi-Meihan Expressway
Isewangan Expressway
Japan National Route
Seaways
Seaport
Port of Nagoya
Nabeta wharf
Notable people from Yatomi
Ōnishiki Daigorō, Sumo Wrestler
Umanosuke Ueda, professional wrestler and sports commentator
Local attractions
Nagoya Racecourse
Parks
Tatsuta polder sluice gates
Yatomi Wild Bird Sanctuary
Mitsumata-pond park
References
External links
Cities in Aichi Prefecture
Populated coastal places in Japan
Yatomi, Aichi |
Red cooking, also called Chinese stewing, red stewing, red braising, or flavor potting, is a slow braising Chinese cooking technique that imparts a reddish-brown coloration to the prepared food. Red cooking is popular throughout most of northern, eastern, and southeastern China.
There are two types of red cooking:
Hongshao (): can be done in less than 20 minutes and usually does not require much water
Lu (): usually requires prolonged cooking of up to several hours and the items must be submerged in the cooking liquid.
Types
Soy sauce (usually a mix of light and dark soy sauce), fermented bean paste, red fermented tofu or rock sugar is commonly used to both flavor and impart a reddish brown hue to the items being cooked. Food coloring is sometimes added for a more intense red coloration. Both lu and hongshao are forms of stewing or braising characterized by usage of soy sauce, Chinese rice wine (Shaoxing wine, huangjiu etc.) and rock sugar. Whole spices (star anise, black cardamom (caoguo), cassia, and/or fennel seeds) or five-spice powder are crucial elements in these dishes but are used in moderation so that their flavors do not overwhelm the main ingredients.
Red-cooked stews may be heavy in meat content or contain a variety of meats, vegetables, and hard-boiled eggs. Such dishes may be served hot or cold, and the sauce or stock is often reused as master stock.
See also
Ah-so sauce
Char siu
Fujian cuisine
Hunan cuisine
Jiangsu cuisine
Kho (cooking technique)
List of cooking techniques
Shanghai cuisine
Zhejiang cuisine
References
Charmaine Solomon's Encyclopedia of Asian Food, Charmaine Solomon, 1998, Tuttle,
Chinese Cooking for Dummies, Martin Yan, 2000, For Dummies,
Martin Yan's Invitation to Chinese Cooking, Martin Yan, 2000, Bay Books,
Xiandai Hanyu Cidian (Modern Chinese Dictionary), Shang Wu Press, Beijing, 1996,
External links
Article describing red cooking
Chinese cooking techniques
Chinese soups and stews |
Bennett is a town in Douglas County, Wisconsin, United States. The population was 597 at the 2010 census. The unincorporated communities of Beebe and Bennett are located in the town.
History
The town takes its name from Richard Bennett, an area settler from the 1880s.
Transportation
U.S. Highway 53, County Road L, and County Road E are three of the main routes in the town.
Geography
According to the United States Census Bureau, the town has a total area of 48.3 square miles (125.1 km2), of which, 47.5 square miles (123.1 km2) of it is land and 0.8 square miles (2.0 km2) of it (1.59%) is water.
Demographics
As of the census of 2000, there were 622 people, 224 households, and 174 families residing in the town. The population density was 13.1 people per square mile (5.1/km2). There were 297 housing units at an average density of 6.2 per square mile (2.4/km2). The racial makeup of the town was 98.07% White, 1.13% Native American, 0.32% Asian, and 0.48% from two or more races. Hispanic or Latino of any race were 0.96% of the population.
There were 224 households, out of which 38.8% had children under the age of 18 living with them, 69.2% were married couples living together, 4.5% had a female householder with no husband present, and 22.3% were non-families. 18.8% of all households were made up of individuals, and 8.5% had someone living alone who was 65 years of age or older. The average household size was 2.78 and the average family size was 3.18.
In the town, the population was spread out, with 30.4% under the age of 18, 5.8% from 18 to 24, 27.5% from 25 to 44, 24.8% from 45 to 64, and 11.6% who were 65 years of age or older. The median age was 37 years. For every 100 females, there were 105.3 males. For every 100 females age 18 and over, there were 107.2 males.
The median income for a household in the town was $40,313, and the median income for a family was $49,063. Males had a median income of $31,667 versus $22,344 for females. The per capita income for the town was $18,335. About 4.6% of families and 7.7% of the population were below the poverty line, including 10.6% of those under age 18 and none of those age 65 or over.
References
External links
Town of Bennett – Official Website
Towns in Douglas County, Wisconsin
Towns in Wisconsin |
Severe Tropical Storm Sam, also known in the Philippines as Tropical Storm Luding, was a relatively strong storm that formed in August 1999. It brought severe impacts to the Philippines and southeastern China, causing 20 deaths.
Meteorological history
On August 17, an area of circulation within the monsoon trough located in the Philippine Sea became more organized and the JTWC issued a TCFA. The developing cyclone slowly moved to the northwest, becoming Tropical Depression 16W nine hours after the TCFA was first issued. As the cyclone continued to intensify, it was named Sam on August 19. Around this time, the subtropical ridge to Sam's north shifted its track in a westwards direction towards Luzon. The storm passed over the north of the island on August 20 and entered the South China Sea, reaching typhoon strength the next day. Sam gradually intensified further as it approached the Chinese coast and it made landfall about to the northeast of Hong Kong at its peak with 140 km/h (85 mph) winds on August 22. Sam continued to move to the northwest over China dissipating about 24 hours later. PAGASA named the developing storm Luding shortly before the JTWC began to issue advisories.
Impact
Typhoon Sam was responsible for seven deaths in the Philippines. In addition, flooding from its rainfall displaced over 4000 people, and many major roads were closed due to landslides near Baguio. Sam became the wettest tropical cyclone to affect Hong Kong since records began in 1884, dropping over 616 mm (24.2 inches) of rain, exceeding the previous record set in 1926. Peak sustained winds of 96 km/h (60 mph) were recorded on Waglan Island as the typhoon passed over the territory. The heavy rain led to many instances of flooding and over 150 landslides throughout Hong Kong, killing 1 person and forcing the evacuation of about 1,000. A total of 328 people were injured in various incidents relating to the storm, and total losses in Hong Kong totaled to approximately $17 million. In addition to the direct casualties from the storm, China Airlines Flight 642, using an MD-11 aircraft, crashed while attempting to land at Hong Kong International Airport, killing three on board and injuring 219. At the time of the crash wind gusts in excess of 65 km/h (40 mph) were recorded at the airport. After moving into China, Sam killed at least 17 and injured 100 people in Guangdong. Direct economic losses in the province were about $18 million.
See also
Other storms with the same name
References
Sam
Typhoons in Hong Kong
1999 in Hong Kong |
Joy Hodges (born Frances Eloise Hodges; January 29, 1915January 19, 2003) was an American singer and actress who performed on radio, on film, on Broadway, and with big bands.
Early years
Frances Eloise Hodges was born in Des Moines, Iowa, on January 29, 1915, the daughter of postal worker Verne Hodges and his wife. She was educated at Wallace Elementary, Amos Hiatt Junior High, and East High schools. By the time she was 11 years old, she and friend Ardis Olson had formed the Bluebird Twins singing duo, performing on radio station WHO and in local venues. In high school, Betty Illen joined them to form the Crooning Coeds trio.
Career
Winning a contest at a theater took Hodges to Chicago, where her national career began. From there, she traversed the United States, singing on the radio, in night clubs, with orchestras, and in Chautauqua programs. She performed at the Empire Room and the Hotel Sherman, both in Chicago. One of her early jobs was being the lead singer with Carol Loftner and his orchestra. She also sang with Ted Fio Rito, Ben Bernie, Jimmy Grier, Ozzie Nelson, and Abe Lyman and their orchestras, among others.
Hodges' Broadway credits include Nellie Bly (1945), The Odds on Mrs. Oakley (1944), Dream with Music (1943), and I'd Rather Be Right (1937). In 1972, she replaced Ruby Keeler in the revival of No, No, Nanette on Broadway. Perhaps the most memorable of Hodges' Broadway performances was singing "Have You Met Miss Jones?" in I'd Rather Be Right. She later said, "I became the toast of Broadway and sang the most recognizable song in America at that time — everyone adored Miss Jones."
Her screen debut came in a short, A Night at the Biltmore Bowl, for RKO Pictures, and her first film, after signing with RKO for five years, was Old Man Rhythm (1935). She also made soundies (musical short films) in addition to regular films.
During World War II, Hodges sang with Harry James and his orchestra as they entertained military personnel on USO tours in Europe.
On old-time radio, Hodges was the female singer on The Joe Penner Show on CBS beginning in October 1936. She left that program to make her stage debut in I'd Rather Be Right in November 1937. In 1944, she filled in for Arlene Francis as host of the radio version of Blind Date when it was broadcast from Detroit. She also sang and was co-host, with Durward Kirby, on Honeymoon in New York on NBC in 1946.
Personal life
Reagan friendship
Hodges and Ronald Reagan had a friendship that lasted six decades, beginning when both of them worked at radio station WHO in Des Moines, Iowa, where she sang and he was an announcer and sportscaster. In 1937, Hodges helped Reagan obtain an interview with an agent, which led to Reagan's receiving a contract from Warner Bros. film studio. Hodges and Reagan also appeared with others in vaudeville shows in the late 1930s. Hodges' obituary in The New York Times noted, "Mr. Reagan kept in touch with Miss Hodges for 60 years, and invited her to the White House when he was president."
Marriage
In 1935, while Hodges had a contract with Universal Studios, she was insured by Lloyd's of London with a policy that guaranteed her at least $125,000 per year for three years as long as she did not marry during that period. Although she did not wed during that span, she collected nothing because she earned more than the guaranteed amount.
Hodges married Gilbert H. Doorly, a newspaper editor, in Des Moines, Iowa, on September 2, 1939. They had no children and divorced in 1941. On April 24, 1942, she married Paul Dudley Helmund, a radio producer and writer, and that marriage ended in divorce in 1952. Her third marriage, in 1955, was to Eugene Scheiss. He died in 1990.
Death
On January 19, 2003, Hodges died at age 88 in Palm Desert, California, of complications following a stroke. She was buried in the Masonic Cemetery in Des Moines.
Partial filmography
Films
Old Man Rhythm (1935)
To Beat the Band (1935)
Follow the Fleet (1936)
Special Agent K-7 (1937)
Service de Luxe (1938)
The Family Next Door
Unexpected Father (1939)
Laughing at Danger (1940)
Soundies
"Exactly Like You" (Soundies Distributing Corporation of America, Inc. Program 1047)
"Love Me a Little Little" (SDCA Program 1243)
"Row, Row, Row" (SDCA Program 1119)
"There I Go"(SDCA Program V-899)
"We Could Make Such Beautiful Music Together".
"Why Don't We Do This More Often?" (SDCA Program 1095)
References
External links
1915 births
2003 deaths
20th-century American actresses
20th-century American singers
20th-century American women singers
Actresses from Des Moines, Iowa
American film actresses
American musical theatre actresses
American stage actresses
American television actresses
California Republicans
Iowa Republicans
21st-century American women
American radio personalities |
The 2000 Toray Pan Pacific Open was a women's tennis tournament played on indoor carpet courts. It was the 17th edition of the Toray Pan Pacific Open, and was part of the Tier I Series of the 2000 WTA Tour. It took place at the Tokyo Metropolitan Gymnasium in Tokyo, Japan, from January 29 through February 6, 2000. First-seeded Martina Hingis won the singles title and earned $166,000 first-prize money.
Finals
Singles
Martina Hingis defeated Sandrine Testud 6–3, 7–5
It was Hingis' 1st singles title of the year and the 27th of her career.
Doubles
Martina Hingis / Mary Pierce defeated Alexandra Fusai / Nathalie Tauziat 6–4, 6–1
External links
Official website
ITF tournament edition details
Tournament draws
Toray Pan Pacific Open
Pan Pacific Open
Toray Pan Pacific Open
Toray Pan Pacific Open
Toray Pan Pacific Open
Toray Pan Pacific Open |
Juraj Szikora (; 2 March 1947 – 12 December 2005) was a Slovak football player. He played for Czechoslovakia.
References
Profile at ČMFS official website
1945 births
2005 deaths
Hungarians in Slovakia
People from Nové Zámky District
Footballers from the Nitra Region
Czechoslovak men's footballers
Czechoslovakia men's international footballers
Slovak men's footballers
Slovak football managers
FK Inter Bratislava players
FC DAC 1904 Dunajská Streda players
FC Nitra managers
FC DAC 1904 Dunajská Streda managers
Men's association football forwards
Men's association football midfielders |
The Port Macquarie News and Hastings River Advocate was a weekly English language newspaper published in Port Macquarie, New South Wales, Australia.
History
First printed and published on 8 July 1882 by Alfred Edward Pountney, it was published from 1882 to 1950. The paper was circulated in the Bellinger, Nambucca, Macleay, Wilson, Camden Haven, and Manning Rivers, and throughout the whole of the Port Macquarie and Hastings River district.
Digitisation
The paper has been digitised as part of the Australian Newspapers Digitisation Program of the National Library of Australia.
External links
See also
List of newspapers in Australia
List of newspapers in New South Wales
References
Defunct newspapers published in New South Wales
Port Macquarie
Newspapers on Trove |
```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);
});
``` |
is a passenger railway station in the city of Abiko, Chiba Prefecture Japan, operated by the East Japan Railway Company (JR East).
Lines
Higashi-Abiko Station is served by the Abiko Branch Line of the Narita Line, and is located 3.4 kilometers from the terminus of branch line at Abiko Station.
Station layout
Higashi-Abiko Station has two parallel side platforms connected by a level crossing. There is no station building, and the station is unattended.
Platforms
History
Higashi-Abiko Station was opened on October 12, 1950 as a station on the Japan National Railways (JNR). The station was absorbed into the JR East network upon the privatization of the JNR on April 1, 1987.
Passenger statistics
In fiscal 2006, the station was used by an average of 729 passengers daily.
Surrounding area
Abiko Middle School
Abiko Post Office
See also
List of railway stations in Japan
References
External links
JR East station information
Railway stations in Japan opened in 1950
Railway stations in Chiba Prefecture
Narita Line
Abiko, Chiba |
Agyneta montana is a species of sheet weaver found in Ecuador. It was described by Millidge in 1991.
References
montana
Spiders described in 1991
Spiders of South America
Invertebrates of Ecuador |
Robert William Barker (December 12, 1923 – August 26, 2023) was an American media personality and animal rights advocate. He hosted CBS's The Price Is Right, the longest-running game show in North American television history, from 1972 to 2007. He also hosted Truth or Consequences from 1956 to 1975.
Born in Darrington, Washington, in modest circumstances, Barker spent most of his youth on the Rosebud Indian Reservation and was a citizen of the Rosebud Sioux Tribe. He joined the United States Navy Reserve during World War II. Barker worked part-time in radio while attending college. In 1950, he moved to California to pursue a broadcasting career. He was given his own radio show, The Bob Barker Show, which ran for six years. He began his game show career in 1956, hosting Truth or Consequences.
Barker began hosting The Price Is Right in 1972. He became an advocate for animal rights and of animal rights activism, supporting groups such as the United Activists for Animal Rights, People for the Ethical Treatment of Animals, and the Sea Shepherd Conservation Society. In 2007, Barker retired from hosting The Price Is Right after celebrating his 50-year career on television. Regarded as a pop culture icon, he continued to make occasional appearances for several years into his retirement until 2015.
Early life
Barker was born in Darrington, Washington, and spent most of his youth on the Rosebud Indian Reservation in Mission, South Dakota. The U.S. Indian Census Rolls, 1885–1940, list Barker as a citizen of the Rosebud Sioux Tribe, which the tribe publicly confirmed. His mother, Matilda ("Tillie") Valandra (née Matilda Kent Tarleton), was a schoolteacher; his father, Byron John Barker, was the foreman on the electrical high line through the state of Washington. As Barker's father was one-quarter Sioux, and his mother non-Native, Barker was one-eighth Sioux. Barker attended the grade school on the Rosebud Reservation where his mother was a teacher. He once said, "I've always bragged about being part Indian, because they are a people to be proud of. And the Sioux were the greatest warriors of them all."
Barker met his future wife, Dorothy Jo Gideon, at an Ella Fitzgerald concert while he was attending high school in Missouri; they began dating when he was 15. He attended Drury College (now Drury University) in Springfield, Missouri, on a basketball athletic scholarship. He was a member of the Epsilon Beta chapter of Sigma Nu fraternity at Drury. He joined the United States Navy Reserve in 1943 during World War II to train as a fighter pilot, but did not serve in combat. On January 12, 1945, while on leave from the military, he married Dorothy Jo. After the war, he returned to Drury to finish his education, graduating summa cum laude with a degree in economics.
Career
Broadcasting
While attending college in Drury, Barker worked his first media job at KTTS-FM Radio in Springfield. He and his wife left Springfield and moved to Lake Worth Beach, Florida, and he was news editor and announcer at nearby WWPG 1340 AM in Palm Beach (now WPBR in Lantana). In 1950, he moved to California to advance his broadcasting career. He was given his own radio show, The Bob Barker Show, which ran for the next six years from Burbank. He was hosting an audience-participation radio show on KNX (AM) in Los Angeles when game show producer Ralph Edwards, who was looking for a new host to replace Jack Bailey on the daytime-television version of his long-running show, Truth or Consequences, happened to be listening and liked Barker's voice and style.
Game shows
Truth or Consequences (1956–1975)
Barker started hosting Truth or Consequences on December 31, 1956, and continued with the program until 1975.
The Price Is Right (1972–2007)
In early 1972, Mark Goodson and Bill Todman began shopping a modernized revival of The Price Is Right to stations, with Dennis James as host. CBS expressed interest in the series, on one condition: instead of James, Barker would be installed as host. After some initial resistance, Barker instead offered to host another upcoming CBS game show, Jack Barry's The Joker's Wild (which had difficulty finding a host and was scheduled to debut the same day as Price) to allow James to host Price, but CBS rejected this proposal.
On September 4, 1972, Barker began hosting the CBS revival of The Price Is Right.
On October 15, 1987, Barker did what other MCs almost never did then: he stopped using hair dye and let his hair go gray, its natural color by that time.
Barker announced on October 31, 2006, that he would retire from The Price Is Right in June 2007. He taped his final episode on June 6, 2007, with the show airing twice on June 15.
On October 15, 2007, Drew Carey took over hosting duties on the show.
After his retirement, Barker made three return appearances to The Price is Right. He first appeared on the episode that aired on April 16, 2009, to promote his new autobiography, Priceless Memories. He appeared in the Showcase round at the end of the show. Barker made another guest appearance on the show to celebrate his 90th birthday, which aired on December 12, 2013. He announced a contestant for the first time ever on the show, along with one showcase. Barker's last appearance was a surprise appearance on April 1, 2015, for an April Fools' Day switch where he took Carey's place at the show's intro. He hosted the first bid and pricing game of that day before handing the hosting duties back to Carey and later appeared during the showcase.
Personal life
Barker was married to Dorothy Jo Gideon from 1945 until her death from lung cancer at age 57 in 1981. From 1983 until his death, he was in a long-term relationship with Nancy Burnet, an admitted "radical" animal rights activist nearly 20 years younger than Barker. By mutual decision, Barker and Burnet were never married and lived in separate residences throughout their relationship. He had no children with either woman, stating that he had seen his friends who had poor relationships with their children and felt that he was too busy to properly raise a child; as of 2007, he stated that he had no regrets about his decision. From the late 2000s onward, Burnet described the relationship as a platonic friendship, even as Barker had become more interested in remarrying; she recalled a 2011 incident where Barker drafted a prenuptial agreement for her lawyer to review and revise as she felt fit, which she refused. Burnet managed Barker's health and diet in retirement.
Animal rights
Barker was a vegetarian. In 1982, Barker began ending The Price Is Right episodes with the phrase: "This is Bob Barker reminding you to help control the pet populationhave your pets spayed or neutered." Though Barker had already been dabbling in animal rights before meeting Burnet, his efforts became more aggressive during his relationship with her.
In 1987, Barker requested the removal of fur prizes for the Miss USA pageant and stepped down as host when the producers refused. In 1989, Barker and United Activists for Animal Rights publicly accused several media projects and the American Humane Association of animal mistreatment and condoning animal mistreatment, a tactic which for libel, slander, and invasion of privacy. The suit was finally settled by the insurer in 1994.
Barker founded DJ&T Foundation in 1994, named after his late wife and mother, which has contributed millions of dollars to animal-neutering programs and funded animal rescue and park facilities all over the United States. In 2004, Barker donated $1 million (equivalent to $ million in ) to Columbia Law School to support the study of animal rights.
In 2009, Barker wrote a letter about three businesses in Cherokee, North Carolina, asking them to close their bear exhibits. He threatened to not attend the 2009 Game Show Awards, where he was to receive a lifetime achievement award, because Betty White would be attending. Although he had previously worked with White, he was feuding with her over the treatment of an elephant at the Los Angeles Zoo. White instead did not attend and pre-recorded her comments that she was scheduled to make about another awardee, Mark Goodson. Also that year, Barker donated $1 million (equivalent to $1.4 million in 2021) to the University of Virginia Law School to support the study of animal rights. He made similar donations to Harvard Law School, Stanford Law School, Georgetown University Law Center, Duke University School of Law, Northwestern University Pritzker School of Law, and University of California, Los Angeles.
In 2010, the Sea Shepherd Conservation Society announced that it had purchased and outfitted a ship to interdict Japanese whaling operations in the Southern Ocean using $5 million (equivalent to $ million in ) provided by Barker. The ship was then named the MY Bob Barker, and its existence was first revealed when it helped discover the location of the Japanese whaling fleet.
Barker participated in several PETA public service announcements over the years, including one that claimed that vegan diets prevent Alzheimer's disease. In 2010, he donated $2.5 million (equivalent to $ million in ) toward the purchase of office space for the organization in Los Angeles. The Bob Barker Building opened in 2012.
Lawsuits
In 1994, former model Dian Parkinson filed a lawsuit against Barker alleging sexual harassment following a three-year affair while working on The Price Is Right. Parkinson, who alleged that she was extorted by threats of firing, later dropped her lawsuit, claiming the stress from the ordeal was damaging her health.
In 1995, model Holly Hallstrom left The Price Is Right and later filed suit against Barker, alleging that the reason she was fired was not so much because of her medication-mediated weight gain (as documented) but because, to Barker's displeasure, she refused to give false information to the media regarding Parkinson's suit, as she alleges Barker had requested she do. Barker countersued for slander, but Hallstrom prevailed, receiving a settlement in 2005.
In October 2007, Deborah Curling, a CBS employee assigned to The Price Is Right, filed a lawsuit against CBS, Bob Barker, and The Price Is Right producers, claiming that she was forced to quit her job after testifying against Barker in a wrongful-termination lawsuit brought by a previous show producer. Curling claimed that she was demoted to an "intolerable work environment" backstage, which caused her to leave the job. Curling, who is black, also alleged that the show's producers, including Barker, created a hostile work environment in which black employees and contestants were discriminated against. A few months later, Barker was removed from the lawsuit, and in September 2009, the lawsuit was dismissed. Curling's attorney stated that he planned to appeal the dismissal of the lawsuit. In January 2012, the California Court of Appeals affirmed the dismissal.
Health and death
On September 16, 1999, Barker was in Washington, D.C., to testify before Congress regarding proposed legislation that would ban captive elephants from traveling shows, such as circuses. While preparing for the presentation, Barker experienced what he called clumsiness in his right hand. He was admitted to George Washington University Hospital and diagnosed with a partially blocked left carotid artery. Barker underwent carotid endarterectomy to remove the blockage. The procedure went well enough that he was able to return to work within the month.
Three years later, Barker had two additional health crises after taping the 30th-season finale of The Price is Right. While lying in the sun on May 30, 2002, he experienced a stroke and was hospitalized; six weeks later, on July 11, Barker underwent prostate surgery. Both hospitalizations occurred at George Washington University Hospital in Washington, D.C. Both surgeries were successful.
Barker had several mild bouts with skin cancer, a result of his frequent tanning. He consulted a dermatologist regularly to make sure any cancers were caught and removed before they spread; they did not pose a threat to his life. During a televised interview, Barker told viewers, "I urge anyone who has spent some time in the sun, whether you're doing it now or not, go to a dermatologist once a year."
On October 20, 2015, two police officers passing Barker's Los Angeles-area home saw him trip and fall on a sidewalk. They called an ambulance which took him to Cedars-Sinai Medical Center, where he received stitches for an injured forehead and was released; he also hurt his left knee.
Barker slipped and hit his head at home on June 19, 2017. His maid drove him to the emergency room, where he was checked and released. His representative said it was not as serious as his earlier fall. In October and November 2018, Barker was rushed to the hospital for severe back pain. Barker suffered another fall in January 2019, however he was not hospitalized.
Barker's last public interview was with People in August 2021, in which he discussed The Price Is Right's upcoming 50th season on air. As of 2022, Burnet stated that other than some non-prescription supplements such as collagen and a meal replacement drink to replenish nutrients not found naturally in his vegetarian diet, he took only one prescription medication for hypothyroidism.
Barker died at his home in Los Angeles on August 26, 2023, at the age of 99 following several years with Alzheimer's disease, a condition that Burnet and Barker's publicity team had kept hidden from the public. Hypertension, hyperlipidemia and hypothyroidism were listed as secondary causes of death. He was interred alongside his wife at Forest Lawn Memorial Park – Hollywood Hills.
Film and other TV appearances
Barker appeared on Bonanza, playing a character named Mort in the 1960 episode "Denver McKee".
Barker was a semi-regular panelist on the game shows Tattletales (1975–1976, with wife Dorothy Jo) and Match Game (1973–1980). Barker sat in Richard Dawson's former place during the first week of Dawson's permanent absence from Match Game.
In the 1970s, he was the host of the annual/biennial Pillsbury Bake-Off (the bake-off occurred every two years starting in 1976). In 1978, he was the first host to have a male category champ.
Barker co-hosted CBS's coverage of the Rose Parade from Pasadena, California, for several years during the 1970s and 1980s.
Barker appeared on various talk shows such as: Dinah!, Larry King Live, The Arsenio Hall Show, Crook & Chase, Donny & Marie, The Rosie O'Donnell Show, The Ellen DeGeneres Show, The Wayne Brady Show, the Late Show with David Letterman, and The Late Late Show with Craig Ferguson.
Barker also made cameo appearances on The Nanny and The Bold and the Beautiful, respectively in 1994 and 2002.
In 1996, Barker played himself in the Adam Sandler comedy Happy Gilmore. In one scene, Barker beats up Gilmore after an altercation arising from their teaming up in a Pro-Am Golf Tournament. In 2007, during a CBS prime-time special commemorating Barker's career, the fight scene from Happy Gilmore was shown, after which Sandler made a surprise appearance on stage to read a poem paying tribute to Barker. In 2015, during Comedy Central's "Night of Too Many Stars" benefit show to battle autism, Barker and Sandler reunited for a video featuring the two of them in a follow-up fight at the hospital, which ends with both of them dying and going to heaven.
About one year after his retirement from The Price Is Right, Barker appeared in a public service announcement promoting the transition to digital television in the United States. The advertisement was produced under the first proposed date of February 16, 2009, for the transition.
On September 7, 2009, Barker was a special guest host for WWE Raw (called "The Price is Raw") in Rosemont, Illinois. Aired during a period when nearly every episode of the weekly wrestling show featured a celebrity guest host, with mixed results, Barker's appearance has been ranked the best of nearly 80 hosts.
Barker agreed to be a rotating guest co-host on The Huckabee Show, a daily TV talk show hosted by Mike Huckabee. Barker first appeared on the show on July 29, 2010.
Barker appeared in a commercial for State Farm Insurance's "Magic Jingle" campaign, where he made "a new car!" appear for a woman whose previous car was totaled by a giant concrete cylinder.
Barker filmed a TV advertisement endorsing David Jolly, a candidate for the Republican Party nomination for the 2014 Florida's 13th congressional district special election. Jolly won the nomination and ultimately won the seat.
Barker voiced the character Bob Barnacle, a snail business owner on "Sanctuary!", an episode of the Nickelodeon animated series SpongeBob SquarePants.
Barker was honored after his death with an hour-long TV special celebrating his life. It aired on August 31, 2023.
Awards and honors
Daytime Emmy Awards
Overall 19-time winner:
14-time winner of Daytime Emmy Award for Outstanding Game Show Host, as host of The Price Is Right
4-time winner of Daytime Emmy Award for Outstanding Game Show, as executive producer of The Price Is Right
Lifetime Achievement Award, presented at the 1999 Daytime Emmy Awards
WWE
2009 Slammy Award for Best Guest Host.
Media
Bob Barker Studio at CBS Television City named in his honor.
Time magazine's Greatest Game Show Host of All-Time
GSN Lifetime Achievement Award
Halls of Fame
Star on the Hollywood Walk of Fame
Television Hall of Fame (class of 2004).
NAB Broadcasting Hall of Fame (class of 2008).
Autobiography
Barker's autobiography, Priceless Memories, written with former Los Angeles Times book review editor Digby Diehl, was published on April 6, 2009.
See also
List of animal rights advocates
Notes
References
External links
1923 births
2023 deaths
20th-century American male actors
20th-century Native Americans
21st-century Native Americans
Academy of Magical Arts Special Fellowship winners
Activists from South Dakota
Activists from Washington (state)
American animal rights activists
American game show hosts
American male television actors
Beauty pageant hosts
Burials at Forest Lawn Memorial Park (Hollywood Hills)
Daytime Emmy Award for Outstanding Game Show Host winners
Deaths from Alzheimer's disease
Deaths from dementia in California
Deaths from hypertension
Drury University alumni
Military personnel from Washington (state)
Native American United States military personnel
Native American activists
Native American male actors
People from Mission, South Dakota
People from Rosebud Indian Reservation, South Dakota
People from Snohomish County, Washington
People from Springfield, Missouri
Rosebud Sioux people
The Price Is Right
United States Navy officers
United States Navy personnel of World War II
United States Navy reservists |
Thomas or Tom McMillen may refer to:
Thomas Richard McMillen or Thomas Haden Church (born 1960), American actor, director, and writer
Thomas Roberts McMillen (1916–2012), U.S. District Judge
Tom McMillen (born 1952), American former politician and basketball player
See also
Thomas McMillan (disambiguation)
Tom McMillin (2000s–2010s), Michigan politician |
Elizabeth Eaton Boit (1849–1932) was an American textile manufacturer and philanthropist. It was said that "the smartest man in Wakefield (Massachusetts) was a Woman" and this woman was Elizabeth Boit.
Early life
Bolt was born in Newton, Massachusetts on July 9, 1849. She was the second child out of six daughters and went to school at Lasell Seminary. At 18, she was a timekeeper at the Dudley Hosiery Knitting Mill. She became forewoman of the sewing department within five years. Despite an influx of women into the textile industry, a forewoman was a novelty.
Textile legacy
Boit eventually became superintendent of Allston Mills in 1883 when she was 34. She formed a partnership with Charles N. Winship, who was fourteen years her junior, in 1888 and they founded the Harvard Knitting Mill, which specialized in women's undergarments. They moved the business to Wakefield and completed a plant there in 1897. Boit had an incredibly successful plant, having to expand it in 1901, 1903, 1907, and 1911, and at its height occupied a floor space of eight and half acres and employing an estimated 850 employees.
Boit was known for her generosity and set up a profit-sharing program for her employees. At this time, she was the only woman that was actively engaged in such a successful textile business. At its peak, the plant had 850 employees and produced 24,000 garments per day.
She turned over her interest in the business by the 1920s to Charles Winship, though she continued to invest in the mill and visit it daily. Boit never married, instead focusing her life on her mill and her extended family. In her final years, she fell ill and then died on November 14, 1932. Her home, the Elizabeth Boit House, was listed on the National Register of Historic Places in 1989.
References
Further reading
1849 births
1932 deaths
Businesspeople from Massachusetts
People from Newton, Massachusetts |
Sumya Anani (born February 12, 1972) is a retired American professional female boxer nicknamed "The Island Girl." She was 5'6" and boxed as a junior welterweight. She is best known for a 1996 bout which left her opponent severely injured and may have served as an inspiration for the film Million Dollar Baby. Outside the ring, she is a yoga instructor and holistic healer.
Anani was born in Minnesota and raised in Kansas. She competed as a weightlifter in 1995 and 1996. She took up boxing for self-defense and started boxing professionally because she was "short on cash." She began to box professionally in the summer of 1996.
She began by boxing against relatively unknown opponents. Her fourth professional bout was in St. Joseph, Missouri against Katie Dallam, a novice welterweight who had only gotten her pro boxing license the day before — a pairing described as "an obvious mismatch." In four rounds she landed 119 blows to Dallam's head. Dallam collapsed in her dressing room afterward and required brain surgery. Anani was so upset she considered quitting boxing.
She came to prominence in the boxing world on September 30, 1997, when she defeated former WIBF lightweight champion Stacy Prestage by a knockout. On March 28, 1998 she scored "the sport's biggest upset" with a unanimous six-round decision over veteran Andrea DeShong, considered "the standard bearer for the sport." On December 18, 1998, she fought boxing star Christy Martin and won the match, handing Martin her first defeat since November 1989.
In 2016, Anani was inducted into the Women's International Boxing Hall of Fame in Fort Lauderdale, Florida. The IWBHF was created and founded by Sue TL Fox.
Professional boxing record
See also
List of female boxers
References
External links
Sumya Anani at Awakening Fighters
1972 births
Living people
American women boxers
Boxers from Minnesota
Boxers from Kansas
Welterweight boxers
21st-century American women |
```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());
}
}
}
``` |
Ell Pond is a kettle hole in Hopkinton, Washington County, Rhode Island. It is surrounded by a swamp of red maple and Atlantic white cypress, and by steep granitic monadnocks. The small area contains communities of both hydrophytic and xeric plants, which makes it ideal for ecological research and education. It was designated a National Natural Landmark in May 1974. In 1972, The Nature Conservancy purchased including the pond to extend of protected land owned by the Audubon Society of Rhode Island and the of Rockville Wildlife Management Area owned by the state. The preserve is jointly managed by all three entities. There are hiking trails in the preserve, but Ell pond is specifically not reachable due to its fragile environment.
References
External links
Ell Pond The Nature Conservancy
Audubon Society of Rhode Island Long Pond preserve
National Natural Landmarks in Rhode Island
Nature Conservancy preserves
Protected areas of Washington County, Rhode Island
Nature reserves in Rhode Island
Bodies of water of Washington County, Rhode Island
Lakes of Rhode Island
Ponds of the United States
Protected areas established in 1972
1972 establishments in Rhode Island |
2019 Hawaii cannabis legalization proceeded with SB 686 / HB 708, introduced January 2019. The bill was listed as a "top priority" for the 2019 legislative year, President of Hawaii Senate Ron Kouchi, and supported by the Hawaii Democratic Party chairperson Keali'i Lopez. It was opposed by Governor
David Ige.
SB 686 passed the Senate Judiciary committee unanimously on February 9, 2019.
The same year a plethora of other bills (11 in the state House, 11 in the Senate) were introduced to legalize cannabis.
Provisions
SB 686 legalizes the possession of less than half an ounce of cannabis for those over age 21 and levies 15 percent surcharge in addn to the general excise tax. sales starting in February 2021. Thirty percent of the surcharge would go to a public education campaign including cannabis and impaired driving. The bill would eliminate all criminal statues in Hawaii concerning cannabis except distribution to minors (minors themselves would not be committing a cannabis crime), and require expungement of criminal records for cannabis crimes.
References
External links
SB 686 at Hawaii legislature
2019 cannabis law reform
Cannabis in Hawaii
Proposed laws of the United States |
The Original Melbourne Village Hall is a historic building currently located on Hall Road in Melbourne Village, Florida, United States. This building was built circa 1941 during World War II to serve as a military barracks at the Naval Air Station Banana River. After World War II, the U.S. government declared the building surplus and subsequently sold it to the American Homesteading Foundation located at Melbourne Village.
In May 1948, the building was moved to its current location and used as a community center. Upon becoming incorporated, the Town of Melbourne Village used the building from 1957 until 1963 as office space until a new town hall was constructed. In 2003, Melbourne Village completed restorations of the building and renamed it Hester Wagner Community House in December of that year.
See also
Melbourne Village
Naval Air Station Banana River
Village hall
Notes
Gallery
External links
Original Melbourne Village Hall. Information from the Florida Historical Markers Program website.
Buildings and structures in Brevard County, Florida |
Joaquin Tack-Fang (born 23 September 1946) is a Cuban fencer. He competed in the team sabre event at the 1968 Summer Olympics.
References
1946 births
Living people
Cuban male fencers
Olympic fencers for Cuba
Fencers at the 1968 Summer Olympics
Sportspeople from Guantánamo |
Songo is a town in the Zabré Department of Boulgou Province in south-eastern Burkina Faso, located close to the border with Ghana. As of 2005, the town has a population of 1,003.
References
Populated places in the Centre-Est Region
Boulgou Province |
The Union of British Columbia Indian Chiefs (UBCIC) is a First Nations political organization founded in 1969 in response to Jean Chrétien's White Paper proposal to assimilate Status Indians and disband the Department of Indian Affairs.
Since the disbanding of the Allied Tribes of British Columbia in 1927, there had been many attempts to create a unified provincial organization, but conflict between the primarily coastal/Protestant Native Brotherhood of British Columbia and the primarily interior/Catholic National American Indian Brotherhood had been too great.
At a three-day meeting in November 1969 in Kamloops, 175 provincial chiefs unanimously voted to create the UBCIC. In 1971, the UBCIC adopts its Constitution and By-laws and is incorporated under the BC Societies Act.
Leadership
UBCIC operates through an Executive Committee and a Chief's Council composed of chiefs representing member indigenous communities. The first three-person executive consisted of Victor Adolf, Heber Maitland, and Philip Paul.
Presidents
George Manuel (President, 1979–81)
Robert (Bob) Manuel (1981–83)
Grand Chief Saul Terry (1983–98)
Grand Chief Stewart Phillip (1998–Present)
Vice presidents
Chief Robert Chamberlin, OWADI (2009–Present)
Secretary treasurers
Kukpi7 Judy Wilson (unknown–Present)
History
In 1969, then Prime Minister Pierre Trudeau and Minister of Indian Affairs Jean Chrétien released a policy document officially entitled Statement of the Government of Canada on Indian policy. Better known as the White Paper, this policy proposed a dismantling of the Indian Act and an end to the special relationship between Indigenous Peoples and the Canadian Government. Many Indigenous groups across Canada protested this policy change and expressed concern regarding the Canadian Government's failure to incorporate feedback raised during the consultation process. In British Columbia, a generation of emerging Indigenous leaders began to organize in response. Rose Charlie of the Indian Homemakers' Association, Philip Paul of the Southern Vancouver Island Tribal Federation and Don Moses of the North American Indian Brotherhood invited bands from across the province to a conference in Kamloops to discuss the policy and the recognition of Aboriginal title and rights more generally. The conference was a success with over 140 bands represented and it resulted in the formation of the Union of British Columbia Indian Chiefs, an organization dedicated to the resolution of land claims.
Library and archives
UBCIC provides specialized research collections and services with a focus on BC land rights research for those with a band council resolution to conduct research on behalf of a First Nation or other researchers who abide to UBCIC's Ethical Research Policy. The library uses a modified version of the Brian Deer classification system, a library organizational system that better reflects Indigenous worldviews.
References
External links
Official Site
UBCIC Constitution
UBCIC Historical Timeline of BC
UBCIC Library & Archives
Union of British Columbia Indian Chiefs - Indigenous Foundations at UBC
First Nations organizations in British Columbia
Organizations established in 1969
1969 establishments in British Columbia
First Nations governments |
```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.