Trait lfa::basis::EnumerableBasis

pub trait EnumerableBasis<T>: Basis<T> where
    Self::Value: Index<usize, Output = ActivationT>, {
    fn ith(&self, input: T, index: IndexT) -> Result<ActivationT> { ... }
}

Provided methods

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

Compute the the i^th element of the projection for the given input.

Note: the default implementation computes the full basis to access a single index. More computational efficient methods should be implemented where possible.

Loading content...

Implementors

impl<'a, T> EnumerableBasis<T> for UniformGrid where
    T: IntoIterator<Item = &'a f64>, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<'a, T, H> EnumerableBasis<T> for TileCoding<H> where
    T: IntoIterator<Item = &'a f64>,
    H: BuildHasher, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<I: Borrow<f64>, T: IntoIterator<Item = I>> EnumerableBasis<T> for Fourier

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<I: Borrow<f64>, T: IntoIterator<Item = I>> EnumerableBasis<T> for Polynomial where
    T::IntoIter: Clone, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<I: Borrow<f64>, T: IntoIterator<Item = I>> EnumerableBasis<T> for Chebyshev where
    T::IntoIter: Clone, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<T> EnumerableBasis<T> for Bias

fn ith(&self, _: T, index: IndexT) -> Result<ActivationT>

impl<T> EnumerableBasis<T> for Fixed<(usize, HashSet<IndexT>)>

fn ith(&self, _: T, index: IndexT) -> Result<ActivationT>

impl<T> EnumerableBasis<T> for Fixed<Vec<f64>>

fn ith(&self, _: T, index: IndexT) -> Result<ActivationT>

impl<T, B> EnumerableBasis<T> for L0Normaliser<B> where
    B: Basis<T, Value = Features>,
    B::Value: Index<usize, Output = ActivationT>, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<T, B> EnumerableBasis<T> for L1Normaliser<B> where
    B: Basis<T, Value = Features>,
    B::Value: Index<usize, Output = ActivationT>, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<T, B> EnumerableBasis<T> for L2Normaliser<B> where
    B: Basis<T, Value = Features>,
    B::Value: Index<usize, Output = ActivationT>, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<T, B> EnumerableBasis<T> for LinfNormaliser<B> where
    B: Basis<T, Value = Features>,
    B::Value: Index<usize, Output = ActivationT>, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<T, B1, B2> EnumerableBasis<T> for Stack<B1, B2> where
    T: Clone,
    B1: EnumerableBasis<T, Value = Features>,
    B2: EnumerableBasis<T, Value = Features>, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

impl<T, K> EnumerableBasis<T> for KernelBasis<Vec<f64>, K> where
    T: Borrow<[f64]>,
    K: for<'x> Kernel<&'x [f64]>, 

fn ith(&self, input: T, index: IndexT) -> Result<ActivationT>

Loading content...