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)
```
|
Saunders Lake is located in the United States state of Minnesota. It is a lake that is west-southwest of Minneapolis–St. Paul in the Minneapolis suburbs of Mound and Minnetrista.
The first European settlers came to the area near Saunders Lake in the 1850s. In 1854, Nathaniel Sanders and J. F. Buck settled on its shores. Saunders Lake was named for Nathaniel Sanders..
The lake is a large, Type 5 wetland, classified as a Natural Environment lake.. The lake outlets through a small channel to Lake Langdon, which discharges through a culvert under County State-Aid Highway 110 into Lost Lake, which outlets into Cooks Bay of Lake Minnetonka. It is part of the Langdon Lake subwatershed of the Minnehaha Creek Watershed District (MCWD).
The corridor between Black (also called Flanagan) and Saunders Lakes consists of wetlands and maple-basswood forest and has been identified by the Minnesota Department of Natural Resources as a regionally significant area with outstanding ecological value. Most of this area has been incorporated into Gale Woods Regional Park by the Three Rivers Park District.
Saunders Lake scores highly on vegetative diversity, fish and wildlife habitat, and is classified in the Preserve category.
Boating Regulations:
Saunders Lake does not have any boating or motor regulations. Here is the DNR list of Metro lakes with boating regulations.
Wildlife
The lake is considered by many to be a great crappie fishing lake, and catfish and sunfish are also present. Beavers are present as evidenced by the downed trees on its north shore.
Gallery
Water Quality
Minnehaha Creek Watershed District has graded Saunders Lake a B− for water quality on a scale of A–F. Lakes with a B grade are defined as, “Generally good water quality but algae may limit swimming, particularly toward the end of the summer.”
See also
List of Minnesota lakes
References
External links
Saunders Lake Association
MCWD subwatershed info
Lakes of Hennepin County, Minnesota
Lakes of Minnesota
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package org.graalvm.visualvm.lib.profiler.snaptracer.impl.export;
import java.io.IOException;
import java.io.Writer;
import javax.swing.table.TableModel;
import org.graalvm.visualvm.lib.profiler.snaptracer.TracerProgressObject;
/**
*
* @author Jiri Sedlacek
*/
final class HTMLExporter extends Exporter {
private float step = 1;
private int lastStep = 0;
protected int getSteps(TableModel model) {
int steps = model.getRowCount();
if (steps > MAX_STEPS) {
step = MAX_STEPS / (float)steps;
steps = MAX_STEPS;
}
return steps;
}
protected void writeHeader(TableModel model, String title, Writer writer,
TracerProgressObject progress) throws IOException {
writeLine(writer, "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01 Transitional//EN\" \"path_to_url">"); // NOI18N
writeLine(writer);
writeLine(writer, "<html>"); // NOI18N
writeLine(writer, "<head>"); // NOI18N
writeLine(writer, " <title>"); // NOI18N
writeLine(writer, " " + title); // NOI18N
writeLine(writer, " </title>"); // NOI18N
writeLine(writer, "</head>"); // NOI18N
writeLine(writer);
writeLine(writer, "<body>"); // NOI18N
}
protected void writeData(TableModel model, String title, Writer writer,
TracerProgressObject progress) throws IOException {
int columnsCount = model.getColumnCount();
int rowsCount = model.getRowCount();
writeLine(writer, " <table border=\"1\" summary=\"" + title + "\">"); // NOI18N
writeLine(writer, " <thead>"); // NOI18N
writeLine(writer, " <tr>"); // NOI18N
for (int c = 0; c < columnsCount; c++)
writeLine(writer, " <td>" + model.getColumnName(c) + "</td>"); // NOI18N
writeLine(writer, " </tr>"); // NOI18N
writeLine(writer, " </thead>"); // NOI18N
writeLine(writer, " <tbody>"); // NOI18N
for (int r = 0; r < rowsCount; r++) {
writeLine(writer, " <tr>"); // NOI18N
for (int c = 0; c < columnsCount; c++)
writeLine(writer, " <td>" + model.getValueAt(r, c) + "</td>"); // NOI18N
writeLine(writer, " </tr>"); // NOI18N
if (progress.isFinished()) break;
if (step == 1) {
progress.addStep();
} else {
int currentStep = (int)(r * step);
if (currentStep > lastStep) {
progress.addStep();
lastStep = currentStep;
}
}
}
writeLine(writer, " </tbody>"); // NOI18N
writeLine(writer, " </table>"); // NOI18N
}
protected void writeFooter(TableModel model, String title, Writer writer,
TracerProgressObject progress) throws IOException {
writeLine(writer, "</body>"); // NOI18N
writeLine(writer, "</html>"); // NOI18N
}
}
```
|
Television in Lithuania was introduced in 1957. The following is a list of television channels broadcast in Lithuania.
Main channels
Regional channels
Others
Former channels
See also
Media of Lithuania
Lists of television channels
References
Television
|
```java
package cn.abel;
import org.springframework.boot.SpringApplication;
import org.springframework.boot.autoconfigure.SpringBootApplication;
import org.springframework.boot.autoconfigure.kafka.KafkaAutoConfiguration;
/**
* Created by yyb on 2018/12/12.
*/
@SpringBootApplication(exclude = KafkaAutoConfiguration.class)
public class Application {
public static void main(String[] args) {
SpringApplication.run(Application.class, args);
}
}
```
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.google.android.material.color.utilities;
import static com.google.android.material.color.utilities.ArgbSubject.assertThat;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.JUnit4;
@RunWith(JUnit4.class)
public final class SchemeFruitSaladTest {
private final MaterialDynamicColors dynamicColors = new MaterialDynamicColors();
@Test
public void testKeyColors() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 0.0);
assertThat(dynamicColors.primaryPaletteKeyColor().getArgb(scheme)).isSameColorAs(0xff0393c3);
assertThat(dynamicColors.secondaryPaletteKeyColor().getArgb(scheme)).isSameColorAs(0xff3A7E9E);
assertThat(dynamicColors.tertiaryPaletteKeyColor().getArgb(scheme)).isSameColorAs(0xff6E72AC);
assertThat(dynamicColors.neutralPaletteKeyColor().getArgb(scheme)).isSameColorAs(0xff777682);
assertThat(dynamicColors.neutralVariantPaletteKeyColor().getArgb(scheme))
.isSameColorAs(0xff75758B);
}
@Test
public void lightTheme_minContrast_primary() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, -1.0);
assertThat(dynamicColors.primary().getArgb(scheme)).isSameColorAs(0xff007ea7);
}
@Test
public void lightTheme_standardContrast_primary() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 0.0);
assertThat(dynamicColors.primary().getArgb(scheme)).isSameColorAs(0xff006688);
}
@Test
public void lightTheme_maxContrast_primary() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 1.0);
assertThat(dynamicColors.primary().getArgb(scheme)).isSameColorAs(0xff003042);
}
@Test
public void lightTheme_minContrast_primaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, -1.0);
assertThat(dynamicColors.primaryContainer().getArgb(scheme)).isSameColorAs(0xffaae0ff);
}
@Test
public void lightTheme_standardContrast_primaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 0.0);
assertThat(dynamicColors.primaryContainer().getArgb(scheme)).isSameColorAs(0xffC2E8FF);
}
@Test
public void lightTheme_maxContrast_primaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 1.0);
assertThat(dynamicColors.primaryContainer().getArgb(scheme)).isSameColorAs(0xff004f6b);
}
@Test
public void lightTheme_minContrast_tertiaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, -1.0);
assertThat(dynamicColors.tertiaryContainer().getArgb(scheme)).isSameColorAs(0xffd5d6ff);
}
@Test
public void lightTheme_standardContrast_tertiaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 0.0);
assertThat(dynamicColors.tertiaryContainer().getArgb(scheme)).isSameColorAs(0xffE0E0FF);
}
@Test
public void lightTheme_maxContrast_tertiaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 1.0);
assertThat(dynamicColors.tertiaryContainer().getArgb(scheme)).isSameColorAs(0xff40447b);
}
@Test
public void lightTheme_minContrast_onPrimaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, -1.0);
assertThat(dynamicColors.onPrimaryContainer().getArgb(scheme)).isSameColorAs(0xff0083ae);
}
@Test
public void lightTheme_standardContrast_onPrimaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 0.0);
assertThat(dynamicColors.onPrimaryContainer().getArgb(scheme)).isSameColorAs(0xff004d67);
}
@Test
public void lightTheme_maxContrast_onPrimaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 1.0);
assertThat(dynamicColors.onPrimaryContainer().getArgb(scheme)).isSameColorAs(0xffffffff);
}
@Test
public void lightTheme_minContrast_surface() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, -1.0);
assertThat(dynamicColors.surface().getArgb(scheme)).isSameColorAs(0xfffbf8ff);
}
@Test
public void lightTheme_standardContrast_surface() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 0.0);
assertThat(dynamicColors.surface().getArgb(scheme)).isSameColorAs(0xfffbf8ff);
}
@Test
public void lightTheme_maxContrast_surface() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 1.0);
assertThat(dynamicColors.surface().getArgb(scheme)).isSameColorAs(0xfffbf8ff);
}
@Test
public void lightTheme_standardContrast_secondary() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 0.0);
assertThat(dynamicColors.secondary().getArgb(scheme)).isSameColorAs(0xff196584);
}
@Test
public void lightTheme_standardContrast_secondaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), false, 0.0);
assertThat(dynamicColors.secondaryContainer().getArgb(scheme)).isSameColorAs(0xffc2e8ff);
}
@Test
public void darkTheme_minContrast_primary() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, -1.0);
assertThat(dynamicColors.primary().getArgb(scheme)).isSameColorAs(0xff1e9bcb);
}
@Test
public void darkTheme_standardContrast_primary() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 0.0);
assertThat(dynamicColors.primary().getArgb(scheme)).isSameColorAs(0xFF76D1FF);
}
@Test
public void darkTheme_maxContrast_primary() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 1.0);
assertThat(dynamicColors.primary().getArgb(scheme)).isSameColorAs(0xFFe0f3ff);
}
@Test
public void darkTheme_minContrast_primaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, -1.0);
assertThat(dynamicColors.primaryContainer().getArgb(scheme)).isSameColorAs(0xff003f56);
}
@Test
public void darkTheme_standardContrast_primaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 0.0);
assertThat(dynamicColors.primaryContainer().getArgb(scheme)).isSameColorAs(0xFF004D67);
}
@Test
public void darkTheme_maxContrast_primaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 1.0);
assertThat(dynamicColors.primaryContainer().getArgb(scheme)).isSameColorAs(0xFF68ceff);
}
@Test
public void darkTheme_minContrast_onPrimaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, -1.0);
assertThat(dynamicColors.onPrimaryContainer().getArgb(scheme)).isSameColorAs(0xff008ebc);
}
@Test
public void darkTheme_standardContrast_onPrimaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 0.0);
assertThat(dynamicColors.onPrimaryContainer().getArgb(scheme)).isSameColorAs(0xffC2E8FF);
}
@Test
public void darkTheme_maxContrast_onPrimaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 1.0);
assertThat(dynamicColors.onPrimaryContainer().getArgb(scheme)).isSameColorAs(0xFF000d15);
}
@Test
public void darkTheme_minContrast_onTertiaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, -1.0);
assertThat(dynamicColors.onTertiaryContainer().getArgb(scheme)).isSameColorAs(0xff7b7fbb);
}
@Test
public void darkTheme_standardContrast_onTertiaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 0.0);
assertThat(dynamicColors.onTertiaryContainer().getArgb(scheme)).isSameColorAs(0xffe0e0ff);
}
@Test
public void darkTheme_maxContrast_onTertiaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 1.0);
assertThat(dynamicColors.onTertiaryContainer().getArgb(scheme)).isSameColorAs(0xFF00003c);
}
@Test
public void darkTheme_minContrast_surface() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, -1.0);
assertThat(dynamicColors.surface().getArgb(scheme)).isSameColorAs(0xff12131c);
}
@Test
public void darkTheme_standardContrast_surface() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 0.0);
assertThat(dynamicColors.surface().getArgb(scheme)).isSameColorAs(0xff12131c);
}
@Test
public void darkTheme_maxContrast_surface() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 1.0);
assertThat(dynamicColors.surface().getArgb(scheme)).isSameColorAs(0xff12131c);
}
@Test
public void darkTheme_standardContrast_secondary() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 0.0);
assertThat(dynamicColors.secondary().getArgb(scheme)).isSameColorAs(0xff8ecff2);
}
@Test
public void darkTheme_standardContrast_secondaryContainer() {
SchemeFruitSalad scheme = new SchemeFruitSalad(Hct.fromInt(0xff0000ff), true, 0.0);
assertThat(dynamicColors.secondaryContainer().getArgb(scheme)).isSameColorAs(0xff004d67);
}
}
```
|
```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) {
}
```
|
Excoecaria glaucescens is a species of flowering plant in the family Euphorbiaceae. It was described in 1891. It is native to Madagascar.
References
glaucescens
Plants described in 1891
Endemic flora of Madagascar
|
Eulima grimaldii is a species of sea snail, a marine gastropod mollusk in the family Eulimidae. The species is one of a number within the genus Eulima.
Description
The length of the shell attains 6 mm.
Distribution
This species was found in the Mediterranean Sea off Monaco.
References
External links
Bouchet, P. & Warén, A. (1986). Revision of the Northeast Atlantic bathyal and abyssal Aclididae Eulimidae, Epitonidae (Mollusca, Gastropoda). Bollettino Malacologico. suppl. 2: 297-576.
grimaldii
Gastropods described in 1986
|
```html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "path_to_url">
<html lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta http-equiv="Content-Style-Type" content="text/css">
<link rel="up" title="FatFs" href="../00index_e.html">
<link rel="alternate" hreflang="ja" title="Japanese" href="../ja/rc.html">
<link rel="stylesheet" href="../css_e.css" type="text/css" media="screen" title="ELM Default">
<title>FatFs - API Return Code</title>
</head>
<body>
<h1>Return Code of API Functions</h1>
<p>Most of API functions return common result code in enum type <tt>FRESULT</tt>. When an API function succeeded, it returns zero (<tt>FR_OK</tt>), otherwise it returns non-zero value indicates type of error.</p>
<dl class="ret">
<dt id="ok">FR_OK (0)</dt>
<dd>The function succeeded.</dd>
<dt id="de">FR_DISK_ERR</dt>
<dd>The lower layer, <tt>disk_read</tt>, <tt>disk_write</tt> or <tt>disk_ioctl</tt> function, reported that an unrecoverable hard error occured.<br>Note that if once this error occured at any operation to an open file, the file object is aborted and any operations to the file except for close will be rejected.</dd>
<dt id="ie">FR_INT_ERR</dt>
<dd>Assertion failed. An insanity is detected in the internal process. One of the following possibilities is suspected.
<ul>
<li>Work area (file system object, file object or etc...) has been broken by stack overflow or any other tasks. This is the reason in most case.</li>
<li>There is an error of the FAT structure on the volume.</li>
<li>There is a bug in the FatFs module itself.</li>
<li>Wrong lower layer implementation.</li>
</ul>
Note that if once this error occured at any operation to an open file, the file object is aborted and all operations to the file except for close will be rejected.
</dd>
<dt id="nr">FR_NOT_READY</dt>
<dd>The lower layer, <a href="dinit.html"><tt>disk_initialize</tt></a> function, reported that the storage device could not be got ready to work. One of the following possibilities is suspected.
<ul>
<li>No medium in the drive.</li>
<li>Wrong lower layer implementation.</li>
<li>Wrong hardware configuration.</li>
<li>The storage device has broken.</li>
</ul>
</dd>
<dt id="nf">FR_NO_FILE</dt>
<dd>Could not find the file in the directory.</dd>
<dt id="np">FR_NO_PATH</dt>
<dd>Could not find the path. A directory in the path name could not be found.</dd>
<dt id="in">FR_INVALID_NAME</dt>
<dd>The given string is invalid as the <a href="filename.html">path name</a>. One of the following possibilities is suspected.
<ul>
<li>There is a character not allowed for the file name.</li>
<li>The file name is out of 8.3 format. (at non-LFN cfg.)</li>
<li><tt>FF_MAX_LFN</tt> is insufficient for the file name. (at LFN cfg.)</li>
<li>There is any character encoding error in the string.</li>
</ul>
</dd>
<dt id="dn">FR_DENIED</dt>
<dd>The required access was denied due to one of the following reasons:
<ul>
<li>Write mode open against the read-only file.</li>
<li>Deleting the read-only file or directory.</li>
<li>Deleting the non-empty directory or current directory.</li>
<li>Reading the file opened without <tt>FA_READ</tt> flag.</li>
<li>Any modification to the file opened without <tt>FA_WRITE</tt> flag.</li>
<li>Could not create the object due to root directory full or disk full.</li>
<li>Could not allocate a contiguous area to the file.</li>
</ul>
</dd>
<dt id="ex">FR_EXIST</dt>
<dd>Name collision. An object with the same name is already existing in the directory.</dd>
<dt id="io">FR_INVALID_OBJECT</dt>
<dd>The file/directory object is invalid or a null pointer is given. There are some reasons as follows:
<ul>
<li>It has been closed, or the structure has been collapsed.</li>
<li>It has been invalidated. Open objects on the volume are invalidated by voulme mount process.</li>
<li>Physical drive is not ready to work due to a media removal.</li>
</ul>
</dd>
<dt id="wp">FR_WRITE_PROTECTED</dt>
<dd>A write mode operation against the write-protected media.</dd>
<dt id="id">FR_INVALID_DRIVE</dt>
<dd>Invalid drive number is specified in the path name or a null pointer is given as the path name. (Related option: <tt><a href="config.html#volumes">FF_VOLUMES</a></tt>)</dd>
<dt id="ne">FR_NOT_ENABLED</dt>
<dd>Work area for the logical drive has not been registered by <tt>f_mount</tt> function.</dd>
<dt id="ns">FR_NO_FILESYSTEM</dt>
<dd>There is no valid FAT volume on the drive or wrong lower layer implementation.</dd>
<dt id="ma">FR_MKFS_ABORTED</dt>
<dd>The <tt>f_mkfs</tt> function aborted before start in format due to a reason as follows:
<ul>
<li>It is impossible to format with the given parameters.</li>
<li>The size of volume is too small. 128 sectors minimum with <tt>FM_SFD</tt> option.</li>
<li>The partition bound to the logical drive coulud not be found. (Related option: <tt><a href="config.html#multi_partition">FF_MULTI_PARTITION</a></tt>)</li>
</ul>
</dd>
<dt id="tm">FR_TIMEOUT</dt>
<dd>The function was canceled due to a timeout of <a href="appnote.html#reentrant">thread-safe control</a>. (Related option: <tt><a href="config.html#timeout">FF_TIMEOUT</a></tt>)</dd>
<dt id="lo">FR_LOCKED</dt>
<dd>The operation to the object was rejected by <a href="appnote.html#dup">file sharing control</a>. (Related option: <tt><a href="config.html#fs_lock">FF_FS_LOCK</a></tt>)</dd>
<dt id="nc">FR_NOT_ENOUGH_CORE</dt>
<dd>Not enough memory for the operation. There is one of the following reasons:
<ul>
<li>Could not allocate a memory for LFN working buffer. (Related option: <tt><a href="config.html#use_lfn">FF_USE_LFN</a></tt>)</li>
<li>Size of the given buffer is insufficient for the size required.</li>
</ul>
</dd>
<dt id="tf">FR_TOO_MANY_OPEN_FILES</dt>
<dd>Number of open objects has been reached maximum value and no more object can be opened. (Related option: <tt><a href="config.html#fs_lock">FF_FS_LOCK</a></tt>)</dd>
<dt id="ip">FR_INVALID_PARAMETER</dt>
<dd>The given parameter is invalid or there is an inconsistent for the volume.</dd>
</dl>
<p class="foot"><a href="../00index_e.html">Return</a></p>
</body>
</html>
```
|
```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;
}
}
```
|
The Copa Campeonato Primera División (familiarly known as Superfinal) was an official Argentine football cup competition organized by the Argentine Football Association. It was played in a single match format between the Torneo Inicial and Torneo Final champions.
History
Originally awarded to Primera División champions, the trophy is the oldest in Argentine football, having been awarded for the first time in 1896, three years after the Argentine Football Association was established, and played without interruption until 1926. The Cup received several names, such as "Championship Cup", "Copa Campeonato", "Challenge Cup" and "Copa Alumni", due to the association offered legendary team Alumni to keep the Cup definitely for having won it three consecutive times (1900–02), but the club from Belgrano declined the honour to keep the trophy under dispute.
On June, 2013, the association decided to put the trophy back into circulation with the creation of a new competition, named "Superfinal" that consisted in a single match between winners of Torneo Inicial and Torneo Final, played in a neutral venue.
The first edition of the competition was awarded as a Primera División league title so Vélez Sársfield achieved its 10th league championship after defeating Newell's Old Boys, but the association then changed the rules, deciding that the competition would not count as a Primera División title but a domestic cup since its second edition.
Due to the 2015 and 2016 seasons were played as single tournaments with only one champion per season, the Copa Campeonato has not held since then.
Champions
Notes
References
C
|
```objective-c
/**
* 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,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
#ifndef CORE_RENDER_NODE_RENDER_LIST_H_
#define CORE_RENDER_NODE_RENDER_LIST_H_
#include <map>
#include <string>
#include <vector>
#include "core/css/constants_value.h"
#include "core/render/node/render_object.h"
namespace WeexCore {
class RenderList : public RenderObject {
public:
~RenderList();
void set_flex(const float flex) override;
void AddCellSlotCopyTrack(RenderObject *cell_slot);
std::map<std::string, std::string> *GetDefaultStyle() override;
std::map<std::string, std::string> *GetDefaultAttr() override;
void PreCalculateCellWidth();
std::string CalculateSpanOffset();
float TakeStyleWidth();
int AddRenderObject(int index, RenderObject *child) override;
void AddRenderObjectWidth(RenderObject *child, const bool updating);
void AddAttr(std::string key, std::string value) override;
void UpdateAttr(std::string key, std::string value) override;
float TakeColumnCount();
float TakeColumnGap();
float TakeColumnWidth();
float TakeLeftGap();
float TakeRightGap();
int TakeOrientation();
inline float CalculateFreeSpaceAlongMainAxis(
const float &width, const float &height,
const float ¤tLength) const override {
return NAN;
}
inline std::vector<RenderObject *> &CellSlots() { return cell_slots_; }
private:
bool is_pre_calculate_cell_width_ = false;
int column_count_ = COLUMN_COUNT_NORMAL;
float column_width_ = AUTO_VALUE;
float available_width_ = 0;
float column_gap_ = COLUMN_GAP_NORMAL;
bool is_set_flex_ = false;
std::vector<RenderObject *> cell_slots_;
std::vector<RenderObject *> cell_slots_copys_;
float left_gap_ = 0;
float right_gap_ = 0;
std::map<std::string,std::string> mOriginalAttrs;
};
} // namespace WeexCore
#endif // CORE_RENDER_NODE_RENDER_LIST_H_
```
|
The Torrington Company was a firm that developed in Torrington, Connecticut, emerging as a rename from the Excelsior Needle Company. It used a "cold swaging" technique to create sewing machine needles and other needles from cold metal, and was the largest employer in Torrington. in addition to its main facilities in Torrington, it acquired a division, located in South Bend, Indiana.
Later as a leading manufacturer of anti-friction bearings and a Fortune 500 company, The Torrington Company sold its products, which also included an array of metal parts and assemblies, to a variety of major global industries.
Company Overview
Originally a sewing needle manufacturer, Torrington diversified and grew over the years, becoming a discernibly different company with each passing decade. During the 1930s, the company diversified into anti-friction bearings and from that point forward evolved into the formidable force it represented during the 1990s.
In 1968 the management sold the company to Ingersoll Rand. It was later purchased in 2003 by the Timken Company. The Timken company utilized its Heavy Bearing plants and later Needle Bearing plants along with Torrington brand name was sold to JTEKT in 2009.
Company History
In the nineteenth-century Connecticut was home to several inventive "Nutmeggers," including Samuel Colt, who developed the first revolver, Eli Whitney, whose invention of the cotton gin revolutionized the cotton industry, and Elias Howe, a transplanted "Nutmegger" from neighboring Massachusetts who made his life's discovery in New Hartford, Connecticut, where he recorded the first of two landmark achievements that would launch the predecessor to The Torrington Company into business.
In 1846, Elias Howe designed an early version of the sewing machine. Howe's invention represented a historic advancement in technology to be sure, but there were critical problems with his new machine that made its usefulness not quite the labor-saving device it purported to be. The chief problem with Howe's machine was the ineffectiveness of the needles it employed; Howe, in essence, had created a razor without the blades. In the years following his discovery, the sewing needles that existed were imprecise pins of steel hammered out essentially the same way a blacksmith formed a horseshoe. It was a crude method that produced imperfect results, frequently leaving the purchasers of Howe's machine with broken needles they had pounded out by hand. Twenty years would pass before a suitable solution was found.
The solution arrived—at first unbeknownst to its creators—in 1864, when another transplanted "Nutmegger," a former Vermont toolmaker, Orrin L. Hopson, and his associate, Herman P. Brooks, made their own pivotal discovery in Waterbury, Connecticut. Hopson and Brooks developed and patented a machine that year described as "An Improvement in Pointing Wire for Pins," which perhaps was as specific a use for the machine as the two inventors had in mind. Their machine could compress a section of steel but for what purpose and to whose interest, they were unclear. The two designers of the wire-compressing machine decided to leave Waterbury to find a market for their invention. Hopson and Brooks, who reacted to their discovery with a decided entrepreneurial bent, had settled by 1866 in Wolcottville, Connecticut, by which time they had determined that the marketability of their invention was not the machine itself but the products it could manufacture: sewing machine needle blanks.
Excelsior Needle Company
In Wolcottville, the central part of the city of Torrington, which had been for years a hub of numerous light-manufacturing activities, Hopson and Brooks convinced seven local businessmen that their machine could produce sewing machine needle blanks superior to those already in existence. A company called Excelsior Needle Company was organized in February 1866 to create a manufacturing concern inspired by Hopson's and Brooks' machine and what it could produce. Hopson and Brooks received 100 of the 800 shares composing Excelsior Needle stock, relinquished their patent rights for $5,000, and left the realization of their invention's potential in the hands of Achille F. Migeon, Excelsior Needle's president, and Charles Alvord, the company's secretary and treasurer.
Migeon and Alvord wasted no time in getting the business started, obtaining a two-story, 16-room building for $3,000 six days after they were elected to their posts. The wood-framed structure became Excelsior Needle's first factory. By 1868, two years after beginning business, Excelsior Needle had produced enough sewing needles to begin selling them to sewing machine manufacturers, the largest of which was the Singer Company. Two years later, when roughly 700,000 sewing machines were being manufactured each year, fueling demand for Excelsior Needle's products, the fledgling manufacturing concern had sold enough needle blanks to warrant the relocation of its operations to larger quarters closer to rail transportation.
By the mid-1870s, Excelsior Needle was churning out 30,000 sewing needles a day, six days a week, and generating approximately $75,000 a year in sales. Soon thereafter, the company's sales volume rose even further above that level. The solid foundation Excelsior Needle had established during its first decade—by helping to create a new American industry—provided a stable springboard for growth that carried the company through the 1880s and toward its first defining decade.
During the 1890s, Excelsior Needle diversified its business line, expanded its business overseas, and established the first of many acquisitions. Perhaps the most notable change that occurred during the decade was a symbolic one—the first link to The Torrington Company. In 1890, before Torrington entered the scene, Excelsior Needle absorbed Springfield, Massachusetts-based National Needle Company, a competing needle manufacturer that had first opened its doors 18 years earlier, in 1873. The addition of National Needle's assets and its 175 employees occurred during the same year that Excelsior Needle located to a larger factory for the second time to provide for the company's burgeoning growth.
Growth was the dominant theme during the decade, engendering a more well-rounded and financially sound company. As the 1890s progressed, Excelsior Needle diversified into a number of new areas, including the manufacture of knitting machine latch needles and the manufacture of heavy hook needles used in the mass production of shoes and other leather goods. Excelsior Needle continued to diversify, forming a subsidiary named Torrington Swaging Company, to manufacture spokes for bicycle wheels. (This was in response to a new feature of the sewing machine industry that took shape during the 1890s: Sewing machine manufacturers, led by the Singer Company, had begun to manufacture bicycles in increasing numbers.) Excelsior Needle also acquired controlling interest in two sales organizations—Boston-based S.M. Supplies Company and New York City-based C.B. Barker & Company—and moved beyond U.S. borders for the first time with the establishment of American Supplies Company in England.
Near the turn of the century, the steady growth during the 1880s and the multifarious outbursts of diversification and expansion during the 1890s had combined to create a prodigious manufacturing force with annual sales amounting to $768,000 by 1898. Much had transpired during the company's first 30 years of business: It had evolved from a small entrepreneurial company that manufactured sewing machine needle blanks to a diversified manufacturing concern which, by the century's conclusion, derived only 25 percent of its sales from the production of sewing needles.
The Torrington Company
Much, however, remained to be accomplished. Migeon and Alvord, still heading the company after three decades, looked to expand further, but the two executors of Excelsior Needle determined that the scope of their operations exceeded the financial clout of their local community. In pursuit of capital then, all the assets of Excelsior Needle were transferred in 1898 to The Torrington Company of Maine, organized two days prior to the transfer for just that purpose. Excelsior Needle acted as the operating company of its parent company, The Torrington Company of Maine, until 1917, when the directors of both companies decided to form a single corporate entity, The Torrington Company of Connecticut. Federal tax laws, however, stipulated that the exchange would result in the payment of capital gains tax, something the directors of the company wished to avoid, so for the next 19 years there were two Torringtons—The Torrington Company of Maine, which acted as a holding company for the second company, and The Torrington Company of Connecticut. Excelsior Needle, meanwhile, disappeared as a distinct corporate entity, continuing on merely as the "Excelsior Plant."
During the two decades bridging the formation of The Torrington Company of Connecticut in 1917 and its dissolution in 1936 when The Torrington Company of Maine absorbed its assets, the diversified manufacturing concern grew in stature, recording notable successes and a share of failures during an era pocked by global conflict. World War I brought Torrington into a new business line when the government requested that the well-known needle manufacturing concern begin producing surgical needles, a complex product to manufacture that Torrington had little interest and no experience in making. Before the war, Europe, particularly England, had been the primary source for surgical needles for the United States, but when World War II broke out, the supply of surgical needles into the United States slowed to a trickle. Torrington compensated for the precipitous drop in surgical needle imports, but only at the government's request. Spark plugs and marine engines, shipped to Torrington's subsidiary in England, and the production of 75 millimeter shells were also included in the company's war-time contributions, but unlike many other manufacturing concerns, Torrington was able to conduct business on a fairly normal level throughout the war, emerging from the war years as strong, if not stronger, than it had entered them.
After the war, Torrington recorded its first debilitative blunder during the 1920s when it began selling electrically powered vacuum cleaners. This debacle of the decade was offset by rousing success in producing wheel spokes for automobile wire wheels. By the 1930s, the Great Depression had created a need for Torrington to search for new business, the pursuit of which led to the most defining moment in the company's history. The epiphany that forever changed Torrington's future and the answer to the company's need for new business had roots stretching back 20 years earlier, back to 1912, when Torrington had acquired a small ball bearing business through an affiliation with an automobile ignition coil and spark plug manufacturer. Initially Torrington's ball bearing business represented a relatively small and insignificant facet of the company's business, but by the mid-1920s it had evolved into a respectable-sized manufacturing operation that produced a wide range of bearings and provided the foundation for a new, larger segment of Torrington's business in the 1930s.
Needle Roller Bearings
The person charged with drumming up new business during the Depression was a research engineer named Edmund K. Brown. He developed a new type of bearing for the company—a needle bearing—that eventually predicated the bulk of Torrington's business. On the heels of Brown's discovery came an important acquisition in 1935, when Torrington acquired the Bantam Ball Bearing Company. Brown's needle bearing and the addition of Bantam Ball Bearing signalled the beginning of a new era for Torrington, a future in which the production of bearings would fuel the company's growth and lift Torrington into the upper echelon of U.S. manufacturers.
This new chapter in the history of Torrington began with a decided flourish during World War II when the company once again manufactured surgical needles to supply the nation's war-time needs. In contrast to World War I, however, Torrington invested considerable effort toward manufacturing its new line of products—bearings. Needle bearings were supplied to the government for a variety of purposes, especially for uses in military aircraft and in B-29 bombers in particular, giving the company's bearing business sufficient momentum to emerge during the postwar era as the driving force propelling the company's growth.
During the two decades following the conclusion of World War II, Torrington's bearing business evolved into the company's mainstay product line, eclipsing the fabrication of needles as the company's primary source of revenue. By 1965, the sale of bearings accounted for more than 60 percent of Torrington's total sales, with needles, sold primarily to the textile and shoe industries, accounting for 30 percent of the company's sales volume.
During that time, Torrington has developed many types of needle bearings for highly specialized combat aircraft and guided missile applications.
Roller Bearings
The U.S. bearing industry by this point was a $1 billion business, having tripled in size since World War II. As a leading producer of a broad line of anti-friction bearings, including needle, ball, roller, and specialty bearings, Torrington had benefited immeasurably from the prolific growth of the bearing industry, while the company's host of other products buttressed its financial performance. In addition to bearings, Torrington's eight domestic plants were devoted to the manufacture of nuts, screws, bolts, metal specialties, spokes and nipples, drill bits, surgeon needles, hooking and felting needles, swaging machines, and a special purpose sewing machine, lending a diversity to the company's business lines that insulated it from cyclical economic conditions to a large extent. Beyond U.S. borders, the Torrington empire comprised manufacturing facilities in England, Canada, Germany, Brazil, Italy, Portugal, and in Japan, giving the company a sizeable presence in key international markets. The domestic and international operations created a solid manufacturing entity that flourished during the 1960s. Sales, which stood at $33.6 million in 1950, totaled $67.5 million in 1960, then shot upward to $93.4 million in 1965. The following year, Torrington celebrated two century marks by reaching its 100th anniversary in business as well as reaching over $100 million in sales. By all accounts, Torrington was a thriving manufacturer—a company that had earned the respect of competitors—and now, as it mapped its course for its second century of business, it began to attract the attention of a handful of suitors intent on acquiring the venerable manufacturing concern.
The Torrington Company was the largest US producer of bicycle pedals from the late 1920s thru the early 1980s that utilized their bearing design, they were the exclusive supplier to Columbia Bicycles (Pope Manufacturing) made in Westfield MA and Schwinn line of bicycles made in Chicago. The pedals are named for their relative size Ex. Torrington 10, or Torrington 20 and are considered to be a durable and excellent design. Well maintained original and restored examples that are intended to be used in classic bicycle restoration can sell for several hundred dollars per pair. The designs have been copied and good quality Asian examples generally sell for between $10 and $50 per pair.
Under Ingersoll-Rand (1968–2003)
Against the backdrop of a nationwide trend of mergers and acquisitions, the directors of Torrington realized that refusing every bid offered for the company was implausible and, perhaps, imprudent. In 1968 then, Torrington's management settled on Ingersoll-Rand, a diversified manufacturer of machinery, tools, and construction equipment. Through an exchange of stock valued at over $200 million, Torrington became an autonomous subsidiary of Ingersoll-Rand that year, embarking on its second century of business under the corporate umbrella of its parent.
As an autonomous subsidiary of Ingersoll-Rand, Torrington's second century began much as the first one had ended, with long-time Torrington officials presiding over the company's activities. New corporate headquarters were completed in 1970, marking the beginning of a decade that would see Torrington's financial performance sputter in the face of recessive economic conditions. Favorable developments came in the form of Torrington's involvement in the manufacture of steering column universal joints for the automotive industry and the continuing success of its needle bearing manufacturing business. Despite these developments, though, profits lagged throughout the decade, leading Ingersoll-Rand to exert its authority over Torrington for the first time by the decade's conclusion. Torrington's needle making business, an intrinsic and formative facet of the company's existence since its inception, was abandoned in 1980 after 114 years of contributing to the company's growth. Since the Ingersoll-Rand merger, Torrington's needle business had produced lackluster results and it was decided that both Torrington's and Ingersoll-Rand's future goals could best be accomplished without the business first launched by Migeon and Alvord.
Merger with Fafnir Bearing Company
Stripped of its needle business, Torrington entered the 1980s as primarily a bearing manufacturer, with needle bearings accounting for 49 percent of the company's sales and heavy bearings contributing another 30 percent. After several years of corporate restructuring, Torrington became a considerably larger bearing manufacturer when the company acquired Fafnir Bearing Company in 1985. Formed, like Torrington, in Connecticut, Fafnir had evolved into a leading bearing producer from its origination in 1911, becoming by the mid-1980s a precision ball bearing manufacturer serving the aerospace, machine tool, industrial, and agricultural industries with distinction. When the two bearing producers were combined in 1985, adding Fafnir's seven manufacturing facilities to Torrington's already numerous manufacturing facilities, the result was the largest bearing manufacturing company in North America and one of the largest in the world, with total sales amounting to roughly $750 million.
The addition of Fafnir provided a powerful boost to Torrington's stature as a bearing manufacturer, coming in a decade during which the company also hailed the accomplishment of significant developmental work in ceramic and sensor bearings. These achievements helped reduce the sting of the lamented divestment of its needle business. By the end of the 1980s, however, Torrington's situation had once again soured, as U.S. competitors in the $3 billion bearing business railed against unfair foreign competition. Torrington was among the pack charging that Asian and European bearing producers were selling bearings below their manufacturing cost, an illegal practice that carried into the early 1990s.
As Torrington sought to bring a favorable conclusion to the contentious legal debate addressing unfair trade practices, the company entered the mid-1990s as a stalwart industry leader. Part of Ingersoll-Rand's Bearings, Locks, and Tools business group, Torrington charted its future course beyond the mid-1990s, buoyed by its more than 125 years of successfully navigating through unseen waters. This legacy of success promised to serve the company well in the years to come, adding a rich history of experience to surmount whatever obstacles loomed in the future.
Under The Timken Company (2003–2009)
Timken approaches Ingersoll-Rand to purchase the industrial side of Torrington's business but soon got interested in its entirety as it realized Torrington's automotive business was stronger than originally thought. It was purchased in 2003 by the Timken Company.
Sold to JTEKT Corporation
Needle bearing plants along with Torrington brand name were sold to JTEKT in 2009 by the Timken Company.
The needle roller bearings business was part of the broader Torrington acquisition Timken made in 2003. The business had approximately 3,400 associates and manufactured highly engineered needle roller bearings, including an extensive range of radial and thrust needle roller bearings, as well as bearing assemblies and loose needles, for automotive and industrial applications.
The following Facilities were sold to JTEKT:
• North America: Cairo, GA; Dahlonega, GA; Sylvania, GA; Greenville, SC; Walhalla, SC; and Bedford, Quebec, Canada.
• Europe: Brno and Olomouc, Czech Republic; Maromme, Moult, and Vierzon, France; Kuensebeck, Germany; and Bilbao, Spain.
• Asia: LiYuan District, China.
References
External links
Companies based in Litchfield County, Connecticut
Sewing
Bearing manufacturers
|
```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
```
|
```c++
/*=============================================================================
file LICENSE_1_0.txt or copy at path_to_url
==============================================================================*/
#if !defined(BOOST_FUSION_ITERATOR_RANGE_SEGMENTS_HPP_INCLUDED)
#define BOOST_FUSION_ITERATOR_RANGE_SEGMENTS_HPP_INCLUDED
#include <boost/fusion/support/config.hpp>
#include <boost/mpl/assert.hpp>
#include <boost/fusion/sequence/intrinsic/segments.hpp>
#include <boost/fusion/support/is_segmented.hpp>
#include <boost/fusion/view/iterator_range/detail/segmented_iterator_range.hpp>
namespace boost { namespace fusion
{
struct iterator_range_tag;
namespace extension
{
template <typename Tag>
struct segments_impl;
template <>
struct segments_impl<iterator_range_tag>
{
template <typename Sequence>
struct apply
{
typedef
detail::make_segmented_range<
typename Sequence::begin_type
, typename Sequence::end_type
>
impl;
BOOST_MPL_ASSERT((traits::is_segmented<typename impl::type>));
typedef
typename result_of::segments<typename impl::type>::type
type;
BOOST_CONSTEXPR BOOST_FUSION_GPU_ENABLED
static type call(Sequence & seq)
{
return fusion::segments(impl::call(seq.first, seq.last));
}
};
};
}
}}
#endif
```
|
```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
```
|
```protocol buffer
//
//
// 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.
syntax = "proto3";
import "cartographer/transform/proto/transform.proto";
import "cartographer/mapping/proto/motion_filter_options.proto";
import "cartographer/mapping/proto/local_trajectory_builder_options_2d.proto";
import "cartographer/mapping/proto/local_trajectory_builder_options_3d.proto";
package cartographer.mapping.proto;
message InitialTrajectoryPose {
transform.proto.Rigid3d relative_pose = 1;
int32 to_trajectory_id = 2;
int64 timestamp = 3;
}
message TrajectoryBuilderOptions {
LocalTrajectoryBuilderOptions2D trajectory_builder_2d_options = 1;
LocalTrajectoryBuilderOptions3D trajectory_builder_3d_options = 2;
InitialTrajectoryPose initial_trajectory_pose = 4;
reserved 5;
bool pure_localization = 3 [deprecated = true];
message PureLocalizationTrimmerOptions {
int32 max_submaps_to_keep = 1;
}
PureLocalizationTrimmerOptions pure_localization_trimmer = 6;
bool collate_fixed_frame = 7;
bool collate_landmarks = 8;
MotionFilterOptions pose_graph_odometry_motion_filter = 9;
}
message SensorId {
enum SensorType {
RANGE = 0;
IMU = 1;
ODOMETRY = 2;
FIXED_FRAME_POSE = 3;
LANDMARK = 4;
LOCAL_SLAM_RESULT = 5;
}
SensorType type = 1;
string id = 2;
}
message TrajectoryBuilderOptionsWithSensorIds {
repeated SensorId sensor_id = 1;
TrajectoryBuilderOptions trajectory_builder_options = 2;
}
message AllTrajectoryBuilderOptions {
repeated TrajectoryBuilderOptionsWithSensorIds options_with_sensor_ids = 1;
}
```
|
SK Rapid Wien is an Austria professional football team formed in 1899. Throughout its history the club's first team has competed in various national and international competitions. All players who have played in 50 or more such matches are listed below.
Key
Players with name in bold currently play for the club.
Years are the first and last calendar years in which the player appeared in competitive first-team football for the club.
League appearances and goals comprise those in the Austrian Football Bundesliga and its predecessors of top-level league football in Austria, including the Gauliga from 1938 to 1945 during Austrias annexation by Nazi Germany.
Total appearances and goals comprise those in the League, Austrian Cup (replaced by the Tschammerpokal from 1938-45), Austrian Supercup and international appearances in UEFA competitions and the Mitropa Cup.
Players with 50 or more appearances
Appearances and goals are for first-team competitive matches only. Substitute appearances are included. Statistics are correct as of 29 October 2023.
Position key:
GK – Goalkeeper;
DF – Defender;
MF – Midfielder;
FW – Forward
References
General
Players – SK Rapid Wien at Rapidarchiv.at
Specific
Rapid Wien
Association football player non-biographical articles
|
The Essential Babyface is the eleventh album by R&B artist, Babyface and is a compilation of some of his singles. The release is part of Sony BMG's The Essential series.
Track listing
All songs are written by Babyface, except as noted.
"I Said I Love You" - 4:05
"Never Keeping Secrets" - 4:50
"Every Time I Close My Eyes" - feat. Mariah Carey & Kenny G - 4:57
"Talk to Me" - 4:54
"When Can I See You" - 3:49
"For the Cool in You" (Babyface, Daryl Simmons)- 4:53
"My Kinda Girl" (Babyface, Daryl Simmons, L.A. Reid) - 4:39
"Whip Appeal" Babyface, Perri "Pebbles" Reid - 5:47
"Soon as I Get Home" - 5:08
"Well Alright" (From Poetic Justice) - 4:00
"Day (That You Gave Me a Son)" - 4:26
"How Come, How Long" - feat. Stevie Wonder (Babyface, Stevie Wonder) - 5:11
"This Is for the Lover in You" - feat. Jeffrey Daniels, Howard Hewett, LL Cool J & Jody Watley (Howard Hewett, Dana Meyers) - 4:01
Medley: "I'll Make Love to You/End of the Road" [Live] (Babyface, Daryl Simmons, L.A. Reid) - 2:01
Medley: "I'll Make Love to You/End of the Road" (Continued) [Live] (Babyface, Daryl Simmons, L.A. Reid) - 3:53
References
Babyface (musician) compilation albums
2003 greatest hits albums
Sony Music compilation albums
Epic Records compilation albums
|
```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
```
|
Scott Matthew Emerson (born December 22, 1971) is an American professional baseball coach and former pitcher. He is the pitching coach for the Oakland Athletics of Major League Baseball.
Career
Emerson attended Shadow Mountain High School in Phoenix, Arizona, and Scottsdale Community College in Scottsdale, Arizona. He was drafted by the San Diego Padres in the 21st round of the 1990 MLB draft from Shadow Mountain High School and the Baltimore Orioles in the 40th round of the 1991 MLB draft from Scottsdale Community College. A former left-handed pitcher, he played in minor league baseball from 1992 through 1997, spending the first three seasons of his career with the Orioles' organization, and in the Boston Red Sox's organization 1995 through 1996. In 1997, Emerson played in the independent Texas–Louisiana League for the Rio Grande Valley White Wings.
Emerson reached AA before beginning his coaching career. In 2000, Emerson joined the Pittsburgh Pirates organization as Pitching Coach of the Gulf Coast League Pirates. In 2001, he was named Pitching Coach of their Class-A team, the Williamsport Crosscutters. He joined the Oakland Athletics minor league system as the pitching coach of the Modesto Athletics in 2002 where he spent two seasons. He spent 2005–2006 with the Stockton Ports and 2007–2010 with the Midland Rockhounds. He then spent two seasons in AAA with the Sacramento River Cats before being named the Minor League Pitching Coordinator in 2013.
Emerson has also coached internationally in the Mexican Pacific League with Cañeros de Los Mochis (2004) and the Phoenix Desert Dogs of the Arizona Fall League (2005).
After the 2014 season, the Athletics named Emerson their major league bullpen coach. He was promoted to the position of pitching coach on June 15, 2017.
Personal life
Emerson married his wife, Jill, in 2001. They reside in North Carolina.
Since 2011, Emerson has traveled to Europe each year in the off-season to coach for Purpose-Driven Baseball in the Czech Republic and other European countries.
References
External links
1971 births
Living people
Albany Polecats players
Baseball coaches from Arizona
Baseball coaches from Maryland
Baseball pitchers
Baseball players from Arizona
Baseball players from Baltimore
Bluefield Orioles players
Bowie Baysox players
Frederick Keys players
High Desert Mavericks players
Major League Baseball bullpen coaches
Minor league baseball coaches
Major League Baseball pitching coaches
Oakland Athletics coaches
Rio Grande Valley White Wings players
Sarasota Red Sox players
Scottsdale Fighting Artichokes baseball players
Trenton Thunder players
American expatriate baseball people in Mexico
|
Warren Montag (born March 21, 1952) is a professor of English at Occidental College in Los Angeles, California. He is known primarily for his work on twentieth-century French theory, especially Althusser and his circle, as well as his studies of the philosophers Spinoza, Locke, and Hobbes.
Overview
Montag's work has focused on the origins and internal contradictions of political liberalism and individualism, and has demonstrated, following the suggestions of Étienne Balibar, the existence of "a fear of the masses" (or multitude) in the classic texts of seventeenth century liberal thought. More recently, he has shifted to a study of the emergence of the concept of the market in the work of Adam Smith. Montag received his B.A. from the University of California, Berkeley and his M.A. and Ph.D. from Claremont Graduate University. He has published three books and three edited collections, and has translated many essays by Althusser. In addition, Montag has published more than forty essays. He resides in Los Angeles and is married with two children, Jacob Montag and Elisa Montag.
Publications
Books
Selected Essays (Leiden: E.J. Brill, forthcoming).
(Co-Editor) Systems of Life: Biopolitics, Economics, and Literature, 1750-1859 (New York: Fordham University Press, 2018).
(Co-Editor) Balibar and the Citizen Subject (Edinburgh: Edinburgh University Press, 2017).
(Co-Written) The Other Adam Smith (Stanford University Press, 2014).
Althusser and His Contemporaries: Philosophy's Perpetual War (Duke University Press, 2013).
Louis Althusser. (London: Palgrave, 2002).
(Co-Editor) Masses, Classes and The Public Sphere. (London: Verso, 2001).
Bodies, Masses, Power: Spinoza and his Contemporaries. (London: Verso, Spring 1999). (Spanish translation, Ediciones Tierra de Nadie, 2005; Italian translation, Edizioni Ghibili, forthcoming).
(Ed) In a Materialist Way: Selected Essays by Pierre Macherey. (London: Verso, 1998).
(Co-Editor) The New Spinoza. (Minneapolis: University of Minnesota Press, 1997).
The Unthinkable Swift: The Spontaneous Philosophy of a Church of England Man. (London: Verso, 1994).
Journal Special Issues
(Co-editor with Nancy Armstrong) differences: A Journal of Feminist Cultural Studies, Vol 20, n.3-4, 2009 ("The Future of the Human").
Essays
"Making Subjection Visible: The Materialist Effects of 1968," Crisis and Critique, 5:2 2018.
"Between Citizen and Subject," Radical Philosophy (2018) 2.02.
"Individuals Interpellable and Uninterpellable," Postmodern Culture (2017).
"Who/What, Before/After: the Unrest of the Subject," Cultural Critique (2017) 83 (1), 139-155.
(with Nancy Armstrong), "Is the Novel Literature?" Novel (2017) Novel: A Forum on Fiction 50 (3), 338-350.
(with Nancy Armstrong), "The Figure in the Carpet," PMLA, 2017.
"Legacies of the Russian Revolution: Power, Equality, Right," Crisis and Critique 4:2, 2017.
"The Last Instance: Resnick and Wolff at the Point of Heresy," Knowledge, Class, and Economics: Marxism without Guarantees. Ed. Rob Garnett. London: Routledge, 2017.
"Althusser's Empty Signifier: What is the Meaning of the Word "Interpellation?" Mediations (2017).
"Commanding the Body in Spinoza's Ethics." Spinoza's Authority, Ed. K. Kordela and D. Vardoulakis. London: Bloomsbury, 2017.
"'To Shatter All the Classical Theories of Causality': Immanent and Absent Causes in Althusser and Lacan (1963-1965)." The Concept in Crisis: Reading Capital Today. ed. N. Nesbitt. Durham: Duke University Press, 2017.
"A Parallelism of Consciousness and Property: Balibar's Reading of Locke," Balibar and the Citizen Subject. Ed. Montag and Elsayed. Edinburgh: Edinburgh University Press, 2017.
"The Prisoners of Starvation, or Necessitas dat Legem." New Formations. 2017, Issue 89/90.
"'Uno mero esecutore': Moses, Fortuna and Occasione in The Prince," Machiavelli's The Prince: Five Centuries of History, Conflict an Politics. Ed. F. Del Lucchese and V. Morfino (London: Palgrave, 2016).
"From Clinamen to Conatus: Deleuze, Lucretius and Spinoza," in Lucretius and Modernity, ed. Jacques Lezra. Palgrave Macmillan. 2016. French Translation.
"Discourse and Decree: Spinoza, Althusser, Pêcheux," Cahiers du GRM 7, 2015. Spanish Translation 2016.
"Althusser's Lenin," Diacritics (43:2) 2015. French version, 2015.
"Althusser's Authorless Theater," Differences (26:3) 2015. Spanish Translation 2017.
"Before the Beginning: On the question of Origins in Hegel" PMLA (130.3) 2015.
"Althusser and the Problem of Eschatology" Althusser and Theology. Ed Agon Hamza. London: Bloomsbury, 2016. Spanish translation 2017.
"Rancière's Lost Object" Cultural Critique. vol 83, Winter 2013. 139-155.
"Althusser: Law and the Threat of the Outside," Althusser and Law, ed. Laurent du Sutter. Routledge, 2013.
"Macherey entre le quotidien et l'utopie," La Revue des Livres (Mai-Juin 2013).
"Between Interpellation and Immunization: Althusser, Balibar and Esposito," Postmodern Culture, Vol. 33, Number 3, 2012. Spanish translation 2014.
"Conjuncture, Conflict, War: Machiavelli Between Althusser and Foucault (1975-1976)," Encountering Althusser, ed. Peter Thomas. Continuum, 2012.
"Hegel, sive Spinoza, or Hegel as his Own True Other," Hegel after Spinoza, ed. Hasana Sharp and Jason Smith. Continuum 2012. Italian translation, 2014.
"El afuera de la ley: Schmitt, Kelsen y la Resistencia legal a la ley," Youkali 13 (2012).
"To discompose and disorder the whole machine of the world:" Adam Smith, Epicurus and Lucretius," Rivista di storia della filosofia 67:2 (2012): 267-276.
Introduction to Louis Althusser, "Student Problems," Radical Philosophy 170, Nov-Dec 2011.
"Immanence, Transcendence and the Trace: Derrida between Levinas and Spinoza," Badmidbar: a Journal of Jewish Thought and Philosophy, 2, Autumn 2011.
"Lucretius Hebraizant: Spinoza's Reading of Ecclesiastes," European Journal of Philosophy, 20 (2012). Spanish translation, Spinoza contemporaneo. Ed. Galcerán and Espinoza. Madrid: Tierradenadie ediciones, 2009.
"Louis Althusser." The Encyclopedia of Continental Philosophy. Vol. 6, ed. Alan Schrift. London: Acumen Press, forthcoming.
“The Late Althusser: Materialism of the Encounter or Philosophy of Nothing?” Culture, Theory and Critique, Vol. 51, Issue.2, pp. 157–70, 2010; Religgere Il Capitale: La lezione di Louis Althusser. Edizione Mimesis (Italian Translation), forthcoming; Problemi (Slovenian trans.), forthcoming.
"Interjecting Empty Spaces: Imagination and Interpretation in Spinoza's Tractatus Theologica-Politicus" in Spinoza Now ed. Dimitris Vardoulakis, University of Minnesota Press, 2011.
"Spectres d' Althusser," La revue internationale des livres et des idées, janvier-février 2010, no. 15. English version, Historical Materialism.
"Imitating the Affects of Beasts: Interest and Inhumanity in Spinoza," differences: A Journal of Feminist Cultural Studies. Vol 20, n.3-4, 2009. (Spanish translation 2009) (Italian translation forthcoming).
"War and the Market: The Global South in the Origins of Neo-liberalism." The Global South, April 2009, Vol.3, no.1.
"Locke et le concept d'inhuman." Multitudes. no.33, Eté 2008.
"Semites, ou la fiction de l'autre." (review essay) La revue internationale des livres et des idees. mai-juin 2008, no.5
"Tumultuous Combinations: Transindividuality in Adam Smith and Spinoza," Graduate Faculty Philosophy Journal 28(1)2007.
"El peligroso derecho a la existencia: la necroeconomia de Von Mises y Hayek." Youkali. 2 November 2006.
"Necro-Economics: Adam Smith and Death in the Life of the Universal," Radical Philosophy (November 2005), Youkali 1 April 2006 (Spanish translation), Critica Marxista 23, 2006 (Portuguese trans.).
"Jonathan Swift." Encyclopedia of British Literary History, Oxford University Press, 2006.
"Louis Althusser: the Intellectual and the Conjuncture." Marxism, Intellectuals and Politics, ed. David Bates, London: Palgrave, 2006. Abridged version in Il Manifesto. Nov. 9, 2006 (Italian translation).
"Foucault: the Immanence of Law in Power." Michel Foucault and Social Control, ed. Alain Beaulieu and David Gabbard, Lexington Press, 2005; French version Editions Harmattan, forthcoming).
"Foucault and the Problematic of Origins: Althusser’s Reading of Folie et déraison." Borderlands 4.2, 2005. Actuel Marx (French trans. 2004); Theseis (Greek trans. 2004).
"Who’s Afraid of the Multitude: Between the Individual and the State." South Atlantic Quarterly (Fall 2005). Slagmark n.39 2004 (Danish trans.); Quaderni Materialisti n.2 2004 (Italian trans.); Theseis (Greek trans. 2004).
"Spinoza's Spirit: the Concept of the Trace in Levinas and Derrida" Specters of Derrida, ed. Julian Wolfreys (SUNY Press, forthcoming). Oltrecorrente (Italian trans. forthcoming).
"On the Function of the Concept of Origin: Althusser’s Reading of Locke", Current Continental Theory and Early Modern Philosophy, ed. Stephen Daniels (Northwestern U P: 2006).
"Materiality, Singularity, Subject: Response to Callari, Hardt, Parker and Smith", Symposium on Louis Althusser, Rethinking Marxism(17:2, April 2005).
"Politics: Transcendent or Immanent? A response to Miguel Vatter," Theory and Event (7:4, 2004).
"Der neue Spinoza" Immaterielle Arbeit und imperiale Souveräinität ed. Thomas Atzert and Jost Müller (Munster: Westfälisches Dampfboot, 2004).
"La dialectique à la cantonade: Althusser devant l’art." Sartre, Althusser, Lukacs ed. Eustache Kouvelakis (Paris: Presses Universitaires de France, 2004).
"Towards a Conception of Racism without Race: Foucault and Contemporary Bio-politics," Pli: The Warwick Journal of Philosophy (2002).
"From the Standpoint of the Masses: Antonio Negri’s Insurgencies" (review essay) Historical Materialism 9 2002.
"Descartes and Spinoza" and "Althusser" The Edinburgh Encyclopedia of Literary Criticism and Theory 1945-2000, ed. Julian Wolfreys (Edinburgh: Edinburgh U P, 2002).
"Vers une conception du racisme sans race: Foucault et la biopolitique contemporaine", Foucault et la médecine ed. Philippe Artières et Emmanuel da Silva (Paris: Kimé, 2001).
"Gulliver’s Solitude: the Paradoxes of Swift’s Anti-Individualism", Eighteenth-Century: Theory and Interpretation 42:1 2001.
"The Pressure of the Street: Habermas’s Fear of the Masses", Masses, Classes, Counterpublics, ed. Mike Hill and Warren Montag (London: Verso, 2001)
"Spinoza and the Concept of the Shekhinah." Jewish Themes in Spinoza's Philosophy, ed. Lenn Goodman and Heidi Ravven. (Albany: SUNY Press, 2002).
Preface to Etienne Balibar, Spinoza and Politics (London: Verso, 1998).
"Althusser's Nominalism: Structure and Singularity 1962-1966." Rethinking Marxism 10:3 (Fall 1998).
"Spirits Armed and Unarmed: Derrida's Specters", Ghostlier Demarcations ed. Michael Sprinker (London: Verso,1999)(Spanish translation, 2002, Turkish translation 2004, Portuguese translation 2008, Italian translation 2009).
"Second Response to Carole Fabricant" (on Swift), Eighteenth-Century Fiction, 10:1, 1997.
"Response to Carole Fabricant" (on Swift), Eighteenth-Century Fiction, 9:1, 1996.
"The Universalization of Whiteness: Racism and Enlightenment", Whiteness: A Critical Reader, ed. Mike Hill (New York: New York University Press, 1997).
"The Soul is the Prison of the Body: Althusser and Foucault 1970-1975", Yale French Studies, Fall 1995.
"Beyond Force and Consent: Hobbes, Spinoza, Althusser." Marxism and Postmodernism: Essays in the Althusserian Tradition, eds. Antonio Callari and David Ruccio (Middletown: Wesleyan University Press, 1995). (Korean translation 1998, Norwegian translation forthcoming).
"A Process without a Subject or Goal(s): How to Read Althusser's Autobiography", Marxism in the New World Order: Crises and Possibilities, ed. Antonio Callari (New York: Guilford Press, 1995) (Korean translation 1996; Greek translation 1998).
"Althusser and Spinoza Against Hermeneutics: Interpretation or Intervention?" The Althusserian Legacy, eds. E. Ann Kaplan and Michael Sprinker (London: Verso, 1993).
"The Workshop of Filthy Creation: A Marxist Reading of Frankenstein in Mary Shelley's Frankenstein: A Case Study in Contemporary Criticism." eds. Ross C. Murfin and Johanna Smith (New York: St. Martin's Press, 1991, Second Edition, 2000).
"The Emptiness of a Distance Taken: Freud, Lacan, Althusser." Rethinking Marxism, Spring, 1991 (Korean translation, 1994).
"Spinoza: Politics in a World Without Transcendence", Rethinking Marxism, Fall 1989. (Swedish translations 2004).
"What is at Stake in the Debate on Postmodernism", Postmodernism and Its Discontents, (London: Verso, 1988). (Korean Translation 1990, Portuguese translation 1993).
"Macherey and Literary Analysis", Minnesota Review, Spring 1986.
"Lacan and Feminine Sexuality", Quarterly Review of Film Studies, Fall 1985.
"Marxism and Psychoanalysis: The Impossible Encounter." Minnesota Review, Fall 1984 (Korean Translation 1992).
Translations
Louis Althusser, "Letter on Gramsci," Decalages 2.1.
Etienne Balibar, "Schmitt's Hobbes, Hobbes' Schmitt," Balibar and the Citizen Subject (Edinburgh: Edinburgh University Press, 2017).
Etienne Balibar, Identity and Difference: Locke's Invention of Consciousness, (Verso, 2013).
(with Willi Goetschel) Jacques Derrida, "Language and the Discourse of Method," Badmidbar: a Journal of Jewish Thought and Philosophy, 2, Autumn 2011.
Louis Althusser, "On Marx and Freud." Rethinking Marxism, Spring, 1991.
Louis Althusser, Philosophy and the Spontaneous Philosophy of the Scientists: And Other Essays, (London: Verso, 1990).
Michel Pêcheux, "Discourse: Structure or Event?" Marxism and the Interpretation of Culture. (Urbana, University of Illinois Press, 1988).
Pierre Macherey, "History and Novel in Balzac's The Peasants." Minnesota Review, Spring 1986.
Literary Translations
Jorge Luis Borges, "Clouds," Ambit 2019
Interviews, and Shorter Scholarly and Political Texts
Althusser, Spinoza and Revolution in Philosophy, Voices of the Left, London: Redmarks, 2019 (Italian and Greek translations 2018).
Netflix's Trotsky, Left Voice, March 11, 2019 (Spanish, German, Catalan, and Turkish translations, 2019).
"Reassessing Althusser on his 100th Anniversary," Left Voice, October 16, 2019 (Spanish translation, 2019).
Althusser's Machiavellian Line, (English original with French translation), 2018. Papiers Althusser.
Introduction to "Louis Althusser - 'Michel Verret's Article on the "student May"' (2018)
"July 5, 2015 Oxi: an Open Letter in Support of the Greek People" (English original with Greek Translation)
"The Tenth Anniversary of Hurricane Katrina" The Philosophical Salon (2015)
External links
Montag sites and homepages
Décalages: An Althusser Studies Journal Montag is listed as the Editor of this journal. At the site, articles are available in pdf format (follow endnote link here for a further description of this journal)~>
Montag's Faculty Homepage at Occidental College
Online publications
'Foucault and the Problematic of Origins': Althusser's Reading of Folie et déraison an essay by Montag published in the e-journal "borderlands" in 2005
Who's Afraid of the Multitude?: Between the Individual and the State
Interviews and talks
What's Left after Iraq?: An interview with Warren Montag This interview was conducted by Tassos Betzelos, on 12 March 2004. For more information on the circumstances of this interview, see the endnote
Spinoza and philosophers today Montag's remark here are made in a kind of "round-table" discussion.
Endnotes and references
1952 births
Living people
American academics of English literature
University of California, Berkeley alumni
Marxist theorists
Spinoza scholars
|
Resistencia Aeroclub Airport is a rural airport southwest of Resistencia, a city in the Chaco Province of Argentina.
The Resistencia VOR-DME (Ident: SIS) is located north-northeast of the airport. The Resistencia non-directional beacon (Ident: SIS) is located north-northeast of Aeroclub Airport.
See also
Transport in Argentina
List of airports in Argentina
References
External links
OpenStreetMap - Aeroclub Airport
OurAirports - Aeroclub Chaco Airport
Airports in Chaco Province
|
```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');
```
|
Sir Isaac Newton (1642–1726) was an English philosopher, mathematician and scientist.
Isaac Newton may also refer to:
Places
8000 Isaac Newton, a main-belt asteroid, the 8000th asteroid registered
Isaac Newton University Lodge, University of Cambridge, Cambridge, Cambridgeshire, England, UK; a Masonic lodge
Isaac Newton Institute for Mathematical Science, University of Cambridge, Cambridge, Cambridgeshire, England, UK
Sir Isaac Newton Sixth Form. Norwich, Norfolk, England, UK; a sixth form college secondary school for students aged 16–19
Statal Institute of Higher Education Isaac Newton, Varese, Lombardy, Italy; a secondary school
Isaac Newton Group of Telescopes, Roque de los Muchachos Observatory, La Palma, Canary Islands, Spain
Isaac Newton Telescope, Roque de los Muchachos Observatory, La Palma, Canary Islands, Spain
Other uses
Isaac Newton (agriculturalist) (1800–1867), a U.S. agriculturalist
Isaac Newton Gargoyle, University of Oregon, Eugene, Oregon, USA; a sculpture, a gargoyle of Isaac Newton
Institute of Physics Isaac Newton Medal, an annual award presented by the Institute of Physics
See also
List of things named after Isaac Newton
Isaac Newton in popular culture
Newton (disambiguation)
Isaac (disambiguation)
|
The Boys' Greco-Roman 51 kg competition at the 2018 Summer Youth Olympics was held on 12 October at the Asia Pavilion.
Competition format
As there were less than six wrestlers in a weight category, the pool phase will be run as a single group competing in a round robin format. Ranking within the groups is used to determine the pairings for the final phase.
Schedule
All times are in local time (UTC-3).
Results
Legend
F — Won by fall
Group Stages
Group A
Group B
Finals
Final rankings
References
External links
Sheet
Wrestling at the 2018 Summer Youth Olympics
|
```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'
};
```
|
```turing
#
# This software may be used and distributed according to the terms of the
# directory of this source tree.
$ . "${TEST_FIXTURES}/library.sh"
setup configuration
$ default_setup_blobimport "blob_sqlite"
hg repo
o C [draft;rev=2;26805aba1e60]
o B [draft;rev=1;112478962961]
o A [draft;rev=0;426bada5c675]
$
blobimporting
Check that sqlblob has some data big enough to form a chunk
$ for s in 0 1; do sqlite3 -readonly "$TESTTMP/blobstore/blobs/shard_${s}.sqlite" "SELECT COUNT(1) FROM chunk" ; done
0
1
Check that chunk_generations populated from put and they have length
$ for s in 0 1; do sqlite3 -readonly "$TESTTMP/blobstore/blobs/shard_${s}.sqlite" "SELECT COUNT(1), last_seen_generation, value_len FROM chunk_generation" | sed "s/^/$s /"; done
0 0||
1 1|2|199
Run sqlblob_gc generation size report
$ mononoke_sqlblob_gc --storage-config-name=blobstore --shard-count=2 generation-size 2>&1 | strip_glog
Generation | Size
-----------------
2 | 199 B
Total size: 199 B
Run sqlblob_gc generation size report again, just to check mark has not broken it
Run sqlblob_gc mark
$ mononoke_sqlblob_gc --storage-config-name=blobstore --shard-count=2 mark 2>&1 | strip_glog
Starting initial generation set
Completed initial generation handling on shard * (glob)
Completed initial generation handling on shard * (glob)
Completed initial generation set
Starting marking generation 1
Starting mark on data keys from shard 0
Starting mark on data keys from shard 1
Completed marking generation 1
Run sqlblob_gc generation size report again, just to check mark has not broken it
$ mononoke_sqlblob_gc --storage-config-name=blobstore --shard-count=2 --scuba-dataset file://scuba.json generation-size 2>&1 | strip_glog
Generation | Size
-----------------
2 | 199 B
Total size: 199 B
Check the sizes are logged
$ jq -r '.int | [ .shard, .generation, .size, .chunk_id_count, .storage_total_footprint ] | @csv' < scuba.json | sort
,,,,199
1,2,199,1,
```
|
Acinetobacter dispersus is a bacterium from the genus of Acinetobacter.
References
External links
Type strain of Acinetobacter dispersus at BacDive - the Bacterial Diversity Metadatabase
Moraxellaceae
Bacteria described in 2016
|
```shell
Detect your linux distribution
Removing old kernels in Debian based systems
Common log files
Incorrect time on dual boot systems
Check the HDD with `badblocks`
```
|
Structural composite supercapacitors are multifunctional materials that can both bear mechanical load and store electrical energy. That when combined with structural batteries, could potentially enable an overall weight reduction of electric vehicles.
Typically, structural composite supercapacitors are based on the design of carbon fiber reinforced polymers. Carbon fibrers act as mechanical reinforcement, current collectors, and eventually electrodes.
The matrix of a Structural composite supercapacitor is a polymer electrolyte that transfers load via shear mechanisms between the carbon fibers and has a reasonable ionic conductivity.
In a supercapacitor, the specific capacitance is proportional to the exact surface area of the electrodes. Structural carbon fibers usually have low specific surface area, and is therefore necessary to modify their surface to enable sufficient energy storage ability. To increase the surface area of the structural electrodes, several methods have been employed, mainly consisting in the modification of the surface of the carbon fiber itself, or by coating the carbon fiber with an exact surface area material.
Physical and chemical activation of the carbon fibers have increased their specific surface area by two orders of magnitude without damaging their mechanical properties, but have limited energy storage ability when combined with a structural polymer electrolyte. Coating carbon fibers with carbon nanotubes, carbon aerogel, or graphene nanoplatelets allowed for higher energy densities.
References
Capacitors
Energy conversion
Electric vehicles
Composite materials
|
Stephen Craine McLendon (born January 3, 1986) is an American football nose tackle who is a free agent. He was signed by the Pittsburgh Steelers as an undrafted free agent in 2009. He played college football at Troy.
Professional career
Pittsburgh Steelers
McLendon was signed by the Steelers as an undrafted free agent on April 27, 2009. He was a final cut on September 5 but re-signed to the practice squad the next day. He was released on November 25 but re-signed on December 2. He was signed to a reserve/future contract on January 7, 2010.
McLendon was a final cut for the second straight season when he was waived on September 4, 2010. He was re-signed to the practice squad the following day. The Steelers signed McLendon to their active roster on September 18 and he appeared in their game at Tennessee. He recovered a fumble in that game and made one tackle. He was waived again on September 20 but re-signed to the practice squad on September 22. On October 2, quarterback Dennis Dixon was placed on injured reserve and McLendon was called up again. McLendon was waived on October 7 to make room for Ben Roethlisberger, who returned from his 4-game suspension. McLendon was re-signed to the Steelers' practice squad on October 11. McLendon was again signed to the active roster on October 30. He played in seven games for the entire season, recording one more tackle bringing his total tackles for the season to two. The Steelers finished the season with a 12–4 record to clinch the AFC North, and eventually reached Super Bowl XLV, only to lose to the Green Bay Packers 25–31.
In the 2011 season, McLendon appeared in a career high fourteen games. He totaled 13 tackles with one sack. For the 2012 season he played in all 16 games, registering seven tackles and two sacks. After the season, McLendon became a restricted free agent. McLendon visited with the Green Bay Packers before resigning with the Steelers for a three-year deal worth $7.25 million, including $1.675 million guaranteed. In the 2013 season, he appeared in 14 games with 33 tackles and a forced fumble. In 2014, he played in 12 games with 22 tackles and a sack. In 2015, he appeared in all 16 games for the first time of his career, finishing the year with 14 tackles and a sack.
New York Jets
On March 16, 2016, the New York Jets signed McLendon to a three-year, $12 million contract with $4 million guaranteed. Making his first start for the Jets on September 11, 2016, McLendon had tied a career high two sacks of the team's six sacks in the Week 1 loss against Cincinnati Bengals.
On March 14, 2019, McLendon re-signed with the Jets. He signed a one-year contract extension on October 12, 2019 through the 2020 season.
Tampa Bay Buccaneers
On October 18, 2020, McLendon and a 2023 seventh-round pick were traded to the Tampa Bay Buccaneers for a 2022 sixth-round pick. He was placed on the reserve/COVID-19 list by the Buccaneers on January 1, 2021, and activated on January 11. McLendon appeared in Super Bowl LV, where the Buccaneers defeated the Kansas City Chiefs by a score of 31–9.
McLendon re-signed with the Buccaneers on April 14, 2021. In a Monday Night Football game on November 22, 2021, McLendon recorded his first career interception after twelve seasons in the NFL, intercepting a pass from Daniel Jones of the New York Giants in the game's third quarter. He became the second-oldest player to record his first career NFL interception.
References
External links
Tampa Bay Buccaneers bio
New York Jets bio
Pittsburgh Steelers bio
Troy Trojans bio
Living people
1986 births
People from Ozark, Alabama
Players of American football from Alabama
American football defensive tackles
American football defensive ends
Troy Trojans football players
Pittsburgh Steelers players
New York Jets players
Tampa Bay Buccaneers players
|
Cirrhicera conspicua is a species of beetle in the family Cerambycidae, and is a part of the subfamily Lamiinae. It was described by Gahan in 1892. It is commonly found in Mexico.
References
Hemilophini
Beetles described in 1892
|
```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
```
|
Durrell is a community on the southern island of Twillingate, Newfoundland and Labrador, Canada. The village is located off Route 340, named Durrell Street. It is a part of the Town of Twillingate.
A popular tourist destination in Durrell is the Durrell Museum, located on Museum Street. It features many different historical exhibits including a polar bear that once set foot on Twillingate island.
Durrell has one department store, which has groceries and hardware, other stores are found in the nearby main town of Twillingate. There are no educational institutions in the village either, instead residents travel to Twillingate for elementary, middle and high school.
Durrell is split into many different "divisions", which aren't marked today but still are known by past and current residents of the area including Upper Jenkins Cove (mainly Upper Jenkins Cove Road; Gillesport Road area), Lower Jenkins Cove (Durrell Street) and Gillesport (Farmers Arm Road - Howlett's Road). There are many other side streets around the village.
See also
Twillingate
Crow Head
Little Harbour
Purcell's Harbour
Bayview
Back Harbour
External links
J.M. Olds Collegiate - High School G7-G12
Twillingate Elementary - K-6
Former towns in Newfoundland and Labrador
Populated places in Newfoundland and Labrador
|
```javascript
import Link from 'next/link'
import { useRouter } from 'next/router'
export default function Page(props) {
const router = useRouter()
return (
<>
<p id="props-locale">{props.locale}</p>
<p id="router-locale">{router.locale}</p>
<Link
href={{ pathname: router.pathname, query: router.query, hash: '#hash' }}
locale={router.locale === 'fr' ? 'en' : 'fr'}
id="change-locale"
>
Change Locale
</Link>
</>
)
}
export const getStaticProps = async ({ locale }) => {
return {
props: {
locale,
},
}
}
export const getStaticPaths = () => {
return {
paths: [
{
params: { slug: ['a'] },
locale: 'en',
},
{
params: { slug: ['a'] },
locale: 'fr',
},
],
fallback: false,
}
}
```
|
Rucava Parish () is an administrative unit of South Kurzeme Municipality, Latvia. The parish has a population of 1250 (as of 1/07/2010) and covers an area of 238.1 km2.
Villages of Rucava Parish
Parishes of Latvia
South Kurzeme Municipality
Courland
|
Dowlabad (, also Romanized as Dowlābād) is a village in Nakhlestan Rural District, in the Central District of Kahnuj County, Kerman Province, Iran. At the 2006 census, its population was 559, in 120 families.
References
Populated places in Kahnuj County
|
```php
<?php
/**
* This file is part of the Carbon package.
*
* (c) Brian Nesbitt <brian@nesbot.com>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
/*
* Authors:
* - Ge'ez Frontier Foundation locales@geez.org
*/
return array_replace_recursive(require __DIR__.'/en.php', [
'formats' => [
'L' => 'DD/MM/YYYY',
],
'months' => ['', '', '', '', '', '', '', '', '', '', '', ''],
'months_short' => [' ', '', '', '', '', ' ', '', '', '', '', '', ''],
'weekdays' => [' ', '', '', '', '', '', ' '],
'weekdays_short' => ['//', ' ', '', '', '', '', '//'],
'weekdays_min' => ['//', ' ', '', '', '', '', '//'],
'first_day_of_week' => 1,
'day_of_first_week_of_year' => 1,
'meridiem' => [' ', ' '],
'year' => ':count ', // less reliable
'y' => ':count ', // less reliable
'a_year' => ':count ', // less reliable
'month' => ':count ', // less reliable
'm' => ':count ', // less reliable
'a_month' => ':count ', // less reliable
'week' => ':count ', // less reliable
'w' => ':count ', // less reliable
'a_week' => ':count ', // less reliable
'day' => ':count ', // less reliable
'd' => ':count ', // less reliable
'a_day' => ':count ', // less reliable
'hour' => ':count ', // less reliable
'h' => ':count ', // less reliable
'a_hour' => ':count ', // less reliable
'minute' => ':count ', // less reliable
'min' => ':count ', // less reliable
'a_minute' => ':count ', // less reliable
'second' => ':count ',
's' => ':count ',
'a_second' => ':count ',
]);
```
|
The Companions of Jehu were formed in the Lyon region of France in April 1795 to hunt down Jacobins implicated in the Reign of Terror. It is possible that they were founded by the Marquis de Besignan, who also founded royalist underground groups in Forez and Dauphiné with the Prince of Condé in 1796. Their victims are believed to have numbered at least in the hundreds. They were made famous by the 1857 novel The Companions of Jehu by Alexandre Dumas which presented a highly romanticised account of them.
Origins of the name
Jehu is an Old Testament character, immortalised in Jean Racine's drama Athalie. Jehu was famous for killing Jezebel by having her thrown out of a window and stomping her to death. According to the Books of Kings, Jezebel was responsible for inciting her husband King Ahab to embrace the cult of Baal, outlaw the Jewish religion, and subject all suspected worshippers of the God of Israel to religious persecution and mass murder. She also brought false testimony against Naboth and had him killed, and was the cause of much violence and bloodshed. By analogy, Jezebel represented the Jacobin single party state, responsible for similarly persecuting the Catholic Church in France, using judicial murder against both real and imagined dissidents, and spreading violence and bloodshed through the Reign of Terror. By the same analogy, Jehu was the force of righteous retribution, come to restore the true religion, and kill Jezebel, her children and all those who had turned away from the God of Israel. The reference to Jehu was not universally understood however, and through misunderstanding, uncertain repetition and assimilation with the broader idea of religious restoration, many people referred to the Companions of Jesus instead of the Companions of Jehu, despite this name being essentially meaningless, as was pointed out by Louis Blanc.
The first reference to their existence appears in the records of the National Convention in a report presented on 25 June 1795 from Marie-Joseph Chénier on the recent killings in Lyons. His account says:
Activities
On 4 May 1795, 99 Jacobin prisoners were massacred in the town prisons by members of the companions. Over the following days the violence became more widespread and more murders took place as Jacobins were drowned, beaten to death and had their throats cut in their own homes or in the streets. The newspapers encouraged the murder of Terrorists and Drinkers of Blood, and a list of people to be targeted, ninety pages long, was published in Lausanne and openly circulated. This phase of the White Terror continued until the army re-established control and various ringleaders were arrested and brought before the criminal court of Isère. The number of victims of the Companions of Jehu is impossible to know, because there is no reliable way of distinguishing between organised murders and more chaotic lynchings.
An order of 23 May 1796 by General Mointchoisy directed that "to prevent the assassinations committed by the Companions of Jesus, it is forbidden to all citizens under any pretext whatsoever to carry swordsticks, throwing sticks, or batons weighted with lead or iron."
Questions over their existence
Some historians, including Jacques Godechot, have argued that the Companions of Jehu never actually existed. According to Lenotre, the Directory sought to identify and punish royalists, emigres and refractory priests, and actively looked for people associated with the Companions of Jehu. However although various criminals were arrested, none of them was a priest, emigre or royalist. All those arrested for murder and other serious crimes had been acting independently and there was no organised movement or any coordination between them. The tribunal, under Legris, concluded that there were no registers or membership lists for the Companions of Jehu. Later, under Louis XVIII, many royalists who had played very minor parts in resisting the revolution received pensions or decorations, but nobody ever came forward and claimed to have been a member of the Company of Jehu.
Les Compagnies du Soleil
While the Companions of Jehu were organised in and around Lyon, a similar group known as 'les Compagnies du Soleil' (The Companions of the Sun) formed and was active in Provence and Gard. The company's members considered it a sign of strength to carry the symbol of a splash of blood on their hands. During the White Terror a group of Jacobins was able to take control of the city of Toulon from 17 to 23 May 1795, and the Companions of the Sun were particularly associated with the repression and reprisals which took place after the army under General Pactod regained control of the city.
See also
1966 TV drama :fr:Les Compagnons de Jéhu (mini-série) (in French)
References
Organizations based in Lyon
French Revolution
French counter-revolutionaries
French monarchists
French Ultra-royalists
Political and cultural purges
Political repression in France
White Terror
1795 events of the French Revolution
1796 events of the French Revolution
French Roman Catholics
|
John “Chris” Christiansen (May 1, 1923 － September 12, 1998) was the chief military test pilot for Lockheed California Company for over 30 years. He might be most known for having performed Lockheed S-3 Viking's maiden flight on January 21, 1972. His assignments also included the initial test flights of Lockheed P-3 Orion. Christiansen was born in Oslo, Norway in 1923 and became an American citizen in 1939. He later served in the U.S. Navy during World War II and the Korean War. He began experimental flying for Lockheed Martin in 1953, and worked there until his retirement in 1984. He was a fellow at Society of Experimental Test Pilots.
He retired in May 1984 after 31 years as an experimental test pilot for Lockheed Martin. He moved to Tarzana, Los Angeles following his retirement. He died on September 12, 1998, in Lake Havasu City, Arizona.
Christiansen is honored at the U.S. Navy Patrol and Reconnaissance Memorial on Naval Air Station Whidbey Island in Washington, which was erected by the United States Navy. The memorial inscription reads: "Special thanks to Mr. John Christiansen for his many contributions to the development and testing of the P-3. Lockheed P-3 Orion. Missions: Patrol, Antisubmarine Warfare, Electronic Warfare and Reconnaissance."
References
1923 births
1998 deaths
Lockheed people
American test pilots
Lockheed Martin
Lockheed P-3 Orion
Norwegian emigrants to the United States
|
Sayada () is a city in the Sahel region of Tunisia. It is located about fifteen kilometers south of Monastir. It is part of the administrative governorate of Monastir, and is the county seat of the Sayada-Lamta-Bou Hajar Delegation which has a population of 22,944.
Description
The town is based around a small hill that overlooks the and the two small islands that make up the Kuriat archipelago. The built up area extends for over a mile in every direction from the hill but especially towards the flat tidal area.
Sayada is joined in a "delegation" with the smaller communities of Bouhjar and Lemta (which historically was known as Leptiminus and is still the site of international archaeology). Sayada itself is within the Monastir Governorate which administers the larger area from the city Monastir which is 12 miles inland.
Born here
Rachid Ammar, Chief of Staff of the Tunisian Armed Forces
Tahar Cheriaa, film critic and creator of the Carthage Film Festival
Naceur Ktari, award-winning film director
Notes
External links
Populated places in Monastir Governorate
Communes of Tunisia
|
The Fourth Philippine Legislature was the meeting of the legislature of the Philippine Islands under the sovereign control of the United States from October 16, 1916, to March 8, 1919.
Sessions
Legislation
The Fourth Philippine Legislature passed a total of 204 laws (Act Nos. 2665 – 2868).
Leadership
Senate
President of the Senate
Manuel L. Quezon (Nacionalista, Fifth District)
Majority Floor Leader:
Francisco F. Villanueva (Nacionalista, Seventh District)
House of Representatives
Speaker of the House of Representatives
Sergio Osmeña (Nacionalista, 2nd District Cebu)
Members
Senate
All elected senators of this Legislature were elected on October 3, 1916 for the following terms, according to their ranking in their senatorial districts:
For first ranking senators: October 16, 1916 – June 6, 1922
For second ranking senators: October 16, 1916 – June 3, 1919
Senators of the 12th District were appointed for indefinite terms.
House of Representatives
Notes
See also
Congress of the Philippines
Senate of the Philippines
House of Representatives of the Philippines
References
External links
Further reading
Philippine House of Representatives Congressional Library
04
|
```xml
<Project Sdk="Microsoft.NET.Sdk.WindowsDesktop">
<PropertyGroup>
<OutputType>WinExe</OutputType>
<UseWindowsForms>true</UseWindowsForms>
<TargetFrameworks>netcoreapp3.1</TargetFrameworks>
<RuntimeIdentifiers>win-x64;win-x86</RuntimeIdentifiers>
</PropertyGroup>
<PropertyGroup>
<AssetTargetFallback>uap10.0.19041</AssetTargetFallback>
<ApplicationManifest>app.manifest</ApplicationManifest>
<StartupObject>UnitTests.XamlIslands.Program</StartupObject>
</PropertyGroup>
<ItemGroup>
<ProjectReference Include="..\UnitTests.XamlIslands.UWPApp\UnitTests.XamlIslands.UWPApp.csproj" />
</ItemGroup>
<ItemGroup>
<PackageReference Include="Microsoft.Toolkit.Forms.UI.XamlHost" Version="6.1.2" />
</ItemGroup>
</Project>
```
|
```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;
```
|
Schloss Mosbach (Mosbach castle) is a castle in Mosbach, Neckar-Odenwald district, Baden-Württemberg, Germany, dating back to the 14th century.
History
The first evidence of the construction of the residence in Mosbach can be traced back to when the town's fortification was erected by Count Palatine Otto I early in the fourteenth century. The context of the castle's first reigning occupant helps amplify its importance today and at the time it was first built.
Through the partition of King Rupert's lands among the four surviving sons at the time of his death, Mosbach came to be the center of power for that portion of the Palatinate inherited by Otto, with Mosbach Castle as the sovereign's residence. Count Palatine Otto I, who was born in Mosbach in 1390 and then chose to have his residence there as the heir to the Palatinate Electorate in 1410, and his son Otto II, had the Castle expanded considerably after 1430, although the work done on the building was not intended to exude grandness.
The most influential period for the Castle came in 1427 when, alongside the duties involved in administering the Palatinate-Mosbach, Otto I assumed the guardianship of his nephew Louis IV (Ludwig IV) and held the regency by default while his brother Louis III was too weakened and ill to rule upon his return from a crusade to Jerusalem in 1427. Otto I's nephew was still a minor and did not reach the age of majority until 1442. Starting in 1448 the sphere of influence of the Palatinate of Mosbach and its residence once again expanded when Otto I inherited half of the territory of the extinct Palatinate-Neumarkt and purchased the other half from his brother Stefan (Stephen), establishing a further residence in Neumarkt.
The castle's present-day appearance largely stems from renovation carried out in 1898, including bay windows, half-timbered walls and transverse gables.
See also
List of castles in Baden-Württemberg
List of castles in Germany
https://www.tg-odenwald.de/burgenundschloesser/mosbacher-schloss
References
|
```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();
}
}
}
```
|
A marmot is a member of the genus Marmota.
Marmot may also refer to:
People
Janine Marmot, British film producer
Sir Michael Marmot (born 1945), British scientist
Places
Marmot, Oregon, United States
Marmot District, Gran Chimú, Peru
Marmot Basin, a Canadian ski area
Marmot Dome, the one dome east of Fairview Dome
Marmot Island, an island in the Gulf of Alaska
Marmot Pass, a trail corridor in Washington state
Other uses
Marmot (company), an outdoor clothing and sporting goods company
Marmot (grape), another name for the German wine grape Elbling
See also
Marmot Day, a celebration featuring marmots
La Marmotte, a one-day cyclosportive event
Le Marmot (1976–1981), a French Thoroughbred racehorse and sire
Cro-Marmot, a character from Happy Tree Friends
|
```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)
}
}
```
|
```python
"""Generates a list of CFGs from a path.
The module finds all python modules and generates an ast for them.
"""
import os
_local_modules = list()
def get_directory_modules(directory):
"""Return a list containing tuples of
e.g. ('__init__', 'example/import_test_project/__init__.py')
"""
if _local_modules and os.path.dirname(_local_modules[0][1]) == directory:
return _local_modules
if not os.path.isdir(directory):
# example/import_test_project/A.py -> example/import_test_project
directory = os.path.dirname(directory)
if directory == '':
return _local_modules
for path in os.listdir(directory):
if _is_python_file(path):
# A.py -> A
module_name = os.path.splitext(path)[0]
_local_modules.append((module_name, os.path.join(directory, path)))
return _local_modules
def get_modules(path, prepend_module_root=True):
"""Return a list containing tuples of
e.g. ('test_project.utils', 'example/test_project/utils.py')
"""
module_root = os.path.split(path)[1]
modules = list()
for root, directories, filenames in os.walk(path):
for filename in filenames:
if _is_python_file(filename):
directory = os.path.dirname(
os.path.realpath(
os.path.join(
root,
filename
)
)
).split(module_root)[-1].replace(
os.sep, # e.g. '/'
'.'
)
directory = directory.replace('.', '', 1)
module_name_parts = []
if prepend_module_root:
module_name_parts.append(module_root)
if directory:
module_name_parts.append(directory)
if filename == '__init__.py':
path = root
else:
module_name_parts.append(os.path.splitext(filename)[0])
path = os.path.join(root, filename)
modules.append(('.'.join(module_name_parts), path))
return modules
def _is_python_file(path):
if os.path.splitext(path)[1] == '.py':
return True
return False
```
|
```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
```
|
John R. Buchtel (1820–1892) was an American businessman and philanthropist. He founded Buchtel College, which became The University of Akron. Buchtel High School, a public high school in Akron, Ohio, is named in his honor.
Buchtel was born on January 18, 1820, in Stark County, Ohio. He began his business interests in agriculture, acquiring a large amount of farmland in Stark County and in the state of Indiana. He then worked for Ball, Aultman, and Company, and led the development of the company's new factory in Akron, which became known as the Buckeye Mower and Reaper Company. When Buckeye Mower became independent, Buchtel served as its first president. He later became the general manager of the Akron Iron Company, and when it merged with several other firms to create the Columbus and Hocking Coal and Iron Company, he served as one of its vice-presidents. He was also an early investor in the rubber company of Dr. Benjamin F. Goodrich. In 1887, a stroke left him unable to work.
He died on May 23, 1892.
References
1820 births
1892 deaths
Burials at Glendale Cemetery, Akron
People from Stark County, Ohio
University and college founders
|
Diggins or Diggin may refer to:
Places
Diggins, Missouri
People
Bartholomew Diggins (1844–1917), American Civil War Navy sailor
Ben Diggins (born 1979), American Major League Baseball player
Brighton Diggins (1906–1971), Australian rules footballer
Jay Diggins (born 1974), English musician
Jessie Diggins (born 1991), American cross-country skier
John Patrick Diggins (1935–2009), American history professor
Paul Diggin (born 1985), British rugby player
Skylar Diggins-Smith (born 1990), American basketball player
See also
Dwiggins, a surname
|
```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')
```
|
```ruby
require "rails_helper"
RSpec.describe "/admin/users/export" do
let(:admin) do
create(:user, :super_admin,
name: "Admin1", username: "admin1", email: "admin1@gmail.com",
registered_at: "2020-05-06T13:09:47+0000")
end
let!(:user) do
create(:user, :org_member,
name: "John Doe", username: "john_doe", email: "john_doe@gmail.com",
registered_at: "2020-06-08T13:09:47+0000")
end
before do
sign_in(admin)
get "#{export_admin_users_path}.csv"
end
it "renders successfully" do
expect(response).to have_http_status :ok
end
it "renders the headers" do
expect(response.body).to include("Name,Username,Email address,Status,Joining date,Last activity,Organizations")
end
it "shows the correct number of total rows" do
expect(response.body.lines.count).to eq(3)
end
it "shows the correct fields", :aggregate_failures do
admin_registered_at = admin.registered_at.strftime("%d %b, %Y")
user_registered_at = user.registered_at.strftime("%d %b, %Y")
# rubocop:disable Style/PercentLiteralDelimiters, Layout/LineLength
expect(response.body).to include(%{Admin1,admin1,admin1@gmail.com,Good Standing,"#{admin_registered_at}","#{admin_registered_at}",[]})
expect(response.body).to include(
%{John Doe,john_doe,john_doe@gmail.com,Good Standing,"#{user_registered_at}","#{user_registered_at}","[""#{user.organizations.first.name}""]"},
)
# rubocop:enable Style/PercentLiteralDelimiters, Layout/LineLength
end
end
```
|
```html
<html>
<head>
<title>NVIDIA(R) PhysX(R) SDK 3.4 API Reference: PxDefaultAllocator Class Reference</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<LINK HREF="NVIDIA.css" REL="stylesheet" TYPE="text/css">
</head>
<body bgcolor="#FFFFFF">
<div id="header">
<hr class="first">
<img alt="" src="images/PhysXlogo.png" align="middle"> <br>
<center>
<a class="qindex" href="main.html">Main Page</a>
<a class="qindex" href="hierarchy.html">Class Hierarchy</a>
<a class="qindex" href="annotated.html">Compound List</a>
<a class="qindex" href="functions.html">Compound Members</a>
</center>
<hr class="second">
</div>
<!-- Generated by Doxygen 1.5.8 -->
<div class="contents">
<h1>PxDefaultAllocator Class Reference<br>
<small>
[<a class="el" href="group__extensions.html">Extensions</a>]</small>
</h1><!-- doxytag: class="PxDefaultAllocator" --><!-- doxytag: inherits="PxAllocatorCallback" -->default implementation of the allocator interface required by the SDK
<a href="#_details">More...</a>
<p>
<code>#include <<a class="el" href="PxDefaultAllocator_8h-source.html">PxDefaultAllocator.h</a>></code>
<p>
<div class="dynheader">
Inheritance diagram for PxDefaultAllocator:</div>
<div class="dynsection">
<p><center><img src="classPxDefaultAllocator__inherit__graph.png" border="0" usemap="#PxDefaultAllocator__inherit__map" alt="Inheritance graph"></center>
<map name="PxDefaultAllocator__inherit__map">
<area shape="rect" href="classPxAllocatorCallback.html" title="Abstract base class for an application defined memory allocator that can be used..." alt="PxAllocatorCallback" coords="7,16,129,37"></map>
<center><font size="2">[<a target="top" href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for PxDefaultAllocator:</div>
<div class="dynsection">
<p><center><img src="classPxDefaultAllocator__coll__graph.png" border="0" usemap="#PxDefaultAllocator__coll__map" alt="Collaboration graph"></center>
<map name="PxDefaultAllocator__coll__map">
<area shape="rect" href="classPxAllocatorCallback.html" title="Abstract base class for an application defined memory allocator that can be used..." alt="PxAllocatorCallback" coords="7,16,129,37"></map>
<center><font size="2">[<a target="top" href="graph_legend.html">legend</a>]</font></center></div>
<p>
<a href="classPxDefaultAllocator-members.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void * </td><td class="memItemRight" valign="bottom"><a class="el" href="classPxDefaultAllocator.html#caee20fa98b003bde01d690cbccc2c33">allocate</a> (size_t size, const char *, const char *, int)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Allocates size bytes of memory, which must be 16-byte aligned. <a href="#caee20fa98b003bde01d690cbccc2c33"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classPxDefaultAllocator.html#73221f0158b7740403cd922dca5408fd">deallocate</a> (void *ptr)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Frees memory previously allocated by <a class="el" href="classPxDefaultAllocator.html#caee20fa98b003bde01d690cbccc2c33" title="Allocates size bytes of memory, which must be 16-byte aligned.">allocate()</a>. <a href="#73221f0158b7740403cd922dca5408fd"></a><br></td></tr>
</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
default implementation of the allocator interface required by the SDK <hr><h2>Member Function Documentation</h2>
<a class="anchor" name="caee20fa98b003bde01d690cbccc2c33"></a><!-- doxytag: member="PxDefaultAllocator::allocate" ref="caee20fa98b003bde01d690cbccc2c33" args="(size_t size, const char *, const char *, int)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void* PxDefaultAllocator::allocate </td>
<td>(</td>
<td class="paramtype">size_t </td>
<td class="paramname"> <em>size</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>typeName</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>filename</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int </td>
<td class="paramname"> <em>line</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Allocates size bytes of memory, which must be 16-byte aligned.
<p>
This method should never return NULL. If you run out of memory, then you should terminate the app or take some other appropriate action.<p>
<b>Threading:</b> This function should be thread safe as it can be called in the context of the user thread and physics processing thread(s).<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>size</em> </td><td>Number of bytes to allocate. </td></tr>
<tr><td valign="top"></td><td valign="top"><em>typeName</em> </td><td>Name of the datatype that is being allocated </td></tr>
<tr><td valign="top"></td><td valign="top"><em>filename</em> </td><td>The source file which allocated the memory </td></tr>
<tr><td valign="top"></td><td valign="top"><em>line</em> </td><td>The source line which allocated the memory </td></tr>
</table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>The allocated block of memory. </dd></dl>
<p>Implements <a class="el" href="classPxAllocatorCallback.html#7bb2dde434cf541a556b40b31661da29">PxAllocatorCallback</a>.</p>
<p>References <a class="el" href="PxDefaultAllocator_8h-source.html#l00075">platformAlignedAlloc()</a>, and <a class="el" href="PxAssert_8h-source.html#l00061">PX_ASSERT</a>.</p>
</div>
</div><p>
<a class="anchor" name="73221f0158b7740403cd922dca5408fd"></a><!-- doxytag: member="PxDefaultAllocator::deallocate" ref="73221f0158b7740403cd922dca5408fd" args="(void *ptr)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void PxDefaultAllocator::deallocate </td>
<td>(</td>
<td class="paramtype">void * </td>
<td class="paramname"> <em>ptr</em> </td>
<td> ) </td>
<td><code> [inline, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Frees memory previously allocated by <a class="el" href="classPxDefaultAllocator.html#caee20fa98b003bde01d690cbccc2c33" title="Allocates size bytes of memory, which must be 16-byte aligned.">allocate()</a>.
<p>
<b>Threading:</b> This function should be thread safe as it can be called in the context of the user thread and physics processing thread(s).<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>ptr</em> </td><td>Memory to free. </td></tr>
</table>
</dl>
<p>Implements <a class="el" href="classPxAllocatorCallback.html#6af8b56b5a786150796b9854d16fde38">PxAllocatorCallback</a>.</p>
<p>References <a class="el" href="PxDefaultAllocator_8h-source.html#l00080">platformAlignedFree()</a>.</p>
</div>
</div><p>
<hr>The documentation for this class was generated from the following file:<ul>
<li><a class="el" href="PxDefaultAllocator_8h-source.html">PxDefaultAllocator.h</a></ul>
</div>
<hr style="width: 100%; height: 2px;"><br>
</body>
</html>
```
|
Crocus abantensis is a species of flowering plant in the genus Crocus of the family Iridaceae. It is a cormous perennial native to northwestern Turkey.
References
abantensis
|
Central Tzoumerka () is a municipality in the Arta regional unit, Epirus, Greece. The seat of the municipality is the village Vourgareli. The municipality has an area of 509.231 km2. The municipality is named after the Tzoumerka mountains.
Municipality
The municipality Central Tzoumerka was formed at the 2011 local government reform by the merger of the following 4 former municipalities, that became municipal units:
Agnanta
Athamania
Melissourgoi
Theodoriana
References
Populated places in Arta (regional unit)
Municipalities of Epirus (region)
|
Adebiyi Gregory Daramola (2 March 1958 – 25 March 2022) was a Nigerian academic and professor of agricultural economics, who served as the Vice-chancellor of the Federal University of Technology Akure from May 2012 to May 2017.
Early life and education
Daramola was born on 2 March 1958 in Okemesi, then Western Region to Elizabeth Eniola and Michael Adebayo Daramola. He attended Anglican Grammar School, Ile-Ife between January 1969 and December 1971 and St. Charles College, Osogbo from January 1972 to June 1974 for his secondary education. He attended The Polytechnic, Ibadan from 1975 to June 1976 and proceeded to the University of Ife (now Obafemi Awolowo University), Ile-Ife in October 1976 and obtained his first degree in June 1980. He thereafter proceeded to the University of Ibadan where he obtained the MSc and PhD degrees in Agricultural Economics in 1982 and 1987 respectively.
Career
Daramola started his lectureship career at the University of Ibadan as a Teaching/Tutorial Assistant in the Department of Agricultural Economics in 1982. He later joined the services of the Federal University of Technology, Akure as an Assistant Lecturer in the Department of Agricultural Economics and Extension on 1 September 1986. He rose to the grade of professor on 1 October 1999. Between 1990 and 1991, he was a Postdoctoral fellow at the Center for Advanced Training in Agricultural Economics, Department of Agricultural Economics and Business Management, University of New England, Armidale, New South Wales, Australia. Before becoming vice chancellor on 22 May 2012, he had held many strategic positions in FUTA. He was at various times, Examinations Officer in the Department of Agricultural Economics (September 1987 – August 1990), Coordinator of Students’ Industrial Works Experience Scheme (SIWES) in the Department of Agricultural Economics (September 1992 – August 1995), Acting Head, Department of Agricultural Economics and Extension (1 August – 31 July 2005), Head of the Department of Agricultural Economics (1 August – 31 July 2005) and chairman, University Ceremonials Committee, 2004 to 2011.
He undertook many diverse engagements for many national and international organizations. and also served as Chairman, Committee of Vice Chancellors (CVC) and Association of Vice Chancellor of Nigerian Universities (AVCNU), two positions he held concurrently between 2015 and 2017.
Awards and recognition
Daramola won many scholarships and awards, among which were the Federal Government of Nigeria Postgraduate Scholarship Award (1982); University of Ibadan Scholarship for Postgraduate Study (1982); and Postdoctoral Fellowship, University of New England, Armidale, New South Wales, Australia (1990). He was a fellow of the Nigerian Association of Agricultural Economists (NAAE) and a member of several professional bodies. Some of these are the American Association of Agricultural Economists (AAAE); International Association of Agricultural Economists (IAAE); and African Association of Agricultural Economists (AAAE), where he was a Executive Committee member. Professor Daramola served as the Chief Editor and Chairman of the Editorial Board of African Journal of Agricultural and Resource Economics (AfJARE), Pretoria, South Africa (1 January 2010 to 2013). He was also a consultant to several national and international organisations, such as the World Bank, Ford Foundation, USAID, DfID, African Development Bank (AfDB), Cocoa Research Institute of Nigeria (CRIN) and Community Development Foundation, Lagos, Nigeria, among others. He published several papers in both local and international journals and conference proceedings.
Vice chancellor
He became FUTA's sixth substantive vice chancellor in May 2012, with the avowed purpose of "taking FUTA to the market place" and making it a key player in the global academic arena. He wanted students to become ICT whiz kids and innovators, a new generation that would champion the country's development in technology. He also provided support for technology-enhanced student-centred teaching and learning. Not surprisingly, students won prizes at several national and international competitions in the areas of ICT, Mathematics, Business, Building, Quantity Surveying and Transport Management. They designed apps, won national and Africa regional essay competitions, got international internship opportunities, won seed money for their start-ups. He loved students’ intellectual debate programmes and supported students to attend competitions all over Nigeria.
Under his watch, FUTA became an international university. It was he who initiated the collaboration with the Florida Agricultural and Mechanical University (FAMU), Tallahassee, Florida, USA, in which qualified penultimate year students completed the final year of their first degree at FAMU to earn a FUTA Bachelor's degree and earn a FAMU Master's in their second year. The internationalization drive of Professor Daramola also birthed collaborations with the London South Bank University, United Kingdom and other major Universities around the globe culminating in staff and student exchanges. One of the main gains of the internationalization drive was the joint conference organised by FUTA, London South Bank University and the DeMontfort University, Leicester, England in 2016 in FUTA. The United Nations World Habitat Programme also collaborated with FUTA in 2016 to launch its Programme in Akure.
Some of his notable achievements included the establishment of the Centre for Entrepreneurship (CET) (2013) and Centre for Renewable Energy Technology (CRET) (2014). He repositioned the University's Centre for Space Research and Applications (CESRA) for global recognition. Through CESRA, FUTA became the second African institutional member of the prestigious International Astronautical Federation, a federation that has notable space agencies like NASA, ESA, ISRO, CSA, and Roscosmos as institutional members. FUTA also became the first Nigerian and second African university to launch a cube satellite into outer space, thus putting FUTA's footprint in space, a notable achievement by all standards. This was in collaboration with Kyushu Institute of Technology, Kyushu, Japan and the National Space Research and Development Agency.
The Daramola tenure also witnessed improvement in infrastructural provision in the university. The 2500-capacity Auditorium, now renamed Obafemi Awolowo Auditorium and the New Senate Building initiated by his predecessors in office were completed. He also embarked on new projects: student hostels, an International Scholars’ Lodge, lecture theatres, and a university bookshop. The university’s road networks were renovated, upgraded and rehabilitated. An extension was added to the University Library and full digitalization commenced. The goodwill created through the University’s engagement with public and private sector players led to the donation of two tractors, a 1000-capacity lecture theatre, 118 solar-powered street lights, the students’ recreation centre, and 110 laptop computers to the university, a fire station, and the University Advancement Centre.
FUTA’s local and national impact became more noticeable: the University’s Centre for Entrepreneurship was engaged by the Ondo State Government to provide training for cocoa farmers and by the Niger Delta Development Commission to provide vocational and entrepreneurial training to ex-militants. Similarly, the University worked with engineers from the Nigerian Air Force to overcome some challenges with some of its aircraft.
He finished his term in May 2017, and took a well-deserved leave. When asked about his future plans, he had this to say: “My future plans are in God’s hands. All I know is that I am proceeding on my sabbatical leave and my accumulated leave. Whatever happens thereafter is in God’s hands. He orders my steps. God orders my steps” (Landmarks of a Transformational Era, p. 112). He was succeeded as vice chancellor by Professor Joseph Adeola Fuwape.
Personal life and death
Daramola was personable, courageous, witty and refined. He was warm, cordial with a disarming smile. A citizen of the world, he had travelled to 22 countries on five continents of Africa, Asia, Europe, North America and Oceania.
He was blessed to be a husband, father and grandfather. He was devoted to Funmilayo, his adoring wife of 36 years, his daughter, Tolu, and sons, Tayo and Tope. He was also deeply religious but accommodating. Though a Catholic himself, he accommodated Christians of all persuasions, and supported Muslims in their worship.
He died on Friday, 25 March 2022, at the age of 64.
References
1958 births
2022 deaths
Nigerian academic administrators
Nigerian academics
Vice-Chancellors of Nigerian universities
Yoruba people
Academic staff of the Federal University of Technology Akure
People from Ekiti State
|
Der Ring des Polykrates (The Ring of Polykrates), Op. 7, is a one-act opera by Erich Wolfgang Korngold. The libretto, written by Leo Feld and reworked (unattributed) by the composer's father Julius Korngold, is based on a drama by .
Performance history
Korngold composed the opera (his first) in 1914, when he was only seventeen years old. The one-act domestic comedy was contrasted by his second opera Violanta, a one-act tragedy. Both were successfully premiered together on 28 March 1916 at the National Theatre Munich. Bruno Walter conducted and the cast included Karl Erb and Maria Ivogün. The operas were repeated in Vienna, with Selma Kurz and Alfred Piccaver in Polykrates and Maria Jeritza as Violanta. In November 1916, it was given at the Dresden Hofoper, with Richard Tauber and Elisabeth Rethberg in the leading roles.
Roles
Synopsis
The librettist Leo Feld placed the story in the 18th century, when Friedrich Schiller's ballade of the same title was new.
The musician Wilhelm Arndt seems to have everything going for him: he is happily married to Laura, he has been appointed Hoffkapellmeister and he has just inherited a small fortune. Only the return of his long-lost friend Peter Vogel could make him even more happy. When Vogel actually returns, he is jealous of Wilhelm's happiness, and convinces him that in order not to challenge fate, he should sacrifice something (after the example set in Schiller's ballade Der Ring des Polykrates). Wilhelm starts an argument with his wife about her former life, but the couple's love is strong enough to overcome all difficulties. In the end, all agree that the sacrifice that has to be offered is the intriguer that tried to ruin their happiness: Peter Vogel has to leave again.
Recordings
In 1996 CPO released a 1995 recording, with Klauspeter Seibel conducting the Deutsches Symphonie-Orchester Berlin and singers Beate Bilandzija, Dietrich Henschel and Jürgen Sacher.
Piano music
A potpourri from Der Ring des Polykrates for piano arranged by L. Ruffin was recorded by Nimbus Records in 2001.
Bibliography
Specht, Richard. Thematische Führer zu Erich W. Korngold's "Violanta" und "Der Ring des Polykrates". Mainz and Leipzig: B. Schott's Söhne, 1916. iv, 68 pp.
References
Operas by Erich Wolfgang Korngold
1916 operas
One-act operas
German-language operas
Operas
Operas based on plays
|
```go
package markup
import (
"code.gitea.io/gitea/modules/util"
)
func ResolveLink(ctx *RenderContext, link, userContentAnchorPrefix string) (result string, resolved bool) {
isAnchorFragment := link != "" && link[0] == '#'
if !isAnchorFragment && !IsFullURLString(link) {
linkBase := ctx.Links.Base
if ctx.IsWiki {
// no need to check if the link should be resolved as a wiki link or a wiki raw link
// just use wiki link here and it will be redirected to a wiki raw link if necessary
linkBase = ctx.Links.WikiLink()
} else if ctx.Links.BranchPath != "" || ctx.Links.TreePath != "" {
// if there is no BranchPath, then the link will be something like "/owner/repo/src/{the-file-path}"
// and then this link will be handled by the "legacy-ref" code and be redirected to the default branch like "/owner/repo/src/branch/main/{the-file-path}"
linkBase = ctx.Links.SrcLink()
}
link, resolved = util.URLJoin(linkBase, link), true
}
if isAnchorFragment && userContentAnchorPrefix != "" {
link, resolved = userContentAnchorPrefix+link[1:], true
}
return link, resolved
}
```
|
```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;
}
```
|
The 1948–49 season was the 26th season of the Slovenian Republic League and the fourth in the SFR Yugoslavia. The league champions Železničar Ljubljana and second placed Rudar Trbovlje qualified for the Yugoslav Third League.
Final table
Qualification for the Yugoslav Second League
External links
Football Association of Slovenia
Slovenian Republic Football League seasons
Yugo
3
Football
Football
|
A saturable reactor in electrical engineering is a special form of inductor where the magnetic core can be deliberately saturated by a direct electric current in a control winding. Once saturated, the inductance of the saturable reactor drops dramatically. This decreases inductive reactance and allows increased flow of the alternating current (AC).
Design considerations
Saturable reactors provide a very simple means to remotely and proportionally control the AC through a load such as an incandescent lamp; the AC current is roughly proportional to the direct current (DC) through the control winding.
The power windings, the control winding, and the core are arranged so that the control winding is well isolated from the AC power. The AC power windings are also usually configured so that they self-cancel any AC voltage that might otherwise be induced in the control winding.
Because the required inductance to achieve dimming varies with the size of the load, saturable reactors often have multiple taps, allowing a small inductance to be used with a large load or a larger inductance to be used with a smaller load. In this way, the required magnitude of the control current can be kept roughly constant, no matter what the load.
Obsolete technology
Saturable reactors designed for mains (power-line) frequency are larger, heavier, and more expensive than electronic power controllers developed after the introduction of semiconductor electronic components, and have largely been replaced by thyristor dimmers using triacs or SCRs.
However, as of 2015, there has been renewed interest in using these devices for control of "smart grids" with multiple current tested installations in California, as well as the United Kingdom.
See also
Magnetic amplifier
Constant voltage transformer
Transductor
Citations
References
External links
Electromagnetic components
|
Weightlifting competitions at the 2015 Pan American Games in Toronto was held from July 11 to 15 at the General Motors Centre (Oshawa Sports Centre) in Oshawa. Due to naming rights the arena was as the latter for the duration of the games. A total of fifteen weightlifting events were held: eight for men and seven for women.
Venue
The competitions took place at the General Motors Centre (Oshawa Sports Centre) located in the city of Oshawa, about 60 kilometers from the athletes village. The arena will had a reduced capacity of 3,000 people per session (about half its normal of 5,500). The venue also hosted the boxing competitions later in the games.
Competition schedule
The following is the competition schedule for the weightlifting competitions:
Medal table
Medalists
Men's events
Women's events
Participating nations
A total of 24 countries qualified athletes. The number of athletes a nation entered is in parentheses beside the name of the country.
Qualification
A total of 125 weightlifters (69 male and 56 women) were able to qualify to compete at the games. Qualification was done at the 2013 and 2014 Pan American Championships, where nations had points assigned per athlete's finishing position. The totals of both Championships were added and quotas were then awarded to the top 20 men's teams and 18 women's teams. A further two wildcards (one for each gender) was awarded.
See also
Weightlifting at the 2016 Summer Olympics
References
External links
Results book (archived)
Events at the 2015 Pan American Games
Pan American Games
2015
|
David Somerville (6 August 1856 – 4 February 1933) was a Scotland international rugby union player He also played for the Scotland national cricket team.
Rugby Union career
Amateur career
His club was Edinburgh Institution F.P.
Provincial career
He played for Edinburgh District in their inter-city match against Glasgow District on 1 December 1877.
He played for Whites Trial in their match against Blues Trial on 16 February 1878. This trial match was to try and impress the Scotland international side selectors.
He played for East of Scotland District in their match against West of Scotland District on 1 March 1879.
International career
He was capped six times for Scotland between 1879-84 including the 1883 Home Nations Championship.
Cricket career
He played for the Scotland national cricket team.
References
Sources
Bath, Richard (ed.) The Scotland Rugby Miscellany (Vision Sports Publishing Ltd, 2007 )
1856 births
1933 deaths
Scottish rugby union players
Scotland international rugby union players
Rugby union players from Leith
Edinburgh Institution F.P. players
East of Scotland District players
Edinburgh District (rugby union) players
Whites Trial players
Rugby union forwards
|
The Fifteen-Twenty or 15°20' Fracture Zone (FTFZ), also known as the Cabo Verde Fracture Zone, is a fracture zone located on the Mid-Atlantic Ridge (MAR) in the central Atlantic Ocean between 14–16°N. It is the current location of the migrating triple junction marking the boundaries between the North American, South American, and Nubian plates. The FTFZ is roughly parallel to the North and South America—Africa spreading direction and has a broad axial valley produced over the last ten million years by the northward-migrating triple junction.
Offsetting the MAR by some 175 km, the FTFZ is located on one of the slowest portions of the MAR where the full spreading rate is 25 km/Myr.
Geological setting
North and south of the FTFZ the axis of the MAR is near-perpendicular to the spreading direction and the spreading rate is 2.6 mm/yr.
The axial valley south of the FTFZ is composed of short axial volcanic ridges separated by 8–18 km-long en echelon deeps, while north of the FTFZ the axial ridges are much longer and more linear.
North and south of the FTFZ the ocean floor is relatively smooth with long abyssal hills, probably detachment faults, aligned near-parallel to the ridge axis. In contrast, close to the FTFZ the terrain is more rugged and adorned with short, oblique fault scarps. Associated with the transition between these two types of terrains (at about 15°50'N and 14°30'N respectively) are V-shaped, south-propagating structures. These transitional structures disappear away from the ridge. Within the rugged terrain serpentinized peridotite and gabbro are capped with a thin layer of extrusive basalt. In the smooth areas the lithosphere is more magmatic in composition.
The FTFZ is flanked by two negative gravity anomalies associated with the accretion of igneous crust. The anomaly south of the FTFZ is twice as large as the northern one. There are also geochemical variations across the fracture zone. On the southern side basalts are enriched MORB (mid-ocean ridge basalt) but on the northern side basalts change from enriched to depleted away from the FTFZ. Peridotites collected from south of the FTFZ have an uncommon composition ascribed to a H2O-rich or hot mantle source.
Megamullions
Corrugated surfaces known as megamullions or oceanic core complexes measure 25 km along-axis and 10–15 km across. When found along other mid-ocean ridges such structures occur at the inside corners of ridge discontinuities, but at the FTFZ they occur on both sides of the ridge away from any non-transform discontinuities.
These structures and ultramafic rocks outcropping on either side of the MAR (in contrast to other parts of the ridge) indicate considerably reduced magma supply near the FTFZ. Paradoxically, geochemical analyses of basalts near the FTFZ instead suggest an enriched mantle source and the presence of a mantle hotspot.
Two models can explain these contradictions. A westward ridge jump could relocate an older megamullion on the original western flank to the opposite flank after which a new megamullion start to form on the new western flank. Near the FTFZ this would place the older megamullion in an outside corner while the younger develop in an inside corner. Alternatively, an eastward ridge jump or migration could turn a west-dipping detachment fault into an east-dipping fault, which would also result in an older abandoned and a younger active megamullion. Which is the case is currently not known.
Superimposed on the larger corrugated surfaces are two systems of smaller scale corrugations: one on a 1–3 km-scale, roughly 200 m high, and another finer about 100–500 m wide. The latter occur up to 1 km from the ridge and is covered by elevated ridges running parallel to the spreading direction, about 10 m wide, hundreds of metres long, and 10 m tall. These in turn are covered with cm-scale striations running in the same direction.
Triple junction
The North American–South American–African triple junction is associated with the initial opening of the Atlantic Ocean and has had a complex tectonic history. It probably migrated from near 10°N to its current location near the FTFZ between 72.5 and 35.5 Ma. Both its location and that of the North America–South-American–Caribbean triple junction are debated, however.
The initiation and evolution of triple junctions is often associated with mantle plumes, but, if this is the case near the FTFZ, the limited supply of magma suggest an embryonic plume or a local, anomalous mantle composition. The relative movement between the North American and South American plates is very small, but the resulting deformation could possibly explain both off-axis seismicity and the odd mantle composition.
References
Notes
Sources
Fracture zones
Triple junctions
Mid-Atlantic Ridge
|
The Packard-Bentley Mavis is a one-off racing car. It is powered by a Packard 4M-2500 V-12, developing and () of torque, sourced from an American World War II-era marine military PT boat.
The car was built by Vintage Sports-Car Club member and Napier-Bentley owner Chris Williams, and debuted at the Cholmondeley Pageant of Power in July 2010.
The Packard-Bentley is based on a 1930 Bentley 8-litre chassis, highly modified. The car also has 24 exhaust pipes, reflecting its engine's twin-port design. The steering column is offset and angled to allow it to clear the huge engine block.
The car is a very popular spectator attraction, both static and while being driven. As of 2019, it is now housed in Technik Museum Speyer, Germany, where it has previously featured in their "Brazzeltag" convention.
References
External links
Cholmondeley Pageant of Power
Packard aero-engines at enginehistory.org
Racing cars
Cars powered by aircraft engines
|
```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 %}
```
|
Jemma Mi Mi (born 4 March 1996) is an Australian netball player in the Suncorp Super Netball league. She played for the Queensland Firebirds for six seasons before her contract was not renewed at the end of the 2022 Suncorp Super Netball season.
She attended Carmel College, Thornlands during her secondary schooling. Mi Mi made her debut for the Firebirds in 2017, signing with the Brisbane-based franchise in late 2016. As a young sportswoman, Mi Mi played high-level touch rugby and represented the Australian under-15 and Queensland under-21 netball teams, before being included as a reserve player for Australia at the Netball World Youth Cup. She played 11 of 29 matches in her first two seasons at the Firebirds.
Recently completing a Bachelor of Clinical Exercise Physiology, off the court Mimi works with Body Smart Health as well as ambassador work with the Diamond Spirit Program.
References
External links
Queensland Firebirds profile
Suncorp Super Netball profile
Netball Draft Central profile
1996 births
Australian netball players
Queensland Firebirds players
Living people
Suncorp Super Netball players
Netball players from New South Wales
Indigenous Australian netball players
Sportspeople from Newcastle, New South Wales
|
Amirabad-e Nadar (, also Romanized as Amīrābād-e Nadar and Amīrābād-e Nader; also known as Amīrābād-e Pāpī and Amīrābād-e Papī) is a village in Qaleh-ye Mozaffari Rural District, in the Central District of Selseleh County, Lorestan Province, Iran. At the 2006 census, its population was 161, in 36 families.
References
Populated places in Selseleh County
|
The ice accretion indicator is an L-shaped piece of aluminium long by wide. It is used to indicate the formation of ice, frost or the presence of freezing rain or freezing drizzle.
It is normally attached to a Stevenson screen, about above ground, but may be mounted in other areas away from any artificial heat sources. The weather station would have two on site and they would be exchanged after every weather observation. The spare indicator should always be at the outside air temperature to ensure that it is ready for use and would normally be stored inside the screen.
If the observer notes the presence of ice or frost on the indicator then a remark to that effect should be sent in the next weather observation. Examples of these are 'rime icing on indicator' and 'FROIN' (frost on indicator). As the indicator is at air temperature and is kept horizontal it provides an excellent surface on which to observe freezing precipitation.
See also
Automated airport weather station
References
Meteorological instrumentation and equipment
|
```xml
/*
*/
import { ITranslator } from '@jupyterlab/translation';
import { SidePanel } from '@jupyterlab/ui-components';
import { Panel, Widget } from '@lumino/widgets';
import { TableOfContentsWidget } from './treeview';
import { TableOfContents } from './tokens';
import { Message } from '@lumino/messaging';
/**
* Table of contents sidebar panel.
*/
export class TableOfContentsPanel extends SidePanel {
/**
* Constructor
*
* @param translator - Translator tool
*/
constructor(translator?: ITranslator) {
super({ content: new Panel(), translator });
this._model = null;
this.addClass('jp-TableOfContents');
this._title = new Private.Header(this._trans.__('Table of Contents'));
this.header.addWidget(this._title);
this._treeview = new TableOfContentsWidget({
placeholderHeadline: this._trans.__('No Headings'),
placeholderText: this._trans.__(
'The table of contents shows headings in notebooks and supported files.'
)
});
this._treeview.addClass('jp-TableOfContents-tree');
this.content.addWidget(this._treeview);
}
/**
* Get the current model.
*/
get model(): TableOfContents.Model | null {
return this._model;
}
set model(newValue: TableOfContents.Model | null) {
if (this._model !== newValue) {
this._model?.stateChanged.disconnect(this._onTitleChanged, this);
this._model = newValue;
if (this._model) {
this._model.isActive = this.isVisible;
}
this._model?.stateChanged.connect(this._onTitleChanged, this);
this._onTitleChanged();
this._treeview.model = this._model;
}
}
protected onAfterHide(msg: Message): void {
super.onAfterHide(msg);
if (this._model) {
this._model.isActive = false;
}
}
protected onBeforeShow(msg: Message): void {
super.onBeforeShow(msg);
if (this._model) {
this._model.isActive = true;
}
}
private _onTitleChanged(): void {
this._title.setTitle(
this._model?.title ?? this._trans.__('Table of Contents')
);
}
private _model: TableOfContents.Model | null;
private _title: Private.Header;
private _treeview: TableOfContentsWidget;
}
/**
* Private helpers namespace
*/
namespace Private {
/**
* Panel header
*/
export class Header extends Widget {
/**
* Constructor
*
* @param title - Title text
*/
constructor(title: string) {
const node = document.createElement('h2');
node.textContent = title;
node.classList.add('jp-text-truncated');
super({ node });
this._title = node;
}
/**
* Set the header title.
*/
setTitle(title: string): void {
this._title.textContent = title;
}
private _title: HTMLElement;
}
}
```
|
A dastūr, sometimes spelt dustoor, is a term for a Zoroastrian high priest who has authority in religious matters and ranks higher than a mobad or herbad. In this specific sense, the term is used mostly among the Parsis of India. The term has also been used in a secular sense to refer to a prime minister, minister or government councillor.
The first person to be accorded the title Dastur was Meherji Rana (born 1514 at Navsari). He was invited by Akbar to his court in 1578 AD. He was accorded the title in 1579 AD by the local Zoroastrian priests thus establishing a seat (Gaadi, similar to the seat of a Bhattaraka or Sankaracharya). Dastur Kaikhushru Cowasji Ravji became the eighteenth successor to the seat and title of MeherjiRana in 2019. He became a Mobed 59 years earlier.
References
Boyce, Mary (2001). Zoroastrians, Their Religious Beliefs and Practices. London: Routledge
Zoroastrian rituals
Religion in Iran
Zoroastrianism in India
Parsi people
Dastur
Persian words and phrases
|
```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);
}
}
}
```
|
Wayne Hockley (born 6 September 1978) is an English former professional footballer.
Career
Hockley was born in Paignton, Devon and joined Torquay United as a trainee, having previously played for local side Stoke Gabriel. He made his debut on 15 March 1997, as a substitute for Mark Hawthorne in Torquay's 3–1 defeat away to Scarborough, missing an open goal within a minute of taking to the pitch. He played once more that season, this time as a substitute for Andy McFarlane in Torquay's 2–1 defeat away to Doncaster Rovers and began the following season on a monthly contract.
He left Torquay in September 1997 after manager Kevin Hodges only offered him a further month rather than a longer-term contract and rejoined his former club Stoke Gabriel. He was the top scorer for Dartington Sports Club in the 1998–99 season. In March 2000 he was playing for Galmpton United, but by July 2001 was back with Dartington S.C., playing in a friendly against Torquay United in a game in which he was marked by his younger brother Matt, who was also a professional with Torquay United, making over 200 appearances for the club between 2000 and 2008.
References
External links
1978 births
Living people
People from Paignton
English men's footballers
Torquay United F.C. players
English Football League players
Men's association football forwards
Footballers from Devon
|
Count Ernesto Montecuccoli (1582 – June 17, 1633) was a general in the service of the Holy Roman Empire during the Thirty Years War, a member of the prominent Italian Montecuccoli Family.
In 1632, troops under Montecuccoli's command burned down the town of Knittlingen. On 16 August of the same year, Montecuccoli's forces were defeated in the Battle of Wiesloch by a Swedish army led by Count Gustav Horn.
He was the uncle of Raimondo Montecuccoli, who started his own military career under Ernesto's command.
1582 births
1633 deaths
Austrian generals
Italian generals
Imperial Army personnel of the Thirty Years' War
Italian people of the Thirty Years' War
Military personnel of the Holy Roman Empire
|
```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)")
}
}
}
```
|
```javascript
"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
function noop() { }
exports.noop = noop;
//# sourceMappingURL=noop.js.map
```
|
```c++
#ifndef INCLUDED_NJN_RANDOM
#define INCLUDED_NJN_RANDOM
/* $Id: $
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Work" under the
* the author's offical duties as a United States Government employee and
* thus cannot be copyrighted. This software/database is freely available
* to the public for use. The National Library of Medicine and the U.S.
* Government have not placed any restriction on its use or reproduction.
*
* Although all reasonable efforts have been taken to ensure the accuracy
* and reliability of the software and data, the NLM and the U.S.
* Government do not and cannot warrant the performance or results that
* may be obtained by using this software or data. The NLM and the U.S.
* Government disclaim all warranties, express or implied, including
* warranties of performance, merchantability or fitness for any particular
* purpose.
*
* Please cite the author in any work or product based on this material.
*
* ===========================================================================*/
/*****************************************************************************
File name: njn_random.hpp
Author: John Spouge
Contents: Random no. seeder and generator
******************************************************************************/
namespace Njn {
namespace Random {
const long SEED = 31415; // default random seed
void seed (long n); // provides seed for random numbers
long number (); // returns random numbers
}
}
#endif //! INCLUDED
```
|
Jacques Habert (born Jacques Léon Jean Marie Habert; in 2 May 1960) is a French prelate of the Catholic Church who has served as Bishop of Bayeux and Lisieux since 2020.
References
1960 births
Living people
Bishops of Bayeux
Bishops of Sées
21st-century Roman Catholic bishops in France
People from Saint-Malo
|
```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
}
}
```
|
```objective-c
//
// BGTool.h
// BGFMDB
//
// Created by huangzhibiao on 17/2/16.
//
#import <Foundation/Foundation.h>
#import <objc/runtime.h>
/**
*/
#ifdef DEBUG
#define bg_log(...) NSLog(__VA_ARGS__)
#else
#define bg_log(...)
#endif
#define bg_completeBlock(obj) !complete?:complete(obj);
#define BG @"BG_"
#define bg_tableNameKey @"bg_tableName"
#define bg_rowid @"rowid"
#define bg_uniqueKeysSelector NSSelectorFromString(@"bg_uniqueKeys")
#define bg_ignoreKeysSelector NSSelectorFromString(@"bg_ignoreKeys")
#define bg_unionPrimaryKeysSelector NSSelectorFromString(@"bg_unionPrimaryKeys")
typedef NS_ENUM(NSInteger,bg_getModelInfoType){//
bg_ModelInfoInsert,//
bg_ModelInfoSingleUpdate,//
bg_ModelInfoArrayUpdate,//
bg_ModelInfoNone//
};
@interface BGTool : NSObject
/**
jsonjson .
*/
+(id _Nonnull)jsonWithString:(NSString* _Nonnull)jsonString;
/**
json .
*/
+(NSString* _Nonnull)dataToJson:(id _Nonnull)data;
/**
@onlyKey YES:key,NO:keytype.
*/
+(NSArray* _Nonnull)getClassIvarList:(__unsafe_unretained _Nonnull Class)cla Object:(_Nullable id)object onlyKey:(BOOL)onlyKey;
/**
.
*/
+(NSArray* _Nonnull)where:(NSArray* _Nonnull)where;
/**
like
*/
+(NSString* _Nonnull)getLikeWithKeyPathAndValues:(NSArray* _Nonnull)keyPathValues where:(BOOL)where;
/**
.
*/
+(BOOL)isUniqueKey:(NSString* _Nonnull)uniqueKey with:(NSString* _Nonnull)param;
/**
.
*/
+(NSString* _Nonnull)keyAndType:(NSString* _Nonnull)param;
/**
.
*/
+(NSString* _Nonnull)getSqlType:(NSString* _Nonnull)type;
//NSDate,: yyyy-MM-dd HH:mm:ss
+(NSString* _Nonnull)stringWithDate:(NSDate* _Nonnull)date;
/**
.
*/
+(NSString* _Nonnull)getTableNameWithObject:(id _Nonnull)object;
/**
.
@value .
@type value.
@encode YES: , NO:.
*/
+(id _Nonnull)getSqlValue:(id _Nonnull)value type:(NSString* _Nonnull)type encode:(BOOL)encode;
/**
.
@tableName ().
@array .
*/
+(NSArray* _Nonnull)tansformDataFromSqlDataWithTableName:(NSString* _Nonnull)tableName class:(__unsafe_unretained _Nonnull Class)cla array:(NSArray* _Nonnull)array;
/**
.
@claName .
@valueDict .
*/
+(id _Nonnull)objectFromJsonStringWithTableName:(NSString* _Nonnull)tablename class:(__unsafe_unretained _Nonnull Class)cla valueDict:(NSDictionary* _Nonnull)valueDict;
/**
json.
*/
+(id _Nonnull)bg_objectWithClass:(__unsafe_unretained _Nonnull Class)cla value:(id _Nonnull)value;
/**
.
*/
+(NSMutableDictionary* _Nonnull)bg_keyValuesWithObject:(id _Nonnull)object ignoredKeys:(NSArray* _Nullable)ignoredKeys;
/**
.
*/
+(id _Nonnull)executeSelector:(SEL _Nonnull)selector forClass:(__unsafe_unretained _Nonnull Class)cla;
/**
.
*/
+(id _Nonnull)executeSelector:(SEL _Nonnull)selector forObject:(id _Nonnull)object;
/**
.
*/
+(NSDictionary* _Nonnull)getDictWithObject:(id _Nonnull)object ignoredKeys:(NSArray* const _Nullable)ignoredKeys filtModelInfoType:(bg_getModelInfoType)filtModelInfoType;
/**
key.
*/
+(NSArray* _Nonnull)bg_filtCreateKeys:(NSArray* _Nonnull)createkeys ignoredkeys:(NSArray* _Nonnull)ignoredkeys;
/**
.
*/
+(BOOL)ifNotExistWillCreateTableWithObject:(id _Nonnull)object ignoredKeys:(NSArray* const _Nullable)ignoredKeys;
/**
*/
+ (BOOL)isPureInt:(NSString* _Nonnull)string;
/**
*/
+ (BOOL)isPureFloat:(NSString* _Nonnull)string;
/**
NSUserDefaults.
*/
+(BOOL)getBoolWithKey:(NSString* _Nonnull)key;
+(void)setBoolWithKey:(NSString* _Nonnull)key value:(BOOL)value;
+(NSString* _Nonnull)getStringWithKey:(NSString* _Nonnull)key;
+(void)setStringWithKey:(NSString* _Nonnull)key value:(NSString* _Nonnull)value;
+(NSInteger)getIntegerWithKey:(NSString* _Nonnull)key;
+(void)setIntegerWithKey:(NSString* _Nonnull)key value:(NSInteger)value;
@end
```
|
Oum El Djalil is a town and commune in Médéa Province, Algeria. According to the 1998 census it has a population of 3664.
References
Communes of Médéa Province
|
Lionel Guterres (born 7 September 1931) is a Hong Kong field hockey player. He competed in the men's tournament at the 1964 Summer Olympics.
References
External links
1931 births
Living people
Sportspeople from Shanghai
Hong Kong male field hockey players
Olympic field hockey players for Hong Kong
Field hockey players at the 1964 Summer Olympics
Place of birth missing (living people)
|
```xml
import Static from "./Static.ts"
import { RuntypeBase } from "../Runtype.ts"
import ValidationError from "../result/ValidationError.ts"
import FAILURE from "../utils-internal/FAILURE.ts"
type Contract<A extends readonly RuntypeBase[], R extends RuntypeBase> = {
enforce(
f: (
...args: {
[K in keyof A]: A[K] extends RuntypeBase ? Static<A[K]> : unknown
} & ArrayLike<unknown>
) => Static<R>,
): (
...args: {
[K in keyof A]: A[K] extends RuntypeBase ? Static<A[K]> : unknown
} & ArrayLike<unknown>
) => Static<R>
}
const Contract: {
/**
* Create a function contract.
*/
<A extends readonly RuntypeBase[], R extends RuntypeBase>(...runtypes: [...A, R]): Contract<A, R>
} = <A extends readonly RuntypeBase[], R extends RuntypeBase>(
...runtypes: [...A, R]
): Contract<A, R> => {
const lastIndex = runtypes.length - 1
const argRuntypes = runtypes.slice(0, lastIndex) as unknown as A
const returnRuntype = runtypes[lastIndex] as R
return {
enforce:
(
f: (
...args: {
[K in keyof A]: A[K] extends RuntypeBase ? Static<A[K]> : unknown
}
) => Static<R>,
) =>
(
...args: {
[K in keyof A]: A[K] extends RuntypeBase ? Static<A[K]> : unknown
}
): Static<R> => {
if (args.length < argRuntypes.length) {
const message = `Expected ${argRuntypes.length} arguments but only received ${args.length}`
const failure = FAILURE.ARGUMENT_INCORRECT(message)
throw new ValidationError(failure)
}
for (let i = 0; i < argRuntypes.length; i++) argRuntypes[i]!.check(args[i])
return returnRuntype.check(f(...args))
},
}
}
export default Contract
```
|
Karl Aage Præst, also spelled Carl Aage Præst, (26 February 1922 – 19 November 2011) was a Danish football player. Playing in the left winger position, Præst won two Serie A championships with Italian club Juventus FC. He played 24 games and scored 17 goals for the Danish national team from 1945 to 1949, and won a bronze medal at the 1948 Summer Olympics. He is a Danish Football Hall of Fame inductee.
Career
Born in Copenhagen, Karl Aage Præst attended the Royal Orphanage. The orphanage became the youth team of football club Østerbros Boldklub (ØB) in 1936, and Præst was among the first boys to join ØB. In his second year in the ØB youth team, Præst scored 57 goals in 16 games. He made his senior debut in 1940. At ØB, he played alongside later Danish international Helge Broneé. Præst was acknowledged as a world-class talent, with great balance and dribbling, and a great end-product of either precise crossing or a good shot on goal. Præst played around 250 games while at ØB.
He became internationally known through international exhibition games for Danish representative teams Stævnet and Alliancen, and made his debut for the Denmark national football team in June 1945. In May 1947, he was selected for the Europe XI representative team, which lost 1–6 to the Great Britain national football team. Præst was a part of the Danish team at the 1948 Summer Olympics in London, where Præst played four games and scored two goals as Denmark won a bronze medal. After the Olympics, Præst signed a professional contract with Italian club Juventus F.C., and was thus banned from the amateur-only Danish national team.
With Juventus, Præst won the 1949–50 and 1951–52 Serie A championships. Though considered fast in Denmark, Præst was not as fast as most Italian defenders, but succeeded through his dribbling skills. Præst played alongside Danes John Hansen and Karl Aage Hansen at Juventus, and his dribbling and crossing ability was a key in making John Hansen top goal-scorer of the 1951–52 season. Præst played 232 games and scored 51 goals for Juventus in the Serie A championship from 1949 to 1956. In 1956, Præst moved on to league rivals S.S. Lazio. He played seven games for the club, before ending his career in 1957.
Upon his return to Denmark, Præst's status as ex-professional meant the Danish Football Association (DBU) kept him banned from playing in the Danish leagues. Præst and John Hansen had both bought vacation homes in Liseleje, and Præst's summer residence "Juve" was soon the gathering place of the 1948 Olympics team. The team was reformed, amateurs and ex-professionals alike, and played a string of unofficial high-profile exhibition matches that drew many spectators. This provoked DBU to move on the issue of ex-professionals, and it was decided that following a quarantine of two years, ex-professionals were allowed to re-enter the Danish football league.
At ØB's 75th anniversary in 1969, Præst and Flemming Nielsen arranged an old boys exhibition match between the 1948 Olympic team and Juventus FC, with the proceeds going to ØB. In November 2008, Præst was voted into the Danish Football Hall of Fame, for his achievements with Juventus FC and the Danish national team.
Præst died on 19 November 2011 at age 89.
Honours
Club
Østerbros Boldklub
KBUs Pokalturnering: 1947
Juventus FC
Serie A: 1949–50, 1951–52
Individual
Danish Football Hall of Fame
References
External links
1922 births
2011 deaths
Danish men's footballers
Denmark men's international footballers
Danish expatriate men's footballers
Juventus FC players
SS Lazio players
Serie A players
Expatriate men's footballers in Italy
Olympic footballers for Denmark
Olympic bronze medalists for Denmark
Footballers at the 1948 Summer Olympics
Footballers from Copenhagen
Olympic medalists in football
Medalists at the 1948 Summer Olympics
Men's association football midfielders
Danish expatriate sportspeople in Italy
|
```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 );
}
```
|
University Credit Union began as the Boston University Employees' Credit Union, which was founded by a group of Boston University employees May, 1952. It began with 9 volunteers serving on the Credit Union's first Board of Directors. Early Board meetings covered matters ranging from the Credit Union's finances and operational issues to sending greetings and wishes to a Credit Union member in the hospital.
It has since merged with Metro Credit Union.
Today
Since the beginning, Boston University Employees' Credit Union grew from serving the employees of Boston University to serving educational and healthcare institutions and changing its name to University Credit Union. Membership has reached over 10,500 and continues to climb.
University Credit Union has relationships with the following institutions:
Bentley University
Berklee College of Music
Boston College
Boston College of Architecture
Boston Medical Center
Boston University
Children's Services of Roxbury
Crittenton
Education Development Center
Emerson College
Fisher College
Lesley University
Mental Health Programs
Morgan Memorial Goodwill Industries
Massachusetts Society for the Prevention of Cruelty to Animals-Angell Animal Medical Center
New England School of Acupuncture
New England School of Law
Newbury College
Perkins School for the Blind
Planned Parenthood League of MA
Roxbury Comprehensive Community Healthcare
Suffolk University
Tufts University
University of California: San Diego
Victory Human Services
Vinfen
University Credit Union is located at 846 Commonwealth Ave. and 710 Albany Street in Boston, Massachusetts.
External links
official site
1952 establishments in Massachusetts
Credit unions based in Massachusetts
Boston University
|
Trefusiidae is a family of nematodes belonging to the order Enoplida.
Genera
Genera:
Africanema Vincx & Furstenberg, 1988
Alaimonemella Allgén, 1935
Cytolaimium Cobb, 1920
References
Nematodes
|
Las Amapas Beach () is a beach at the south end of Zona Romántica, Puerto Vallarta, in the Mexican state of Jalisco. The small beach is separated from Playa de los Muertos by a rock formation known as "El Púlpito" (English: "The Pulpit").
References
External links
Beaches of Jalisco
Zona Romántica
|
Gaynor Kay Mellor (born 26 August 1971), known professionally as Gaynor Faye, is an English actress and writer. She played Judy Mallett in Coronation Street from 1995 until 1999 and Megan Macey in Emmerdale from 2012 until 2019.
Early life
Gaynor Faye was born in Leeds to TV scriptwriter Kay Mellor (1951-2022) and Anthony Mellor. Her maternal grandmother was Jewish. She has one sister, Yvonne.
Career
Faye has played the roles of Holly Quinn in Playing the Field; Lauren Harris in Fat Friends; Georgia Lovett in Between the Sheets and Julie in Stan the Man. She has also written two episodes of Fat Friends.
In 2006, Faye appeared in ITV's Dancing on Ice. Her skating partner was Daniel Whiston. On 4 March 2006, she was crowned the inaugural Dancing on Ice champion. From 2006 to 2007, Faye starred as Anna Williams Bedford in The Chase, a television series co-written with her mother for BBC One.
Faye released a video based on the exercise routine she followed during Dancing on Ice.
Faye appeared in the stage adaptation of Calendar Girls alongside Lynda Bellingham at London's Noël Coward Theatre in 2009. This was written by Juliette Towhidi and Tim Firth.
In September 2010, she was a guest panellist on ITV's Loose Women. In 2011, Faye played Zarina Wix in children's programme, Dani's House. In October 2011, it was announced that Faye would join the ITV soap opera Emmerdale, playing Declan Macey's ambitious half-sister Megan Macey. Megan first appeared on-screen on 21 February 2012. Faye left the role in 2019. On 11 November and 16 December 2011, she guest presented the ITV Breakfast programme Lorraine.
In March 2021, Faye appeared in the BBC One drama The Syndicate as Cheryl Armitage. Since 2021, Faye has narrated Hornby: A Model World following the works of Hornby, Scalextrix, and Airfix on the Yesterday channel. In September 2023, Faye starred in the Channel 5 drama series The Inheritance, appearing alongside Samantha Bond, Jemima Rooper, Rob James-Collier and Adil Ray.
Personal life
Faye lives with long-term partner Mark Pickering in Leeds, West Yorkshire. The couple have two children.
During the Covid-19 Pandemic, Faye took online courses in semantics, Spanish and counselling. She said, "I know people who really struggle with their mental health and it’s important for me to know what to do for my family, my kids, my loved ones – to help people when they’re struggling. To help other people is what I want to do." Faye practices Buddhism. She told OK! magazine: "I've been a Buddhist since I asked a friend 25 years ago what skin cream she used because she was so glowing and she said: "It’s not cream, it’s because I chant" [...] It's just part of my life now, it's like brushing my teeth. In the morning, I do it to set up my life and so I can live in a higher life state."
Filmography
Awards and nominations
References
External links
1971 births
Living people
English television actresses
English soap opera actresses
Reality show winners
Actresses from Leeds
English people of Jewish descent
People educated at Lawnswood School
|
```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.