Struct trk_io::ArraySequence [−][src]
Fields
offsets: Vec<usize>
data: Vec<T>
Implementations
Returns true
if the array contains no elements.
The array will be considered non empty if there was one or more
push()
, even without an end_push()
. Use len()
instead to ignore
all pushed elements.
Same as obj[i].len(), without building a slice
Trait Implementations
Extends a collection with the contents of an iterator. Read more
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
Auto Trait Implementations
impl<T> RefUnwindSafe for ArraySequence<T> where
T: RefUnwindSafe,
impl<T> Send for ArraySequence<T> where
T: Send,
impl<T> Sync for ArraySequence<T> where
T: Sync,
impl<T> Unpin for ArraySequence<T> where
T: Unpin,
impl<T> UnwindSafe for ArraySequence<T> where
T: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.