Module underlier

Structs

• BitIterationStrategy
  The iteration strategy for the given underlier type ‘U’ that is treated as a packed collection of bits.
• DivisibleStrategy
  Specialized iteration strategy for types that can be cast to an array of the elements of a smaller type ‘T’.
• FallbackStrategy
  Fallback iteration strategy for types that do not have a specialized strategy.
• IterationMethods
  IterationMethods<T, U> is supposed to implement an optimal strategy for the pair of types (T, U).
• ScaledUnderlier
  A type that represents a pair of elements of the same underlier type. We use it as an underlier for the ScaledPAckedField type.
• SmallU
  Unsigned type with a size strictly less than 8 bits.

Traits

• Divisible
  Underlier value that can be split into a slice of smaller U values. This trait is unsafe because it allows to reinterpret the memory of a type as a slice of another type.
• IterationStrategy
  The iteration strategy for the given underlier type ‘U’ that is treated as a packed collection of ’T’s.
• NumCast
  A trait that represents potentially lossy numeric cast. Is a drop-in replacement of as _ in a generic code.
• Random
  A value that can be randomly generated
• UnderlierType
  Primitive integer underlying a binary field or packed binary field implementation. Note that this type is not guaranteed to be POD, U1, U2 and U4 have some unused bits.
• UnderlierWithBitOps
  Underlier type that supports bit arithmetic.
• WithUnderlier
  A type that is transparently backed by an underlier.

Type Aliases

• U1
• U2
• U4