pub struct UnboundedCard<D: Dim> { /* private fields */ }
Expand description
Unbounded cardinality.
Practically this means that the cardinality of any child dimension of the vector
is equal to usize::MAX
.
Whenever the vector is unbounded, it is capable of producing the corresponding element for any possible index.
The following vectors are naturally unbounded on construction:
- functional vectors which can be created by
fun
, - sparse vectors that can be created by
sparse
orsparse_from
, - constant vectors that can be created by
constant
.
The methods all
and enumerate_all
panic for vectors with unbounded cardinality,
as it would lead to an infinite loop (practically).
In order to iterate over flattened scalar elements of an unbounded vector, one can use
the all_in
iterator instead, where the indices to iterate over are provided as an
input.
Alternatively, the unbounded domain of the vector can be transformed into a bounded one by using:
bounded
method if the vector is of dimensionD1
,with_rectangular_bounds
orwith_variable_bounds
methods otherwise.
Trait Implementations§
Source§impl<D: Dim> Card<D> for UnboundedCard<D>
impl<D: Dim> Card<D> for UnboundedCard<D>
Source§fn is_rectangular(&self) -> bool
fn is_rectangular(&self) -> bool
Returns true if the cardinality is bounded and rectangular; i.e, Read more
Source§fn cardinality_of(&self, _: impl Into<<D as Dim>::CardIdx>) -> usize
fn cardinality_of(&self, _: impl Into<<D as Dim>::CardIdx>) -> usize
Returns the cardinality of the child of the vector at the given
idx
.Source§fn child_card(&self, _: <D as Dim>::ChildIdx) -> impl Card<<D as Dim>::PrevDim>
fn child_card(&self, _: <D as Dim>::ChildIdx) -> impl Card<<D as Dim>::PrevDim>
Returns the cardinality of the child of this vector at the given
left_most_idx
.Source§fn child_fun<T, F>(
&self,
i: <D as Dim>::ChildIdx,
fun: F,
) -> impl Fn(<<D as Dim>::PrevDim as Dim>::Idx) -> T
fn child_fun<T, F>( &self, i: <D as Dim>::ChildIdx, fun: F, ) -> impl Fn(<<D as Dim>::PrevDim as Dim>::Idx) -> T
Creates a function, say
new_fun
, which applies the first of the indices to
left_most_index
such that: Read moreSource§impl<D: Clone + Dim> Clone for UnboundedCard<D>
impl<D: Clone + Dim> Clone for UnboundedCard<D>
Source§fn clone(&self) -> UnboundedCard<D>
fn clone(&self) -> UnboundedCard<D>
Returns a copy of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl<D: Dim> Default for UnboundedCard<D>
impl<D: Dim> Default for UnboundedCard<D>
impl<D: Copy + Dim> Copy for UnboundedCard<D>
Auto Trait Implementations§
impl<D> Freeze for UnboundedCard<D>
impl<D> RefUnwindSafe for UnboundedCard<D>where
D: RefUnwindSafe,
impl<D> Send for UnboundedCard<D>where
D: Send,
impl<D> Sync for UnboundedCard<D>where
D: Sync,
impl<D> Unpin for UnboundedCard<D>where
D: Unpin,
impl<D> UnwindSafe for UnboundedCard<D>where
D: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more