Crate sigma_types

Source
Expand description

Types that maintain a given invariant.

Modules§

  • Terms less than a constant (defined by PartialOrd comparison).

Structs§

  • Iterable data structure in which each element satisfies a given invariant.
  • Iterable data structure in which each adjacent pair of elements satisfies a given invariant.
  • Finite terms (e.g. for floating points, not NaN, infinite, etc.).
  • Negative terms (defined by comparison to zero).
  • Non-negative terms (defined by comparison to zero).
  • Non-positive terms (defined by comparison to zero).
  • Nonzero terms (defined by comparison to zero).
  • At least one element in an iterator did not satisfy the given invariant.
  • At least one pair in an iterator did not satisfy the given invariant.
  • A term expected to be finite was not.
  • A term expected to be positive was not.
  • A term expected to be non-negative was, in fact, negative.
  • A term expected to be non-positive was, in fact, positive.
  • A term expected to be nonzero was, in fact, zero.
  • Term expected to be on the unit interval (between 0 and 1) was not.
  • A term expected to be positive was not.
  • Terms on the unit interval (between 0 and 1), either inclusive or exclusive at each extreme.
  • Positive terms (defined by comparison to zero).
  • Type that maintains a given invariant.
  • Pair guaranteed to be sorted left-to-right (optionally permitted to be equal).

Enums§

  • Some elements in a supposedly sorted iterator were not sorted.

Traits§

  • Types that can represent infinite values.
  • Types equipped with a multiplicative identity (i.e., one).
  • Function-like type that checks an invariant and optionally provides an error message.
  • Types equipped with an additive identity (i.e., zero).

Type Aliases§

  • Finite terms (e.g. for floating points, not NaN, infinite, etc.).
  • Negative terms (defined by comparison to zero).
  • Non-negative terms (defined by comparison to zero).
  • Non-positive terms (defined by comparison to zero).
  • Nonzero terms (defined by comparison to zero).
  • Terms on the unit interval (between 0 and 1), either inclusive or exclusive at each extreme.
  • Positive terms (defined by comparison to zero).
  • Iterable data structure guaranteed to be sorted (optionally with or without duplicates).
  • Iterable data structure guaranteed to be sorted (optionally with or without duplicates).