lim_bit_vec

Struct ByteList

Source 
pub struct ByteList(/* private fields */);

Trait Implementations§

Source§

impl Default for ByteList

Source§

fn default() -> ByteList

Returns the “default value” for a type. Read more
Source§

impl FlatScanFn for ByteList

Source§

type InputItem = BitVec<u16>

Source§

type InputResult = ()

Source§

type OutputList = ByteList

Source§

type EndList = Empty<u8, Id<BitVec<u32>>>

Source§

fn map_item(self, item: BitVec16) -> Self::OutputList

Map the given input item into a list.
Source§

fn map_result(self, _: ()) -> Self::EndList

Map the given result into an end list.
Source§

impl ListFn for ByteList

Source§

type Item = u8

A list item type.
Source§

type End = ByteList

A value which is returned when the list has no more items.
Source§

fn next(self) -> ListState<Self>

The main function which returns a list.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<L> Filter for L
where L: ListFn,

Source§

fn filter<F>(self, f: F) -> FlatMapList<Self, FilterWrap<F>>
where F: FilterFn<Input = Self::Item>,

Source§

impl<S> FlatMap for S
where S: ListFn,

Source§

fn flat_map<F>(self, flat_map: F) -> FlatMapList<Self, F>
where F: FlatMapFn<Input = Self::Item>,

Source§

impl<S> FlatScan for S
where S: ListFn,

Source§

fn flat_scan<F>(self, flat_scan: F) -> FlatScanState<Self, F>
where F: FlatScanFn<InputItem = Self::Item>, Self::End: ResultFn<Result = <F as FlatScanFn>::InputResult>,

Source§

impl<S> Fold for S
where S: ListFn,

Source§

fn fold(self) -> Self::End

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<S> Iter for S
where S: ListFn<End = S>,

Source§

fn iter(self) -> ListIterator<Self>

Converts a list to an iterator.
Source§

impl<L> IterWrap for L
where L: ListFn,

Source§

fn iter_wrap(self) -> ListIteratorWrap<Self>

Source§

impl<L> Map for L
where L: ListFn,

Source§

fn map<M>(self, m: M) -> FlatMapList<Self, MapWrap<M>>
where M: MapFn<Input = Self::Item>,

Source§

impl<L> Take for L
where L: ListFn,

Source§

fn take(self, count: usize) -> TakeList<Self>

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.