Struct LowerTriangularPositiveSemidefiniteMatrix 

pub struct LowerTriangularPositiveSemidefiniteMatrix {
    pub components_included_inthe_matrix: MatrixIncludedComponents,
    pub matrix: LowerTriangularPositiveSemidefiniteMatrixColumns,
}

Available on crate feature _etsi and (crate features _cdd_2_2_1 or _etsi) only.

This DF represents a lower triangular positive semi-definite matrix.

It shall include the following components:

• @field componentsIncludedIntheMatrix: the indication of which components of a @ref PerceivedObject are included in the matrix. This component also implicitly indicates the number n of included components which defines the size (n x n) of the full correlation matrix “A”.

• @field matrix: the list of cells of the lower triangular positive semi-definite matrix ordered by columns and by rows.

The number of columns to be included “k” is equal to the number of included components “n” indicated by componentsIncludedIntheMatrix minus 1: k = n-1. These components shall be included in the order or their appearance in componentsIncludedIntheMatrix. Each column “i” of the lowerTriangularCorrelationMatrixColumns contains k-(i-1) values.

@category: Sensing information

@revision: Created in V2.1.1

Fields

components_included_inthe_matrix: MatrixIncludedComponents

matrix: LowerTriangularPositiveSemidefiniteMatrixColumns

Implementations

impl LowerTriangularPositiveSemidefiniteMatrix

pub fn new( components_included_inthe_matrix: MatrixIncludedComponents, matrix: LowerTriangularPositiveSemidefiniteMatrixColumns, ) -> Self

Trait Implementations

impl AsnType for LowerTriangularPositiveSemidefiniteMatrix

const TAG: Tag = { rasn::types::Tag::SEQUENCE }

The associated tag for the type.

const IDENTIFIER: Identifier

Identifier of an ASN.1 type as specified in the original specification if not identical with the identifier of Self

const TAG_TREE: TagTree = _

The root of this type’s tree of tag’s if it a CHOICE type, otherwise its Leaf that points Self::TAG.

const CONSTRAINTS: Constraints = Constraints::NONE

The set of constraints for values of the given type.

const IS_CHOICE: bool = false

Whether the type is choice type. PER/OER encoding rules require this knowledge.

fn is_present(&self) -> bool

Whether the type is present with value. OPTIONAL fields are common in SEQUENCE or SET.

impl Clone for LowerTriangularPositiveSemidefiniteMatrix

fn clone(&self) -> LowerTriangularPositiveSemidefiniteMatrix

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Constructed<2> for LowerTriangularPositiveSemidefiniteMatrix

const FIELDS: Fields<2usize>

Fields contained in the “root component list”.

const IS_EXTENSIBLE: bool = false

Whether the type is extensible.

const EXTENDED_FIELDS: Option<Fields<0usize>> = None

Fields contained in the list of extensions.

impl Debug for LowerTriangularPositiveSemidefiniteMatrix

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Decode for LowerTriangularPositiveSemidefiniteMatrix

fn decode_with_tag_and_constraints<_DECODER: Decoder>( decoder: &mut _DECODER, tag: Tag, constraints: Constraints, ) -> Result<Self, _DECODER::Error>

Decode this value implicitly tagged with tag from a given ASN.1 decoder with a set of constraints on what values of that type are allowed.

fn decode<D>(decoder: &mut D) -> Result<Self, <D as Decoder>::Error>

where D: Decoder,

Decode this value from a given ASN.1 decoder.

fn decode_with_tag<D>( decoder: &mut D, tag: Tag, ) -> Result<Self, <D as Decoder>::Error>

where D: Decoder,

Decode this value implicitly tagged with tag from a given ASN.1 decoder.

fn decode_with_constraints<D>( decoder: &mut D, constraints: Constraints, ) -> Result<Self, <D as Decoder>::Error>

where D: Decoder,

Decode this value from a given ASN.1 decoder with a set of constraints on what values of that type are allowed.

impl Encode for LowerTriangularPositiveSemidefiniteMatrix

fn encode_with_tag_and_constraints<'encoder, _ENCODER: Encoder<'encoder>>( &self, encoder: &mut _ENCODER, tag: Tag, constraints: Constraints, identifier: Identifier, ) -> Result<(), _ENCODER::Error>

Encode this value with tag into the given crate::Encoder with the constraints the values this is allowed to encode into.

fn encode<'b, E>( &self, encoder: &mut E, ) -> Result<(), <E as Encoder<'b>>::Error>

where E: Encoder<'b>,

Encodes self’s data into the given crate::Encoder.

fn encode_with_tag<'b, E>( &self, encoder: &mut E, tag: Tag, ) -> Result<(), <E as Encoder<'b>>::Error>

where E: Encoder<'b>,

Encode this value with tag into the given crate::Encoder.

fn encode_with_identifier<'b, E>( &self, encoder: &mut E, identifier: Identifier, ) -> Result<(), <E as Encoder<'b>>::Error>

where E: Encoder<'b>,

Encode this value with identifier into the given crate::Encoder.

fn encode_with_tag_and_identifier<'b, E>( &self, encoder: &mut E, tag: Tag, identifier: Identifier, ) -> Result<(), <E as Encoder<'b>>::Error>

where E: Encoder<'b>,

Encode this value with tag and identifier into the given crate::Encoder.

fn encode_with_constraints<'b, E>( &self, encoder: &mut E, constraints: Constraints, ) -> Result<(), <E as Encoder<'b>>::Error>

where E: Encoder<'b>,

Encode this value into the given crate::Encoder with the constraints the values this is allowed to encode into.

fn encode_with_constraints_and_identifier<'b, E>( &self, encoder: &mut E, constraints: Constraints, identifier: Identifier, ) -> Result<(), <E as Encoder<'b>>::Error>

where E: Encoder<'b>,

Encode this value into the given crate::Encoder with identifier and the constraints the values this is allowed to encode into.

impl Hash for LowerTriangularPositiveSemidefiniteMatrix

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for LowerTriangularPositiveSemidefiniteMatrix

fn eq(&self, other: &LowerTriangularPositiveSemidefiniteMatrix) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for LowerTriangularPositiveSemidefiniteMatrix

impl StructuralPartialEq for LowerTriangularPositiveSemidefiniteMatrix