text stringlengths 1 22.8M |
|---|
```python
# Generated by the protocol buffer compiler. DO NOT EDIT!
# source: object_detection/protos/hyperparams.proto
import sys
_b=sys.version_info[0]<3 and (lambda x:x) or (lambda x:x.encode('latin1'))
from google.protobuf import descriptor as _descriptor
from google.protobuf import message as _message
from google.protobuf import reflection as _reflection
from google.protobuf import symbol_database as _symbol_database
from google.protobuf import descriptor_pb2
# @@protoc_insertion_point(imports)
_sym_db = _symbol_database.Default()
DESCRIPTOR = _descriptor.FileDescriptor(
name='object_detection/protos/hyperparams.proto',
package='object_detection.protos',
serialized_pb=_b('\n)object_detection/protos/hyperparams.proto\x12\x17object_detection.protos\"\x87\x03\n\x0bHyperparams\x12\x39\n\x02op\x18\x01 \x01(\x0e\x32\'.object_detection.protos.Hyperparams.Op:\x04\x43ONV\x12\x39\n\x0bregularizer\x18\x02 \x01(\x0b\x32$.object_detection.protos.Regularizer\x12\x39\n\x0binitializer\x18\x03 \x01(\x0b\x32$.object_detection.protos.Initializer\x12I\n\nactivation\x18\x04 \x01(\x0e\x32/.object_detection.protos.Hyperparams.Activation:\x04RELU\x12\x36\n\nbatch_norm\x18\x05 \x01(\x0b\x32\".object_detection.protos.BatchNorm\"\x16\n\x02Op\x12\x08\n\x04\x43ONV\x10\x01\x12\x06\n\x02\x46\x43\x10\x02\",\n\nActivation\x12\x08\n\x04NONE\x10\x00\x12\x08\n\x04RELU\x10\x01\x12\n\n\x06RELU_6\x10\x02\"\xa6\x01\n\x0bRegularizer\x12@\n\x0el1_regularizer\x18\x01 \x01(\x0b\x32&.object_detection.protos.L1RegularizerH\x00\x12@\n\x0el2_regularizer\x18\x02 \x01(\x0b\x32&.object_detection.protos.L2RegularizerH\x00\x42\x13\n\x11regularizer_oneof\"\"\n\rL1Regularizer\x12\x11\n\x06weight\x18\x01 \x01(\x02:\x01\x31\"\"\n\rL2Regularizer\x12\x11\n\x06weight\x18\x01 \x01(\x02:\x01\x31\"\xdc\x01\n\x0bInitializer\x12[\n\x1ctruncated_normal_initializer\x18\x01 \x01(\x0b\x32\x33.object_detection.protos.TruncatedNormalInitializerH\x00\x12[\n\x1cvariance_scaling_initializer\x18\x02 \x01(\x0b\x32\x33.object_detection.protos.VarianceScalingInitializerH\x00\x42\x13\n\x11initializer_oneof\"@\n\x1aTruncatedNormalInitializer\x12\x0f\n\x04mean\x18\x01 \x01(\x02:\x01\x30\x12\x11\n\x06stddev\x18\x02 \x01(\x02:\x01\x31\"\xc5\x01\n\x1aVarianceScalingInitializer\x12\x11\n\x06\x66\x61\x63tor\x18\x01 \x01(\x02:\x01\x32\x12\x16\n\x07uniform\x18\x02 \x01(\x08:\x05\x66\x61lse\x12N\n\x04mode\x18\x03 \x01(\x0e\x32\x38.object_detection.protos.VarianceScalingInitializer.Mode:\x06\x46\x41N_IN\",\n\x04Mode\x12\n\n\x06\x46\x41N_IN\x10\x00\x12\x0b\n\x07\x46\x41N_OUT\x10\x01\x12\x0b\n\x07\x46\x41N_AVG\x10\x02\"z\n\tBatchNorm\x12\x14\n\x05\x64\x65\x63\x61y\x18\x01 \x01(\x02:\x05\x30.999\x12\x14\n\x06\x63\x65nter\x18\x02 \x01(\x08:\x04true\x12\x14\n\x05scale\x18\x03 \x01(\x08:\x05\x66\x61lse\x12\x16\n\x07\x65psilon\x18\x04 \x01(\x02:\x05\x30.001\x12\x13\n\x05train\x18\x05 \x01(\x08:\x04true')
)
_sym_db.RegisterFileDescriptor(DESCRIPTOR)
_HYPERPARAMS_OP = _descriptor.EnumDescriptor(
name='Op',
full_name='object_detection.protos.Hyperparams.Op',
filename=None,
file=DESCRIPTOR,
values=[
_descriptor.EnumValueDescriptor(
name='CONV', index=0, number=1,
options=None,
type=None),
_descriptor.EnumValueDescriptor(
name='FC', index=1, number=2,
options=None,
type=None),
],
containing_type=None,
options=None,
serialized_start=394,
serialized_end=416,
)
_sym_db.RegisterEnumDescriptor(_HYPERPARAMS_OP)
_HYPERPARAMS_ACTIVATION = _descriptor.EnumDescriptor(
name='Activation',
full_name='object_detection.protos.Hyperparams.Activation',
filename=None,
file=DESCRIPTOR,
values=[
_descriptor.EnumValueDescriptor(
name='NONE', index=0, number=0,
options=None,
type=None),
_descriptor.EnumValueDescriptor(
name='RELU', index=1, number=1,
options=None,
type=None),
_descriptor.EnumValueDescriptor(
name='RELU_6', index=2, number=2,
options=None,
type=None),
],
containing_type=None,
options=None,
serialized_start=418,
serialized_end=462,
)
_sym_db.RegisterEnumDescriptor(_HYPERPARAMS_ACTIVATION)
_VARIANCESCALINGINITIALIZER_MODE = _descriptor.EnumDescriptor(
name='Mode',
full_name='object_detection.protos.VarianceScalingInitializer.Mode',
filename=None,
file=DESCRIPTOR,
values=[
_descriptor.EnumValueDescriptor(
name='FAN_IN', index=0, number=0,
options=None,
type=None),
_descriptor.EnumValueDescriptor(
name='FAN_OUT', index=1, number=1,
options=None,
type=None),
_descriptor.EnumValueDescriptor(
name='FAN_AVG', index=2, number=2,
options=None,
type=None),
],
containing_type=None,
options=None,
serialized_start=1148,
serialized_end=1192,
)
_sym_db.RegisterEnumDescriptor(_VARIANCESCALINGINITIALIZER_MODE)
_HYPERPARAMS = _descriptor.Descriptor(
name='Hyperparams',
full_name='object_detection.protos.Hyperparams',
filename=None,
file=DESCRIPTOR,
containing_type=None,
fields=[
_descriptor.FieldDescriptor(
name='op', full_name='object_detection.protos.Hyperparams.op', index=0,
number=1, type=14, cpp_type=8, label=1,
has_default_value=True, default_value=1,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='regularizer', full_name='object_detection.protos.Hyperparams.regularizer', index=1,
number=2, type=11, cpp_type=10, label=1,
has_default_value=False, default_value=None,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='initializer', full_name='object_detection.protos.Hyperparams.initializer', index=2,
number=3, type=11, cpp_type=10, label=1,
has_default_value=False, default_value=None,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='activation', full_name='object_detection.protos.Hyperparams.activation', index=3,
number=4, type=14, cpp_type=8, label=1,
has_default_value=True, default_value=1,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='batch_norm', full_name='object_detection.protos.Hyperparams.batch_norm', index=4,
number=5, type=11, cpp_type=10, label=1,
has_default_value=False, default_value=None,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
],
extensions=[
],
nested_types=[],
enum_types=[
_HYPERPARAMS_OP,
_HYPERPARAMS_ACTIVATION,
],
options=None,
is_extendable=False,
extension_ranges=[],
oneofs=[
],
serialized_start=71,
serialized_end=462,
)
_REGULARIZER = _descriptor.Descriptor(
name='Regularizer',
full_name='object_detection.protos.Regularizer',
filename=None,
file=DESCRIPTOR,
containing_type=None,
fields=[
_descriptor.FieldDescriptor(
name='l1_regularizer', full_name='object_detection.protos.Regularizer.l1_regularizer', index=0,
number=1, type=11, cpp_type=10, label=1,
has_default_value=False, default_value=None,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='l2_regularizer', full_name='object_detection.protos.Regularizer.l2_regularizer', index=1,
number=2, type=11, cpp_type=10, label=1,
has_default_value=False, default_value=None,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
],
extensions=[
],
nested_types=[],
enum_types=[
],
options=None,
is_extendable=False,
extension_ranges=[],
oneofs=[
_descriptor.OneofDescriptor(
name='regularizer_oneof', full_name='object_detection.protos.Regularizer.regularizer_oneof',
index=0, containing_type=None, fields=[]),
],
serialized_start=465,
serialized_end=631,
)
_L1REGULARIZER = _descriptor.Descriptor(
name='L1Regularizer',
full_name='object_detection.protos.L1Regularizer',
filename=None,
file=DESCRIPTOR,
containing_type=None,
fields=[
_descriptor.FieldDescriptor(
name='weight', full_name='object_detection.protos.L1Regularizer.weight', index=0,
number=1, type=2, cpp_type=6, label=1,
has_default_value=True, default_value=1,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
],
extensions=[
],
nested_types=[],
enum_types=[
],
options=None,
is_extendable=False,
extension_ranges=[],
oneofs=[
],
serialized_start=633,
serialized_end=667,
)
_L2REGULARIZER = _descriptor.Descriptor(
name='L2Regularizer',
full_name='object_detection.protos.L2Regularizer',
filename=None,
file=DESCRIPTOR,
containing_type=None,
fields=[
_descriptor.FieldDescriptor(
name='weight', full_name='object_detection.protos.L2Regularizer.weight', index=0,
number=1, type=2, cpp_type=6, label=1,
has_default_value=True, default_value=1,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
],
extensions=[
],
nested_types=[],
enum_types=[
],
options=None,
is_extendable=False,
extension_ranges=[],
oneofs=[
],
serialized_start=669,
serialized_end=703,
)
_INITIALIZER = _descriptor.Descriptor(
name='Initializer',
full_name='object_detection.protos.Initializer',
filename=None,
file=DESCRIPTOR,
containing_type=None,
fields=[
_descriptor.FieldDescriptor(
name='truncated_normal_initializer', full_name='object_detection.protos.Initializer.truncated_normal_initializer', index=0,
number=1, type=11, cpp_type=10, label=1,
has_default_value=False, default_value=None,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='variance_scaling_initializer', full_name='object_detection.protos.Initializer.variance_scaling_initializer', index=1,
number=2, type=11, cpp_type=10, label=1,
has_default_value=False, default_value=None,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
],
extensions=[
],
nested_types=[],
enum_types=[
],
options=None,
is_extendable=False,
extension_ranges=[],
oneofs=[
_descriptor.OneofDescriptor(
name='initializer_oneof', full_name='object_detection.protos.Initializer.initializer_oneof',
index=0, containing_type=None, fields=[]),
],
serialized_start=706,
serialized_end=926,
)
_TRUNCATEDNORMALINITIALIZER = _descriptor.Descriptor(
name='TruncatedNormalInitializer',
full_name='object_detection.protos.TruncatedNormalInitializer',
filename=None,
file=DESCRIPTOR,
containing_type=None,
fields=[
_descriptor.FieldDescriptor(
name='mean', full_name='object_detection.protos.TruncatedNormalInitializer.mean', index=0,
number=1, type=2, cpp_type=6, label=1,
has_default_value=True, default_value=0,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='stddev', full_name='object_detection.protos.TruncatedNormalInitializer.stddev', index=1,
number=2, type=2, cpp_type=6, label=1,
has_default_value=True, default_value=1,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
],
extensions=[
],
nested_types=[],
enum_types=[
],
options=None,
is_extendable=False,
extension_ranges=[],
oneofs=[
],
serialized_start=928,
serialized_end=992,
)
_VARIANCESCALINGINITIALIZER = _descriptor.Descriptor(
name='VarianceScalingInitializer',
full_name='object_detection.protos.VarianceScalingInitializer',
filename=None,
file=DESCRIPTOR,
containing_type=None,
fields=[
_descriptor.FieldDescriptor(
name='factor', full_name='object_detection.protos.VarianceScalingInitializer.factor', index=0,
number=1, type=2, cpp_type=6, label=1,
has_default_value=True, default_value=2,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='uniform', full_name='object_detection.protos.VarianceScalingInitializer.uniform', index=1,
number=2, type=8, cpp_type=7, label=1,
has_default_value=True, default_value=False,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='mode', full_name='object_detection.protos.VarianceScalingInitializer.mode', index=2,
number=3, type=14, cpp_type=8, label=1,
has_default_value=True, default_value=0,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
],
extensions=[
],
nested_types=[],
enum_types=[
_VARIANCESCALINGINITIALIZER_MODE,
],
options=None,
is_extendable=False,
extension_ranges=[],
oneofs=[
],
serialized_start=995,
serialized_end=1192,
)
_BATCHNORM = _descriptor.Descriptor(
name='BatchNorm',
full_name='object_detection.protos.BatchNorm',
filename=None,
file=DESCRIPTOR,
containing_type=None,
fields=[
_descriptor.FieldDescriptor(
name='decay', full_name='object_detection.protos.BatchNorm.decay', index=0,
number=1, type=2, cpp_type=6, label=1,
has_default_value=True, default_value=0.999,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='center', full_name='object_detection.protos.BatchNorm.center', index=1,
number=2, type=8, cpp_type=7, label=1,
has_default_value=True, default_value=True,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='scale', full_name='object_detection.protos.BatchNorm.scale', index=2,
number=3, type=8, cpp_type=7, label=1,
has_default_value=True, default_value=False,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='epsilon', full_name='object_detection.protos.BatchNorm.epsilon', index=3,
number=4, type=2, cpp_type=6, label=1,
has_default_value=True, default_value=0.001,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
_descriptor.FieldDescriptor(
name='train', full_name='object_detection.protos.BatchNorm.train', index=4,
number=5, type=8, cpp_type=7, label=1,
has_default_value=True, default_value=True,
message_type=None, enum_type=None, containing_type=None,
is_extension=False, extension_scope=None,
options=None),
],
extensions=[
],
nested_types=[],
enum_types=[
],
options=None,
is_extendable=False,
extension_ranges=[],
oneofs=[
],
serialized_start=1194,
serialized_end=1316,
)
_HYPERPARAMS.fields_by_name['op'].enum_type = _HYPERPARAMS_OP
_HYPERPARAMS.fields_by_name['regularizer'].message_type = _REGULARIZER
_HYPERPARAMS.fields_by_name['initializer'].message_type = _INITIALIZER
_HYPERPARAMS.fields_by_name['activation'].enum_type = _HYPERPARAMS_ACTIVATION
_HYPERPARAMS.fields_by_name['batch_norm'].message_type = _BATCHNORM
_HYPERPARAMS_OP.containing_type = _HYPERPARAMS
_HYPERPARAMS_ACTIVATION.containing_type = _HYPERPARAMS
_REGULARIZER.fields_by_name['l1_regularizer'].message_type = _L1REGULARIZER
_REGULARIZER.fields_by_name['l2_regularizer'].message_type = _L2REGULARIZER
_REGULARIZER.oneofs_by_name['regularizer_oneof'].fields.append(
_REGULARIZER.fields_by_name['l1_regularizer'])
_REGULARIZER.fields_by_name['l1_regularizer'].containing_oneof = _REGULARIZER.oneofs_by_name['regularizer_oneof']
_REGULARIZER.oneofs_by_name['regularizer_oneof'].fields.append(
_REGULARIZER.fields_by_name['l2_regularizer'])
_REGULARIZER.fields_by_name['l2_regularizer'].containing_oneof = _REGULARIZER.oneofs_by_name['regularizer_oneof']
_INITIALIZER.fields_by_name['truncated_normal_initializer'].message_type = _TRUNCATEDNORMALINITIALIZER
_INITIALIZER.fields_by_name['variance_scaling_initializer'].message_type = _VARIANCESCALINGINITIALIZER
_INITIALIZER.oneofs_by_name['initializer_oneof'].fields.append(
_INITIALIZER.fields_by_name['truncated_normal_initializer'])
_INITIALIZER.fields_by_name['truncated_normal_initializer'].containing_oneof = _INITIALIZER.oneofs_by_name['initializer_oneof']
_INITIALIZER.oneofs_by_name['initializer_oneof'].fields.append(
_INITIALIZER.fields_by_name['variance_scaling_initializer'])
_INITIALIZER.fields_by_name['variance_scaling_initializer'].containing_oneof = _INITIALIZER.oneofs_by_name['initializer_oneof']
_VARIANCESCALINGINITIALIZER.fields_by_name['mode'].enum_type = _VARIANCESCALINGINITIALIZER_MODE
_VARIANCESCALINGINITIALIZER_MODE.containing_type = _VARIANCESCALINGINITIALIZER
DESCRIPTOR.message_types_by_name['Hyperparams'] = _HYPERPARAMS
DESCRIPTOR.message_types_by_name['Regularizer'] = _REGULARIZER
DESCRIPTOR.message_types_by_name['L1Regularizer'] = _L1REGULARIZER
DESCRIPTOR.message_types_by_name['L2Regularizer'] = _L2REGULARIZER
DESCRIPTOR.message_types_by_name['Initializer'] = _INITIALIZER
DESCRIPTOR.message_types_by_name['TruncatedNormalInitializer'] = _TRUNCATEDNORMALINITIALIZER
DESCRIPTOR.message_types_by_name['VarianceScalingInitializer'] = _VARIANCESCALINGINITIALIZER
DESCRIPTOR.message_types_by_name['BatchNorm'] = _BATCHNORM
Hyperparams = _reflection.GeneratedProtocolMessageType('Hyperparams', (_message.Message,), dict(
DESCRIPTOR = _HYPERPARAMS,
__module__ = 'object_detection.protos.hyperparams_pb2'
# @@protoc_insertion_point(class_scope:object_detection.protos.Hyperparams)
))
_sym_db.RegisterMessage(Hyperparams)
Regularizer = _reflection.GeneratedProtocolMessageType('Regularizer', (_message.Message,), dict(
DESCRIPTOR = _REGULARIZER,
__module__ = 'object_detection.protos.hyperparams_pb2'
# @@protoc_insertion_point(class_scope:object_detection.protos.Regularizer)
))
_sym_db.RegisterMessage(Regularizer)
L1Regularizer = _reflection.GeneratedProtocolMessageType('L1Regularizer', (_message.Message,), dict(
DESCRIPTOR = _L1REGULARIZER,
__module__ = 'object_detection.protos.hyperparams_pb2'
# @@protoc_insertion_point(class_scope:object_detection.protos.L1Regularizer)
))
_sym_db.RegisterMessage(L1Regularizer)
L2Regularizer = _reflection.GeneratedProtocolMessageType('L2Regularizer', (_message.Message,), dict(
DESCRIPTOR = _L2REGULARIZER,
__module__ = 'object_detection.protos.hyperparams_pb2'
# @@protoc_insertion_point(class_scope:object_detection.protos.L2Regularizer)
))
_sym_db.RegisterMessage(L2Regularizer)
Initializer = _reflection.GeneratedProtocolMessageType('Initializer', (_message.Message,), dict(
DESCRIPTOR = _INITIALIZER,
__module__ = 'object_detection.protos.hyperparams_pb2'
# @@protoc_insertion_point(class_scope:object_detection.protos.Initializer)
))
_sym_db.RegisterMessage(Initializer)
TruncatedNormalInitializer = _reflection.GeneratedProtocolMessageType('TruncatedNormalInitializer', (_message.Message,), dict(
DESCRIPTOR = _TRUNCATEDNORMALINITIALIZER,
__module__ = 'object_detection.protos.hyperparams_pb2'
# @@protoc_insertion_point(class_scope:object_detection.protos.TruncatedNormalInitializer)
))
_sym_db.RegisterMessage(TruncatedNormalInitializer)
VarianceScalingInitializer = _reflection.GeneratedProtocolMessageType('VarianceScalingInitializer', (_message.Message,), dict(
DESCRIPTOR = _VARIANCESCALINGINITIALIZER,
__module__ = 'object_detection.protos.hyperparams_pb2'
# @@protoc_insertion_point(class_scope:object_detection.protos.VarianceScalingInitializer)
))
_sym_db.RegisterMessage(VarianceScalingInitializer)
BatchNorm = _reflection.GeneratedProtocolMessageType('BatchNorm', (_message.Message,), dict(
DESCRIPTOR = _BATCHNORM,
__module__ = 'object_detection.protos.hyperparams_pb2'
# @@protoc_insertion_point(class_scope:object_detection.protos.BatchNorm)
))
_sym_db.RegisterMessage(BatchNorm)
# @@protoc_insertion_point(module_scope)
``` |
Elvidge is a surname. Notable people with the surname include:
Anita M. Elvidge (1895–1981), artist and First Lady of Guam
Chris Elvidge (1892–?), English footballer
Ford Quint Elvidge (1892–1980), Governor of Guam
John Elvidge (born 1951), British civil servant
June Elvidge (1893–1965), American actress
Ron Elvidge (1923–2019), New Zealand rugby union player |
Nagórki Dobrskie is a village in the administrative district of Gmina Drobin, within Płock County, Masovian Voivodeship, in east-central Poland. It lies approximately south-east of Drobin, north-east of Płock, and north-west of Warsaw.
References
Villages in Płock County |
The 1942–43 NCAA men's basketball season began in December 1942, progressed through the regular season and conference tournaments, and concluded with the 1943 NCAA basketball tournament championship game on March 30, 1943, at Madison Square Garden in New York, New York. The Wyoming Cowboys won their first NCAA national championship with a 46–34 victory over the Georgetown Hoyas.
Rule changes
In overtime, a player can commit a fifth foul before fouling out. Previously, a player fouled out after committing four fouls, regardless of whether the game went into overtime or not.
Season headlines
In February 1943, the Helms Athletic Foundation retroactively selected its national champions for the seasons from 1919–20 through 1941–42. Beginning with the 1942–43 season, it began to pick each season's national champion annually, a practice it continued through the 1981–82 season.
Top-ranked Illinois declined to participate in either the NCAA tournament or the National Invitation Tournament after three of its starters were drafted into the United States Army for World War II service.
The 1943 NCAA Tournament championship game between Wyoming and Georgetown was the only one in history not filmed for posterity. It had a smaller crowd than expected because of the greater local interest in New York City in the championship run St. John's made in the 1943 National Invitation Tournament. Until at least the mid-1950s, the NIT was the more prestigious of the two tournaments.
As a fundraiser for the American Red Cross, the finalists and semifinalists of the NCAA Tournament and NIT took part in the Sportswriters Invitational Playoff, in which the two tournament champions, Wyoming (NCAA) and St. John's (NIT), and the two runners-up, Georgetown (NCAA) and Toledo (NIT), played each other at Madison Square Garden after their tournaments ended, with the games counting in the teams' records for the season. The NCAA Tournament teams prevailed in both games: Wyoming beat St. John's 52–47 with 18,000 fans in attendance, and the Hoyas defeated Toledo 54–40 to close out the season. The post-tournament benefit games — touted as the "mythical national championship" between the two tournament winners — would be played again in each of the next two seasons.
In 1995, the Premo-Porretta Power Poll retroactively selected Illinois as its national champion for the 1942–43 season.
Conference membership changes
Regular season
Conference winners and tournaments
Statistical leaders
Post-season tournaments
NCAA tournament
Semifinals and finals
National Invitation tournament
Semifinals and finals
Third Place – Washington & Jefferson 39, Fordham 34
Awards
Consensus All-American teams
Major player of the year awards
Helms Player of the Year: George Senesky, Saint Joseph's (retroactive selection in 1944)
Sporting News Player of the Year: Andy Phillip, Illinois
Other major awards
NIT/Haggerty Award (Top player in New York City metro area): Andrew Levane, St. John's
Coaching changes
A number of teams changed coaches during the season and after it ended.
References |
Adeyemi I was the last independent ruler of the Oyo Empire. He ruled from 1876 to 1905. Starting in 1888 he came under increasing British control with his independence clearly ended by 1896. He was the Alaafin during the 16 years Yoruba civil war which went on from 1877-1893.
References
Oyo Empire
19th-century births
20th-century deaths
Year of birth missing
Year of death missing |
Joshua Harold Burn FRS (6 March 1892 – 13 July 1981) was an English pharmacologist and professor of pharmacology at Oxford University.
Burn worked on the internal control of the body by the autonomic nervous system, carrying out seminal work on the release of noradrenaline from these nerves and introducing the controversial Burn-Rand hypothesis.
The Nobel Laureate John Vane claimed "If anyone can be said to have moulded the subject of pharmacology around the world, it is he".
Life
Burn was born in Barnard Castle, County Durham, England. He was educated at Barnard Castle School. Burn entered Emmanuel College, Cambridge in 1909 where he read the Natural Sciences Tripos. He specialised in physiology for Part II. His tutor was Frederick Gowland Hopkins. After receiving his BA he was awarded a research grant by Emmanuel College and a Michael Foster Studentship by the university. The next 18 months were spent in research with Joseph Barcroft. Other figures in physiology at Cambridge at the time were Keith Lucas and the Nobel Laureates Archibald Hill and Edgar Adrian. In January 1914 Burn went to work for Henry Hallett Dale in London.
In October 1914, Burn enlisted in the army as a Signals Officer with the rank of corporal. By the end of 1917 he was required to return to England to finish his medical training. From 1920 to 1926 he worked with Henry Dale at the National Institute for Medical Research in Hampstead. His work involved the standardisation of medicines. In 1926 he became director of the Pharmacological Laboratories at the Pharmaceutical Society of Great Britain, again involved in the standardisation of medicines. Between 1926 and 1937 Burn had 44 co-workers, of which 30 came from overseas. From 1933 he worked closely with Edith Bülbring. In 1931 he was a founder member of the British Pharmacological Society and he was a member of the commission that produced the reforming British Pharmacopoeia in 1932. In 1933 he was appointed Dean of The School of Pharmacy, University of London.
From 1937 to 1959 Burn held the chair of Pharmacology at the University of Oxford. Over the years he had 162 academic staff, including John Robert Vane (1927–2004), one of three winners of the Nobel Prize in Physiology or Medicine in 1982.
Burn was an honorary Doctor of Yale University, the University of Mainz and the University of Bradford. He was an honorary member of the British Pharmacological Society, the German Pharmacological Society and the Czechoslovakian Medical Society of Jan Evangelista Purkyně and a member of the Leopoldina and a Fellow of the Royal Society (elected 1942) . In 1967 he received the Schmiedeberg-badge of the German Pharmacological Society and in 1979 the Wellcome Gold Medal of the British Pharmacological Society.
Publications
Methods of Biological Assay, 1928;
Recent Advances in Materia Medica, 1931;
Biological Standardization, 1937;
Background of Therapeutics, 1948;
Lecture Notes on Pharmacology, 1948;
Practical Pharmacology, 1952;
Functions of Autonomic Transmitters, 1956;
The Principles of Therapeutics, 1957;
Drugs, Medicines and Man, 1962;
The Autonomic Nervous System, 1963;
Our most interesting Diseases, 1964;
A Defence of John Balliol, 1970
References
External links
1892 births
1981 deaths
People from Barnard Castle
People educated at Barnard Castle School
English pharmacologists
Fellows of the Royal Society
Alumni of Emmanuel College, Cambridge
British Army personnel of World War I
National Institute for Medical Research faculty |
```go
// Unless explicitly stated otherwise all files in this repository are licensed
// This product includes software developed at Datadog (path_to_url
//go:build clusterchecks && kubeapiserver
package listeners
import (
"context"
"fmt"
"reflect"
"sync"
"github.com/DataDog/datadog-agent/comp/core/autodiscovery/common/types"
"github.com/DataDog/datadog-agent/comp/core/autodiscovery/integration"
"github.com/DataDog/datadog-agent/comp/core/autodiscovery/providers/names"
"github.com/DataDog/datadog-agent/comp/core/autodiscovery/telemetry"
"github.com/DataDog/datadog-agent/pkg/util/containers"
"github.com/DataDog/datadog-agent/pkg/util/kubernetes/apiserver"
"github.com/DataDog/datadog-agent/pkg/util/log"
v1 "k8s.io/api/core/v1"
"k8s.io/apimachinery/pkg/api/equality"
"k8s.io/apimachinery/pkg/labels"
k8stypes "k8s.io/apimachinery/pkg/types"
infov1 "k8s.io/client-go/informers/core/v1"
listv1 "k8s.io/client-go/listers/core/v1"
"k8s.io/client-go/tools/cache"
)
const (
kubeEndpointsID = "endpoints"
kubeEndpointsName = "kube_endpoints"
leaderAnnotation = "control-plane.alpha.kubernetes.io/leader"
)
// KubeEndpointsListener listens to kubernetes endpoints creation
type KubeEndpointsListener struct {
endpointsInformer infov1.EndpointsInformer
endpointsLister listv1.EndpointsLister
serviceInformer infov1.ServiceInformer
serviceLister listv1.ServiceLister
endpoints map[k8stypes.UID][]*KubeEndpointService
promInclAnnot types.PrometheusAnnotations
newService chan<- Service
delService chan<- Service
targetAllEndpoints bool
m sync.RWMutex
containerFilters *containerFilters
telemetryStore *telemetry.Store
}
// KubeEndpointService represents an endpoint in a Kubernetes Endpoints
type KubeEndpointService struct {
entity string
tags []string
hosts map[string]string
ports []ContainerPort
metricsExcluded bool
globalExcluded bool
}
// Make sure KubeEndpointService implements the Service interface
var _ Service = &KubeEndpointService{}
// NewKubeEndpointsListener returns the kube endpoints implementation of the ServiceListener interface
func NewKubeEndpointsListener(conf Config, telemetryStore *telemetry.Store) (ServiceListener, error) {
// Using GetAPIClient (no wait) as Client should already be initialized by Cluster Agent main entrypoint before
ac, err := apiserver.GetAPIClient()
if err != nil {
return nil, fmt.Errorf("cannot connect to apiserver: %s", err)
}
endpointsInformer := ac.InformerFactory.Core().V1().Endpoints()
if endpointsInformer == nil {
return nil, fmt.Errorf("cannot get endpoints informer: %s", err)
}
serviceInformer := ac.InformerFactory.Core().V1().Services()
if serviceInformer == nil {
return nil, fmt.Errorf("cannot get service informer: %s", err)
}
containerFilters, err := newContainerFilters()
if err != nil {
return nil, err
}
return &KubeEndpointsListener{
endpoints: make(map[k8stypes.UID][]*KubeEndpointService),
endpointsInformer: endpointsInformer,
endpointsLister: endpointsInformer.Lister(),
serviceInformer: serviceInformer,
serviceLister: serviceInformer.Lister(),
promInclAnnot: getPrometheusIncludeAnnotations(),
targetAllEndpoints: conf.IsProviderEnabled(names.KubeEndpointsFileRegisterName),
containerFilters: containerFilters,
telemetryStore: telemetryStore,
}, nil
}
// Listen starts watching service and endpoint events
func (l *KubeEndpointsListener) Listen(newSvc chan<- Service, delSvc chan<- Service) {
// setup the I/O channels
l.newService = newSvc
l.delService = delSvc
if _, err := l.endpointsInformer.Informer().AddEventHandler(cache.ResourceEventHandlerFuncs{
AddFunc: l.endpointsAdded,
DeleteFunc: l.endpointsDeleted,
UpdateFunc: l.endpointsUpdated,
}); err != nil {
log.Errorf("cannot add event handler to endpoints informer: %s", err)
}
if _, err := l.serviceInformer.Informer().AddEventHandler(cache.ResourceEventHandlerFuncs{
UpdateFunc: l.serviceUpdated,
}); err != nil {
log.Errorf("cannot add event handler to service informer: %s", err)
}
// Initial fill
endpoints, err := l.endpointsLister.List(labels.Everything())
if err != nil {
log.Errorf("Cannot list Kubernetes endpoints: %s", err)
}
for _, e := range endpoints {
l.createService(e, true)
}
}
// Stop is a stub
func (l *KubeEndpointsListener) Stop() {
// We cannot deregister from the informer
}
func (l *KubeEndpointsListener) endpointsAdded(obj interface{}) {
castedObj, ok := obj.(*v1.Endpoints)
if !ok {
log.Errorf("Expected an *v1.Endpoints type, got: %T", obj)
return
}
if isLockForLE(castedObj) {
// Ignore Endpoints objects used for leader election
return
}
l.createService(castedObj, true)
}
func (l *KubeEndpointsListener) endpointsDeleted(obj interface{}) {
castedObj, ok := obj.(*v1.Endpoints)
if !ok {
// It's possible that we got a DeletedFinalStateUnknown here
deletedState, ok := obj.(cache.DeletedFinalStateUnknown)
if !ok {
log.Errorf("Received unexpected object: %T", obj)
return
}
castedObj, ok = deletedState.Obj.(*v1.Endpoints)
if !ok {
log.Errorf("Expected DeletedFinalStateUnknown to contain *v1.Endpoints, got: %T", deletedState.Obj)
return
}
}
if isLockForLE(castedObj) {
// Ignore Endpoints objects used for leader election
return
}
l.removeService(castedObj)
}
func (l *KubeEndpointsListener) endpointsUpdated(old, obj interface{}) {
// Cast the updated object or return on failure
castedObj, ok := obj.(*v1.Endpoints)
if !ok {
log.Errorf("Expected an *v1.Endpoints type, got: %T", obj)
return
}
if isLockForLE(castedObj) {
// Ignore Endpoints objects used for leader election
return
}
// Cast the old object, consider it an add on cast failure
castedOld, ok := old.(*v1.Endpoints)
if !ok {
log.Errorf("Expected an *v1.Endpoints type, got: %T", old)
l.createService(castedObj, true)
return
}
if l.endpointsDiffer(castedObj, castedOld) {
l.removeService(castedObj)
l.createService(castedObj, true)
}
}
func (l *KubeEndpointsListener) serviceUpdated(old, obj interface{}) {
// Cast the updated object or return on failure
castedObj, ok := obj.(*v1.Service)
if !ok {
log.Errorf("Expected a *v1.Service type, got: %T", obj)
return
}
// Cast the old object, consider it an add on cast failure
castedOld, ok := old.(*v1.Service)
if !ok {
log.Errorf("Expected a *v1.Service type, got: %T", old)
l.createService(l.endpointsForService(castedObj), false)
return
}
// Detect if new annotations are added
if !isServiceAnnotated(castedOld, kubeEndpointsID) && isServiceAnnotated(castedObj, kubeEndpointsID) {
l.createService(l.endpointsForService(castedObj), false)
}
// Detect changes of AD labels for standard tags if the Service is annotated
if isServiceAnnotated(castedObj, kubeEndpointsID) && (standardTagsDigest(castedOld.GetLabels()) != standardTagsDigest(castedObj.GetLabels())) {
kep := l.endpointsForService(castedObj)
l.removeService(kep)
l.createService(kep, false)
}
}
func (l *KubeEndpointsListener) endpointsForService(service *v1.Service) *v1.Endpoints {
kendpoints, err := l.endpointsLister.Endpoints(service.Namespace).Get(service.Name)
if err != nil {
log.Warnf("Cannot get Kubernetes endpoints - Endpoints services won't be created - error: %s", err)
return nil
}
return kendpoints
}
// endpointsDiffer compares two endpoints to only go forward
// when relevant fields are changed. This logic must be
// updated if more fields are used.
func (l *KubeEndpointsListener) endpointsDiffer(first, second *v1.Endpoints) bool {
// Quick exit if resversion did not change
if first.ResourceVersion == second.ResourceVersion {
return false
}
ksvcFirst, err := l.serviceLister.Services(first.Namespace).Get(first.Name)
if err != nil {
log.Tracef("Cannot get Kubernetes service: %s", err)
return true
}
ksvcSecond, err := l.serviceLister.Services(second.Namespace).Get(second.Name)
if err != nil {
log.Tracef("Cannot get Kubernetes service: %s", err)
return true
}
// AD annotations on the corresponding services
if isServiceAnnotated(ksvcFirst, kubeEndpointsID) != isServiceAnnotated(ksvcSecond, kubeEndpointsID) {
return true
}
// AD labels - standard tags on the corresponding services
if standardTagsDigest(ksvcFirst.GetLabels()) != standardTagsDigest(ksvcSecond.GetLabels()) {
return true
}
// Endpoint subsets
return subsetsDiffer(first, second)
}
// subsetsDiffer detects if two Endpoints have different subsets.
// The function is separated from endpointsDiffer to facilitate testing.
func subsetsDiffer(first, second *v1.Endpoints) bool {
return !equality.Semantic.DeepEqual(first.Subsets, second.Subsets)
}
// isEndpointsAnnotated looks for the corresponding service of a kubernetes endpoints object
// and returns true if the service has endpoints annotations, otherwise returns false.
func (l *KubeEndpointsListener) isEndpointsAnnotated(kep *v1.Endpoints) bool {
ksvc, err := l.serviceLister.Services(kep.Namespace).Get(kep.Name)
if err != nil {
log.Tracef("Cannot get Kubernetes service: %s", err)
return false
}
return isServiceAnnotated(ksvc, kubeEndpointsID) || l.promInclAnnot.IsMatchingAnnotations(ksvc.GetAnnotations())
}
func (l *KubeEndpointsListener) shouldIgnore(kep *v1.Endpoints) bool {
if l.targetAllEndpoints {
return false
}
return !l.isEndpointsAnnotated(kep)
}
func (l *KubeEndpointsListener) createService(kep *v1.Endpoints, checkServiceAnnotations bool) {
if kep == nil {
return
}
if checkServiceAnnotations && l.shouldIgnore(kep) {
// Ignore endpoints with no AD annotation on their corresponding service if checkServiceAnnotations
// Typically we are called with checkServiceAnnotations = false when updates are due to changes on Kube Service object
return
}
// Look for standard tags
tags, err := l.getStandardTagsForEndpoints(kep)
if err != nil {
log.Debugf("Couldn't get standard tags for %s/%s: %v", kep.Namespace, kep.Name, err)
tags = []string{}
}
eps := processEndpoints(kep, tags)
for i := 0; i < len(eps); i++ {
if l.containerFilters == nil {
eps[i].metricsExcluded = false
eps[i].globalExcluded = false
continue
}
eps[i].metricsExcluded = l.containerFilters.IsExcluded(
containers.MetricsFilter,
kep.GetAnnotations(),
kep.Name,
"",
kep.Namespace,
)
eps[i].globalExcluded = l.containerFilters.IsExcluded(
containers.GlobalFilter,
kep.GetAnnotations(),
kep.Name,
"",
kep.Namespace,
)
}
l.m.Lock()
l.endpoints[kep.UID] = eps
l.m.Unlock()
telemetryStorePresent := l.telemetryStore != nil
if telemetryStorePresent {
l.telemetryStore.WatchedResources.Inc(kubeEndpointsName, telemetry.ResourceKubeService)
}
for _, ep := range eps {
log.Debugf("Creating a new AD service: %s", ep.entity)
l.newService <- ep
if telemetryStorePresent {
l.telemetryStore.WatchedResources.Inc(kubeEndpointsName, telemetry.ResourceKubeEndpoint)
}
}
}
// processEndpoints parses a kubernetes Endpoints object
// and returns a slice of KubeEndpointService per endpoint
func processEndpoints(kep *v1.Endpoints, tags []string) []*KubeEndpointService {
var eps []*KubeEndpointService
for i := range kep.Subsets {
ports := []ContainerPort{}
// Ports
for _, port := range kep.Subsets[i].Ports {
ports = append(ports, ContainerPort{int(port.Port), port.Name})
}
// Hosts
for _, host := range kep.Subsets[i].Addresses {
// create a separate AD service per host
ep := &KubeEndpointService{
entity: apiserver.EntityForEndpoints(kep.Namespace, kep.Name, host.IP),
hosts: map[string]string{"endpoint": host.IP},
ports: ports,
tags: []string{
fmt.Sprintf("kube_service:%s", kep.Name),
fmt.Sprintf("kube_namespace:%s", kep.Namespace),
fmt.Sprintf("kube_endpoint_ip:%s", host.IP),
},
}
ep.tags = append(ep.tags, tags...)
eps = append(eps, ep)
}
}
return eps
}
func (l *KubeEndpointsListener) removeService(kep *v1.Endpoints) {
if kep == nil {
return
}
l.m.RLock()
eps, ok := l.endpoints[kep.UID]
l.m.RUnlock()
if ok {
l.m.Lock()
delete(l.endpoints, kep.UID)
l.m.Unlock()
telemetryStorePresent := l.telemetryStore != nil
if telemetryStorePresent {
l.telemetryStore.WatchedResources.Dec(kubeEndpointsName, telemetry.ResourceKubeService)
}
for _, ep := range eps {
log.Debugf("Deleting AD service: %s", ep.entity)
l.delService <- ep
if telemetryStorePresent {
l.telemetryStore.WatchedResources.Dec(kubeEndpointsName, telemetry.ResourceKubeEndpoint)
}
}
} else {
log.Debugf("Entity %s not found, not removing", kep.UID)
}
}
// isLockForLE returns true if the Endpoints object is used for leader election.
func isLockForLE(kep *v1.Endpoints) bool {
if kep != nil {
if _, found := kep.GetAnnotations()[leaderAnnotation]; found {
return true
}
}
return false
}
// getStandardTagsForEndpoints returns the standard tags defined in the labels
// of the Service that corresponds to a given Endpoints object.
func (l *KubeEndpointsListener) getStandardTagsForEndpoints(kep *v1.Endpoints) ([]string, error) {
ksvc, err := l.serviceLister.Services(kep.Namespace).Get(kep.Name)
if err != nil {
return nil, err
}
return getStandardTags(ksvc.GetLabels()), nil
}
// Equal returns whether the two KubeEndpointService are equal
func (s *KubeEndpointService) Equal(o Service) bool {
s2, ok := o.(*KubeEndpointService)
if !ok {
return false
}
return s.entity == s2.entity &&
reflect.DeepEqual(s.tags, s2.tags) &&
reflect.DeepEqual(s.hosts, s2.hosts) &&
reflect.DeepEqual(s.ports, s2.ports)
}
// GetServiceID returns the unique entity name linked to that service
func (s *KubeEndpointService) GetServiceID() string {
return s.entity
}
// GetADIdentifiers returns the service AD identifiers
func (s *KubeEndpointService) GetADIdentifiers(context.Context) ([]string, error) {
return []string{s.entity}, nil
}
// GetHosts returns the pod hosts
func (s *KubeEndpointService) GetHosts(context.Context) (map[string]string, error) {
if s.hosts == nil {
return map[string]string{}, nil
}
return s.hosts, nil
}
// GetPid is not supported
func (s *KubeEndpointService) GetPid(context.Context) (int, error) {
return -1, ErrNotSupported
}
// GetPorts returns the endpoint's ports
func (s *KubeEndpointService) GetPorts(context.Context) ([]ContainerPort, error) {
if s.ports == nil {
return []ContainerPort{}, nil
}
return s.ports, nil
}
// GetTags retrieves tags
func (s *KubeEndpointService) GetTags() ([]string, error) {
if s.tags == nil {
return []string{}, nil
}
return s.tags, nil
}
// GetHostname returns nil and an error because port is not supported in Kubelet
func (s *KubeEndpointService) GetHostname(context.Context) (string, error) {
return "", ErrNotSupported
}
// IsReady returns if the service is ready
func (s *KubeEndpointService) IsReady(context.Context) bool {
return true
}
// HasFilter returns whether the kube endpoint should not collect certain metrics
// due to filtering applied.
func (s *KubeEndpointService) HasFilter(filter containers.FilterType) bool {
switch filter {
case containers.MetricsFilter:
return s.metricsExcluded
case containers.GlobalFilter:
return s.globalExcluded
default:
return false
}
}
// GetExtraConfig isn't supported
//
//nolint:revive // TODO(CINT) Fix revive linter
func (s *KubeEndpointService) GetExtraConfig(key string) (string, error) {
return "", ErrNotSupported
}
// FilterTemplates does nothing.
func (s *KubeEndpointService) FilterTemplates(map[string]integration.Config) {
}
``` |
The Nant de Drance Hydropower Plant is a pumped-storage power station in the canton of Valais in Switzerland. It is within the municipality of Finhaut, district of Saint-Maurice and about southwest of Martigny. Construction on the power plant began in 2008 and it began operations in 2022. It is owned by Nant de Drance SA, a consortium of Alpiq (39%), SBB (36%), (15%) and (FMV) (10%). The US$1.9 billion plant has installed capacity of 900 MW and an energy storage capacity of 20 GWh.
Background
On 25 August 2008, the Swiss Federal Department of Environment, Transport, Energy and Communications granted a building permit to Nant de Drance SA for the construction of the plant with a 600 MW design. Preliminary construction began in September 2008 but a concession was granted in April 2011 which allowed for a larger 900 MW plant. Excavation of the tunnels began in 2009 and the caverns commenced in 2010. Raising of the upper Vieux Emosson Dam began in Spring 2013 and should be done by the end of 2015. The underground power house excavation was complete in April 2014. The first generators should be tested in 2017 with all six commissioned between 2018 and 2021.
In December 2014, at the International Tunnelling & Underground Space Awards, the project was awarded the Major Tunnelling Project of the Year award in the category of projects over US$500 million.
Design
The power plant use two existing reservoirs to operate. The lower reservoir, Lac d'Emosson, is formed by the tall, long Émosson Dam, an arch dam which was completed in 1974. It withholds a reservoir with a storage capacity of and surface area of . The lower reservoir is long and when full, lies above sea level.
The upper reservoir for the plant, Lac du Vieux Emosson, is formed by a tall and long arch dam originally completed in 1955. The dam is undergoing a raising and will be tall when done. When raised, Lac du Vieux Emosson's storage capacity will be doubled and it will withhold and have a surface area of . When full, the upper reservoir will lie above sea level.
The power plant will lie in-between both reservoirs and use the pumped-storage hydroelectric method. To accomplish this, when energy demand is high, water will be released from the upper reservoir, down a series of penstocks to the six 150 MW reversible Francis turbine-generators in the power plant. The large underground power house measures long, high and wide. After generating power, water from the power plant is discharged to the lower reservoir, releasing up to 20 GWh of energy. When power demand is low, such as at night, the turbines reverse and water can be pumped back up to the upper reservoir for use during high demand periods. As such, it serves as a peaking power plant with 80% efficiency.
Under the guidance of AF-Consult Switzerland Ltd as general planner, the civil engineering works were carried out by GMI (a joint venture of Marti and Implenia) and the electro-mechanical works are being undertaken by GE Hydro.
References
Hydroelectric power stations in Switzerland
Pumped-storage hydroelectric power stations in Switzerland
Buildings and structures in Valais
Dams in Switzerland
Arch dams
Underground power stations
Energy infrastructure under construction |
The 2009–10 Welsh Football League Division Two began on 15 August 2009 and ended on 22 May 2010. Penrhiwceiber Rangers won the league by two points.
Team changes from 2008–09
West End, Ely Rangers and Garden Village were promoted to the Welsh Football League Division One.
Cwmbran Town, Croesyceiliog and Newport YMCA were relegated from the Welsh Football League Division One.
Pentwyn Dynamos, Garw and Pontypridd Town were relegated to the Welsh Football League Division Three.
AFC Llwydcoed, AFC Porth and Porthcawl Town were promoted from the Welsh Football League Division Three.
League table
Results
External links
Welsh Football League
Welsh Football League Division Two seasons
3 |
The 1986 Virginia Cavaliers football team represented the University of Virginia during the 1986 NCAA Division I-A football season. The Cavaliers were led by fifth-year head coach George Welsh and played their home games at Scott Stadium in Charlottesville, Virginia. They competed as members of the Atlantic Coast Conference, finishing tied for sixth.
Schedule
Personnel
Season summary
NC State
At North Carolina
North Carolina's Eric Lewis and Virginia's Eric Clay were ejected in second quarter for fighting
North Carolina's late touchdown pass angered Virginia players but Virginia had called timeout just prior to the scoring play
References
Virginia
Virginia Cavaliers football seasons
Virginia Cavaliers football |
```smalltalk
/*
This file is part of the iText (R) project.
Authors: Apryse Software.
This program is offered under a commercial and under the AGPL license.
For commercial licensing, contact us at path_to_url For AGPL licensing, see below.
AGPL licensing:
This program is free software: you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program. If not, see <path_to_url
*/
using iText.Commons.Bouncycastle.Asn1;
namespace iText.Commons.Bouncycastle.Asn1.X509 {
/// <summary>
/// This interface represents the wrapper for KeyPurposeId that provides the ability
/// to switch between bouncy-castle and bouncy-castle FIPS implementations.
/// </summary>
public interface IKeyPurposeID : IAsn1Encodable {
/// <summary>
/// Gets
/// <c>id_kp_OCSPSigning</c>
/// constant for the wrapped KeyPurposeId.
/// </summary>
/// <returns>KeyPurposeId.id_kp_OCSPSigning value.</returns>
IKeyPurposeID GetIdKpOCSPSigning();
}
}
``` |
```xml
import { Type } from '../../src/decorators';
import { Album } from './Album';
import { User } from './User';
export class Photo {
id: string;
filename: string;
description: string;
tags: string[];
@Type(() => User)
author: User;
@Type(() => Album)
albums: Album[];
get name() {
return this.id + '_' + this.filename;
}
getAlbums() {
console.log('this is not serialized/deserialized');
return this.albums;
}
}
``` |
MV John J. Boland is a diesel-powered lake freighter owned and operated by the Buffalo-based American Steamship Company (ASC), a subsidiary of Rand Logistics. This vessel was built in 1973 at Bay Shipbuilding Company, Sturgeon Bay, Wisconsin. Initially named Charles E. Wilson, the vessel was renamed to its current name in 2000.
She is a self-unloading vessel, with a boom, mounting a conveyor belt, that could be swung to port or starboard. The ship is long and wide, with a carrying capacity of 34,000 tons (at midsummer draft), limestone, grain, coal or iron ore.
Design and description
The bulk carrier is long overall and between perpendiculars with a beam of . At the time of construction, the vessel was measured at and . The ship is powered by two GM diesel engines rated at driving one shaft and bow and stern thrusters. The ship has a maximum speed of . She is a self-unloading vessel, with a boom, mounting a conveyor belt, that could be swung 105° to port or starboard. The ship has 22 hatches for 6 holds.
Service history
The ship was built under the terms of the Merchant Marine Act of 1970, the first of nine vessels built by the Buffalo-based American Steamship Company, taking advantage of the Act's loan guarantees. She cost $13.7 million USD. The ship was constructed by Bay Shipbuilding at their yard in Sturgeon Bay, Wisconsin with the yard number 710. The ship was launched on March 10, 1973 and completed on September 1 later that year as Charles E. Wilson. The official owner of the ship is the Franklin Steamship Company, a subsidiary of the American Steamship Company, with the exception of a short period in 1978 where the American Steam Ship Company took over. The vessel is registered in Wilmington, Delaware.
Operated by the American Steamship Company on the Great Lakes, Charles E. Wilson served uneventfully until 2000. In January 2000 the third ship to be named John J. Boland was sold and Charles E. Wilson was renamed John J. Boland. On January 2, 2018 John J. Boland was among the ships that became trapped in ice on Lake Erie. The ship was freed by United States Coast Guard vessels on January 4. The ship is currently in service.
References
External links
1973 ships
Great Lakes freighters
Ships built in Sturgeon Bay, Wisconsin |
Trump Plaza is a 36-story cooperative apartment and retail building at 167 East 61st Street on the Upper East Side of Manhattan, New York City. The property, designed by
Philip Birnbaum and named after Donald Trump, opened in 1984 at a cost of $125 million.
History
Construction
Construction of Trump Plaza began in 1982, at the intersection of East 61st Street and Third Avenue. Donald Trump negotiated a 40-year deal with the owner of the land in which the building would pay an annual rent of approximately $1.2 million until 2023. Trump chose to name the project Trump Plaza to capitalize on the marketing success of his nearby Trump Tower. The project, initially expected to cost $50 million, was to contain 180 cooperative apartment units, located above of retail space that would be situated on the ground floor.
Two project offices on East 61st Street, made of brownstone, were to be converted into apartments after the main structure was completed. Trump said that despite the popularity of condominiums in New York at that time, "I wanted to buck the trend. There are a lot of people who want to live in a cooperative. […] Many people find a co-op's exclusivity, the unity it gives a building, comforting. This exclusivity can be used negatively, but it has positive aspects as well." Units would range from to , with prices between $285,000 and $1 million.
Sales began in April 1983, with initial prices starting at $450 per square foot. In May 1983, a construction worker died after falling 33 stories while working on the project. By July 1983, starting prices for apartment units in the project had increased six times, ultimately reaching up to $1,200 per square foot; 50 percent of the apartments had been leased up to that point. The building cost $125 million to construct.
The concrete and concrete workers union labor for the building was supplied by mobster Anthony "Fat Tony" Salerno. Salerno and Trump were linked through Roy Cohn, who represented both of them. In 1986 Rudy Giuliani and the SDNY indicted Salerno on racketeering linked to the bid rigging of concrete and construction on Trump Plaza, as well as other buildings built in the era.
Opening and operation
Trump Plaza was opened in March 1984, with 145 units. Notable residents included former Kentucky governor John Y. Brown Jr. and his wife Phyllis George, as well as Dick Clark and Martina Navratilova. At the time of opening, Trump owned 90 percent of the building partnership. Apartment owners, under the name of Trump Plaza Owners Inc., sued Trump in February 1990, claiming the building contained various defects. The suit sought for Trump to pay $10.7 million and to have his name removed from the building.
As of 1999, Trump still owned a few apartment units, as well as retail space and the property's parking garage. As of 2015, the property is operated by Douglas Elliman Property Management. In 2016, to remain competitive with newer residential projects, Trump Plaza's basement gym facility was converted into a children's playroom, while the gym was relocated to a space on the first and second floor that was previously used as an apartment by the building superintendent.
Design
Trump Plaza was designed by Philip Birnbaum and was built out in a Y-shape. The structure is made of limestone, glass, and metal, and includes five apartments on each floor, while the building includes a total of . Trump, who sometimes exaggerated the number of floors in his buildings, stated that Trump Plaza was 39 stories high while it is actually 36 stories.
Although Birnbaum was known for simple building designs in New York City, architectural critic Paul Goldberger stated that Trump Plaza "looks as if it might be the finest building in Caracas – all of this sleekness is chic in a particularly Latin way, quite uncharacteristic of New York, despite the lavish use of limestone." Goldberger also stated that no one "could possibly mistake it for yet another Third Avenue high-rise." Goldberger later called it "a better and more striking building than the typical Third Avenue brick box, but it is nothing if not showy."
Birnbaum was subsequently hired to design a nearby high-rise condominium known as the Savoy, to be built at the opposite intersection corner diagonally across from Trump Plaza. Birnbaum gave the Savoy a similar design to Trump Plaza, as he envisioned the buildings as the gateway to upper Third Avenue. In April 1984, Trump sued Birnbaum and Morton Olshan, owner of the Savoy, for allegedly copying the design of his building. Trump sought $60 million in damages. A settlement was reached in October 1984, after Olshan agreed to have his building redesigned. The Savoy was still under construction at the time.
In 2016, Steve Cuozzo of the New York Post stated that the area around Trump Plaza had been "a lost highway of tenements and boxy, bland apartment buildings" and that the project "inspired four more similarly configured towers on the avenue and lent some badly needed class to uptown east of Lexington Avenue."
Retail
An Italian restaurant named Alo Alo, owned by film producer Dino De Laurentiis and Brazilian business partner Ricardo Amaral, opened inside the building in 1985. By 1989, the restaurant had been sold. In 2004, Select Comfort signed a 10-year lease to operate a furniture store inside the building, replacing a restaurant known as Commissary. In 2007, western retailer Billy Martin's USA opened a new store inside Trump Plaza. In 2012, the Lobel's Kitchen opened inside the building. By April 2014, the Lobel's Kitchen space was for lease at a cost of $600,000 per year. Within two months, American Apparel planned to open a store in the former Lobel's space.
References
Donald Trump
Residential skyscrapers in Manhattan
Residential buildings completed in 1984
Condominiums and housing cooperatives in Manhattan |
Ercole Gennari (10 March 1597 – 27 June 1658) was an Italian Renaissance drawer and painter.
Son of the painter Benedetto Gennari and Julia Bovi, Ercole was baptized in the collegiate church of San Biagio, in Cento. He originally studied to be a surgeon. However his lifetime association with the painter Guercino, including the marrying his sister Lucia in 1628, and the guidance and influence of his father and his older brother the painter Bartolomeo Gennari (1594-1661), led Ercole to choose the profession of painter. His style puts him in the Bolognese School of painting. He painted Madonna and Child with St. Felix of Cantalice and Trinity with Saints Ursula, Francesco and Antonio, preserved in the Pinacoteca Comunale di Cesena. After the death of Paul Anthony, the brother of Guercino who was the assistant principal and administrator of the painting workshop, Ercole went to live with his wife and sons Benedetto and Cesare, in Bologna, in the house of Guercino, who, without a family of his own, needed someone to maintain the relationships with customers and administer the property, which he bequeathed to the young grandchildren to whom he had also taught him to paint. Ercole Gennari was buried in the family chapel of the Bolognese church of St. Nicholas of Albari.
References
JA Calvi, News of the life and works of the knight Giovanni Francesco Barbieri Guercino, Bologna 1808
The School of Guercino, edited by E. Negro, M. and N. Pirondini Roio, with a preface by DM Stone, Modena 2004
Italian Renaissance painters
1597 births
1658 deaths
Italian male painters
People from Cento
17th-century Italian painters |
```ruby
# Creates the path prefix using information provided from the
# resource_type & test_template_type
def file_path_prefix(resource_type, test_template_type)
resource_name = resource_type.sub('AWS::', '').gsub('::', '_').downcase
path_prefix = [
test_template_type,
resource_name,
resource_name
].join('/') + '_'
path_prefix
end
# Name of the password tests to run, matching the test teplates file names
# States whether the test should be a pass or fail
def password_rule_test_sets
{
'not set': 'pass',
'parameter with NoEcho': 'pass',
'parameter with NoEcho and Default value': 'fail',
'parameter as a literal in plaintext': 'fail',
'as a literal in plaintext': 'fail',
'from Secrets Manager': 'pass',
'from Secure Systems Manager': 'pass',
'from Systems Manager': 'fail'
}
end
# Name of the boolean tests to run, matching the test teplates file names
# States whether the test should be a pass or fail
def boolean_rule_test_sets
{
'not set': 'fail',
'set': 'pass'
}
end
# Returns a string based on the value result of the password_rule_test_sets
def context_return_value(desired_test_result)
raise 'desired_test_result value must be either "pass" or "fail"' unless
%w[pass fail].include?(desired_test_result)
if desired_test_result == 'fail'
'returns offending logical resource id'
else
'returns empty list'
end
end
# Creates the string name for the rule
def rule_name(resource_type, password_property, sub_property_name)
if sub_property_name.nil?
_nil_sub_property_name_rule_name(resource_type, password_property)
else
_not_nil_sub_property_name_rule_name(
resource_type, password_property, sub_property_name
)
end
end
# Creates the logic for the rule name if sub_property_name is nil
def _nil_sub_property_name_rule_name(resource_type, password_property)
[
resource_type.sub('AWS', '').gsub('::', ''),
password_property,
'Rule'
].join
end
# Creates the logic for the rule name if sub_property_name is present
def _not_nil_sub_property_name_rule_name(
resource_type, password_property, sub_property_name
)
[
resource_type.sub('AWS', '').gsub('::', ''),
password_property,
sub_property_name,
'Rule'
].join
end
# Creates full file path string
def file_path(
resource_type, test_template_type, password_property, sub_property_name,
test_description
)
if sub_property_name.nil?
_nil_sub_property_name_file_path(
resource_type, test_template_type, password_property, test_description
)
else
_not_nil_sub_property_name_file_path(
resource_type, test_template_type, password_property,
sub_property_name, test_description
)
end
end
# Creates the logic for the file path if sub_property_name is nil
def _nil_sub_property_name_file_path(
resource_type, test_template_type, password_property, test_description
)
[
file_path_prefix(resource_type, test_template_type),
password_property.gsub(/(?<=[a-z])(?=[A-Z])/, ' ').gsub(' ', '_').downcase,
'_',
test_description.to_s.gsub(' ', '_').downcase,
'.',
test_template_type
].join
end
# Creates the logic for the file path if sub_property_name is present
def _not_nil_sub_property_name_file_path(
resource_type, test_template_type, password_property,
sub_property_name, test_description
)
[
file_path_prefix(resource_type, test_template_type),
password_property.gsub(/(?<=[a-z])(?=[A-Z])/, ' ').gsub(' ', '_').downcase,
'_',
sub_property_name.gsub(/(?<=[a-z])(?=[A-Z])/, ' ').gsub(' ', '_').downcase,
'_',
test_description.to_s.gsub(' ', '_').downcase,
'.',
test_template_type
].join
end
# Returns an array based on the value result of the password_rule_test_sets
def expected_logical_resource_ids(desired_test_result, resource_type)
raise 'desired_test_result value must be either "pass" or "fail"' unless
%w[pass fail].include?(desired_test_result)
if desired_test_result == 'fail'
[resource_type.sub('AWS::', '').gsub('::', '')]
else
[]
end
end
# Run the spec test
def run_test(
resource_type, password_property, sub_property_name, test_template_type,
test_description, desired_test_result
)
cfn_model =
CfnParser.new.parse read_test_template(
file_path(
resource_type, test_template_type, password_property,
sub_property_name, test_description
)
)
actual_logical_resource_ids = described_class.new.audit_impl cfn_model
expect(actual_logical_resource_ids).to eq \
expected_logical_resource_ids(desired_test_result, resource_type)
end
``` |
Guils de Cerdanya is a municipality in the comarca of Cerdanya, province of Girona, Catalonia, Spain.
Attractions include the Romanesque church of Sant Esteven (12th century).
References
Panareda Clopés, Josep Maria; Rios Calvet, Jaume; Rabella Vives, Josep Maria (1989). Guia de Catalunya, Barcelona: Caixa de Catalunya. (Spanish). (Catalan).
External links
Government data pages
Municipalities in Cerdanya (comarca)
Municipalities in the Province of Girona
Populated places in the Province of Girona |
```c++
# /* **************************************************************************
# * *
# * accompanying file LICENSE_1_0.txt or copy at
# * path_to_url
# * *
# ************************************************************************** */
#
# /* Revised by Edward Diener (2020) */
#
# /* See path_to_url for most recent version. */
#
# if defined(BOOST_PP_ITERATION_LIMITS)
# if !defined(BOOST_PP_FILENAME_1)
# error BOOST_PP_ERROR: depth #1 filename is not defined
# endif
# define BOOST_PP_VALUE BOOST_PP_TUPLE_ELEM(2, 0, BOOST_PP_ITERATION_LIMITS)
# include <boost/preprocessor/iteration/detail/bounds/lower1.hpp>
# define BOOST_PP_VALUE BOOST_PP_TUPLE_ELEM(2, 1, BOOST_PP_ITERATION_LIMITS)
# include <boost/preprocessor/iteration/detail/bounds/upper1.hpp>
# define BOOST_PP_ITERATION_FLAGS_1() 0
# undef BOOST_PP_ITERATION_LIMITS
# elif defined(BOOST_PP_ITERATION_PARAMS_1)
# define BOOST_PP_VALUE BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ITERATION_PARAMS_1)
# include <boost/preprocessor/iteration/detail/bounds/lower1.hpp>
# define BOOST_PP_VALUE BOOST_PP_ARRAY_ELEM(1, BOOST_PP_ITERATION_PARAMS_1)
# include <boost/preprocessor/iteration/detail/bounds/upper1.hpp>
# define BOOST_PP_FILENAME_1 BOOST_PP_ARRAY_ELEM(2, BOOST_PP_ITERATION_PARAMS_1)
# if BOOST_PP_ARRAY_SIZE(BOOST_PP_ITERATION_PARAMS_1) >= 4
# define BOOST_PP_ITERATION_FLAGS_1() BOOST_PP_ARRAY_ELEM(3, BOOST_PP_ITERATION_PARAMS_1)
# else
# define BOOST_PP_ITERATION_FLAGS_1() 0
# endif
# else
# error BOOST_PP_ERROR: depth #1 iteration boundaries or filename not defined
# endif
#
# undef BOOST_PP_ITERATION_DEPTH
# define BOOST_PP_ITERATION_DEPTH() 1
#
# define BOOST_PP_IS_ITERATING 1
#
# if (BOOST_PP_ITERATION_START_1) > (BOOST_PP_ITERATION_FINISH_1)
# include <boost/preprocessor/iteration/detail/iter/reverse1.hpp>
# else
#
# include <boost/preprocessor/config/config.hpp>
#
# if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_STRICT()
#
# if BOOST_PP_ITERATION_START_1 <= 0 && BOOST_PP_ITERATION_FINISH_1 >= 0
# define BOOST_PP_ITERATION_1 0
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 1 && BOOST_PP_ITERATION_FINISH_1 >= 1
# define BOOST_PP_ITERATION_1 1
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 2 && BOOST_PP_ITERATION_FINISH_1 >= 2
# define BOOST_PP_ITERATION_1 2
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 3 && BOOST_PP_ITERATION_FINISH_1 >= 3
# define BOOST_PP_ITERATION_1 3
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 4 && BOOST_PP_ITERATION_FINISH_1 >= 4
# define BOOST_PP_ITERATION_1 4
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 5 && BOOST_PP_ITERATION_FINISH_1 >= 5
# define BOOST_PP_ITERATION_1 5
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 6 && BOOST_PP_ITERATION_FINISH_1 >= 6
# define BOOST_PP_ITERATION_1 6
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 7 && BOOST_PP_ITERATION_FINISH_1 >= 7
# define BOOST_PP_ITERATION_1 7
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 8 && BOOST_PP_ITERATION_FINISH_1 >= 8
# define BOOST_PP_ITERATION_1 8
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 9 && BOOST_PP_ITERATION_FINISH_1 >= 9
# define BOOST_PP_ITERATION_1 9
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 10 && BOOST_PP_ITERATION_FINISH_1 >= 10
# define BOOST_PP_ITERATION_1 10
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 11 && BOOST_PP_ITERATION_FINISH_1 >= 11
# define BOOST_PP_ITERATION_1 11
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 12 && BOOST_PP_ITERATION_FINISH_1 >= 12
# define BOOST_PP_ITERATION_1 12
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 13 && BOOST_PP_ITERATION_FINISH_1 >= 13
# define BOOST_PP_ITERATION_1 13
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 14 && BOOST_PP_ITERATION_FINISH_1 >= 14
# define BOOST_PP_ITERATION_1 14
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 15 && BOOST_PP_ITERATION_FINISH_1 >= 15
# define BOOST_PP_ITERATION_1 15
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 16 && BOOST_PP_ITERATION_FINISH_1 >= 16
# define BOOST_PP_ITERATION_1 16
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 17 && BOOST_PP_ITERATION_FINISH_1 >= 17
# define BOOST_PP_ITERATION_1 17
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 18 && BOOST_PP_ITERATION_FINISH_1 >= 18
# define BOOST_PP_ITERATION_1 18
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 19 && BOOST_PP_ITERATION_FINISH_1 >= 19
# define BOOST_PP_ITERATION_1 19
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 20 && BOOST_PP_ITERATION_FINISH_1 >= 20
# define BOOST_PP_ITERATION_1 20
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 21 && BOOST_PP_ITERATION_FINISH_1 >= 21
# define BOOST_PP_ITERATION_1 21
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 22 && BOOST_PP_ITERATION_FINISH_1 >= 22
# define BOOST_PP_ITERATION_1 22
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 23 && BOOST_PP_ITERATION_FINISH_1 >= 23
# define BOOST_PP_ITERATION_1 23
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 24 && BOOST_PP_ITERATION_FINISH_1 >= 24
# define BOOST_PP_ITERATION_1 24
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 25 && BOOST_PP_ITERATION_FINISH_1 >= 25
# define BOOST_PP_ITERATION_1 25
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 26 && BOOST_PP_ITERATION_FINISH_1 >= 26
# define BOOST_PP_ITERATION_1 26
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 27 && BOOST_PP_ITERATION_FINISH_1 >= 27
# define BOOST_PP_ITERATION_1 27
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 28 && BOOST_PP_ITERATION_FINISH_1 >= 28
# define BOOST_PP_ITERATION_1 28
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 29 && BOOST_PP_ITERATION_FINISH_1 >= 29
# define BOOST_PP_ITERATION_1 29
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 30 && BOOST_PP_ITERATION_FINISH_1 >= 30
# define BOOST_PP_ITERATION_1 30
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 31 && BOOST_PP_ITERATION_FINISH_1 >= 31
# define BOOST_PP_ITERATION_1 31
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 32 && BOOST_PP_ITERATION_FINISH_1 >= 32
# define BOOST_PP_ITERATION_1 32
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 33 && BOOST_PP_ITERATION_FINISH_1 >= 33
# define BOOST_PP_ITERATION_1 33
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 34 && BOOST_PP_ITERATION_FINISH_1 >= 34
# define BOOST_PP_ITERATION_1 34
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 35 && BOOST_PP_ITERATION_FINISH_1 >= 35
# define BOOST_PP_ITERATION_1 35
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 36 && BOOST_PP_ITERATION_FINISH_1 >= 36
# define BOOST_PP_ITERATION_1 36
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 37 && BOOST_PP_ITERATION_FINISH_1 >= 37
# define BOOST_PP_ITERATION_1 37
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 38 && BOOST_PP_ITERATION_FINISH_1 >= 38
# define BOOST_PP_ITERATION_1 38
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 39 && BOOST_PP_ITERATION_FINISH_1 >= 39
# define BOOST_PP_ITERATION_1 39
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 40 && BOOST_PP_ITERATION_FINISH_1 >= 40
# define BOOST_PP_ITERATION_1 40
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 41 && BOOST_PP_ITERATION_FINISH_1 >= 41
# define BOOST_PP_ITERATION_1 41
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 42 && BOOST_PP_ITERATION_FINISH_1 >= 42
# define BOOST_PP_ITERATION_1 42
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 43 && BOOST_PP_ITERATION_FINISH_1 >= 43
# define BOOST_PP_ITERATION_1 43
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 44 && BOOST_PP_ITERATION_FINISH_1 >= 44
# define BOOST_PP_ITERATION_1 44
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 45 && BOOST_PP_ITERATION_FINISH_1 >= 45
# define BOOST_PP_ITERATION_1 45
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 46 && BOOST_PP_ITERATION_FINISH_1 >= 46
# define BOOST_PP_ITERATION_1 46
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 47 && BOOST_PP_ITERATION_FINISH_1 >= 47
# define BOOST_PP_ITERATION_1 47
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 48 && BOOST_PP_ITERATION_FINISH_1 >= 48
# define BOOST_PP_ITERATION_1 48
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 49 && BOOST_PP_ITERATION_FINISH_1 >= 49
# define BOOST_PP_ITERATION_1 49
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 50 && BOOST_PP_ITERATION_FINISH_1 >= 50
# define BOOST_PP_ITERATION_1 50
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 51 && BOOST_PP_ITERATION_FINISH_1 >= 51
# define BOOST_PP_ITERATION_1 51
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 52 && BOOST_PP_ITERATION_FINISH_1 >= 52
# define BOOST_PP_ITERATION_1 52
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 53 && BOOST_PP_ITERATION_FINISH_1 >= 53
# define BOOST_PP_ITERATION_1 53
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 54 && BOOST_PP_ITERATION_FINISH_1 >= 54
# define BOOST_PP_ITERATION_1 54
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 55 && BOOST_PP_ITERATION_FINISH_1 >= 55
# define BOOST_PP_ITERATION_1 55
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 56 && BOOST_PP_ITERATION_FINISH_1 >= 56
# define BOOST_PP_ITERATION_1 56
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 57 && BOOST_PP_ITERATION_FINISH_1 >= 57
# define BOOST_PP_ITERATION_1 57
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 58 && BOOST_PP_ITERATION_FINISH_1 >= 58
# define BOOST_PP_ITERATION_1 58
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 59 && BOOST_PP_ITERATION_FINISH_1 >= 59
# define BOOST_PP_ITERATION_1 59
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 60 && BOOST_PP_ITERATION_FINISH_1 >= 60
# define BOOST_PP_ITERATION_1 60
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 61 && BOOST_PP_ITERATION_FINISH_1 >= 61
# define BOOST_PP_ITERATION_1 61
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 62 && BOOST_PP_ITERATION_FINISH_1 >= 62
# define BOOST_PP_ITERATION_1 62
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 63 && BOOST_PP_ITERATION_FINISH_1 >= 63
# define BOOST_PP_ITERATION_1 63
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 64 && BOOST_PP_ITERATION_FINISH_1 >= 64
# define BOOST_PP_ITERATION_1 64
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 65 && BOOST_PP_ITERATION_FINISH_1 >= 65
# define BOOST_PP_ITERATION_1 65
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 66 && BOOST_PP_ITERATION_FINISH_1 >= 66
# define BOOST_PP_ITERATION_1 66
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 67 && BOOST_PP_ITERATION_FINISH_1 >= 67
# define BOOST_PP_ITERATION_1 67
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 68 && BOOST_PP_ITERATION_FINISH_1 >= 68
# define BOOST_PP_ITERATION_1 68
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 69 && BOOST_PP_ITERATION_FINISH_1 >= 69
# define BOOST_PP_ITERATION_1 69
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 70 && BOOST_PP_ITERATION_FINISH_1 >= 70
# define BOOST_PP_ITERATION_1 70
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 71 && BOOST_PP_ITERATION_FINISH_1 >= 71
# define BOOST_PP_ITERATION_1 71
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 72 && BOOST_PP_ITERATION_FINISH_1 >= 72
# define BOOST_PP_ITERATION_1 72
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 73 && BOOST_PP_ITERATION_FINISH_1 >= 73
# define BOOST_PP_ITERATION_1 73
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 74 && BOOST_PP_ITERATION_FINISH_1 >= 74
# define BOOST_PP_ITERATION_1 74
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 75 && BOOST_PP_ITERATION_FINISH_1 >= 75
# define BOOST_PP_ITERATION_1 75
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 76 && BOOST_PP_ITERATION_FINISH_1 >= 76
# define BOOST_PP_ITERATION_1 76
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 77 && BOOST_PP_ITERATION_FINISH_1 >= 77
# define BOOST_PP_ITERATION_1 77
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 78 && BOOST_PP_ITERATION_FINISH_1 >= 78
# define BOOST_PP_ITERATION_1 78
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 79 && BOOST_PP_ITERATION_FINISH_1 >= 79
# define BOOST_PP_ITERATION_1 79
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 80 && BOOST_PP_ITERATION_FINISH_1 >= 80
# define BOOST_PP_ITERATION_1 80
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 81 && BOOST_PP_ITERATION_FINISH_1 >= 81
# define BOOST_PP_ITERATION_1 81
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 82 && BOOST_PP_ITERATION_FINISH_1 >= 82
# define BOOST_PP_ITERATION_1 82
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 83 && BOOST_PP_ITERATION_FINISH_1 >= 83
# define BOOST_PP_ITERATION_1 83
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 84 && BOOST_PP_ITERATION_FINISH_1 >= 84
# define BOOST_PP_ITERATION_1 84
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 85 && BOOST_PP_ITERATION_FINISH_1 >= 85
# define BOOST_PP_ITERATION_1 85
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 86 && BOOST_PP_ITERATION_FINISH_1 >= 86
# define BOOST_PP_ITERATION_1 86
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 87 && BOOST_PP_ITERATION_FINISH_1 >= 87
# define BOOST_PP_ITERATION_1 87
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 88 && BOOST_PP_ITERATION_FINISH_1 >= 88
# define BOOST_PP_ITERATION_1 88
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 89 && BOOST_PP_ITERATION_FINISH_1 >= 89
# define BOOST_PP_ITERATION_1 89
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 90 && BOOST_PP_ITERATION_FINISH_1 >= 90
# define BOOST_PP_ITERATION_1 90
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 91 && BOOST_PP_ITERATION_FINISH_1 >= 91
# define BOOST_PP_ITERATION_1 91
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 92 && BOOST_PP_ITERATION_FINISH_1 >= 92
# define BOOST_PP_ITERATION_1 92
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 93 && BOOST_PP_ITERATION_FINISH_1 >= 93
# define BOOST_PP_ITERATION_1 93
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 94 && BOOST_PP_ITERATION_FINISH_1 >= 94
# define BOOST_PP_ITERATION_1 94
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 95 && BOOST_PP_ITERATION_FINISH_1 >= 95
# define BOOST_PP_ITERATION_1 95
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 96 && BOOST_PP_ITERATION_FINISH_1 >= 96
# define BOOST_PP_ITERATION_1 96
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 97 && BOOST_PP_ITERATION_FINISH_1 >= 97
# define BOOST_PP_ITERATION_1 97
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 98 && BOOST_PP_ITERATION_FINISH_1 >= 98
# define BOOST_PP_ITERATION_1 98
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 99 && BOOST_PP_ITERATION_FINISH_1 >= 99
# define BOOST_PP_ITERATION_1 99
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 100 && BOOST_PP_ITERATION_FINISH_1 >= 100
# define BOOST_PP_ITERATION_1 100
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 101 && BOOST_PP_ITERATION_FINISH_1 >= 101
# define BOOST_PP_ITERATION_1 101
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 102 && BOOST_PP_ITERATION_FINISH_1 >= 102
# define BOOST_PP_ITERATION_1 102
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 103 && BOOST_PP_ITERATION_FINISH_1 >= 103
# define BOOST_PP_ITERATION_1 103
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 104 && BOOST_PP_ITERATION_FINISH_1 >= 104
# define BOOST_PP_ITERATION_1 104
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 105 && BOOST_PP_ITERATION_FINISH_1 >= 105
# define BOOST_PP_ITERATION_1 105
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 106 && BOOST_PP_ITERATION_FINISH_1 >= 106
# define BOOST_PP_ITERATION_1 106
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 107 && BOOST_PP_ITERATION_FINISH_1 >= 107
# define BOOST_PP_ITERATION_1 107
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 108 && BOOST_PP_ITERATION_FINISH_1 >= 108
# define BOOST_PP_ITERATION_1 108
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 109 && BOOST_PP_ITERATION_FINISH_1 >= 109
# define BOOST_PP_ITERATION_1 109
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 110 && BOOST_PP_ITERATION_FINISH_1 >= 110
# define BOOST_PP_ITERATION_1 110
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 111 && BOOST_PP_ITERATION_FINISH_1 >= 111
# define BOOST_PP_ITERATION_1 111
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 112 && BOOST_PP_ITERATION_FINISH_1 >= 112
# define BOOST_PP_ITERATION_1 112
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 113 && BOOST_PP_ITERATION_FINISH_1 >= 113
# define BOOST_PP_ITERATION_1 113
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 114 && BOOST_PP_ITERATION_FINISH_1 >= 114
# define BOOST_PP_ITERATION_1 114
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 115 && BOOST_PP_ITERATION_FINISH_1 >= 115
# define BOOST_PP_ITERATION_1 115
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 116 && BOOST_PP_ITERATION_FINISH_1 >= 116
# define BOOST_PP_ITERATION_1 116
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 117 && BOOST_PP_ITERATION_FINISH_1 >= 117
# define BOOST_PP_ITERATION_1 117
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 118 && BOOST_PP_ITERATION_FINISH_1 >= 118
# define BOOST_PP_ITERATION_1 118
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 119 && BOOST_PP_ITERATION_FINISH_1 >= 119
# define BOOST_PP_ITERATION_1 119
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 120 && BOOST_PP_ITERATION_FINISH_1 >= 120
# define BOOST_PP_ITERATION_1 120
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 121 && BOOST_PP_ITERATION_FINISH_1 >= 121
# define BOOST_PP_ITERATION_1 121
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 122 && BOOST_PP_ITERATION_FINISH_1 >= 122
# define BOOST_PP_ITERATION_1 122
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 123 && BOOST_PP_ITERATION_FINISH_1 >= 123
# define BOOST_PP_ITERATION_1 123
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 124 && BOOST_PP_ITERATION_FINISH_1 >= 124
# define BOOST_PP_ITERATION_1 124
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 125 && BOOST_PP_ITERATION_FINISH_1 >= 125
# define BOOST_PP_ITERATION_1 125
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 126 && BOOST_PP_ITERATION_FINISH_1 >= 126
# define BOOST_PP_ITERATION_1 126
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 127 && BOOST_PP_ITERATION_FINISH_1 >= 127
# define BOOST_PP_ITERATION_1 127
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 128 && BOOST_PP_ITERATION_FINISH_1 >= 128
# define BOOST_PP_ITERATION_1 128
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 129 && BOOST_PP_ITERATION_FINISH_1 >= 129
# define BOOST_PP_ITERATION_1 129
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 130 && BOOST_PP_ITERATION_FINISH_1 >= 130
# define BOOST_PP_ITERATION_1 130
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 131 && BOOST_PP_ITERATION_FINISH_1 >= 131
# define BOOST_PP_ITERATION_1 131
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 132 && BOOST_PP_ITERATION_FINISH_1 >= 132
# define BOOST_PP_ITERATION_1 132
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 133 && BOOST_PP_ITERATION_FINISH_1 >= 133
# define BOOST_PP_ITERATION_1 133
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 134 && BOOST_PP_ITERATION_FINISH_1 >= 134
# define BOOST_PP_ITERATION_1 134
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 135 && BOOST_PP_ITERATION_FINISH_1 >= 135
# define BOOST_PP_ITERATION_1 135
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 136 && BOOST_PP_ITERATION_FINISH_1 >= 136
# define BOOST_PP_ITERATION_1 136
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 137 && BOOST_PP_ITERATION_FINISH_1 >= 137
# define BOOST_PP_ITERATION_1 137
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 138 && BOOST_PP_ITERATION_FINISH_1 >= 138
# define BOOST_PP_ITERATION_1 138
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 139 && BOOST_PP_ITERATION_FINISH_1 >= 139
# define BOOST_PP_ITERATION_1 139
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 140 && BOOST_PP_ITERATION_FINISH_1 >= 140
# define BOOST_PP_ITERATION_1 140
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 141 && BOOST_PP_ITERATION_FINISH_1 >= 141
# define BOOST_PP_ITERATION_1 141
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 142 && BOOST_PP_ITERATION_FINISH_1 >= 142
# define BOOST_PP_ITERATION_1 142
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 143 && BOOST_PP_ITERATION_FINISH_1 >= 143
# define BOOST_PP_ITERATION_1 143
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 144 && BOOST_PP_ITERATION_FINISH_1 >= 144
# define BOOST_PP_ITERATION_1 144
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 145 && BOOST_PP_ITERATION_FINISH_1 >= 145
# define BOOST_PP_ITERATION_1 145
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 146 && BOOST_PP_ITERATION_FINISH_1 >= 146
# define BOOST_PP_ITERATION_1 146
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 147 && BOOST_PP_ITERATION_FINISH_1 >= 147
# define BOOST_PP_ITERATION_1 147
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 148 && BOOST_PP_ITERATION_FINISH_1 >= 148
# define BOOST_PP_ITERATION_1 148
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 149 && BOOST_PP_ITERATION_FINISH_1 >= 149
# define BOOST_PP_ITERATION_1 149
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 150 && BOOST_PP_ITERATION_FINISH_1 >= 150
# define BOOST_PP_ITERATION_1 150
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 151 && BOOST_PP_ITERATION_FINISH_1 >= 151
# define BOOST_PP_ITERATION_1 151
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 152 && BOOST_PP_ITERATION_FINISH_1 >= 152
# define BOOST_PP_ITERATION_1 152
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 153 && BOOST_PP_ITERATION_FINISH_1 >= 153
# define BOOST_PP_ITERATION_1 153
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 154 && BOOST_PP_ITERATION_FINISH_1 >= 154
# define BOOST_PP_ITERATION_1 154
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 155 && BOOST_PP_ITERATION_FINISH_1 >= 155
# define BOOST_PP_ITERATION_1 155
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 156 && BOOST_PP_ITERATION_FINISH_1 >= 156
# define BOOST_PP_ITERATION_1 156
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 157 && BOOST_PP_ITERATION_FINISH_1 >= 157
# define BOOST_PP_ITERATION_1 157
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 158 && BOOST_PP_ITERATION_FINISH_1 >= 158
# define BOOST_PP_ITERATION_1 158
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 159 && BOOST_PP_ITERATION_FINISH_1 >= 159
# define BOOST_PP_ITERATION_1 159
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 160 && BOOST_PP_ITERATION_FINISH_1 >= 160
# define BOOST_PP_ITERATION_1 160
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 161 && BOOST_PP_ITERATION_FINISH_1 >= 161
# define BOOST_PP_ITERATION_1 161
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 162 && BOOST_PP_ITERATION_FINISH_1 >= 162
# define BOOST_PP_ITERATION_1 162
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 163 && BOOST_PP_ITERATION_FINISH_1 >= 163
# define BOOST_PP_ITERATION_1 163
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 164 && BOOST_PP_ITERATION_FINISH_1 >= 164
# define BOOST_PP_ITERATION_1 164
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 165 && BOOST_PP_ITERATION_FINISH_1 >= 165
# define BOOST_PP_ITERATION_1 165
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 166 && BOOST_PP_ITERATION_FINISH_1 >= 166
# define BOOST_PP_ITERATION_1 166
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 167 && BOOST_PP_ITERATION_FINISH_1 >= 167
# define BOOST_PP_ITERATION_1 167
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 168 && BOOST_PP_ITERATION_FINISH_1 >= 168
# define BOOST_PP_ITERATION_1 168
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 169 && BOOST_PP_ITERATION_FINISH_1 >= 169
# define BOOST_PP_ITERATION_1 169
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 170 && BOOST_PP_ITERATION_FINISH_1 >= 170
# define BOOST_PP_ITERATION_1 170
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 171 && BOOST_PP_ITERATION_FINISH_1 >= 171
# define BOOST_PP_ITERATION_1 171
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 172 && BOOST_PP_ITERATION_FINISH_1 >= 172
# define BOOST_PP_ITERATION_1 172
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 173 && BOOST_PP_ITERATION_FINISH_1 >= 173
# define BOOST_PP_ITERATION_1 173
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 174 && BOOST_PP_ITERATION_FINISH_1 >= 174
# define BOOST_PP_ITERATION_1 174
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 175 && BOOST_PP_ITERATION_FINISH_1 >= 175
# define BOOST_PP_ITERATION_1 175
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 176 && BOOST_PP_ITERATION_FINISH_1 >= 176
# define BOOST_PP_ITERATION_1 176
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 177 && BOOST_PP_ITERATION_FINISH_1 >= 177
# define BOOST_PP_ITERATION_1 177
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 178 && BOOST_PP_ITERATION_FINISH_1 >= 178
# define BOOST_PP_ITERATION_1 178
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 179 && BOOST_PP_ITERATION_FINISH_1 >= 179
# define BOOST_PP_ITERATION_1 179
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 180 && BOOST_PP_ITERATION_FINISH_1 >= 180
# define BOOST_PP_ITERATION_1 180
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 181 && BOOST_PP_ITERATION_FINISH_1 >= 181
# define BOOST_PP_ITERATION_1 181
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 182 && BOOST_PP_ITERATION_FINISH_1 >= 182
# define BOOST_PP_ITERATION_1 182
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 183 && BOOST_PP_ITERATION_FINISH_1 >= 183
# define BOOST_PP_ITERATION_1 183
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 184 && BOOST_PP_ITERATION_FINISH_1 >= 184
# define BOOST_PP_ITERATION_1 184
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 185 && BOOST_PP_ITERATION_FINISH_1 >= 185
# define BOOST_PP_ITERATION_1 185
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 186 && BOOST_PP_ITERATION_FINISH_1 >= 186
# define BOOST_PP_ITERATION_1 186
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 187 && BOOST_PP_ITERATION_FINISH_1 >= 187
# define BOOST_PP_ITERATION_1 187
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 188 && BOOST_PP_ITERATION_FINISH_1 >= 188
# define BOOST_PP_ITERATION_1 188
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 189 && BOOST_PP_ITERATION_FINISH_1 >= 189
# define BOOST_PP_ITERATION_1 189
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 190 && BOOST_PP_ITERATION_FINISH_1 >= 190
# define BOOST_PP_ITERATION_1 190
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 191 && BOOST_PP_ITERATION_FINISH_1 >= 191
# define BOOST_PP_ITERATION_1 191
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 192 && BOOST_PP_ITERATION_FINISH_1 >= 192
# define BOOST_PP_ITERATION_1 192
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 193 && BOOST_PP_ITERATION_FINISH_1 >= 193
# define BOOST_PP_ITERATION_1 193
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 194 && BOOST_PP_ITERATION_FINISH_1 >= 194
# define BOOST_PP_ITERATION_1 194
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 195 && BOOST_PP_ITERATION_FINISH_1 >= 195
# define BOOST_PP_ITERATION_1 195
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 196 && BOOST_PP_ITERATION_FINISH_1 >= 196
# define BOOST_PP_ITERATION_1 196
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 197 && BOOST_PP_ITERATION_FINISH_1 >= 197
# define BOOST_PP_ITERATION_1 197
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 198 && BOOST_PP_ITERATION_FINISH_1 >= 198
# define BOOST_PP_ITERATION_1 198
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 199 && BOOST_PP_ITERATION_FINISH_1 >= 199
# define BOOST_PP_ITERATION_1 199
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 200 && BOOST_PP_ITERATION_FINISH_1 >= 200
# define BOOST_PP_ITERATION_1 200
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 201 && BOOST_PP_ITERATION_FINISH_1 >= 201
# define BOOST_PP_ITERATION_1 201
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 202 && BOOST_PP_ITERATION_FINISH_1 >= 202
# define BOOST_PP_ITERATION_1 202
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 203 && BOOST_PP_ITERATION_FINISH_1 >= 203
# define BOOST_PP_ITERATION_1 203
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 204 && BOOST_PP_ITERATION_FINISH_1 >= 204
# define BOOST_PP_ITERATION_1 204
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 205 && BOOST_PP_ITERATION_FINISH_1 >= 205
# define BOOST_PP_ITERATION_1 205
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 206 && BOOST_PP_ITERATION_FINISH_1 >= 206
# define BOOST_PP_ITERATION_1 206
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 207 && BOOST_PP_ITERATION_FINISH_1 >= 207
# define BOOST_PP_ITERATION_1 207
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 208 && BOOST_PP_ITERATION_FINISH_1 >= 208
# define BOOST_PP_ITERATION_1 208
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 209 && BOOST_PP_ITERATION_FINISH_1 >= 209
# define BOOST_PP_ITERATION_1 209
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 210 && BOOST_PP_ITERATION_FINISH_1 >= 210
# define BOOST_PP_ITERATION_1 210
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 211 && BOOST_PP_ITERATION_FINISH_1 >= 211
# define BOOST_PP_ITERATION_1 211
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 212 && BOOST_PP_ITERATION_FINISH_1 >= 212
# define BOOST_PP_ITERATION_1 212
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 213 && BOOST_PP_ITERATION_FINISH_1 >= 213
# define BOOST_PP_ITERATION_1 213
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 214 && BOOST_PP_ITERATION_FINISH_1 >= 214
# define BOOST_PP_ITERATION_1 214
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 215 && BOOST_PP_ITERATION_FINISH_1 >= 215
# define BOOST_PP_ITERATION_1 215
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 216 && BOOST_PP_ITERATION_FINISH_1 >= 216
# define BOOST_PP_ITERATION_1 216
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 217 && BOOST_PP_ITERATION_FINISH_1 >= 217
# define BOOST_PP_ITERATION_1 217
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 218 && BOOST_PP_ITERATION_FINISH_1 >= 218
# define BOOST_PP_ITERATION_1 218
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 219 && BOOST_PP_ITERATION_FINISH_1 >= 219
# define BOOST_PP_ITERATION_1 219
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 220 && BOOST_PP_ITERATION_FINISH_1 >= 220
# define BOOST_PP_ITERATION_1 220
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 221 && BOOST_PP_ITERATION_FINISH_1 >= 221
# define BOOST_PP_ITERATION_1 221
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 222 && BOOST_PP_ITERATION_FINISH_1 >= 222
# define BOOST_PP_ITERATION_1 222
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 223 && BOOST_PP_ITERATION_FINISH_1 >= 223
# define BOOST_PP_ITERATION_1 223
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 224 && BOOST_PP_ITERATION_FINISH_1 >= 224
# define BOOST_PP_ITERATION_1 224
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 225 && BOOST_PP_ITERATION_FINISH_1 >= 225
# define BOOST_PP_ITERATION_1 225
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 226 && BOOST_PP_ITERATION_FINISH_1 >= 226
# define BOOST_PP_ITERATION_1 226
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 227 && BOOST_PP_ITERATION_FINISH_1 >= 227
# define BOOST_PP_ITERATION_1 227
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 228 && BOOST_PP_ITERATION_FINISH_1 >= 228
# define BOOST_PP_ITERATION_1 228
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 229 && BOOST_PP_ITERATION_FINISH_1 >= 229
# define BOOST_PP_ITERATION_1 229
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 230 && BOOST_PP_ITERATION_FINISH_1 >= 230
# define BOOST_PP_ITERATION_1 230
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 231 && BOOST_PP_ITERATION_FINISH_1 >= 231
# define BOOST_PP_ITERATION_1 231
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 232 && BOOST_PP_ITERATION_FINISH_1 >= 232
# define BOOST_PP_ITERATION_1 232
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 233 && BOOST_PP_ITERATION_FINISH_1 >= 233
# define BOOST_PP_ITERATION_1 233
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 234 && BOOST_PP_ITERATION_FINISH_1 >= 234
# define BOOST_PP_ITERATION_1 234
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 235 && BOOST_PP_ITERATION_FINISH_1 >= 235
# define BOOST_PP_ITERATION_1 235
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 236 && BOOST_PP_ITERATION_FINISH_1 >= 236
# define BOOST_PP_ITERATION_1 236
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 237 && BOOST_PP_ITERATION_FINISH_1 >= 237
# define BOOST_PP_ITERATION_1 237
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 238 && BOOST_PP_ITERATION_FINISH_1 >= 238
# define BOOST_PP_ITERATION_1 238
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 239 && BOOST_PP_ITERATION_FINISH_1 >= 239
# define BOOST_PP_ITERATION_1 239
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 240 && BOOST_PP_ITERATION_FINISH_1 >= 240
# define BOOST_PP_ITERATION_1 240
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 241 && BOOST_PP_ITERATION_FINISH_1 >= 241
# define BOOST_PP_ITERATION_1 241
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 242 && BOOST_PP_ITERATION_FINISH_1 >= 242
# define BOOST_PP_ITERATION_1 242
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 243 && BOOST_PP_ITERATION_FINISH_1 >= 243
# define BOOST_PP_ITERATION_1 243
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 244 && BOOST_PP_ITERATION_FINISH_1 >= 244
# define BOOST_PP_ITERATION_1 244
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 245 && BOOST_PP_ITERATION_FINISH_1 >= 245
# define BOOST_PP_ITERATION_1 245
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 246 && BOOST_PP_ITERATION_FINISH_1 >= 246
# define BOOST_PP_ITERATION_1 246
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 247 && BOOST_PP_ITERATION_FINISH_1 >= 247
# define BOOST_PP_ITERATION_1 247
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 248 && BOOST_PP_ITERATION_FINISH_1 >= 248
# define BOOST_PP_ITERATION_1 248
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 249 && BOOST_PP_ITERATION_FINISH_1 >= 249
# define BOOST_PP_ITERATION_1 249
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 250 && BOOST_PP_ITERATION_FINISH_1 >= 250
# define BOOST_PP_ITERATION_1 250
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 251 && BOOST_PP_ITERATION_FINISH_1 >= 251
# define BOOST_PP_ITERATION_1 251
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 252 && BOOST_PP_ITERATION_FINISH_1 >= 252
# define BOOST_PP_ITERATION_1 252
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 253 && BOOST_PP_ITERATION_FINISH_1 >= 253
# define BOOST_PP_ITERATION_1 253
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 254 && BOOST_PP_ITERATION_FINISH_1 >= 254
# define BOOST_PP_ITERATION_1 254
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 255 && BOOST_PP_ITERATION_FINISH_1 >= 255
# define BOOST_PP_ITERATION_1 255
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
# if BOOST_PP_ITERATION_START_1 <= 256 && BOOST_PP_ITERATION_FINISH_1 >= 256
# define BOOST_PP_ITERATION_1 256
# include BOOST_PP_FILENAME_1
# undef BOOST_PP_ITERATION_1
# endif
#
# else
#
# include <boost/preprocessor/config/limits.hpp>
#
# if BOOST_PP_LIMIT_ITERATION == 256
# include <boost/preprocessor/iteration/detail/iter/limits/forward1_256.hpp>
# elif BOOST_PP_LIMIT_ITERATION == 512
# include <boost/preprocessor/iteration/detail/iter/limits/forward1_256.hpp>
# include <boost/preprocessor/iteration/detail/iter/limits/forward1_512.hpp>
# elif BOOST_PP_LIMIT_ITERATION == 1024
# include <boost/preprocessor/iteration/detail/iter/limits/forward1_256.hpp>
# include <boost/preprocessor/iteration/detail/iter/limits/forward1_512.hpp>
# include <boost/preprocessor/iteration/detail/iter/limits/forward1_1024.hpp>
# else
# error Incorrect value for the BOOST_PP_LIMIT_ITERATION limit
# endif
#
# endif
#
# endif
#
# undef BOOST_PP_IS_ITERATING
#
# undef BOOST_PP_ITERATION_DEPTH
# define BOOST_PP_ITERATION_DEPTH() 0
#
# undef BOOST_PP_ITERATION_START_1
# undef BOOST_PP_ITERATION_FINISH_1
# undef BOOST_PP_FILENAME_1
#
# undef BOOST_PP_ITERATION_FLAGS_1
# undef BOOST_PP_ITERATION_PARAMS_1
``` |
Diorchis is a genus of flatworms belonging to the family Hymenolepididae.
The genus has cosmopolitan distribution.
Species:
Diorchis acuminatus
Diorchis americanus
Diorchis brevis
Diorchis bulbodes
Diorchis danutae
Diorchis diorchis
Diorchis donis
Diorchis endacantha
Diorchis flavescens
Diorchis formosensis
Diorchis inflata
Diorchis longicirrosa
Diorchis longiovum
Diorchis markewitschi
Diorchis nitidohamulus
Diorchis ovofurcata
Diorchis paranansomi
Diorchis parvogenitalis
Diorchis ransomi
Diorchis sobolevi
Diorchis spasskajae
Diorchis spinata
Diorchis stefanskii
Diorchis tuvensis
Diorchis wigginsi
References
Platyhelminthes |
This is a list of the National Register of Historic Places listings in Wise County, Virginia.
This is intended to be a complete list of the properties and districts on the National Register of Historic Places in Wise County, Virginia, United States. The locations of National Register properties and districts for which the latitude and longitude coordinates are included below, may be seen in an online map.
There are 20 properties and districts listed on the National Register in the county.
Current listings
|}
See also
List of National Historic Landmarks in Virginia
National Register of Historic Places listings in Virginia
References
Wise |
Rengsjöbilen (the Rengsjö car), Jonsson or just "Bilen" (the car) were names given to a series of ten cars made by sawmill owner Anders Jonsson in Rengsjö, Hälsingland, Sweden between 1914 and 1916. The cars were two-seater in tandem. Length 320 cm and width 120 cm. Weight 445 kg. The engine was 75x100 cc. The body, fenders, chassis, and other parts were made by Höjens verkstäder in Rengsjö. Many components such as motorcycle wheels, chains, and engine were bought from other sources. The car used belt transmission, and is said to have used a water-cooled, two-cylinder, two-stroke engine made in Morgårdshammar, mainly intended for boats, of power reported to have been between 6 and 10 hp. After production ended, several employees joined car manufacturer SAF in Bollnäs.
Four photographs of the cars exist, but the only physical remnant is due to a naughty boy: a son of Jonsson's took a car for a drive, and dented the grille. A man at the factory made him a new one so he could keep the incident a secret; he threw the dented grill into a lake. When he grew up he retrieved the grille and gave it to the old homestead museum.
Notes
Defunct motor vehicle manufacturers of Sweden |
```javascript
/* your_sha256_hash--------------
*
* # Google Visualization - lines
*
* Google Visualization line chart demonstration
*
* Version: 1.0
* Latest update: August 1, 2015
*
* your_sha256_hash------------ */
// Line chart
// ------------------------------
// Initialize chart
google.load("visualization", "1", {packages:["corechart"]});
google.setOnLoadCallback(drawLineChart);
// Chart settings
function drawLineChart() {
// Data
var data = google.visualization.arrayToDataTable([
['Year', 'Sales', 'Expenses'],
['2004', 1000, 400],
['2005', 1170, 460],
['2006', 660, 1120],
['2007', 1030, 540]
]);
// Options
var options = {
fontName: 'Roboto',
height: 400,
curveType: 'function',
fontSize: 12,
chartArea: {
left: '5%',
width: '90%',
height: 350
},
pointSize: 4,
tooltip: {
textStyle: {
fontName: 'Roboto',
fontSize: 13
}
},
vAxis: {
title: 'Sales and Expenses',
titleTextStyle: {
fontSize: 13,
italic: false
},
gridlines:{
color: '#e5e5e5',
count: 10
},
minValue: 0
},
legend: {
position: 'top',
alignment: 'center',
textStyle: {
fontSize: 12
}
}
};
// Draw chart
var line_chart = new google.visualization.LineChart($('#google-line')[0]);
line_chart.draw(data, options);
}
// Resize chart
// ------------------------------
$(function () {
// Resize chart on sidebar width change and window resize
$(window).on('resize', resize);
$(".sidebar-control").on('click', resize);
// Resize function
function resize() {
drawLineChart();
}
});
``` |
```ruby
# frozen_string_literal: true
module Decidim
# A custom mailer to notify Decidim users
# that they have been reported
class UserReportMailer < ApplicationMailer
def notify(admin, report)
@report = report
@admin = admin
@organization = report.moderation.user.organization
with_user(admin) do
mail(to: admin.email, subject: I18n.t(
"decidim.user_report_mailer.notify.subject",
organization_name: organization_name(report.moderation.user.organization),
reason: @report.reason
))
end
end
end
end
``` |
Davaajantsangiin Sarangerel () (born 1963) is a former photographer, journalist and the current Member of State Great Khural and Minister of Environment and Tourism in U.Khürelsükh's Second Cabinet. She served as Minister of Health in U.Khürelsükh's First Cabinet.
Sarangerel was born in Ulaanbaatar in 1963. After finishing her schooling in 1979, she went to Russia to study photography at the Omsk State University (1983). For two years, she worked with the Montsame news agency as a photographer, before receiving her degree in journalism from the Rostov University in 1990.
Sarangerel pursued a career in journalism and in 1990 became a correspondent for the Mongolian state broadcaster, where she later became its editor-in-chief. During 1995–99, she served as the director of Mongolia's national news agency. Later, Sarangerel joined TV5 in 2003 and worked as its general director from 2003 to 2005. She has been elected the chair of United Confederation of Mongolian Journalists twice.
A member of the Mongolian People's Party, Sarangerel was elected to the State Great Khural for the first time in 2012 and after her reelection four years later was made the Health Minister in Ukhnaagiin Khürelsükh's cabinet (2017).
References
1963 births
Living people
Mongolian journalists
Mongolian women journalists
Members of the State Great Khural
Mongolian People's Party politicians
Omsk State University alumni
Mongolian women photographers
Politicians from Ulaanbaatar
Women government ministers of Mongolia
Health ministers of Mongolia
20th-century Mongolian writers
21st-century Mongolian women politicians
21st-century Mongolian politicians |
Populus fremontii, commonly known as Frémont's cottonwood, is a cottonwood (and thus a poplar) native to riparian zones of the Southwestern United States and northern through central Mexico. It is one of three species in Populus sect. Aigeiros. The tree was named after 19th-century American explorer and pathfinder John C. Frémont.
Distribution
The tree is native to the Southwestern United States and Mexico. In the United States, the species can be found in California, Idaho, Nevada, Utah, Arizona, New Mexico, Texas, and Colorado. In Mexico, it can be found in Baja California, Baja California Sur, Sonora, Chihuahua, Coahuila, Nuevo León, México (state), and Puebla.
A riparian tree, it grows near streams, rivers, springs, seeps, wetlands, and well-watered alluvial bottomlands at elevations below elevation.
Description
P. fremontii is a large tree growing from in height with a wide crown, with a trunk up to in diameter. The bark is smooth when young, becoming deeply fissured with whitish, cracked bark on old trees.
The long leaves, are cordate (heart-shaped) with an elongated tip, with white veins and coarse crenate teeth along the sides, glabrous to hairy, and often stained with milky resin. Autumn colors occur from October–November, mainly a bright yellow, also orange, rarely red.
The inflorescence consists of a long, drooping catkin, which blooms from March to April. The fruit is a wind-dispersed achene, that appears to look like patches of cotton hanging from limbs, thus the name cottonwood.
The largest known P. fremontii tree in the United States grows in Skull Valley, Arizona. In 2012, it had a measured circumference of , height of , and a spread of .
Subspecies or varieties
Two subspecies are currently recognized. Some confusion due to hybridization with a Rio Grande subspecies of Populus deltoides subsp. wislizeni had originally placed this eastern cottonwood subspecies as a P. fremontii subspecies, but it was removed in 1977.
P. f. subsp. fremontii, with synonyms P. f. var. arizonica - Sarg. and P. f. var. macdougalii - (Rose) Jeps. from California and west of the Continental Divide
P. f. subsp. mesetae - Eckenwal., of arid areas of Mexico and west Texas, and widely planted elsewhere, generally east of the Continental Divide
Uses
Cultivation
P. fremontii is cultivated as an ornamental tree and riparian zone restoration tree. It is used in planting for wildlife food and shelter habitats, and ecological restoration, larger native plant and wildlife gardens, and natural landscaping projects, windbreaks, erosion control, and shade for recreation facilities, parks, and livestock.
Frémont's cottonwood was used in the past by settlers and ranchers for fuel and fence posts.
Native Americans
Traditional medicine
Native Americans in the Western United States and Mexico used parts of Frémont's cottonwood variously for a medicine, in basket weaving, for tool making, and for musical instruments. The inner bark of Frémont's cottonwood contains vitamin C and was chewed as an antiscorbutic - treatment for vitamin C deficiency. The bark and leaves could be used to make poultices to reduce inflammation or to treat wounds.
Art
The Pima people of southern Arizona and northern Mexico lived along Sonoran Desert watercourses and used twigs from the tree in the fine and intricate baskets they wove. The Cahuilla people of southern California used the tree's wood for tool making, the Pueblo peoples for drums, and the Lower Colorado River Quechan people in ritual cremations. The Hopi of Northeastern Arizona carve the root of the cottonwood to create kachina dolls.
See also
California native plants
Riparian buffer
Riparian forest
References
External links
Calflora Database: Populus fremontii (Fremont cottonwood)
Calflora Database: Populus fremontii ssp. fremontii
Populus fremontii — U.C. Photo gallery
Populus fremontii ssp. fremontii — U.C. Photo gallery
fremontii
Trees of Mexico
Trees of the Southwestern United States
Trees of Northwestern Mexico
Trees of Baja California
Trees of Baja California Sur
Trees of Chihuahua (state)
Trees of Coahuila
Trees of the Northwestern United States
Trees of the South-Central United States
Trees of Nuevo León
Trees of Puebla
Trees of Sonora
Flora of the Sonoran Deserts
Flora of the California desert regions
Flora of the Cascade Range
Flora of California
Flora of the Great Basin
Flora of the Klamath Mountains
Flora of the Sierra Nevada (United States)
Flora of the State of Mexico
Flora of the Rio Grande valleys
Natural history of the California Coast Ranges
Natural history of the Central Valley (California)
Natural history of the Colorado Desert
Natural history of the Lower Colorado River Valley
Natural history of the Mojave Desert
Natural history of the Peninsular Ranges
Natural history of the Santa Monica Mountains
Plants used in traditional Native American medicine
Garden plants of North America
Ornamental trees
Taxa named by Sereno Watson
Flora without expected TNC conservation status |
In mathematics, a separation relation is a formal way to arrange a set of objects in an unoriented circle. It is defined as a quaternary relation satisfying certain axioms, which is interpreted as asserting that a and c separate b from d.
Whereas a linear order endows a set with a positive end and a negative end, a separation relation forgets not only which end is which, but also where the ends are located. In this way it is a final, further weakening of the concepts of a betweenness relation and a cyclic order. There is nothing else that can be forgotten: up to the relevant sense of interdefinability, these three relations are the only nontrivial reducts of the ordered set of rational numbers.
Application
The separation may be used in showing the real projective plane is a complete space. The separation relation was described with axioms in 1898 by Giovanni Vailati.
=
=
⇒ ¬
∨ ∨
∧ ⇒ .
The relation of separation of points was written AC//BD by H. S. M. Coxeter in his textbook The Real Projective Plane. The axiom of continuity used is "Every monotonic sequence of points has a limit." The separation relation is used to provide definitions:
{An} is monotonic ≡ ∀ n > 1
M is a limit ≡ (∀ n > 2 ) ∧ (∀ P ⇒ ∃ n ).
References
Order theory |
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\Apigateway\Resource;
use Google\Service\Apigateway\ApigatewayCancelOperationRequest;
use Google\Service\Apigateway\ApigatewayEmpty;
use Google\Service\Apigateway\ApigatewayListOperationsResponse;
use Google\Service\Apigateway\ApigatewayOperation;
/**
* The "operations" collection of methods.
* Typical usage is:
* <code>
* $apigatewayService = new Google\Service\Apigateway(...);
* $operations = $apigatewayService->projects_locations_operations;
* </code>
*/
class ProjectsLocationsOperations extends \Google\Service\Resource
{
/**
* Starts asynchronous cancellation on a long-running operation. The server
* makes a best effort to cancel the operation, but success is not guaranteed.
* If the server doesn't support this method, it returns
* `google.rpc.Code.UNIMPLEMENTED`. Clients can use Operations.GetOperation or
* other methods to check whether the cancellation succeeded or whether the
* operation completed despite cancellation. On successful cancellation, the
* operation is not deleted; instead, it becomes an operation with an
* Operation.error value with a google.rpc.Status.code of 1, corresponding to
* `Code.CANCELLED`. (operations.cancel)
*
* @param string $name The name of the operation resource to be cancelled.
* @param ApigatewayCancelOperationRequest $postBody
* @param array $optParams Optional parameters.
* @return ApigatewayEmpty
* @throws \Google\Service\Exception
*/
public function cancel($name, ApigatewayCancelOperationRequest $postBody, $optParams = [])
{
$params = ['name' => $name, 'postBody' => $postBody];
$params = array_merge($params, $optParams);
return $this->call('cancel', [$params], ApigatewayEmpty::class);
}
/**
* Deletes a long-running operation. This method indicates that the client is no
* longer interested in the operation result. It does not cancel the operation.
* If the server doesn't support this method, it returns
* `google.rpc.Code.UNIMPLEMENTED`. (operations.delete)
*
* @param string $name The name of the operation resource to be deleted.
* @param array $optParams Optional parameters.
* @return ApigatewayEmpty
* @throws \Google\Service\Exception
*/
public function delete($name, $optParams = [])
{
$params = ['name' => $name];
$params = array_merge($params, $optParams);
return $this->call('delete', [$params], ApigatewayEmpty::class);
}
/**
* Gets the latest state of a long-running operation. Clients can use this
* method to poll the operation result at intervals as recommended by the API
* service. (operations.get)
*
* @param string $name The name of the operation resource.
* @param array $optParams Optional parameters.
* @return ApigatewayOperation
* @throws \Google\Service\Exception
*/
public function get($name, $optParams = [])
{
$params = ['name' => $name];
$params = array_merge($params, $optParams);
return $this->call('get', [$params], ApigatewayOperation::class);
}
/**
* Lists operations that match the specified filter in the request. If the
* server doesn't support this method, it returns `UNIMPLEMENTED`.
* (operations.listProjectsLocationsOperations)
*
* @param string $name The name of the operation's parent resource.
* @param array $optParams Optional parameters.
*
* @opt_param string filter The standard list filter.
* @opt_param int pageSize The standard list page size.
* @opt_param string pageToken The standard list page token.
* @return ApigatewayListOperationsResponse
* @throws \Google\Service\Exception
*/
public function listProjectsLocationsOperations($name, $optParams = [])
{
$params = ['name' => $name];
$params = array_merge($params, $optParams);
return $this->call('list', [$params], ApigatewayListOperationsResponse::class);
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(ProjectsLocationsOperations::class, 'Google_Service_Apigateway_Resource_ProjectsLocationsOperations');
``` |
General Heriberto Jara Corona (July 10, 1879 – April 17, 1968) was a Mexican revolutionary and politician who served as Governor of Veracruz.
Heriberto Jara was born in the town of Nogales, in the state of Veracruz, to Emilio Jara Andrade and María del Carmen Corona. He got enrolled in the Mexican Revolution while working at a factory in the municipality of Río Blanco in his native Veracruz.
The year Francisco I. Madero was elected President of Mexico he took over a seat in the Congress; then in 1916 he was elected again to serve in Congress and was one of the persons who drafted the 1917 Constitution. He served as Ambassador to Cuba and as Governor of Veracruz.
He was awarded the Stalin Peace Prize in 1950 and, in 1959, he received the Belisario Domínguez Medal of Honor. General Heriberto Jara International Airport in the port of Veracruz is named after him, as is the Stadium at Xalapa, built in 1925 on the grounds where William K. Boone had organized Olympic-style athletic games in 1922.
1879 births
1968 deaths
Governors of Veracruz
Governors of Tabasco
Members of the Chamber of Deputies (Mexico)
Ambassadors of Mexico to Cuba
Politicians from Veracruz
People of the Mexican Revolution
Recipients of the Belisario Domínguez Medal of Honor
Stalin Peace Prize recipients
Institutional Revolutionary Party politicians
20th-century Mexican politicians |
James Haley (formerly believed to be Fred Haley) was a professional baseball catcher. Haley played in Major League Baseball for the Troy Trojans in 1880. In 2 games for the Trojans, Haley went hitless in 7 at bats.
External links
Major League Baseball catchers
Troy Trojans players
Year of death missing
Year of birth missing
19th-century baseball players |
```html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "path_to_url">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (1.8.0_121) on Mon Mar 27 10:01:26 CEST 2017 -->
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>Uses of Interface org.activiti.engine.history.ProcessInstanceHistoryLogQuery (Flowable - Engine 5.23.0 API)</title>
<meta name="date" content="2017-03-27">
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
<script type="text/javascript" src="../../../../../script.js"></script>
</head>
<body>
<script type="text/javascript"><!--
try {
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="Uses of Interface org.activiti.engine.history.ProcessInstanceHistoryLogQuery (Flowable - Engine 5.23.0 API)";
}
}
catch(err) {
}
//-->
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar.top">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.top.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../overview-summary.html">Overview</a></li>
<li><a href="../package-summary.html">Package</a></li>
<li><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">Class</a></li>
<li class="navBarCell1Rev">Use</li>
<li><a href="../package-tree.html">Tree</a></li>
<li><a href="../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li>Prev</li>
<li>Next</li>
</ul>
<ul class="navList">
<li><a href="../../../../../index.html?org/activiti/engine/history/class-use/ProcessInstanceHistoryLogQuery.html" target="_top">Frames</a></li>
<li><a href="ProcessInstanceHistoryLogQuery.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_top");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<a name="skip.navbar.top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<div class="header">
<h2 title="Uses of Interface org.activiti.engine.history.ProcessInstanceHistoryLogQuery" class="title">Uses of Interface<br>org.activiti.engine.history.ProcessInstanceHistoryLogQuery</h2>
</div>
<div class="classUseContainer">
<ul class="blockList">
<li class="blockList">
<table class="useSummary" border="0" cellpadding="3" cellspacing="0" summary="Use table, listing packages, and an explanation">
<caption><span>Packages that use <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></span><span class="tabEnd"> </span></caption>
<tr>
<th class="colFirst" scope="col">Package</th>
<th class="colLast" scope="col">Description</th>
</tr>
<tbody>
<tr class="altColor">
<td class="colFirst"><a href="#org.activiti.engine">org.activiti.engine</a></td>
<td class="colLast">
<div class="block">Public API of the Activiti engine.<br/><br/>
Typical usage of the API starts by the creation of a <a href="../../../../../org/activiti/engine/ProcessEngineConfiguration.html" title="class in org.activiti.engine"><code>ProcessEngineConfiguration</code></a>
(typically based on a configuration file), from which a <a href="../../../../../org/activiti/engine/ProcessEngine.html" title="interface in org.activiti.engine"><code>ProcessEngine</code></a> can be obtained.<br/><br/>
Through the services obtained from such a <a href="../../../../../org/activiti/engine/ProcessEngine.html" title="interface in org.activiti.engine"><code>ProcessEngine</code></a>, BPM and workflow operation
can be executed:<br/><br/>
<b><a href="../../../../../org/activiti/engine/RepositoryService.html" title="interface in org.activiti.engine"><code>RepositoryService</code></a>: </b> Manages <a href="../../../../../org/activiti/engine/repository/Deployment.html" title="interface in org.activiti.engine.repository"><code>Deployment</code></a>s <br/>
<b><a href="../../../../../org/activiti/engine/RuntimeService.html" title="interface in org.activiti.engine"><code>RuntimeService</code></a>: </b> For starting and searching <a href="../../../../../org/activiti/engine/runtime/ProcessInstance.html" title="interface in org.activiti.engine.runtime"><code>ProcessInstance</code></a>s <br/>
<b><a href="../../../../../org/activiti/engine/TaskService.html" title="interface in org.activiti.engine"><code>TaskService</code></a>: </b> Exposes operations to manage human (standalone) <a href="../../../../../org/activiti/engine/task/Task.html" title="interface in org.activiti.engine.task"><code>Task</code></a>s,
such as claiming, completing and assigning tasks<br/>
<b><a href="../../../../../org/activiti/engine/IdentityService.html" title="interface in org.activiti.engine"><code>IdentityService</code></a>: </b> Used for managing <a href="../../../../../org/activiti/engine/identity/User.html" title="interface in org.activiti.engine.identity"><code>User</code></a>s,
<a href="../../../../../org/activiti/engine/identity/Group.html" title="interface in org.activiti.engine.identity"><code>Group</code></a>s and the relations between them<br/>
<b><a href="../../../../../org/activiti/engine/ManagementService.html" title="interface in org.activiti.engine"><code>ManagementService</code></a>: </b> Exposes engine admin and maintenance operations,
which have no relation to the runtime exection of business processes<br/>
<b><a href="../../../../../org/activiti/engine/HistoryService.html" title="interface in org.activiti.engine"><code>HistoryService</code></a>: </b> Exposes information about ongoing and past process instances.<br/>
<b><a href="../../../../../org/activiti/engine/FormService.html" title="interface in org.activiti.engine"><code>FormService</code></a>: </b> Access to form data and rendered forms for starting new process instances and completing tasks.<br/></div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><a href="#org.activiti.engine.history">org.activiti.engine.history</a></td>
<td class="colLast">
<div class="block">Classes related to the <a href="../../../../../org/activiti/engine/HistoryService.html" title="interface in org.activiti.engine"><code>HistoryService</code></a>.</div>
</td>
</tr>
</tbody>
</table>
</li>
<li class="blockList">
<ul class="blockList">
<li class="blockList"><a name="org.activiti.engine">
<!-- -->
</a>
<h3>Uses of <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a> in <a href="../../../../../org/activiti/engine/package-summary.html">org.activiti.engine</a></h3>
<table class="useSummary" border="0" cellpadding="3" cellspacing="0" summary="Use table, listing methods, and an explanation">
<caption><span>Methods in <a href="../../../../../org/activiti/engine/package-summary.html">org.activiti.engine</a> that return <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></span><span class="tabEnd"> </span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Method and Description</th>
</tr>
<tbody>
<tr class="altColor">
<td class="colFirst"><code><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></code></td>
<td class="colLast"><span class="typeNameLabel">HistoryService.</span><code><span class="memberNameLink"><a href="../../../../../org/activiti/engine/HistoryService.html#createProcessInstanceHistoryLogQuery-java.lang.String-">createProcessInstanceHistoryLogQuery</a></span>(<a href="path_to_url" title="class or interface in java.lang">String</a> processInstanceId)</code>
<div class="block">Allows to retrieve the <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLog.html" title="interface in org.activiti.engine.history"><code>ProcessInstanceHistoryLog</code></a> for one process instance.</div>
</td>
</tr>
</tbody>
</table>
</li>
<li class="blockList"><a name="org.activiti.engine.history">
<!-- -->
</a>
<h3>Uses of <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a> in <a href="../../../../../org/activiti/engine/history/package-summary.html">org.activiti.engine.history</a></h3>
<table class="useSummary" border="0" cellpadding="3" cellspacing="0" summary="Use table, listing methods, and an explanation">
<caption><span>Methods in <a href="../../../../../org/activiti/engine/history/package-summary.html">org.activiti.engine.history</a> that return <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></span><span class="tabEnd"> </span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Method and Description</th>
</tr>
<tbody>
<tr class="altColor">
<td class="colFirst"><code><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></code></td>
<td class="colLast"><span class="typeNameLabel">ProcessInstanceHistoryLogQuery.</span><code><span class="memberNameLink"><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html#includeActivities--">includeActivities</a></span>()</code>
<div class="block">The <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLog.html" title="interface in org.activiti.engine.history"><code>ProcessInstanceHistoryLog</code></a> will contain the <a href="../../../../../org/activiti/engine/history/HistoricActivityInstance.html" title="interface in org.activiti.engine.history"><code>HistoricActivityInstance</code></a> instances.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></code></td>
<td class="colLast"><span class="typeNameLabel">ProcessInstanceHistoryLogQuery.</span><code><span class="memberNameLink"><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html#includeComments--">includeComments</a></span>()</code>
<div class="block">The <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLog.html" title="interface in org.activiti.engine.history"><code>ProcessInstanceHistoryLog</code></a> will contain the <a href="../../../../../org/activiti/engine/task/Comment.html" title="interface in org.activiti.engine.task"><code>Comment</code></a> instances.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></code></td>
<td class="colLast"><span class="typeNameLabel">ProcessInstanceHistoryLogQuery.</span><code><span class="memberNameLink"><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html#includeFormProperties--">includeFormProperties</a></span>()</code>
<div class="block">The <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLog.html" title="interface in org.activiti.engine.history"><code>ProcessInstanceHistoryLog</code></a> will contain the <a href="../../../../../org/activiti/engine/history/HistoricFormProperty.html" title="interface in org.activiti.engine.history"><code>HistoricFormProperty</code></a> instances.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></code></td>
<td class="colLast"><span class="typeNameLabel">ProcessInstanceHistoryLogQuery.</span><code><span class="memberNameLink"><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html#includeTasks--">includeTasks</a></span>()</code>
<div class="block">The <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLog.html" title="interface in org.activiti.engine.history"><code>ProcessInstanceHistoryLog</code></a> will contain the <a href="../../../../../org/activiti/engine/history/HistoricTaskInstance.html" title="interface in org.activiti.engine.history"><code>HistoricTaskInstance</code></a> instances.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></code></td>
<td class="colLast"><span class="typeNameLabel">ProcessInstanceHistoryLogQuery.</span><code><span class="memberNameLink"><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html#includeVariables--">includeVariables</a></span>()</code>
<div class="block">The <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLog.html" title="interface in org.activiti.engine.history"><code>ProcessInstanceHistoryLog</code></a> will contain the <a href="../../../../../org/activiti/engine/history/HistoricVariableInstance.html" title="interface in org.activiti.engine.history"><code>HistoricVariableInstance</code></a> instances.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">ProcessInstanceHistoryLogQuery</a></code></td>
<td class="colLast"><span class="typeNameLabel">ProcessInstanceHistoryLogQuery.</span><code><span class="memberNameLink"><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html#includeVariableUpdates--">includeVariableUpdates</a></span>()</code>
<div class="block">The <a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLog.html" title="interface in org.activiti.engine.history"><code>ProcessInstanceHistoryLog</code></a> will contain the <a href="../../../../../org/activiti/engine/history/HistoricVariableUpdate.html" title="interface in org.activiti.engine.history"><code>HistoricVariableUpdate</code></a> instances.</div>
</td>
</tr>
</tbody>
</table>
</li>
</ul>
</li>
</ul>
</div>
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar.bottom">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.bottom.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../overview-summary.html">Overview</a></li>
<li><a href="../package-summary.html">Package</a></li>
<li><a href="../../../../../org/activiti/engine/history/ProcessInstanceHistoryLogQuery.html" title="interface in org.activiti.engine.history">Class</a></li>
<li class="navBarCell1Rev">Use</li>
<li><a href="../package-tree.html">Tree</a></li>
<li><a href="../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li>Prev</li>
<li>Next</li>
</ul>
<ul class="navList">
<li><a href="../../../../../index.html?org/activiti/engine/history/class-use/ProcessInstanceHistoryLogQuery.html" target="_top">Frames</a></li>
<li><a href="ProcessInstanceHistoryLogQuery.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_bottom");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<a name="skip.navbar.bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
``` |
```objective-c
/*
* WARNING: do not edit!
* Generated by util/mkbuildinf.pl
*
*
* in the file LICENSE in the source distribution or at
* path_to_url
*/
#define PLATFORM "platform: linux-aarch64"
#define DATE "built on: Wed Jan 31 13:00:44 2024 UTC"
/*
* Generate compiler_flags as an array of individual characters. This is a
* workaround for the situation where CFLAGS gets too long for a C90 string
* literal
*/
static const char compiler_flags[] = {
'c','o','m','p','i','l','e','r',':',' ','g','c','c',' ','-','f',
'P','I','C',' ','-','p','t','h','r','e','a','d',' ','-','W','a',
',','-','-','n','o','e','x','e','c','s','t','a','c','k',' ','-',
'W','a','l','l',' ','-','O','3',' ','-','D','O','P','E','N','S',
'S','L','_','U','S','E','_','N','O','D','E','L','E','T','E',' ',
'-','D','O','P','E','N','S','S','L','_','P','I','C',' ','-','D',
'O','P','E','N','S','S','L','_','B','U','I','L','D','I','N','G',
'_','O','P','E','N','S','S','L',' ','-','D','N','D','E','B','U',
'G','\0'
};
``` |
Mepantadrea is a monotypic moth genus of the family Erebidae erected by George Hampson in 1926. Its only species, Mepantadrea simia, was first described by Saalmüller in 1891. It is found on Madagascar.
References
Calpinae
Monotypic moth genera |
Thomas Main (1816–1881) was a Scottish minister who served as Moderator of the General Assembly for the Free Church of Scotland 1880–81.
Early life
He was born in Slamannan in central Scotland on 5 January 1816. His father was parish schoolmaster, from whom he received the rudiments of his education. When thirteen he attended the University of Glasgow, and seems to have been known for his industry and piety. Licensed to preach by the Presbytery of Glasgow, in October, 1838, in the following year he became minister of the High Church, Kilmarnock.
Church activities
In the controversy which led to the Disruption he took an active, and, in fact, a leading part, and did considerable service in the cause of the Free Church movement, both in Kilmarnock and elsewhere. In the Disruption of 1843 he left the established Church of Scotland to join the Free Church of Scotland. In 1850 he married Williamina, youngest daughter of John Cunninghame of Craigends. In 1857 he translated to Free St Marys in Edinburgh, in place of Rev Henry Grey. St Marys was on Albany Street in Edinburgh's Second New Town. Main lived at 7 Bellevue Crescent, slightly to the north. His church Deacon at St Mary's was David Octavius Hill. His public work seems to have been mostly in connection with the Free Church, and was occasionally interrupted by a trip to London or the Continent. He was Convenor of the Free Church Education Committee from 1873 and Convenor of the Free Church Foreign Mission Committee from 1878. In 1880 he was elected Moderator of the General Assembly, in succession to Rev James Chalmers Burns. This is the highest position in the Free Church of Scotland. He was succeeded as Moderator in 1881 by Rev William Laughton. Returning from the Continent in 1880, in order to prepare for his duties as Moderator of the Free Church Assembly, he heard Dean Stanley preach in St. Margaret's, Westminster. Dr. Main's comment on leaving the church was, "much disappointed, there was little memorable in his sermon, and no gospel." His occupancy of the Moderator's chair was not without difficulty, and not without credit to himself. As Moderator of the General Assembly in 1880, it fell to him to admonish and to counsel Professor Robertson Smith, on then being restored to his chair, which he did in a Christian and dignified manner.
Dr. Main seems to have been an earnest and energetic minister, strongly attached to the Free Church, but tolerant and desirous of being fair to others.
Legacy
He died soon after the General Assembly of 1881, on 28 May. He is buried in Warriston Cemetery. His grave lies on the south side of the central roundel.
After his death his wife published a Memorial of his life and work. The Memorials of the Life were reportedly written with considerable skill and taste. The sermons which occupy about half of the volume are strictly evangelical.
Due to his unexpected death the post as minister of St Mary's was not filled until 1883 (by Rev George Davidson).
St Mary's was demolished in 1983 to make way for an office building. The building had been compromised by the removal of its beautiful spire in 1956.
Artistic recognition
He was photographed by Hill & Adamson around 1844.
Family
In 1850 he married Williamina Cuninghame (1813-1887), youngest daughter of John Cuninghame of Craigends.
References
Citations
Sources
1816 births
1881 deaths
Alumni of the University of Glasgow
19th-century Ministers of the Free Church of Scotland |
Raymond James Houghton (born 9 January 1962) is a former professional footballer and current sports analyst and commentator with RTÉ Sport.
As a player, he was a midfielder, notably playing for Liverpool where he won two First Division titles and a two FA Cups before switching to Aston Villa ahead of the inaugural Premier League season. He also briefly played top flight football for both West Ham United and Crystal Palace with spells in the Football League for Fulham, Oxford United and Reading, before retiring with non-league Stevenage Borough.
Born in Glasgow, Scotland, Houghton played international football for the Republic of Ireland, for which he qualified through his Irish father. Houghton is particularly remembered by Irish fans for scoring two of the most important goals in the national team's history, which resulted in 1–0 victories over England in Stuttgart at the 1988 European Championship, and Italy at Giants Stadium at the 1994 World Cup.
Club career
Early career
Houghton was born in Castlemilk, Glasgow (where Arthur Graham, who would also become an international footballer, was an upstairs neighbour in the same tenement block), but began his professional career in London at West Ham United, after moving to London at the age of 10, where he came through the ranks and signed professional forms as a 17-year-old on 5 July 1979. Houghton's endeavour failed to make any impact at Upton Park and after 3 years, in which he made just one appearance as substitute, he was on the move. On 7 July 1982 he moved on to Fulham on a free transfer.
Fulham
Malcolm Macdonald had Tony Gale (later a Premier League title winner with Blackburn Rovers), Paul Parker (who went on to win several major trophies with Manchester United), Gerry Peyton (Republic of Ireland international goalkeeper) and Ray Lewington (ex-Chelsea) to form a mixture of youth and experience which ultimately won Fulham promotion to the Second Division at the end of the 1981–82 season. He then added Houghton to the side that would try to keep the Cottagers in the second division. They did, and comfortably so; in fact for much of the 1982–83 season it looked as though Fulham would achieve back-to-back promotions, however, their form after the turn of the year dipped. One of the most memorable sequences of matches that happened whilst Houghton was at Fulham was the League Cup third round tie against Liverpool in 1983. The first game finished 1–1 at Craven Cottage as did the replay at Anfield, Fulham then won the toss to take the second replay back to the Cottage. Many observers believe Fulham had done enough to have beaten the reigning cup holders but had let the Reds off the hook with their failure to put away the chances they created. Liverpool won the game 1–0 with a 25-yard thunderbolt from Graeme Souness.
In May 1985, he made a guest appearance for Manchester United in Peter Foley's testimonial.
Oxford United
Jim Smith had taken Oxford United to the top tier of English football. When he left in 1985, his replacement, Maurice Evans, looked to Houghton to help solidify their place in the league. He paid £147,000 for Houghton on 13 September 1985. Houghton had played 145 times for Fulham and scored 21 goals. He made his U's debut the day after he signed, in a 2–2 draw with Liverpool at the Manor Ground. By the end of his first season, Houghton had helped to steer Oxford clear of the relegation places, just staying up with a win on the final day of the season, but most notably scored the second goal in the club's 3–0 League Cup final victory over Smith's new team Queens Park Rangers at Wembley.
Liverpool
At the start of the 1987–88 season, Oxford were beaten 2–0 by Liverpool, who then offered £825,000 for his services. The deal was done and Houghton took the place of Craig Johnston on the right side of Liverpool's midfield, unusually wearing the No. 9 shirt which striker John Aldridge, his former Oxford teammate who had made the Anfield move himself a year earlier, had asked not to wear because of the pressure of replacing Ian Rush.
Houghton was added to the new acquisitions of Aldridge, Peter Beardsley and John Barnes to form one of the most exciting forward lines in the club's history. He made his Reds debut on 24 October 1987 in the 1–0 league victory over Luton Town at Kenilworth Road. His first goal for the club came on 4 November 1987 in the 1–1 draw with Wimbledon at Plough Lane. Houghton's 62nd-minute strike came just two minutes after he had come on as a sub for Johnston. It also kept up Liverpool's run of 29 unbeaten league matches from the start of the season.
Liverpool went on to coast to the League title, with Houghton contributing some memorable displays as a marauding creator from the flank. He scored his share of goals too, including the first goal in the era-defining 5–0 win over Nottingham Forest, which was later described by some journalists as the "match of the century" and was complimented by the game's greats such as Tom Finney.
Houghton did his bit in the run to that season's FA Cup final too, scoring the winner in a fifth round derby at Everton and then clipping home a shot on the turn as Liverpool romped past Manchester City 4–0 in the quarter-finals. In the final, Liverpool surprisingly lost to Wimbledon and missed out on the "double".
The following season, Houghton was again a regular as Liverpool battled towards another League and FA Cup "double", though they again would be denied. More important matters than football affected Houghton and his teammates in April 1989 however, as the Hillsborough disaster on 15 April claimed 94 lives (with the death toll eventually reaching 96). Upon returning to the game Liverpool went on to win the Cup with a 3–2 extra-time victory over Everton but lost the League title with virtually the last kick of the season in the title decider at Anfield against Arsenal.
The following year Houghton and Liverpool regained the title when they finished 9 points ahead of Aston Villa, although Houghton managed just 19 out of 38 league appearances in the 1989–90 season and scored just once.
Houghton played 32 times in the 1990–91 season, scoring seven goals, as Liverpool finished second in the League to Arsenal. He picked up another FA Cup winners' medal with Liverpool in the 1991–92 season and also had his best return in goals during his time at Anfield, finishing as the club second highest goalscorer with 12 goals, only bettered by Dean Saunders. However, Souness allowed Houghton to leave at the end of the season, partly due to the emergence of Steve McManaman.
Aston Villa
After 202 appearances and 38 goals in his 5 successful years at Liverpool Houghton joined Aston Villa for £900,000, with Villa manager Ron Atkinson fending off attempts by Chelsea manager Ian Porterfield to bring Houghton to West London.
He made his debut on 15 August 1992 in the 1–1 draw with Ipswich Town at Portman Road, Villa's first game in the new FA Premier League.
He again won the fans over with his robust style and helped Villa win the League Cup on 27 March 1994, although he was an unused sub for a Villa side who defeated Manchester United 3–1.
This would be the only trophy that he won during his time at Villa. He did come close to collecting another title medal in his first season at Villa Park, as Villa had led the league at several stages of the campaign, but were eventually pushed into runners-up place by Manchester United, who were crowned champions by a 10-point margin. Houghton played a total of 117 times for Villa, scoring 11 goals.
Crystal Palace
On 23 March 1995 (transfer deadline day) Houghton left Villa to join Crystal Palace. Palace paid £300,000 for the player hoping that his experience would help Palace stave off relegation from the Premier League and progress in the FA Cup, but they were relegated (despite finishing fourth from bottom as the division was being reduced to 20 clubs) and eliminated at the semi-final stage in the respective competitions.
Houghton made his Palace debut, as a 33-year-old, on 1 April 1995 in the 2–1 win over Manchester City at Selhurst Park. One of Houghton's best performances for the South London club was on 28 September 1996 in the 6–1 thrashing of Southend United in a Division One fixture at Selhurst Park. Houghton was at the heart of everything Palace did, and scored a goal in the 38th minute. He spent just over two years at Palace, playing 87 times and scoring 8 goals.
Reading
Houghton signed for Reading on a free transfer on 15 July 1997. He made his debut the following month on 9 August in the 1–1 league draw with Bury at Gigg Lane.
He spent a season at Elm Park and another at Reading's new home, the Madejski Stadium, which saw him rack up 56 appearances in which he scored just once, against Manchester City. Reading would be Houghton's last professional club, he had played 723 times during his career scoring 93 goals.
Stevenage Borough
Houghton wound his career down at Stevenage Borough in the Conference. He signed for Stevenage on 24 September 1999 but only made three appearances before he retired from the game on 31 May 2000.
International career
Prior to his career with the Republic of Ireland, Houghton was a member of a Scotland U18 squad under Andy Roxburgh, failing to gain any caps. Despite becoming increasingly successful in his club career by 1986, he was not considered for the Scotland squad for the upcoming World Cup.
Houghton qualified to play international football for the Republic of Ireland through his father, who was born in Buncrana in Inishowen, County Donegal, in Ulster. He earned his first cap in Jack Charlton's first match as manager, a 1–0 defeat by Wales in a friendly international at Lansdowne Road on 26 March 1986.
In the summer of 1988, Houghton was selected for the Irish squad which had reached its first ever major finals, the European Championships in West Germany. The first group game on 12 June was against an England team that included Gary Lineker, Bryan Robson and Houghton's Liverpool club mates Peter Beardsley and John Barnes. Houghton scored with an early looping header to win the game 1–0, his first goal for Ireland. Ireland failed to get through the group stage after a draw against the USSR and a defeat against eventual champions The Netherlands.
Houghton was selected for the Irish squad which qualified for the 1990 FIFA World Cup in Italy. They were once again drawn in the same group as England, which included Lineker, Robson, Beardsley and Barnes as well as Paul Gascoigne and Chris Waddle. The game finished in a 1–1 draw. The Irish also drew with both Egypt, 0–0, and the Netherlands, 1–1, finishing on the same points (3), goal difference (0), and goals scored (2) as the Dutch. Both teams progressed to the second round, along with England who topped the group.
On 25 June Ireland faced Romania at the Stadio Luigi Ferraris in Genoa. Following a hard earned 0–0 draw, the game went to penalties with Houghton scoring the second penalty kick to help Ireland win 5–4 and qualify for the quarter-finals. Ireland were defeated 1–0 by the host nation Italy in a closely fought match.
Houghton was selected in the Irish squad for the 1994 FIFA World Cup in the United States and was once again the goalscoring hero in a shock victory. In the 11th minute of the group E match at Giants Stadium on 18 June Houghton hit a looping shot into the net to defeat Italy, gaining revenge for the defeat Ireland had suffered at the hands of the Italians four years earlier. Ireland were knocked out of the tournament at the next stage by the Netherlands.
Houghton's final appearance was as a substitute in the 1998 FIFA World Cup play-off match with Belgium in Brussels. Ireland lost the match 2–1 (3–2 on aggregate) with Houghton scoring his final international goal. He had represented Ireland 73 times scoring 6 goals.
Houghton has now taken up post as an ambassador for the Football Association of Ireland (FAI).
In 2008, Houghton was part of the three-man team along with Don Givens and Don Howe appointed to head-hunt the new international manager. After interviewing several candidates, Houghton and the team ultimately nominated Giovanni Trapattoni to the FAI.
Media career
Houghton now works as a pundit on the game, working for outlets such as RTÉ in Ireland, and talkSPORT, Sky Sports, Sportsxchange in the UK and LFC TV. Since 2002 he has also worked for Sports Interactive as a consultant on their game Football Manager.
In 2005, he was given an honorary degree by the University of Huddersfield, for his services to sport. He joined actor Tim Brooke Taylor and former Olympic swimmer Adrian Moorhouse in collecting degrees.
He contributed to RTÉ Sport's coverage of the 2010 FIFA World Cup.
He was also part of RTÉ Sport's coverage of the 2014 FIFA World Cup, as a co-commentator, and of UEFA Euro 2016 and UEFA Euro 2020.
Honours
Oxford United
League Cup: 1985–86
Liverpool
Football League First Division: 1987–88, 1989–90
FA Cup: 1988–89, 1991–92
FA Charity Shield: 1990
Aston Villa
League Cup: 1993–94
Individual
FAI Senior International Player of the Year: 1994
PFA Team of the Year: First Division (1991–92), Second Division (1982–83)
See also
List of Republic of Ireland international footballers born outside the Republic of Ireland
References
External links
Player profile at LFChistory.net
Ray Houghton index at Sporting-heroes.net
Irish football greats at FAI.ie
Ray Houghton, Euro 88 Winner
1962 births
Living people
1990 FIFA World Cup players
1994 FIFA World Cup players
Aston Villa F.C. players
British association football commentators
British radio personalities
Crystal Palace F.C. players
National League (English football) players
Fulham F.C. players
Irish association football commentators
Liverpool F.C. players
Oxford United F.C. players
Premier League players
Reading F.C. players
Republic of Ireland men's association footballers
Republic of Ireland men's international footballers
Scottish people of Irish descent
Footballers from Glasgow
Stevenage F.C. players
UEFA Euro 1988 players
West Ham United F.C. players
English Football League players
Men's association football midfielders |
Lineagen, Inc. is a privately held personal genomics and biotechnology company based in Salt Lake City, UT. The company was incorporated in 2006 and collaborated with two leading autism research institutions: the University of Utah and The Children's Hospital of Philadelphia (CHOP), to identify novel genetic variants likely causal of autism spectrum disorder. Lineagen was granted an exclusive commercial license to these novel genetic variants. Notably, the markers from CHOP, published in Nature and PLoS Genetics, were named by TIME magazine as one of the top ten medical breakthroughs of 2009.
Since 2010, Lineagen provides genetic laboratory services to healthcare providers, which include fluorescence in situ hybridization (FISH), karyotyping and chromosomal microarray testing for children with childhood development disorders. In 2012, Lineagen and Affymetrix, Inc. announced that the companies have signed an agreement where Lineagen receives exclusive rights to develop a proprietary chromosomal microarray assay based on Affymetrix' GeneChip technology platform.
References
Biotechnology companies of the United States
Companies based in Salt Lake City |
Richard Virenque (born 19 November 1969) is a retired French professional road racing cyclist. He was one of the most popular French riders with fans for his boyish personality and his long, lone attacks. He was a climber, best remembered for winning the King of the Mountains competition of the Tour de France a record seven times, but he is best known from the general French public as one of the central figures in a widespread doping scandal in 1998, the Festina Affair, and for repeatedly denying his involvement despite damning evidence.
Childhood
Virenque, his parents, his brother Lionel and sister Nathalie lived in the Iseba district of Casablanca. The family was affluent, employing both a gardener and a nurse. His mother described Richard as a gentle, kind boy, full of life, who enjoyed helping her in the garden. His idol was Michael Jackson. His father, Jacques, ran a tire company. As a child, Virenque began cycling by riding round the garden of the family's house. "It wasn't much of a bike," he said. "It had no mudguards, no brakes, and I had to scrape my foot along the ground to stop." Virenque often skipped school to fish on the beach. He told a court during the Festina doping inquiry (see below):
The family moved to La Londe-les-Maures, near the Côte d'Azur, in 1979 when he was nine. There his father failed to find the same sort of job and relations between his parents suffered. Jacques and Bérangère Virenque divorced soon afterwards and Virenque said he was devastated.
He couldn't stand being in school any longer than he had to, he said, and he left to work as a plumber.
Early career
Cycle-racing did not immediately inspire Virenque. His brother, Lionel, cycled, read specialist magazines and watched the Tour de France on television.
He rode for the Vélo Club Hyèrois from the age of 13 where, encouraged by his grandfather, he took out his first licence with the Fédération Française de Cyclisme He said he knew he could climb well from the start.
His first win was in a race round the town at La Valette-du-Var, when he and another rider, Pascale Ranucci, lapped the field. He then did his national service in the army battalion at Joinville in Paris to which talented sportsmen were often sent. He spent his last period as an amateur with the ASPTT in Paris.
In 1990 he came eighth in the world championship road race at Utsunomiya, Tochigi in Japan, riding une course d'enfer to impress Marc Braillon, the head of the professional team, RMO, said Pascal Lino. "I was riding like a kamikaze. I rode out of my skin," Virenque said. It worked: Braillon offered him a contract.
Professional career
He turned professional for RMO in January 1991. Virenque rode his first Tour de France in 1992 as a replacement for another team member, Jean-Philippe Dojwa. He was earning 15,000 francs a month. He said he dreamed only of "being able to follow the best in the mountains, riders like Claudio Chiappucci, Indurain, LeMond, Thierry Claveyrolat." On the third day he took the yellow jersey as leader of the general classification after a long breakaway with two other riders on the col de Marie-Blanque in the Pyrenees. He held it for a day, losing it next day to his team-mate Pascal Lino, who led for the next two weeks. Virenque finished second in the climbers' competition.
Virenque was sought by several teams after his first Tour and Cyrille Guimard said at the world championship at Benidorm that he had arranged for him to join his Castorama team, where he would replace Laurent Fignon. But the announcement was premature and Virenque joined another French team, Festina. He stayed there until the team dissolved in the wake of a doping scandal in 1998 (see below).
Virenque first wore the yellow jersey of the Tour de France in 1992 and for the last time in 2003. In 2003 he won the stage to Morzine and wore the jersey on the climb of Alpe d'Huez. Virenque was a talented climber but a modest time-triallist. He was coached for time-trials by Jeannie Longo and her husband.
Virenque finished twice on the podium in the Tour de France (third in 1996 and second in 1997) and won several stages, among them Mont Ventoux in 2002. He is the 18th rider in the Tour to have won stages over 10 years apart; he wore the Maillot Jaune for two days in his entire career.
Festina affair
In 1998 the Festina cycling team was disgraced by a doping scandal (see Doping at the Tour de France) after a soigneur, Willy Voet, was found when crossing from Belgium to France to have drugs used for doping. They were, said John Lichfield, the Paris correspondent of The Independent in Britain: "235 doses of erythropoietin (EPO), an artificial hormone which boosts the red cells (and therefore endurance) but can thicken the blood to fatal levels if not controlled properly. They also found 82 doses of a muscle-strengthening hormone called Sauratropine,; 60 doses of Pantestone, a derivative of testosterone, which boosts body strength but can cause cancer; and sundry pain-deadening corticoids and energy-fuelling amphetamines." Bruno Roussel, Virenque's directeur sportif, told L'Équipe that Virenque responded to the news by saying:
Virenque's teammates, Christophe Moreau, Laurent Brochard and Armin Meier, admitted taking EPO after being arrested during the Tour and were disqualified. Virenque maintained his innocence.
While his former team-mates were served six-month suspensions and returned to racing in spring 1999, Virenque changed teams to Polti in January 1999 and prepared for the 1999 Tour by riding the Giro d'Italia, in which he won a stage. Another Italian, his team-mate Enrico Cassani, said Virenque was referred to in Italy as "the shit". He said: "When he arrived, we were originally against him. Then, very quickly, we saw he knew how to live and to joke and we respected him. He proved he had some character, some personality."
A few weeks later Virenque's name emerged in an inquiry into Bernard Sainz, the so-called Dr Mabuse of cycling who was later jailed for practising as an unqualified doctor. Franco Polti, the head of Virenque's team, fined him 30 million lire.
Race director Jean-Marie Leblanc banned Virenque from the 1999 Tour de France but was obliged to accept him after a ruling by the Union Cycliste Internationale.
Cycling Weekly in Britain called it "a major blow" to the Tour's organisers. Leblanc said he hoped Virenque would not win.
Virenque rode, at his team's request, on a bicycle painted white with red dots to resemble the polka dot jersey worn by the leader of the mountains classification and he travelled between stages with a bodyguard, Gilles Pagliuca. That year, he wrote Ma Vérité, a book which asserted his innocence and included comments of how doping must be fought. He wrote that his team-mates confessed to using EPO because of pressure from the police. He said Moreau's urine showed EPO had not been detected.
The Festina affair led to a trial in Lille, northern France, in October 2000. Virenque was a witness with others from the former Festina team. He at first denied he had doped himself but then confessed. "Oui, je me suis dopé", he told the court's president, Daniel Delegove, on 24 October. But he denied doping himself intentionally. Voet said he was aware of what he was doing and participated in trafficking between cyclists. Virenque said this happened without his approval. That led the satirical television programme, Les Guignols de l'info - which displayed Virenque as a moronic rubber puppet with hypodermics in his head - to change his words to "à l'insu de mon plein gré" ("willingly but without knowing"), and the phrase passed into French popular culture as a sign of hypocritical denial. Voet wrote a book, Massacre à la Chaîne, published in a legally-censored English edition as Breaking the Chain, in which he came close to identifying Virenque as an unrepentant doper.
Post-trial reaction
Virenque was criticised by the media and satirists for his denial in the face of increasing evidence and his pretence of having been doped without his knowledge. Voet wrote in Le Journal du Dimanche that he preferred Virenque as a young pro "because he didn't dope himself much". Many former colleagues shunned him, remembering his arrogance and criticism.
Virenque lived near Geneva in Switzerland and the Swiss cycling association suspended him for nine months. The president of the committee which imposed the ban, Bernard Welten, said he deserved a severe penalty because he was one of the biggest drug-takers in the team. The president of the French federation, Daniel Baal, said nine months was halfway between the minimum penalty of six months and the maximum of a year for a first-time offence. The sentence was reduced by an independent tribunal to six and a half. He was fined the equivalent of 2,600 euros and told to pay 1,300 euros in costs. He became depressed. "I had to realise that I wasn't anything any more," he said. His wife Stéphanie said he put on two sizes in clothes and 10 kg (22 lb) more than his racing weight. He wept repeatedly. She said she would stay with him and support him only if they moved back in the south of France after four years in Switzerland.
In the meantime they had the help of a prominent neighbour, Laurent Jalabert. The two had not been friends and did not see each other much in Switzerland. Then, Jalabert opened links by getting his wife, Sylvie, to ask Stéphanie Virenque for the loan of a vacuum cleaner that she didn't actually need. Jalabert said that later, "Richard called me one day when my wife and I were getting ready to move house. He was desperate to help us even though we didn't really need any help. It was then that I realised his distress. He spent the whole day taking the furniture apart and putting it back together again. It's odd, but that day did him an awful lot of good." Jalabert and his wife Sylvie said that, as a souvenir, they had kept the doors of one of their closets upside down because that was the way Virenque had fitted them. The two men began training together. Virenque and his family moved back to France as his wife asked. Jalabert followed shortly after his own career ended.
Post-suspension career
Few teams were willing to consider him when he completed his suspension and only a few friends kept in touch.
Cofidis was said to be interested but not in his first year back. Jean Delatour, with whom Virenque trained in the winter, said it could be interested if it found more sponsorship. On 5 July 2001 he joined Domo-Farm Frites, with the help of the former Tour de France winner, Eddy Merckx who, as supplier of the team's bikes, put up the extra money that the main sponsors would not. He was paid the equivalent of £800 a month, the minimum wage, for the last three months of the year and the same salary for which he had first turned professional in 1992. Domo kept him the following season, after Farm Frites withdrew as co-sponsor, because it wanted to expand its carpet business in France. On 25 October 2002, on the eve of the Tour de France presentation at the Palais des Congres in Paris, he signed for another two years.
Virenque returned to prominence by winning Paris–Tours on 7 October 2001 in a day-long breakaway in which he dropped Jacky Durand and crossed the line seconds ahead of the peloton. Paris–Tours is a flat race that favours sprinters and not climbers. "It was a typical Virenque moment," Fotheringham wrote, "with a yell of anger as he crossed the line 'for all those who tried to destroy me'". The French magazine, Vélo, called the victory "extraordinary." L'Équipes one-word headline on the front page was "Unbelievable!"
Virenque said: "Jacky asked me if we should sit up [give up the breakaway attempt]. There were still 50 km [30 miles] to go. I was longing for someone else to come up to us. A long break wasn't the idea. But when I saw the gap was rising, I shouted' Faut y croire ' [We can do it/We have to believe] But he said he'd run dry."
While Virenque was bettered by Laurent Jalabert in the 2001 and 2002 Tour de France for the King of the Mountains competition, he won his sixth mountains classification in 2003 to tie with Federico Bahamontes and Lucien Van Impe. His day-long breakaway also saw him wear the yellow jersey as leader of the general classification. In 2004 he won the King of the Mountains for a record seventh time. Van Impe criticised Virenque for being opportunistic rather than the best climber; he said he had himself refrained from breaking Bahamontes' record himself out of reverence. Virenque said they were jealous: "They couldn't stand being equal best and they couldn't stand being beaten."
Bahamontes in turn described Virenque as "a great rider, but not a complete rider", and compares him unfavorably as a climber with Charly Gaul and Van Impe.
Virenque ran into trouble again in 2002 when he appeared on a television programme, Tout le Monde en Parle, in June. The presenter, Thierry Ardisson, asked him: "If you were sure of winning the Tour by being doped but knew you would not get caught, would you do it?" Virenque replied: "Win the Tour doped, but without getting caught? Yes." The programme was recorded to be broadcast as-live. Ardisson said that Virenque asked after the recording finished that his answer be cut out. Ardisson said: "It was very naive, very Virenque. But it's a shame that, once again, he didn't want to tell the truth."
Retirement
Virenque rode the Olympic Games road race in Athens and decided to retire, a decision he announced at the Olympia theatre in Paris on 24 September 2004. His wife had suggested continuing one more season, he said. He stayed in the public eye, winning Je suis une célébrité, sortez-moi de là! (the French version of I'm a Celebrity... Get Me Out of Here!) in Brazil in April 2006. In autumn 2005 he opened Virenque Design, a company to design and sell jewellery
often featuring the number 7, representing his wins in the King of the Mountains. Since 2005 he has been a consultant commentator for Eurosport, alongside Jacky Durand and Jean-François Bernard and the journalist, Patrick Chassé, where he is described as a "modest competitor" to Laurent Jalabert, the specialist on the rival state network. He has also promoted an energy drink and a pharmacy company.
Virenque also took part in the Spa 24 Hours endurance race in 2005. Driving a Dodge Viper GTS-R for Force One Racing alongside François Labhardt, Philippe Prette and former motorcycle rider Didier de Radiguès, he finished the race in 12th place overall and second in the G2 class.
On 11 August 2006, Virenque was taken to hospital at Moûtiers and transferred to Grenoble after falling during a mountain-bike race at Méribel. He broke his nose and needed 32 stitches to his face. Hitting his head led to feelings of worry and of depression, he said, and he lost his sense of smell.
Personal life
In December 2007, Virenque and his wife, Stéphanie, divorced after 17 years together. They have two children, Clara and Dario.
Eric Boyer said of Virenque's retirement: "Richard has character, a strong personality. He doesn't let himself go. He looks forwards, never behind. Today, he is a personality [un people]. His return to everyday life has been a success but money isn't an end in itself."
Virenque lives at Carqueiranne in the Var region. He is fond of marmots, dancing, wine, gardening and flowers; he is quoted as saying, "Put me in a good garden nursery and I'm in heaven,"
Career achievements
Major results
1991
2nd Trophée des Grimpeurs
7th Overall Route du Sud
7th Grand Prix de Cannes
9th Road race, National Road Championships
10th Tour du Haut Var
1992
1st Bol d'Or des Monédières Chaumeil
2nd Trophée des Grimpeurs
3rd Polynormande
4th Overall Tour du Limousin
6th Road race, National Road Championships
6th Grand Prix La Marseillaise
8th Overall Grand Prix du Midi Libre
8th Trofeo Pantalica
9th A Travers le Morbihan
Tour de France
Held after Stage 2
1993
2nd Overall Tour du Limousin
1st Stage 1
5th Overall Critérium du Dauphiné Libéré
1994
1st Trophée des Grimpeurs
1st Circuit de l'Aulne
2nd Overall Route du Sud
1st Stage 2
2nd GP Ouest–France
3rd Road race, UCI Road World Championships
5th Overall Tour de France
1st Mountains classification
1st Stage 12
5th Classique des Alpes
6th Overall Critérium du Dauphiné Libéré
6th Omloop Het Volk
7th Tour du Haut Var
8th Overall Four Days of Dunkirk
9th Amstel Gold Race
9th Coppa Placci
1995
1st Polynormande
1st
2nd Overall Grand Prix du Midi Libre
3rd Classique des Alpes
3rd Trophée des Grimpeurs
4th Overall Critérium du Dauphiné Libéré
1st Mountains classification
1st Stages 4 & 6
4th Overall Route du Sud
5th Overall Vuelta a España
6th Road race, UCI Road World Championships
8th Tour du Haut Var
9th Overall Tour de France
1st Mountains classification
1st Stage 15
10th Overall Four Days of Dunkirk
1996
1st Giro del Piemonte
1st Critérium de Vayrac
2nd Circuit de l'Aulne
3rd Overall Tour de France
1st Mountains classification
3rd Overall Critérium du Dauphiné Libéré
1st Mountains classification
1st Stage 4 (Mont Ventoux)
3rd Overall Grand Prix du Midi Libre
3rd Coppa Placci
4th Clásica de San Sebastián
4th Milano–Torino
4th Classique des Alpes
4th À travers Lausanne
5th Road race, Olympic Games
5th Road race, UCI Road World Championships
6th Overall Giro di Puglia
6th Coppa Sabatini
7th Overall UCI Road World Rankings
7th Giro di Lombardia
7th Trophée des Grimpeurs
8th Liège–Bastogne–Liège
10th Overall Critérium International
1997
1st Grand Prix d'Ouverture La Marseillaise
1st Polynormande
1st
1st Critérium de Vayrac
2nd Overall Tour de France
1st Mountains classification
1st Stage 14
2nd Tour du Haut Var
2nd Circuit de l'Aulne
5th Züri-Metzgete
6th GP Ouest–France
6th Trophée des Grimpeurs
6th Breitling Grand Prix (with Christophe Moreau)
7th Overall Vuelta a Burgos
7th Road race, National Road Championships
7th Grand Prix des Nations
7th Gran Premio Bruno Beghelli
8th Overall Tour Méditerranéen
1st Stage 2b (TTT)
9th Clásica de San Sebastián
10th La Flèche Wallonne
1998
1st Châteauroux Classic de l'Indre Trophée Fenioux
2nd Grand Prix d'Ouverture La Marseillaise
3rd Overall Tour Méditerranéen
1st Stage 4 (TTT)
3rd Road race, National Road Championships
4th Overall Grand Prix du Midi Libre
6th Overall Critérium du Dauphiné Libéré
1st Stage 6
6th Tour du Haut Var
10th Milano–Torino
10th Classique des Alpes
1999
1st Stage 13 Giro d'Italia
2nd Polynormande
4th Road race, National Road Championships
8th Overall Tour de France
1st Mountains classification
9th Klasika Primavera
2000
6th Overall Tour de France
1st Stage 16
6th Overall Tour de Suisse
2001
1st Paris–Tours
4th Giro di Lombardia
2002
1st
1st Stage 14 Tour de France (Mont Ventoux)
1st Mountains classification Tour Méditerranéen
2nd Overall Tour de l'Ain
3rd Overall Giro della Provincia di Lucca
9th Overall Critérium du Dauphiné Libéré
10th Overall Tour de Pologne
2003
Tour de France
1st Mountains classification
1st Stage 7
Held after Stage 7
2nd Road race, National Road Championships
2nd Châteauroux Classic de l'Indre Trophée Fenioux
5th Overall Tour de l'Ain
2004
1st
Tour de France
1st Mountains classification
1st Stage 10
Grand Tour general classification results timeline
Books
Ma Vérité 1999 Éditions du Rocher, with C. Eclimont and Guy Caput.
Plus fort qu'avant 2002 Robert Laffont, with Jean-Paul Vespini.
Richard Virenque Coeur de Grimpeur Mes Plus Belles Etapes 2006 Privat, with Patrick Louis
See also
List of doping cases in cycling
List of sportspeople sanctioned for doping offences
Notes
References
External links
Richard Virenque on the Tour de France 2004 exclusive photo of Richard with Lance Armstrong and Jan Ullrich
1996 Olympic Road Race Results
1969 births
Cycling announcers
Cyclists at the 1996 Summer Olympics
Cyclists at the 2000 Summer Olympics
Cyclists at the 2004 Summer Olympics
Doping cases in cycling
French male cyclists
French Giro d'Italia stage winners
French sportspeople in doping cases
French Tour de France stage winners
I'm a Celebrity...Get Me Out of Here! winners
Living people
Olympic cyclists for France
Sportspeople from Casablanca
24 Hours of Spa drivers
Cyclists from Provence-Alpes-Côte d'Azur
Sportspeople from Var (department) |
Elizabeth Ann Donley (born April 5, 1970) is an American physicist. She is a researcher in the time and frequency division at the Physical Measurement Laboratory. Donley's research areas include the operation and development of atomic fountain clocks and chip scale atomic devices and instruments.
Life
Donley was born on April 5, 1970. She completed a B.S. in physics from University of Nevada, Las Vegas in 1994. Donley earned a M.S. in physics at the University of Colorado Boulder in 1996. Donley completed her doctoral studies in Switzerland, earning a Ph.D. in natural sciences from ETH Zurich in 2000. Her thesis was titled Single-molecule spectroscopy at subkelvin temperatures. Donley's doctoral advisor was Urs Wild. Her postdoctoral research at the University of Colorado Boulder was on ultracold atomic physics with 2001 Nobel Laureates Carl Wieman and Eric Cornell.
Donley joined the National Institute of Standards and Technology in 2002 as a research physicist in the Time and Frequency Division at the Physical Measurement Laboratory; in 2018 she became its Division Chief. She has served in a number of leadership positions for the IEEE professional society. Donley's research areas include the operation and development of atomic fountain clocks and chip scale atomic devices and instruments, for which she has won the Department of Commerce Gold Medal in 2004 and 2014. In 2022, she won the IEEE C. B. Sawyer Memorial Award.
References
External links
Living people
Place of birth missing (living people)
National Institute of Standards and Technology people
American women physicists
20th-century American physicists
21st-century American physicists
20th-century American women scientists
21st-century American women scientists
University of Nevada, Las Vegas alumni
University of Colorado Boulder alumni
ETH Zurich alumni
1970 births |
```c++
/** @addtogroup cometa
* @{
*/
#pragma once
#include "../cometa.hpp"
#include "memory.hpp"
#include <cstddef>
#include <cstdlib>
#include <memory>
#include <type_traits>
#if CMT_HAS_EXCEPTIONS
#include <functional>
#endif
namespace cometa
{
namespace details
{
template <typename Fn>
struct func_filter
{
typedef Fn type;
};
template <typename Result, typename... Args>
struct func_filter<Result(Args...)>
{
typedef Result (*type)(Args...);
};
template <typename T>
constexpr CMT_INTRINSIC T return_val() CMT_NOEXCEPT
{
return {};
}
template <>
constexpr CMT_INTRINSIC void return_val<void>() CMT_NOEXCEPT
{
}
} // namespace details
/**
* @brief std::function-like lightweight function wrapper
* @code
* function<int( float )> f = []( float x ){ return static_cast<int>( x ); };
* CHECK( f( 3.4f ) == 3 )
* @endcode
*/
template <typename F>
struct function;
namespace details
{
template <typename R, typename... Args>
struct function_abstract
{
virtual ~function_abstract() {}
virtual R operator()(Args... args) = 0;
};
template <typename Fn, typename R, typename... Args>
struct function_impl : public function_abstract<R, Args...>
{
inline static void* operator new(size_t size) noexcept { return aligned_allocate(size, alignof(Fn)); }
inline static void operator delete(void* ptr) noexcept { return aligned_deallocate(ptr); }
#ifdef __cpp_aligned_new
inline static void* operator new(size_t size, std::align_val_t al) noexcept
{
return aligned_allocate(size, static_cast<size_t>(al));
}
inline static void operator delete(void* ptr, std::align_val_t al) noexcept
{
return aligned_deallocate(ptr);
}
#endif
template <typename Fn_>
function_impl(Fn_ fn) : fn(std::forward<Fn_>(fn))
{
}
~function_impl() override {}
R operator()(Args... args) override { return fn(std::forward<Args>(args)...); }
Fn fn;
};
} // namespace details
template <typename R, typename... Args>
struct function<R(Args...)>
{
function() noexcept = default;
function(std::nullptr_t) noexcept {}
template <typename Fn, typename = std::enable_if_t<std::is_invocable_r_v<R, Fn, Args...> &&
!std::is_same_v<std::decay_t<Fn>, function>>>
function(Fn fn) : impl(new details::function_impl<std::decay_t<Fn>, R, Args...>(std::move(fn)))
{
}
function(const function&) = default;
function(function&&) noexcept = default;
function& operator=(const function&) = default;
function& operator=(function&&) noexcept = default;
R operator()(Args... args) const
{
#if CMT_HAS_EXCEPTIONS
if (impl)
{
return impl->operator()(std::forward<Args>(args)...);
}
throw std::bad_function_call();
#else
// With exceptions disabled let it crash. To prevent this, check first
return impl->operator()(std::forward<Args>(args)...);
#endif
}
[[nodiscard]] explicit operator bool() const { return !!impl; }
[[nodiscard]] bool empty() const { return !impl; }
std::shared_ptr<details::function_abstract<R, Args...>> impl;
bool operator==(const function& fn) const { return impl == fn.impl; }
bool operator!=(const function& fn) const { return !operator==(fn); }
};
template <typename Ret, typename... Args, typename T, typename Fn, typename DefFn = fn_noop>
CMT_INLINE function<Ret(Args...)> cdispatch(cvals_t<T>, identity<T>, Fn&&, DefFn&& deffn = DefFn())
{
return [=](Args... args) CMT_INLINE_LAMBDA -> Ret { return deffn(std::forward<Args>(args)...); };
}
template <typename Ret, typename... Args, typename T, T v0, T... values, typename Fn,
typename DefFn = fn_noop>
inline function<Ret(Args...)> cdispatch(cvals_t<T, v0, values...>, identity<T> value, Fn&& fn,
DefFn&& deffn = DefFn())
{
if (value == v0)
{
return [=](Args... args) CMT_INLINE_LAMBDA -> Ret
{ return fn(cval_t<T, v0>(), std::forward<Args>(args)...); };
}
else
{
return cdispatch<Ret, Args...>(cvals_t<T, values...>(), value, std::forward<Fn>(fn),
std::forward<DefFn>(deffn));
}
}
} // namespace cometa
``` |
Bentley is a town in central, Alberta, Canada within Lacombe County. It is located on Highway 12, approximately northwest of Red Deer.
History
The first settlers came from the U.S. in 1888-1890 and either walked or drove oxen from Lacombe, which was the closest railroad station at that time. Post office opened in 1901. The first church was built in 1890 by the Methodists, and a schoolhouse was built in 1903. Bentley was incorporated as a village on March 17, 1915.
A disastrous fire destroyed all buildings on the south side of the community in 1916. The centre roadway was made wide and new buildings could not be constructed inside that area. In 1930, a centre boulevard was constructed for fire protection and street lights installed.
Bentley was incorporated as a town on January 1, 2001.
Town name
Bentley was named in honour of George Bentley, an early homesteader and sawyer, however at the time it was a controversial choice. When Major William B. McPherson, a U.S. Civil War veteran, opened a post office, settlers preferred McPherson's name, but they were outnumbered by the sawmill employees, who wanted Bentley. Prior to 1915, a petition was formed regarding the naming of the village. The original names of Oxford and Springdale were turned down as these two names had been frequently used across Canada.
Demographics
In the 2021 Census of Population conducted by Statistics Canada, the Town of Bentley had a population of 1,042 living in 451 of its 471 total private dwellings, a change of from its 2016 population of 1,078. With a land area of , it had a population density of in 2021.
In the 2016 Census of Population conducted by Statistics Canada, the Town of Bentley recorded a population of 1,078 living in 441 of its 463 total private dwellings, a change from its 2011 population of 1,073. With a land area of , it had a population density of in 2016.
Education
Bentley has one public school, Bentley School (kindergarten to grade 12), administered by Wolf Creek Public Schools.
Notable people
Clayton Beddoes, former NHL player with the Boston Bruins and ice hockey coach
See also
List of communities in Alberta
List of towns in Alberta
References
External links
1915 establishments in Alberta
Towns in Alberta |
Miralem Pjanić (born 2 April 1990) is a Bosnian professional footballer who plays as a midfielder for UAE Pro League club Sharjah and the Bosnia and Herzegovina national team.
Pjanić started his professional career at Metz being there for one season. He signed for side Lyon in 2008 before signing for Roma in 2011 after three seasons at Lyon. During his time in Rome, Pjanić came to be recognized as one of the best midfielders in Serie A. In 2016, Pjanić joined Juventus, and has since been considered an integral player for the team, winning four Serie A titles, two Coppa Italias, and being named in the Serie A Team of the Year for 2015–16, 2016–17, 2017–18 and 2018–19 seasons. He was also named in the 2016–17 UEFA Champions League Squad of the Season, for his role in Juventus's run to the final. Pjanić joined Barcelona in September 2020.
A former Luxembourg youth international, Pjanić made his senior international debut for Bosnia and Herzegovina in 2008, earning over one hundred caps and scoring eighteen goals since. He represented the nation at their first major tournament, the 2014 FIFA World Cup.
In 2015, Pjanić was ranked 55th in The Guardians list of "The 100 best footballers in the world". In 2019, he was ranked 50th in the same list.
Early life
Pjanić was born on 2 April 1990 in Tuzla, SR Bosnia and Herzegovina, in what was then SFR Yugoslavia (modern-day Bosnia and Herzegovina); to father Fahrudin Pjanić and mother Fatima. He developed an interest in footballing through his father, a former third division footballer in Yugoslavia, and began his football career in Luxembourg following his family's arrival to the country shortly before the outbreak of the Bosnian War. While in Luxembourg, Pjanić often attended training sessions and matches with his father. At the age of seven, his father discovered that he had talent and an interest in football and allowed his son to join local club FC Schifflange 95 in Schifflange. While at Schifflange, Pjanić drew interest from several Belgian, Dutch and German clubs, but agreed to join Metz in France in 2004. Pjanić was recommended by former Metz player and Luxembourg international Guy Hellers.
Club career
Metz
Pjanić joined Metz at age 14 on a youth contract and spent approximately three years in the club's academy. In the 2005–06 season, he played on the under-16 team that won the Championnat National des 16 ans and, following the season, signed a five-year élite contract with the club. After spending the 2006–07 season with the club's under-18 team, Pjanić was promoted to the club's amateur team in the Championnat de France Amateur for the 2007–08 season. He appeared in the first two matches of the campaign before earning a call up to the senior team by manager Francis De Taddeo. Pjanić made his professional football debut, at the age of 17, on 18 August 2007 in a league match against Paris Saint-Germain. He appeared as a substitute in a 0–0 draw. The following week, he earned his first start in a 2–0 defeat to Rennes.
After a string of respectable appearances, on 30 November 2007, Pjanić signed his first professional contract agreeing to a three-year deal, tying him to Metz until 2010. After becoming professional, he was assigned the number 15 shirt. Pjanić scored his first professional goal for Metz on 15 December 2007 in a 2–1 defeat against Sochaux converting on a penalty in the 88th minute, thus becoming one of the youngest players to score a goal in Ligue 1 history. Among his other positive performances included converting another penalty in a 2–1 loss to Nice and scoring on the final day of the season against Le Mans in a thrilling 4–3 victory.
Pjanić's play in the Coupe de France was with distinction as well appearing in and starting all four matches the club contested. He assisted on several goals in the club's 6–1 demolition of Vesoul Haute-Saône. In the ensuing round, Pjanić scored the final goal in Metz's 3–0 triumph over Strasbourg and played the full 90 minutes in the club's 1–0 win over Lorient in the Round of 16 helping the club who were, at the time, struggling in domestic play, reach the quarterfinals of the Coupe de France. Metz were eventually eliminated by the eventual champions Lyon.
In total, Pjanić made 38 appearances and scored 5 goals with Metz. For his efforts, he was nominated for the Ligue 1 Young Player of the Year award, won by Hatem Ben Arfa.
Though Pjanić was in great form throughout the season, Metz still suffered relegation back to Ligue 2, prompting speculation that the young star would move to any of a host of clubs, with English clubs Arsenal and Chelsea, Spanish clubs Barcelona and Real Madrid, Italian clubs Milan and Inter, and French club Lyon vying for his services.
Lyon
After Metz received numerous offers for the player's services, on 6 June 2008, Pjanić and Metz both reached an agreement with Olympique Lyonnais for the transfer of the player. Pjanić agreed to a five-year contract, while the transfer fee was priced at €7.5 million plus future incentives.
Labeled as the future replacement for the ageing Juninho, Pjanić was initially given the number 12 shirt, but switched to the number 18 for pre-season and made his club debut in the team's Trophée des Champions defeat to Bordeaux. He made his league debut in the opening league match of the season against Toulouse playing the entire match in a 3–0 victory. Pjanić's debut season with Lyon was cut in half after fracturing his fibula in a match against Sochaux in October 2008, as a result of a bad tackle by Stéphane Dalmat. Despite initially being diagnosed as missing a month, he missed two months and made his return on 3 January 2009 in the club's 6–0 thrashing of amateur club US Concarneau in the Coupe de France playing 66 minutes.
For the 2009–10 season, Pjanić switched to the number 8 shirt, formerly worn by his predecessor and Lyon great Juninho. He started the season strong scoring his first career goal for Lyon on a free kick in Lyon's playoff round match against Belgian club Anderlecht in the UEFA Champions League. Lyon won the match 5–1. A couple of days later, he scored his first career league goal for the club, in which his side won 3–0 at Auxerre. Pjanić continued his stellar play in the Champions League scoring the only goal in the club's opening group stage match against Italian club Fiorentina. In the club's second group stage match against Hungarian club Debreceni, he scored again, via free kick, and also assisted on two other goals in the club's 4–0 victory. On 10 March 2010, Pjanić scored the equalizing goal in Lyon's 1–1 draw with Spanish club Real Madrid in the second leg of their first knockout round tie in the UEFA Champions League. The draw sent Lyon through to the quarter-finals due to their 1–0 win in the first leg at the Stade Gerland.
Pjanić began the 2010–11 season as a starter and featured in the team's first three games. However, following the arrival of Yoann Gourcuff, he began appearing as a substitute and, subsequently, appeared as a substitute in the team's next seven league matches. On 29 September 2010, Pjanić scored his first goal of the season in the team's 3–1 win over Israeli club Hapoel Tel Aviv in the UEFA Champions League. As a result of his good form, Claude Puel began experimenting playing both Gourcuff and Pjanić in the midfield, but after playing the two in a 2–0 win over Portuguese club Benfica in the Champions League and a 1–1 draw with Rennes in the league, this tactic was abandoned.
Roma
On 31 August 2011, Pjanić agreed a four-year deal with Italian club Roma, for an €11 million transfer fee. He scored his first goal for Roma against Lecce.
Pjanić started the 2012–13 season mostly on the bench. He got his chance in a Derby della Capitale and scored a goal. From that game, he started playing regularly and scored one more goal in 2–0 win over Torino and one in the Coppa Italia against Atalanta. In the 2013–14 season, under new Roma coach Rudi Garcia, he was a starter in the 4–3–3 midfield, playing a key role to the team's Serie A record of ten wins in the first ten season matches.
Pjanić scored 6 goals and provided 6 assists in the 2013–14 Serie A season. On 25 April 2014, he scored the first goal in Roma's 2–0 victory over Milan; the goal was a wonderful individual display from Pjanić, as he dribbled past Sulley Muntari, Riccardo Montolivo, and Adil Rami before putting the ball in the net.
On 11 May 2014, Pjanić signed a new contract which will last until 30 June 2018. In a friendly tournament in Denver in July, he scored from inside his own half, but Roma lost 3–2 to Manchester United. In the 2014–15 season, he became considered as a rising star in Italian football, scoring 5 times and assisting 10 goals.
In the 2015–16 season, Pjanić emerged as one of the world's finest free-kick takers, netting a brilliant goal against Juventus on 30 August and scoring several more, including in the Champions League against Bayer Leverkusen. By the January break, he had scored 7 goals and assisted another 5, being linked with a transfer to Barcelona and Real Madrid in the winter transfer window. Towards the end of the season, rumours spread in the media of Pjanić's possible departure from Roma, as he was linked with Juventus. He finished the season with ten league goals, and 12 in all competitions, while also finishing the league season as the top assist provider in Serie A for the second consecutive season, alongside Juventus' Paul Pogba, with 12 assists.
Juventus
On 13 June 2016, Pjanić joined Juventus on a five-year contract for a fee of €32 million, ending a five-year stint with Roma. He chose the number 5 shirt to start the new season. On 10 September, Pjanić scored on his debut in a 3–1 home win over Sassuolo. After winning Coppa Italia and Serie A in his first season, he missed out on a potential treble, having lost in the Champions League Final to Real Madrid.
Pjanić's second season at Juventus began with a 2–3 loss against Lazio in the 2017 Supercoppa Italiana. He scored his first goal of the season in city derby against Torino on 23 September 2017. Juventus won the game 4–0. On 28 February, Pjanić scored a crucial penalty against Atalanta to send Juventus through to the 2018 Coppa Italia Final. Juventus won that final, with Pjanić contributing by assisting for one of the goals in a convincing triumph over Milan on 9 May 2018. Four days later, Pjanić once again became Serie A champion in a game against his old club Roma, which sealed his second domestic double in two seasons. On 19 May, the final match of the season, he scored his fifth league goal of the season, netting a trademark free kick, which sealed Juventus's 2–1 home win over Hellas Verona.
At the beginning of his third campaign with the club, Pjanić put pen to paper on a new five-year contract. He scored his first goal of the season in a 2–0 home win over Lazio on 25 August 2018. On 19 September, in his first UEFA Champions League game of the season, Pjanić helped his team to a win by converting two penalties against Valencia in an eventual 2–0 victory. On 6 October, in a game against Udinese, he made his 100th appearance for Juventus.
On 21 September 2019, Pjanić won his 100th match with Juventus in all competitions in a 2–1 home win over Verona in Serie A.
On 26 July 2020, he won his fourth league title with the club after defeating Sampdoria 2–0 at home. He made his final appearance for the club on 7 August, in a 2–1 home win over his former club Lyon in the second leg of the round of 16 of the UEFA Champions League; however, despite the victory, the result saw Juventus eliminated from the competition on away goals following a 2–2 aggregate draw.
Barcelona
On 29 June 2020, Juventus announced that they had reached an agreement with Barcelona for the transfer of Pjanić on a deal worth €60 million, plus a maximum of €5 million in bonuses, to be effective following the conclusion of the 2019–20 season. The deal was also coordinated with a swap of Arthur, whom Juve signed for €72 million, plus a maximum of €10 million in bonuses. Pjanić signed a contract with the Spanish side for the next four seasons, until the end of the 2023–24 campaign, with a buy-out clause of €400 million. He made his debut on 27 September, coming on as a substitute in a 4–0 home win over Villarreal in La Liga.
However, Pjanić's stint at Barcelona was unsuccessful, as he made 30 appearances for the club (being named 13 times in the starting XI) and spent an average of 43 minutes on the pitch but did not score or assist any goals.
Loan to Beşiktaş
On 2 September 2021, Pjanić joined Beşiktaş on a season-long loan.
Sharjah
On 7 September 2022, Pjanić joined UAE Pro League club Sharjah FC.
International career
Luxembourg
Due to spending his childhood in Luxembourg, Pjanić became eligible for their national team and begun representing the nation's youth sides. He represented Luxembourg in the 2006 European Under-17 Championship, for which Luxembourg qualified automatically as hosts. He scored Luxembourg's only goal of the tournament. In that same year, he scored 4 goals in a match against Belgium, which ended in a 5–5 draw. Before making his decision regarding his national team status, Pjanić was eligible to represent Luxembourg and Bosnia and Herzegovina.
Bosnia and Herzegovina
In May 2008, during an interview for Bosnian newspaper, Pjanić stated that he wanted to play for Bosnia and Herzegovina. Eventually, officials in the Football Association of Bosnia and Herzegovina took notice and Pjanić was called-up to the country's under-21 team. However, because Pjanić no longer had a Bosnian passport and needed FIFA approval to switch nationalities, he wasn't allowed to be called-up for the senior team. After an eight-month wait and following the involvement of Željko Komšić, the Croat member of the Presidency of Bosnia and Herzegovina, Pjanić received a Bosnian passport in early 2008.
He debuted for Bosnia and Herzegovina on 20 August 2008 in the team's 1–2 loss to Bulgaria. On 3 March 2010, he scored his first senior international goal in Bosnia and Herzegovina's 2–1 win over Ghana in Sarajevo.
Pjanić was instrumental in Bosnia and Herzegovina's qualification for 2014 FIFA World Cup, their first major competition, and he was named in 23-man squad for the tournament. He debuted in the team's opening group match, a narrow defeat to Argentina at the Maracanã Stadium. On 25 June, during the final group match against Iran, Pjanić scored a goal, leading to a 3–1 victory to help Bosnia and Herzegovina to their first ever FIFA World Cup win.
On 31 March 2021, he played his 100th match for Bosnia and Herzegovina in a 1–0 loss to France in the 2022 FIFA World Cup qualification.
Style of play
Nicknamed "il Piccolo Principe" ("the Little Prince") during his time with Roma, Pjanić was regarded as one of the most promising young midfielders of his generation in his youth, and was included in Don Balón's list of the 100 best young players in the world in 2010; however, he was also thought to lack composure at times in the media. His Juventus manager Massimiliano Allegri touted him as a potentially world class midfielder in 2016, later also adding that, although he was extremely talented, he needed to stay more "calm and focused" in order to fulfil his potential; subsequently, the 2016–17 season saw him establish himself as one of the best, most skillful, and most versatile midfielders in Europe. Although he is neither particularly quick, nor gifted with athleticism or physical strength, Pjanić has been described as an efficient "old-fashioned playmaker with huge technical qualities".
A talented, creative, and tenacious midfielder, with quick feet, Pjanić is usually deployed in a central midfield role, or as a deep-lying playmaker in front of the back-line, although his tactical versatility, defensive awareness, and work-rate enable him to play in several midfield positions, and he has also been used in more advanced roles as an offensive-minded central midfielder, known as the "mezzala" role, in Italian, or even as an attacking midfielder, and has even been deployed as a second striker on occasion.
Pjanić's main attributes are his range of passing, dribbling skills, and vision, which make him an excellent assist provider, and also enable him to dictate the tempo of his team's play in midfield and orchestrate goalscoring opportunities for his teammates. Known for his eye for goal from midfield and striking ability from distance, Pjanić is also known for having the capacity to get into good scoring positions by making late attacking runs into the penalty area from behind. A renowned set-piece specialist, he is highly regarded for his accurate, bending free-kicks, as well as his delivery from dead-ball situations; in 2015, he was described as the best free-kick taker in the world by renowned set-piece specialist and former Lyon teammate Juninho. Pjanić's precocious talent, playmaking skills, and ability to score many goals from free kicks saw him labelled as a potential heir to Juninho at Lyon. However, despite his ability and the praise he has garnered from pundits, due to his elegant and creative playing style, Pjanić has also drawn criticism on occasion in the media for being inconsistent, while Livio Caferoglu of Football Italia accused him of being "too slight to impose himself as a defensive midfielder," and "too slow to release the ball."
Personal life
Pjanić is a Muslim and an ethnic Bosniak. He has a son named Edin with his longtime girlfriend, Josepha from Nice. Along with his native Bosnian, Pjanić is fluent in six additional languages: Luxembourgish, French, English, German, Italian and Spanish. In 2014, Pjanić was enrolled at the University of Sarajevo, majoring in sport and physical education.
In 2009, while playing for Lyon, he stated: "I have followed Real Madrid since the days of Zidane and Ronaldo, when I fell in love. Since then, it is my preferred club and it always will be." Later, when he was a Roma player, he confirmed that he had been a fan of Real Madrid since his childhood.
Throughout the 2017–18 season, Pjanić appeared in the Netflix's docu-series First Team: Juventus.
Career statistics
Club
International
Scores and results list Bosnia and Herzegovina's goal tally first
HonoursJuventusSerie A: 2016–17, 2017–18, 2018–19, 2019–20
Coppa Italia: 2016–17, 2017–18
Supercoppa Italiana: 2018
UEFA Champions League runner-up: 2016–17BarcelonaCopa del Rey: 2020–21BeşiktaşTurkish Super Cup: 2021Individual'
Bosnian Footballer of the Year: 2014
Serie A Team of the Year: 2015–16, 2016–17, 2017–18, 2018–19
UEFA Champions League Team of the Season: 2016–17
Globe Soccer Awards Player Career Award: 2019
Bosnian Sportsman of the Year: 2020
See also
List of men's footballers with 100 or more international caps
References
External links
1990 births
Living people
Bosniaks of Bosnia and Herzegovina
Luxembourgian people of Bosnia and Herzegovina descent
Yugoslav Wars refugees
Bosnia and Herzegovina emigrants to Luxembourg
Bosnia and Herzegovina Muslims
Footballers from Tuzla
Luxembourgian men's footballers
Bosnia and Herzegovina men's footballers
Men's association football midfielders
Ligue 1 players
Serie A players
La Liga players
Süper Lig players
UAE Pro League players
FC Metz players
Olympique Lyonnais players
AS Roma players
Juventus FC players
FC Barcelona players
Beşiktaş J.K. footballers
Sharjah FC players
Luxembourg men's youth international footballers
Bosnia and Herzegovina men's international footballers
2014 FIFA World Cup players
Bosnia and Herzegovina expatriate men's footballers
Bosnia and Herzegovina expatriate sportspeople in France
Bosnia and Herzegovina expatriate sportspeople in Italy
Bosnia and Herzegovina expatriate sportspeople in Spain
Bosnia and Herzegovina expatriate sportspeople in Turkey
Bosnia and Herzegovina expatriate sportspeople in the United Arab Emirates
Expatriate men's footballers in France
Expatriate men's footballers in Italy
Expatriate men's footballers in Spain
Expatriate men's footballers in Turkey
Expatriate men's footballers in the United Arab Emirates
FIFA Men's Century Club
FC Schifflange 95 players |
The Burkitt Medal is awarded annually by the British Academy "in recognition of special service to Biblical Studies". Awards alternate between Hebrew Bible studies (odd years) and New Testament studies (even years). It was established in 1923 and has been awarded to many notable theologians. It is named in honour of Francis Crawford Burkitt.
List of recipients
The first recipient of the Burkitt medal was R. H. Charles (1925). Below is a full list of recipients:
1925–1999
1925 The Ven. Archdeacon R. H. Charles
1926 Professor F. C. Burkitt
1927 The Rev. Canon B. H. Streeter
1928 Professor J. H. Ropes
1929 The Rev. Professor M.-J. Lagrange, OP
1930 Dr. C. G. Montefiore
1931 No Award
1932 Professor Alexander Souter
1933 No Award
1934 Sir Frederic G. Kenyon
1935 No Award
1936 Professor Kirsopp Lake
1937 No Award
1938 The Rev. Dr. W. O. E. Oesterley
1939 The Rev. Dr. A. E. Brooke and Dr. Norman Mclean
1940 The Rev. L. Hugues Vincent, OSD
1941 The Rev. S. C. E. Legg
1942 No Award
1943 Professor S. A. Cook
1944 The Rev. Dr. H. Wheeler Robinson
1945 The Rev. Professor C. H. Dodd
1946 Professor Theodore Henry Robinson
1947 The Rev. Dr. W. F. Howard
1948 Professor S. H. Hooke
1949 Professor Sigmund Mowinckel
1950 The Rev. Professor T. W. Manson
1951 The Rev. Professor H. H. Rowley
1952 Professor Anton Fridrichsen
1953 Sir Godfrey R. Driver
1954 Professor P. E. Kahle and Professor Ludwig Koehler
1955 Professor Walther Bauer
1956 Professor Oscar Cullmann
1957 The Rev. Roland de Vaux, OP
1958 Professor Joachim Jeremias
1959 Charles Virolleaud
1960 The Rev. Dr. Vincent Taylor
1961 The Rev. Professor A. R. Johnson
1962 The Rev. Professor Matthew Black
1963 Professor Walther Eichrodt
1964 Professor W. D. Davies
1965 Professor Otto Eissfeldt
1966 Professor C. K. Barrett
1967 Professor Martin Noth
1968 The Rev. Professor P. Benoit, OP
1969 Professor D. Winton Thomas
1970 The Rev. Professor C. F. D. Moule
1971 Professor Ernst Kasemann
1972 Professor W. Zimmerli
1973 Professor W. G. Kummel
1974 Professor C. J. Lindblom
1975 Professor K. Aland
1976 Professor E. H. Riesenfeld
1977 Professor D. C. Westermann
1978 Professor H. F. D. Sparks
1979 Professor F. F. Bruce
1980 Professor P. A. H. De Boer
1981 Professor G. B. Caird
1982 Professor G. W. Anderson
1983 Dom Bonifatius Fischer, OSB
1984 The Rev. Professor J. A. Fitzmyer, SJ
1985 Professor W. Mckane
1986 Professor M. Hengel
1987 Professor Dr R. Schnackenburg
1988 Professor James Barr
1989 Professor C. E. B. Cranfield
1990 Professor R. M. Wilson
1991 Professor J. A. Emerton
1992 Dr Ernst Bammel
1993 Professor Otto Kaiser
1994 Professor B. M. Metzger
1995 Professor Dr A. S. Van Der Woude
1996 Professor Dr E. Schweizer
1997 Professor R. N. Whybray
1998 Rev. Dr Margaret Thrall
1999 Professor Brevard S. Childs
2000s
2010s
2020s
See also
Awards of the British Academy
List of religion-related awards
References
British Academy
British awards
Academic awards
Religion-related awards |
Hanspeter Lüthi (born 27 April 1944) is a Swiss rower. He competed in the men's coxed four event at the 1972 Summer Olympics.
References
1944 births
Living people
Swiss male rowers
Olympic rowers for Switzerland
Rowers at the 1972 Summer Olympics
Place of birth missing (living people) |
The Jono El Grande Orchestra was formed in 2000 by composer Jono El Grande. TJEGO exclusively performs Jono El Grande's music and consists of selected musicians who have played with Oslo Philharmonic Orchestra, Oslo Sinfonietta and Poing.
Involved musicians from 2000 - 2012 (in scoral part order):
Jono El Grande - guitars, vocals & conducting
Hans Martin Austestad - vocals
Bård Bratlie - vocals & kazoo
Stefan Ibsen Zlatanos – vocals, flute & piano
Sjur Odden Skjeldal - vocals & performance dance
Kjell Asbjørn Bunæs - flute
Lise Herland - oboe
Anne-Sofie Halvorsen - bass clarinet
Lars Frank - bass clarinet, soprano, tenor & baritone saxophone
Rolf Borch - clarinet Bb & bass clarinet
Embrik Snerte - bassoon
Erik Løkra - soprano, tenor & baritone saxophone
Rolf-Erik Nystrøm - sopranino, alto & baritone saxophone
Hallvard M. Godal - baritone saxophone
Karl Strømme - trumpet
Tarjei Grimsby - trombone
Øyvind Brække - trombone
Tomas Gantelius - piano & synth
André Bongard - keyboards
Andreas Ulvo - keyboards
Petter Sørlie Kragstad - keyboards
Lars Andreas Aspesæter – Fender Rhodes
Thor Kvande - synth & Fender Rhodes
Ståle Liavik Solberg - drums
Terje Engen - drums
Thomas Dulsrud – drums
Ole Henrik Moe – saw
Håkon Mørch Stene - xylophone, vibraphone & percussion
Erik Fossen Nilsen - xylophone, vibraphone & percussion
Kjell Tore Innervik - xylophone
Anders Kregnes Hansen - vibraphone
Ida Kristine Hansen - violin I
Isa Caroline Holmesland - violin II
Karin Hellqvist - violin I & II
Gunnhild Oddbjørnsdatter Nordahl - viola
Lars Bryngelsson - viola
Cecilia Anne Wilder - viola
Lisa Isabel Holstad - cello
Kaja Pettersen - cello
Eivind Henjum - bass
Sigurd Dale - bass
Håkon Thelin - double bass
Musical groups established in 2000
2000 establishments in Norway
Musical groups from Oslo |
Okanagana gibbera is a species of cicada in the family Cicadidae. It is found in North America.
References
Further reading
Insects described in 1927
Okanagana |
The Palácio Monroe was a monumental hall in the Centro neighborhood in Rio de Janeiro, Brazil. It was named in honor of U.S. president James Monroe. It was originally built in the U.S. city of St. Louis to act as the Brazilian Pavilion during the 1904 World's Fair. Following the World's Fair, the building was dismantled and transported in cargo ships to Rio de Janeiro, where it was rebuilt in 1906. Its grand opening at the 3rd Pan-American Conference was held on July 23, 1906. From 1914 to 1920, the palace was used as the home of the Brazilian Congress. From 1925 to 1960 it was used as the home of the Brazilian Senate.
In 1975, the architect and urban planner Lúcio Costa, who was the national chief of the National Institute of Historic and Artistic Heritage (Instituto do Patrimônio Histórico e Artístico Nacional – IPHAN), created a public controversy by refusing to sign the landmarking act of Palácio Monroe. The building was slated for demolition because of the construction of the Rio de Janeiro Metro, but in the face of public and media outcry, the construction company shifted the line to preserve the building. This effort, however, was in vain, because on October 11, 1975, the Brazilian president Ernesto Geisel authorized the building's demolition and a developer razed the building in March 1976. The decision was contrary to the State of Rio de Janeiro's decision declaring the building an Official Landmark in 1974. In 1979, the Cinelândia Station was opened as one of the first five stations of the then-new metro network, on the site of the demolished palace.
Gallery
References
External links
Palácio Monroe – Por que foi demolido?
Demolished buildings and structures in Brazil
Buildings and structures in Rio de Janeiro (city)
Former seats of national legislatures
World's fair architecture in Missouri
World's fair architecture in South America
1904 establishments in Missouri
1904 disestablishments in Missouri
1906 establishments in Brazil
1976 disestablishments in Brazil |
Haemoniae or Haimoniai () was a town in ancient Arcadia, in the district Maenalia.
Its site is near the modern Perivolia/Rousvanaga.
References
Populated places in ancient Arcadia
Former populated places in Greece |
Conus purvisi is a species of sea snail, a marine gastropod mollusk in the family Conidae, the cone snails, cone shells or cones.
These snails are predatory and venomous. They are capable of "stinging" humans.
Description
Distribution
This marine species of cone snail is endemic to the Cape Verdes.
References
Cossignani T. & Fiadeiro R. (2017). Otto nuovi coni da Capo Verde. Malacologia Mostra Mondiale. 94: 26-36.page(s): 27
purvisi
Gastropods described in 2017
Gastropods of Cape Verde |
Elie Azagury (; 1918-2009) was an influential Moroccan architect and director of the (GAMMA) after Moroccan independence in 1956. He is considered the first Moroccan modernist architect, with works in cities such as Casablanca, Tangier, and Agadir. Azagury was also a controversial and outspoken Communist, and was active designing cités, or social housing projects made up of modular units, in places like Hay Hassani in Casablanca. These projects combined elements of modern and vernacular architecture, taking local culture and lifestyles into account.
Biography
Early life
Elie Azagury was born in Casablanca in 1918 to a Jewish family from the north of Morocco. His father, Judah-Haïm Azagury, was a businessman, the manager of a mercantile house in Casablanca. The surname Azagury is probably related to Zagora, the historical capital of the Draa Valley region.
He grew up with his close friend and eventual colleague Jean-François Zevaco.
He worked briefly as an apprentice for Marius Boyer, a major figure in the architecture of Casablanca in the period from the 1920s through the 1940s.
Studies
He left Casablanca for Paris in 1937, as there was no architecture school in Morocco. He worked as an apprentice at the Atelier of Hérault, Boutrin in Paris for two years while studying for the entrance exams of the Ecole des Beaux Arts, which he finally passed on his 4th attempt in 1939, placing 17th out of 1,000. The following year, he escaped Paris as it was in the Nazi-occupied , heading south for Marseille alone on his bicycle.
On his way, an architect in Pau offered him food, a place to stay, and a job, which Azagury held for a month and a half. In Marseille, he worked at the for two years, where he was inspired by American architecture—especially the work of Richard Neutra and Frank Lloyd Wright.
He then took a job in Megève, where he worked for an architect named Michel Aimé for two years during World War II. The day after a neighbor exposed that he was Jewish, police officers came to him recommending that he skip town as they had received orders to arrest him. He took what possessions he could carry and returned to Paris on foot, taking backroads so as to avoid checkpoints. He finished his degree at the Ecole des Beaux Arts in Paris in the Studio of Auguste Perret in 1944, at the time of the Liberation of Paris. In the period immediately after his graduation, Azagury supported himself by washing dishes at the university cafeteria.
Early career
Shortly afterward, he moved to Stockholm to work with Ralph Erskine for 2 years. Azagury was influenced by the artists and creatives he met in Stockholm, including Ingmar Bergman and Vivianna Torun Bülow-Hübe. Inspiration from Swedish architecture can be seen later in his projects (1954) and (1963; now the Ibrahim Roudani School).
On his way back to Morocco, Azagury returned to Paris to assist Paul Nelson with the opening of his office, and stayed in Paris for 2 years. There, he socialized with leftist intellectuals such as Jacques Prévert, Fernand Léger, Georges Braque, and Tristan Tzara. He then continued his journey south and met with Le Corbusier for a day in Marseille, where they toured the construction site of (). Azagury was inspired by Le Corbusier's thinking on "vertical living" and use of concrete, and since always employed the golden ratio in his architectural designs.
He returned to Casablanca in 1949. His first projects were designing furniture and private villas, such as Villa Dahon and Villa Shullman (1951). He also won a competition to design the science building for Lycée Lyautey on Blvd. Mers Sultan (now Muhammad V High School).
GAMMA
Azagury was the only "native" Moroccan in the (GAMMA). He and Georges Candilis pushed Michel Écochard, director of urban planning at the end of the French Protectorate, for higher density housing in the "Housing for the Greatest Number" project at Carrières Centrales, presented at the 1953 . Azagury described his relationship with Écochard as "tumultuous;" while he respected his intellect and work ethic, Ecochard was "clearly an active instrument of the French colonial power." Ecochard was convinced that Moroccans could not live in high-rises, while Azagury considered verticalization "an economic and social necessity."
Azagury led GAMMA after Morocco's independence in 1956. He feared throughout the following decade that independence would come with a return to vernacular architecture instead of modernism, but was relieved that this wasn't the case.
Azagury's Derb Jdid housing project (1957-1960) in Hay Hassani was a response to Ecochard's belief that Moroccans could not live in vertical housing.
Agadir reconstruction
He often worked with his close friend Jean-François Zevaco, including in the reconstruction of Agadir after the earthquake that destroyed it in 1960. Azagury arrived in Agadir on March 8, 1960–8 days after the earthquake—and was "traumatized" by the devastation. He was compelled to design architecture that "inspired strength, endurance, and domination over the forces of nature; an architecture that could help the healing process for survivors." Azagury was disappointed that the project was led by Pierre Mas, who "was trained neither as an architect nor as a planner," and who severed the core of the city from the beach with a tourist district.
Azagury led the Cabo Negro Mediterranean resort project from 1970 to 1980.
Legacy
On December 20, 2019, MAMMA. sponsored an event dedicated to the architectural legacy of Elie Azagury, the first Moroccan modernist architect. This event included guided tours of the Ibrahim Roudani School and a lecture hosted at the Saudi Library.
See also
Architecture of Casablanca
Jean-François Zevaco
MAMMA.
References
External links
MAMMA.'s archives of Azagury's works: https://mammagroup.org/elie-azagury
Moroccan architects
1918 births
2009 deaths
Modernist architects
20th-century Moroccan Jews
People from Casablanca
Moroccan communists
Jewish communists |
```javascript
// @flow
import { translate3d } from './utils';
import type { Animation } from './types';
const fadeOutLeft: Animation = {
from: {
opacity: 1
},
to: {
opacity: 0,
transform: translate3d('-100%', 0, 0)
}
};
export default fadeOutLeft;
``` |
The Senior Presiding Judge for England and Wales is a member of the Court of Appeal appointed by the Lord Chief Justice to supervise the Presiding Judges for the various judicial circuits of England and Wales. The Senior Presiding Judge is responsible for deployment and personnel issues for all circuits and acts as a "general point of liaison" for the courts, judiciary and Government.
The post dates to the appointment in 1983 of Sir Tasker Watkins, who remains the longest-serving holder of the office. The arrangement was put on a statutory footing with the enactment of the Courts and Legal Services Act 1990.
Presiding Judges
In each circuit, there are two Presiding Judges appointed by the Lord Chief Justice to preside each of the six circuits in England and Wales, with the exception of the South-Eastern circuit which is supervised by the Lord Chief Justice and two High Court judges. The judge is responsible for the deployment of the judiciary and allocation of cases and for the general supervision of the judiciary in the circuit.
List of Senior Presiding Judges
1983: Sir Tasker Watkins VC GBE
1991: Sir Anthony McCowan
1995: Sir Robin Auld
1998: Sir Igor Judge
2003: Sir John Thomas
1 January 2007: Sir Brian Leveson
1 January 2010: Sir John Goldring
1 January 2013: Sir Peter Gross
1 January 2016: Sir Adrian Fulford
3 April 2017: Dame Julia Macur
1 January 2020: Dame Kathryn Thirlwall
1 October 2021: Sir Charles Haddon-Cave
1 October 2022: Sir Andrew Edis
Deputy Senior Presiding Judge
Following the enactment of the Constitutional Reform Act 2005, increased duties for the Senior Presiding Judge prompted the Lord Chief Justice to appoint a deputy. The office has twice fallen vacant for 21 months, each time after the incumbent became Senior Presiding Judge.
1 January 2006: Sir Brian Leveson
1 January 2007: Vacant
October 2008: Sir John Goldring
1 January 2010: Vacant
3 October 2011: Sir Peter Gross
1 January 2013: Vacant
1 January 2015: Sir Adrian Fulford
1 January 2016: Dame Julia Macur
10 October 2017: Dame Kathryn Thirlwall
1 January 2020: Sir Charles Haddon-Cave
29 November 2021: Sir Andrew Edis1 October 2022:''' Vacant
References
Judiciary of England and Wales |
```java
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.beam.sdk.transforms;
import static org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.base.Preconditions.checkArgument;
import com.google.auto.value.AutoValue;
import java.io.Serializable;
import java.nio.ByteBuffer;
import java.util.UUID;
import javax.annotation.Nullable;
import org.apache.beam.sdk.coders.Coder;
import org.apache.beam.sdk.coders.KvCoder;
import org.apache.beam.sdk.state.BagState;
import org.apache.beam.sdk.state.CombiningState;
import org.apache.beam.sdk.state.StateSpec;
import org.apache.beam.sdk.state.StateSpecs;
import org.apache.beam.sdk.state.TimeDomain;
import org.apache.beam.sdk.state.Timer;
import org.apache.beam.sdk.state.TimerSpec;
import org.apache.beam.sdk.state.TimerSpecs;
import org.apache.beam.sdk.state.ValueState;
import org.apache.beam.sdk.transforms.windowing.BoundedWindow;
import org.apache.beam.sdk.util.ShardedKey;
import org.apache.beam.sdk.util.common.ElementByteSizeObserver;
import org.apache.beam.sdk.values.KV;
import org.apache.beam.sdk.values.PCollection;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.annotations.VisibleForTesting;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.base.MoreObjects;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.base.Preconditions;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.collect.Iterables;
import org.joda.time.Duration;
import org.joda.time.Instant;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
/**
* A {@link PTransform} that batches inputs to a desired batch size. Batches will contain only
* elements of a single key.
*
* <p>Elements are buffered until there are enough elements for a batch, at which point they are
* emitted to the output {@link PCollection}. A {@code maxBufferingDuration} can be set to emit
* output early and avoid waiting for a full batch forever.
*
* <p>Batches can be triggered either based on element count or byte size. {@link #ofSize} is used
* to specify a maximum element count while {@link #ofByteSize} is used to specify a maximum byte
* size. The single-argument {@link #ofByteSize} uses the input coder to determine the encoded byte
* size of each element. However, this may not always be what is desired. A user may want to control
* batching based on a different byte size (e.g. the memory usage of the decoded Java object) or the
* input coder may not be able to efficiently determine the elements' byte size. For these cases, we
* also provide the two-argument {@link #ofByteSize} allowing the user to pass in a function to be
* used to determine the byte size of an element.
*
* <p>Windows are preserved (batches contain elements from the same window). Batches may contain
* elements from more than one bundle.
*
* <p>Example 1 (batch call a webservice and get return codes):
*
* <pre>{@code
* PCollection<KV<String, String>> input = ...;
* long batchSize = 100L;
* PCollection<KV<String, Iterable<String>>> batched = input
* .apply(GroupIntoBatches.<String, String>ofSize(batchSize))
* .setCoder(KvCoder.of(StringUtf8Coder.of(), IterableCoder.of(StringUtf8Coder.of())))
* .apply(ParDo.of(new DoFn<KV<String, Iterable<String>>, KV<String, String>>() }{
* {@code @ProcessElement
* public void processElement(@Element KV<String, Iterable<String>> element,
* OutputReceiver<KV<String, String>> r) {
* r.output(KV.of(element.getKey(), callWebService(element.getValue())));
* }
* }}));
* </pre>
*
* <p>Example 2 (batch unbounded input in a global window):
*
* <pre>{@code
* PCollection<KV<String, String>> unboundedInput = ...;
* long batchSize = 100L;
* Duration maxBufferingDuration = Duration.standardSeconds(10);
* PCollection<KV<String, Iterable<String>>> batched = unboundedInput
* .apply(Window.<KV<String, String>>into(new GlobalWindows())
* .triggering(Repeatedly.forever(AfterPane.elementCountAtLeast(1)))
* .discardingFiredPanes())
* .apply(GroupIntoBatches.<String, String>ofSize(batchSize)
* .withMaxBufferingDuration(maxBufferingDuration));
* }</pre>
*/
@SuppressWarnings({
"nullness", // TODO(path_to_url
"rawtypes",
// TODO(path_to_url Remove when new version of
// errorprone is released (2.11.0)
"unused"
})
public class GroupIntoBatches<K, InputT>
extends PTransform<PCollection<KV<K, InputT>>, PCollection<KV<K, Iterable<InputT>>>> {
/**
* Wrapper class for batching parameters supplied by users. Shared by both {@link
* GroupIntoBatches} and {@link GroupIntoBatches.WithShardedKey}.
*/
@AutoValue
public abstract static class BatchingParams<InputT> implements Serializable {
public static <InputT> BatchingParams<InputT> createDefault() {
return new AutoValue_GroupIntoBatches_BatchingParams(
Long.MAX_VALUE, Long.MAX_VALUE, null, Duration.ZERO);
}
public static <InputT> BatchingParams<InputT> create(
long batchSize,
long batchSizeBytes,
SerializableFunction<InputT, Long> elementByteSize,
Duration maxBufferingDuration) {
return new AutoValue_GroupIntoBatches_BatchingParams(
batchSize, batchSizeBytes, elementByteSize, maxBufferingDuration);
}
public abstract long getBatchSize();
public abstract long getBatchSizeBytes();
@Nullable
public abstract SerializableFunction<InputT, Long> getElementByteSize();
public abstract Duration getMaxBufferingDuration();
public SerializableFunction<InputT, Long> getWeigher(Coder<InputT> valueCoder) {
SerializableFunction<InputT, Long> weigher = getElementByteSize();
if (getBatchSizeBytes() < Long.MAX_VALUE) {
if (weigher == null) {
// If the user didn't specify a byte-size function, then use the Coder to determine the
// byte
// size.
// Note: if Coder.isRegisterByteSizeObserverCheap == false, then this will be expensive.
weigher =
(InputT element) -> {
try {
ByteSizeObserver observer = new ByteSizeObserver();
valueCoder.registerByteSizeObserver(element, observer);
observer.advance();
return observer.getElementByteSize();
} catch (Exception e) {
throw new RuntimeException(e);
}
};
}
}
return weigher;
}
}
private final BatchingParams<InputT> params;
private static final UUID workerUuid = UUID.randomUUID();
private GroupIntoBatches(BatchingParams<InputT> params) {
this.params = params;
}
/** Aim to create batches each with the specified element count. */
public static <K, InputT> GroupIntoBatches<K, InputT> ofSize(long batchSize) {
Preconditions.checkState(batchSize < Long.MAX_VALUE);
return new GroupIntoBatches<K, InputT>(BatchingParams.createDefault()).withSize(batchSize);
}
/**
* Aim to create batches each with the specified byte size.
*
* <p>This option uses the PCollection's coder to determine the byte size of each element. This
* may not always be what is desired (e.g. the encoded size is not the same as the memory usage of
* the Java object). This is also only recommended if the coder returns true for
* isRegisterByteSizeObserverCheap, otherwise the transform will perform a possibly-expensive
* encoding of each element in order to measure its byte size. An alternate approach is to use
* {@link #ofByteSize(long, SerializableFunction)} to specify code to calculate the byte size.
*/
public static <K, InputT> GroupIntoBatches<K, InputT> ofByteSize(long batchSizeBytes) {
return new GroupIntoBatches<K, InputT>(BatchingParams.createDefault())
.withByteSize(batchSizeBytes);
}
/**
* Aim to create batches each with the specified byte size. The provided function is used to
* determine the byte size of each element.
*/
public static <K, InputT> GroupIntoBatches<K, InputT> ofByteSize(
long batchSizeBytes, SerializableFunction<InputT, Long> getElementByteSize) {
return new GroupIntoBatches<K, InputT>(BatchingParams.createDefault())
.withByteSize(batchSizeBytes, getElementByteSize);
}
/** Returns user supplied parameters for batching. */
public BatchingParams<InputT> getBatchingParams() {
return params;
}
@Override
public String toString() {
return super.toString() + ", params=" + params;
}
/** @see #ofSize(long) */
public GroupIntoBatches<K, InputT> withSize(long batchSize) {
Preconditions.checkState(batchSize < Long.MAX_VALUE);
return new GroupIntoBatches<>(
BatchingParams.create(
batchSize,
params.getBatchSizeBytes(),
params.getElementByteSize(),
params.getMaxBufferingDuration()));
}
/** @see #ofByteSize(long) */
public GroupIntoBatches<K, InputT> withByteSize(long batchSizeBytes) {
Preconditions.checkState(batchSizeBytes < Long.MAX_VALUE);
return new GroupIntoBatches<>(
BatchingParams.create(
params.getBatchSize(),
batchSizeBytes,
params.getElementByteSize(),
params.getMaxBufferingDuration()));
}
/** @see #ofByteSize(long, SerializableFunction) */
public GroupIntoBatches<K, InputT> withByteSize(
long batchSizeBytes, SerializableFunction<InputT, Long> getElementByteSize) {
Preconditions.checkState(batchSizeBytes < Long.MAX_VALUE);
return new GroupIntoBatches<>(
BatchingParams.create(
params.getBatchSize(),
batchSizeBytes,
getElementByteSize,
params.getMaxBufferingDuration()));
}
/**
* Sets a time limit (in processing time) on how long an incomplete batch of elements is allowed
* to be buffered. Once a batch is flushed to output, the timer is reset. The provided limit must
* be a positive duration or zero; a zero buffering duration effectively means no limit.
*/
public GroupIntoBatches<K, InputT> withMaxBufferingDuration(Duration duration) {
checkArgument(
duration != null && !duration.isShorterThan(Duration.ZERO),
"max buffering duration should be a non-negative value");
return new GroupIntoBatches<>(
BatchingParams.create(
params.getBatchSize(),
params.getBatchSizeBytes(),
params.getElementByteSize(),
duration));
}
/**
* Outputs batched elements associated with sharded input keys. By default, keys are sharded to
* such that the input elements with the same key are spread to all available threads executing
* the transform. Runners may override the default sharding to do a better load balancing during
* the execution time.
*/
public WithShardedKey withShardedKey() {
return new WithShardedKey();
}
public class WithShardedKey
extends PTransform<
PCollection<KV<K, InputT>>, PCollection<KV<ShardedKey<K>, Iterable<InputT>>>> {
private WithShardedKey() {}
/** Returns user supplied parameters for batching. */
public BatchingParams<InputT> getBatchingParams() {
return params;
}
@Override
public PCollection<KV<ShardedKey<K>, Iterable<InputT>>> expand(
PCollection<KV<K, InputT>> input) {
checkArgument(
input.getCoder() instanceof KvCoder,
"coder specified in the input PCollection is not a KvCoder");
KvCoder<K, InputT> inputCoder = (KvCoder<K, InputT>) input.getCoder();
Coder<K> keyCoder = (Coder<K>) inputCoder.getCoderArguments().get(0);
Coder<InputT> valueCoder = (Coder<InputT>) inputCoder.getCoderArguments().get(1);
return input
.apply(
MapElements.via(
new SimpleFunction<KV<K, InputT>, KV<ShardedKey<K>, InputT>>() {
@Override
public KV<ShardedKey<K>, InputT> apply(KV<K, InputT> input) {
long tid = Thread.currentThread().getId();
ByteBuffer buffer = ByteBuffer.allocate(3 * Long.BYTES);
buffer.putLong(workerUuid.getMostSignificantBits());
buffer.putLong(workerUuid.getLeastSignificantBits());
buffer.putLong(tid);
return KV.of(ShardedKey.of(input.getKey(), buffer.array()), input.getValue());
}
}))
.setCoder(KvCoder.of(ShardedKey.Coder.of(keyCoder), valueCoder))
.apply(new GroupIntoBatches<>(getBatchingParams()));
}
}
private static class ByteSizeObserver extends ElementByteSizeObserver {
private long elementByteSize = 0;
@Override
protected void reportElementSize(long elementByteSize) {
this.elementByteSize += elementByteSize;
}
public long getElementByteSize() {
return this.elementByteSize;
}
};
@Override
public PCollection<KV<K, Iterable<InputT>>> expand(PCollection<KV<K, InputT>> input) {
Duration allowedLateness = input.getWindowingStrategy().getAllowedLateness();
checkArgument(
input.getCoder() instanceof KvCoder,
"coder specified in the input PCollection is not a KvCoder");
KvCoder<K, InputT> inputCoder = (KvCoder<K, InputT>) input.getCoder();
final Coder<InputT> valueCoder = (Coder<InputT>) inputCoder.getCoderArguments().get(1);
SerializableFunction<InputT, Long> weigher = params.getWeigher(valueCoder);
return input.apply(
ParDo.of(
new GroupIntoBatchesDoFn<>(
params.getBatchSize(),
params.getBatchSizeBytes(),
weigher,
params.getMaxBufferingDuration(),
allowedLateness,
valueCoder)));
}
@VisibleForTesting
private static class GroupIntoBatchesDoFn<K, InputT>
extends DoFn<KV<K, InputT>, KV<K, Iterable<InputT>>> {
private static final Logger LOG = LoggerFactory.getLogger(GroupIntoBatchesDoFn.class);
private final long batchSize;
private final long batchSizeBytes;
@Nullable private final SerializableFunction<InputT, Long> weigher;
private final Duration maxBufferingDuration;
private final Duration allowedLateness;
// The following timer is no longer set. We maintain the spec for update compatibility.
private static final String END_OF_WINDOW_ID = "endOFWindow";
@TimerId(END_OF_WINDOW_ID)
private final TimerSpec windowTimer = TimerSpecs.timer(TimeDomain.EVENT_TIME);
// This timer manages the watermark hold if there is no buffering timer.
private static final String TIMER_HOLD_ID = "watermarkHold";
@TimerId(TIMER_HOLD_ID)
private final TimerSpec holdTimerSpec = TimerSpecs.timer(TimeDomain.EVENT_TIME);
// This timer expires when it's time to batch and output the buffered data.
private static final String END_OF_BUFFERING_ID = "endOfBuffering";
@TimerId(END_OF_BUFFERING_ID)
private final TimerSpec bufferingTimer = TimerSpecs.timer(TimeDomain.PROCESSING_TIME);
// The set of elements that will go in the next batch.
private static final String BATCH_ID = "batch";
@StateId(BATCH_ID)
private final StateSpec<BagState<InputT>> batchSpec;
// The size of the current batch.
private static final String NUM_ELEMENTS_IN_BATCH_ID = "numElementsInBatch";
@StateId(NUM_ELEMENTS_IN_BATCH_ID)
private final StateSpec<CombiningState<Long, long[], Long>> batchSizeSpec;
private static final String NUM_BYTES_IN_BATCH_ID = "numBytesInBatch";
// The byte size of the current batch.
@StateId(NUM_BYTES_IN_BATCH_ID)
private final StateSpec<CombiningState<Long, long[], Long>> batchSizeBytesSpec;
private static final String TIMER_TIMESTAMP = "timerTs";
// The timestamp of the current active timer.
@StateId(TIMER_TIMESTAMP)
private final StateSpec<ValueState<Long>> timerTsSpec;
// The minimum element timestamp currently buffered in the bag. This is used to set the output
// timestamp
// on the timer which ensures that the watermark correctly tracks the buffered elements.
private static final String MIN_BUFFERED_TS = "minBufferedTs";
@StateId(MIN_BUFFERED_TS)
private final StateSpec<CombiningState<Long, long[], Long>> minBufferedTsSpec;
private final long prefetchFrequency;
GroupIntoBatchesDoFn(
long batchSize,
long batchSizeBytes,
@Nullable SerializableFunction<InputT, Long> weigher,
Duration maxBufferingDuration,
Duration allowedLateness,
Coder<InputT> inputValueCoder) {
this.batchSize = batchSize;
this.batchSizeBytes = batchSizeBytes;
this.weigher = weigher;
this.maxBufferingDuration = maxBufferingDuration;
this.allowedLateness = allowedLateness;
this.batchSpec = StateSpecs.bag(inputValueCoder);
Combine.BinaryCombineLongFn sumCombineFn =
new Combine.BinaryCombineLongFn() {
@Override
public long identity() {
return 0L;
}
@Override
public long apply(long left, long right) {
return left + right;
}
};
Combine.BinaryCombineLongFn minCombineFn =
new Combine.BinaryCombineLongFn() {
@Override
public long identity() {
return BoundedWindow.TIMESTAMP_MAX_VALUE.getMillis();
}
@Override
public long apply(long left, long right) {
return Math.min(left, right);
}
};
this.batchSizeSpec = StateSpecs.combining(sumCombineFn);
this.batchSizeBytesSpec = StateSpecs.combining(sumCombineFn);
this.timerTsSpec = StateSpecs.value();
this.minBufferedTsSpec = StateSpecs.combining(minCombineFn);
// Prefetch every 20% of batchSize elements. Do not prefetch if batchSize is too little
this.prefetchFrequency = ((batchSize / 5) <= 1) ? Long.MAX_VALUE : (batchSize / 5);
}
@Override
public Duration getAllowedTimestampSkew() {
// This is required since flush is sometimes called from processElement. This is safe because
// a watermark hold
// will always be set using timer.withOutputTimestamp.
return Duration.millis(Long.MAX_VALUE);
}
@ProcessElement
public void processElement(
@TimerId(END_OF_BUFFERING_ID) Timer bufferingTimer,
@TimerId(TIMER_HOLD_ID) Timer holdTimer,
@StateId(BATCH_ID) BagState<InputT> batch,
@StateId(NUM_ELEMENTS_IN_BATCH_ID) CombiningState<Long, long[], Long> storedBatchSize,
@StateId(NUM_BYTES_IN_BATCH_ID) CombiningState<Long, long[], Long> storedBatchSizeBytes,
@StateId(TIMER_TIMESTAMP) ValueState<Long> timerTs,
@StateId(MIN_BUFFERED_TS) CombiningState<Long, long[], Long> minBufferedTs,
@Element KV<K, InputT> element,
@Timestamp Instant elementTs,
BoundedWindow window,
OutputReceiver<KV<K, Iterable<InputT>>> receiver) {
final boolean shouldCareAboutWeight = weigher != null && batchSizeBytes != Long.MAX_VALUE;
final boolean shouldCareAboutMaxBufferingDuration =
maxBufferingDuration.isLongerThan(Duration.ZERO);
if (shouldCareAboutWeight) {
storedBatchSizeBytes.readLater();
}
storedBatchSize.readLater();
minBufferedTs.readLater();
// Make sure we always include the current timestamp in the minBufferedTs.
minBufferedTs.add(elementTs.getMillis());
LOG.debug("*** BATCH *** Add element for window {} ", window);
if (shouldCareAboutWeight) {
final long elementWeight = weigher.apply(element.getValue());
if (elementWeight + storedBatchSizeBytes.read() > batchSizeBytes) {
// Firing by count and size limits behave differently.
//
// We always increase the count by one, so we will fire at the exact limit without any
// overflow.
// before the addition: x < limit
// after the addition: x < limit OR x == limit(triggered)
//
// Meanwhile when we increase the batched byte size we do it with an undeterministic
// amount, so if we only check the limit after we already increased the batch size it
// could mean we fire over the limit.
// before the addition: x < limit
// after the addition: x < limit OR x == limit(triggered) OR x > limit(triggered)
// We shouldn't trigger a batch with bigger size than the config to limit it contains, so
// we fire it early if necessary.
LOG.debug("*** EARLY FIRE OF BATCH *** for window {}", window.toString());
flushBatch(
receiver,
element.getKey(),
batch,
storedBatchSize,
storedBatchSizeBytes,
timerTs,
minBufferedTs);
bufferingTimer.clear();
holdTimer.clear();
}
storedBatchSizeBytes.add(elementWeight);
}
batch.add(element.getValue());
// Blind add is supported with combiningState
storedBatchSize.add(1L);
// Add the timestamp back into minBufferedTs as it might be cleared by flushBatch above.
minBufferedTs.add(elementTs.getMillis());
final long num = storedBatchSize.read();
// If this is the first element in the batch or if the timer's output timestamp needs
// modifying, then set a timer.
long oldOutputTs =
MoreObjects.firstNonNull(
minBufferedTs.read(), BoundedWindow.TIMESTAMP_MAX_VALUE.getMillis());
boolean needsNewTimer = num == 1 || minBufferedTs.read() != oldOutputTs;
if (needsNewTimer) {
if (shouldCareAboutMaxBufferingDuration) {
long targetTs =
MoreObjects.firstNonNull(
timerTs.read(),
bufferingTimer.getCurrentRelativeTime().getMillis()
+ maxBufferingDuration.getMillis());
bufferingTimer
.withOutputTimestamp(Instant.ofEpochMilli(minBufferedTs.read()))
.set(Instant.ofEpochMilli(targetTs));
} else {
// The only way to hold the watermark is to set a timer. Since there is no buffering
// timer, we set a dummy
// timer at the end of the window to manage the hold.
Instant windowEnd = window.maxTimestamp().plus(allowedLateness);
holdTimer.withOutputTimestamp(Instant.ofEpochMilli(minBufferedTs.read())).set(windowEnd);
}
}
if (num % prefetchFrequency == 0) {
// Prefetch data and modify batch state (readLater() modifies this)
batch.readLater();
}
if (num >= batchSize
|| (shouldCareAboutWeight && storedBatchSizeBytes.read() >= batchSizeBytes)) {
LOG.debug("*** END OF BATCH *** for window {}", window.toString());
flushBatch(
receiver,
element.getKey(),
batch,
storedBatchSize,
storedBatchSizeBytes,
timerTs,
minBufferedTs);
bufferingTimer.clear();
holdTimer.clear();
}
}
@OnTimer(END_OF_BUFFERING_ID)
public void onBufferingTimer(
OutputReceiver<KV<K, Iterable<InputT>>> receiver,
@Timestamp Instant timestamp,
@Key K key,
@StateId(BATCH_ID) BagState<InputT> batch,
@StateId(NUM_ELEMENTS_IN_BATCH_ID) CombiningState<Long, long[], Long> storedBatchSize,
@StateId(NUM_BYTES_IN_BATCH_ID) CombiningState<Long, long[], Long> storedBatchSizeBytes,
@StateId(TIMER_TIMESTAMP) ValueState<Long> timerTs,
@StateId(MIN_BUFFERED_TS) CombiningState<Long, long[], Long> minBufferedTs,
@TimerId(END_OF_BUFFERING_ID) Timer bufferingTimer,
@TimerId(TIMER_HOLD_ID) Timer holdTimer) {
LOG.debug(
"*** END OF BUFFERING *** for timer timestamp {} with buffering duration {}",
timestamp,
maxBufferingDuration);
flushBatch(
receiver, key, batch, storedBatchSize, storedBatchSizeBytes, timerTs, minBufferedTs);
// Generally this is a noop, since holdTimer is not set if bufferingTimer is set. However we
// delete the holdTimer
// here in order to allow users to modify this policy on pipeline update.
holdTimer.clear();
}
@OnWindowExpiration
public void onWindowExpiration(
OutputReceiver<KV<K, Iterable<InputT>>> receiver,
@Key K key,
@StateId(BATCH_ID) BagState<InputT> batch,
@StateId(NUM_ELEMENTS_IN_BATCH_ID) CombiningState<Long, long[], Long> storedBatchSize,
@StateId(NUM_BYTES_IN_BATCH_ID) CombiningState<Long, long[], Long> storedBatchSizeBytes,
@StateId(TIMER_TIMESTAMP) ValueState<Long> timerTs,
@StateId(MIN_BUFFERED_TS) CombiningState<Long, long[], Long> minBufferedTs) {
flushBatch(
receiver, key, batch, storedBatchSize, storedBatchSizeBytes, timerTs, minBufferedTs);
}
@OnTimer(TIMER_HOLD_ID)
public void onHoldTimer() {
// Do nothing. The associated watermark hold will be automatically removed.
}
// We no longer set this timer, since OnWindowExpiration takes care of his. However we leave the
// callback in place
// for existing jobs that have already set these timers.
@OnTimer(END_OF_WINDOW_ID)
public void onWindowTimer(
OutputReceiver<KV<K, Iterable<InputT>>> receiver,
@Timestamp Instant timestamp,
@Key K key,
@StateId(BATCH_ID) BagState<InputT> batch,
@StateId(NUM_ELEMENTS_IN_BATCH_ID) CombiningState<Long, long[], Long> storedBatchSize,
@StateId(NUM_BYTES_IN_BATCH_ID) CombiningState<Long, long[], Long> storedBatchSizeBytes,
@StateId(TIMER_TIMESTAMP) ValueState<Long> timerTs,
@StateId(MIN_BUFFERED_TS) CombiningState<Long, long[], Long> minBufferedTs,
BoundedWindow window) {
LOG.debug(
"*** END OF WINDOW *** for timer timestamp {} in windows {}",
timestamp,
window.toString());
flushBatch(
receiver, key, batch, storedBatchSize, storedBatchSizeBytes, timerTs, minBufferedTs);
}
private void flushBatch(
OutputReceiver<KV<K, Iterable<InputT>>> receiver,
K key,
BagState<InputT> batch,
CombiningState<Long, long[], Long> storedBatchSize,
CombiningState<Long, long[], Long> storedBatchSizeBytes,
ValueState<Long> timerTs,
CombiningState<Long, long[], Long> minBufferedTs) {
Iterable<InputT> values = batch.read();
// When the timer fires, batch state might be empty
if (!Iterables.isEmpty(values)) {
receiver.outputWithTimestamp(
KV.of(key, values), Instant.ofEpochMilli(minBufferedTs.read()));
}
clearState(batch, storedBatchSize, storedBatchSizeBytes, timerTs, minBufferedTs);
}
private void clearState(
BagState<InputT> batch,
CombiningState<Long, long[], Long> storedBatchSize,
CombiningState<Long, long[], Long> storedBatchSizeBytes,
ValueState<Long> timerTs,
CombiningState<Long, long[], Long> minBufferedTs) {
batch.clear();
storedBatchSize.clear();
storedBatchSizeBytes.clear();
timerTs.clear();
minBufferedTs.clear();
}
}
}
``` |
Benjamin Velez is an American composer and lyricist.
Early life
Velez was born in Miami, Florida. He is a graduate of Columbia University where he studied film and wrote the 114th annual Varsity Show.
Career
Velez joined the BMI Lehman Engel Musical Theater Workshop in 2010, where he developed multiple projects, including Afterland, Starblasters, and Borderline.
With book writer and co-lyricist Katie Hathaway, Velez developed Afterland at the Yale Institute for Music Theater (2014), the York Theater (2016), and as a part of several concert series in New York City, including Cutting Edge Composers and a One Night Stand at Ars Nova (2018). Starblasters had a reading at Dixon Place in 2018.
Velez wrote the score for Borderline, an original musical created with book writer Aryanna Garber, which won the 2018 Weston Playhouse New Musical Award and opened the 2019 O’Neill National Musical Theater Conference.
Velez wrote the music and co-wrote the lyrics (with David Kamp) for Kiss My Aztec, a new musical from John Leguizamo directed by Tony Taccone. It was developed at the Public Theater and premiered at Berkeley Repertory Theater and La Jolla Playhouse in 2019, where it received critical acclaim. Kiss My Aztec had its East Coast premiere at Hartford Stage in 2022.
In 2023, Velez was commissioned by the Public Theater to write a musical adaptation of Shakespeare’s The Tempest for its Public Works program, directed by Laurie Woolery. It premiered in August 2023 at Shakespeare in the Park and was the final production at the Delacorte Theater in Central Park before its planned 18-month renovation. The production starred Renée Elise Goldsberry as Prospero and was a New York Times Critic’s Pick.
Awards
2012 BMI Foundation Harrington Award
2017 Sundance Institute Residency at the Ucross Foundation
2018 Weston Playhouse New Musical Award
2018-2019 Dramatists Guild Foundation Fellow
2019 Fred Ebb Award
2020 Jonathan Larson Award
References
External links
Broadway World
American musical theatre composers
Columbia College (New York) alumni
Living people
Place of birth missing (living people)
Songwriters from New York (state)
1988 births |
```kotlin
package com.google.firebase.quickstart.database.kotlin.listfragments
import com.google.firebase.database.DatabaseReference
import com.google.firebase.database.Query
class MyPostsFragment : PostListFragment() {
override fun getQuery(databaseReference: DatabaseReference): Query {
// All my posts
return databaseReference.child("user-posts")
.child(uid)
}
}
``` |
Lewis Field can refer to several locations.
Locations
Airports
Hancock County Airport in Hancock County, Kentucky is also known as Ron Lewis Field
McComb-Pike County Airport in Pike County, Mississippi is also known as John E. Lewis Field
Research facility
John H. Glenn Research Center at Lewis Field, a NASA research center in Ohio
Sports stadiums
Boone Pickens Stadium at Oklahoma State University was previously called Lewis Field
Lewis Field (Fort Hays State University) is a sports stadium in Hays, Kansas
Buddy Lewis Field, a baseball stadium at Sims Legion Park in Gastonia, North Carolina
People
Fielding Lewis, Brother-in-law to George Washington |
```python
from vyper.codegen.ir_node import IRnode
from vyper.venom.ir_node_to_venom import ir_node_to_venom
def test_simple():
ir = IRnode.from_list(["calldatacopy", 32, 0, ["calldatasize"]])
ir_node = IRnode.from_list(ir)
venom = ir_node_to_venom(ir_node)
assert venom is not None
fn = list(venom.functions.values())[0]
bb = fn.entry
assert bb.instructions[0].opcode == "calldatasize"
assert bb.instructions[1].opcode == "calldatacopy"
def test_simple_2():
ir = [
"seq",
[
"seq",
[
"mstore",
["add", 64, 0],
[
"with",
"x",
["calldataload", ["add", 4, 0]],
[
"with",
"ans",
["add", "x", 1],
["seq", ["assert", ["ge", "ans", "x"]], "ans"],
],
],
],
],
32,
]
ir_node = IRnode.from_list(ir)
venom = ir_node_to_venom(ir_node)
assert venom is not None
``` |
The Patriotic Accord () was a government and electoral coalition between Hugo Banzer's Nationalist Democratic Action and the Revolutionary Left Movement between 1989 and 1993. In the 1993 Bolivian general election the alliance got 21.1%.
References
1989 establishments in Bolivia
1993 disestablishments in Bolivia
Defunct political party alliances in Bolivia
Political parties disestablished in 1993
Political parties established in 1989 |
Magic Lizard (; ; lit: Magic lizard) is a 1985 Thai fantasy monster adventure film directed and produced by Sompote Sands. The film's plot follows a large frilled lizard who sets out to retrieve a crystal stolen by aliens.
Summary
Magic Lizard is a large lizard who guards the crystal under the base of the pagoda of the Temple of Dawn. After Martians stole the crystal, Magic Lizard enlists the aid of the giant guardian as he escapes to various locations throughout Thailand, including Bridge on the River Kwai and Phae Mueang Phi. Over the course of the film, Magic Lizard flees from man-eating crocodile, wild elephants, tiger, a mother and baby black bear, run away from a train, giant mosquitoes and skeleton ghost in treasure cave.
Production
Magic Lizard was inspired by Sompote Sands' nephew, who had brought home a frilled lizard from Austria.
Release and reception
The film was released in Japan by NHK as エリマケトカゲ一人旅 (Erimaketokage hitoritabi; lit: "frilled lizard lonely travel"). When it was released in Thailand, it was not expected to garner commercial success due to copyright infringements and the lack of a drafted copyright law.
In February 2022, the film screened at the 11th Madrid International Cutre Film Festival, also known as CutreCon, in Spain. Discussing the film ahead of the festival, CutreCon director Carlos Palencia stated, "I cannot recommend this film enough, because it seems conceived by an extraterrestrial civilization. I didn't understand anything the first time I saw it. [...] it seems like a children's movie, but suddenly there is an alien invasion and there begins to be nudity, scenes of incomprehensible violence and other things I can't reveal because I don't want to ruin the movie. [...] I have not seen anything else like it, because nothing else like it exists."
References
External links
1985 fantasy films
1985 comedy horror films
1980s fantasy adventure films
1980s monster movies
Films directed by Sompote Sands
1985 films
Thai comedy horror films
Films set in Thailand
Films shot in Thailand
Films about lizards
Mars in film
Films about extraterrestrial life |
```javascript
exports.install = require('./api/install')
exports.uninstall = require('./api/uninstall')
exports.is_installed = require('./api/is_installed')
exports.resolve = require('./api/resolve')
exports.list = require('./api/list')
``` |
Trenholm is an English surname of Norse origin. Another common variant is Trenholme.
Origin and variants
Trenholm is a habitational name from the village of "Trenholme" near the market town of Stokesley in the county of North Yorkshire in the North of England. According to the Oxford Dictionary of English place names, it is derived from the pre-7th century Old Norse words "trani" meaning "crane," and "holmr," ("holm") meaning "islet" or "flat lands". It has also been proposed that the name could possibly be derived from Old Norse through the Old English words "trendel" meaning "fort" or "castle," and "holm."
First found in Yorkshire, the first bearers of the surname would have been from the village of Trenholme where they would have adopted the name as a habitational marker to identify themselves as natives of the village. This practice became very common as people started to leave their original homes to move to more distant locations, especially as the use of fixed surnames gradually became a legal necessity after the introduction of personal taxation.
A relatively rare surname, it is historically concentrated in the county in and around the districts of Hambleton, Redcar and Cleveland, Middlesbrough, and Stockton-on-Tees. Outside of England, variants of the surname can most commonly be found in Canada (most common) and the United States.
Until the gradual standardization of English spelling in the last few centuries, English lacked any comprehensive system of spelling. Consequently, spelling variations in names are frequently found in early Anglo-Saxon and later Anglo-Norman documents, meaning that a person's name was often spelled several different ways over a lifetime. As such, different variations of the Trenholm surname usually have the same origin.
Notable people with the surname
George Trenholm (1807-1876), South Carolina businessman, financier, politician, slaveowner and Confederate Secretary of the Treasury.
William L. Trenholm (1836-1901), Confederate Army veteran, United States Comptroller of the Currency (1886-1889), and president of the North American Trust Company (1898).
References
English-language surnames
Surnames of British Isles origin |
A Man of Means is a collection of six short stories written in collaboration by P. G. Wodehouse and C. H. Bovill. The stories first appeared in the United Kingdom in The Strand Magazine in 1914, and in the United States in Pictorial Review in 1916. They were later published in book form in the UK by Porpoise Books in 1991. The collection was released on Project Gutenberg in 2003.
The stories all star Roland Bleke, a young man for whom financial success is always a mixed blessing. The plots follow on from each other, sometimes directly, and occasionally refer back to past events in Bleke's meteoric career.
Contents
"The Episode of the Landlady's Daughter"
UK: Strand, April 1914 (as "A Man of Means No. I: Landlady's Daughter")
US: Pictorial Review, May 1916 (as "A Man of Means: The Episode of the Landlady's Daughter")
Plot
Roland Bleke, an ordinary young man, is a clerk in a seed-merchant’s office in the town of Bury St. Edwards. Roland inadvertently got engaged to his landlady's daughter, Muriel Coppin, and does not want to marry her. He is supposed to marry her when his salary is large enough, so he asks his boss Mr. Fineberg to reduce his salary, which surprises Mr. Fineberg. Roland is disliked by Albert Potter, a strong and silent mechanic who loves Muriel.
Roland tells Muriel's family that his salary was reduced, which disappoints her parents and also her two lazy brothers, who hope to live off Roland's money. Roland learns that he won five hundred pounds in a sweepstake and will receive the cheque shortly. He keeps this secret. However, a week later, a newspaper article announces that Roland won 40,000 pounds. The Coppins all expect Roland to buy them gifts and make it difficult for him to leave.
Muriel insists Roland buy him a car, and with her brothers and Albert, they go to the nearby town of Lexingham to see French pilot Etienne Feriaud perform loops with his aeroplane. Feriaud offers to take a passenger for five pounds, but the spectators are worried it is too dangerous. Albert says that he would do it if he had five pounds, impressing Muriel. Roland offers Albert five pounds, but Albert refuses and tells Roland to do it. Roland agrees and gets into the plane with Feriaud. To the group's surprise, the plane simply flies away.
"The Episode of the Financial Napoleon"
UK: Strand, May 1914 (as "A Man of Means No. II: The Bolt From the Blue")
US: Pictorial Review, June 1916 (as "A Man of Means: The Episode of the Financial Napoleon")
Plot
The aeroplane which flew Roland Bleke to freedom at the end of "The Episode of the Landlady's Daughter" lands in the garden of the Sussex home of one Geoffrey Windlebird, financier of somewhat dubious standing. A perpetual juggler of near-bankrupt companies, Windelbird is on the edge of bankruptcy and scandal as a mining claim he has heavily oversold is about to be exposed. Bleke knows him by reputation, and he, having been shown Bleke's picture in the newspaper by his wife, knows of Bleke's recent windfall.
Bleke, sick after his cold flight, is taken in by the Windlebirds. Worried that his fiancee may object to his disappearance, he arranges with Windelbird to have her paid off, a deal on which Windelbird takes a handsome profit. Windelbird then talks Bleke into investing much of his fortune in his Wild-Cat Reef mining venture, selling him shares he says are owned by a friend.
Next day, Bleke finds Mrs Windlebird in a state of anxiety. The Wild-Cat Reef, she says, has dropped sharply in value, and her husband feels terrible for having persuaded Bleke to throw away his money. She will, she offers, buy back his shares with her small savings, that he may not be left totally penniless. Bleke, touched by her kindness, generously refuses the offer.
The newspapers arrive, and Bleke sees that Wild-Cat has become a huge success, being compared to Klondike. His shares have quadrupled in value overnight; he feels sorry, he says, for Mr Windelbird's friend, who had so recently sold his stock...
"The Episode of the Theatrical Venture"
UK: Strand, June 1914 (as "a Man of Means No. III: The Episode of the Theatrical Venture")
US: Pictorial Review, July 1916 (as "A Man of Means: The Episode of the Theatrical Venture")
Plot
Roland Bleke, a very wealthy man after the events of "The Episode of the Financial Napoleon", finds himself wowed by Miss Billy Verepoint, an attractive and domineering actress. He soon ends up the owner of a notoriously unsuccessful theatre, the Windsor, bought from its unscrupulous former owner, who found his insurance agent's attitude to keeping the place safe from fire a little too strict for his liking.
As her friends start working on a revue to be performed at the theatre and starring Miss Verepoint, Bleke proposes to her, mostly out of fear, and is accepted pending her making a success of her theatrical career. At rehearsals, Bleke is horrified by Miss Verepoint's behaviour and, in dread of having to spend his life married to her, goes away to Norfolk for a quiet week's rest.
Returning to London, he finds the theatre has been burnt to the ground – suffragettes having left their literature around the place. Miss Verepoint and her writer friends demand he rebuild it, but he demurs, explaining that he had not insured the building and was penniless. The theatrical types all leave in disgust, Miss Verepoint calling off the engagement on her way out. Bleke opens his desk and fondly caresses the insurance policies passed on to him by the theatre's previous owner...
"The Episode of the Live Weekly"
UK: Strand, July 1914 (as "a Man of Means No. IV: The Episode of the Live Weekly")
US: Pictorial Review, August 1916 (as "A Man of Means: The Episode of the Live Weekly")
Plot
Roland Bleke, his wealth further increased following the outcome of "The Episode of the Theatrical Venture", sees a pretty young girl crying in the park. Trying to comfort her, he learns she has lost her job as editor of the Woman's Page of Squibs magazine. His chivalry stirred, Bleke tells her he plans to buy the paper.
Visiting the offices, he meets the vibrant young chief editor, and learns the condition of the paper - financially crippled following a competition run by early staff, the prize for which was £5 a week for life. The winner of the prize continues to drain the income of the paper, bringing it to the verge of ruin. Bleke buys it anyway, restoring the girl to her position, but he soon finds his attraction to her drained by her clear affection for her boss.
Frustrated by yet another problematic venture, Bleke repairs to Paris for a month. Returning to London, he finds the place overrun with bizarre advertising stunts for the paper. Confronting the editor, he finds the sales are up, thanks to the campaigns and a new scandal page, which shocks Bleke. The editor explains the stories are all fake, except for one, about a notorious bookie named Percy Pook, who he assures Bleke will never sue.
Next day Bleke finds the editor has been hospitalised following a severe beating, presumably at the hands of the bookie's representatives - he has told the girl to continue his work and to "slip it to" Pook some more. While she prepares the rest of the paper, Bleke volunteers to write the scandal page, to prevent any further insult being meted out. He finds writing difficult, but on seeing a piece about Mr Windelbird, who he had encountered in "The Episode of the Financial Napoleon" and who he assumes is above suspicion, he is inspired to write a provocative piece on the financier's morals.
A week later he is approached with an offer to buy the paper. Happy to be rid of it, he nevertheless names a high price, which he is surprised to find accepted without quibble. He learns that the buyer is none other than his old friend, Mr Geoffrey Windelbird.
"The Episode of the Exiled Monarch"
UK: Strand, August 1914 (as "A Man of Means No. V: The Episode of the Exiled Monarch")
US: Pictorial Review, September 1916 (as "A Man of Means: The Diverting Episode of the Exiled Monarch")
Plot
A new dance craze, the caoutchouc, has hit town, and Roland Bleke quickly falls for the potent charms of its principal proponent, Maraquita. Finally meeting her, however, he soon realises that he has bitten off more than he can chew. She drags him to her house, which he finds filled with the former aristocracy of Paranoya, a small country reeling from a recent revolution. Bleke discovers that he is expected to fund the liberation of the country from it oppressors.
Plans for a bloody counter-revolution commence, and Bleke finds himself threatened by advocates of the new regime. Maraquita suggests they scupper the enemy by writing a will leaving all Bleke's money to her cause. Bleke finds himself beset with mysterious messages bearing only the word "Beware". Soon, he is brought before the exiled King himself, who reveals that he has no desire to be restored to power and is much happier in exile in England.
Baffled at how to talk his new friends out of their plans, he avoids them for a few days; when he finally visits once more, he finds the mood very different. Bombito, Maraquita's largest and most threatening co-conspirator, takes him aside and reveals all. There has been a political change in Paranoya, and Bombito himself has been made president, negating the need for a revolution. Maraquita, Bombito's wife, will be returning home with him forthwith. A relieved Bleke shakes the man's hand.
"The Episode of the Hired Past"
UK: Strand, September 1914 (as "A Man of Means No. VI: The Episode of the Hired Past")
US: Pictorial Review, October 1916 (as "A Man of Means: The Episode of the Hired Past")
Plot
Roland Bleke is once again engaged to be married, this time to Lady Eva Blyton, daughter of an Earl. Feeling utterly out of place in such exalted company, he cannot think of a way to break off the engagement honourably, until Teal, her father's butler, overhearing Bleke's despair, offers a suggestion.
Bleke pays £100 for the butler's niece Maud, a plebeian barmaid, to pose as a jilted former lover; he writes some compromising letters to the girl, and she appears at the house, creating a scene and satisfactorily, though painfully, bringing an end to Bleke's engagement.
Later, Bleke is in a happy reverie as he opens his post; one of the letters is from a solicitor, saying that Maud has several letters in her possession, as well as witnesses in the shape of Miss Blyton's family, proving that he had promised to marry her. To avoid the scandal of a breach-of-promise case, she will accept £10,000.
Publication history
In The Strand Magazine (UK), the stories were attributed to "C. H. Bovill and P. G. Wodehouse", and were illustrated by Alfred Leete. In Pictorial Review (US), the stories were attributed to "Pelham Grenville Wodehouse and C. H. Bovill", and were illustrated by John R. Neill.
See also
List of short stories by P. G. Wodehouse
References
Notes
Sources
External links
An alphabetical list of Wodehouse's shorts, with details of first publication and appearances in collections
Short story collections by P. G. Wodehouse
1991 short story collections
Works originally published in The Strand Magazine |
Oakdale Golf & Country Club, founded in 1926, is a private, parkland-style golf and tennis club located in North York, Toronto, Ontario, Canada. It hosted the 2023 Canadian Open and will host the tournament again in 2026.
History
The club was founded in 1926 and is located about 15 miles north of Toronto's downtown. The course was built on what was farmland decades before the metropolis of Toronto spread and absorbed the property within its limits. Traces of a village have been found on the club grounds, adjacent to the Toronto Carrying-Place Trail. Since its founding, the club has asked its members to give back to the community in one way or another.
In 1926 The Toronto Star ran a story with the headline: "Hebrews buy farm; build golf course." The club is known as predominantly Jewish, as members of the Toronto Jewish community bought the land and established the club in response to antisemitism in Canada in the 1920s and 1930s that strictly excluded Jews from private golf clubs, including the Rosedale Golf Club. Mark Sadowski, former president of the club, said: It was out of necessity that this club came into being. A hundred years ago the world was a very different place, and there were clubs who would not allow Jewish people to join or even play. And it was the same in the medical community and other aspects of business. There were very clear 'no blacks, no Jews, and no Asians' rules. However, religion has never been a requirement or barrier to membership, and anyone can join the club, which includes many non-Jews.
It was selected as a new site for the 2023 Canadian Open tournament – the world’s third-oldest national championship – after Golf Canada realized that only a handful of Canadian Opens had been conducted within Toronto itself in the previous several decades. Nick Taylor won the 2023 tournament, becoming the first Canadian citizen to win the Canadian Open since 1954 and the first Canadian-born player to win the event since 1914. The 2026 Canadian Open will be played on the course as well.
Course
The golf course has 27 holes, 18 designed by Canadian architect Stanley Thompson in the 1920s and 1930s. A third nine was designed by Canadian Golf Hall of Famer Robbie Robinson, a disciple of Thompson, in 1957. Black Creek runs through the course. Each of the three nines are named for famous figures in Canadian golf: Thompson himself, George Knudson (eight-time PGA Tour winner), and Wilf Homenuik (the club's longtime teaching pro). Knudson won 8 tournaments on the PGA tour, and Homenuik won several tournaments as an amateur and Canadian PGA events. Both men were also club professionals at Oakdale.
The June 2023 Canadian Open was played on a 7,460-yard composite routing that used some holes from each of the Homenuik and Thompson nines and all of the Knudson holes as the back nine. It was the first time the course was an RBC Canadian Open host venue. It was the 37th course in the tournament's 117-year history.
Facilities
The club's tennis facilities feature six outdoor courts, with pro shop and offers lessons and competitions.
PGA Tour events
2023 Canadian Open – won by Nick Taylor
See also
Jewish country club
References
External links
Oakdale Golf and Country Club
Instagram page
Canadian Open (golf)
Clubs and societies based in Toronto
Golf clubs and courses in Ontario
Jews and Judaism in Toronto
North York
Sport in Toronto
Sports venues completed in 1926
Sports venues in Toronto
1926 establishments in Ontario |
Stelios Panagiotou (; born 26 October 2001) is a Greek professional footballer who plays as a center-forward for Super League 2 club Apollon Larissa.
References
2001 births
Living people
Greek men's footballers
Apollon Larissa F.C. players
Men's association football forwards
Footballers from Larissa |
Bdallophytum is a genus of parasitic flowering plants with five described species. It parasitizes on the roots of plants of the genus Bursera, such as Bursera simaruba. The genus is endemic to the Neotropics.
It was previously placed in Rafflesiaceae, but is now placed in family Cytinaceae, together with the only other genus Cytinus. Some Bdallophytum species were at one time considered to belong to this latter genus.
Bdallophytum is dioecious.
Name
The genus name is probably derived from Ancient Greek bdell- "leech" and phyton "plant". It was later misspelled as Bdallophyton by Eichler, and this synonym is now also in common use.
Species
Bdallophytum americanum
Bdallophytum andrieuxii
Bdallophytum bambusarum
Bdallophytum ceratantherum
Bdallophytum oxylepis
Footnotes
References
(2004): Phylogenetic inference in Rafflesiales: the influence of rate heterogeneity and horizontal gene transfer. BMC Evolutionary Biology 4: 40.
Further reading
(2006): The holoparasitic endophyte Bdallophyton americanum affects root water conductivity of the tree Bursera simaruba. Trees - Structure and Function 21(2): 215–220.
External links
Cytinaceae References
Parasitic Plant Connection: Cytinaceae
Malvales genera
Cytinaceae
Parasitic plants
Dioecious plants
Taxa named by August W. Eichler |
Tūheitia Potatau Te Wherowhero VII (born Tūheitia Paki, 21 April 1955), crowned as Kīngi Tūheitia, is the Māori King. He is the eldest son of the previous Māori monarch, Te Arikinui Dame Te Atairangikaahu, and was announced as her successor and crowned on 21 August 2006, the day her tangihanga (funeral rites) took place.
Family
King Tūheitia (born Tūheitia Paki) is the son of Whatumoana Paki (1926–2011) and Te Arikinui Dame Te Atairangikaahu (1931–2006), who married in 1952. He was educated at Rakaumanga School in Huntly, Southwell School in Hamilton and St. Stephen's College (Te Kura o Tipene) in Bombay, south of Auckland. He has five sisters and one brother: Heeni Katipa ( Paki); Tomairangi Paki; Mihi ki te ao Paki; Kiki Solomon ( Paki); Manawa Clarkson ( Paki), and brother Maharaia Paki.
He is married to Makau Ariki Te Atawhai and they have three children: Whatumoana, Korotangi, and Ngawai Hono I Te Po. Following his ascent to the throne, the Makau Ariki was appointed patron of the Māori Women's Welfare League in 2007 and Te Kohao Health, a Māori public health organisation.
Duties and background
The King generally speaks publicly only once a year, at the annual celebrations in Ngāruawāhia of his coronation.
Since ascending to the throne his official duties have included attending the following events:
funeral of King Taufa'ahau Tupou IV of Tonga, September 2006
opening of Pūkawa Marae on the shore of Lake Taupō, 17–19 November 2006
opening of "Mauri Ora", an exhibition of Māori artefacts from Te Papa on exhibition at the Tokyo National Museum in Japan on 22 January 2007
funeral of Malietoa Tanumafili II of Samoa, 19 May 2007
re-opening of the marae/war memorial hall in Ngaiotonga, Whangaruru, 2007
opening of the Māori garden in Hamilton Gardens, 2008
unveiling of Te Kawerau a Maki's new pou for the Arataki Visitor Centre in the Waitākere Ranges in 2011
haka and speech for the fleet of 110 waka to commemorate 160 years of Kiingitanga in 2018
private audience with Pope Francis at the Vatican in May 2019
coronation of Charles III and Camilla in London, May 2023
In May 2019, King Tūheitia and members of the Whare Ariki travelled to Italy where the King met Pope Francis in a private audience at the Vatican. The two met and discussed issues pertaining to Te Iwi Maori and indigenous peoples around the world. King Tūheitia also issued a formal invitation for the Pope to visit Turangawaewae Marae and Aotearoa.
In 2018, to honour King Tūheitia and his leadership of the Kiingitanga, the General Synod of the Anglican Church in Aotearoa, New Zealand and Polynesia, journeyed to Turangawaewae Marae to join with the multitudes in honouring the 160 years of this Monarchy.
Tūheitia attends hundreds of events every year both nationally and internationally. He is the patron to several key organisations; including Te Matatini, the largest Māori Cultural Festival in the world, Kirikiriroa Marae a large urban Marae in Hamilton.
He frequently receives international dignitaries, foreign diplomats, members of other royal families, and members of governments. In 2014 the King notably received 26 diplomats to discuss international and trade interests for the Kiingitanga.
In 2009 King Tūheitia visited the New Zealand Parliament and was acknowledged in the valedictory speech of the former Prime Minister of New Zealand, Helen Clark. In the same year, the King accompanied Helen Clark to the United Nations upon her appointment as the United Nations Development Programme administrator.
The King regularly attends significant events of Māoridom up and down the country. In July 2018, the King and Royal family attended the 150th Celebrations of the Ringatu Church; to which the King's eldest grandson, Hikairo, has been baptised. The King also frequently attends the annual 25 January celebrations of the Ratana Church expressing his continued support for all denominations and his deep desire to unify the people.
Poukai
The Poukai is an annual series of visits by the Māori King to Marae around and beyond the Tainui region, a tradition that dates back to the 19th century. Poukai were established by the second Māori King, Tāwhiao, who said "Kua whakatūria e ahau tēnei kaupapa hei whāngai i te pouaru, te pani me te rawakore, he kuaha whānui kua puare ki te puna tangata me te puna kai" (I have instituted this gathering to feed the widowed, the bereaved and the destitute, it is a doorway that has been opened to the multitudes of people and the bounty of food).
There are 29 Poukai every year and King Tūheitia attends each one. Poukai are a critical event in the Kiingitanga calendar. A unique element of Poukai is their focus on: te pani (the bereaved), te pouaru (the widowed) and te rawakore (the destitute). These events, led by the current monarch, are put in place to assist and help ease the burdens and challenges faced by people.
Political advancements
King Tūheitia has been at the forefront of many political issues, particularly pertaining to Māori. In 2018 the King launched, in collaboration with the New Zealand Police and Ministry of Justice, the Iwi Justice Panel. This approach to restorative justice aims to reduce incarceration rates among Māori, which are among the highest for an indigenous people in the world.
In 2017, King Tūheitia led a groundbreaking moment for the Kiingitanga by signing a formal Accord with the Ministry of Corrections, on behalf of the Government of New Zealand. This award-winning Accord led to the development of the Iwi Justice Panels, and also a further partnership venture with Corrections to build a reintegration Center for incarcerated women who gave birth to a child while in prison. In an exclusive visit to a women's prison in Auckland, the King visited mothers and their children and pledged to do more for all incarcerated people.
In 2014 the King received a group from White Ribbon NZ who were travelling New Zealand promoting an anti-violence campaign.
Tekau-ma-Rua and Te Kahui Wairua
In 2012 King Tūheitia formally established his Tekau-mā-Rua (the twelve, an advisory council); each monarch has had a Tekau-mā-Rua to offer advice and act as a senior council within the Kiingitanga. He also added a spiritual council, called Te Kāhui Wairua. These two councils work together in providing advice, guidance and a strategic platform for the King and the Kiingitanga. For the first time for the Kiingitanga, King Tūheitia's Tekau-mā-Rua is made up of members from outside of the Waikato tribal region (the King's direct tribe).
Tekau-mā-Rua
:
Te Kāhui Wairua
:
*Archdeacon Simmonds is the Chaplain to the Kiingitanga and Private Chaplain to the King.
Honours
In 2009, King Tuheitia was appointed a Knight of the Venerable Order of Saint John by Queen Elizabeth II, and he was presented with the insignia for the honour by the governor-general, Sir Jerry Mateparae in 2016 during the 10th anniversary commemorations of the King's coronation.
He was appointed to Grand Cross of the Order of the Crown of Tonga during the coronation ceremonies of King George Tupou V of Tonga.
In 2010 he was appointed Knight Commander of the Order of Saint Lazarus.
In 2016, in celebration of the King's 10th Coronation Anniversary, the mayor of Hamilton awarded him the city's highest honour, the Freedom of the City. In the same year, the King also received an honorary doctorate from the University of Waikato.
In 2022, the Secretary-General of Slovak NGO Servare et Manere awarded him the Tree of Peace Memorial Plaque, the highest award of the association for his merits to friendship and understanding between nations and interfaith dialogue.
References
External links
New Zealand Maori choose new king
New Zealand Herald: New Maori monarch takes throne
Pictures: Māori Monarchs since 1858
1955 births
Living people
Māori monarchs
People from Huntly, New Zealand
Knights Grand Cross of the Order of the Crown of Tonga |
The redmouth grouper (Aethaloperca rogaa), also known as the red-flushed rock cod is a species of ray-finned fish, a grouper from the subfamily Epinephelinae which is part of the family Serranidae, which also includes the anthias and sea basses. It has a wide distribution in the Indian and Pacific Oceans. It is considered a game fish.
Description
The redmouth grouper is laterally compress and oval shaped with a relatively deep body which is around half of the standard length and a large head. The dorsal profile of the head is straight or slightly concave while the anterior dorsal profile between the eye and the origin of the dorsal fin is convex. It jaw extends past its eye. The dorsal fin has 9 spines and 17-18 soft rays while the anal fin has 3 spines and 8-9 soft rays. The middle soft rays of the dorsal and anal fins are elongated in the adults which results in them having an angular profile. They have a caudal fin which is truncate and asymmetrical pectoral fins which are asymmetrical. The pelvic fins extend beyond the anus. The colour is dark brown to black, sometimes tinged with orange and a pale vertical bar on the lower flank. The rear part of the spiny portion of the dorsal fin varies in colour from dark orange to brownish red. The oral cavity, gill cavity, and upper jaw membranes are reddish to orange, thus the common name. The juveniles have a wide white rear margin to the caudal fin and a thin white margin along the soft-rayed portion of the dorsal fin. The maximum total length is .
Distribution
The redmouth grouper has an Indo-West Pacific distribution which extends from the Red Sea and Persian Gulf south along the East African court to South Africa, east to the Phoenix Islands in Kiribati, and north to southern Honshu, Japan. In Australia it has been recorded from Rowley Shoals and the Kimberley region in Western Australia, Ashmore Reef, the Timor Sea, and the northern Great Barrier Reef as far south as Wheeler Reef in Queensland. This species is likely found around all the tropical islands of the Indian Ocean, although it has not been reported from Mauritius yet. It has been recorded from Europa Island in the Mozambique Channel.
Biology and habitat
The redmouth grouper is a tropical fish which occurs in coastal reefs and lagoons, it has been recorded over silt substrates as well as in and around caves and crevices in reefs. It has a depth range of . The small juveniles mimic angelfish of the genus Centropyge. This is a predatory species which mainly feeds on small fishes, including Pempheris spp., but also on stomatopods and crustaceans. The redmouth grouper spawns throughout the year and attains sexual maturity at around in standard length, although they have not been reported to form spawning aggregations.
Uses
The redmouth grouper is probably caught by line and spear fisheries throughout its range, although it is not a target species and is normally considered to be of low value. It has been recorded being taken by line fisheries in the Solomon Islands, Micronesia, the Maldives, India and Australia. It is rarely sold in markets, although it has been stated that it is an important component of the fresh-chilled grouper fishery in the Maldives.
Taxonomy
The redmouth grouper was first formally described by the Swedish naturalist Peter Forsskål (1732-1763) as Perca rogaa with the type locality given as Jeddah. The description was published by Carsten Niebuhr in 1775 from filed notes edited by Johann Christian Fabricius and so the name is sometimes written as Perca rogaa Fabricius (ex Forsskål) in Niebuhr 1775. Some authorities place the redmouth grouper as the only species in the monospecific genus Aethaloperca which was created in 1904 by the American ichthyologist Henry Weed Fowler as a subgenus of Bodianus. Recent molecular analyses challenge the placement of this species in the genus Aethaloperca. In a study based on five different genes, it was included in the Cephalopholis clade, thus suggesting that the species should be included in the genus Cephalopholis and referred to as Cephalopholis rogaa.
References
External links
Epinephelini
Fish described in 1775
Fish of Thailand |
```xml
import { colors, dimensions } from "@erxes/ui/src/styles";
import { IUser } from "@erxes/ui/src/auth/types";
import React from "react";
import Tip from "@erxes/ui/src/components/Tip";
import { getUserAvatar } from "@erxes/ui/src/utils";
import styled from "styled-components";
const imageSize = 30;
const Members = styled.div`
padding-top: ${dimensions.unitSpacing - 5}px;
display: flex;
> div {
margin-left: -8px;
&:first-child {
margin-left: 0;
}
}
`;
const MemberImg = styled.img`
width: ${imageSize}px;
height: ${imageSize}px;
border-radius: ${imageSize / 2}px;
background: ${colors.bgActive};
border: 2px solid ${colors.colorWhite};
object-fit: cover;
margin-left: -8px;
&:first-child {
margin-left: 0;
}
`;
const More = styled(MemberImg)`
color: ${colors.colorWhite};
text-align: center;
vertical-align: middle;
font-size: ${dimensions.unitSpacing}px;
background: ${colors.colorCoreLightGray};
display: inline-block;
line-height: ${dimensions.coreSpacing + 6}px;
cursor: pointer;
`;
type Props = {
selectedMemberIds: string[];
allMembers: IUser[];
};
export default function MemberAvatars(props: Props) {
const renderMember = (member) => {
return (
<Tip key={member._id} text={member?.details?.fullName || ''} placement="top">
<MemberImg key={member._id} src={getUserAvatar(member)} />
</Tip>
);
};
const renderMembers = () => {
const { selectedMemberIds, allMembers } = props;
let selectedMembers: IUser[] = [];
selectedMembers = allMembers.filter(
(user) => user.isActive && selectedMemberIds.includes(user._id)
);
const length = selectedMembers.length;
const limit = 8;
// render members ================
const limitedMembers = selectedMembers.slice(0, limit);
const renderedMembers = limitedMembers.map((member) =>
renderMember(member)
);
// render readmore ===============
let readMore: React.ReactNode;
if (length - limit > 0) {
readMore = <More as="span" key="readmore">{`+${length - limit}`}</More>;
}
return [renderedMembers, readMore];
};
if (props.allMembers.length === 0 || props.selectedMemberIds.length === 0) {
return null;
}
return <Members>{renderMembers()}</Members>;
}
``` |
```c
/*
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are
* permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of
* conditions and the following disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to
* endorse or promote products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdlib.h>
int main() {
int arraySize = 5;
int i, j, k;
int **theArray1;
theArray1 = (int **) malloc(arraySize * sizeof(int *));
for (i = 0; i < arraySize; i++)
theArray1[i] = (int *) malloc(arraySize * sizeof(int));
int **theArray2;
theArray2 = (int **) malloc(arraySize * sizeof(int *));
for (i = 0; i < arraySize; i++)
theArray2[i] = (int *) malloc(arraySize * sizeof(int));
int **theArray3;
theArray3 = (int **) malloc(arraySize * sizeof(int *));
for (i = 0; i < arraySize; i++)
theArray3[i] = (int *) malloc(arraySize * sizeof(int));
for (i = 0; i < arraySize; i++) {
for (j = 0; j < arraySize; j++) {
theArray1[i][j] = (i + 1 + j * 2);
theArray2[i][j] = (j + 1 + i * 2);
theArray3[i][j] = 0;
}
}
theArray1[3][4] = 666;
theArray2[2][1] = 667;
for (i = 0; i < arraySize; i++) {
for (j = 0; j < arraySize; j++) {
for (k = 0; k < arraySize; k++) {
theArray3[i][j] += theArray1[i][k] * theArray2[k][j];
}
}
}
int sum = 0;
for (i = 0; i < arraySize; i++) {
for (j = 0; j < arraySize; j++) {
sum += theArray3[i][j];
}
}
return sum % 100;
}
``` |
Cécile Hugonnard-Roche is a French pianist and piano assistant teacher at the Conservatoire de Paris and has taught at the École normale de musique de Paris.
As of 2016, Hugonnard-Roche teaches the piano at the Saint-Maur-des-Fossés conservatory.
Biography
Hugonnard-Roche studied music at the Conservatoire de Paris where she was taught by Vlado Perlemuter, Jean Hubeau and Dominique Merlet. There she won four First Prizes: piano, chamber music, harmony and accompaniment.
Thanks to a postgraduate scholarship, she spent two years perfecting her skills with foreign masters, thus broadening and deepening her repertoire.
Second prize (first nominated) at the Geneva International Music Competition in 1976, she also won the Schumann Prize and the Alex de Vries Foundation Prize (Antwerp).
Since then, she has been invited to play regularly in numerous festivals and has performed as soloist and chamber music throughout Europe, Brazil, Southeast Asia and Japan.
For the label "Quantum" she has recorded a CD dedicated to Robert Schumann, a second to Prokofiev and a third of French two-piano music with André Cauvin.
For "Bayard Musique", she records in the series Les Grands Chefs-d'œuvre, Schumann's Fantasy pieces and Mozart's Piano Sonata No. 11.
References
External links
Cécile Hugonnard-Roche on Bayard Musique
Cécile Hugonnard-Roche's discography on Discogs
Cécile Hugonnard-Roche
Cécile Hugonnard-Roche - Fantasy Pieces, Op. 12: I. Des Abends (YouTube)
21st-century French women classical pianists
20th-century French women classical pianists
Conservatoire de Paris alumni
Academic staff of the Conservatoire de Paris
Academic staff of the École Normale de Musique de Paris
Living people
Year of birth missing (living people)
Date of birth missing (living people)
French music educators
French women music educators |
Manohar Lal Kampani was the first lieutenant governor of Andaman and Nicobar Islands. He served from 12 November 1982 to 3 December 1985.
Early life
He was born in town named Gujarat of pre-partition Punjab to Nathuram Kampani and Vidyawanti Kampani.
Career
He started his career as Commissioned Army officer where he was mentioned in despatches and also attended the Defence Services Staff College, Wellington. Later he joined the Administrative services.
As an officer of Administrative service he served as Deputy Commissioner in Kohima and Imphal, Development Commissioner of Sikkim, Chief Commissioner of Manipur and Chief Secretary of Arunachal Pradesh in a distinguished career.
In the Central assignments , he served as Joint Secretary and then as Additional Secretary in Home Ministry of India. He was the home Ministry expert in affairs of the North-East India. He played significant role in various Accords and talks in North-East including Nagaland, Mizoram and Assam during his tenure.
Shillong Accord 1975
As Joint Secretary in Home Ministry he was instrumental in drafting the Shillong Accord of 1975 with Nagaland Peace Council and Nagaland underground.
The Indian government was represented by Lallan Prasad Singh, Governor of Nagaland. The governor was assisted by M L Kampani , who as Joint Secretary in the Ministry of Home Affairs (MHA), was the Home ministry's point man for North -East and by two advisors for Nagaland— M. Ramunny and H. Zopianga. This historic agreement was signed at Shillong, Meghalaya, on 11 November 1975.
Mizo Accord 1976
He played a key role in signing of Mizo Accord in February 1976. The Mizo leader Mr Laldenga and his team of Mizo National Front (MNF)held discussions with Home Secretary Mr Sundar Lal Khurana, Lt Governor of Mizoram Mr S K Chibber and Mr M L Kampani, Joint Secretary in Ministry of Home representing Government of India in February 1976. The main terms of the Accord were signed on 18 Feb 1976.
Lieutenant governor
In 1982 he became the first Lieutenant Governor succeeding S. L. Sharma who was last Chief Commissioner of Andaman and Nicobar Islands.
He was instrumental in many early developmental projects in Andaman and Nicobar Islands including Andaman Trunk Road.
Other
He was part of the Home Ministry team which was with the then Prime Minister Morarji Desai when the aircraft was involved in a mishap at Jorhat on 4 November 1977.
Later life
He was active with Charitable trusts and corporate entities in later life. A keen sportsman he played tennis well into his 80s.
He shared his experience with many writers and journalists on his time in North-East India.
He died on 22 April 2021, in New Delhi, at age of 96.
See also
Shillong Accord of 1975
List of lieutenant governors of the Andaman and Nicobar Islands
References
https://www.rakshaknews.in/en/special-en/eye-opening-experience-for-police-chief-at-bompuka-island-of-nicobar/
https://www.andamanchronicle.net/index.php?option=com_content&view=article&id=4721:first-lt-governor-of-ani-ml-kampani-visits-islands&catid=37&Itemid=142
https://publishing.cdlib.org/ucpressebooks/view?docId=ft8r29p2r8;chunk.id=d0e36;doc.view=print
https://peacemaker.un.org/sites/peacemaker.un.org/files/IN_751111_Shillong%20Agreement_0.pdf
http://cdpsindia.org/shillong-accord/
https://imphalwest.nic.in/history-of-deputy-commissioner/
https://www.andamansheekha.com/93334/
http://www.andamansheekha.com/24153/
https://kohima.nagaland.gov.in/DC%20KOHIMA.htm
https://indianarmy.nic.in/Site/FormTemplete/frmTempSimple.aspx?MnId=L/B7tyYtYP3nOgi9xpNBhA==&ParentID=QnkbcH1Im60j1dfj/8aU/A==
https://rcportblair.rotaryindia.org/AboutUs.aspx
https://easternmirrornagaland.com/solution-without-integration/
https://www.arunachalpradesh.gov.in/chief-secretary
https://nagalandpage.com/who-convened-naga-people-convention/
Encyclopaedia of North-East India: Mizoram by Hamlet Bareh
Mizoram The Dagger Brigade by Nirmal Nibedon
Sikkim Herald – Volume 13
Lok Sabha Debates – Page 175 India. Parliament. Lok Sabha · 1979
Challenge to India's Unity: Assam Students' Agitation and ... – Page 139books.google.co.uk › books D.P Kumar
1925 births
2021 deaths
Indian Administrative Service officers
Lieutenant governors of the Andaman and Nicobar Islands
People from New Delhi
Punjabi people
Indian Army officers
Defence Services Staff College alumni |
The Guernsey women's cricket team is the team that represents Guernsey, a Crown dependency in international women's cricket matches. Guernsey became an affiliate member in 2005 and an associate member of the International Cricket Council (ICC) in 2008.
In April 2018, the ICC granted full Women's Twenty20 International (WT20I) status to all its members. Therefore, all Twenty20 matches played between Guernsey women and another international side after 1 July 2018 are eligible for full WT20I status.
Women's Cricket Programme
Guernsey is developing a Cricket Programme for Women's and Girl Cricket. The details of this could be found here. Purple's Ladies and Green's Ladies are two different clubs present in Women's Club Cricket. Team details can be found here.
Records and statistics
International Match Summary — Guernsey Women
Last updated 28 August 2023
Twenty20 International
T20I record versus other nations
Records complete to WT20I #1559. Last updated 28 August 2023.
See also
List of Guernsey women Twenty20 International cricketers
References
External links
Guernsey Cricket Board
FemaleCricket-Guernsey
ICC Cricket Guernsey
Cricket in Guernsey
Women's national cricket teams
Sports clubs and teams in Guernsey
Women's sport in Guernsey
W
C |
Uvarovka () is a rural locality (a khutor) in Kalinovskoye Rural Settlement, Kikvidzensky District, Volgograd Oblast, Russia. The population was 6 in 2010.
Geography
Uvarovka is located in steppe, on Khopyorsko-Buzulukskaya plain, on the right bank of the Machekha River, 35 km northeast of Preobrazhenskaya (the district's administrative centre) by road. Yezhovka is the nearest rural locality.
References
Rural localities in Kikvidzensky District |
Brampton is a village and former civil parish, now in the parish of Brampton with Stoven, in the East Suffolk district, in the county of Suffolk, England. It is around north-east of Halesworth, south of Beccles and north-west of Southwold. In 1961 the parish had a population of 306. On 1 April 1987 the parish was merged with Stoven to form "Brampton with Stoven" parish and the mid-2005 population estimate for the expanded parish was 460.
Stoven is immediately to the east of Brampton, Uggeshall to the south-east and Shadingfield to the north. The village is served by Brampton railway station, a request stop around west of the village, on the Ipswich–Lowestoft East Suffolk Line. The A145 road divides the village and passes the village church which is Grade I listed and dedicated to St Peter. Areas of housing, including at Brampton Street, are clustered on either side of the road throughout the parish area. Brampton Primary School serves the village and the surrounding area.
Brampton Hall is a listed country house built in 1794 of red brick for Rev Naunton Thomas Orgill Leman and the Leman family who had long associations in the area. The previous Brampton Hall burned down in 1733. A 16th century farmhouse was built on the same site, known as Brampton Old Hall. Both buildings are Grade II listed.
Notable residents
Humphrey Primatt (1734 – c1776), clergyman and animal rights writer.
Robert Leman (1799–1869), painter of landscapes and a member of the Norwich School of painters.
Edward Robinson (1839 – 1913), Member of the Western Australian Legislative Council for North Province from 1894 to 1896.
Thomas Curteis (1843 – 1914), first-class cricketer and clergyman.
References
External links
Villages in Suffolk
Former civil parishes in Suffolk
Waveney District |
Frank Mayfield, Jr. (born 1939) is a former member of the Ohio House of Representatives.
References
Members of the Ohio House of Representatives
1939 births
Living people
Place of birth missing (living people)
Date of birth missing (living people) |
```objective-c
/* Definitions of target machine for GNU compiler, for ARM.
2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
Contributed by Pieter `Tiggr' Schoenmakers (rcpieter@win.tue.nl)
and Martin Simmons (@harleqn.co.uk).
More major hacks by Richard Earnshaw (rearnsha@arm.com)
Minor hacks by Nick Clifton (nickc@cygnus.com)
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it
by the Free Software Foundation; either version 2, or (at your
option) any later version.
GCC is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
along with GCC; see the file COPYING. If not, write to
the Free Software Foundation, 51 Franklin Street, Fifth Floor, Boston,
MA 02110-1301, USA. */
#ifndef GCC_ARM_H
#define GCC_ARM_H
/* The architecture define. */
extern char arm_arch_name[];
/* Target CPU builtins. */
#define TARGET_CPU_CPP_BUILTINS() \
do \
{ \
/* Define __arm__ even when in thumb mode, for \
consistency with armcc. */ \
builtin_define ("__arm__"); \
builtin_define ("__APCS_32__"); \
if (TARGET_THUMB) \
builtin_define ("__thumb__"); \
\
if (TARGET_BIG_END) \
{ \
builtin_define ("__ARMEB__"); \
if (TARGET_THUMB) \
builtin_define ("__THUMBEB__"); \
if (TARGET_LITTLE_WORDS) \
builtin_define ("__ARMWEL__"); \
} \
else \
{ \
builtin_define ("__ARMEL__"); \
if (TARGET_THUMB) \
builtin_define ("__THUMBEL__"); \
} \
\
if (TARGET_SOFT_FLOAT) \
builtin_define ("__SOFTFP__"); \
\
if (TARGET_VFP) \
builtin_define ("__VFP_FP__"); \
\
/* Add a define for interworking. \
Needed when building libgcc.a. */ \
if (arm_cpp_interwork) \
builtin_define ("__THUMB_INTERWORK__"); \
\
builtin_assert ("cpu=arm"); \
builtin_assert ("machine=arm"); \
\
builtin_define (arm_arch_name); \
if (arm_arch_cirrus) \
builtin_define ("__MAVERICK__"); \
if (arm_arch_xscale) \
builtin_define ("__XSCALE__"); \
if (arm_arch_iwmmxt) \
builtin_define ("__IWMMXT__"); \
if (TARGET_AAPCS_BASED) \
builtin_define ("__ARM_EABI__"); \
} while (0)
/* The various ARM cores. */
enum processor_type
{
#define ARM_CORE(NAME, IDENT, ARCH, FLAGS, COSTS) \
IDENT,
#include "arm-cores.def"
#undef ARM_CORE
/* Used to indicate that no processor has been specified. */
arm_none
};
enum target_cpus
{
#define ARM_CORE(NAME, IDENT, ARCH, FLAGS, COSTS) \
TARGET_CPU_##IDENT,
#include "arm-cores.def"
#undef ARM_CORE
TARGET_CPU_generic
};
/* The processor for which instructions should be scheduled. */
extern enum processor_type arm_tune;
typedef enum arm_cond_code
{
ARM_EQ = 0, ARM_NE, ARM_CS, ARM_CC, ARM_MI, ARM_PL, ARM_VS, ARM_VC,
ARM_HI, ARM_LS, ARM_GE, ARM_LT, ARM_GT, ARM_LE, ARM_AL, ARM_NV
}
arm_cc;
extern arm_cc arm_current_cc;
#define ARM_INVERSE_CONDITION_CODE(X) ((arm_cc) (((int)X) ^ 1))
extern int arm_target_label;
extern int arm_ccfsm_state;
extern GTY(()) rtx arm_target_insn;
/* Define the information needed to generate branch insns. This is
stored from the compare operation. */
extern GTY(()) rtx arm_compare_op0;
extern GTY(()) rtx arm_compare_op1;
/* The label of the current constant pool. */
extern rtx pool_vector_label;
/* Set to 1 when a return insn is output, this means that the epilogue
is not needed. */
extern int return_used_this_function;
/* Used to produce AOF syntax assembler. */
extern GTY(()) rtx aof_pic_label;
/* Just in case configure has failed to define anything. */
#ifndef TARGET_CPU_DEFAULT
#define TARGET_CPU_DEFAULT TARGET_CPU_generic
#endif
#undef CPP_SPEC
#define CPP_SPEC "%(subtarget_cpp_spec) \
%{msoft-float:%{mhard-float: \
%e-msoft-float and -mhard_float may not be used together}} \
%{mbig-endian:%{mlittle-endian: \
%e-mbig-endian and -mlittle-endian may not be used together}}"
#ifndef CC1_SPEC
#define CC1_SPEC ""
#endif
/* This macro defines names of additional specifications to put in the specs
that can be used in various specifications like CC1_SPEC. Its definition
is an initializer with a subgrouping for each command option.
Each subgrouping contains a string constant, that defines the
specification name, and a string constant that used by the GCC driver
program.
Do not define this macro if it does not need to do anything. */
#define EXTRA_SPECS \
{ "subtarget_cpp_spec", SUBTARGET_CPP_SPEC }, \
SUBTARGET_EXTRA_SPECS
#ifndef SUBTARGET_EXTRA_SPECS
#define SUBTARGET_EXTRA_SPECS
#endif
#ifndef SUBTARGET_CPP_SPEC
#define SUBTARGET_CPP_SPEC ""
#endif
/* Run-time Target Specification. */
#ifndef TARGET_VERSION
#define TARGET_VERSION fputs (" (ARM/generic)", stderr);
#endif
#define TARGET_SOFT_FLOAT (arm_float_abi == ARM_FLOAT_ABI_SOFT)
/* Use hardware floating point instructions. */
#define TARGET_HARD_FLOAT (arm_float_abi != ARM_FLOAT_ABI_SOFT)
/* Use hardware floating point calling convention. */
#define TARGET_HARD_FLOAT_ABI (arm_float_abi == ARM_FLOAT_ABI_HARD)
#define TARGET_FPA (arm_fp_model == ARM_FP_MODEL_FPA)
#define TARGET_MAVERICK (arm_fp_model == ARM_FP_MODEL_MAVERICK)
#define TARGET_VFP (arm_fp_model == ARM_FP_MODEL_VFP)
#define TARGET_IWMMXT (arm_arch_iwmmxt)
#define TARGET_REALLY_IWMMXT (TARGET_IWMMXT && TARGET_ARM)
#define TARGET_IWMMXT_ABI (TARGET_ARM && arm_abi == ARM_ABI_IWMMXT)
#define TARGET_ARM (! TARGET_THUMB)
#define TARGET_EITHER 1 /* (TARGET_ARM | TARGET_THUMB) */
#define TARGET_BACKTRACE (leaf_function_p () \
? TARGET_TPCS_LEAF_FRAME \
: TARGET_TPCS_FRAME)
#define TARGET_LDRD (arm_arch5e && ARM_DOUBLEWORD_ALIGN)
#define TARGET_AAPCS_BASED \
(arm_abi != ARM_ABI_APCS && arm_abi != ARM_ABI_ATPCS)
#define TARGET_HARD_TP (target_thread_pointer == TP_CP15)
#define TARGET_SOFT_TP (target_thread_pointer == TP_SOFT)
/* True iff the full BPABI is being used. If TARGET_BPABI is true,
then TARGET_AAPCS_BASED must be true -- but the converse does not
hold. TARGET_BPABI implies the use of the BPABI runtime library,
etc., in addition to just the AAPCS calling conventions. */
#ifndef TARGET_BPABI
#define TARGET_BPABI false
#endif
/* Support for a compile-time default CPU, et cetera. The rules are:
--with-arch is ignored if -march or -mcpu are specified.
--with-cpu is ignored if -march or -mcpu are specified, and is overridden
by --with-arch.
--with-tune is ignored if -mtune or -mcpu are specified (but not affected
by -march).
--with-float is ignored if -mhard-float, -msoft-float or -mfloat-abi are
specified.
--with-fpu is ignored if -mfpu is specified.
--with-abi is ignored is -mabi is specified. */
#define OPTION_DEFAULT_SPECS \
{"arch", "%{!march=*:%{!mcpu=*:-march=%(VALUE)}}" }, \
{"cpu", "%{!march=*:%{!mcpu=*:-mcpu=%(VALUE)}}" }, \
{"tune", "%{!mcpu=*:%{!mtune=*:-mtune=%(VALUE)}}" }, \
{"float", \
"%{!msoft-float:%{!mhard-float:%{!mfloat-abi=*:-mfloat-abi=%(VALUE)}}}" }, \
{"fpu", "%{!mfpu=*:-mfpu=%(VALUE)}"}, \
{"abi", "%{!mabi=*:-mabi=%(VALUE)}"}, \
{"mode", "%{!marm:%{!mthumb:-m%(VALUE)}}"},
/* Which floating point model to use. */
enum arm_fp_model
{
ARM_FP_MODEL_UNKNOWN,
/* FPA model (Hardware or software). */
ARM_FP_MODEL_FPA,
/* Cirrus Maverick floating point model. */
ARM_FP_MODEL_MAVERICK,
/* VFP floating point model. */
ARM_FP_MODEL_VFP
};
extern enum arm_fp_model arm_fp_model;
/* Which floating point hardware is available. Also update
fp_model_for_fpu in arm.c when adding entries to this list. */
enum fputype
{
/* No FP hardware. */
FPUTYPE_NONE,
/* Full FPA support. */
FPUTYPE_FPA,
/* Emulated FPA hardware, Issue 2 emulator (no LFM/SFM). */
FPUTYPE_FPA_EMU2,
/* Emulated FPA hardware, Issue 3 emulator. */
FPUTYPE_FPA_EMU3,
/* Cirrus Maverick floating point co-processor. */
FPUTYPE_MAVERICK,
/* VFP. */
FPUTYPE_VFP
};
/* Recast the floating point class to be the floating point attribute. */
#define arm_fpu_attr ((enum attr_fpu) arm_fpu_tune)
/* What type of floating point to tune for */
extern enum fputype arm_fpu_tune;
/* What type of floating point instructions are available */
extern enum fputype arm_fpu_arch;
enum float_abi_type
{
ARM_FLOAT_ABI_SOFT,
ARM_FLOAT_ABI_SOFTFP,
ARM_FLOAT_ABI_HARD
};
extern enum float_abi_type arm_float_abi;
#ifndef TARGET_DEFAULT_FLOAT_ABI
#define TARGET_DEFAULT_FLOAT_ABI ARM_FLOAT_ABI_SOFT
#endif
/* Which ABI to use. */
enum arm_abi_type
{
ARM_ABI_APCS,
ARM_ABI_ATPCS,
ARM_ABI_AAPCS,
ARM_ABI_IWMMXT,
ARM_ABI_AAPCS_LINUX
};
extern enum arm_abi_type arm_abi;
#ifndef ARM_DEFAULT_ABI
#define ARM_DEFAULT_ABI ARM_ABI_APCS
#endif
/* Which thread pointer access sequence to use. */
enum arm_tp_type {
TP_AUTO,
TP_SOFT,
TP_CP15
};
extern enum arm_tp_type target_thread_pointer;
/* Nonzero if this chip supports the ARM Architecture 3M extensions. */
extern int arm_arch3m;
/* Nonzero if this chip supports the ARM Architecture 4 extensions. */
extern int arm_arch4;
/* Nonzero if this chip supports the ARM Architecture 4T extensions. */
extern int arm_arch4t;
/* Nonzero if this chip supports the ARM Architecture 5 extensions. */
extern int arm_arch5;
/* Nonzero if this chip supports the ARM Architecture 5E extensions. */
extern int arm_arch5e;
/* Nonzero if this chip supports the ARM Architecture 6 extensions. */
extern int arm_arch6;
/* Nonzero if this chip can benefit from load scheduling. */
extern int arm_ld_sched;
/* Nonzero if generating thumb code. */
extern int thumb_code;
/* Nonzero if this chip is a StrongARM. */
extern int arm_tune_strongarm;
/* Nonzero if this chip is a Cirrus variant. */
extern int arm_arch_cirrus;
/* Nonzero if this chip supports Intel XScale with Wireless MMX technology. */
extern int arm_arch_iwmmxt;
/* Nonzero if this chip is an XScale. */
extern int arm_arch_xscale;
/* Nonzero if tuning for XScale. */
extern int arm_tune_xscale;
/* Nonzero if tuning for stores via the write buffer. */
extern int arm_tune_wbuf;
/* Nonzero if we should define __THUMB_INTERWORK__ in the
preprocessor.
XXX This is a bit of a hack, it's intended to help work around
problems in GLD which doesn't understand that armv5t code is
interworking clean. */
extern int arm_cpp_interwork;
#ifndef TARGET_DEFAULT
#define TARGET_DEFAULT (MASK_APCS_FRAME)
#endif
/* The frame pointer register used in gcc has nothing to do with debugging;
that is controlled by the APCS-FRAME option. */
#define CAN_DEBUG_WITHOUT_FP
#define OVERRIDE_OPTIONS arm_override_options ()
/* Nonzero if PIC code requires explicit qualifiers to generate
PLT and GOT relocs rather than the assembler doing so implicitly.
Subtargets can override these if required. */
#ifndef NEED_GOT_RELOC
#define NEED_GOT_RELOC 0
#endif
#ifndef NEED_PLT_RELOC
#define NEED_PLT_RELOC 0
#endif
/* Nonzero if we need to refer to the GOT with a PC-relative
offset. In other words, generate
.word _GLOBAL_OFFSET_TABLE_ - [. - (.Lxx + 8)]
rather than
.word _GLOBAL_OFFSET_TABLE_ - (.Lxx + 8)
The default is true, which matches NetBSD. Subtargets can
override this if required. */
#ifndef GOT_PCREL
#define GOT_PCREL 1
#endif
/* Target machine storage Layout. */
/* Define this macro if it is advisable to hold scalars in registers
in a wider mode than that declared by the program. In such cases,
the value is constrained to be within the bounds of the declared
type, but kept valid in the wider mode. The signedness of the
extension may differ from that of the type. */
/* It is far faster to zero extend chars than to sign extend them */
#define PROMOTE_MODE(MODE, UNSIGNEDP, TYPE) \
if (GET_MODE_CLASS (MODE) == MODE_INT \
&& GET_MODE_SIZE (MODE) < 4) \
{ \
if (MODE == QImode) \
UNSIGNEDP = 1; \
else if (MODE == HImode) \
UNSIGNEDP = 1; \
(MODE) = SImode; \
}
#define PROMOTE_FUNCTION_MODE(MODE, UNSIGNEDP, TYPE) \
if ((GET_MODE_CLASS (MODE) == MODE_INT \
|| GET_MODE_CLASS (MODE) == MODE_COMPLEX_INT) \
&& GET_MODE_SIZE (MODE) < 4) \
(MODE) = SImode; \
/* Define this if most significant bit is lowest numbered
in instructions that operate on numbered bit-fields. */
#define BITS_BIG_ENDIAN 0
/* Define this if most significant byte of a word is the lowest numbered.
Most ARM processors are run in little endian mode, so that is the default.
If you want to have it run-time selectable, change the definition in a
cover file to be TARGET_BIG_ENDIAN. */
#define BYTES_BIG_ENDIAN (TARGET_BIG_END != 0)
/* Define this if most significant word of a multiword number is the lowest
numbered.
This is always false, even when in big-endian mode. */
#define WORDS_BIG_ENDIAN (BYTES_BIG_ENDIAN && ! TARGET_LITTLE_WORDS)
/* LIBGCC2_WORDS_BIG_ENDIAN has to be a constant, so we define this based
on processor pre-defineds when compiling libgcc2.c. */
#if defined(__ARMEB__) && !defined(__ARMWEL__)
#define LIBGCC2_WORDS_BIG_ENDIAN 1
#else
#define LIBGCC2_WORDS_BIG_ENDIAN 0
#endif
/* Define this if most significant word of doubles is the lowest numbered.
The rules are different based on whether or not we use FPA-format,
VFP-format or some other floating point co-processor's format doubles. */
#define FLOAT_WORDS_BIG_ENDIAN (arm_float_words_big_endian ())
#define UNITS_PER_WORD 4
/* True if natural alignment is used for doubleword types. */
#define ARM_DOUBLEWORD_ALIGN TARGET_AAPCS_BASED
#define DOUBLEWORD_ALIGNMENT 64
#define PARM_BOUNDARY 32
#define STACK_BOUNDARY (ARM_DOUBLEWORD_ALIGN ? DOUBLEWORD_ALIGNMENT : 32)
#define PREFERRED_STACK_BOUNDARY \
(arm_abi == ARM_ABI_ATPCS ? 64 : STACK_BOUNDARY)
#define FUNCTION_BOUNDARY 32
/* The lowest bit is used to indicate Thumb-mode functions, so the
vbit must go into the delta field of pointers to member
functions. */
#define TARGET_PTRMEMFUNC_VBIT_LOCATION ptrmemfunc_vbit_in_delta
#define EMPTY_FIELD_BOUNDARY 32
#define BIGGEST_ALIGNMENT (ARM_DOUBLEWORD_ALIGN ? DOUBLEWORD_ALIGNMENT : 32)
/* XXX Blah -- this macro is used directly by libobjc. Since it
supports no vector modes, cut out the complexity and fall back
on BIGGEST_FIELD_ALIGNMENT. */
#ifdef IN_TARGET_LIBS
#define BIGGEST_FIELD_ALIGNMENT 64
#endif
/* Make strings word-aligned so strcpy from constants will be faster. */
#define CONSTANT_ALIGNMENT_FACTOR (TARGET_THUMB || ! arm_tune_xscale ? 1 : 2)
#define CONSTANT_ALIGNMENT(EXP, ALIGN) \
((TREE_CODE (EXP) == STRING_CST \
&& (ALIGN) < BITS_PER_WORD * CONSTANT_ALIGNMENT_FACTOR) \
? BITS_PER_WORD * CONSTANT_ALIGNMENT_FACTOR : (ALIGN))
/* Setting STRUCTURE_SIZE_BOUNDARY to 32 produces more efficient code, but the
value set in previous versions of this toolchain was 8, which produces more
compact structures. The command line option -mstructure_size_boundary=<n>
can be used to change this value. For compatibility with the ARM SDK
however the value should be left at 32. ARM SDT Reference Manual (ARM DUI
0020D) page 2-20 says "Structures are aligned on word boundaries".
The AAPCS specifies a value of 8. */
#define STRUCTURE_SIZE_BOUNDARY arm_structure_size_boundary
extern int arm_structure_size_boundary;
/* This is the value used to initialize arm_structure_size_boundary. If a
particular arm target wants to change the default value it should change
the definition of this macro, not STRUCTURE_SIZE_BOUNDARY. See netbsd.h
for an example of this. */
#ifndef DEFAULT_STRUCTURE_SIZE_BOUNDARY
#define DEFAULT_STRUCTURE_SIZE_BOUNDARY 32
#endif
/* Nonzero if move instructions will actually fail to work
when given unaligned data. */
#define STRICT_ALIGNMENT 1
/* wchar_t is unsigned under the AAPCS. */
#ifndef WCHAR_TYPE
#define WCHAR_TYPE (TARGET_AAPCS_BASED ? "unsigned int" : "int")
#define WCHAR_TYPE_SIZE BITS_PER_WORD
#endif
#ifndef SIZE_TYPE
#define SIZE_TYPE (TARGET_AAPCS_BASED ? "unsigned int" : "long unsigned int")
#endif
#ifndef PTRDIFF_TYPE
#define PTRDIFF_TYPE (TARGET_AAPCS_BASED ? "int" : "long int")
#endif
/* AAPCS requires that structure alignment is affected by bitfields. */
#ifndef PCC_BITFIELD_TYPE_MATTERS
#define PCC_BITFIELD_TYPE_MATTERS TARGET_AAPCS_BASED
#endif
/* Standard register usage. */
/* Register allocation in ARM Procedure Call Standard (as used on RISCiX):
(S - saved over call).
r0 * argument word/integer result
r1-r3 argument word
r4-r8 S register variable
r9 S (rfp) register variable (real frame pointer)
r10 F S (sl) stack limit (used by -mapcs-stack-check)
r11 F S (fp) argument pointer
r12 (ip) temp workspace
r13 F S (sp) lower end of current stack frame
r14 (lr) link address/workspace
r15 F (pc) program counter
f0 floating point result
f1-f3 floating point scratch
f4-f7 S floating point variable
cc This is NOT a real register, but is used internally
to represent things that use or set the condition
codes.
sfp This isn't either. It is used during rtl generation
since the offset between the frame pointer and the
auto's isn't known until after register allocation.
afp Nor this, we only need this because of non-local
goto. Without it fp appears to be used and the
elimination code won't get rid of sfp. It tracks
fp exactly at all times.
*: See CONDITIONAL_REGISTER_USAGE */
/*
mvf0 Cirrus floating point result
mvf1-mvf3 Cirrus floating point scratch
mvf4-mvf15 S Cirrus floating point variable. */
/* s0-s15 VFP scratch (aka d0-d7).
s16-s31 S VFP variable (aka d8-d15).
vfpcc Not a real register. Represents the VFP condition
code flags. */
/* The stack backtrace structure is as follows:
fp points to here: | save code pointer | [fp]
| return link value | [fp, #-4]
| return sp value | [fp, #-8]
| return fp value | [fp, #-12]
[| saved r10 value |]
[| saved r9 value |]
[| saved r8 value |]
[| saved r7 value |]
[| saved r6 value |]
[| saved r5 value |]
[| saved r4 value |]
[| saved r3 value |]
[| saved r2 value |]
[| saved r1 value |]
[| saved r0 value |]
[| saved f7 value |] three words
[| saved f6 value |] three words
[| saved f5 value |] three words
[| saved f4 value |] three words
r0-r3 are not normally saved in a C function. */
/* 1 for registers that have pervasive standard uses
and are not available for the register allocator. */
#define FIXED_REGISTERS \
{ \
0,0,0,0,0,0,0,0, \
0,0,0,0,0,1,0,1, \
0,0,0,0,0,0,0,0, \
1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1 \
}
/* 1 for registers not available across function calls.
These must include the FIXED_REGISTERS and also any
registers that can be used without being saved.
The latter must include the registers where values are returned
and the register where structure-value addresses are passed.
Aside from that, you can include as many other registers as you like.
The CC is not preserved over function calls on the ARM 6, so it is
easier to assume this for all. SFP is preserved, since FP is. */
#define CALL_USED_REGISTERS \
{ \
1,1,1,1,0,0,0,0, \
0,0,0,0,1,1,1,1, \
1,1,1,1,0,0,0,0, \
1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1,1,1,1,1,1,1,1, \
1 \
}
#ifndef SUBTARGET_CONDITIONAL_REGISTER_USAGE
#define SUBTARGET_CONDITIONAL_REGISTER_USAGE
#endif
#define CONDITIONAL_REGISTER_USAGE \
{ \
int regno; \
\
if (TARGET_SOFT_FLOAT || TARGET_THUMB || !TARGET_FPA) \
{ \
for (regno = FIRST_FPA_REGNUM; \
regno <= LAST_FPA_REGNUM; ++regno) \
fixed_regs[regno] = call_used_regs[regno] = 1; \
} \
\
if (TARGET_THUMB && optimize_size) \
{ \
/* When optimizing for size, it's better not to use \
the HI regs, because of the overhead of stacking \
them. */ \
for (regno = FIRST_HI_REGNUM; \
regno <= LAST_HI_REGNUM; ++regno) \
fixed_regs[regno] = call_used_regs[regno] = 1; \
} \
\
/* The link register can be clobbered by any branch insn, \
but we have no way to track that at present, so mark \
it as unavailable. */ \
if (TARGET_THUMB) \
fixed_regs[LR_REGNUM] = call_used_regs[LR_REGNUM] = 1; \
\
if (TARGET_ARM && TARGET_HARD_FLOAT) \
{ \
if (TARGET_MAVERICK) \
{ \
for (regno = FIRST_FPA_REGNUM; \
regno <= LAST_FPA_REGNUM; ++ regno) \
fixed_regs[regno] = call_used_regs[regno] = 1; \
for (regno = FIRST_CIRRUS_FP_REGNUM; \
regno <= LAST_CIRRUS_FP_REGNUM; ++ regno) \
{ \
fixed_regs[regno] = 0; \
call_used_regs[regno] = regno < FIRST_CIRRUS_FP_REGNUM + 4; \
} \
} \
if (TARGET_VFP) \
{ \
for (regno = FIRST_VFP_REGNUM; \
regno <= LAST_VFP_REGNUM; ++ regno) \
{ \
fixed_regs[regno] = 0; \
call_used_regs[regno] = regno < FIRST_VFP_REGNUM + 16; \
} \
} \
} \
\
if (TARGET_REALLY_IWMMXT) \
{ \
regno = FIRST_IWMMXT_GR_REGNUM; \
/* The 2002/10/09 revision of the XScale ABI has wCG0 \
and wCG1 as call-preserved registers. The 2002/11/21 \
revision changed this so that all wCG registers are \
scratch registers. */ \
for (regno = FIRST_IWMMXT_GR_REGNUM; \
regno <= LAST_IWMMXT_GR_REGNUM; ++ regno) \
fixed_regs[regno] = 0; \
/* The XScale ABI has wR0 - wR9 as scratch registers, \
the rest as call-preserved registers. */ \
for (regno = FIRST_IWMMXT_REGNUM; \
regno <= LAST_IWMMXT_REGNUM; ++ regno) \
{ \
fixed_regs[regno] = 0; \
call_used_regs[regno] = regno < FIRST_IWMMXT_REGNUM + 10; \
} \
} \
\
if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM) \
{ \
fixed_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
call_used_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
} \
else if (TARGET_APCS_STACK) \
{ \
fixed_regs[10] = 1; \
call_used_regs[10] = 1; \
} \
/* -mcaller-super-interworking reserves r11 for calls to \
_interwork_r11_call_via_rN(). Making the register global \
is an easy way of ensuring that it remains valid for all \
calls. */ \
if (TARGET_APCS_FRAME || TARGET_CALLER_INTERWORKING \
|| TARGET_TPCS_FRAME || TARGET_TPCS_LEAF_FRAME) \
{ \
fixed_regs[ARM_HARD_FRAME_POINTER_REGNUM] = 1; \
call_used_regs[ARM_HARD_FRAME_POINTER_REGNUM] = 1; \
if (TARGET_CALLER_INTERWORKING) \
global_regs[ARM_HARD_FRAME_POINTER_REGNUM] = 1; \
} \
SUBTARGET_CONDITIONAL_REGISTER_USAGE \
}
/* These are a couple of extensions to the formats accepted
by asm_fprintf:
%@ prints out ASM_COMMENT_START
%r prints out REGISTER_PREFIX reg_names[arg] */
#define ASM_FPRINTF_EXTENSIONS(FILE, ARGS, P) \
case '@': \
fputs (ASM_COMMENT_START, FILE); \
break; \
\
case 'r': \
fputs (REGISTER_PREFIX, FILE); \
fputs (reg_names [va_arg (ARGS, int)], FILE); \
break;
/* Round X up to the nearest word. */
#define ROUND_UP_WORD(X) (((X) + 3) & ~3)
/* Convert fron bytes to ints. */
#define ARM_NUM_INTS(X) (((X) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
/* The number of (integer) registers required to hold a quantity of type MODE.
Also used for VFP registers. */
#define ARM_NUM_REGS(MODE) \
ARM_NUM_INTS (GET_MODE_SIZE (MODE))
/* The number of (integer) registers required to hold a quantity of TYPE MODE. */
#define ARM_NUM_REGS2(MODE, TYPE) \
ARM_NUM_INTS ((MODE) == BLKmode ? \
int_size_in_bytes (TYPE) : GET_MODE_SIZE (MODE))
/* The number of (integer) argument register available. */
#define NUM_ARG_REGS 4
/* Return the register number of the N'th (integer) argument. */
#define ARG_REGISTER(N) (N - 1)
/* Specify the registers used for certain standard purposes.
The values of these macros are register numbers. */
/* The number of the last argument register. */
#define LAST_ARG_REGNUM ARG_REGISTER (NUM_ARG_REGS)
/* The numbers of the Thumb register ranges. */
#define FIRST_LO_REGNUM 0
#define LAST_LO_REGNUM 7
#define FIRST_HI_REGNUM 8
#define LAST_HI_REGNUM 11
#ifndef TARGET_UNWIND_INFO
/* We use sjlj exceptions for backwards compatibility. */
#define MUST_USE_SJLJ_EXCEPTIONS 1
#endif
/* We can generate DWARF2 Unwind info, even though we don't use it. */
#define DWARF2_UNWIND_INFO 1
/* Use r0 and r1 to pass exception handling information. */
#define EH_RETURN_DATA_REGNO(N) (((N) < 2) ? N : INVALID_REGNUM)
/* The register that holds the return address in exception handlers. */
#define ARM_EH_STACKADJ_REGNUM 2
#define EH_RETURN_STACKADJ_RTX gen_rtx_REG (SImode, ARM_EH_STACKADJ_REGNUM)
/* The native (Norcroft) Pascal compiler for the ARM passes the static chain
as an invisible last argument (possible since varargs don't exist in
Pascal), so the following is not true. */
#define STATIC_CHAIN_REGNUM (TARGET_ARM ? 12 : 9)
/* Define this to be where the real frame pointer is if it is not possible to
work out the offset between the frame pointer and the automatic variables
until after register allocation has taken place. FRAME_POINTER_REGNUM
should point to a special register that we will make sure is eliminated.
For the Thumb we have another problem. The TPCS defines the frame pointer
as r11, and GCC believes that it is always possible to use the frame pointer
as base register for addressing purposes. (See comments in
find_reloads_address()). But - the Thumb does not allow high registers,
including r11, to be used as base address registers. Hence our problem.
The solution used here, and in the old thumb port is to use r7 instead of
r11 as the hard frame pointer and to have special code to generate
backtrace structures on the stack (if required to do so via a command line
option) using r11. This is the only 'user visible' use of r11 as a frame
pointer. */
#define ARM_HARD_FRAME_POINTER_REGNUM 11
#define THUMB_HARD_FRAME_POINTER_REGNUM 7
#define HARD_FRAME_POINTER_REGNUM \
(TARGET_ARM \
? ARM_HARD_FRAME_POINTER_REGNUM \
: THUMB_HARD_FRAME_POINTER_REGNUM)
#define FP_REGNUM HARD_FRAME_POINTER_REGNUM
/* Register to use for pushing function arguments. */
#define STACK_POINTER_REGNUM SP_REGNUM
/* ARM floating pointer registers. */
#define FIRST_FPA_REGNUM 16
#define LAST_FPA_REGNUM 23
#define IS_FPA_REGNUM(REGNUM) \
(((REGNUM) >= FIRST_FPA_REGNUM) && ((REGNUM) <= LAST_FPA_REGNUM))
#define FIRST_IWMMXT_GR_REGNUM 43
#define LAST_IWMMXT_GR_REGNUM 46
#define FIRST_IWMMXT_REGNUM 47
#define LAST_IWMMXT_REGNUM 62
#define IS_IWMMXT_REGNUM(REGNUM) \
(((REGNUM) >= FIRST_IWMMXT_REGNUM) && ((REGNUM) <= LAST_IWMMXT_REGNUM))
#define IS_IWMMXT_GR_REGNUM(REGNUM) \
(((REGNUM) >= FIRST_IWMMXT_GR_REGNUM) && ((REGNUM) <= LAST_IWMMXT_GR_REGNUM))
/* Base register for access to local variables of the function. */
#define FRAME_POINTER_REGNUM 25
/* Base register for access to arguments of the function. */
#define ARG_POINTER_REGNUM 26
#define FIRST_CIRRUS_FP_REGNUM 27
#define LAST_CIRRUS_FP_REGNUM 42
#define IS_CIRRUS_REGNUM(REGNUM) \
(((REGNUM) >= FIRST_CIRRUS_FP_REGNUM) && ((REGNUM) <= LAST_CIRRUS_FP_REGNUM))
#define FIRST_VFP_REGNUM 63
#define LAST_VFP_REGNUM 94
#define IS_VFP_REGNUM(REGNUM) \
(((REGNUM) >= FIRST_VFP_REGNUM) && ((REGNUM) <= LAST_VFP_REGNUM))
/* The number of hard registers is 16 ARM + 8 FPA + 1 CC + 1 SFP + 1 AFP. */
/* + 16 Cirrus registers take us up to 43. */
/* Intel Wireless MMX Technology registers add 16 + 4 more. */
/* VFP adds 32 + 1 more. */
#define FIRST_PSEUDO_REGISTER 96
#define DBX_REGISTER_NUMBER(REGNO) arm_dbx_register_number (REGNO)
/* Value should be nonzero if functions must have frame pointers.
Zero means the frame pointer need not be set up (and parms may be accessed
via the stack pointer) in functions that seem suitable.
If we have to have a frame pointer we might as well make use of it.
APCS says that the frame pointer does not need to be pushed in leaf
functions, or simple tail call functions. */
#ifndef SUBTARGET_FRAME_POINTER_REQUIRED
#define SUBTARGET_FRAME_POINTER_REQUIRED 0
#endif
#define FRAME_POINTER_REQUIRED \
(current_function_has_nonlocal_label \
|| SUBTARGET_FRAME_POINTER_REQUIRED \
|| (TARGET_ARM && TARGET_APCS_FRAME && ! leaf_function_p ()))
/* Return number of consecutive hard regs needed starting at reg REGNO
to hold something of mode MODE.
This is ordinarily the length in words of a value of mode MODE
but can be less for certain modes in special long registers.
On the ARM regs are UNITS_PER_WORD bits wide; FPA regs can hold any FP
mode. */
#define HARD_REGNO_NREGS(REGNO, MODE) \
((TARGET_ARM \
&& REGNO >= FIRST_FPA_REGNUM \
&& REGNO != FRAME_POINTER_REGNUM \
&& REGNO != ARG_POINTER_REGNUM) \
&& !IS_VFP_REGNUM (REGNO) \
? 1 : ARM_NUM_REGS (MODE))
/* Return true if REGNO is suitable for holding a quantity of type MODE. */
#define HARD_REGNO_MODE_OK(REGNO, MODE) \
arm_hard_regno_mode_ok ((REGNO), (MODE))
/* Value is 1 if it is a good idea to tie two pseudo registers
when one has mode MODE1 and one has mode MODE2.
If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
for any hard reg, then this must be 0 for correct output. */
#define MODES_TIEABLE_P(MODE1, MODE2) \
(GET_MODE_CLASS (MODE1) == GET_MODE_CLASS (MODE2))
#define VALID_IWMMXT_REG_MODE(MODE) \
(arm_vector_mode_supported_p (MODE) || (MODE) == DImode)
/* The order in which register should be allocated. It is good to use ip
since no saving is required (though calls clobber it) and it never contains
function parameters. It is quite good to use lr since other calls may
clobber it anyway. Allocate r0 through r3 in reverse order since r3 is
least likely to contain a function parameter; in addition results are
returned in r0. */
#define REG_ALLOC_ORDER \
{ \
3, 2, 1, 0, 12, 14, 4, 5, \
6, 7, 8, 10, 9, 11, 13, 15, \
16, 17, 18, 19, 20, 21, 22, 23, \
27, 28, 29, 30, 31, 32, 33, 34, \
35, 36, 37, 38, 39, 40, 41, 42, \
43, 44, 45, 46, 47, 48, 49, 50, \
51, 52, 53, 54, 55, 56, 57, 58, \
59, 60, 61, 62, \
24, 25, 26, \
78, 77, 76, 75, 74, 73, 72, 71, \
70, 69, 68, 67, 66, 65, 64, 63, \
79, 80, 81, 82, 83, 84, 85, 86, \
87, 88, 89, 90, 91, 92, 93, 94, \
95 \
}
/* Interrupt functions can only use registers that have already been
saved by the prologue, even if they would normally be
call-clobbered. */
#define HARD_REGNO_RENAME_OK(SRC, DST) \
(! IS_INTERRUPT (cfun->machine->func_type) || \
regs_ever_live[DST])
/* Register and constant classes. */
/* Register classes: used to be simple, just all ARM regs or all FPA regs
Now that the Thumb is involved it has become more complicated. */
enum reg_class
{
NO_REGS,
FPA_REGS,
CIRRUS_REGS,
VFP_REGS,
IWMMXT_GR_REGS,
IWMMXT_REGS,
LO_REGS,
STACK_REG,
BASE_REGS,
HI_REGS,
CC_REG,
VFPCC_REG,
GENERAL_REGS,
ALL_REGS,
LIM_REG_CLASSES
};
#define N_REG_CLASSES (int) LIM_REG_CLASSES
/* Give names of register classes as strings for dump file. */
#define REG_CLASS_NAMES \
{ \
"NO_REGS", \
"FPA_REGS", \
"CIRRUS_REGS", \
"VFP_REGS", \
"IWMMXT_GR_REGS", \
"IWMMXT_REGS", \
"LO_REGS", \
"STACK_REG", \
"BASE_REGS", \
"HI_REGS", \
"CC_REG", \
"VFPCC_REG", \
"GENERAL_REGS", \
"ALL_REGS", \
}
/* Define which registers fit in which classes.
This is an initializer for a vector of HARD_REG_SET
of length N_REG_CLASSES. */
#define REG_CLASS_CONTENTS \
{ \
{ 0x00000000, 0x00000000, 0x00000000 }, /* NO_REGS */ \
{ 0x00FF0000, 0x00000000, 0x00000000 }, /* FPA_REGS */ \
{ 0xF8000000, 0x000007FF, 0x00000000 }, /* CIRRUS_REGS */ \
{ 0x00000000, 0x80000000, 0x7FFFFFFF }, /* VFP_REGS */ \
{ 0x00000000, 0x00007800, 0x00000000 }, /* IWMMXT_GR_REGS */ \
{ 0x00000000, 0x7FFF8000, 0x00000000 }, /* IWMMXT_REGS */ \
{ 0x000000FF, 0x00000000, 0x00000000 }, /* LO_REGS */ \
{ 0x00002000, 0x00000000, 0x00000000 }, /* STACK_REG */ \
{ 0x000020FF, 0x00000000, 0x00000000 }, /* BASE_REGS */ \
{ 0x0000FF00, 0x00000000, 0x00000000 }, /* HI_REGS */ \
{ 0x01000000, 0x00000000, 0x00000000 }, /* CC_REG */ \
{ 0x00000000, 0x00000000, 0x80000000 }, /* VFPCC_REG */ \
{ 0x0200FFFF, 0x00000000, 0x00000000 }, /* GENERAL_REGS */ \
{ 0xFAFFFFFF, 0xFFFFFFFF, 0x7FFFFFFF } /* ALL_REGS */ \
}
/* The same information, inverted:
Return the class number of the smallest class containing
reg number REGNO. This could be a conditional expression
or could index an array. */
#define REGNO_REG_CLASS(REGNO) arm_regno_class (REGNO)
/* FPA registers can't do subreg as all values are reformatted to internal
precision. VFP registers may only be accessed in the mode they
were set. */
#define CANNOT_CHANGE_MODE_CLASS(FROM, TO, CLASS) \
(GET_MODE_SIZE (FROM) != GET_MODE_SIZE (TO) \
? reg_classes_intersect_p (FPA_REGS, (CLASS)) \
|| reg_classes_intersect_p (VFP_REGS, (CLASS)) \
: 0)
/* We need to define this for LO_REGS on thumb. Otherwise we can end up
using r0-r4 for function arguments, r7 for the stack frame and don't
have enough left over to do doubleword arithmetic. */
#define CLASS_LIKELY_SPILLED_P(CLASS) \
((TARGET_THUMB && (CLASS) == LO_REGS) \
|| (CLASS) == CC_REG)
/* The class value for index registers, and the one for base regs. */
#define INDEX_REG_CLASS (TARGET_THUMB ? LO_REGS : GENERAL_REGS)
#define BASE_REG_CLASS (TARGET_THUMB ? LO_REGS : GENERAL_REGS)
/* For the Thumb the high registers cannot be used as base registers
when addressing quantities in QI or HI mode; if we don't know the
mode, then we must be conservative. */
#define MODE_BASE_REG_CLASS(MODE) \
(TARGET_ARM ? GENERAL_REGS : \
(((MODE) == SImode) ? BASE_REGS : LO_REGS))
/* For Thumb we can not support SP+reg addressing, so we return LO_REGS
instead of BASE_REGS. */
#define MODE_BASE_REG_REG_CLASS(MODE) BASE_REG_CLASS
/* When SMALL_REGISTER_CLASSES is nonzero, the compiler allows
registers explicitly used in the rtl to be used as spill registers
but prevents the compiler from extending the lifetime of these
registers. */
#define SMALL_REGISTER_CLASSES TARGET_THUMB
/* Given an rtx X being reloaded into a reg required to be
in class CLASS, return the class of reg to actually use.
In general this is just CLASS, but for the Thumb we prefer
a LO_REGS class or a subset. */
#define PREFERRED_RELOAD_CLASS(X, CLASS) \
(TARGET_ARM ? (CLASS) : \
((CLASS) == BASE_REGS ? (CLASS) : LO_REGS))
/* Must leave BASE_REGS reloads alone */
#define THUMB_SECONDARY_INPUT_RELOAD_CLASS(CLASS, MODE, X) \
((CLASS) != LO_REGS && (CLASS) != BASE_REGS \
? ((true_regnum (X) == -1 ? LO_REGS \
: (true_regnum (X) + HARD_REGNO_NREGS (0, MODE) > 8) ? LO_REGS \
: NO_REGS)) \
: NO_REGS)
#define THUMB_SECONDARY_OUTPUT_RELOAD_CLASS(CLASS, MODE, X) \
((CLASS) != LO_REGS && (CLASS) != BASE_REGS \
? ((true_regnum (X) == -1 ? LO_REGS \
: (true_regnum (X) + HARD_REGNO_NREGS (0, MODE) > 8) ? LO_REGS \
: NO_REGS)) \
: NO_REGS)
/* Return the register class of a scratch register needed to copy IN into
or out of a register in CLASS in MODE. If it can be done directly,
NO_REGS is returned. */
#define SECONDARY_OUTPUT_RELOAD_CLASS(CLASS, MODE, X) \
/* Restrict which direct reloads are allowed for VFP/iWMMXt regs. */ \
((TARGET_VFP && TARGET_HARD_FLOAT \
&& (CLASS) == VFP_REGS) \
? coproc_secondary_reload_class (MODE, X, FALSE) \
: (TARGET_IWMMXT && (CLASS) == IWMMXT_REGS) \
? coproc_secondary_reload_class (MODE, X, TRUE) \
: TARGET_ARM \
? (((MODE) == HImode && ! arm_arch4 && true_regnum (X) == -1) \
? GENERAL_REGS : NO_REGS) \
: THUMB_SECONDARY_OUTPUT_RELOAD_CLASS (CLASS, MODE, X))
/* If we need to load shorts byte-at-a-time, then we need a scratch. */
#define SECONDARY_INPUT_RELOAD_CLASS(CLASS, MODE, X) \
/* Restrict which direct reloads are allowed for VFP/iWMMXt regs. */ \
((TARGET_VFP && TARGET_HARD_FLOAT \
&& (CLASS) == VFP_REGS) \
? coproc_secondary_reload_class (MODE, X, FALSE) : \
(TARGET_IWMMXT && (CLASS) == IWMMXT_REGS) ? \
coproc_secondary_reload_class (MODE, X, TRUE) : \
/* Cannot load constants into Cirrus registers. */ \
(TARGET_MAVERICK && TARGET_HARD_FLOAT \
&& (CLASS) == CIRRUS_REGS \
&& (CONSTANT_P (X) || GET_CODE (X) == SYMBOL_REF)) \
? GENERAL_REGS : \
(TARGET_ARM ? \
(((CLASS) == IWMMXT_REGS || (CLASS) == IWMMXT_GR_REGS) \
&& CONSTANT_P (X)) \
? GENERAL_REGS : \
(((MODE) == HImode && ! arm_arch4 \
&& (GET_CODE (X) == MEM \
|| ((GET_CODE (X) == REG || GET_CODE (X) == SUBREG) \
&& true_regnum (X) == -1))) \
? GENERAL_REGS : NO_REGS) \
: THUMB_SECONDARY_INPUT_RELOAD_CLASS (CLASS, MODE, X)))
/* Try a machine-dependent way of reloading an illegitimate address
operand. If we find one, push the reload and jump to WIN. This
macro is used in only one place: `find_reloads_address' in reload.c.
For the ARM, we wish to handle large displacements off a base
register by splitting the addend across a MOV and the mem insn.
This can cut the number of reloads needed. */
#define ARM_LEGITIMIZE_RELOAD_ADDRESS(X, MODE, OPNUM, TYPE, IND, WIN) \
do \
{ \
if (GET_CODE (X) == PLUS \
&& GET_CODE (XEXP (X, 0)) == REG \
&& REGNO (XEXP (X, 0)) < FIRST_PSEUDO_REGISTER \
&& REG_MODE_OK_FOR_BASE_P (XEXP (X, 0), MODE) \
&& GET_CODE (XEXP (X, 1)) == CONST_INT) \
{ \
HOST_WIDE_INT val = INTVAL (XEXP (X, 1)); \
HOST_WIDE_INT low, high; \
\
if (MODE == DImode || (MODE == DFmode && TARGET_SOFT_FLOAT)) \
low = ((val & 0xf) ^ 0x8) - 0x8; \
else if (TARGET_MAVERICK && TARGET_HARD_FLOAT) \
/* Need to be careful, -256 is not a valid offset. */ \
low = val >= 0 ? (val & 0xff) : -((-val) & 0xff); \
else if (MODE == SImode \
|| (MODE == SFmode && TARGET_SOFT_FLOAT) \
|| ((MODE == HImode || MODE == QImode) && ! arm_arch4)) \
/* Need to be careful, -4096 is not a valid offset. */ \
low = val >= 0 ? (val & 0xfff) : -((-val) & 0xfff); \
else if ((MODE == HImode || MODE == QImode) && arm_arch4) \
/* Need to be careful, -256 is not a valid offset. */ \
low = val >= 0 ? (val & 0xff) : -((-val) & 0xff); \
else if (GET_MODE_CLASS (MODE) == MODE_FLOAT \
&& TARGET_HARD_FLOAT && TARGET_FPA) \
/* Need to be careful, -1024 is not a valid offset. */ \
low = val >= 0 ? (val & 0x3ff) : -((-val) & 0x3ff); \
else \
break; \
\
high = ((((val - low) & (unsigned HOST_WIDE_INT) 0xffffffff) \
^ (unsigned HOST_WIDE_INT) 0x80000000) \
- (unsigned HOST_WIDE_INT) 0x80000000); \
/* Check for overflow or zero */ \
if (low == 0 || high == 0 || (high + low != val)) \
break; \
\
/* Reload the high part into a base reg; leave the low part \
in the mem. */ \
X = gen_rtx_PLUS (GET_MODE (X), \
gen_rtx_PLUS (GET_MODE (X), XEXP (X, 0), \
GEN_INT (high)), \
GEN_INT (low)); \
push_reload (XEXP (X, 0), NULL_RTX, &XEXP (X, 0), NULL, \
MODE_BASE_REG_CLASS (MODE), GET_MODE (X), \
VOIDmode, 0, 0, OPNUM, TYPE); \
goto WIN; \
} \
} \
while (0)
/* XXX If an HImode FP+large_offset address is converted to an HImode
SP+large_offset address, then reload won't know how to fix it. It sees
only that SP isn't valid for HImode, and so reloads the SP into an index
register, but the resulting address is still invalid because the offset
is too big. We fix it here instead by reloading the entire address. */
/* We could probably achieve better results by defining PROMOTE_MODE to help
cope with the variances between the Thumb's signed and unsigned byte and
halfword load instructions. */
#define THUMB_LEGITIMIZE_RELOAD_ADDRESS(X, MODE, OPNUM, TYPE, IND_L, WIN) \
do { \
rtx new_x = thumb_legitimize_reload_address (&X, MODE, OPNUM, TYPE, IND_L); \
if (new_x) \
{ \
X = new_x; \
goto WIN; \
} \
} while (0)
#define LEGITIMIZE_RELOAD_ADDRESS(X, MODE, OPNUM, TYPE, IND_LEVELS, WIN) \
if (TARGET_ARM) \
ARM_LEGITIMIZE_RELOAD_ADDRESS (X, MODE, OPNUM, TYPE, IND_LEVELS, WIN); \
else \
THUMB_LEGITIMIZE_RELOAD_ADDRESS (X, MODE, OPNUM, TYPE, IND_LEVELS, WIN)
/* Return the maximum number of consecutive registers
needed to represent mode MODE in a register of class CLASS.
ARM regs are UNITS_PER_WORD bits while FPA regs can hold any FP mode */
#define CLASS_MAX_NREGS(CLASS, MODE) \
(((CLASS) == FPA_REGS || (CLASS) == CIRRUS_REGS) ? 1 : ARM_NUM_REGS (MODE))
/* If defined, gives a class of registers that cannot be used as the
operand of a SUBREG that changes the mode of the object illegally. */
/* Moves between FPA_REGS and GENERAL_REGS are two memory insns. */
#define REGISTER_MOVE_COST(MODE, FROM, TO) \
(TARGET_ARM ? \
((FROM) == FPA_REGS && (TO) != FPA_REGS ? 20 : \
(FROM) != FPA_REGS && (TO) == FPA_REGS ? 20 : \
(FROM) == VFP_REGS && (TO) != VFP_REGS ? 10 : \
(FROM) != VFP_REGS && (TO) == VFP_REGS ? 10 : \
(FROM) == IWMMXT_REGS && (TO) != IWMMXT_REGS ? 4 : \
(FROM) != IWMMXT_REGS && (TO) == IWMMXT_REGS ? 4 : \
(FROM) == IWMMXT_GR_REGS || (TO) == IWMMXT_GR_REGS ? 20 : \
(FROM) == CIRRUS_REGS && (TO) != CIRRUS_REGS ? 20 : \
(FROM) != CIRRUS_REGS && (TO) == CIRRUS_REGS ? 20 : \
2) \
: \
((FROM) == HI_REGS || (TO) == HI_REGS) ? 4 : 2)
/* Stack layout; function entry, exit and calling. */
/* Define this if pushing a word on the stack
makes the stack pointer a smaller address. */
#define STACK_GROWS_DOWNWARD 1
/* Define this to nonzero if the nominal address of the stack frame
is at the high-address end of the local variables;
that is, each additional local variable allocated
goes at a more negative offset in the frame. */
#define FRAME_GROWS_DOWNWARD 1
/* The amount of scratch space needed by _interwork_{r7,r11}_call_via_rN().
When present, it is one word in size, and sits at the top of the frame,
between the soft frame pointer and either r7 or r11.
We only need _interwork_rM_call_via_rN() for -mcaller-super-interworking,
and only then if some outgoing arguments are passed on the stack. It would
be tempting to also check whether the stack arguments are passed by indirect
calls, but there seems to be no reason in principle why a post-reload pass
couldn't convert a direct call into an indirect one. */
#define CALLER_INTERWORKING_SLOT_SIZE \
(TARGET_CALLER_INTERWORKING \
&& current_function_outgoing_args_size != 0 \
? UNITS_PER_WORD : 0)
/* Offset within stack frame to start allocating local variables at.
If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
first local allocated. Otherwise, it is the offset to the BEGINNING
of the first local allocated. */
#define STARTING_FRAME_OFFSET 0
/* If we generate an insn to push BYTES bytes,
this says how many the stack pointer really advances by. */
/* The push insns do not do this rounding implicitly.
So don't define this. */
/* #define PUSH_ROUNDING(NPUSHED) ROUND_UP_WORD (NPUSHED) */
/* Define this if the maximum size of all the outgoing args is to be
accumulated and pushed during the prologue. The amount can be
found in the variable current_function_outgoing_args_size. */
#define ACCUMULATE_OUTGOING_ARGS 1
/* Offset of first parameter from the argument pointer register value. */
#define FIRST_PARM_OFFSET(FNDECL) (TARGET_ARM ? 4 : 0)
/* Value is the number of byte of arguments automatically
popped when returning from a subroutine call.
FUNDECL is the declaration node of the function (as a tree),
FUNTYPE is the data type of the function (as a tree),
or for a library call it is an identifier node for the subroutine name.
SIZE is the number of bytes of arguments passed on the stack.
On the ARM, the caller does not pop any of its arguments that were passed
on the stack. */
#define RETURN_POPS_ARGS(FUNDECL, FUNTYPE, SIZE) 0
/* Define how to find the value returned by a library function
assuming the value has mode MODE. */
#define LIBCALL_VALUE(MODE) \
(TARGET_ARM && TARGET_HARD_FLOAT_ABI && TARGET_FPA \
&& GET_MODE_CLASS (MODE) == MODE_FLOAT \
? gen_rtx_REG (MODE, FIRST_FPA_REGNUM) \
: TARGET_ARM && TARGET_HARD_FLOAT_ABI && TARGET_MAVERICK \
&& GET_MODE_CLASS (MODE) == MODE_FLOAT \
? gen_rtx_REG (MODE, FIRST_CIRRUS_FP_REGNUM) \
: TARGET_IWMMXT_ABI && arm_vector_mode_supported_p (MODE) \
? gen_rtx_REG (MODE, FIRST_IWMMXT_REGNUM) \
: gen_rtx_REG (MODE, ARG_REGISTER (1)))
/* Define how to find the value returned by a function.
VALTYPE is the data type of the value (as a tree).
If the precise function being called is known, FUNC is its FUNCTION_DECL;
otherwise, FUNC is 0. */
#define FUNCTION_VALUE(VALTYPE, FUNC) \
arm_function_value (VALTYPE, FUNC);
/* 1 if N is a possible register number for a function value.
On the ARM, only r0 and f0 can return results. */
/* On a Cirrus chip, mvf0 can return results. */
#define FUNCTION_VALUE_REGNO_P(REGNO) \
((REGNO) == ARG_REGISTER (1) \
|| (TARGET_ARM && ((REGNO) == FIRST_CIRRUS_FP_REGNUM) \
&& TARGET_HARD_FLOAT_ABI && TARGET_MAVERICK) \
|| ((REGNO) == FIRST_IWMMXT_REGNUM && TARGET_IWMMXT_ABI) \
|| (TARGET_ARM && ((REGNO) == FIRST_FPA_REGNUM) \
&& TARGET_HARD_FLOAT_ABI && TARGET_FPA))
/* Amount of memory needed for an untyped call to save all possible return
registers. */
#define APPLY_RESULT_SIZE arm_apply_result_size()
/* How large values are returned */
/* A C expression which can inhibit the returning of certain function values
in registers, based on the type of value. */
#define RETURN_IN_MEMORY(TYPE) arm_return_in_memory (TYPE)
/* Define DEFAULT_PCC_STRUCT_RETURN to 1 if all structure and union return
values must be in memory. On the ARM, they need only do so if larger
than a word, or if they contain elements offset from zero in the struct. */
#define DEFAULT_PCC_STRUCT_RETURN 0
/* Flags for the call/call_value rtl operations set up by function_arg. */
#define CALL_NORMAL 0x00000000 /* No special processing. */
#define CALL_LONG 0x00000001 /* Always call indirect. */
#define CALL_SHORT 0x00000002 /* Never call indirect. */
/* These bits describe the different types of function supported
by the ARM backend. They are exclusive. i.e. a function cannot be both a
normal function and an interworked function, for example. Knowing the
type of a function is important for determining its prologue and
epilogue sequences.
Note value 7 is currently unassigned. Also note that the interrupt
function types all have bit 2 set, so that they can be tested for easily.
Note that 0 is deliberately chosen for ARM_FT_UNKNOWN so that when the
machine_function structure is initialized (to zero) func_type will
default to unknown. This will force the first use of arm_current_func_type
to call arm_compute_func_type. */
#define ARM_FT_UNKNOWN 0 /* Type has not yet been determined. */
#define ARM_FT_NORMAL 1 /* Your normal, straightforward function. */
#define ARM_FT_INTERWORKED 2 /* A function that supports interworking. */
#define ARM_FT_ISR 4 /* An interrupt service routine. */
#define ARM_FT_FIQ 5 /* A fast interrupt service routine. */
#define ARM_FT_EXCEPTION 6 /* An ARM exception handler (subcase of ISR). */
#define ARM_FT_TYPE_MASK ((1 << 3) - 1)
/* In addition functions can have several type modifiers,
outlined by these bit masks: */
#define ARM_FT_INTERRUPT (1 << 2) /* Note overlap with FT_ISR and above. */
#define ARM_FT_NAKED (1 << 3) /* No prologue or epilogue. */
#define ARM_FT_VOLATILE (1 << 4) /* Does not return. */
#define ARM_FT_NESTED (1 << 5) /* Embedded inside another func. */
/* Some macros to test these flags. */
#define ARM_FUNC_TYPE(t) (t & ARM_FT_TYPE_MASK)
#define IS_INTERRUPT(t) (t & ARM_FT_INTERRUPT)
#define IS_VOLATILE(t) (t & ARM_FT_VOLATILE)
#define IS_NAKED(t) (t & ARM_FT_NAKED)
#define IS_NESTED(t) (t & ARM_FT_NESTED)
/* Structure used to hold the function stack frame layout. Offsets are
relative to the stack pointer on function entry. Positive offsets are
in the direction of stack growth.
Only soft_frame is used in thumb mode. */
typedef struct arm_stack_offsets GTY(())
{
int saved_args; /* ARG_POINTER_REGNUM. */
int frame; /* ARM_HARD_FRAME_POINTER_REGNUM. */
int saved_regs;
int soft_frame; /* FRAME_POINTER_REGNUM. */
int locals_base; /* THUMB_HARD_FRAME_POINTER_REGNUM. */
int outgoing_args; /* STACK_POINTER_REGNUM. */
}
arm_stack_offsets;
/* A C structure for machine-specific, per-function data.
This is added to the cfun structure. */
typedef struct machine_function GTY(())
{
/* Additional stack adjustment in __builtin_eh_throw. */
rtx eh_epilogue_sp_ofs;
/* Records if LR has to be saved for far jumps. */
int far_jump_used;
/* Records if ARG_POINTER was ever live. */
int arg_pointer_live;
/* Records if the save of LR has been eliminated. */
int lr_save_eliminated;
/* The size of the stack frame. Only valid after reload. */
arm_stack_offsets stack_offsets;
/* Records the type of the current function. */
unsigned long func_type;
/* Record if the function has a variable argument list. */
int uses_anonymous_args;
/* Records if sibcalls are blocked because an argument
register is needed to preserve stack alignment. */
int sibcall_blocked;
/* The PIC register for this function. This might be a pseudo. */
rtx pic_reg;
/* Labels for per-function Thumb call-via stubs. One per potential calling
register. We can never call via LR or PC. We can call via SP if a
trampoline happens to be on the top of the stack. */
rtx call_via[14];
}
machine_function;
/* As in the machine_function, a global set of call-via labels, for code
that is in text_section. */
extern GTY(()) rtx thumb_call_via_label[14];
/* A C type for declaring a variable that is used as the first argument of
`FUNCTION_ARG' and other related values. For some target machines, the
type `int' suffices and can hold the number of bytes of argument so far. */
typedef struct
{
/* This is the number of registers of arguments scanned so far. */
int nregs;
/* This is the number of iWMMXt register arguments scanned so far. */
int iwmmxt_nregs;
int named_count;
int nargs;
/* One of CALL_NORMAL, CALL_LONG or CALL_SHORT. */
int call_cookie;
int can_split;
} CUMULATIVE_ARGS;
/* Define where to put the arguments to a function.
Value is zero to push the argument on the stack,
or a hard register in which to store the argument.
MODE is the argument's machine mode.
TYPE is the data type of the argument (as a tree).
This is null for libcalls where that information may
not be available.
CUM is a variable of type CUMULATIVE_ARGS which gives info about
the preceding args and about the function being called.
NAMED is nonzero if this argument is a named parameter
(otherwise it is an extra parameter matching an ellipsis).
On the ARM, normally the first 16 bytes are passed in registers r0-r3; all
other arguments are passed on the stack. If (NAMED == 0) (which happens
only in assign_parms, since TARGET_SETUP_INCOMING_VARARGS is
defined), say it is passed in the stack (function_prologue will
indeed make it pass in the stack if necessary). */
#define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
arm_function_arg (&(CUM), (MODE), (TYPE), (NAMED))
#define FUNCTION_ARG_PADDING(MODE, TYPE) \
(arm_pad_arg_upward (MODE, TYPE) ? upward : downward)
#define BLOCK_REG_PADDING(MODE, TYPE, FIRST) \
(arm_pad_reg_upward (MODE, TYPE, FIRST) ? upward : downward)
/* For AAPCS, padding should never be below the argument. For other ABIs,
* mimic the default. */
#define PAD_VARARGS_DOWN \
((TARGET_AAPCS_BASED) ? 0 : BYTES_BIG_ENDIAN)
/* Initialize a variable CUM of type CUMULATIVE_ARGS
for a call to a function whose data type is FNTYPE.
For a library call, FNTYPE is 0.
On the ARM, the offset starts at 0. */
#define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, FNDECL, N_NAMED_ARGS) \
arm_init_cumulative_args (&(CUM), (FNTYPE), (LIBNAME), (FNDECL))
/* Update the data in CUM to advance over an argument
of mode MODE and data type TYPE.
(TYPE is null for libcalls where that information may not be available.) */
#define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
(CUM).nargs += 1; \
if (arm_vector_mode_supported_p (MODE) \
&& (CUM).named_count > (CUM).nargs) \
(CUM).iwmmxt_nregs += 1; \
else \
(CUM).nregs += ARM_NUM_REGS2 (MODE, TYPE)
/* If defined, a C expression that gives the alignment boundary, in bits, of an
argument with the specified mode and type. If it is not defined,
`PARM_BOUNDARY' is used for all arguments. */
#define FUNCTION_ARG_BOUNDARY(MODE,TYPE) \
((ARM_DOUBLEWORD_ALIGN && arm_needs_doubleword_align (MODE, TYPE)) \
? DOUBLEWORD_ALIGNMENT \
: PARM_BOUNDARY )
/* 1 if N is a possible register number for function argument passing.
On the ARM, r0-r3 are used to pass args. */
#define FUNCTION_ARG_REGNO_P(REGNO) \
(IN_RANGE ((REGNO), 0, 3) \
|| (TARGET_IWMMXT_ABI \
&& IN_RANGE ((REGNO), FIRST_IWMMXT_REGNUM, FIRST_IWMMXT_REGNUM + 9)))
/* If your target environment doesn't prefix user functions with an
underscore, you may wish to re-define this to prevent any conflicts.
e.g. AOF may prefix mcount with an underscore. */
#ifndef ARM_MCOUNT_NAME
#define ARM_MCOUNT_NAME "*mcount"
#endif
/* Call the function profiler with a given profile label. The Acorn
compiler puts this BEFORE the prolog but gcc puts it afterwards.
On the ARM the full profile code will look like:
.data
LP1
.word 0
.text
mov ip, lr
bl mcount
.word LP1
profile_function() in final.c outputs the .data section, FUNCTION_PROFILER
will output the .text section.
The ``mov ip,lr'' seems like a good idea to stick with cc convention.
``prof'' doesn't seem to mind about this!
Note - this version of the code is designed to work in both ARM and
Thumb modes. */
#ifndef ARM_FUNCTION_PROFILER
#define ARM_FUNCTION_PROFILER(STREAM, LABELNO) \
{ \
char temp[20]; \
rtx sym; \
\
asm_fprintf (STREAM, "\tmov\t%r, %r\n\tbl\t", \
IP_REGNUM, LR_REGNUM); \
assemble_name (STREAM, ARM_MCOUNT_NAME); \
fputc ('\n', STREAM); \
ASM_GENERATE_INTERNAL_LABEL (temp, "LP", LABELNO); \
sym = gen_rtx_SYMBOL_REF (Pmode, temp); \
assemble_aligned_integer (UNITS_PER_WORD, sym); \
}
#endif
#ifdef THUMB_FUNCTION_PROFILER
#define FUNCTION_PROFILER(STREAM, LABELNO) \
if (TARGET_ARM) \
ARM_FUNCTION_PROFILER (STREAM, LABELNO) \
else \
THUMB_FUNCTION_PROFILER (STREAM, LABELNO)
#else
#define FUNCTION_PROFILER(STREAM, LABELNO) \
ARM_FUNCTION_PROFILER (STREAM, LABELNO)
#endif
/* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
the stack pointer does not matter. The value is tested only in
functions that have frame pointers.
No definition is equivalent to always zero.
On the ARM, the function epilogue recovers the stack pointer from the
frame. */
#define EXIT_IGNORE_STACK 1
#define EPILOGUE_USES(REGNO) (reload_completed && (REGNO) == LR_REGNUM)
/* Determine if the epilogue should be output as RTL.
You should override this if you define FUNCTION_EXTRA_EPILOGUE. */
#define USE_RETURN_INSN(ISCOND) \
(TARGET_ARM ? use_return_insn (ISCOND, NULL) : 0)
/* Definitions for register eliminations.
This is an array of structures. Each structure initializes one pair
of eliminable registers. The "from" register number is given first,
followed by "to". Eliminations of the same "from" register are listed
in order of preference.
We have two registers that can be eliminated on the ARM. First, the
arg pointer register can often be eliminated in favor of the stack
pointer register. Secondly, the pseudo frame pointer register can always
be eliminated; it is replaced with either the stack or the real frame
pointer. Note we have to use {ARM|THUMB}_HARD_FRAME_POINTER_REGNUM
because the definition of HARD_FRAME_POINTER_REGNUM is not a constant. */
#define ELIMINABLE_REGS \
{{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM },\
{ ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM },\
{ ARG_POINTER_REGNUM, ARM_HARD_FRAME_POINTER_REGNUM },\
{ ARG_POINTER_REGNUM, THUMB_HARD_FRAME_POINTER_REGNUM },\
{ FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM },\
{ FRAME_POINTER_REGNUM, ARM_HARD_FRAME_POINTER_REGNUM },\
{ FRAME_POINTER_REGNUM, THUMB_HARD_FRAME_POINTER_REGNUM }}
/* Given FROM and TO register numbers, say whether this elimination is
allowed. Frame pointer elimination is automatically handled.
All eliminations are permissible. Note that ARG_POINTER_REGNUM and
HARD_FRAME_POINTER_REGNUM are in fact the same thing. If we need a frame
pointer, we must eliminate FRAME_POINTER_REGNUM into
HARD_FRAME_POINTER_REGNUM and not into STACK_POINTER_REGNUM or
ARG_POINTER_REGNUM. */
#define CAN_ELIMINATE(FROM, TO) \
(((TO) == FRAME_POINTER_REGNUM && (FROM) == ARG_POINTER_REGNUM) ? 0 : \
((TO) == STACK_POINTER_REGNUM && frame_pointer_needed) ? 0 : \
((TO) == ARM_HARD_FRAME_POINTER_REGNUM && TARGET_THUMB) ? 0 : \
((TO) == THUMB_HARD_FRAME_POINTER_REGNUM && TARGET_ARM) ? 0 : \
1)
/* Define the offset between two registers, one to be eliminated, and the
other its replacement, at the start of a routine. */
#define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
if (TARGET_ARM) \
(OFFSET) = arm_compute_initial_elimination_offset (FROM, TO); \
else \
(OFFSET) = thumb_compute_initial_elimination_offset (FROM, TO)
/* Special case handling of the location of arguments passed on the stack. */
#define DEBUGGER_ARG_OFFSET(value, addr) value ? value : arm_debugger_arg_offset (value, addr)
/* Initialize data used by insn expanders. This is called from insn_emit,
once for every function before code is generated. */
#define INIT_EXPANDERS arm_init_expanders ()
/* Output assembler code for a block containing the constant parts
of a trampoline, leaving space for the variable parts.
On the ARM, (if r8 is the static chain regnum, and remembering that
referencing pc adds an offset of 8) the trampoline looks like:
ldr r8, [pc, #0]
ldr pc, [pc]
.word static chain value
.word function's address
XXX FIXME: When the trampoline returns, r8 will be clobbered. */
#define ARM_TRAMPOLINE_TEMPLATE(FILE) \
{ \
asm_fprintf (FILE, "\tldr\t%r, [%r, #0]\n", \
STATIC_CHAIN_REGNUM, PC_REGNUM); \
asm_fprintf (FILE, "\tldr\t%r, [%r, #0]\n", \
PC_REGNUM, PC_REGNUM); \
assemble_aligned_integer (UNITS_PER_WORD, const0_rtx); \
assemble_aligned_integer (UNITS_PER_WORD, const0_rtx); \
}
/* On the Thumb we always switch into ARM mode to execute the trampoline.
Why - because it is easier. This code will always be branched to via
a BX instruction and since the compiler magically generates the address
of the function the linker has no opportunity to ensure that the
bottom bit is set. Thus the processor will be in ARM mode when it
reaches this code. So we duplicate the ARM trampoline code and add
a switch into Thumb mode as well. */
#define THUMB_TRAMPOLINE_TEMPLATE(FILE) \
{ \
fprintf (FILE, "\t.code 32\n"); \
fprintf (FILE, ".Ltrampoline_start:\n"); \
asm_fprintf (FILE, "\tldr\t%r, [%r, #8]\n", \
STATIC_CHAIN_REGNUM, PC_REGNUM); \
asm_fprintf (FILE, "\tldr\t%r, [%r, #8]\n", \
IP_REGNUM, PC_REGNUM); \
asm_fprintf (FILE, "\torr\t%r, %r, #1\n", \
IP_REGNUM, IP_REGNUM); \
asm_fprintf (FILE, "\tbx\t%r\n", IP_REGNUM); \
fprintf (FILE, "\t.word\t0\n"); \
fprintf (FILE, "\t.word\t0\n"); \
fprintf (FILE, "\t.code 16\n"); \
}
#define TRAMPOLINE_TEMPLATE(FILE) \
if (TARGET_ARM) \
ARM_TRAMPOLINE_TEMPLATE (FILE) \
else \
THUMB_TRAMPOLINE_TEMPLATE (FILE)
/* Length in units of the trampoline for entering a nested function. */
#define TRAMPOLINE_SIZE (TARGET_ARM ? 16 : 24)
/* Alignment required for a trampoline in bits. */
#define TRAMPOLINE_ALIGNMENT 32
/* Emit RTL insns to initialize the variable parts of a trampoline.
FNADDR is an RTX for the address of the function's pure code.
CXT is an RTX for the static chain value for the function. */
#ifndef INITIALIZE_TRAMPOLINE
#define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
{ \
emit_move_insn (gen_rtx_MEM (SImode, \
plus_constant (TRAMP, \
TARGET_ARM ? 8 : 16)), \
CXT); \
emit_move_insn (gen_rtx_MEM (SImode, \
plus_constant (TRAMP, \
TARGET_ARM ? 12 : 20)), \
FNADDR); \
emit_library_call (gen_rtx_SYMBOL_REF (Pmode, "__clear_cache"), \
0, VOIDmode, 2, TRAMP, Pmode, \
plus_constant (TRAMP, TRAMPOLINE_SIZE), Pmode); \
}
#endif
/* Addressing modes, and classification of registers for them. */
#define HAVE_POST_INCREMENT 1
#define HAVE_PRE_INCREMENT TARGET_ARM
#define HAVE_POST_DECREMENT TARGET_ARM
#define HAVE_PRE_DECREMENT TARGET_ARM
#define HAVE_PRE_MODIFY_DISP TARGET_ARM
#define HAVE_POST_MODIFY_DISP TARGET_ARM
#define HAVE_PRE_MODIFY_REG TARGET_ARM
#define HAVE_POST_MODIFY_REG TARGET_ARM
/* Macros to check register numbers against specific register classes. */
/* These assume that REGNO is a hard or pseudo reg number.
They give nonzero only if REGNO is a hard reg of the suitable class
or a pseudo reg currently allocated to a suitable hard reg.
Since they use reg_renumber, they are safe only once reg_renumber
has been allocated, which happens in local-alloc.c. */
#define TEST_REGNO(R, TEST, VALUE) \
((R TEST VALUE) || ((unsigned) reg_renumber[R] TEST VALUE))
/* On the ARM, don't allow the pc to be used. */
#define ARM_REGNO_OK_FOR_BASE_P(REGNO) \
(TEST_REGNO (REGNO, <, PC_REGNUM) \
|| TEST_REGNO (REGNO, ==, FRAME_POINTER_REGNUM) \
|| TEST_REGNO (REGNO, ==, ARG_POINTER_REGNUM))
#define THUMB_REGNO_MODE_OK_FOR_BASE_P(REGNO, MODE) \
(TEST_REGNO (REGNO, <=, LAST_LO_REGNUM) \
|| (GET_MODE_SIZE (MODE) >= 4 \
&& TEST_REGNO (REGNO, ==, STACK_POINTER_REGNUM)))
#define REGNO_MODE_OK_FOR_BASE_P(REGNO, MODE) \
(TARGET_THUMB \
? THUMB_REGNO_MODE_OK_FOR_BASE_P (REGNO, MODE) \
: ARM_REGNO_OK_FOR_BASE_P (REGNO))
/* Nonzero if X can be the base register in a reg+reg addressing mode.
For Thumb, we can not use SP + reg, so reject SP. */
#define REGNO_MODE_OK_FOR_REG_BASE_P(X, MODE) \
REGNO_OK_FOR_INDEX_P (X)
/* For ARM code, we don't care about the mode, but for Thumb, the index
must be suitable for use in a QImode load. */
#define REGNO_OK_FOR_INDEX_P(REGNO) \
REGNO_MODE_OK_FOR_BASE_P (REGNO, QImode)
/* Maximum number of registers that can appear in a valid memory address.
Shifts in addresses can't be by a register. */
#define MAX_REGS_PER_ADDRESS 2
/* Recognize any constant value that is a valid address. */
/* XXX We can address any constant, eventually... */
#ifdef AOF_ASSEMBLER
#define CONSTANT_ADDRESS_P(X) \
(GET_CODE (X) == SYMBOL_REF && CONSTANT_POOL_ADDRESS_P (X))
#else
#define CONSTANT_ADDRESS_P(X) \
(GET_CODE (X) == SYMBOL_REF \
&& (CONSTANT_POOL_ADDRESS_P (X) \
|| (TARGET_ARM && optimize > 0 && SYMBOL_REF_FLAG (X))))
#endif /* AOF_ASSEMBLER */
/* Nonzero if the constant value X is a legitimate general operand.
It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE.
On the ARM, allow any integer (invalid ones are removed later by insn
patterns), nice doubles and symbol_refs which refer to the function's
constant pool XXX.
When generating pic allow anything. */
#define ARM_LEGITIMATE_CONSTANT_P(X) (flag_pic || ! label_mentioned_p (X))
#define THUMB_LEGITIMATE_CONSTANT_P(X) \
( GET_CODE (X) == CONST_INT \
|| GET_CODE (X) == CONST_DOUBLE \
|| CONSTANT_ADDRESS_P (X) \
|| flag_pic)
#define LEGITIMATE_CONSTANT_P(X) \
(!arm_tls_referenced_p (X) \
&& (TARGET_ARM ? ARM_LEGITIMATE_CONSTANT_P (X) \
: THUMB_LEGITIMATE_CONSTANT_P (X)))
/* Special characters prefixed to function names
in order to encode attribute like information.
Note, '@' and '*' have already been taken. */
#define SHORT_CALL_FLAG_CHAR '^'
#define LONG_CALL_FLAG_CHAR '#'
#define ENCODED_SHORT_CALL_ATTR_P(SYMBOL_NAME) \
(*(SYMBOL_NAME) == SHORT_CALL_FLAG_CHAR)
#define ENCODED_LONG_CALL_ATTR_P(SYMBOL_NAME) \
(*(SYMBOL_NAME) == LONG_CALL_FLAG_CHAR)
#ifndef SUBTARGET_NAME_ENCODING_LENGTHS
#define SUBTARGET_NAME_ENCODING_LENGTHS
#endif
/* This is a C fragment for the inside of a switch statement.
Each case label should return the number of characters to
be stripped from the start of a function's name, if that
name starts with the indicated character. */
#define ARM_NAME_ENCODING_LENGTHS \
case SHORT_CALL_FLAG_CHAR: return 1; \
case LONG_CALL_FLAG_CHAR: return 1; \
case '*': return 1; \
SUBTARGET_NAME_ENCODING_LENGTHS
/* This is how to output a reference to a user-level label named NAME.
`assemble_name' uses this. */
#undef ASM_OUTPUT_LABELREF
#define ASM_OUTPUT_LABELREF(FILE, NAME) \
arm_asm_output_labelref (FILE, NAME)
/* The EABI specifies that constructors should go in .init_array.
Other targets use .ctors for compatibility. */
#ifndef ARM_EABI_CTORS_SECTION_OP
#define ARM_EABI_CTORS_SECTION_OP \
"\t.section\t.init_array,\"aw\",%init_array"
#endif
#ifndef ARM_EABI_DTORS_SECTION_OP
#define ARM_EABI_DTORS_SECTION_OP \
"\t.section\t.fini_array,\"aw\",%fini_array"
#endif
#define ARM_CTORS_SECTION_OP \
"\t.section\t.ctors,\"aw\",%progbits"
#define ARM_DTORS_SECTION_OP \
"\t.section\t.dtors,\"aw\",%progbits"
/* Define CTORS_SECTION_ASM_OP. */
#undef CTORS_SECTION_ASM_OP
#undef DTORS_SECTION_ASM_OP
#ifndef IN_LIBGCC2
# define CTORS_SECTION_ASM_OP \
(TARGET_AAPCS_BASED ? ARM_EABI_CTORS_SECTION_OP : ARM_CTORS_SECTION_OP)
# define DTORS_SECTION_ASM_OP \
(TARGET_AAPCS_BASED ? ARM_EABI_DTORS_SECTION_OP : ARM_DTORS_SECTION_OP)
#else /* !defined (IN_LIBGCC2) */
/* In libgcc, CTORS_SECTION_ASM_OP must be a compile-time constant,
so we cannot use the definition above. */
# ifdef __ARM_EABI__
/* The .ctors section is not part of the EABI, so we do not define
CTORS_SECTION_ASM_OP when in libgcc; that prevents crtstuff
from trying to use it. We do define it when doing normal
compilation, as .init_array can be used instead of .ctors. */
/* There is no need to emit begin or end markers when using
init_array; the dynamic linker will compute the size of the
array itself based on special symbols created by the static
linker. However, we do need to arrange to set up
exception-handling here. */
# define CTOR_LIST_BEGIN asm (ARM_EABI_CTORS_SECTION_OP)
# define CTOR_LIST_END /* empty */
# define DTOR_LIST_BEGIN asm (ARM_EABI_DTORS_SECTION_OP)
# define DTOR_LIST_END /* empty */
# else /* !defined (__ARM_EABI__) */
# define CTORS_SECTION_ASM_OP ARM_CTORS_SECTION_OP
# define DTORS_SECTION_ASM_OP ARM_DTORS_SECTION_OP
# endif /* !defined (__ARM_EABI__) */
#endif /* !defined (IN_LIBCC2) */
/* True if the operating system can merge entities with vague linkage
(e.g., symbols in COMDAT group) during dynamic linking. */
#ifndef TARGET_ARM_DYNAMIC_VAGUE_LINKAGE_P
#define TARGET_ARM_DYNAMIC_VAGUE_LINKAGE_P true
#endif
/* Set the short-call flag for any function compiled in the current
compilation unit. We skip this for functions with the section
attribute when long-calls are in effect as this tells the compiler
that the section might be placed a long way from the caller.
See arm_is_longcall_p() for more information. */
#define ARM_DECLARE_FUNCTION_SIZE(STREAM, NAME, DECL) \
if (!TARGET_LONG_CALLS || ! DECL_SECTION_NAME (DECL)) \
arm_encode_call_attribute (DECL, SHORT_CALL_FLAG_CHAR)
#define ARM_OUTPUT_FN_UNWIND(F, PROLOGUE) arm_output_fn_unwind (F, PROLOGUE)
#ifdef TARGET_UNWIND_INFO
#define ARM_EABI_UNWIND_TABLES \
((!USING_SJLJ_EXCEPTIONS && flag_exceptions) || flag_unwind_tables)
#else
#define ARM_EABI_UNWIND_TABLES 0
#endif
/* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
and check its validity for a certain class.
We have two alternate definitions for each of them.
The usual definition accepts all pseudo regs; the other rejects
them unless they have been allocated suitable hard regs.
The symbol REG_OK_STRICT causes the latter definition to be used. */
#ifndef REG_OK_STRICT
#define ARM_REG_OK_FOR_BASE_P(X) \
(REGNO (X) <= LAST_ARM_REGNUM \
|| REGNO (X) >= FIRST_PSEUDO_REGISTER \
|| REGNO (X) == FRAME_POINTER_REGNUM \
|| REGNO (X) == ARG_POINTER_REGNUM)
#define THUMB_REG_MODE_OK_FOR_BASE_P(X, MODE) \
(REGNO (X) <= LAST_LO_REGNUM \
|| REGNO (X) >= FIRST_PSEUDO_REGISTER \
|| (GET_MODE_SIZE (MODE) >= 4 \
&& (REGNO (X) == STACK_POINTER_REGNUM \
|| (X) == hard_frame_pointer_rtx \
|| (X) == arg_pointer_rtx)))
#define REG_STRICT_P 0
#else /* REG_OK_STRICT */
#define ARM_REG_OK_FOR_BASE_P(X) \
ARM_REGNO_OK_FOR_BASE_P (REGNO (X))
#define THUMB_REG_MODE_OK_FOR_BASE_P(X, MODE) \
THUMB_REGNO_MODE_OK_FOR_BASE_P (REGNO (X), MODE)
#define REG_STRICT_P 1
#endif /* REG_OK_STRICT */
/* Now define some helpers in terms of the above. */
#define REG_MODE_OK_FOR_BASE_P(X, MODE) \
(TARGET_THUMB \
? THUMB_REG_MODE_OK_FOR_BASE_P (X, MODE) \
: ARM_REG_OK_FOR_BASE_P (X))
#define ARM_REG_OK_FOR_INDEX_P(X) ARM_REG_OK_FOR_BASE_P (X)
/* For Thumb, a valid index register is anything that can be used in
a byte load instruction. */
#define THUMB_REG_OK_FOR_INDEX_P(X) THUMB_REG_MODE_OK_FOR_BASE_P (X, QImode)
/* Nonzero if X is a hard reg that can be used as an index
or if it is a pseudo reg. On the Thumb, the stack pointer
is not suitable. */
#define REG_OK_FOR_INDEX_P(X) \
(TARGET_THUMB \
? THUMB_REG_OK_FOR_INDEX_P (X) \
: ARM_REG_OK_FOR_INDEX_P (X))
/* Nonzero if X can be the base register in a reg+reg addressing mode.
For Thumb, we can not use SP + reg, so reject SP. */
#define REG_MODE_OK_FOR_REG_BASE_P(X, MODE) \
REG_OK_FOR_INDEX_P (X)
/* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
that is a valid memory address for an instruction.
The MODE argument is the machine mode for the MEM expression
that wants to use this address. */
#define ARM_BASE_REGISTER_RTX_P(X) \
(GET_CODE (X) == REG && ARM_REG_OK_FOR_BASE_P (X))
#define ARM_INDEX_REGISTER_RTX_P(X) \
(GET_CODE (X) == REG && ARM_REG_OK_FOR_INDEX_P (X))
#define ARM_GO_IF_LEGITIMATE_ADDRESS(MODE,X,WIN) \
{ \
if (arm_legitimate_address_p (MODE, X, SET, REG_STRICT_P)) \
goto WIN; \
}
#define THUMB_GO_IF_LEGITIMATE_ADDRESS(MODE,X,WIN) \
{ \
if (thumb_legitimate_address_p (MODE, X, REG_STRICT_P)) \
goto WIN; \
}
#define GO_IF_LEGITIMATE_ADDRESS(MODE, X, WIN) \
if (TARGET_ARM) \
ARM_GO_IF_LEGITIMATE_ADDRESS (MODE, X, WIN) \
else /* if (TARGET_THUMB) */ \
THUMB_GO_IF_LEGITIMATE_ADDRESS (MODE, X, WIN)
/* Try machine-dependent ways of modifying an illegitimate address
to be legitimate. If we find one, return the new, valid address. */
#define ARM_LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
do { \
X = arm_legitimize_address (X, OLDX, MODE); \
} while (0)
#define THUMB_LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
do { \
X = thumb_legitimize_address (X, OLDX, MODE); \
} while (0)
#define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
do { \
if (TARGET_ARM) \
ARM_LEGITIMIZE_ADDRESS (X, OLDX, MODE, WIN); \
else \
THUMB_LEGITIMIZE_ADDRESS (X, OLDX, MODE, WIN); \
\
if (memory_address_p (MODE, X)) \
goto WIN; \
} while (0)
/* Go to LABEL if ADDR (a legitimate address expression)
has an effect that depends on the machine mode it is used for. */
#define ARM_GO_IF_MODE_DEPENDENT_ADDRESS(ADDR, LABEL) \
{ \
if ( GET_CODE (ADDR) == PRE_DEC || GET_CODE (ADDR) == POST_DEC \
|| GET_CODE (ADDR) == PRE_INC || GET_CODE (ADDR) == POST_INC) \
goto LABEL; \
}
/* Nothing helpful to do for the Thumb */
#define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR, LABEL) \
if (TARGET_ARM) \
ARM_GO_IF_MODE_DEPENDENT_ADDRESS (ADDR, LABEL)
/* Specify the machine mode that this machine uses
for the index in the tablejump instruction. */
#define CASE_VECTOR_MODE Pmode
/* signed 'char' is most compatible, but RISC OS wants it unsigned.
unsigned is probably best, but may break some code. */
#ifndef DEFAULT_SIGNED_CHAR
#define DEFAULT_SIGNED_CHAR 0
#endif
/* Max number of bytes we can move from memory to memory
in one reasonably fast instruction. */
#define MOVE_MAX 4
#undef MOVE_RATIO
#define MOVE_RATIO (arm_tune_xscale ? 4 : 2)
/* Define if operations between registers always perform the operation
on the full register even if a narrower mode is specified. */
#define WORD_REGISTER_OPERATIONS
/* Define if loading in MODE, an integral mode narrower than BITS_PER_WORD
will either zero-extend or sign-extend. The value of this macro should
be the code that says which one of the two operations is implicitly
done, UNKNOWN if none. */
#define LOAD_EXTEND_OP(MODE) \
(TARGET_THUMB ? ZERO_EXTEND : \
((arm_arch4 || (MODE) == QImode) ? ZERO_EXTEND \
: ((BYTES_BIG_ENDIAN && (MODE) == HImode) ? SIGN_EXTEND : UNKNOWN)))
/* Nonzero if access to memory by bytes is slow and undesirable. */
#define SLOW_BYTE_ACCESS 0
#define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) 1
/* Immediate shift counts are truncated by the output routines (or was it
the assembler?). Shift counts in a register are truncated by ARM. Note
that the native compiler puts too large (> 32) immediate shift counts
into a register and shifts by the register, letting the ARM decide what
to do instead of doing that itself. */
/* This is all wrong. Defining SHIFT_COUNT_TRUNCATED tells combine that
code like (X << (Y % 32)) for register X, Y is equivalent to (X << Y).
On the arm, Y in a register is used modulo 256 for the shift. Only for
rotates is modulo 32 used. */
/* #define SHIFT_COUNT_TRUNCATED 1 */
/* All integers have the same format so truncation is easy. */
#define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
/* Calling from registers is a massive pain. */
#define NO_FUNCTION_CSE 1
/* The machine modes of pointers and functions */
#define Pmode SImode
#define FUNCTION_MODE Pmode
#define ARM_FRAME_RTX(X) \
( (X) == frame_pointer_rtx || (X) == stack_pointer_rtx \
|| (X) == arg_pointer_rtx)
/* Moves to and from memory are quite expensive */
#define MEMORY_MOVE_COST(M, CLASS, IN) \
(TARGET_ARM ? 10 : \
((GET_MODE_SIZE (M) < 4 ? 8 : 2 * GET_MODE_SIZE (M)) \
* (CLASS == LO_REGS ? 1 : 2)))
/* Try to generate sequences that don't involve branches, we can then use
conditional instructions */
#define BRANCH_COST \
(TARGET_ARM ? 4 : (optimize > 1 ? 1 : 0))
/* Position Independent Code. */
/* We decide which register to use based on the compilation options and
the assembler in use; this is more general than the APCS restriction of
using sb (r9) all the time. */
extern unsigned arm_pic_register;
/* The register number of the register used to address a table of static
data addresses in memory. */
#define PIC_OFFSET_TABLE_REGNUM arm_pic_register
/* We can't directly access anything that contains a symbol,
nor can we indirect via the constant pool. One exception is
UNSPEC_TLS, which is always PIC. */
#define LEGITIMATE_PIC_OPERAND_P(X) \
(!(symbol_mentioned_p (X) \
|| label_mentioned_p (X) \
|| (GET_CODE (X) == SYMBOL_REF \
&& CONSTANT_POOL_ADDRESS_P (X) \
&& (symbol_mentioned_p (get_pool_constant (X)) \
|| label_mentioned_p (get_pool_constant (X))))) \
|| tls_mentioned_p (X))
/* We need to know when we are making a constant pool; this determines
whether data needs to be in the GOT or can be referenced via a GOT
offset. */
extern int making_const_table;
/* Handle pragmas for compatibility with Intel's compilers. */
#define REGISTER_TARGET_PRAGMAS() do { \
c_register_pragma (0, "long_calls", arm_pr_long_calls); \
c_register_pragma (0, "no_long_calls", arm_pr_no_long_calls); \
c_register_pragma (0, "long_calls_off", arm_pr_long_calls_off); \
} while (0)
/* Condition code information. */
/* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
return the mode to be used for the comparison. */
#define SELECT_CC_MODE(OP, X, Y) arm_select_cc_mode (OP, X, Y)
#define REVERSIBLE_CC_MODE(MODE) 1
#define REVERSE_CONDITION(CODE,MODE) \
(((MODE) == CCFPmode || (MODE) == CCFPEmode) \
? reverse_condition_maybe_unordered (code) \
: reverse_condition (code))
#define CANONICALIZE_COMPARISON(CODE, OP0, OP1) \
do \
{ \
if (GET_CODE (OP1) == CONST_INT \
&& ! (const_ok_for_arm (INTVAL (OP1)) \
|| (const_ok_for_arm (- INTVAL (OP1))))) \
{ \
rtx const_op = OP1; \
CODE = arm_canonicalize_comparison ((CODE), GET_MODE (OP0), \
&const_op); \
OP1 = const_op; \
} \
} \
while (0)
/* The arm5 clz instruction returns 32. */
#define CLZ_DEFINED_VALUE_AT_ZERO(MODE, VALUE) ((VALUE) = 32, 1)
#undef ASM_APP_OFF
#define ASM_APP_OFF (TARGET_THUMB ? "\t.code\t16\n" : "")
/* Output a push or a pop instruction (only used when profiling). */
#define ASM_OUTPUT_REG_PUSH(STREAM, REGNO) \
do \
{ \
if (TARGET_ARM) \
asm_fprintf (STREAM,"\tstmfd\t%r!,{%r}\n", \
STACK_POINTER_REGNUM, REGNO); \
else \
asm_fprintf (STREAM, "\tpush {%r}\n", REGNO); \
} while (0)
#define ASM_OUTPUT_REG_POP(STREAM, REGNO) \
do \
{ \
if (TARGET_ARM) \
asm_fprintf (STREAM, "\tldmfd\t%r!,{%r}\n", \
STACK_POINTER_REGNUM, REGNO); \
else \
asm_fprintf (STREAM, "\tpop {%r}\n", REGNO); \
} while (0)
/* This is how to output a label which precedes a jumptable. Since
Thumb instructions are 2 bytes, we may need explicit alignment here. */
#undef ASM_OUTPUT_CASE_LABEL
#define ASM_OUTPUT_CASE_LABEL(FILE, PREFIX, NUM, JUMPTABLE) \
do \
{ \
if (TARGET_THUMB) \
ASM_OUTPUT_ALIGN (FILE, 2); \
(*targetm.asm_out.internal_label) (FILE, PREFIX, NUM); \
} \
while (0)
#define ARM_DECLARE_FUNCTION_NAME(STREAM, NAME, DECL) \
do \
{ \
if (TARGET_THUMB) \
{ \
if (is_called_in_ARM_mode (DECL) \
|| current_function_is_thunk) \
fprintf (STREAM, "\t.code 32\n") ; \
else \
fprintf (STREAM, "\t.code 16\n\t.thumb_func\n") ; \
} \
if (TARGET_POKE_FUNCTION_NAME) \
arm_poke_function_name (STREAM, (char *) NAME); \
} \
while (0)
/* For aliases of functions we use .thumb_set instead. */
#define ASM_OUTPUT_DEF_FROM_DECLS(FILE, DECL1, DECL2) \
do \
{ \
const char *const LABEL1 = XSTR (XEXP (DECL_RTL (decl), 0), 0); \
const char *const LABEL2 = IDENTIFIER_POINTER (DECL2); \
\
if (TARGET_THUMB && TREE_CODE (DECL1) == FUNCTION_DECL) \
{ \
fprintf (FILE, "\t.thumb_set "); \
assemble_name (FILE, LABEL1); \
fprintf (FILE, ","); \
assemble_name (FILE, LABEL2); \
fprintf (FILE, "\n"); \
} \
else \
ASM_OUTPUT_DEF (FILE, LABEL1, LABEL2); \
} \
while (0)
#ifdef HAVE_GAS_MAX_SKIP_P2ALIGN
/* To support -falign-* switches we need to use .p2align so
that alignment directives in code sections will be padded
with no-op instructions, rather than zeroes. */
#define ASM_OUTPUT_MAX_SKIP_ALIGN(FILE, LOG, MAX_SKIP) \
if ((LOG) != 0) \
{ \
if ((MAX_SKIP) == 0) \
fprintf ((FILE), "\t.p2align %d\n", (int) (LOG)); \
else \
fprintf ((FILE), "\t.p2align %d,,%d\n", \
(int) (LOG), (int) (MAX_SKIP)); \
}
#endif
/* Only perform branch elimination (by making instructions conditional) if
we're optimizing. Otherwise it's of no use anyway. */
#define FINAL_PRESCAN_INSN(INSN, OPVEC, NOPERANDS) \
if (TARGET_ARM && optimize) \
arm_final_prescan_insn (INSN); \
else if (TARGET_THUMB) \
thumb_final_prescan_insn (INSN)
#define PRINT_OPERAND_PUNCT_VALID_P(CODE) \
(CODE == '@' || CODE == '|' \
|| (TARGET_ARM && (CODE == '?')) \
|| (TARGET_THUMB && (CODE == '_')))
/* Output an operand of an instruction. */
#define PRINT_OPERAND(STREAM, X, CODE) \
arm_print_operand (STREAM, X, CODE)
#define ARM_SIGN_EXTEND(x) ((HOST_WIDE_INT) \
(HOST_BITS_PER_WIDE_INT <= 32 ? (unsigned HOST_WIDE_INT) (x) \
: ((((unsigned HOST_WIDE_INT)(x)) & (unsigned HOST_WIDE_INT) 0xffffffff) |\
((((unsigned HOST_WIDE_INT)(x)) & (unsigned HOST_WIDE_INT) 0x80000000) \
? ((~ (unsigned HOST_WIDE_INT) 0) \
& ~ (unsigned HOST_WIDE_INT) 0xffffffff) \
: 0))))
/* Output the address of an operand. */
#define ARM_PRINT_OPERAND_ADDRESS(STREAM, X) \
{ \
int is_minus = GET_CODE (X) == MINUS; \
\
if (GET_CODE (X) == REG) \
asm_fprintf (STREAM, "[%r, #0]", REGNO (X)); \
else if (GET_CODE (X) == PLUS || is_minus) \
{ \
rtx base = XEXP (X, 0); \
rtx index = XEXP (X, 1); \
HOST_WIDE_INT offset = 0; \
if (GET_CODE (base) != REG) \
{ \
/* Ensure that BASE is a register. */ \
/* (one of them must be). */ \
rtx temp = base; \
base = index; \
index = temp; \
} \
switch (GET_CODE (index)) \
{ \
case CONST_INT: \
offset = INTVAL (index); \
if (is_minus) \
offset = -offset; \
asm_fprintf (STREAM, "[%r, #%wd]", \
REGNO (base), offset); \
break; \
\
case REG: \
asm_fprintf (STREAM, "[%r, %s%r]", \
REGNO (base), is_minus ? "-" : "", \
REGNO (index)); \
break; \
\
case MULT: \
case ASHIFTRT: \
case LSHIFTRT: \
case ASHIFT: \
case ROTATERT: \
{ \
asm_fprintf (STREAM, "[%r, %s%r", \
REGNO (base), is_minus ? "-" : "", \
REGNO (XEXP (index, 0))); \
arm_print_operand (STREAM, index, 'S'); \
fputs ("]", STREAM); \
break; \
} \
\
default: \
gcc_unreachable (); \
} \
} \
else if (GET_CODE (X) == PRE_INC || GET_CODE (X) == POST_INC \
|| GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_DEC) \
{ \
extern enum machine_mode output_memory_reference_mode; \
\
gcc_assert (GET_CODE (XEXP (X, 0)) == REG); \
\
if (GET_CODE (X) == PRE_DEC || GET_CODE (X) == PRE_INC) \
asm_fprintf (STREAM, "[%r, #%s%d]!", \
REGNO (XEXP (X, 0)), \
GET_CODE (X) == PRE_DEC ? "-" : "", \
GET_MODE_SIZE (output_memory_reference_mode)); \
else \
asm_fprintf (STREAM, "[%r], #%s%d", \
REGNO (XEXP (X, 0)), \
GET_CODE (X) == POST_DEC ? "-" : "", \
GET_MODE_SIZE (output_memory_reference_mode)); \
} \
else if (GET_CODE (X) == PRE_MODIFY) \
{ \
asm_fprintf (STREAM, "[%r, ", REGNO (XEXP (X, 0))); \
if (GET_CODE (XEXP (XEXP (X, 1), 1)) == CONST_INT) \
asm_fprintf (STREAM, "#%wd]!", \
INTVAL (XEXP (XEXP (X, 1), 1))); \
else \
asm_fprintf (STREAM, "%r]!", \
REGNO (XEXP (XEXP (X, 1), 1))); \
} \
else if (GET_CODE (X) == POST_MODIFY) \
{ \
asm_fprintf (STREAM, "[%r], ", REGNO (XEXP (X, 0))); \
if (GET_CODE (XEXP (XEXP (X, 1), 1)) == CONST_INT) \
asm_fprintf (STREAM, "#%wd", \
INTVAL (XEXP (XEXP (X, 1), 1))); \
else \
asm_fprintf (STREAM, "%r", \
REGNO (XEXP (XEXP (X, 1), 1))); \
} \
else output_addr_const (STREAM, X); \
}
#define THUMB_PRINT_OPERAND_ADDRESS(STREAM, X) \
{ \
if (GET_CODE (X) == REG) \
asm_fprintf (STREAM, "[%r]", REGNO (X)); \
else if (GET_CODE (X) == POST_INC) \
asm_fprintf (STREAM, "%r!", REGNO (XEXP (X, 0))); \
else if (GET_CODE (X) == PLUS) \
{ \
gcc_assert (GET_CODE (XEXP (X, 0)) == REG); \
if (GET_CODE (XEXP (X, 1)) == CONST_INT) \
asm_fprintf (STREAM, "[%r, #%wd]", \
REGNO (XEXP (X, 0)), \
INTVAL (XEXP (X, 1))); \
else \
asm_fprintf (STREAM, "[%r, %r]", \
REGNO (XEXP (X, 0)), \
REGNO (XEXP (X, 1))); \
} \
else \
output_addr_const (STREAM, X); \
}
#define PRINT_OPERAND_ADDRESS(STREAM, X) \
if (TARGET_ARM) \
ARM_PRINT_OPERAND_ADDRESS (STREAM, X) \
else \
THUMB_PRINT_OPERAND_ADDRESS (STREAM, X)
#define OUTPUT_ADDR_CONST_EXTRA(file, x, fail) \
if (arm_output_addr_const_extra (file, x) == FALSE) \
goto fail
/* A C expression whose value is RTL representing the value of the return
address for the frame COUNT steps up from the current frame. */
#define RETURN_ADDR_RTX(COUNT, FRAME) \
arm_return_addr (COUNT, FRAME)
/* Mask of the bits in the PC that contain the real return address
when running in 26-bit mode. */
#define RETURN_ADDR_MASK26 (0x03fffffc)
/* Pick up the return address upon entry to a procedure. Used for
dwarf2 unwind information. This also enables the table driven
mechanism. */
#define INCOMING_RETURN_ADDR_RTX gen_rtx_REG (Pmode, LR_REGNUM)
#define DWARF_FRAME_RETURN_COLUMN DWARF_FRAME_REGNUM (LR_REGNUM)
/* Used to mask out junk bits from the return address, such as
processor state, interrupt status, condition codes and the like. */
#define MASK_RETURN_ADDR \
/* If we are generating code for an ARM2/ARM3 machine or for an ARM6 \
in 26 bit mode, the condition codes must be masked out of the \
return address. This does not apply to ARM6 and later processors \
when running in 32 bit mode. */ \
((arm_arch4 || TARGET_THUMB) \
? (gen_int_mode ((unsigned long)0xffffffff, Pmode)) \
: arm_gen_return_addr_mask ())
enum arm_builtins
{
ARM_BUILTIN_GETWCX,
ARM_BUILTIN_SETWCX,
ARM_BUILTIN_WZERO,
ARM_BUILTIN_WAVG2BR,
ARM_BUILTIN_WAVG2HR,
ARM_BUILTIN_WAVG2B,
ARM_BUILTIN_WAVG2H,
ARM_BUILTIN_WACCB,
ARM_BUILTIN_WACCH,
ARM_BUILTIN_WACCW,
ARM_BUILTIN_WMACS,
ARM_BUILTIN_WMACSZ,
ARM_BUILTIN_WMACU,
ARM_BUILTIN_WMACUZ,
ARM_BUILTIN_WSADB,
ARM_BUILTIN_WSADBZ,
ARM_BUILTIN_WSADH,
ARM_BUILTIN_WSADHZ,
ARM_BUILTIN_WALIGN,
ARM_BUILTIN_TMIA,
ARM_BUILTIN_TMIAPH,
ARM_BUILTIN_TMIABB,
ARM_BUILTIN_TMIABT,
ARM_BUILTIN_TMIATB,
ARM_BUILTIN_TMIATT,
ARM_BUILTIN_TMOVMSKB,
ARM_BUILTIN_TMOVMSKH,
ARM_BUILTIN_TMOVMSKW,
ARM_BUILTIN_TBCSTB,
ARM_BUILTIN_TBCSTH,
ARM_BUILTIN_TBCSTW,
ARM_BUILTIN_WMADDS,
ARM_BUILTIN_WMADDU,
ARM_BUILTIN_WPACKHSS,
ARM_BUILTIN_WPACKWSS,
ARM_BUILTIN_WPACKDSS,
ARM_BUILTIN_WPACKHUS,
ARM_BUILTIN_WPACKWUS,
ARM_BUILTIN_WPACKDUS,
ARM_BUILTIN_WADDB,
ARM_BUILTIN_WADDH,
ARM_BUILTIN_WADDW,
ARM_BUILTIN_WADDSSB,
ARM_BUILTIN_WADDSSH,
ARM_BUILTIN_WADDSSW,
ARM_BUILTIN_WADDUSB,
ARM_BUILTIN_WADDUSH,
ARM_BUILTIN_WADDUSW,
ARM_BUILTIN_WSUBB,
ARM_BUILTIN_WSUBH,
ARM_BUILTIN_WSUBW,
ARM_BUILTIN_WSUBSSB,
ARM_BUILTIN_WSUBSSH,
ARM_BUILTIN_WSUBSSW,
ARM_BUILTIN_WSUBUSB,
ARM_BUILTIN_WSUBUSH,
ARM_BUILTIN_WSUBUSW,
ARM_BUILTIN_WAND,
ARM_BUILTIN_WANDN,
ARM_BUILTIN_WOR,
ARM_BUILTIN_WXOR,
ARM_BUILTIN_WCMPEQB,
ARM_BUILTIN_WCMPEQH,
ARM_BUILTIN_WCMPEQW,
ARM_BUILTIN_WCMPGTUB,
ARM_BUILTIN_WCMPGTUH,
ARM_BUILTIN_WCMPGTUW,
ARM_BUILTIN_WCMPGTSB,
ARM_BUILTIN_WCMPGTSH,
ARM_BUILTIN_WCMPGTSW,
ARM_BUILTIN_TEXTRMSB,
ARM_BUILTIN_TEXTRMSH,
ARM_BUILTIN_TEXTRMSW,
ARM_BUILTIN_TEXTRMUB,
ARM_BUILTIN_TEXTRMUH,
ARM_BUILTIN_TEXTRMUW,
ARM_BUILTIN_TINSRB,
ARM_BUILTIN_TINSRH,
ARM_BUILTIN_TINSRW,
ARM_BUILTIN_WMAXSW,
ARM_BUILTIN_WMAXSH,
ARM_BUILTIN_WMAXSB,
ARM_BUILTIN_WMAXUW,
ARM_BUILTIN_WMAXUH,
ARM_BUILTIN_WMAXUB,
ARM_BUILTIN_WMINSW,
ARM_BUILTIN_WMINSH,
ARM_BUILTIN_WMINSB,
ARM_BUILTIN_WMINUW,
ARM_BUILTIN_WMINUH,
ARM_BUILTIN_WMINUB,
ARM_BUILTIN_WMULUM,
ARM_BUILTIN_WMULSM,
ARM_BUILTIN_WMULUL,
ARM_BUILTIN_PSADBH,
ARM_BUILTIN_WSHUFH,
ARM_BUILTIN_WSLLH,
ARM_BUILTIN_WSLLW,
ARM_BUILTIN_WSLLD,
ARM_BUILTIN_WSRAH,
ARM_BUILTIN_WSRAW,
ARM_BUILTIN_WSRAD,
ARM_BUILTIN_WSRLH,
ARM_BUILTIN_WSRLW,
ARM_BUILTIN_WSRLD,
ARM_BUILTIN_WRORH,
ARM_BUILTIN_WRORW,
ARM_BUILTIN_WRORD,
ARM_BUILTIN_WSLLHI,
ARM_BUILTIN_WSLLWI,
ARM_BUILTIN_WSLLDI,
ARM_BUILTIN_WSRAHI,
ARM_BUILTIN_WSRAWI,
ARM_BUILTIN_WSRADI,
ARM_BUILTIN_WSRLHI,
ARM_BUILTIN_WSRLWI,
ARM_BUILTIN_WSRLDI,
ARM_BUILTIN_WRORHI,
ARM_BUILTIN_WRORWI,
ARM_BUILTIN_WRORDI,
ARM_BUILTIN_WUNPCKIHB,
ARM_BUILTIN_WUNPCKIHH,
ARM_BUILTIN_WUNPCKIHW,
ARM_BUILTIN_WUNPCKILB,
ARM_BUILTIN_WUNPCKILH,
ARM_BUILTIN_WUNPCKILW,
ARM_BUILTIN_WUNPCKEHSB,
ARM_BUILTIN_WUNPCKEHSH,
ARM_BUILTIN_WUNPCKEHSW,
ARM_BUILTIN_WUNPCKEHUB,
ARM_BUILTIN_WUNPCKEHUH,
ARM_BUILTIN_WUNPCKEHUW,
ARM_BUILTIN_WUNPCKELSB,
ARM_BUILTIN_WUNPCKELSH,
ARM_BUILTIN_WUNPCKELSW,
ARM_BUILTIN_WUNPCKELUB,
ARM_BUILTIN_WUNPCKELUH,
ARM_BUILTIN_WUNPCKELUW,
ARM_BUILTIN_THREAD_POINTER,
ARM_BUILTIN_MAX
};
#endif /* ! GCC_ARM_H */
``` |
```html
{% extends 'account/base.html' %}
{% load helpers %}
{% load form_helpers %}
{% load i18n %}
{% block title %}{% trans "User Preferences" %}{% endblock %}
{% block content %}
<form method="post" action="" class="object-edit" hx-disable="true" id="preferences-update">
{% csrf_token %}
{# Built-in preferences #}
{% for fieldset in form.fieldsets %}
{% render_fieldset form fieldset %}
{% endfor %}
{# Plugin preferences #}
{% with plugin_fields=form.plugin_fields %}
{% if plugin_fields %}
<div class="field-group my-5">
<div class="row">
<h5 class="col-9 offset-3">{% trans "Plugins" %}</h5>
</div>
{% for name in plugin_fields %}
{% render_field form|getfield:name %}
{% endfor %}
</div>
{% endif %}
{% endwith %}
{# Table configurations #}
<div class="field-group my-5">
<div class="row">
<h5 class="col-9 offset-3">{% trans "Table Configurations" %}</h5>
</div>
<div class="row">
{% if request.user.config.data.tables %}
<label class="col-sm-3 col-form-label text-lg-end">
{% trans "Clear table preferences" %}
</label>
<div class="col-sm-9">
<div class="card">
<table class="table table-hover object-list">
<thead>
<tr>
<th>
<input type="checkbox" class="toggle form-check-input" title="{% trans "Toggle All" %}">
</th>
<th>{% trans "Table" %}</th>
<th>{% trans "Ordering" %}</th>
<th>{% trans "Columns" %}</th>
</tr>
</thead>
<tbody>
{% for table, prefs in request.user.config.data.tables.items %}
<tr>
<td>
<input type="checkbox" name="pk" value="tables.{{ table }}" class="form-check-input" />
</td>
<td>{{ table }}</td>
<td>{{ prefs.ordering|join:", "|placeholder }}</td>
<td>{{ prefs.columns|join:", "|placeholder }}</td>
</tr>
{% endfor %}
</tbody>
</table>
</div>
</div>
{% else %}
<div class="col-9 offset-3">
<p class="text-muted">{% trans "None found" %}</p>
</div>
{% endif %}
</div>
</div>
<div class="text-end my-3">
<a href="{% url 'account:preferences' %}" class="btn btn-outline-secondary">{% trans "Cancel" %}</a>
<button type="submit" name="_update" class="btn btn-primary">{% trans "Save" %}</button>
</div>
</form>
{% endblock %}
``` |
Ab Bad (, also Romanized as Āb Bād; also known as Āb Bār) is a village in Hur Rural District, in the Central District of Faryab County, Kerman Province, Iran. At the 2006 census, its population was 219, in 52 families.
References
Populated places in Faryab County |
The 2013 Republican National Committee (RNC) chairmanship election was held on January 25, 2013. Then-incumbent RNC Chairman Reince Priebus won re-election with near unanimity in the party's 2013 meeting in Charlotte, North Carolina.
Candidates
Reince Priebus, then-incumbent RNC Chairman
Mark Willis, National Committeeman from Maine
References
National Committee
Republican National Committee Chairmanship Election, 2013
Republican Party (United States) leadership elections
Republican National Committee chairmanship election |
Radio Television of Kosovo (; ; RTK) is the public service broadcaster in Kosovo. RTK operates two radio services broadcasting a diverse programming of news and entertainment and four 24-hour television services broadcasting on terrestrial and satellite networks.
History
RTK replaced (The Radio Television of Prishtina, RTP), which ceased to function in July 1990. After UNMIK took over the administration of Kosovo in June 1999 and re-employed former RTP staffs, RTK began broadcasting in September 1999 via analog satellite in PAL and SECAM television broadcast standards with a daily two-hour transmission, expanding to four hours per day in November 2000, with programming mainly in Albanian and once-a-day news edition in Serbian and Turkish. The following July, it expanded to seven hours a day and began offering programming in Bosnian as well.
In 2001, RTK was established as an independent public service broadcaster by a UNMIK broadcasting regulation. The station was initially managed by the European Broadcasting Union to permit time for a non-political Board of Directors to be established. This was in place and the station was independent of the EBU by the end of the year. In January 2002, an office was opened in Tirana, with a website launching in July. A second office was opened in Tetovo in November 2002.
In 2002, at which time it was broadcasting 15 hours a day, 35% of the station's broadcasts were produced externally, with the bulk of programming local. It included news and business coverage as well as farming information. Broadcasting remained multilingual, with programming in another language (the Romani language magazine “Yekhipe") beginning in September 2003. On 22 December of that year, the station began broadcasting 24 hours a day. Also in 2002, RTK began hosting awards, with the best news moderator being honored by the "Drita Germizaj" award and the best cameraman by the "Rudolf Sopi" award.
RTK's radio transmission began with the October 1999 acquisition of the multilingual public radio station "Radio Prishtina", which became "Radio Kosovo". In 2000, it acquired the multi-ethnic UN youth radio station Radio Blue Sky.
In 2013, RTK introduced a new logo and a newly corporate identity for the first time of 14 years since 1999. By that, the grey-coloured 1-numeral along with the red letter R, the white letter T, and the yellow letter K are all replaced by something brand new that is the RTK wordmark which is coloured blue, but it has the letter K being put inside a half square. At the same time, RTK's TV services were expanded to include a channel called RTK 2, which is intended to focus on minorities, and with it, all minority language programming were moved from RTK 1 to RTK 2.
By 2014, RTK saw the launch of two new stations such as RTK 3 which is a news channel and RTK 4 which is an arts and documentary channel.
Journalists at RTK have repeatedly protested in 2015 against political interference, up to asking for the dismissal of chief editors for obstruction and internal censorship.
Management
RTK is regulated by the Law on Public Broadcasting. Its financing was originally guaranteed by a license fee paid over electricity bill, until the Constitutional Court declared that it was not due and shifted RTK's budget over state subsidy (0.7% of Kosovo's budget). The change raised concerns for the preservation of RTK's independence. The legal requirement for RTK to plan an end to the transitional state budget funding has not been enacted.
RTK has been criticised for lack of investigative journalism and political bias, e.g. in the extensive coverage of the ruling political party (including the annual meeting of the ruling Democratic Party of Kosovo) as opposed to the short and misleading coverage of opposition Vetëvendosje 2012 protests, which was deemed "a major signal of state financing putting the editorial independence of public television at risk" (IREX, 2013b). Moreover, RTK coverage only reaches 62.7% of Kosovo's territory
RTK Board members are elected by the Parliament by majority vote, thus entrusting their appointment to the majority parties. Political pressures aside, RTK maintains an untapped potential thanks to good equipment and professional editors and journalists.
See also
List of radio stations in Kosovo
Television in Kosovo
Notes
References
External links
News about Radio Television of Kosovo
Television stations in Kosovo
Television stations in Serbia
Radio stations in Kosovo
Radio stations in Serbia
Multilingual broadcasters
Television channels and stations established in 1999
1999 establishments in Kosovo |
Gilbert Beebe (1800–1881) was an American Baptist minister (of the Old School, Particular or often referred to as the Primitive Baptist Persuasion); a printer and editor, (founded the Signs of the Times periodical) and was, for 35 years, Pastor of the New Vernon Primitive Baptist Church of New York. Through his periodical, the SIGNS OF THE TIMES, 1832-2010, he became the leading voice of the Primitive Baptists in the United States.
Biography
Gilbert Beebe, (according to his brief autobiography, as published in the April, 1876 Edition of the Signs of the Times), was born in Norwich, Connecticut, on November 25, 1800. He joined the Baptist Church at Norwich in 1811, and was baptized by Elder John Stipp. In 1816 he moved to New York City and joined Ebenezer Baptist Church, where he was called upon to exercise his gift of Preaching the Gospel. He was finally licensed to preach the Gospel in 1818 and spent several years traveling to various States as an itinerant preacher, supplying the Third Baptist Church, Baltimore, Maryland for three or four months in about 1821-22. In February, 1823, he was married in the City of New York, to Phebe Ann Cunningham and in the same year was ordained pastor of the Baptist Church at Ramapo, New York, and continued there until May, 1826. He was then called to the pastorate of the Baptist Church at New Vernon, New York, becoming only the second pastor of the church since its constitution in 1786. This, and the Middletown and Wallkill Church, was to be the scene of his labors except for three years in Alexandria, Virginia, also serving the Broad Run, Virginia, Church and Shiloh Church in Washington, D.C. He continued, however, during this time to go to New Vernon which he served until his death in 1881.
According to the 1870 Census, (Middletown, New York), he was 69 and earning $35,000 a year, (from his Printing Business), which compared with a physician (who on the average made about $8000.00 per year), was a considerable amount.
Sylvester Hassell in his History of the Church of God, on page 822, had this to say. “Elder Gilbert Beebe, of Middletown, N.Y., has had few equals, since the days of the apostles, in natural and spiritual abilities, in bold and faithful defense, both by tongue and pen, of great fundamental truths of the Scriptures, and in the extensiveness of his ministerial labors. During his long ministry of sixty-three years he is believed to have preached about 10,000 sermons and traveled about 200,000 miles – sent forth, not in the manner of the nineteenth century, by “Missionary Funds,” but in the manner of the first century, by the God of Grace and Providence.”
Death
His obituary which appeared in the May 3, 1881 edition of the New York Times, had this to say: “When the Division in the Baptist Churches took place, nearly 50 years ago, (written in 1881), and the Fullerites (named after Andrew Fuller) or New School Baptist, separated, Elder Beebe remained with the Primitive Body, and became its leading advocate ... as a Preacher he was remarkable for power, having a profound knowledge of the Scriptures, and was a vigorous writer ... he retained his physical powers and mental vigor to the last, preaching the day before his death. His wife and several children survive him.”
Writings
Most of his extensive writings are as applicable now as when they were written. These were confined to his periodical, THE SIGNS OF THE TIMES, to which he, in every issue, contributed an editorial article, from its inception in 1832 to the time of his death in 1881. The SIGNS OF THE TIMES continued well after his departure, and was still being published on a monthly basis up until sometime in 2010. A Compilation of his Editorial Writings, as copied from the SIGNS OF THE TIMES, were published in 1868 (Volume 1) and 1874 (Volume 2) and these were reprinted along with 5 Additional Volumes (between the years 1984-2000) by Welsh Tract Publications, located in Salisbury, Maryland. A Hymn Book, which he compiled, entitled THE BAPTIST HYMN BOOK, was published in 1873. Its title page sets forth the following description: The Baptist Hymn Book Comprising a Large and Choice Collection of Psalms, Hymns and Spiritual Songs, adapted to the Faith and Order of the Old School or Primitive Baptists in the United States of America, carefully selected from various Authors, and published by Gilbert Beebe. This also was republished in 1991 by Welsh Tract Publications, Salisbury, Maryland.
References
Baptist ministers from the United States
Religious leaders from Connecticut
1800s births
1881 deaths |
Aylton Thomaz (December 8, 1934, Rio de Janeiro – February 10, 2009, Rio de Janeiro) was a Brazilian comics artist and painter. He began his career at EBAL publishing house in 1953 drawing comics literary adaptations. He also worked at La Selva publishing house, with horror stories and actors Oscarito and Grande Otelo's comic books. From the 1970s onwards, he began to devote himself mainly to painting, having held several exhibitions over the years. In 1991, he was awarded with the Prêmio Angelo Agostini for Master of National Comics, an award that aims to honor artists who have dedicated themselves to Brazilian comics for at least 25 years.
References
Brazilian comics artists
Prêmio Angelo Agostini winners |
```xml
import { firstValueFrom, fromEvent, filter, map, takeUntil, defaultIfEmpty, Subject } from "rxjs";
import { Jsonify } from "type-fest";
import { BulkEncryptService } from "../../abstractions/bulk-encrypt.service";
import { CryptoFunctionService } from "../../abstractions/crypto-function.service";
import { LogService } from "../../abstractions/log.service";
import { Decryptable } from "../../interfaces/decryptable.interface";
import { InitializerMetadata } from "../../interfaces/initializer-metadata.interface";
import { Utils } from "../../misc/utils";
import { SymmetricCryptoKey } from "../../models/domain/symmetric-crypto-key";
import { getClassInitializer } from "./get-class-initializer";
// TTL (time to live) is not strictly required but avoids tying up memory resources if inactive
const workerTTL = 60000; // 1 minute
const maxWorkers = 8;
const minNumberOfItemsForMultithreading = 400;
export class BulkEncryptServiceImplementation implements BulkEncryptService {
private workers: Worker[] = [];
private timeout: any;
private clear$ = new Subject<void>();
constructor(
protected cryptoFunctionService: CryptoFunctionService,
protected logService: LogService,
) {}
/**
* Decrypts items using a web worker if the environment supports it.
* Will fall back to the main thread if the window object is not available.
*/
async decryptItems<T extends InitializerMetadata>(
items: Decryptable<T>[],
key: SymmetricCryptoKey,
): Promise<T[]> {
if (key == null) {
throw new Error("No encryption key provided.");
}
if (items == null || items.length < 1) {
return [];
}
if (typeof window === "undefined") {
this.logService.info("Window not available in BulkEncryptService, decrypting sequentially");
const results = [];
for (let i = 0; i < items.length; i++) {
results.push(await items[i].decrypt(key));
}
return results;
}
const decryptedItems = await this.getDecryptedItemsFromWorkers(items, key);
return decryptedItems;
}
/**
* Sends items to a set of web workers to decrypt them. This utilizes multiple workers to decrypt items
* faster without interrupting other operations (e.g. updating UI).
*/
private async getDecryptedItemsFromWorkers<T extends InitializerMetadata>(
items: Decryptable<T>[],
key: SymmetricCryptoKey,
): Promise<T[]> {
if (items == null || items.length < 1) {
return [];
}
this.clearTimeout();
const hardwareConcurrency = navigator.hardwareConcurrency || 1;
let numberOfWorkers = Math.min(hardwareConcurrency, maxWorkers);
if (items.length < minNumberOfItemsForMultithreading) {
numberOfWorkers = 1;
}
this.logService.info(
`Starting decryption using multithreading with ${numberOfWorkers} workers for ${items.length} items`,
);
if (this.workers.length == 0) {
for (let i = 0; i < numberOfWorkers; i++) {
this.workers.push(
new Worker(
new URL(
/* webpackChunkName: 'encrypt-worker' */
"@bitwarden/common/platform/services/cryptography/encrypt.worker.ts",
import.meta.url,
),
),
);
}
}
const itemsPerWorker = Math.floor(items.length / this.workers.length);
const results = [];
for (const [i, worker] of this.workers.entries()) {
const start = i * itemsPerWorker;
const end = start + itemsPerWorker;
const itemsForWorker = items.slice(start, end);
// push the remaining items to the last worker
if (i == this.workers.length - 1) {
itemsForWorker.push(...items.slice(end));
}
const request = {
id: Utils.newGuid(),
items: itemsForWorker,
key: key,
};
worker.postMessage(JSON.stringify(request));
results.push(
firstValueFrom(
fromEvent(worker, "message").pipe(
filter((response: MessageEvent) => response.data?.id === request.id),
map((response) => JSON.parse(response.data.items)),
map((items) =>
items.map((jsonItem: Jsonify<T>) => {
const initializer = getClassInitializer<T>(jsonItem.initializerKey);
return initializer(jsonItem);
}),
),
takeUntil(this.clear$),
defaultIfEmpty([]),
),
),
);
}
const decryptedItems = (await Promise.all(results)).flat();
this.logService.info(
`Finished decrypting ${decryptedItems.length} items using ${numberOfWorkers} workers`,
);
this.restartTimeout();
return decryptedItems;
}
private clear() {
this.clear$.next();
for (const worker of this.workers) {
worker.terminate();
}
this.workers = [];
this.clearTimeout();
}
private restartTimeout() {
this.clearTimeout();
this.timeout = setTimeout(() => this.clear(), workerTTL);
}
private clearTimeout() {
if (this.timeout != null) {
clearTimeout(this.timeout);
}
}
}
``` |
Lasthenes () was a strategos (general) of the ancient Cretan city of Kydonia when the Romans attacked the city in 69 BC. In this era Kydonia had protected pirates and incurred the anger of the Roman Senate. When the Romans defeated Kydonia, Lasthenes' fellow strategos Panares surrendered the city, whilst Lasthenes fled to Knossos.
See also
Knossos
Line notes
References
Appian of Alexandria and Horace White, The Roman History of Appian of Alexandria, 1899, The MacMillan Company
C. Michael Hogan, Cydonia, The Modern Antiquarian, January 23, 2008
Theodor Mommsen, The History of Rome, Translator: William Purdie Dickson, 1894
1st-century BC Greek people
Ancient Cretan generals
Ancient Cydonians
Roman Crete
Ther is another Lasthenes, who is philosopher and friend of Dio Chrysostomus. He was a citizen of Apameia Myrleia. (Lucius Flavius Philostratos, Vita Apollonius (Life of Apollonius of Tyana), V.38) |
Satyapal (11 May 1885 — 18 April 1954) was a physician and political leader in Punjab, British India, who was arrested along with Saifuddin Kitchlew on 10 April 1919, three days before the Jallianwala Bagh massacre.
Early life
Satyapal was educated at Peterhouse, Cambridge, where he was a friend of Jawaharlal Nehru. On 17 September 1915, during the First World War, he received a temporary King's Commission as a lieutenant in the Indian Medical Service, serving with distinction. For unspecified reasons, he relinquished his commission with effect from 16 September 1916, and upon return to India and following the Rowlatt Act he became active in the movement of non-cooperation and non-violent resistance to British rule.
He was married to Gian Devi and had a successful practice in the old part of the city of Amritsar.
Arrest
On the orders of Michael O’Dwyer the CID had kept close surveillance on Kitchlew and Satypal from mid-March 1919. Again, following the orders of O'Dwyer, they were summoned to Miles Irving, the Deputy Commissioner's house in the Civil Lines on 10 April 1919. Satypal recalled "I did not at all attach much importance to the matter and went about my daily rounds as usual", not having thought of it as great importance. They were both already barred from political activities and attended that day with their friends Hans Raj and Jai Ram Singh. Kitchlew arrived shortly before Satypal and after a few minutes of waiting, were called in and given The Defence of India Orders with the request for both to leave Amritsar immediately. Miles Irving recounted the secret nature of the operation as he "decided that they would be 30 miles on their way to Dharamsala before any one knew about it". After being given permission to write to their families, Satyapal and Kitchlew were escorted by four soldiers disguised in hunting gear. Hans Raj and Jai Ram Singh were kept waiting on Irving's veranda in case the news of the arrest spread before Kitchlew and Satypal were far away enough. They waited an hour before Irving passed to them the letters to their families. Satypal recounted "there was a military escort with guns in each car" and "the cars were driven at high speed and we did not halt till we got to the Nurpur Dak Bungalow", which was 50 miles away from Amritsar. They reached Dharamasala, at the foot of the Himalayas, at 8 pm that evening, and were kept under house arrest.
As the news of the arrest spread, supporters began to gather near Irving's home and what initially appeared a peaceful attempt to make enquiries ended up in a violent clash. On 13 April 1919, protesting over the arrest, a meeting was called to take place at Jallianwala Bagh.
In June 1919 at the trial of the 'Amritsar conspiracy case at Lahore', Satyapal was convicted with 14 others and sentenced to two years imprisonment, following the statement of Hans Raj, who attended the trial as an approver.
Later life
Following the outbreak of the Second World War, Satyapal rejoined the Indian Medical Service, receiving an emergency commission as a captain on 8 December 1941 (with ante-date seniority from 8 December 1936). After Indian independence, he remained active in politics and in 1952 was successful in contesting the elections to the Punjab Vidhan Sabha. He died at Shimla in Himachal Pradesh on 18 April 1954.
References
Citations
Goyal, Shailja, Dr. Satyapal, the hero of freedom movement in the Punjab. PBG Publications (2004)
Anand, Anita. (2019) The Patient Assassin: A true tale of massacre, revenge, and India's quest for independence. New York: Scribner.
Wagner, Kim A. (2019) Amritsar 1919: An Empire of Fear and the Making of a Massacre. New Haven: Yale University Press.
Further reading
Open Rebellion in the Punjab: (with Special Reference to Amritsar). Kapil Deva Malaviya. Abhudaya Press, 1919
M. K. Gandhi, Non-Violent Resistance Dover Publications (2001)
M. K. Gandhi Autobiography: The Story of My Experiments with Truth. Dover Publications (1985).
Punjabi Hindus
Punjabi people
Indian independence activists from Punjab, India
Indian National Congress politicians from Punjab, India
Politicians from Amritsar
20th-century Indian medical doctors
Indian Medical Service officers
British Indian Army officers
Indian Army personnel of World War II
1885 births
Year of death missing |
```ruby
# frozen_string_literal: true
module Decidim
module Assemblies
class ContentBlockCell < Decidim::Admin::ContentBlockCell
delegate :scoped_resource, to: :controller
def edit_content_block_path
decidim_assemblies.edit_assembly_landing_page_content_block_path(scoped_resource, model)
end
def content_block_path
decidim_assemblies.assembly_landing_page_content_block_path(scoped_resource, model)
end
def decidim_assemblies
Decidim::Assemblies::AdminEngine.routes.url_helpers
end
end
end
end
``` |
```swift
/**
* Question Link: path_to_url
* Primary idea: Scan the array and compare each element with previous one and generate corresponding ranges
*
* Time Complexity: O(n), Space Complexity: O(1)
*
*/
class MissingRanges {
func findMissingRanges(_ nums: [Int], _ lower: Int, _ upper: Int) -> [String] {
var res = [String]()
guard !nums.isEmpty else {
addRange(&res, lower, upper)
return res
}
addRange(&res, lower, nums[0] - 1)
for i in 1..<nums.count {
addRange(&res, nums[i - 1] + 1, nums[i] - 1)
}
addRange(&res, nums[nums.count - 1] + 1, upper)
return res
}
private func addRange(_ res: inout [String], _ start: Int, _ end: Int) {
if start > end {
return
} else if start == end {
res.append("\(end)")
} else {
res.append("\(start)->\(end)")
}
}
}
``` |
Espen Søgård (born 10 October 1979) is a Norwegian former footballer who played as a midfielder for Lillestrøm during most of his career.
Søgård have played most of his career at Lillestrøm, but had a short spell at Start from the summer of 2011 to the summer of 2012. Before transferring to Lillestrøm in 1997 he played youth football for Fet in Norway. He has been capped 9 times for the Norwegian under-21 team, and twice by the senior national team.
After the 2012 season he stepped down from professional football and rejoined Fet.
Career statistics
References
Club bio
1979 births
Living people
People from Fet
Norwegian men's footballers
Norway men's international footballers
Lillestrøm SK players
IK Start players
Eliteserien players
Men's association football midfielders
Footballers from Viken (county) |
Jeni Bojilova-Pateva, also transliterated as Zheni Bozhilova-Pateva, (; 1 December 1878 – 17 June 1955) was a Bulgarian teacher, writer, women's rights activist, and suffragist, who became involved in the pacifist movement. After graduating with teaching credentials in 1893, she began her profession, but was barred from teaching when a law was passed in 1898 that limited the rights of married women. She turned to activism and journalism, becoming involved in the international women's movement that year. A highly prominent feminist, she was one of the founders of the Bulgarian Women's Union in 1901. During 1905 in Burgas, she founded "Self-Awareness", a feminist group, and served as its chair for 25 years. As editor of the Women's Voice she published articles on developments in the women's movement in Bulgaria and abroad, as well as about issues affecting women. Throughout her career, she published over 500 articles and books.
A believer in women's suffrage, Pateva participated in numerous international conferences and frequently served as speaker at congresses. Her book, В помощ на жената (To Help Women), written in 1908, became foundational to the ideology of the Bulgarian Women's Union, laying out reforms needed to adapt policies affecting women and children. When the Women's International League for Peace and Freedom was founded in 1915, she became a prominent member of the pacifist movement. In 1944, when state socialism was established in Bulgaria, women gained the right to vote, but the league was among many grassroots organizations that were abolished. When Pateva asked for permission to open a cultural and educational society in 1945, she was branded an enemy of the people. Two years later, her protests over the death penalty and the sentencing of Nikola Petkov resulted in her home and her son's factory being nationalized, leaving them penniless.
Early life
Dzhenda Bozhilova, as she was baptized, was born on 1 December 1878, in Gradets, in the Principality of Bulgaria to Genka Andreeva and Dimov Bozhil. Her father, a veteran of the Russo-Turkish War, was a tailor and cattle breeder, who advocated strongly for education. Bozhilova completed primary school in Gradets and then attended secondary school in Sliven. She went on to further her education at the , being graduated in 1893 with teaching qualifications.
Career
Teaching
The following year, Bozhilova began her teaching career at a school in Karnobat. In 1896, she moved to Razgrad, taking a post at the girls school. In 1897, she married , who was from her hometown and also a teacher. As they had an egalitarian marriage, Pateva and Patev agreed to help each other in their goals to attain higher education. He went abroad to study in Geneva and returned in 1899. While he was away, Pateva supported him from her earnings. When Patev returned with a doctorate in law, he supported Pateva, as she went abroad to study in 1901. She began her studies in Berlin and Jena and, in 1902, took courses in Paris, studying philosophy and sociology, as well as German, French, and Russian. Although she did not complete a degree, Pateva returned to Bulgaria in 1903, influenced by the international women's movement while away. The couple settled in Burgas and had three children during the next 16 years: Luben (known as "Leo", born 1904), Bozhan (born 1905), and Lilian (known as "Lily", born 1913).
Women's rights activism (1898–1908)
Pateva began her political involvement in public affairs when a law was passed by the Bulgarian National Assembly on 18 December 1898, which barred married women from engaging in the teaching profession. In protest, she wrote Отворено Писмо (Open Letter), addressing it to all the teachers in the principality and advising them to oppose the law's legitimacy. To unite women behind the cause and promote them working on other issues facing women and children, Pateva, along with Anna Karima and Julia Malinova, began organizing and, in 1901, co-founded the umbrella organization, the Bulgarian Women's Union, the first national women's organization in Bulgaria. Karima was the first chair of the organization and Pateva served on the board of directors. Despite pressure from women's groups and teachers, the law remained in effect until 1904.
In 1901, Pateva began lecturing as an orator for the international women's movement for the group, Милосърдие (Charity), in Burgas and, in 1902, went to Yambol to help with the reorganization of the Развитие (Development) group. In 1903, she was elected chair of Милосърдие, but because members of the association did not want to join the Bulgarian Women's Union or expand their focus from charitable deeds, she resigned and withdrew from the organization. That year, the Women's Union faced a crisis when Karima and Malinova became embroiled in a serious dispute that eventually split the organization. Their position was that all women had similar concerns and that the goals of the union should represent them without regard to class or party. The other faction, led by Blagoeva and Konova, took the view that the union should be proletarianized and membership should be drawn from the working class. Pateva wrote a book about the problems, Разногласия в Българския женски съюз (Disagreement in the Bulgarian Women's Union), which was published in 1903. She also began writing for Женски глас (Women's Voice), a newspaper for which in 1904, she became an editor.
Along with Penka Russeva-Belmustakova and Yordanka Guszova, in 1904, Pateva founded an educational group for women to attend language and literacy courses and to organize programs to improve access to professional and university study for women. They formalized the organization as, Самосъзнание (Self-Awareness), the following year, as an educational and charitable society and aligned it under the Bulgarian Women's Union, with Pateva designated as its chair. In the spring of 1905, she attended the Women's Union's Congress, held in Sofia and was tasked with using her position as editor of Женски глас to publish articles about the umbrella organization, soon to become their official media outlet. From 1907, Самосъзнание began offering general education courses, classes on tailoring and other trades, and running a sewing class for the Women's Labor Office. The year 1907 also saw women's suffrage become one of the official aims of the Bulgarian Women's Union.
In 1908, Pateva represented Bulgarian Women's Union at the Fourth Congress of the International Woman Suffrage Alliance (IWSA) in Amsterdam. She strongly petitioned for the acceptance of the Women's Union as a member of the IWSA, gaining approval from those who voted on it. In 1909, she published an article in the newspaper Ден (Day) arguing for women's emancipation and the next year, when the editorial offices of Женски глас moved to Sofia, she retained her position as editor. Also in 1908, Pateva published a second book, В помощ на жената (To Help Women), in which she called for a broad range of reforms. She recommended laws for the protection of children and women laborers, as well as maternity guidelines; for the creation of social institutions by the state that provided food, shelter, and nursery facilities for children of working women; policies against alcohol abuse and prostitution; for the protection of illegitimate children; and for social welfare laws that protected orphans, the infirm, and the unemployed. She insisted that women should be allowed an education and participation in public life so that they could take care of themselves and their families, have professions, and gain independence and self-esteem as citizens. The book became the backbone of the Bulgarian Women's Union's ideology.
Women's rights and peace activism (1911–1924)
Pateva spoke at the Sixth Congress of the IWSA that was hosted in Stockholm in 1911 and she wrote a report on the proceedings for the newspaper Утро (Utro), arguing for women's full equality in all areas of public life. During the Balkan Wars (1912–1913) she published Апел към балканските жени (Appeal to the Balkan Women), urging women to try to achieve peace. At the start of World War I, Pateva initiated programs to support prisoners of war and their families, including a movement to sew underwear for soldiers. Even though the activities of the Women's Union were suspended during most of the conflict, she traveled throughout Europe participating in women's conferences and sharing her vision of humanism and non-violence, arguing for women's participation in negotiating world peace. She spoke at the Special International Congress of Women held in 1915 in The Hague, in which the Women's International League for Peace and Freedom (WILPF) was founded, urging disarmament and presenting a plan for reconstruction of war-ravaged nations. Returning to Bulgaria, in 1918, Pateva founded the national branch of WILPF in Burgas, and in the May, organized a conference together with Malinova and Victoria Angelova to reactivate the Bulgarian Women's Union. The following year, along with other members of the group, she wrote a protest letter to American President Woodrow Wilson calling for the lifting of the isolation imposed on the Central Powers by the Treaty of Neuilly-sur-Seine.
As an official representative of the Government of Aleksandar Stamboliyski, Pateva took part in the International Council of Women (ICW)'s congress held in Kristiania, Norway in 1920, presenting in French, her paper Положението на жената и детето в България (The Situation of Woman and Child in Bulgaria). In 1922, she attended the Special Congress of the ICW held in The Hague, making a speech about the perils of war and reiterating the need for total disarmament and cooperation among people to develop a culture of brotherhood, freedom, and self-determination. She made a statement about the political rights of women at the Ninth Congress of the IWSA that was hosted in Rome during 1923. That year, when martial law was declared in response to a coup d'état in Bulgaria and the legislature passed a law in favor of capital punishment, she publicly spoke against the policy and wrote articles urging women to oppose the legislation, becoming one of the first to challenge the law. She reiterated her views at the nineteenth Convention of the Bulgarian Women's Union, imploring mothers, who knew the pain of giving birth and raising children, to stand against murder of human life, war, and the death penalty.
Later career (1925–1945)
In 1925, after 20 years as the chair of Самосъзнание, Pateva resigned over the ideological stance that members and the parent Bulgarian Women's Union had taken to support the dictatorial fascist regime of Aleksandar Tsankov and his white terror policies against intellectuals and political opponents. The following year, she organized the Женско миротворно общество в България (Women's Peace Society in Bulgaria), which she chaired until 1944. The organization actively opposed exile and repression by authorities. During the next decades, she worked at writing articles for the Вестник на жената (Women's Journal) and attending women's and peace conferences. She attended the Tenth Congress of the IWSA held in Paris in May 1926 and in July was in Dublin to attend the WILPF Congress. In 1927 Pateva spoke at the International League for Women for Peace and Liberty meeting in Gland, Switzerland and attended the International Federation of University Women Conference in Geneva in 1929; the Belgrade Peace Conference in May 1931; the War Resisters' International conference in Lyon in August 1931; the Universal Peace Congress hosted in Paris in 1937; and both in 1939 and 1940, she attended events in Rotterdam.
Throughout her career, Pateva spoke at more than 100 public lectures and published approximately 500 articles and books on the topics of women's rights, pacifism, and vegetarianism, to which she adhered. In 1931, she was awarded an honorary membership in the French branch of the (International Union of Revolutionary Writers). Her home was a gathering place for prominent Bulgarian public figures and intellectuals, including , Adriana Budevska, , , Aleksandar Stamboliyski, , and Asen Zlatarov. In 1944, a second coup d'état brought in a communist regime, which implemented state socialism, giving women the vote, yet simultaneously abolishing women's and other grassroots organizations.
In 1945, Pateva approached the Minister of National Education and Culture asking for permission to form the Свободно народно прогресивно културно огнище Самосъзнание (Free People's Progressive Cultural Center of Self-Knowledge). She stated that the intent of the self-supporting organization would be to provide women and youth opportunities to improve their talents and develop skills to engage in cultural activities that would benefit the Bulgarian people. Her request was denied and the authorities declared the Patev family enemies of the people for their wealth and status as part of the Burgas elite. In 1947, when Nikola Petkov's death sentence was announced, Pateva sent correspondence to Georgi Dimitrov and Vasil Kolarov, demanding that the legislature abolish the death penalty. The letter produced dire consequences when both her home and her son Bozhan's factory were nationalized. Left without means of support, she wrote the government asking for a pension, which was denied.
Death and legacy
Pateva died penniless on 17 June 1955 in Sofia. In 1994, the women's organization she had founded and chaired for 20 years, Самосъзнание, was revived. In 2016, the Burgas Writers' House was adorned with a plaque honoring her. She is remembered, along with Anna Karima, as one of the two "most prominent leaders of the women's movement" in their era, according to historian, Krassimira Daskalova.
References
Citations
Bibliography
1878 births
1955 deaths
Bulgarian feminists
Bulgarian human rights activists
Writers from Burgas
Bulgarian suffragists
Pacifist feminists
20th-century Bulgarian women writers
People from Sliven Province
19th-century Bulgarian writers
19th-century Bulgarian women
19th-century Bulgarian people
International Congress of Women people |
Dendromigadops is a genus of ground beetles in the family Carabidae. There are at least two described species in Dendromigadops.
Species
These two species belong to the genus Dendromigadops:
Dendromigadops alticola Baehr, 2013 (Australia)
Dendromigadops gloriosus Baehr, 2013 (Australia)
References
Migadopinae |
```swift
//
// SampleValue.swift
// Loop
//
//
import HealthKit
import LoopKit
extension Collection where Element == SampleValue {
/// O(n)
var quantityRange: ClosedRange<HKQuantity>? {
var lowest: HKQuantity?
var highest: HKQuantity?
for sample in self {
if let l = lowest {
lowest = Swift.min(l, sample.quantity)
} else {
lowest = sample.quantity
}
if let h = highest {
highest = Swift.max(h, sample.quantity)
} else {
highest = sample.quantity
}
}
guard let l = lowest, let h = highest else {
return nil
}
return l...h
}
}
``` |
Bruce Hudson was an oil tanker which mainly carried petroleum products on the North American Great Lakes.
She was built in 1935 by the Horton Steel Works Ltd. of Fort Erie.
Originally Bruce Hudson, and sister ships, were unpowered tank barges, that relied on tugboats to tow them from port to port. This did not prove very workable. In July, 1935, Bruce Hudson capsized in high seas off Cobourg, Ontario, while being towed from Montreal to Port Credit, Ontario, with a load of crude oil. She was towed upside-down to St. Catharines, Ontario, siphoned out, righted, and returned to service. In November 1935, the crew of Bruce Hudson were removed from the barge in high seas, again off Cobourg, when the tug Ethel ran low on fuel and had to leave the vessel adrift on Lake Ontario. The steamer Brulin took the barge in tow and won salvage fees in Exchequer Court of Canada.
In 1939 the vessel underwent the first of several refits. She was lengthened and had a pair of used engines added.
On 26 July 1943, while preparing to ship a highly volatile petroleum product called casinghead gas from East Chicago, Indiana, Bruce Hudson cargo exploded—sending flames shooting hundreds of feet in the air.
Her Captain, his son, and two other crew members were burned, and later died of their burns. Despite heavy damage to her superstructure, Bruce Hudson was repaired and returned to service.
In 1947, Bruce Hudson underwent a second refit, being lengthened and deepened in St. Catharines.
In 1948, Bruce Hudson was sold to Transit Tankers & Terminals Ltd. of Montreal.
In August, 1951, Bruce Hudson ran aground at Wellesley Island, New York, in the Thousand Islands archipelago in the Saint Lawrence River.
In 1952, Bruce Hudson was sold to Coastalake Tankers Ltd. and renamed Coastal Cliff.
In 1957, Coastal Cliff underwent a third refit, being lengthened and re-engined in Montreal.
In 1969 Coastal Cliff was sold to West Indies Transport and renamed Witcroix.
In 1983, Witcroix was scrapped at Cartagena, Colombia.
References
Merchant ships of Canada
Ships built in Ontario |
Chinn is a surname, originating both in England and among overseas Chinese communities.
Origins and statistics
As an English surname, it originated as a nickname for people with prominent chins, from Middle English or . It is also a spelling, based on the pronunciation in some varieties of Chinese including Hakka, of the surname pronounced Chen in Mandarin. The similarly spelled surname Chin also shares both of these origins.
According to statistics cited by Patrick Hanks, 1,316 people on the island of Great Britain and four on the island of Ireland bore the surname Chinn in 2011. In 1881 there were 1,032 people with the surname in Great Britain, primarily at Warwickshire and Cornwall.
The 2010 United States Census found 6,211 people with the surname Chinn, making it the 5,601st-most-common name in the country. This represented an increase in absolute numbers, but a decrease in relative frequency, from 6,146 (5,220th-most-common) in the 2000 Census. In both censuses, about half of the bearers of the surname identified as White, one-quarter as Asian, and one-fifth as Black.
People
Adrienne Chinn (1960), Canadian author
Alva Chinn (), American model
Andrew Chinn (1915–1996), American artist and art educator of Chinese descent
Anthony Chinn (1930–2000), Guyanese-born British actor
Benjamen Chinn (1921–2009), American photographer
Betty Kwan Chinn (), American philanthropist who works with homeless people
Bob Chinn (film director) (born 1943), American pornographic film director
Bob Chinn (restaurateur) (1923–2022), American restaurateur, owner of Bob Chinn's Crab House
Bobby Chinn (born 1954), New Zealand chef and television presenter
Carl Chinn (born 1956), English historian
Conor Chinn (born 1987), American soccer forward
George M. Chinn (1902–1987), United States Marine Corps colonel and weapons expert
Howard A. Chinn (1906–?), American audio engineer
Ian Chinn (1917–1956), Australian rules footballer
Jeanne Chinn, American actress
Jeremy Chinn (born 1998), American football player
Joseph W. Chinn (1866–1936), American lawyer and judge from Virginia
Julia Chinn
Kathy L. Chinn (), American politician from Missouri
Ken Chinn (1962–2020), Canadian punk rock musician
Lori Tan Chinn (), American actress
Marlin Chinn (born 1970), American basketball coach
Menzie Chinn (born 1961), American economist
May Edward Chinn (1896–1980), African-American woman physician
Mike Chinn (born 1954), English horror, fantasy, and comics writer
Nicky Chinn (born 1945), English songwriter and record producer
Oscar Chinn (), British transport company operator in Congo, involved in the Permanent Court of International Justice's Oscar Chinn Case
Phyllis Chinn (born 1941), American mathematician
Simon Chinn (), British film producer
Thomas Withers Chinn (1791–1852), American politician from Louisiana
Sir Trevor Chinn (born 1935), British businessman and philanthropist
Trevor Chinn (glaciologist) (–2018), New Zealand scientist
Fictional characters
Maya Chinn, minor character in the American soap opera Passions
See also
Chin (surname)
References
English-language surnames |
Lieutenant General Knut Axel Ryding (28 August 1831 – 7 February 1897) was a Swedish Army officer. His senior commands include the post of Chief of the General Staff and commanding officer of the 3rd Military District and the 3rd Division. Ryding also served as Minister for War for five years.
Early life
Ryding was born on 28 August 1831 at Sandgärdet, near Vänersborg, in Västra Tunhem socken, Älvsborg County. He was the younger brother of Gustaf Ryding (1833–1901), future Governor of Västernorrland County. He passed studentexamen in Uppsala in 1849.
Career
Ryding was commissioned as an officer in the Göta Artillery Regiment in 1851 with the rank of underlöjtnant. Ryding was promoted to Captain there in 1863. In 1861–70 he served as a teacher of physics at the Higher Artillery School (Högre artilleriläroverket) in Marieberg and in 1863–72 he also served as a teacher of artillery and handguns at the Royal Military Academy. Furthermore, Ryding was a teacher of mathematics and physics at the Pharmaceutical Institute (Farmaceutiska institutet) from 1861 to 1875. After having served as secretary in the Committee on Defence in the Riksdag of 1871, Ryding was appointed General Staff officer the following year and was promoted to Major in the army that same year. Promoted to Lieutenant Colonel of the General Staff in 1873, he assumed the post of Chief of the Military Office of the Ministry of Land Defence in 1873. In 1875 he was promoted to Lieutenant Colonel and appointed commanding officer of the Jämtland Ranger Corps, from which he was transferred in 1879 as Colonel and regimental commander of Skaraborg Regiment. In February 1882, he was appointed Major General and Chief of the General Staff, but only held this position for a few months, when in June of that year he was appointed Council of State (Statsråd) and head of the Ministry of Land Defence, commonly known as Minister for War.
In this capacity, he presented to the Riksdag of 1883, that of the 1880 Land Defence Committee's (Lantförsvarskommittén), of which he was a member, large drafted proposal of a new army order; based on recruited regular troops and conscripts. However, despite the careful investigation of the defence issue and the persuasive manner in which Ryding fought for the implementation of the proposal, it was not adopted, mainly for the reason, that the Andra kammaren, by an overwhelming majority, decided to delete the provision contained in the proposal on the formation of reserve troops for the army, after which the Första kammaren rejected the proposal on the method of procurement of the regular troops. The fate, which thus affected the government's proposal, resulted in Ryding (along with the other members of the cabinet) asked for resignation from the cabinet, which, however, was not granted to him.
Over the next few years, Ryding tried with great energy on the "partial path of reforms" provide at least some increase in Sweden's defence force, but most of the proposals for that purpose, which were presented to the Riksdag, were stopped against the thrift of the Andra kammarens majority. However, when the Riksdag did not grant the necessary funds, Ryding resigned in 1887 from the cabinet. However, in 1885, he had been appointed commanding officer of the 3rd Military District (Tredje militärdistriktet), which position along with the associated command of the 3rd Division (Tredje fördelningen) he held until 1896, when, broken by a long-standing illness, he retired from military service. Prior to that, in 1892, he had been promoted to Lieutenant General. In 1883–87 Ryding was a member of the Första kammaren for Västernorrland County and in 1891–92 a member of the Andra kammaren for the cities of Mariestad, Skövde and Falköping. Ryding was a member of the Committee on Construction Basics for Gun Carriage to Field Cannons (Kommittén angående konstruktionsgrunder för lavett till fältkanoner) in 1872, in the Committee on the Defense of the Inlets to Stockholm and other Ports (Kommittén angående försvaret av inloppen till Stockholm och andra hamnar) from 1878 to 1879 and (for some time) in the Land Defence Committee (Lantförsvarskommittén) from 1880 to 1882; Chairman of the Committee on Field Management and Stage Regulations (Kommittén angående fältförvaltnings- och etappreglementen) from 1888 to 1892; member of the Army Order Committee (Härordningskommittén) from 1890 to 1891; Chairman of the Committee on Armament Plans for the Fortifications in the Stockholm Archipelago (Kommittén angående bestyckningsplaner för befästningarna i Stockholms skärgård), etc. from 1891 to 1892.
Personal life
Ryding married on 5 January 1875 in Vänersborg to Jenny Christina Rosalia (Rosalie) Petersson (5 February 1842 in Stockholm – 22 March 1925 in Stockholm), the daughter of Carl Gustaf Petersson and Johanna Maria Winberg. They had three children; Karin Astrid Kristina (born 3 April 1878), Jenny Marika Charlotta (20 August 1880 – 6 January 1955) and Johan Karl Axel (born 23 April 1882).
Death
Ryding died on 7 February 1897 in Skövde. He was buried at Sankta Elin Cemetery in Skövde.
Dates of rank
1851 – Underlöjtnant
1856 – Lieutenant
1863 – Captain
1872 – Major
1873 – Lieutenant Colonel
1879 – Colonel
1882 – Major General
1892 – Lieutenant General
Awards
Ryding's awards:
Commander Grand Cross of the Order of the Sword
Knight of the Order of St. Olav
Grand Cross of the Saint Benedict of Aviz
Grand Officer of the Legion of Honour
Commander of the Order of Franz Joseph
Knight of the Order of the Dannebrog
Honours
Member of the Royal Swedish Academy of War Sciences (1866)
References
External links
Entry at Svenskt biografiskt lexikon
1831 births
1897 deaths
Swedish Army lieutenant generals
Swedish Ministers for Defence
People from Vänersborg Municipality
Members of the Första kammaren
Members of the Andra kammaren
Members of the Royal Swedish Academy of War Sciences
Commanders Grand Cross of the Order of the Sword
Commanders of the Order of Franz Joseph
Knights of the Order of the Dannebrog
Grand Officers of the Legion of Honour
Grand Crosses of the Order of Aviz |
Holmengrå (historically: Holmengraa) may refer to the following:
Places
Holmengrå, Finnmark, a small fishing village in Sør-Varanger municipality, Troms og Finnmark county, Norway
Holmengrå, Østfold, a small island in Hvaler municipality in Viken county, Norway
Holmengrå, Vestland, a small island in Fedje municipality, Vestland county, Norway
Holmengrå Lighthouse, a lighthouse on the island of Holmengrå in Fedje municipality, Vestland county, Norway
Holmengrå, Sweden, a small island just west of Strömstad in Västra Götaland County, Sweden
Other
Battle of Holmengrå (in Hvaler), a battle during the Civil war era in Norway on 12 Nov 1139
is the name of a Norwegian tanker which was sunk on 28 December 1944 in an Allied air strike during World War II
See also
Grey Island, originally called Holmen graa, in the South Orkney islands near Antarctica
Holmengråfjorden, a fjord that flows past Holmengrå in Sør-Varanger, Norway
Holmengråfjellet, a mountain to the north of Holmengrå in Sør-Varanger, Norway |
The Parliament of the Balearic Islands (Catalan: Parlament de les Illes Balears) is the unicameral autonomous parliament of the Balearic Islands, one of the autonomous communities of Spain. The Parliament, composed of 59 elected seats, is located in the city of Palma, on the island of Majorca.
Precedents
Parliamentary Assembly of the Balearic Islands (1977–1978)
The Parliamentary Assembly of the Balearic Islands () was an unofficial provisional body serving as pre-autonomic representation from 30 July 1977. It was composed by the eleven elected deputies and senators in the 1977 general election. Additionally, on 13 June 1978, the pre-autonomic regime decree installed the new Inter-island General Council, and two more representatives from Menorca and two more from the Pityusic Islands were elected. The President was Jeroni Albertí, member of the Union of the Democratic Centre (UCD). When the Inter-island General Council was constituted on 24 July 1978, the Parliamentary Assembly of the Balearic Islands was dissolved.
The composition of the Assembly was defined by the 1977 general election results in the Balearic Islands, which were the following:
Inter-island General Council (1978–1983)
The 1978 Spanish Constitution anticipated the organisation of the State in Autonomous Communities. The different historic regions and nationalities could access to the autonomy through two ways; the so-called fast way (article 151) and the so-called slow or common way (article 143). During the process of achievement, the province or provinces could request to the Congress of Deputies the regime of preautonomy, as a transition period from the centralism to the self-government. On 13 June 1978 the Inter-island General Council (), preautonomous body for the Balearic Islands, was constituted by royal decree. It substituted the Provincial Council of the Balearics and possessed some of the basic competences in health and culture, although its main function was drafting a Statue of Autonomy for the archipelago. On a 17 July 1978 decree, the election of its members was defined. On 1 March 1983 the Statue of Autonomy of the Balearic Islands came into effect, and the Inter-island General Council disappeared, being replaced by the Government of the Balearic Islands.
During the five years of its existence, the institution had two presidents. Jeroni Albertí (UCD) resigned in 1982 before participating in the foundation of Majorcan Union (UM). The Menorcan Francesc Tutzó (UCD), who had been the vice-president, replaced Albertí, and governed the body until the 1983 regional election.
Presidents of the Parliament of the Balearic Islands
See also
President of the Balearic Islands
References
Balearic Islands
Balearic Islands |
```c
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
#include "stdlib/stats/base/smeankbn.h"
#include <stdint.h>
#include <stdio.h>
int main( void ) {
// Create a strided array:
float x[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 };
// Specify the number of elements:
int64_t N = 4;
// Specify the stride length:
int64_t stride = 2;
// Compute the arithmetic mean:
float v = stdlib_strided_smeankbn( N, x, stride );
// Print the result:
printf( "mean: %f\n", v );
}
``` |
{
"type": "ExternalData",
"service": "geoshape",
"ids": "Q14874265",
"title": "Mount Vernon Camp"
}
Mount Vernon Camp, also known as the Gurkha Cantonment, is an establishment of the Singapore Police Force built to house the training and residential facilities of the Gurkha Contingent's Gurkhas and their families.
Located at Mount Vernon near the now closed Bidadari Cemetery, it has undergone expansion on the hilly terrain, particularly with the introduction of modern, high quality high-rise housing blocks for the over 2,000 officers and their families-in-tow.
The road leading into the camp is named Kathmandu Road for the capital city of Nepal. Built as a self-contained complex due to security concerns to minimise movements into and out of the complex, it has its own shops, a school and playgrounds for the younger children, and a swimming pool which the families can access on weekends, which contingent commander Bruce M. Niven equates to being a township all on its own. There are no schools in the camp.
Dwellers in the complex are not prohibited from leaving the camp or utilising services and facilities outside it. Throngs of school-going Nepalese children regularly leave and enter the camp everyday, wearing the uniforms of national schools. The camp's close proximity to Bartley Secondary School has seen a significant number of Nepalese children being enrolled there, although they can also be found in schools much further away as the children become gradually assimilated into Singapore society and culture. First Toa Payoh Primary School is one of the few primary schools the Gurkha's children are enrolled in.
The surrounding commercial outlets thrive on business from the Nepalese community based in Mount Vernon Camp, and it is a common sight to see officers doing their daily recreational runs around the major roads close to the camp.
Phase 2B of the complex expansion commenced in 2001, costing a total of S$42.2 million and adding 93,568m2 of largely residential space. Designed by PWD Consultants and built by the China Construction (South Pacific) Development Co., it was completed by 2003. The complex has continued to undergo physical upgrades, with the government setting aside another S$47.8 million for expansion works carried out from 2004 to 2006, as well as another complex expansion from 2015 to 2020. This was followed by phases 1 and 2 of an elevator modernisation scheme for selected apartment buildings in March 2023 due to the deteriorating conditions of the elevators. Phase 3, the final phase of the scheme, is due to commence on 4 November 2023.
References
External links
Hindu Warriors Guard Singapore From Terror
Gurkha Contingent
Singapore Police Force
Aljunied |
Stile Antico is a British vocal ensemble, specialising in polyphonic early music composed prior to the eighteenth century. Like groups such as the Tallis Scholars or The Sixteen, it has roots in the choral tradition of the Oxford and Cambridge colleges, but, unusually for groups tackling complex polyphony, Stile Antico has no conductor. The singers rehearse and perform as chamber musicians, an approach which has been praised by critics.
Established in 2001, they won the Audience Prize at the 2005 Early Music Network Young Artists' Competition, and have since been described as "one of the brightest new stars in the firmament of Renaissance vocal ensembles".
They have recorded fifteen discs for the Harmonia Mundi label and in 2020 announced a new partnership with Decca Classics for a "trilogy of new albums". Their debut recording, Music for Compline, achieved great commercial success after it was featured on NPR's All Things Considered, reaching #2 in the Billboard Classical chart; NPR's Tom Manoff described the group as "one of the finest choral ensembles of our day". The disc also received industry awards including the 2007 Diapason d'or de l'année and was nominated for the 50th Grammy Awards. Their release Song of Songs, was the winner of the 2009 Gramophone Award for Early music, and spent three weeks at #1 on the Billboard Classical chart. It was also nominated for the 52nd Grammy Awards. Their disc The Golden Renaissance: Josquin des Prez, won the inaugural Gramophone Award for Spatial Audio in 2021.
The group has collaborated extensively with Fretwork, the Folger Consort, Marino Formenti, B’Rock, Rihab Azar, and Sting, with whom they toured Europe, Australia, and the Far East with his Songs from the Labyrinth project (based on the work of John Dowland) and appeared as guests on his 2009 album If on a Winter's Night....
In 2013, they were involved in the celebrations for the centenary of the Carnegie UK Trust, commemorating the Trust's support for OUP's multi-volume publication of Tudor church music in the 1920s. They released a disc The Phoenix Rising centred on Byrd's Mass for Five Voices.
In 2018, the group performed at the GRAMMY awards ceremony, having been nominated in the Best Small Ensemble Performance category.
Discography
Music for Compline (2007). Awards: 2007 Diapason d'or de l'année, CHOC du Monde de la Musique, Preis der deutschen Schallplattenkritik (May 2007), Classics Today 10/10)
Heavenly Harmonies (2008). Awards: Diapason d'or (April 2008), Preis der deutschen Schallplattenkritik (May 2008), Classics Today 10/10)
Song of Songs (2009). Awards: Gramophone Award for Early Music (2009), Choc de Classica (May 2009), Classics Today 10/10)
Media Vita (2010). Awards: Preis der deutschen Schallplattenkritik (May 2010), Classics Today 10/10)
Puer natus est (2010). Awards: Diapason d'or (October 2010), Edison Klassiek (2011), Preis der deutschen Schallplattenkritik (2011), International Record Review 'Outstanding' (October 2010), Choc de Classica (November 2010), Classics Today 10/10)
Tune Thy Musicke to Thy Hart (2012). Award: Choc de Classica (March 2012)
Passion and Resurrection (2012). Awards: Classics Today 10/10
The Phoenix Rising (2013). Awards: Diapason d'or (September 2013), Preis der deutschen Schallplattenkritik (2013), Choc de Classica (2013), International Record Review 'Outstanding' (September 2013), Classics Today 10/10, Fono Forum Empfehlung des Monat (October 2013)
From the Imperial Court (2014)
A Wondrous Mystery (2015). Awards: Classics Today 10/10, (October 2015)
Divine Theatre: Sacred Motets by Giaches de Wert (2016). Awards: La Clef ResMusica, February 2017, GRAMMY Nominee, Best Small Ensemble Performance, 2018.
Tenebrae Responsories (2017). Awards: 4F de Télérama, (March 2018), Gramophone Editor's Choice, (May 2018), Choc de Classica (2018).
In a Strange Land (2018). Awards: Diapason d’Or, (February 2019)
A Spanish Nativity (2019). Awards: Classics Today 10/10
The Golden Renaissance: Josquin des Prez (2021). Awards: Gramophone Award for Spatial Audio (2021).
The Golden Renaissance: William Byrd (January 2023)
References
External links
Official site
Stile Antico Artist page at Harmonia Mundi
Classical Archives Interview with Soprano Kate Ashby
British early music ensembles
Early music choirs
English choirs
Cambridge choirs
Musical groups established in 2001
Edison Classical Music Awards winners |
Senmonorom () is a municipality (krong) located in Mondulkiri Province in north-eastern Cambodia. The provincial capital Senmonorom is located within the municipality.
Administration
Senmonorom city is divided into 4 quarters (sangkat).
References
Districts of Mondulkiri province |
Jagdish Prasad Mathur (January 13, 1928– 4 August 2007) was an Indian politician and a senior leader of the Bharatiya Janata Party (BJP).
He was born in 1928 in Sikar of the present-day Rajasthan state and was associated with Rashtriya Swayamsevak Sangh since 1942. He became a member of the Bharatiya Jana Sangh in 1952. A two-time member of the Rajya Sabha, the upper house of the Indian parliament from 3 April 1978 to 2 April 1984 and from 3 April 1990 to 2 April 1996, Mathur was also the deputy leader of the BJP parliamentary party in the Rajya Sabha in 1993 and chief whip in 1990. He died in Delhi on Saturday, August 4, 2007. His last rites were performed in Jaipur.
Career
An advocate by profession, he was born to Shri. Sajjan Lal and married Smt. Man Mahini Devi. He had one son and two daughters.
He was Member of Parliament (MP) from Sikar (Rajasthan).
In 1980, on 6 April, on Easter day, when the BJP Bharatiya Janata Party, came into formal existence, after Jan Sangh merged into it, the party adopted 11 Ashoka Road as their party headquarters, in Delhi. This bungalow had been allotted to Jagdish Prasad Mathur, as one of the founding members of the Jan Sangh, after he was nominated to the Rajya Sabha in 1978. Although he believed in secular India, he also said that the true ethos of India lay in its religion of Hinduism, which was, real self of the Indian people, away from western influences. It was Jagdish Prasad Mathur who gave the party its lotus symbol, which is the national flower of India.
Quote:-
"The lotus normally grows out of dirty water - in the dirty parts of India, we are emerging as beautiful," said Mr Jagdish Prasad Mathur, national secretary of the BJP."
References
1921 births
2007 deaths
People from Bijnor
Rajya Sabha members from Uttar Pradesh
Bharatiya Jana Sangh politicians
Bharatiya Janata Party politicians from Uttar Pradesh
People from Bijnor district |
```html
<div class="card" sqxTourStep="client">
<div class="card-header">
<div class="row g-1">
<div class="col col-name">
<sqx-editable-title
[disabled]="!client.canUpdate"
[inputTitle]="client.name"
(inputTitleChange)="rename($event)"
inputTitleLength="100"></sqx-editable-title>
</div>
<div class="col-auto">
<button class="btn btn-primary" (click)="connectDialog.show()" sqxTourStep="connect" type="button">
{{ "clients.connect" | sqxTranslate }}
</button>
</div>
<div class="col-auto">
<button
class="btn btn-text-danger"
confirmRememberKey="revokeClient"
confirmText="i18n:clients.deleteConfirmText"
confirmTitle="i18n:clients.deleteConfirmTitle"
[disabled]="!client.canRevoke"
(sqxConfirmClick)="revoke()"
type="button">
<i class="icon-bin2"></i>
</button>
</div>
</div>
</div>
<div class="card-body">
<div class="container">
<div class="form-group row">
<label class="col-3 col-form-label">
{{ "common.clientId" | sqxTranslate }}
</label>
<div class="col">
<div class="input-group">
<input class="form-control" #clientId readonly value="{{ appsState.appName }}:{{ client.id }}" />
<button class="btn btn-outline-secondary" [sqxCopy]="clientId" type="button">
<i class="icon-copy"></i>
</button>
</div>
</div>
</div>
<div class="form-group row">
<label class="col-3 col-form-label">
{{ "common.clientSecret" | sqxTranslate }}
</label>
<div class="col">
<div class="input-group">
<input class="form-control" #inputSecret readonly [value]="client.secret" />
<button class="btn btn-outline-secondary" [sqxCopy]="inputSecret" type="button">
<i class="icon-copy"></i>
</button>
</div>
</div>
</div>
<div class="form-group row">
<label class="col-3 col-form-label">
{{ "common.role" | sqxTranslate }}
</label>
<div class="col">
<select class="form-select" [disabled]="!client.canUpdate" [ngModel]="client.role" (ngModelChange)="updateRole($event)">
@for (role of clientRoles; track role.name) {
<option [ngValue]="role.name">{{ role.name }}</option>
}
</select>
</div>
</div>
<div class="form-group row">
<div class="col offset-3">
<div class="form-check">
<input
class="form-check-input"
id="{{ client.id }}_allowAnonymous"
[disabled]="!client.canUpdate"
[ngModel]="client.allowAnonymous"
(ngModelChange)="updateAllowAnonymous($event)"
type="checkbox" />
<label class="form-check-label" for="{{ client.id }}_allowAnonymous">
{{ "clients.allowAnonymous" | sqxTranslate }}
</label>
</div>
<sqx-form-hint>
{{ "clients.allowAnonymousHint" | sqxTranslate }}
</sqx-form-hint>
</div>
</div>
<div class="form-group row gx-2">
<label class="col-3 col-form-label">
{{ "clients.apiCallsLimit" | sqxTranslate }}
</label>
<div class="col">
<div class="row gx-2">
<div class="col">
<input class="form-control" [disabled]="!client.canUpdate" min="0" [(ngModel)]="apiCallsLimit" type="number" />
<sqx-form-hint>
{{ "clients.apiCallsLimitHint" | sqxTranslate }}
</sqx-form-hint>
</div>
@if (client.canUpdate) {
<div class="col-auto">
<button class="btn btn-outline-secondary" (click)="updateApiCallsLimit()">
{{ "common.save" | sqxTranslate }}
</button>
</div>
}
</div>
</div>
</div>
</div>
</div>
</div>
<sqx-client-connect-form [client]="client" (dialogClose)="connectDialog.hide()" *sqxModal="connectDialog"></sqx-client-connect-form>
``` |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.