Module nalgebra::base

source ·
Expand description

[Reexported at the root of this crate.] Data structures for vector and matrix computations.

Re-exports

Modules

  • Abstract definition of a matrix data storage allocator.
  • Compatibility constraints between matrix shapes, e.g., for addition or multiplication.
  • Structures to which matrices and vector can be auto-dereferenced (through Deref) to access components using their names. For example, if v is a 3D vector, one can write v.z instead of v[2].
  • The default matrix data storage allocator.
  • Traits and tags for identifying the dimension of all algebraic entities.
  • Indexing
  • Matrix iterators.
  • Abstract definition of a matrix data storage.
  • Mechanisms for working with values that may not be initialized.

Structs

  • A array-based statically sized matrix data storage.
  • Euclidean norm.
  • Lp norm.
  • The most generic column-major matrix (and vector) type.
  • L-infinite norm aka. Chebytchev norm aka. uniform norm aka. suppremum norm.
  • A wrapper that ensures the underlying algebraic entity has a unit norm.
  • A Vec-based matrix data storage. It may be dynamically-sized.
  • A matrix data storage for a matrix view. Only contains an internal reference to another matrix data storage.
  • A mutable matrix data storage for mutable matrix view. Only contains an internal mutable reference to another matrix data storage.

Traits

  • A range with a size that may be known at compile-time.
  • A trait for abstract matrix norms.
  • Trait implemented by entities scan be be normalized and put in an Unit struct.
  • The basic scalar type for all structures of nalgebra.
  • SliceRangeDeprecated
    A range with a size that may be known at compile-time.

Type Aliases