Struct ArraySpace

pub struct ArraySpace<S, const N: usize> { /* private fields */ }

A Cartesian product of N spaces of the same type (but not necessarily the same space).

An ArraySpace is more general than a PowerSpace because the inner spaces do not all have to be the same, but less general than a tuple space because the inner spaces must have the same type.

Implementations

impl<S, const N: usize> ArraySpace<S, N>

pub const fn new(inner_spaces: [S; N]) -> Self

Trait Implementations

impl<S: Clone, const N: usize> Clone for ArraySpace<S, N>

fn clone(&self) -> ArraySpace<S, N>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S: Debug, const N: usize> Debug for ArraySpace<S, N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de, S, const N: usize> Deserialize<'de> for ArraySpace<S, N>

where S: Serialize + Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<S, const N: usize> Distribution<<ArraySpace<S, N> as Space>::Element> for ArraySpace<S, N>

where S: Space + Distribution<S::Element>,

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> <Self as Space>::Element

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F

impl<S: FeatureSpace, const N: usize> FeatureSpace for ArraySpace<S, N>

Features are the concatenation of inner feature vectors

fn num_features(&self) -> usize

Length of the encoded feature vectors.

fn features_out<'a, F: Float>( &self, element: &Self::Element, out: &'a mut [F], zeroed: bool, ) -> &'a mut [F]

Encode the feature vector of an element into a mutable slice.

fn features<T>(&self, element: &Self::Element) -> T

where T: BuildFromArray1D, <T::Array as NumArray1D>::Elem: Float,

Encode the feature vector of an element into an array.

fn batch_features_out<'a, I, A>( &self, elements: I, out: &mut ArrayBase<A, Ix2>, zeroed: bool, )

where I: IntoIterator<Item = &'a Self::Element>, Self::Element: 'a, A: DataMut, A::Elem: Float,

Encode the feature vectors of multiple elements into rows of a two-dimensional array.

fn batch_features<'a, I, T>(&self, elements: I) -> T

where I: IntoIterator<Item = &'a Self::Element>, I::IntoIter: ExactSizeIterator, Self::Element: 'a, T: BuildFromArray2D, <T::Array as NumArray2D>::Elem: Float,

Encode the feature vectors of multiple elements as rows of a two-dimensional array.

impl<S: FiniteSpace, const N: usize> FiniteSpace for ArraySpace<S, N>

fn size(&self) -> usize

The number of elements in the space.

fn to_index(&self, element: &Self::Element) -> usize

Get the (unique) index of an element.

fn from_index(&self, index: usize) -> Option<Self::Element>

Try to convert an index to an element.

fn from_index_unchecked(&self, index: usize) -> Option<Self::Element>

Try to convert an index to an element.

impl<S: Hash, const N: usize> Hash for ArraySpace<S, N>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<S: Space, const N: usize> LogElementSpace for ArraySpace<S, N>

fn log_element<L: StatsLogger + ?Sized>( &self, _name: &'static str, _element: &Self::Element, _logger: &mut L, ) -> Result<(), LogError>

Log an element of the space

impl<S: NonEmptySpace, const N: usize> NonEmptySpace for ArraySpace<S, N>

fn some_element(&self) -> <Self as Space>::Element

An arbitrary deterministic element from the space.

impl<S: PartialEq, const N: usize> PartialEq for ArraySpace<S, N>

fn eq(&self, other: &ArraySpace<S, N>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<S, const N: usize> Serialize for ArraySpace<S, N>

where for<'a> S: Serialize + Deserialize<'a>,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<S: Space, const N: usize> Space for ArraySpace<S, N>

type Element = [<S as Space>::Element; N]

fn contains(&self, value: &Self::Element) -> bool

Check whether a particular value is contained in the space.

impl<S: Space + SubsetOrd, const N: usize> SubsetOrd for ArraySpace<S, N>

fn subset_cmp(&self, other: &Self) -> Option<Ordering>

Compare using the subset relationship. This is a partial order.

fn strict_subset_of(&self, other: &Self) -> bool

Check if this is a strict subset of other.

fn subset_of(&self, other: &Self) -> bool

Check if this is a subset (strict or equal) of other.

fn strict_superset_of(&self, other: &Self) -> bool

Check if this is a strict superset of other.

fn superset_of(&self, other: &Self) -> bool

Check if this is a superset (strict or equal) of other.

impl<S: Copy, const N: usize> Copy for ArraySpace<S, N>

impl<S: Eq, const N: usize> Eq for ArraySpace<S, N>

impl<S, const N: usize> StructuralPartialEq for ArraySpace<S, N>