Module concision_core::prelude

Re-exports

• pub use super::linear;
• pub use super::LinearActivation;
• pub use super::Loss;
• pub use super::error::ModelError;
• pub use super::Fft;
• pub use super::store::ParamStore;
• pub use super::Param;
• pub use super::Params;
• pub use ndarray_rand::RandomExt;
• pub use super::Transform;
• pub use super::direction::Direction;
• pub use super::Result;
• pub use super::kinds::*;
• pub use super::binary::*;
• pub use super::nl::*;
• pub use super::model::*;
• pub use super::module::*;
• pub use super::cmp::*;
• pub use super::plan::*;
• pub use super::math::*;
• pub use super::predict::*;
• pub use super::train::*;

Modules

• consts

Structs

• Error
• FastFourierTransform
• PadActionIter
  An iterator over the variants of PadAction
• Padding
• Parameter

Enums

• PadAction
• PadMode
• ParamKind

Constants

• DEFAULT_MODEL_SIZE
• EPSILON

Traits

• Affine
• ArrayLike
• Decrement
  Decrement generally describes an object capable of decrementing itself;
• DefaultLike
• Entry
• FillLike
• GenerateRandom
• Increment
• Init
• InitInplace
• IntoAxis
• Inverse
• IsSquare
• Matmul
• Matpow
• OnesLike
• OrInsert
• PadItem
• Setup
• Store
• TensorConstructor
• ZerosLike

Functions

• concat_iter
  Creates an n-dimensional array from an iterator of n dimensional arrays.
• fft
  Computes the Fast Fourier Transform of a one-dimensional, complex-valued signal.
• floor_div
• genspace
• hstack
• ifft
  Computes the Inverse Fast Fourier Transform of an one-dimensional, complex-valued signal.
• inverse
• irfft
  Computes the Inverse Fast Fourier Transform of an one-dimensional, real-valued signal. TODO: Fix the function; currently fails to compute the correct result
• lecun_normal
• lecun_normal_seeded
• linarr
• linspace
• pad
• pad_to
• randc
  Generate a random array of complex numbers with real and imaginary parts in the range [0, 1)
• randc_normal
• randcomplex
• rangespace
  creates a matrix from the given shape filled with numerical elements [0, n) spaced evenly by 1
• rfft
  Computes the Fast Fourier Transform of an one-dimensional, real-valued signal. TODO: Optimize the function to avoid unnecessary computation.
• round_to
  Round the given value to the given number of decimal places.
• seeded_stdnorm
• seeded_uniform
  Creates a random array from a uniform distribution using a given key
• stack_iter
  Creates a larger array from an iterator of smaller arrays.
• stdnorm
  Given a shape, generate a random array using the StandardNormal distribution
• tril
  Returns the lower triangular portion of a matrix.
• triu
  Returns the upper triangular portion of a matrix.
• vstack

Type Aliases

• BoxError
• BoxResult