The deadtime correction for the singles and doubles rates uses the deadtime expression
where A and B are deadtime coefficients. The deadtime corrected singles rate is [2]
and the deadtime corrected doubles rate is [2]
The deadtime corrected triples rate is [21, 22]
where
= multiplicity deadtime
= triples deadtime coefficient
where the multiplicity deadtime coefficients αn and βn are given by
(n > 1)
(n > 2)
where
If
then
The count rates of the auxiliary scalers are not corrected for deadtime.


The EndDeviceRegistry
service
Method EndDeviceRegistry.Create
Create a new end device within an application.
Request: CreateEndDeviceRequest
Response: EndDevice
POST
/applications/{end_device.ids.application_ids.application_id}/devices
Method EndDeviceRegistry.Get
Get the end device with the given identifiers, selecting the fields given by the field mask.
Request: GetEndDeviceRequest
Response: EndDevice
GET
/applications/{end_device_ids.application_ids.application_id}/devices/{end_device_ids.device_id}
Method EndDeviceRegistry.List
List applications. See request message for details.
Request: ListEndDevicesRequest
Response: EndDevices
GET
/applications/{application_ids.application_id}/devices
Method EndDeviceRegistry.Update
Request: UpdateEndDeviceRequest
Response: EndDevice
PUT
/applications/{end_device.ids.application_ids.application_id}/devices/{end_device.ids.device_id}
Method EndDeviceRegistry.Delete
Request: EndDeviceIdentifiers
Response: google.protobuf.Empty
DELETE
/applications/{application_ids.application_id}/devices/{device_id}
The JsEndDeviceRegistry
service
Method JsEndDeviceRegistry.Set
Set creates or updates the device.
Request: SetEndDeviceRequest
Response: EndDevice
PUT
/js/applications/{end_device.ids.application_ids.application_id}/devices/{end_device.ids.device_id}
POST
/js/applications/{end_device.ids.application_ids.application_id}/devices
Method JsEndDeviceRegistry.Get
Get returns the device that matches the given identifiers. If there are multiple matches, an error will be returned.
Request: GetEndDeviceRequest
Response: EndDevice
GET
/js/applications/{end_device_ids.application_ids.application_id}/devices/{end_device_ids.device_id}
Method JsEndDeviceRegistry.Delete
Delete deletes the device that matches the given identifiers. If there are multiple matches, an error will be returned.
Request: EndDeviceIdentifiers
Response: google.protobuf.Empty
DELETE
/js/applications/{application_ids.application_id}/devices/{device_id}
The NsEndDeviceRegistry
service
Method NsEndDeviceRegistry.Set
Set creates or updates the device.
Request: SetEndDeviceRequest
Response: EndDevice
PUT
/ns/applications/{end_device.ids.application_ids.application_id}/devices/{end_device.ids.device_id}
POST
/ns/applications/{end_device.ids.application_ids.application_id}/devices
Method NsEndDeviceRegistry.Get
Get returns the device that matches the given identifiers. If there are multiple matches, an error will be returned.
Request: GetEndDeviceRequest
Response: EndDevice
GET
/ns/applications/{end_device_ids.application_ids.application_id}/devices/{end_device_ids.device_id}
Method NsEndDeviceRegistry.Delete
Delete deletes the device that matches the given identifiers. If there are multiple matches, an error will be returned.
Request: EndDeviceIdentifiers
Response: google.protobuf.Empty
DELETE
/ns/applications/{application_ids.application_id}/devices/{device_id}
The AsEndDeviceRegistry
service
Method AsEndDeviceRegistry.Set
Set creates or updates the device.
Request: SetEndDeviceRequest
Response: EndDevice
PUT
/as/applications/{end_device.ids.application_ids.application_id}/devices/{end_device.ids.device_id}
POST
/as/applications/{end_device.ids.application_ids.application_id}/devices
Method AsEndDeviceRegistry.Get
Get returns the device that matches the given identifiers. If there are multiple matches, an error will be returned.
Request: GetEndDeviceRequest
Response: EndDevice
GET
/as/applications/{end_device_ids.application_ids.application_id}/devices/{end_device_ids.device_id}
Method AsEndDeviceRegistry.Delete
Delete deletes the device that matches the given identifiers. If there are multiple matches, an error will be returned.
Request: EndDeviceIdentifiers
Response: google.protobuf.Empty
DELETE
/as/applications/{application_ids.application_id}/devices/{device_id}
Messages
Message CreateEndDeviceRequest
-
end_device
(EndDevice
) -
required
Show object example
{
"end_device": {},
}
Message EndDevice
Defines an End Device registration and its state on the network. The persistence of the EndDevice is divided between the Network Server, Application Server and Join Server. SDKs are responsible for combining (if desired) the three.
-
ids
(EndDeviceIdentifiers
) -
required
-
created_at
(google.protobuf.Timestamp
) -
updated_at
(google.protobuf.Timestamp
) -
name
(string
) -
max_len
:50
Friendly name of the device. Stored in Entity Registry.
-
description
(string
) -
max_len
:2000
Description of the device. Stored in Entity Registry.
-
attributes
(map ofstring
tostring
) -
Attributes of the device. Stored in Entity Registry.
-
version_ids
(EndDeviceVersionIdentifiers
) -
Version Identifiers. Stored in Entity Registry, Network Server and Application Server.
-
service_profile_id
(string
) -
max_len
:64
Default service profile. Stored in Entity Registry.
-
network_server_address
(string
) -
pattern
:^(?:(?:[a-zA-Z0-9]|[a-zA-Z0-9][a-zA-Z0-9\-]*[a-zA-Z0-9])\.)*(?:[A-Za-z0-9]|[A-Za-z0-9][A-Za-z0-9\-]*[A-Za-z0-9])(?::[0-9]{1,5})?$|^$
The address of the Network Server where this device is supposed to be registered. Stored in Entity Registry and Join Server. The typical format of the address is “host:port”. If the port is omitted, the normal port inference (with DNS lookup, otherwise defaults) is used. The connection shall be established with transport layer security (TLS). Custom certificate authorities may be configured out-of-band.
-
network_server_kek_label
(string
) -
max_len
:2048
The KEK label of the Network Server to use for wrapping network session keys. Stored in Join Server.
-
application_server_address
(string
) -
pattern
:^(?:(?:[a-zA-Z0-9]|[a-zA-Z0-9][a-zA-Z0-9\-]*[a-zA-Z0-9])\.)*(?:[A-Za-z0-9]|[A-Za-z0-9][A-Za-z0-9\-]*[A-Za-z0-9])(?::[0-9]{1,5})?$|^$
The address of the Application Server where this device is supposed to be registered. Stored in Entity Registry and Join Server. The typical format of the address is “host:port”. If the port is omitted, the normal port inference (with DNS lookup, otherwise defaults) is used. The connection shall be established with transport layer security (TLS). Custom certificate authorities may be configured out-of-band.
-
application_server_kek_label
(string
) -
max_len
:2048
The KEK label of the Application Server to use for wrapping the application session key. Stored in Join Server.
-
application_server_id
(string
) -
max_len
:100
The AS-ID of the Application Server to use. Stored in Join Server.
-
join_server_address
(string
) -
pattern
:^(?:(?:[a-zA-Z0-9]|[a-zA-Z0-9][a-zA-Z0-9\-]*[a-zA-Z0-9])\.)*(?:[A-Za-z0-9]|[A-Za-z0-9][A-Za-z0-9\-]*[A-Za-z0-9])(?::[0-9]{1,5})?$|^$
The address of the Join Server where this device is supposed to be registered. Stored in Entity Registry. The typical format of the address is “host:port”. If the port is omitted, the normal port inference (with DNS lookup, otherwise defaults) is used. The connection shall be established with transport layer security (TLS). Custom certificate authorities may be configured out-of-band.
-
locations
(map ofstring
toLocation
) -
Location of the device. Stored in Entity Registry.
-
supports_class_b
(bool
) -
Whether the device supports class B. Copied on creation from template identified by version_ids, if any or from the home Network Server device profile, if any.
-
supports_class_c
(bool
) -
Whether the device supports class C. Copied on creation from template identified by version_ids, if any or from the home Network Server device profile, if any.
-
lorawan_version
(MACVersion
) -
defined_only
LoRaWAN MAC version. Stored in Network Server. Copied on creation from template identified by version_ids, if any or from the home Network Server device profile, if any.
-
lorawan_phy_version
(PHYVersion
) -
defined_only
LoRaWAN PHY version. Stored in Network Server. Copied on creation from template identified by version_ids, if any or from the home Network Server device profile, if any.
-
frequency_plan_id
(string
) -
max_len
:64
ID of the frequency plan used by this device. Copied on creation from template identified by version_ids, if any or from the home Network Server device profile, if any.
-
min_frequency
(uint64
) -
Minimum frequency the device is capable of using (Hz). Stored in Network Server. Copied on creation from template identified by version_ids, if any or from the home Network Server device profile, if any.
-
max_frequency
(uint64
) -
Maximum frequency the device is capable of using (Hz). Stored in Network Server. Copied on creation from template identified by version_ids, if any or from the home Network Server device profile, if any.
-
supports_join
(bool
) -
The device supports join (it’s OTAA). Copied on creation from template identified by version_ids, if any or from the home Network Server device profile, if any.
-
resets_join_nonces
(bool
) -
Whether the device resets the join and dev nonces (not LoRaWAN 1.1 compliant). Stored in Join Server. Copied on creation from template identified by version_ids, if any or from the home Network Server device profile, if any.
-
root_keys
(RootKeys
) -
Device root keys. Stored in Join Server.
-
net_id
(bytes
) -
Home NetID. Stored in Join Server.
-
mac_settings
(MACSettings
) -
Settings for how the Network Server handles MAC layer for this device. Stored in Network Server.
-
mac_state
(MACState
) -
MAC state of the device. Stored in Network Server.
-
pending_mac_state
(MACState
) -
Pending MAC state of the device. Stored in Network Server.
-
session
(Session
) -
Current session of the device. Stored in Network Server and Application Server.
-
pending_session
(Session
) -
Pending session. Stored in Network Server and Application Server until RekeyInd is received.
-
last_dev_nonce
(uint32
) -
Last DevNonce used. This field is only used for devices using LoRaWAN version 1.1 and later. Stored in Join Server.
-
used_dev_nonces
(repeateduint32
) -
Used DevNonces sorted in ascending order. This field is only used for devices using LoRaWAN versions preceding 1.1. Stored in Join Server.
-
last_join_nonce
(uint32
) -
Last JoinNonce/AppNonce(for devices using LoRaWAN versions preceding 1.1) used. Stored in Join Server.
-
last_rj_count_0
(uint32
) -
Last Rejoin counter value used (type 0/2). Stored in Join Server.
-
last_rj_count_1
(uint32
) -
Last Rejoin counter value used (type 1). Stored in Join Server.
-
last_dev_status_received_at
(google.protobuf.Timestamp
) -
Time when last DevStatus MAC command was received. Stored in Network Server.
-
power_state
(PowerState
) -
defined_only
The power state of the device; whether it is battery-powered or connected to an external power source. Received via the DevStatus MAC command at status_received_at. Stored in Network Server.
-
battery_percentage
(google.protobuf.FloatValue
) -
gte
:0
lte
:1
Latest-known battery percentage of the device. Received via the DevStatus MAC command at last_dev_status_received_at or earlier. Stored in Network Server.
-
downlink_margin
(int32
) -
Demodulation signal-to-noise ratio (dB). Received via the DevStatus MAC command at last_dev_status_received_at. Stored in Network Server.
-
recent_adr_uplinks
(repeatedUplinkMessage
) -
Recent uplink messages with ADR bit set to 1 sorted by time. Stored in Network Server. The field is reset each time an uplink message carrying MACPayload is received with ADR bit set to 0. The number of messages stored is in the range [0,20];
-
recent_uplinks
(repeatedUplinkMessage
) -
Recent uplink messages sorted by time. Stored in Network Server. The number of messages stored may depend on configuration.
-
recent_downlinks
(repeatedDownlinkMessage
) -
Recent downlink messages sorted by time. Stored in Network Server. The number of messages stored may depend on configuration.
-
queued_application_downlinks
(repeatedApplicationDownlink
) -
Queued Application downlink messages. Stored in Application Server, which sets them on the Network Server.
-
formatters
(MessagePayloadFormatters
) -
The payload formatters for this end device. Stored in Application Server. Copied on creation from template identified by version_ids.
-
provisioner_id
(string
) -
max_len
:36
pattern
:^[a-z0-9](?:[-]?[a-z0-9]){2,}$|^$
ID of the provisioner. Stored in Join Server.
-
provisioning_data
(google.protobuf.Struct
) -
Vendor-specific provisioning data. Stored in Join Server.
-
multicast
(bool
) -
Indicates whether this device represents a multicast group.
-
claim_authentication_code
(EndDeviceAuthenticationCode
) -
Authentication code to claim ownership of the end device. Stored in Join Server.
Show object example
{
"ids": {},
"created_at": "0001-01-01T00:00:00Z",
"updated_at": "0001-01-01T00:00:00Z",
"name": "",
"description": "",
"attributes": {},
"version_ids": {},
"service_profile_id": "",
"network_server_address": "",
"network_server_kek_label": "",
"application_server_address": "",
"application_server_kek_label": "",
"application_server_id": "",
"join_server_address": "",
"locations": {},
"supports_class_b": false,
"supports_class_c": false,
"lorawan_version": "MAC_UNKNOWN",
"lorawan_phy_version": "PHY_UNKNOWN",
"frequency_plan_id": "",
"min_frequency": 0,
"max_frequency": 0,
"supports_join": false,
"resets_join_nonces": false,
"root_keys": {},
"net_id": "",
"mac_settings": {},
"mac_state": {},
"pending_mac_state": {},
"session": {},
"pending_session": {},
"last_dev_nonce": 0,
"used_dev_nonces": [],
"last_join_nonce": 0,
"last_rj_count_0": 0,
"last_rj_count_1": 0,
"last_dev_status_received_at": "0001-01-01T00:00:00Z",
"power_state": "POWER_UNKNOWN",
"battery_percentage": null,
"downlink_margin": 0,
"recent_adr_uplinks": [],
"recent_uplinks": [],
"recent_downlinks": [],
"queued_application_downlinks": [],
"formatters": {},
"provisioner_id": "",
"provisioning_data": {},
"multicast": false,
"claim_authentication_code": {},
}
Message EndDeviceAuthenticationCode
Authentication code for end devices.
-
value
(string
) -
pattern
:^[A-Z0-9]{1,32}$
-
valid_from
(google.protobuf.Timestamp
) -
valid_to
(google.protobuf.Timestamp
)
Show object example
{
"value": "",
"valid_from": "0001-01-01T00:00:00Z",
"valid_to": "0001-01-01T00:00:00Z",
}
Message EndDeviceIdentifiers
-
device_id
(string
) -
max_len
:36
pattern
:^[a-z0-9](?:[-]?[a-z0-9]){2,}$
-
application_ids
(ApplicationIdentifiers
) -
required
-
dev_eui
(bytes
) -
The LoRaWAN DevEUI.
-
join_eui
(bytes
) -
The LoRaWAN JoinEUI (AppEUI until LoRaWAN 1.0.3 end devices).
-
dev_addr
(bytes
) -
The LoRaWAN DevAddr.
Show object example
{
"device_id": "",
"application_ids": {},
"dev_eui": "",
"join_eui": "",
"dev_addr": "",
}
Message EndDevices
-
end_devices
(repeatedEndDevice
)
Show object example
{
"end_devices": [],
}
Message EndDeviceVersionIdentifiers
Identifies an end device model with version information.
-
brand_id
(string
) -
max_len
:36
pattern
:^[a-z0-9](?:[-]?[a-z0-9]){2,}$
-
model_id
(string
) -
max_len
:36
pattern
:^[a-z0-9](?:[-]?[a-z0-9]){2,}$
-
hardware_version
(string
) -
firmware_version
(string
)
Show object example
{
"brand_id": "",
"model_id": "",
"hardware_version": "",
"firmware_version": "",
}
Message GetEndDeviceRequest
-
end_device_ids
(EndDeviceIdentifiers
) -
required
-
field_mask
(google.protobuf.FieldMask
)
Show object example
{
"end_device_ids": {},
"field_mask": {},
}
Message KeyEnvelope
-
key
(bytes
) -
The unencrypted AES key.
-
kek_label
(string
) -
max_len
:2048
The label of the RFC 3394 key-encryption-key (KEK) that was used to encrypt the key.
-
encrypted_key
(bytes
)
Show object example
{
"key": "",
"kek_label": "",
"encrypted_key": "",
}
Message ListEndDevicesRequest
-
application_ids
(ApplicationIdentifiers
) -
required
-
field_mask
(google.protobuf.FieldMask
) -
order
(string
) -
Order the results by this field path (must be present in the field mask). Default ordering is by ID. Prepend with a minus (-) to reverse the order.
-
limit
(uint32
) -
lte
:1000
Limit the number of results per page.
-
page
(uint32
) -
Page number for pagination. 0 is interpreted as 1.
Show object example
{
"application_ids": {},
"field_mask": {},
"order": "",
"limit": 0,
"page": 0,
}
Message MACParameters
MACParameters represent the parameters of the device’s MAC layer (active or desired). This is used internally by the Network Server.
-
max_eirp
(float
) -
Maximum EIRP (dBm).
-
adr_data_rate_index
(DataRateIndex
) -
defined_only
ADR: data rate index to use.
-
adr_tx_power_index
(uint32
) -
lte
:15
ADR: transmission power index to use.
-
adr_nb_trans
(uint32
) -
lte
:15
ADR: number of retransmissions.
-
adr_ack_limit
(uint32
) -
ADR: number of messages to wait before setting ADRAckReq. This field is deprecated, use adr_ack_limit_exponent instead.
-
adr_ack_delay
(uint32
) -
ADR: number of messages to wait after setting ADRAckReq and before changing TxPower or DataRate. This field is deprecated, use adr_ack_delay_exponent instead.
-
rx1_delay
(RxDelay
) -
defined_only
Rx1 delay (Rx2 delay is Rx1 delay + 1 second).
-
rx1_data_rate_offset
(uint32
) -
lte
:7
Data rate offset for Rx1.
-
rx2_data_rate_index
(DataRateIndex
) -
defined_only
Data rate index for Rx2.
-
rx2_frequency
(uint64
) -
gte
:100000
Frequency for Rx2 (Hz).
-
max_duty_cycle
(AggregatedDutyCycle
) -
defined_only
Maximum uplink duty cycle (of all channels).
-
rejoin_time_periodicity
(RejoinTimeExponent
) -
defined_only
Time within which a rejoin-request must be sent.
-
rejoin_count_periodicity
(RejoinCountExponent
) -
defined_only
Message count within which a rejoin-request must be sent.
-
ping_slot_frequency
(uint64
) -
gte
:100000
lte
:0
Frequency of the class B ping slot (Hz).
-
ping_slot_data_rate_index
(DataRateIndex
) -
defined_only
Data rate index of the class B ping slot.
-
beacon_frequency
(uint64
) -
gte
:100000
lte
:0
Frequency of the class B beacon (Hz).
-
channels
(repeatedMACParameters.Channel
) -
min_items
:1
Configured uplink channels and optionally Rx1 frequency.
-
uplink_dwell_time
(google.protobuf.BoolValue
) -
Whether uplink dwell time is set (400ms). If this field is not set, then the value is either unknown or irrelevant(Network Server cannot modify it).
-
downlink_dwell_time
(google.protobuf.BoolValue
) -
Whether downlink dwell time is set (400ms). If this field is not set, then the value is either unknown or irrelevant(Network Server cannot modify it).
-
adr_ack_limit_exponent
(ADRAckLimitExponentValue
) -
ADR: number of messages to wait before setting ADRAckReq.
-
adr_ack_delay_exponent
(ADRAckDelayExponentValue
) -
ADR: number of messages to wait after setting ADRAckReq and before changing TxPower or DataRate.
Show object example
{
"max_eirp": 0,
"adr_data_rate_index": "DATA_RATE_0",
"adr_tx_power_index": 0,
"adr_nb_trans": 0,
"adr_ack_limit": 0,
"adr_ack_delay": 0,
"rx1_delay": "RX_DELAY_0",
"rx1_data_rate_offset": 0,
"rx2_data_rate_index": "DATA_RATE_0",
"rx2_frequency": 0,
"max_duty_cycle": "DUTY_CYCLE_1",
"rejoin_time_periodicity": "REJOIN_TIME_0",
"rejoin_count_periodicity": "REJOIN_COUNT_16",
"ping_slot_frequency": 0,
"ping_slot_data_rate_index": "DATA_RATE_0",
"beacon_frequency": 0,
"channels": [],
"uplink_dwell_time": null,
"downlink_dwell_time": null,
"adr_ack_limit_exponent": {},
"adr_ack_delay_exponent": {},
}
Message MACSettings
-
class_b_timeout
(google.protobuf.Duration
) -
Maximum delay for the device to answer a MAC request or a confirmed downlink frame. If unset, the default value from Network Server configuration will be used.
-
ping_slot_periodicity
(PingSlotPeriodValue
) -
Periodicity of the class B ping slot. If unset, the default value from Network Server configuration will be used.
-
ping_slot_data_rate_index
(DataRateIndexValue
) -
Data rate index of the class B ping slot. If unset, the default value from Network Server configuration will be used.
-
ping_slot_frequency
(google.protobuf.UInt64Value
) -
gte
:100000
Frequency of the class B ping slot (Hz). If unset, the default value from Network Server configuration will be used.
-
class_c_timeout
(google.protobuf.Duration
) -
Maximum delay for the device to answer a MAC request or a confirmed downlink frame. If unset, the default value from Network Server configuration will be used.
-
rx1_delay
(RxDelayValue
) -
Class A Rx1 delay. If unset, the default value from Network Server configuration or regional parameters specification will be used.
-
rx1_data_rate_offset
(google.protobuf.UInt32Value
) -
lte
:7
Rx1 data rate offset. If unset, the default value from Network Server configuration will be used.
-
rx2_data_rate_index
(DataRateIndexValue
) -
Data rate index for Rx2. If unset, the default value from Network Server configuration or regional parameters specification will be used.
-
rx2_frequency
(google.protobuf.UInt64Value
) -
gte
:100000
Frequency for Rx2 (Hz). If unset, the default value from Network Server configuration or regional parameters specification will be used.
-
factory_preset_frequencies
(repeateduint64
) -
List of factory-preset frequencies. If unset, the default value from Network Server configuration or regional parameters specification will be used.
-
max_duty_cycle
(AggregatedDutyCycleValue
) -
Maximum uplink duty cycle (of all channels).
-
supports_32_bit_f_cnt
(google.protobuf.BoolValue
) -
Whether the device supports 32-bit frame counters. If unset, the default value from Network Server configuration will be used.
-
use_adr
(google.protobuf.BoolValue
) -
Whether the Network Server should use ADR for the device. If unset, the default value from Network Server configuration will be used.
-
adr_margin
(google.protobuf.FloatValue
) -
The ADR margin tells the network server how much margin it should add in ADR requests. A bigger margin is less efficient, but gives a better chance of successful reception. If unset, the default value from Network Server configuration will be used.
-
resets_f_cnt
(google.protobuf.BoolValue
) -
Whether the device resets the frame counters (not LoRaWAN compliant). If unset, the default value from Network Server configuration will be used.
-
status_time_periodicity
(google.protobuf.Duration
) -
The interval after which a DevStatusReq MACCommand shall be sent. If unset, the default value from Network Server configuration will be used.
-
status_count_periodicity
(google.protobuf.UInt32Value
) -
Number of uplink messages after which a DevStatusReq MACCommand shall be sent. If unset, the default value from Network Server configuration will be used.
-
desired_rx1_delay
(RxDelayValue
) -
The Rx1 delay Network Server should configure device to use via MAC commands or Join-Accept. If unset, the default value from Network Server configuration or regional parameters specification will be used.
-
desired_rx1_data_rate_offset
(google.protobuf.UInt32Value
) -
The Rx1 data rate offset Network Server should configure device to use via MAC commands or Join-Accept. If unset, the default value from Network Server configuration will be used.
-
desired_rx2_data_rate_index
(DataRateIndexValue
) -
The Rx2 data rate index Network Server should configure device to use via MAC commands or Join-Accept. If unset, the default value from frequency plan, Network Server configuration or regional parameters specification will be used.
-
desired_rx2_frequency
(google.protobuf.UInt64Value
) -
gte
:100000
The Rx2 frequency index Network Server should configure device to use via MAC commands. If unset, the default value from frequency plan, Network Server configuration or regional parameters specification will be used.
-
desired_max_duty_cycle
(AggregatedDutyCycleValue
) -
The maximum uplink duty cycle (of all channels) Network Server should configure device to use via MAC commands. If unset, the default value from Network Server configuration will be used.
-
desired_adr_ack_limit_exponent
(ADRAckLimitExponentValue
) -
The ADR ACK limit Network Server should configure device to use via MAC commands. If unset, the default value from Network Server configuration or regional parameters specification will be used.
-
desired_adr_ack_delay_exponent
(ADRAckDelayExponentValue
) -
The ADR ACK delay Network Server should configure device to use via MAC commands. If unset, the default value from Network Server configuration or regional parameters specification will be used.
Show object example
{
"class_b_timeout": "0s",
"ping_slot_periodicity": {},
"ping_slot_data_rate_index": {},
"ping_slot_frequency": null,
"class_c_timeout": "0s",
"rx1_delay": {},
"rx1_data_rate_offset": null,
"rx2_data_rate_index": {},
"rx2_frequency": null,
"factory_preset_frequencies": [],
"max_duty_cycle": {},
"supports_32_bit_f_cnt": null,
"use_adr": null,
"adr_margin": null,
"resets_f_cnt": null,
"status_time_periodicity": "0s",
"status_count_periodicity": null,
"desired_rx1_delay": {},
"desired_rx1_data_rate_offset": null,
"desired_rx2_data_rate_index": {},
"desired_rx2_frequency": null,
"desired_max_duty_cycle": {},
"desired_adr_ack_limit_exponent": {},
"desired_adr_ack_delay_exponent": {},
}
Message MACState
MACState represents the state of MAC layer of the device. MACState is reset on each join for OTAA or ResetInd for ABP devices. This is used internally by the Network Server and is read only.
-
current_parameters
(MACParameters
) -
required
Current LoRaWAN MAC parameters.
-
desired_parameters
(MACParameters
) -
required
Desired LoRaWAN MAC parameters.
-
device_class
(Class
) -
defined_only
Currently active LoRaWAN device class - Device class is A by default - If device sets ClassB bit in uplink, this will be set to B - If device sent DeviceModeInd MAC message, this will be set to that value
-
lorawan_version
(MACVersion
) -
defined_only
LoRaWAN MAC version.
-
last_confirmed_downlink_at
(google.protobuf.Timestamp
) -
Time when the last confirmed downlink message or MAC command was scheduled.
-
last_dev_status_f_cnt_up
(uint32
) -
Frame counter value of last uplink containing DevStatusAns.
-
ping_slot_periodicity
(PingSlotPeriod
) -
defined_only
Periodicity of the class B ping slot.
-
pending_application_downlink
(ApplicationDownlink
) -
A confirmed application downlink, for which an acknowledgment is expected to arrive.
-
queued_responses
(repeatedMACCommand
) -
Queued MAC responses. Regenerated on each uplink.
-
pending_requests
(repeatedMACCommand
) -
Pending MAC requests(i.e. sent requests, for which no response has been received yet). Regenerated on each downlink.
-
queued_join_accept
(MACState.JoinAccept
) -
Queued join-accept. Set each time a (re-)join request accept is received from Join Server and removed each time a downlink is scheduled.
-
pending_join_request
(JoinRequest
) -
Pending join request. Set each time a join accept is scheduled and removed each time an uplink is received from the device.
-
rx_windows_available
(bool
) -
Whether or not Rx windows are expected to be open. Set to true every time an uplink is received. Set to false every time a successful downlink scheduling attempt is made.
Show object example
{
"current_parameters": {},
"desired_parameters": {},
"device_class": "CLASS_A",
"lorawan_version": "MAC_UNKNOWN",
"last_confirmed_downlink_at": "0001-01-01T00:00:00Z",
"last_dev_status_f_cnt_up": 0,
"ping_slot_periodicity": "PING_EVERY_1S",
"pending_application_downlink": {},
"queued_responses": [],
"pending_requests": [],
"queued_join_accept": {},
"pending_join_request": {},
"rx_windows_available": false,
}
Message MessagePayloadFormatters
-
up_formatter
(PayloadFormatter
) -
defined_only
Payload formatter for uplink messages, must be set together with its parameter.
-
up_formatter_parameter
(string
) -
Parameter for the up_formatter, must be set together.
-
down_formatter
(PayloadFormatter
) -
defined_only
Payload formatter for downlink messages, must be set together with its parameter.
-
down_formatter_parameter
(string
) -
Parameter for the down_formatter, must be set together.
Show object example
{
"up_formatter": "FORMATTER_NONE",
"up_formatter_parameter": "",
"down_formatter": "FORMATTER_NONE",
"down_formatter_parameter": "",
}
Message RootKeys
Root keys for a LoRaWAN device. These are stored on the Join Server.
-
root_key_id
(string
) -
max_len
:2048
Join Server issued identifier for the root keys.
-
app_key
(KeyEnvelope
) -
The (encrypted) Application Key.
-
nwk_key
(KeyEnvelope
) -
The (encrypted) Network Key.
Show object example
{
"root_key_id": "",
"app_key": {},
"nwk_key": {},
}
Message Session
-
dev_addr
(bytes
) -
Device Address, issued by the Network Server or chosen by device manufacturer in case of testing range (beginning with 00-03). Known by Network Server, Application Server and Join Server. Owned by Network Server.
-
keys
(SessionKeys
) -
required
-
last_f_cnt_up
(uint32
) -
Last uplink frame counter value used. Network Server only. Application Server assumes the Network Server checked it.
-
last_n_f_cnt_down
(uint32
) -
Last network downlink frame counter value used. Network Server only.
-
last_a_f_cnt_down
(uint32
) -
Last application downlink frame counter value used. Application Server only.
-
last_conf_f_cnt_down
(uint32
) -
Frame counter of the last confirmed downlink message sent. Network Server only.
-
started_at
(google.protobuf.Timestamp
) -
Time when the session started. Network Server only.
Show object example
{
"dev_addr": "",
"keys": {},
"last_f_cnt_up": 0,
"last_n_f_cnt_down": 0,
"last_a_f_cnt_down": 0,
"last_conf_f_cnt_down": 0,
"started_at": "0001-01-01T00:00:00Z",
}
Message SessionKeys
Session keys for a LoRaWAN session. Only the components for which the keys were meant, will have the key-encryption-key (KEK) to decrypt the individual keys.
-
session_key_id
(bytes
) -
max_len
:2048
Join Server issued identifier for the session keys. This ID can be used to request the keys from the Join Server in case the are lost.
-
f_nwk_s_int_key
(KeyEnvelope
) -
The (encrypted) Forwarding Network Session Integrity Key (or Network Session Key in 1.0 compatibility mode). This key is stored by the (forwarding) Network Server.
-
s_nwk_s_int_key
(KeyEnvelope
) -
The (encrypted) Serving Network Session Integrity Key. This key is stored by the (serving) Network Server.
-
nwk_s_enc_key
(KeyEnvelope
) -
The (encrypted) Network Session Encryption Key. This key is stored by the (serving) Network Server.
-
app_s_key
(KeyEnvelope
) -
The (encrypted) Application Session Key. This key is stored by the Application Server.
Show object example
{
"session_key_id": "",
"f_nwk_s_int_key": {},
"s_nwk_s_int_key": {},
"nwk_s_enc_key": {},
"app_s_key": {},
}
Message SetEndDeviceRequest
-
end_device
(EndDevice
) -
required
-
field_mask
(google.protobuf.FieldMask
)
Show object example
{
"end_device": {},
"field_mask": {},
}
Message UpdateEndDeviceRequest
-
end_device
(EndDevice
) -
required
-
field_mask
(google.protobuf.FieldMask
)
Show object example
{
"end_device": {},
"field_mask": {},
}
Enums
Enum MACVersion
| Name | Value | Description |
|---|---|---|
MAC_UNKNOWN |
0 |
|
MAC_V1_0 |
1 |
|
MAC_V1_0_1 |
2 |
|
MAC_V1_0_2 |
3 |
|
MAC_V1_1 |
4 |
|
MAC_V1_0_3 |
5 |
Enum PHYVersion
| Name | Value | Description |
|---|---|---|
PHY_UNKNOWN |
0 |
|
PHY_V1_0 |
1 |
|
PHY_V1_0_1 |
2 |
|
PHY_V1_0_2_REV_A |
3 |
|
PHY_V1_0_2_REV_B |
4 |
|
PHY_V1_1_REV_A |
5 |
|
PHY_V1_1_REV_B |
6 |
|
PHY_V1_0_3_REV_A |
7 |
Enum PowerState
Power state of the device.
| Name | Value | Description |
|---|---|---|
POWER_UNKNOWN |
0 |
|
POWER_BATTERY |
1 |
|
POWER_EXTERNAL |
2 |


Windows Command line Gems
February 06, 2021 —
Vinayak Gadkari
For beginners, here’s a list of windows command line tools that are really useful.
- driverquery : installed drivers.
- openfiles : files opened by network users
- netstat : monitor port activity
- recover : recover corrupt file
- systeminfo : detailed configuration information
- schtasks : schedule tasks
- subst : use alternate drive letter
- net use : connect/disconnect a shared resource
- pushd/popd : switch directory conveniently
- qwinsta/rwinsta : Query/Remove Remote Desktop connections


How to use bake in Eclipse
Choose the C/C++ perspective
The menu items described on this page only appear in the C/C++ perspective.
Select a build configuration of the main project
Right click on the main project and select a bake build configuration. Note, that only configurations with a DefaultToolchain will be displayed.
If no Project.meta or configuration with a DefaultToolchain exist, an error item will be displayed like this:
The chosen config is marked with a filled circle before the config name.You can also see it directly in the project explorer:
This label decoration can be switched off and on via Window->Preferences->General->Appearance->Label Decorations.
Adjust includes and defines for CDT
As you might have already seen, a new menu item for the main project is enabled now: Adjust includes and defines for CDT.
All CDT features work out-of-the-box except those about the #include and #define statements e.g. auto-completion of includes.
To import the includes and defines into the CDT .cproject files, simply click on this menu item.
Compiler internal includes and defines must be specified in InternalInclude and InternalDefine files. See "Syntax" help page how to set the name of these files. Note, that the
variables CPPPath, CPath, ASMPath, ArchiverPath and LinkerPath can be used in these files.
Adjusting can take between a few seconds and a minute depending on the size of the workspace and the number of project settings which have to be written.
Build/Clean Projects/Files
Now you can build or clean a project by clicking on the appropriate menu items.
| Project |
File (note: Build File always rebuilds the file) |
|
|
Result
The result of the build will be shown in the Console and Problems View as usual:
Preferences
Via Window->Preferences->bake some settings can be changed and the bake command line can be extended:


Normally only one person can speak at a time in a standard conference call and it only gets worse the more people there are.
This isn't like in real life, where we zone in and out of large groups, form smaller ones as the conversation takes us.
You don't even need to log in, all you need is your face.
This is all a bit of an experiment, why not try it out?


Next: Listing Earley sets, Previous: Listing symbols, Up: Tracing and diagnosing parses [Contents][Index]
The parse diagnostics should include a facility for displaying
the rules in a grammar.
The rules will have IDs from 0 to the highest rule ID,
which can be found using the
marpa_g_highest_rule_id()
method
(see marpa_g_highest_rule_id).
It is up to the application whether to have names for rules.
In some grammar generators,
the LHS of a rule serves as its name,
but does not produce unique names for each rule in Libmarpa,
since many rules may have the same LHS.
Currently the most used upper layer for Libmarpa,
Marpa::R2
, does not have rule names.
An application that does want to name its rules must
decide on a rule naming convention.
At the highest verbosity level, the rule listing facility should display
Next: Listing Earley sets, Previous: Listing symbols, Up: Tracing and diagnosing parses [Contents][Index]


--- layout: post status: publish published: true title: DirecTV & Tivo in bed again. author: display_name: iguy login: iguy email<EMAIL_ADDRESS>url: '' author_login: iguy author_email<EMAIL_ADDRESS>wordpress_id: 11 wordpress_url: http://itsjustanotherlayer.com/?p=11 date: !binary |- MjAwOC0wOS0yMSAwMzoxMDo0OCAtMDUwMA== date_gmt: !binary |- MjAwOC0wOS0yMSAwMzoxMDo0OCAtMDUwMA== categories: - Fun and Life tags: - DirecTV - Tivo comments: [] ---
Sweet news for DVR done right. DirecTV and Tivo together again!
As a diehard fan of DirecTV and Tivo, especially the DirecTivo systems, this is the best news I've heard in months. My DirecTivo's are each dying slowly and surely. They are an easy 5 years old at this point which is quite old consumer electronics typically (with 2 kids, 2 dogs, a cat and moving 3 times).


Notes¶
Dependencies¶
How to build and install¶
git clone https://github.com/HDembinski/histogram.git
mkdir build && cd build
cmake ../histogram/build
make install
Do make test
to run the tests, or ctest -V
for more output.
Caveat: I couldn’t figure out a proper way to install the Python module with CMake, so for the time being, CMake will print a message with manual instructions instead. The main problem is how to pick the right dist-packages path in a platform-independent way, and such that it respects the CMAKE_INSTALL_PREFIX
.
Tests¶
Most of the C++ interface is implicitly tested in the tests of the Python interface, which in turn calls the C++ interface.
Checks¶
Some checks are included in test/check
. These are not strictly tests, and not strictly examples, yet they provide useful information that belongs with the library code. They are not build by default, building can be activated with the CMake flag BUILD_CHECKS
.
Consistency of C++ and Python interface¶
The Python and C++ interface are indentical - except when they are not. The exceptions concern cases where a more elegant and pythonic way of implementing things exists. In a few cases, the C++ classes have extra member functions for convenience, which are not needed on the Python side.
- Properties
- Getter/setter-like functions are wrapped as properties.
- Keyword-based parameters
- C++ member functions
histogram::fill()
andhistogram::wfill()
are wrapped by the single Python member functionhistogram.fill()
with an optional keyword parameterw
to pass a weight. - C++ convenience
- C++ member function
histogram::bins()
is omitted on the Python side, since it is very easy to just query this directly from the axis object in Python. On the C++ side, this would require a extra type cast or applying a visitor.
Benchmarks¶
One design goal of this project is to be fast. The act of filling the histogram with a number should be insignificant compared to the CPU cycles spend to retrieve/generate that number. Naturally, we also want to beat the competition.
The following table shows results of a simple benchmark against
TH1I
,TH3I
andTHnI
of the ROOT frameworkhistogram()
andhistogramdd()
from the Python modulenumpy
The benchmark against ROOT is implemented in C++, the benchmark against numpy in Python.
Remarks:
- The comparison with ROOT puts ROOT at the advantage, since
TH1I
andTH3I
are specialized classes for 1 dimension and 3 dimensions, not a general class for N-dimensions likeboost::histogram
. ROOT histograms also lack a comparably flexible system to define different binning schemes for each axis. - Large vectors are pre-allocated and with random numbers drawn from a uniform or normal distribution for all tests. In the timed part, these numbers are read from the vector and put into the histograms. This reduces the overhead merely to memory access.
- The test with uniform random numbers never fills the overflow and underflow bins, while the test with random numbers from a normal distribution does. This explains some of the differences between the two distributions.
- All tests are repeated 10 times, the minimum is shown.
Test system: Intel Core i7-4500U CPU clocked at 1.8 GHz, 8 GB of DDR3 RAM
| distribution | uniform | normal | ||||
|---|---|---|---|---|---|---|
| dimension | 1D | 3D | 6D | 1D | 3D | 6D |
| No. of fills | 12M | 4M | 2M | 12M | 4M | 2M |
| C++: ROOT [t/s] | 0.127 | 0.199 | 0.185 | 0.168 | 0.143 | 0.179 |
| C++: boost [t/s] | 0.172 | 0.177 | 0.155 | 0.172 | 0.171 | 0.150 |
| Py: numpy [t/s] | 0.825 | 0.727 | 0.436 | 0.824 | 0.426 | 0.401 |
| Py: boost [t/s] | 0.209 | 0.229 | 0.192 | 0.207 | 0.194 | 0.168 |
boost::histogram
shows consistent performance comparable to the specialized ROOT histograms. It is faster than ROOT’s implementation of a N-dimensional histogram THnI
. The performance of boost::histogram
is similar in C++ and Python, showing only a small overhead in Python. It is consistently faster than numpy’s histogram functions.


All Classes
MainWindow
Map
MapObject
ObjectPathResourceGetter
RouteManager
RouteManagerWindow
Settings
SettingsController
Station
StationDatabase
StationLink
StatisticsLogger
Train
TrainRoute


lineageTrajectory.Rd
For given space (e.g., UMAP, PCA, etc.), lineage trajectories are fit using prinicpal curves, and these are then used to derive pseudotimes.
lineageTrajectory( space, start = NULL, group.labels = NULL, pseudotimes = NULL, thresh = 0.001, maxit = 10, stretch = 2, smoother = "smooth_spline", approx_points = 100, trace = FALSE, plot_iterations = FALSE )
| space | A numeric matrix or a data frame containing the coordinates of samples. |
|---|---|
| start | either a previously fit principal curve, or else a matrix of points that in row order define a starting curve. If missing or NULL, then the first principal component is used. If the smoother is "periodic_lowess", then a circle is used as the start. |
| group.labels | Character vector (same length as number of rows in space) specifying group membership. Optional. |
| pseudotimes | Either logical (TRUE) specifying whether to use internally generated pseudotimes (from principal curve fitting) to color generated umap points, or, numeric vector with pseudotimes. If provided, plotted data are colored by pseudotime. Otherwise colored by group membership. |
| thresh | convergence threshold on shortest distances to the curve. Default is 0.001. |
| maxit | maximum number of iterations. |
| stretch | A stretch factor for the endpoints of the curve, allowing the curve to grow to avoid bunching at the end. Must be a numeric value between 0 and 2. |
| smoother | choice of smoother. The default is "smooth_spline", and other choices are "lowess" and "periodic_lowess". The latter allows one to fit closed curves. Beware, you may want to use iter = 0 with lowess(). |
| approx_points | Approximate curve after smoothing to reduce computational time. If FALSE, no approximation of the curve occurs. Otherwise, approx_points must be equal to the number of points the curve gets approximated to; preferably about 100. |
| trace | If TRUE, the iteration information is printed |
| plot_iteractions | If TRUE the iterations are plotted. |
list of results containing principal curve fits and coordinates, pseutimes, plots
Nicholas Mikolajewicz


Team Generator
Squads
Player
Category
Sortear
Insert/Edit Player
Player Name
Category
Gold
Silver
Wood
Save Player
Player List
Player Name
Category


Ladies Football revamp senior structures for 2020 - with no Leinster Championship
by By Tony LeenThe Ladies Gaelic Football Association has revealed a major revamp of the 2020 All-Ireland Senior Championship structure.
Next year's All-Ireland series will consist of two six-team groups, with the top two from each group progressing to the All-Ireland semi-finals, following a minimum of five games.
The Provincial championships will consequently be organised on a knock-out basis, with the winners seeded in the draw for the All-Ireland series.
The bottom team in each group will contest a relegation play-off, unless they are a provincial winner, and thereby exempt from relegation.
There will be no Senior Championship in Leinster for 2020, and the groups for the All-Ireland series will be decided at the LGFA’s next Central Council meeting, and circulated thereafter.


Attachment uploading:
Messages:
|
Model history (Select revision to compare with present model): [new]: Click revision to browse its content | ||||||
| num | actions | resource | type _titles_ | _title_ | _/titles_
|---|


Why using this?
If you're in the mech keyboard hobby (addiction? Drug? WHAT NANI?!), you've sometimes struggled to find a way to check the size of your keycaps. 2.25U or 2.5U?! Y U DO DIZ?! So instead of comparing key between themselves (if you have reference keys), here is a chart of keys.
How could i be sure it's the good size for my screen?
You can see there is a referal image of a credit card. Credit cards are normalized with the rule ISO 7810 ID-1. So the chart presented here is done in referal of this. If you don't have a credit card: Rob the bank or stole you mum's one.
My credit card doesn't fit, DIZ IZ BROKEN!
No. All screen does not have the same DPI and pixel size. That's why there is a Zoom slider which gives you the possibility to adjust the chart to your screen.


Dog of the Week: Frances
Source: Spark Rescue
Meet Frances " Fritz" for short, this adorable 3 month old male cattle dog puppy ( possibly Basenji, Kelpie?) was recently rescued from an over crowded shelter in southern CA.
Fritz is incredibly smart and sweet with all animals but should be fed separate around other animals! He is a high energy pup that would thrive in a ranch or working type of environment!
Fritz is going to his foster home today and will be available for adoption soon! www.sparkrescue.org


This is a simple demo app based on both Tinder (swipe left/right) and Tensorflow (calculate weights based on datapoints) Here's how it works


The support for older versions of Internet Explorer ended in 2016. It is not actively developed anymore and as such lags modern features.
Making a feature work in Internet Explorer takes up as much time as building the feature itself for all other browser. As we only have limited time we strive to develop features of the future instead of supporting the past.
Please change to a more modern browser: Chrome, Firefox, Edge, Safari.


Cardinals Online Banking
Dashboard
View Account
Credit
Debit
Transfer
Warning!
You need to have
JavaScript
enabled to use this site.
Home
Dashboard


| ${chance}% Chance of ${value} Bleeding Damage over ${duration} Second(s) | 33.0% Chance of min: [9.0, 16.0, 23.0, 31.0, 39.0, 47.0, 55.0, 64.0, 73.0, 83.0, 92.0, 103.0, 112.0, 123.0, 134.0, 147.0] Bleeding Damage over min: 3.0 Second(s) |
| MaxLevel | 12 |
| UltimateLevel | 16 |


Following the success of our 2019 event, the University of Sheffield (Sheffield, United Kingdom) is pleased to announce that we will be hosting the 2020 online GPU Hackathon as part of the international GPU Hackathon Series. This event will take place July 27th - 31st, 2020 most likely as an online event unless government restrictions around COVID-19 are significantly altered. NVIDIA are committed to ensuring that developer and research communities can still participate in our GPU Hackathons and Bootcamps, enabling them to develop the hands-on skills needed to leverage GPUs to accelerate their scientific codes. Prior GPU experience is not required, as those selected will be paired with experienced mentors who will teach them how to leverage accelerated computing in their own applications or further optimize their codes.


We are a family, certified as one of the best family-own bakeries, your family, with a wish to share home-made flavours; flavours and frgancies from the kitchen
that have been shaping our identity; these flavours and fragancies coming from our home oven, that unite us
around a table so we get to enjoy precious family moments; these flavours and fragancies that make us come back
to our childhood home so we can revive happier moments. For that, we put so much effort in using original
ingredients, to preserve the home art of bakery.


The PWG meetings will be held on May 2-4, 2017 only via WebEx teleconference (Virtual F2F).
There is no registration fee or RSVP survey for this meeting.
To join the online meeting:
Call-in toll-free number (US/Canada): +1<PHONE_NUMBER>
Call-in toll number (US/Canada): +1<PHONE_NUMBER>
Call-in toll number (US/Canada): +1<PHONE_NUMBER>
Global toll-free call in numbers and other audio options ("Call Me Back" or VoIP) are listed once you join the WebEx meeting.
Attendee access code: Presented in the WebEx meeting
Note:All times are US Mountain Daylight Time ( UTC−06:00) - daylight savings time takes effect March 12, 2017 in the US.
Discussions at PWG face-to-face meetings are covered by the PWG Policy on Intellectual Property and Confidentiality - basically everything we discuss is non-confidential and can be included in an open standard.
| Date | Times | Description |
|---|---|---|
| May 2 | 10:00 AM to 11:15 AM | PWG Plenary · PWG / Mopria Liaison slides (from Mopria) |
| 11:15 AM to 12:00 PM | OpenPrinting - Plenary | |
| 12:00 PM to 12:30 PM | Break / Lunch | |
| 12:30 PM to 1:30 PM | OpenPrinting - CUPS Plenary | |
| 1:30 PM to 2:00 PM | OpenPrinting - GSoC 2017 Common Print Dialog | |
| 2:00 PM to 2:30 PM | OpenPrinting - CUPS Filters | |
| May 3 | 10:00 AM to 12:00 PM | IDS WG : Status · Charter |
| 12:00 PM to 12:30 PM | Break / Lunch | |
| 12:30 PM to 2:30 PM | IPP WG : Status · Charter · System Service | |
| May 4 | 10:00 AM to 10:45 AM | OpenPrinting - Status of Ghostscript / MuPDF |
| 10:45 AM to 11:15 AM | PWG / OpenPrinting - Collaborative Projects Discussion | |
| 11:15 AM to 12:00 PM | SM WG : Slides · Charter · JDFMAP as Best Practices | |
| 12:00 PM to 12:30 PM | Break / Lunch | |
| 12:30 PM to 1:00 PM | IPP WG : IPP Get-User-Printer-Attributes whitepaper | |
| 1:00 PM to 1:45 PM | IPP WG : IPP Presets white paper · HTTP Authentication Methods and IPP | |
| 1:45 PM to 2:30 PM | IPP WG : IPP 3D Print Job Ticket · Next Steps |


|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |
| Uses of ClosureTableTreeNode in fri.util.database.jpa.tree.closuretable |
|---|
| Methods in fri.util.database.jpa.tree.closuretable that return ClosureTableTreeNode | |
|---|---|
ClosureTableTreeNode |
ClosureTableTreeDao.addChild(ClosureTableTreeNode parent,
ClosureTableTreeNode child)
Adds to end of children of given parent. |
ClosureTableTreeNode |
ClosureTableTreeDao.addChildAt(ClosureTableTreeNode parent,
ClosureTableTreeNode child,
int position)
Adds at specified position to children of given parent. |
ClosureTableTreeNode |
ClosureTableTreeDao.addChildBefore(ClosureTableTreeNode sibling,
ClosureTableTreeNode child)
Adds to children before given sibling, sibling is pushed backwards in children list. |
ClosureTableTreeNode |
ClosureTableTreeNode.clone()
For copy and unique constraint checking this is required. |
ClosureTableTreeNode |
ClosureTableTreeDao.copy(ClosureTableTreeNode node,
ClosureTableTreeNode parent,
ClosureTableTreeNode copiedNodeTemplate)
Copies the given node to end of children list of parent. |
ClosureTableTreeNode |
ClosureTableTreeDao.copyBefore(ClosureTableTreeNode node,
ClosureTableTreeNode sibling,
ClosureTableTreeNode copiedNodeTemplate)
Copies the given node to position of given sibling, pushing sibling backwards in list. |
ClosureTableTreeNode |
ClosureTableTreeDao.copyTo(ClosureTableTreeNode node,
ClosureTableTreeNode parent,
int position,
ClosureTableTreeNode copiedNodeTemplate)
Copies the given node to given position in children list of parent. |
ClosureTableTreeNode |
ClosureTableTreeDao.copyToBeRoot(ClosureTableTreeNode child,
ClosureTableTreeNode copiedNodeTemplate)
Copies a tree to be a root. |
ClosureTableTreeNode |
ClosureTableTreeDao.createRoot(ClosureTableTreeNode root)
Creates a tree root node. |
ClosureTableTreeNode |
ClosureTableTreeDao.find(java.io.Serializable id)
|
ClosureTableTreeNode |
TreePath.getAncestor()
One of the ancestor tree nodes of the descendant, or the descendant itself. |
ClosureTableTreeNode |
TreePath.getDescendant()
The (descendant) tree node (of the ancestor). |
ClosureTableTreeNode |
ClosureTableTreeDao.getParent(ClosureTableTreeNode child)
|
ClosureTableTreeNode |
ClosureTableTreeDao.getRoot(ClosureTableTreeNode node)
|
protected ClosureTableTreeNode |
TemporalClosureTableTreeTest.newTreePojo(java.lang.String name)
|
protected ClosureTableTreeNode |
ClosureTableTreeTest.newTreePojo(java.lang.String name)
|
| Methods in fri.util.database.jpa.tree.closuretable that return types with arguments of type ClosureTableTreeNode | |
|---|---|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.find(ClosureTableTreeNode parent,
java.util.Map<java.lang.String,java.lang.Object> criteria)
Convenience finder method. |
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.findDirectChildren(java.util.List<ClosureTableTreeNode> subNodes)
Finds direct children in a cached list of tree nodes, parent is first in that cached list. |
java.util.List<ClosureTableTreeNode> |
TemporalClosureTableTreeDao.findRemoved(ClosureTableTreeNode parent,
java.util.Map<java.lang.String,java.lang.Object> criteria)
|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.findSubTree(ClosureTableTreeNode parent,
java.util.List<ClosureTableTreeNode> subNodes)
Finds a sub-tree list in a cached list of tree nodes under given parent. |
java.util.List<ClosureTableTreeNode> |
TemporalClosureTableTreeDao.findValidDirectChildren(java.util.List<ClosureTableTreeNode> subNodes)
Use this to retrieve children lists that do not contain removed nodes from trees returned by getFullTreeCacheable() . |
java.util.List<ClosureTableTreeNode> |
TemporalClosureTableTreeDao.getAllRoots()
|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.getChildren(ClosureTableTreeNode parent)
Gives the children of passed parent. |
java.util.List<ClosureTableTreeNode> |
TemporalClosureTableTreeDao.getFullTreeCacheable(ClosureTableTreeNode node)
|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.getPath(ClosureTableTreeNode node)
|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.getRoots()
|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.getTree(ClosureTableTreeNode parent)
Reads a tree or sub-tree, including all children. |
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.getTreeCacheable(ClosureTableTreeNode parent)
Reads a tree or sub-tree, including all children, which can be cached and passed back into findSubTree() or findDirectChildren() . |
protected UniqueTreeConstraint<ClosureTableTreeNode> |
TemporalClosureTableTreeTest.newUniqueChildrenTreeConstraintImpl()
|
protected UniqueTreeConstraint<ClosureTableTreeNode> |
ClosureTableTreeTest.newUniqueChildrenTreeConstraintImpl()
|
protected UniqueTreeConstraint<ClosureTableTreeNode> |
TemporalClosureTableTreeTest.newUniqueChildrenTreeConstraintImplWithoutRoots()
|
protected UniqueTreeConstraint<ClosureTableTreeNode> |
ClosureTableTreeTest.newUniqueChildrenTreeConstraintImplWithoutRoots()
|
protected UniqueTreeConstraint<ClosureTableTreeNode> |
TemporalClosureTableTreeTest.newUniqueWholeTreeConstraintImpl()
|
protected UniqueTreeConstraint<ClosureTableTreeNode> |
ClosureTableTreeTest.newUniqueWholeTreeConstraintImpl()
|
protected UniqueTreeConstraint<ClosureTableTreeNode> |
TemporalClosureTableTreeTest.newUniqueWholeTreeConstraintImplWithoutRoots()
|
protected UniqueTreeConstraint<ClosureTableTreeNode> |
ClosureTableTreeTest.newUniqueWholeTreeConstraintImplWithoutRoots()
|
| Methods in fri.util.database.jpa.tree.closuretable with parameters of type ClosureTableTreeNode | |
|---|---|
ClosureTableTreeNode |
ClosureTableTreeDao.addChild(ClosureTableTreeNode parent,
ClosureTableTreeNode child)
Adds to end of children of given parent. |
ClosureTableTreeNode |
ClosureTableTreeDao.addChildAt(ClosureTableTreeNode parent,
ClosureTableTreeNode child,
int position)
Adds at specified position to children of given parent. |
ClosureTableTreeNode |
ClosureTableTreeDao.addChildBefore(ClosureTableTreeNode sibling,
ClosureTableTreeNode child)
Adds to children before given sibling, sibling is pushed backwards in children list. |
protected void |
TemporalClosureTableTreeTest.checkTreeIntegrity(DbSession session,
ClosureTableTreeNode root)
|
protected void |
ClosureTableTreeTest.checkTreeIntegrity(DbSession session,
ClosureTableTreeNode root)
Checks that no ClosureTableTreeNode is not connected to TreePath. |
ClosureTableTreeNode |
ClosureTableTreeDao.copy(ClosureTableTreeNode node,
ClosureTableTreeNode parent,
ClosureTableTreeNode copiedNodeTemplate)
Copies the given node to end of children list of parent. |
ClosureTableTreeNode |
ClosureTableTreeDao.copyBefore(ClosureTableTreeNode node,
ClosureTableTreeNode sibling,
ClosureTableTreeNode copiedNodeTemplate)
Copies the given node to position of given sibling, pushing sibling backwards in list. |
ClosureTableTreeNode |
ClosureTableTreeDao.copyTo(ClosureTableTreeNode node,
ClosureTableTreeNode parent,
int position,
ClosureTableTreeNode copiedNodeTemplate)
Copies the given node to given position in children list of parent. |
ClosureTableTreeNode |
ClosureTableTreeDao.copyToBeRoot(ClosureTableTreeNode child,
ClosureTableTreeNode copiedNodeTemplate)
Copies a tree to be a root. |
ClosureTableTreeNode |
ClosureTableTreeDao.createRoot(ClosureTableTreeNode root)
Creates a tree root node. |
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.find(ClosureTableTreeNode parent,
java.util.Map<java.lang.String,java.lang.Object> criteria)
Convenience finder method. |
java.util.List<ClosureTableTreeNode> |
TemporalClosureTableTreeDao.findRemoved(ClosureTableTreeNode parent,
java.util.Map<java.lang.String,java.lang.Object> criteria)
|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.findSubTree(ClosureTableTreeNode parent,
java.util.List<ClosureTableTreeNode> subNodes)
Finds a sub-tree list in a cached list of tree nodes under given parent. |
int |
ClosureTableTreeDao.getChildCount(ClosureTableTreeNode parent)
|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.getChildren(ClosureTableTreeNode parent)
Gives the children of passed parent. |
java.util.List<ClosureTableTreeNode> |
TemporalClosureTableTreeDao.getFullTreeCacheable(ClosureTableTreeNode node)
|
int |
ClosureTableTreeDao.getLevel(ClosureTableTreeNode node)
|
protected java.lang.String |
TemporalClosureTableTreeTest.getName(ClosureTableTreeNode node)
|
protected java.lang.String |
ClosureTableTreeTest.getName(ClosureTableTreeNode node)
|
ClosureTableTreeNode |
ClosureTableTreeDao.getParent(ClosureTableTreeNode child)
|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.getPath(ClosureTableTreeNode node)
|
protected java.util.List<? extends TreePath> |
ClosureTableTreeDao.getPathsToRemove(ClosureTableTreeNode node)
|
ClosureTableTreeNode |
ClosureTableTreeDao.getRoot(ClosureTableTreeNode node)
|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.getTree(ClosureTableTreeNode parent)
Reads a tree or sub-tree, including all children. |
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.getTreeCacheable(ClosureTableTreeNode parent)
Reads a tree or sub-tree, including all children, which can be cached and passed back into findSubTree() or findDirectChildren() . |
TreePath |
ClosureTableTreeDao.getTreePathEntity(ClosureTableTreeNode node)
This is for the case when the provided TreePath implementation contains additional properties concerning the node. |
boolean |
ClosureTableTreeDao.isChildOf(ClosureTableTreeNode child,
ClosureTableTreeNode parent)
|
boolean |
ClosureTableTreeDao.isEqualToOrChildOf(ClosureTableTreeNode child,
ClosureTableTreeNode parent)
|
boolean |
ClosureTableTreeDao.isLeaf(ClosureTableTreeNode node)
|
boolean |
ClosureTableTreeDao.isRoot(ClosureTableTreeNode node)
|
void |
ClosureTableTreeDao.move(ClosureTableTreeNode node,
ClosureTableTreeNode parent)
Moves the given node to end of children list of parent. |
void |
ClosureTableTreeDao.moveBefore(ClosureTableTreeNode node,
ClosureTableTreeNode sibling)
Moves the given node to position of given sibling, pushing sibling backwards in list. |
void |
ClosureTableTreeDao.moveTo(ClosureTableTreeNode node,
ClosureTableTreeNode parent,
int position)
Moves the given node to given position in children list of parent. |
void |
ClosureTableTreeDao.moveToBeRoot(ClosureTableTreeNode child)
Moves a sub-tree to be a root. |
protected fri.util.database.jpa.tree.closuretable.CacheableTreeList |
TemporalClosureTableTreeDao.newCacheableTreeList(ClosureTableTreeNode parent,
java.util.List<TreePath> breadthFirstTree)
Factory method for new CacheableTreeList. |
protected fri.util.database.jpa.tree.closuretable.CacheableTreeList |
ClosureTableTreeDao.newCacheableTreeList(ClosureTableTreeNode parent,
java.util.List<TreePath> breadthFirstTree)
Factory method for new CacheableTreeList. |
void |
ClosureTableTreeDao.remove(ClosureTableTreeNode node)
Removes the tree under given node, including the node. |
protected void |
TemporalClosureTableTreeDao.removeNode(ClosureTableTreeNode nodeToRemove)
Overridden to do nothing as related paths are historicized. |
protected void |
ClosureTableTreeDao.removeNode(ClosureTableTreeNode nodeToRemove)
Called from remove() for all sub-nodes of removed tree. |
void |
TemporalClosureTableTreeDao.removePhysically(ClosureTableTreeNode node)
Physically deletes the tree under given node, including the node itself. |
protected void |
TemporalClosureTableTreeDao.removeTree(ClosureTableTreeNode parent)
Overridden to set the historicizing date by calling validToOnRemove(). |
protected void |
ClosureTableTreeDao.removeTree(ClosureTableTreeNode parent)
Called from remove() after locking tree. |
protected void |
TemporalClosureTableTreeTest.renameBeforeCopy(ClosureTableTreeNode node)
|
protected void |
ClosureTableTreeTest.renameBeforeCopy(ClosureTableTreeNode node)
|
void |
TreePath.setAncestor(ClosureTableTreeNode ancestor)
|
void |
TreePath.setDescendant(ClosureTableTreeNode descendant)
|
protected void |
TemporalClosureTableTreeTest.setNameNotConstraintChecking(ClosureTableTreeNode node,
java.lang.String name)
|
protected void |
ClosureTableTreeTest.setNameNotConstraintChecking(ClosureTableTreeNode node,
java.lang.String name)
|
int |
ClosureTableTreeDao.size(ClosureTableTreeNode parent)
|
void |
TemporalClosureTableTreeDao.unremove(ClosureTableTreeNode node)
Recovers the given removed (historicized) node, including all sub-nodes. |
void |
ClosureTableTreeDao.update(ClosureTableTreeNode node)
Updates the given persistent object. |
| Method parameters in fri.util.database.jpa.tree.closuretable with type arguments of type ClosureTableTreeNode | |
|---|---|
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.findDirectChildren(java.util.List<ClosureTableTreeNode> subNodes)
Finds direct children in a cached list of tree nodes, parent is first in that cached list. |
java.util.List<ClosureTableTreeNode> |
ClosureTableTreeDao.findSubTree(ClosureTableTreeNode parent,
java.util.List<ClosureTableTreeNode> subNodes)
Finds a sub-tree list in a cached list of tree nodes under given parent. |
java.util.List<ClosureTableTreeNode> |
TemporalClosureTableTreeDao.findValidDirectChildren(java.util.List<ClosureTableTreeNode> subNodes)
Use this to retrieve children lists that do not contain removed nodes from trees returned by getFullTreeCacheable() . |
| Constructor parameters in fri.util.database.jpa.tree.closuretable with type arguments of type ClosureTableTreeNode | |
|---|---|
ClosureTableTreeDao(java.lang.Class<? extends ClosureTableTreeNode> treeNodeEntityClass,
java.lang.Class<? extends TreePath> treePathsEntityClass,
boolean orderIndexMatters,
DbSession session)
|
|
ClosureTableTreeDao(java.lang.Class<? extends ClosureTableTreeNode> treeNodeEntityClass,
java.lang.String treeNodeEntity,
java.lang.Class<? extends TreePath> treePathEntityClass,
java.lang.String treePathEntity,
boolean orderIndexMatters,
DbSession session)
|
|
TemporalClosureTableTreeDao(java.lang.Class<? extends ClosureTableTreeNode> treeNodeEntityClass,
java.lang.Class<? extends TreePath> treePathsEntityClass,
boolean positionMatters,
java.lang.String validFromPropertyName,
java.lang.String validToPropertyName,
DbSession session)
|
|
TemporalClosureTableTreeDao(java.lang.Class<? extends ClosureTableTreeNode> treeNodeEntityClass,
java.lang.String treeNodeEntity,
java.lang.Class<? extends TreePath> treePathEntityClass,
java.lang.String treePathEntity,
boolean positionMatters,
java.lang.String validFromPropertyName,
java.lang.String validToPropertyName,
DbSession session)
|
| Uses of ClosureTableTreeNode in fri.util.database.jpa.tree.closuretable.pojos |
|---|
| Classes in fri.util.database.jpa.tree.closuretable.pojos that implement ClosureTableTreeNode | |
|---|---|
class |
ClosureTableTreePojo
Example POJO for the unit test, implementing ClosureTableTreeNode via JPA. |
| Methods in fri.util.database.jpa.tree.closuretable.pojos that return ClosureTableTreeNode | |
|---|---|
ClosureTableTreeNode |
ClosureTableTreePojo.clone()
|
ClosureTableTreeNode |
TreePathImpl.getAncestor()
|
ClosureTableTreeNode |
TemporalTreePathImpl.getAncestor()
|
ClosureTableTreeNode |
TreePathImpl.getDescendant()
|
ClosureTableTreeNode |
TemporalTreePathImpl.getDescendant()
|
| Methods in fri.util.database.jpa.tree.closuretable.pojos with parameters of type ClosureTableTreeNode | |
|---|---|
void |
TreePathImpl.setAncestor(ClosureTableTreeNode ancestor)
|
void |
TemporalTreePathImpl.setAncestor(ClosureTableTreeNode ancestor)
|
void |
TreePathImpl.setDescendant(ClosureTableTreeNode descendant)
|
void |
TemporalTreePathImpl.setDescendant(ClosureTableTreeNode descendant)
|
| Uses of ClosureTableTreeNode in fri.util.database.jpa.tree.closuretable.uniqueconstraints |
|---|
| Methods in fri.util.database.jpa.tree.closuretable.uniqueconstraints with parameters of type ClosureTableTreeNode | |
|---|---|
protected void |
UniqueWholeTreeConstraintImpl.appendNodeCheckingCondition(ClosureTableTreeNode root,
java.lang.StringBuilder queryText,
java.util.List<java.lang.Object> parameters)
|
| Method parameters in fri.util.database.jpa.tree.closuretable.uniqueconstraints with type arguments of type ClosureTableTreeNode | |
|---|---|
boolean |
UniqueChildrenTemporalConstraintImpl.checkUniqueConstraint(java.util.List<ClosureTableTreeNode> nodes,
TreeActionLocation<ClosureTableTreeNode> location)
The implementation of this is expected to check the uniqueness of passed node(s). |
boolean |
UniqueChildrenTemporalConstraintImpl.checkUniqueConstraint(java.util.List<ClosureTableTreeNode> nodes,
TreeActionLocation<ClosureTableTreeNode> location)
The implementation of this is expected to check the uniqueness of passed node(s). |
boolean |
UniqueChildrenConstraintImpl.checkUniqueConstraint(java.util.List<ClosureTableTreeNode> nodes,
TreeActionLocation<ClosureTableTreeNode> location)
The implementation of this is expected to check the uniqueness of passed node(s). |
boolean |
UniqueChildrenConstraintImpl.checkUniqueConstraint(java.util.List<ClosureTableTreeNode> nodes,
TreeActionLocation<ClosureTableTreeNode> location)
The implementation of this is expected to check the uniqueness of passed node(s). |
| Uses of ClosureTableTreeNode in fri.util.database.jpa.tree.examples.closuretable |
|---|
| Classes in fri.util.database.jpa.tree.examples.closuretable that implement ClosureTableTreeNode | |
|---|---|
class |
PersonCtt
Example entity, Ctt = Closure Table Tree. |
| Methods in fri.util.database.jpa.tree.examples.closuretable that return ClosureTableTreeNode | |
|---|---|
ClosureTableTreeNode |
PersonCtt.clone()
|
ClosureTableTreeNode |
PersonOrganisationalTreePath.getAncestor()
|
ClosureTableTreeNode |
PersonFunctionalTreePath.getAncestor()
|
ClosureTableTreeNode |
PersonOrganisationalTreePath.getDescendant()
|
ClosureTableTreeNode |
PersonFunctionalTreePath.getDescendant()
|
| Methods in fri.util.database.jpa.tree.examples.closuretable with parameters of type ClosureTableTreeNode | |
|---|---|
void |
PersonOrganisationalTreePath.setAncestor(ClosureTableTreeNode ancestor)
|
void |
PersonFunctionalTreePath.setAncestor(ClosureTableTreeNode ancestor)
|
void |
PersonOrganisationalTreePath.setDescendant(ClosureTableTreeNode descendant)
|
void |
PersonFunctionalTreePath.setDescendant(ClosureTableTreeNode descendant)
|
| Uses of ClosureTableTreeNode in fri.util.database.jpa.tree.examples.closuretable.temporal |
|---|
| Methods in fri.util.database.jpa.tree.examples.closuretable.temporal that return ClosureTableTreeNode | |
|---|---|
ClosureTableTreeNode |
PersonTemporalTreePath.getAncestor()
|
ClosureTableTreeNode |
PersonTemporalTreePath.getDescendant()
|
| Methods in fri.util.database.jpa.tree.examples.closuretable.temporal with parameters of type ClosureTableTreeNode | |
|---|---|
void |
PersonTemporalTreePath.setAncestor(ClosureTableTreeNode ancestor)
|
void |
PersonTemporalTreePath.setDescendant(ClosureTableTreeNode descendant)
|
| Uses of ClosureTableTreeNode in fri.util.database.jpa.tree.examples.closuretable.temporal.deletedflag |
|---|
| Methods in fri.util.database.jpa.tree.examples.closuretable.temporal.deletedflag that return ClosureTableTreeNode | |
|---|---|
ClosureTableTreeNode |
PersonDeletedFlagTreePath.getAncestor()
|
ClosureTableTreeNode |
PersonDeletedFlagTreePath.getDescendant()
|
| Methods in fri.util.database.jpa.tree.examples.closuretable.temporal.deletedflag with parameters of type ClosureTableTreeNode | |
|---|---|
void |
PersonDeletedFlagTreePath.setAncestor(ClosureTableTreeNode ancestor)
|
void |
PersonDeletedFlagTreePath.setDescendant(ClosureTableTreeNode descendant)
|
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |


| Opcode/Instruction | Op/En | 64/32 bit Mode Support | CPUID Feature Flag | Description |
|---|---|---|---|---|
| VEX.128.66.0F38.W0 0E /r VTESTPS xmm1, xmm2/m128 | RM | V/V | AVX | Set ZF and CF depending on sign bit AND and ANDN of packed single-precision floating-point sources. |
| VEX.256.66.0F38.W0 0E /r VTESTPS ymm1, ymm2/m256 | RM | V/V | AVX | Set ZF and CF depending on sign bit AND and ANDN of packed single-precision floating-point sources. |
| VEX.128.66.0F38.W0 0F /r VTESTPD xmm1, xmm2/m128 | RM | V/V | AVX | Set ZF and CF depending on sign bit AND and ANDN of packed double-precision floating-point sources. |
| VEX.256.66.0F38.W0 0F /r VTESTPD ymm1, ymm2/m256 | RM | V/V | AVX | Set ZF and CF depending on sign bit AND and ANDN of packed double-precision floating-point sources. |
| Op/En | Operand 1 | Operand 2 | Operand 3 | Operand 4 |
| RM | ModRM:reg (r) | ModRM:r/m (r) | NA | NA |
VTESTPS performs a bitwise comparison of all the sign bits of the packed single-precision elements in the first source operation and corresponding sign bits in the second source operand. If the AND of the source sign bits with the dest sign bits produces all zeros, the ZF is set else the ZF is clear. If the AND of the source sign bits with the inverted dest sign bits produces all zeros the CF is set else the CF is clear. An attempt to execute VTESTPS with VEX.W=1 will cause #UD.
VTESTPD performs a bitwise comparison of all the sign bits of the double-precision elements in the first source operation and corresponding sign bits in the second source operand. If the AND of the source sign bits with the dest sign bits produces all zeros, the ZF is set else the ZF is clear. If the AND the source sign bits with the inverted dest sign bits produces all zeros the CF is set else the CF is clear. An attempt to execute VTESTPS with VEX.W=1 will cause #UD.
The first source register is specified by the ModR/M reg field.
128-bit version: The first source register is an XMM register. The second source register can be an XMM register or a 128-bit memory location. The destination register is not modified.
VEX.256 encoded version: The first source register is a YMM register. The second source register can be a YMM register or a 256-bit memory location. The destination register is not modified.
Note: In VEX-encoded versions, VEX.vvvv is reserved and must be 1111b, otherwise instructions will #UD.
TEMP[127:0]←SRC[127:0] AND DEST[127:0] IF (TEMP[31] = TEMP[63] = TEMP[95] = TEMP[127] = 0) THEN ZF←1; ELSE ZF←0; TEMP[127:0]←SRC[127:0] AND NOT DEST[127:0] IF (TEMP[31] = TEMP[63] = TEMP[95] = TEMP[127] = 0) THEN CF←1; ELSE CF←0; DEST (unmodified) AF←OF←PF←SF←0;
TEMP[255:0]←SRC[255:0] AND DEST[255:0] IF (TEMP[31] = TEMP[63] = TEMP[95] = TEMP[127]= TEMP[160] =TEMP[191] = TEMP[224] = TEMP[255] = 0) THEN ZF←1; ELSE ZF←0; TEMP[255:0]←SRC[255:0] AND NOT DEST[255:0] IF (TEMP[31] = TEMP[63] = TEMP[95] = TEMP[127]= TEMP[160] =TEMP[191] = TEMP[224] = TEMP[255] = 0) THEN CF←1; ELSE CF←0; DEST (unmodified) AF←OF←PF←SF←0;
TEMP[127:0]←SRC[127:0] AND DEST[127:0] IF ( TEMP[63] = TEMP[127] = 0) THEN ZF←1; ELSE ZF←0; TEMP[127:0]←SRC[127:0] AND NOT DEST[127:0] IF ( TEMP[63] = TEMP[127] = 0) THEN CF←1; ELSE CF←0; DEST (unmodified) AF←OF←PF←SF←0;
TEMP[255:0]←SRC[255:0] AND DEST[255:0] IF (TEMP[63] = TEMP[127] = TEMP[191] = TEMP[255] = 0) THEN ZF←1; ELSE ZF←0; TEMP[255:0]←SRC[255:0] AND NOT DEST[255:0] IF (TEMP[63] = TEMP[127] = TEMP[191] = TEMP[255] = 0) THEN CF←1; ELSE CF←0; DEST (unmodified) AF←OF←PF←SF←0;
VTESTPS int _mm256_testz_ps (__m256 s1, __m256 s2);
int _mm256_testc_ps (__m256 s1, __m256 s2);
int _mm256_testnzc_ps (__m256 s1, __m128 s2);
int _mm_testz_ps (__m128 s1, __m128 s2);
int _mm_testc_ps (__m128 s1, __m128 s2);
int _mm_testnzc_ps (__m128 s1, __m128 s2);
VTESTPD int _mm256_testz_pd (__m256d s1, __m256d s2);
int _mm256_testc_pd (__m256d s1, __m256d s2);
int _mm256_testnzc_pd (__m256d s1, __m256d s2);
int _mm_testz_pd (__m128d s1, __m128d s2);
int _mm_testc_pd (__m128d s1, __m128d s2);
int _mm_testnzc_pd (__m128d s1, __m128d s2);
The 0F, AF, PF, SF flags are cleared and the ZF, CF flags are set according to the operation.
None.
See Exceptions Type 4; additionally
| #UD | If VEX.vvvv ≠ 1111B. |
| If VEX.W = 1 for VTESTPS or VTESTPD. |


If you want to be able to vote against candidates simply add an option that represents no candidate that way, you can still prioritize candidates you don't want with respect to each-other


Id: 62
Name: Canklanker Thom
Status: Dead
Species: Alien
Type: Gromflomite
Gender: Male
OriginName: Gromflom Prime
OriginUrl: https://rickandmortyapi.com/api/location/19
LocationName: unknown
LocationUrl:
Image: https://rickandmortyapi.com/api/character/avatar/62.jpeg
Episode: ['https://rickandmortyapi.com/api/episode/1']
Url: https://rickandmortyapi.com/api/character/62
Created: 2017-11-05T12:06:23.217Z


Please fill out the form accordingly. Put the number of items you want in the box next to each. Sweet and sour pork $5.00 Kung Pao chicken $5.25 Szechuan Fish $5.00 Beef with Broccoli $5.10 Imperial shrimp $5.95 Mixed Vegetable $4.50 Soup $3.50 Please select one of the following options: Uhart Student (10% off) Uhart Professor (5% off) Neither Student or Professor (no discount) SubTotal: $ Money saved with discounts: $


SEED & Generate Key Pair & issue Addresses
Enter string (min 8 Characters):
Base Seed:
Addresses Count:
Full Account info:
Account Seed:
privateKey:
publicKey:
Address:


I'm a crime-fighting superhero with a heart of gold and affinity for furry animals.
I have training in aggregating clicks-and-mortar experiences, empowering sexy e-commerce, using Oxford commas like a boss, and twinning out with my two awesome sisters.
No one strategizes value-added vortals better than me.
Startup jargon courtesy of BullShit Generator and Hipster Business Name Generator.
Millennials aren't wealthy, but they're rich in time. In this article, I write about how to focus efforts and be more intentional, in gifs.
Read My Policy.Mic ArticleEmail me to find out more about my experience, ask me out,
or just say hello!


Apollo
TimbaObjects built an SMS based election monitoring system called Apollo. This tool enables observers send reports from the polling units during an election using text messages in a specific format. Messages sent are stored in a database, that is monitored on the Apollo web application platform. Analysis is performed on the received data for further use. Apollo has been used for election monitoring in countries like Nigeria, Zimbabwe, Tunisia, Zambia, Malawi and Azerbaijan.
How does it work?
Observers are assigned to polling units and are given unique observer ID. These observers are trained to observe the elections, and are required to send in reports from the polling units via SMS to a short code in a specific format that the application has been designed to accept.
Features Includes:
- Dashboard to monitor SMS status.
- Checklist Form that enables data clerks edit data sent in from the polling units.
- Incidents Form to monitor and edit polling units incidents reports.
- Observer Performance Rating.
- Message Log to monitor Incoming and Outgoing SMS.
- Convergence Chart to analyze voting party results.
- Quality Assurance to compute and calculate the data quality.
- Analyses to compute and analyze date sent in.
Apollo is a user centered application, the application has been built and designed in a way that makes it easy to learn and use. Hence, events are easy to deploy using the application. TimbaObjects also provides technical support anytime and anywhere there is a deployment.


My name is Denilson Makotsi, I am a post high school graduate and am currently learning at Moringa School.I was born in Eldoret the year 1999, and am 19 years old. I went to Olympic Primary School after which i was called to join Upper Hill School where i got my secondary education, now am taking IT (programming) at Moringa School. Iam working with an NGO organisation known as NEWSPRING FOUNDATION,it aims at helping the less fortunate families who cannot raise enough money to fund their children education. Iam the director here in Kenya and i can say am still getting to learn since i have a mentor who is helping me on disbursing the funds, and teaching me on how such an organisation works. I decided to take classes at Moringa since i have this great ambition of becoming a developer in the coming years. Moringa is one among the very few known schools that produce some of the best coders in kenya, because of this i decided to take this classes since i know i will be safe in securing a nice job in this tech growing world, especially when Kenya is aiming to the VISION 2030. We also want to become a tech country like other developed countries Japan being at the fore front. This technique will also help me in learning my engineering course where i can come up with great ideas on improving housing in our country Kenya.
They say most developers are the most introverted people on earth, however i have great intreast in many things as of now, here is a list of what i do apart from learning.


License Advisory Services are IT consulting services that provide software licensing best practices to organizations with mid-to-large sized enterprise application portfolios such as Oracle, Microsoft, IBM, VMWare, SAP and Networking. Benefits include reduced waste, mitigated risks, increased awareness and transparency, and efficiency gains.
Software Licensing
- Evaluation of Existing Licensing Portfolio
- Licensing Transparency and Cost Reduction
- Contract Evaluation & Optimization Services
- Alignment of Software Spend with IT Roadmap
- Benchmarking RFP and Negotiation Support
Asset Management
- Software Asset Management - Standard & Recurring Services
- Software Audit Protection Services
- Risk Reduction & Compliance
- Asset Management Roadmap & Vision
- Application Usage Monitoring
Strategic Sourcing
- Tail End / Industry Specific Software Procurement Services
- Real Time Online Portal for Software Licenses
- Price Benchmarking Services
- Tax Optimized Sourcing
- Supplier & Contract Management
Cloud
- Cloud- Proof of Concept(POC) Based Services
- Cloud Readiness- Assessment Exercise
- Cloud Security Advisory Services
- Cloud Solution Evangelization & Sourcing
- Cloud Services Design & Transition
- Migration Assistance
Network Services
- Network Integration/Upgrade Advisory Services
- Network Architecture Design Services
- Network Assessment & Discovery Workshop
- Networking Strategy & Optimization Services
- Network Auditing Services
Technology Evangelization
- Technology Adoption Workshop
- Industry/ Vertical Specific Business Solutions
- Solutions- Proof Of Concept (POC)
- Solution Discovery & Evaluation
- Solution Architecture & Design
- IT Roadmap - Design & Advisory Services
Complex technologies, dynamic business environments and process excellence are among the main challenges organizations face on their path to growth. Understanding the complexities of the IT environment, Silver Leaf Solutions extends its expertise in IT services to ensure that the technology is in line with your business objectives, no matter the size and nature of your organization.
Product Implementation
- Software Installation and Version Upgrade
- Application Compatibility & Migration Services
- Network Integration Services
Cloud Deployment
- Workload Transition
- Consumption Support Services
- Data Migration And Backup Services On Cloud
Support & Maintenance
- 24x7 Software Licensing Help Desk
- Technical support
Training & Enablement
- Technology and Licensing Workshops
- Certifications
- Skillset assessment & Evaluation
It is impossible to manage software suppliers effectively unless you can influence sourcing. The major players are so big and powerful that they usually have the upper hand in discussions about maintenance renewals and service levels. Even small software providers can build immovable, entrenched positions in their chosen niches. Silver Leaf Solutions explains how to build this connection, by creating formal categorization of your software suppliers and using it to influence software category sourcing strategies. You therefore need different people handling each side, but collaborating closely with each other.
Software Licenses
- Software License Fulfillment
- Software Spend Management & Outsourcing
- SLA based services
Network & Software Appliances
- Network Hardware Fulfilment (LAN, WAN & Security Solutions)


Task name: Task name error
Task Assignee: Member error
Description:
Task Due Date: Due Date error
Key: error
Notifications:
One day earlier
Three days earlier
Seven days earlier


Premium Materials
Our trombones use the shiniest brass which is sourced locally. This will increase the longevity of your purchase.
Fast Shipping
We make sure you recieve your trombone as soon as we have finished making it. We also provide free returns if you are not satisfied.
Quality Assurance
For every purchase you make, we will ensure there are no damages or faults and we will check and test the pitch of your instrument.
TENOR TROMBONE
$600
Lorem ipsum.
Lorem ipsum.
Lorem ipsum dolor.
Lorem ipsum.
BASS TROMBONE
$900
Lorem ipsum.
Lorem ipsum.
Lorem ipsum dolor.
Lorem ipsum.
VALVE TROMBONE
$1200
Lorem ipsum.
Lorem ipsum.
Lorem ipsum dolor.
Lorem ipsum.


Contact
Resources
About
Skills
Some Text Art
Bio
Home
Some Helpful Resources...
For ABSOlUTE Beginners:
Codecademy (my personal favorite)
Code.org (recommonded: complete Hour of Code
Code Avengers (free trial)
----------------------------------
Client-Side Web Development
Learn HTML, CSS, JavaScript, and wayyy more! Comes with a referece guide
Plain and Simple Guide to HTML
Learn Everything About JavaScript
----------------------------------
Server-Side Web Development
Beginning PHP
Learn Ajax (recommended: a basic understanding of JavaScript first)
Ruby on Rails Documentation (recommended: a basic understanding of Ruby first)
----------------------------------
Game Development
Learn C#
Create a Tile-Based Video Game
Slick GL Tutorial (recommended: a basic understanding of Java first)
----------------------------------
Data Science
SQL Tutorial
Intro to Data Science
Learn R Programming Language
----------------------------------
Text Editor's and IDE's
IDE (paid) For All Things Web
Eclipse (a smart IDE for Java)
Sublime Text Editor
Aptana Studio 3
Notepad++ Open-source Text Editor
C, C++, Fortran IDE
----------------------------------
Inspirational Tech YouTubers
Bucky Roberts (@thenewboston)
Kathryn Hodge (@blondiebytes)
Derek Banas (@derekbanas)


Located about 50nm south of Jakostad. It is both an industrial city and a university town with many cultural activities. It is reputed to be the sunniest place in Finland.
Position 63° 05.5'N, 21° 35.2'E.
There is a guest harbour here.
New port added March 2013.


Preparation time
less than 30 mins
Cooking time
30 mins to 1 hour
Serves
Makes 16 mini cakes
Dietary
Small, but perfectly formed, this modern take on a retro classic is perfect for elevenses.
Equipment and preparation: for this recipe you will need a 16-cup mini cake tin or 16 x 5cm/2in chefs’ rings placed on a baking tray, plus a piping bag fitted with a 2D star nozzle.
Preheat the oven to 190C/170C(fan)/375F/Gas 5. Grease a 16-cup mini cake tin and line with baking parchment, or, alternatively, grease 16 chefs’ rings (5cm/2in diameter) and place them on a baking tray lined with baking parchment.
For the cakes, place the butter, sugar, eggs, flour, baking powder and coffee essence into a bowl and beat with a wooden spoon until thoroughly blended and smooth. Fold in the walnuts.
Divide or pipe the mixture equally between the mini cake tins. Bake for about 12-15 minutes, or until well-risen and the top of the cake springs back when lightly pressed with a finger.
Leave to cool in the tins for a few minutes. When cool enough to handle, turn the cakes out of the tins and remove the parchment. Leave to cool completely on a wire rack.
For the filling and decoration, beat together the butter, icing sugar, milk and coffee essence in a bowl until smooth.
When the cakes are completely cold, trim the tops if domed. Slice in half horizontally, then sandwich them together with about a quarter of the buttercream.
Spread a thin coating of buttercream around the sides of each cake and then roll the sides in chopped walnuts.
Spoon the remaining buttercream into a piping bag fitted with a small star (2D) nozzle and pipe a rose on the top of each cake. Place a chocolate-covered coffee bean over the joins.
Arrange the cupcakes on the nicest cake stand you have and serve.


Created and automated Ventricular Assist Device 3D design on SolidWorks.
Implemented dynamic load testing control GUI on LabView with MatLab Data Aquisition.
Redesigned a smart watch PCB on the Altium Designer.
Code
Coding on C based language fir IOT microcontrollers.
R language for post data analytics and Machine learning application
Data science and microcontroller applications using Python.
Tools
Hired by USDOT as a Test Engineer to debug and troubleshoot back-end and front-end components of a Linux based Embedded System.
Utilized Spyeder and Jupyter Notebook for Python based Machine Learing development and Data Analytics.


{% include head.html %}
I am a postdoctoral scholar at the Quantum Materials Laboratory (a.k.a Analytis Group) in the Physics department at UC Berkeley. My research focuses on various magnetic phenomena in quantum materials such as Weyl semimetals and frustrated magnets. Read my latest work on Co3Sn2S2 published in Nature Communications.
Thesis title: “Scanning SQUID On Tip microscopy of topological states of matter”
Thesis title: “Study of Vortex Dynamics in Type-II Superconductors by SOT microscopy”
Cryogenics, Scanning probe microscopy (both using and designing), micropipette handling and SQUID-On-Tip fabrication, nanofabrication and characterization, crystal growths, transport measurements, magnetic measurements, strain measurements, VdW materials manipulation.
Design and automation of experiments (LabView), image and data analysis (MatLab, Python), Arduino programming and interfacing with chip evaluation boards.
table-top scale (SPM system, strain system), high precision mm sized parts for CNC fabrication, micron-sized sample masks for e-beam and optical lithography, PCB design. Using Autodesk Inventor, Layout Editor and Eagle Cad.
Guiding groups of all ages (K-12 to seniors) and education levels (nonscientific to physics undergraduates) through physics exhibits at the Clore garden of science. Public speaking in both Hebrew and English about supreconductivity, the wonders of microscopy, superconductivity and topological phases.Writing about scientific subjects to the general public.
which provide free, accessible, proof-checked scientific knowledge to the public over the Facebook social platform.
Given as part of the Science at Cal lecture series.
Ideation, production and participation in the event Ask a Berkeley Scientist, together with the team of Science at Cal as part of the Bay Area Science Festival.
Participated as a scientist in the event Dinner with a Scientist, hosted by the Oakland Unified School District.
Writing about science news, science phenomena and answering questions.
A final project in physics as a substitute for an exam. Includes a small lab project and a final report submission.
The Davidson Institute is the educational arm of the Weizmann Institute of Science.
Mentoring was ranged between small group mentoring during experiments, and tours of the scanning SQUID microscopy lab.
I was a group guide at the Clore Garden of Science, guiding groups and VIP visitors from the age of 6 to 60 (and probably older).
Given to the general public, high school students and junior-high students.
Given during "science on tap" events (2014,2015).
Given to high school students in the "Chetz" program.
Awarded for stopping a nuclear meltdown, even though I also started it.
Honored by Duff Beer for being an outstanding customer several years straight. Qualifications included most beer consumed at a bar, most beer purchased, and most beer ralphed.
Specifically this prestigious awarded twice for stopping a robber with my belly.


Nominatim to Google Maps
Blake Bordovsky 2015
Path Coordinates
Fill out any of the following:
(Less specific tends to give better results).