Struct FFIWordFlags 

pub struct FFIWordFlags(/* private fields */);

Implementations

impl FFIWordFlags

pub const NONE: Self

pub const fn has_flags(self, flags: Self) -> bool

pub const fn add_flags(&mut self, flags: Self)

pub const fn remove_flags(&mut self, flags: Self)

pub const fn toggle_flags(&mut self, flags: Self)

pub const fn with_flags(self, flags: Self) -> Self

pub const fn without_flags(self, flags: Self) -> Self

pub const fn count_ones(self) -> u32

pub const fn pop_bottom_index(&mut self) -> Option<u32>

pub fn get_flags(self) -> Box<[(Self, &'static str)]>

impl FFIWordFlags

pub const ALL: Self

pub const ALL_FLAGS: &'static [Self]

pub const FLAG_NAMES: &'static [&'static str]

pub const HAS_DOLLAR: Self

Dollar sign present.

pub const QUOTED: Self

Some form of quoted character is present.

pub const ASSIGNMENT: Self

This word is a variable assignment.

pub const SPLIT_SPACE: Self

Split this word on “ “ regardless of IFS.

pub const NO_SPLIT: Self

Do not perform word splitting on this word because IFS is empty string.

pub const NO_GLOB: Self

Do not perform globbing on this word.

pub const NO_SPLIT2: Self

Don’t split word except for $@ expansion (using spaces) because context does not allow it.

pub const TILDE_EXP: Self

Tilde expand this assignment word.

pub const DOLLAR_AT: Self

$@ and its special handling. (Unused)

pub const ARRAY_REF: Self

Word is a valid array reference.

pub const NO_COMMAND_SUBSTITUTION: Self

Don’t perform command substitution on this word.

pub const ASSIGN_RHS: Self

Word is RHS of an assignment statement.

pub const NO_TILDE: Self

Don’t perform tilde expansion on this word.

pub const NO_ASSIGN_TILDE: Self

Don’t do tilde expansion like an assignment statement.

pub const EXPAND_RHS: Self

Expanding word in ${paramOPword}

pub const COMPOUND_ASSIGNMENT: Self

Compound assignment. (no idea what that means, better look it up.) // TODO

pub const ASSIGN_BUILTIN: Self

Word is a builtin command that takes assignments

pub const ASSIGN_ARG: Self

Word is assignment argument to command.

pub const HAS_QUOTED_NULL: Self

Word contains a quoted null character.

pub const DOUBLE_QUOTE: Self

Word should be treated as if double-quoted. (Unused)

pub const NO_PROCESS_SUBSTITUTION: Self

Don’t perform process substitution.

pub const SAW_QUOTED_NULL: Self

Word contained a quoted null that was removed.

pub const ASSIGN_ASSOC: Self

Word looks like associative array assignment.

pub const ASSIGN_ARRAY: Self

Word looks like a compound indexed array assignment.

pub const ARRAY_INDEX: Self

Word is an array index being expanded.

pub const ASSIGN_GLOBAL: Self

Word is a global assignment to declare

pub const NO_BRACE: Self

Don’t perform brace expansion

pub const COMPLETION: Self

Word is being expanded for completion.

pub const CHECK_LOCAL: Self

Check for local vars on assignment.

pub const FORCE_LOCAL: Self

Force assignment to be local variables, non-fatal on assignment errors.]

pub const fn get_has_dollar(self) -> bool

pub const fn add_has_dollar(&mut self)

pub const fn remove_has_dollar(&mut self)

pub const fn set_has_dollar(&mut self, on: bool)

pub const fn toggle_has_dollar(&mut self)

pub const fn with_has_dollar(self) -> Self

pub const fn without_has_dollar(self) -> Self

pub const fn get_quoted(self) -> bool

pub const fn add_quoted(&mut self)

pub const fn remove_quoted(&mut self)

pub const fn set_quoted(&mut self, on: bool)

pub const fn toggle_quoted(&mut self)

pub const fn with_quoted(self) -> Self

pub const fn without_quoted(self) -> Self

pub const fn get_assignment(self) -> bool

pub const fn add_assignment(&mut self)

pub const fn remove_assignment(&mut self)

pub const fn set_assignment(&mut self, on: bool)

pub const fn toggle_assignment(&mut self)

pub const fn with_assignment(self) -> Self

pub const fn without_assignment(self) -> Self

pub const fn get_split_space(self) -> bool

pub const fn add_split_space(&mut self)

pub const fn remove_split_space(&mut self)

pub const fn set_split_space(&mut self, on: bool)

pub const fn toggle_split_space(&mut self)

pub const fn with_split_space(self) -> Self

pub const fn without_split_space(self) -> Self

pub const fn get_no_split(self) -> bool

pub const fn add_no_split(&mut self)

pub const fn remove_no_split(&mut self)

pub const fn set_no_split(&mut self, on: bool)

pub const fn toggle_no_split(&mut self)

pub const fn with_no_split(self) -> Self

pub const fn without_no_split(self) -> Self

pub const fn get_no_glob(self) -> bool

pub const fn add_no_glob(&mut self)

pub const fn remove_no_glob(&mut self)

pub const fn set_no_glob(&mut self, on: bool)

pub const fn toggle_no_glob(&mut self)

pub const fn with_no_glob(self) -> Self

pub const fn without_no_glob(self) -> Self

pub const fn get_no_split2(self) -> bool

pub const fn add_no_split2(&mut self)

pub const fn remove_no_split2(&mut self)

pub const fn set_no_split2(&mut self, on: bool)

pub const fn toggle_no_split2(&mut self)

pub const fn with_no_split2(self) -> Self

pub const fn without_no_split2(self) -> Self

pub const fn get_tilde_exp(self) -> bool

pub const fn add_tilde_exp(&mut self)

pub const fn remove_tilde_exp(&mut self)

pub const fn set_tilde_exp(&mut self, on: bool)

pub const fn toggle_tilde_exp(&mut self)

pub const fn with_tilde_exp(self) -> Self

pub const fn without_tilde_exp(self) -> Self

pub const fn get_dollar_at(self) -> bool

pub const fn add_dollar_at(&mut self)

pub const fn remove_dollar_at(&mut self)

pub const fn set_dollar_at(&mut self, on: bool)

pub const fn toggle_dollar_at(&mut self)

pub const fn with_dollar_at(self) -> Self

pub const fn without_dollar_at(self) -> Self

pub const fn get_array_ref(self) -> bool

pub const fn add_array_ref(&mut self)

pub const fn remove_array_ref(&mut self)

pub const fn set_array_ref(&mut self, on: bool)

pub const fn toggle_array_ref(&mut self)

pub const fn with_array_ref(self) -> Self

pub const fn without_array_ref(self) -> Self

pub const fn get_no_command_substitution(self) -> bool

pub const fn add_no_command_substitution(&mut self)

pub const fn remove_no_command_substitution(&mut self)

pub const fn set_no_command_substitution(&mut self, on: bool)

pub const fn toggle_no_command_substitution(&mut self)

pub const fn with_no_command_substitution(self) -> Self

pub const fn without_no_command_substitution(self) -> Self

pub const fn get_assign_rhs(self) -> bool

pub const fn add_assign_rhs(&mut self)

pub const fn remove_assign_rhs(&mut self)

pub const fn set_assign_rhs(&mut self, on: bool)

pub const fn toggle_assign_rhs(&mut self)

pub const fn with_assign_rhs(self) -> Self

pub const fn without_assign_rhs(self) -> Self

pub const fn get_no_tilde(self) -> bool

pub const fn add_no_tilde(&mut self)

pub const fn remove_no_tilde(&mut self)

pub const fn set_no_tilde(&mut self, on: bool)

pub const fn toggle_no_tilde(&mut self)

pub const fn with_no_tilde(self) -> Self

pub const fn without_no_tilde(self) -> Self

pub const fn get_no_assign_tilde(self) -> bool

pub const fn add_no_assign_tilde(&mut self)

pub const fn remove_no_assign_tilde(&mut self)

pub const fn set_no_assign_tilde(&mut self, on: bool)

pub const fn toggle_no_assign_tilde(&mut self)

pub const fn with_no_assign_tilde(self) -> Self

pub const fn without_no_assign_tilde(self) -> Self

pub const fn get_expand_rhs(self) -> bool

pub const fn add_expand_rhs(&mut self)

pub const fn remove_expand_rhs(&mut self)

pub const fn set_expand_rhs(&mut self, on: bool)

pub const fn toggle_expand_rhs(&mut self)

pub const fn with_expand_rhs(self) -> Self

pub const fn without_expand_rhs(self) -> Self

pub const fn get_compound_assignment(self) -> bool

pub const fn add_compound_assignment(&mut self)

pub const fn remove_compound_assignment(&mut self)

pub const fn set_compound_assignment(&mut self, on: bool)

pub const fn toggle_compound_assignment(&mut self)

pub const fn with_compound_assignment(self) -> Self

pub const fn without_compound_assignment(self) -> Self

pub const fn get_assign_builtin(self) -> bool

pub const fn add_assign_builtin(&mut self)

pub const fn remove_assign_builtin(&mut self)

pub const fn set_assign_builtin(&mut self, on: bool)

pub const fn toggle_assign_builtin(&mut self)

pub const fn with_assign_builtin(self) -> Self

pub const fn without_assign_builtin(self) -> Self

pub const fn get_assign_arg(self) -> bool

pub const fn add_assign_arg(&mut self)

pub const fn remove_assign_arg(&mut self)

pub const fn set_assign_arg(&mut self, on: bool)

pub const fn toggle_assign_arg(&mut self)

pub const fn with_assign_arg(self) -> Self

pub const fn without_assign_arg(self) -> Self

pub const fn get_has_quoted_null(self) -> bool

pub const fn add_has_quoted_null(&mut self)

pub const fn remove_has_quoted_null(&mut self)

pub const fn set_has_quoted_null(&mut self, on: bool)

pub const fn toggle_has_quoted_null(&mut self)

pub const fn with_has_quoted_null(self) -> Self

pub const fn without_has_quoted_null(self) -> Self

pub const fn get_double_quote(self) -> bool

pub const fn add_double_quote(&mut self)

pub const fn remove_double_quote(&mut self)

pub const fn set_double_quote(&mut self, on: bool)

pub const fn toggle_double_quote(&mut self)

pub const fn with_double_quote(self) -> Self

pub const fn without_double_quote(self) -> Self

pub const fn get_no_process_substitution(self) -> bool

pub const fn add_no_process_substitution(&mut self)

pub const fn remove_no_process_substitution(&mut self)

pub const fn set_no_process_substitution(&mut self, on: bool)

pub const fn toggle_no_process_substitution(&mut self)

pub const fn with_no_process_substitution(self) -> Self

pub const fn without_no_process_substitution(self) -> Self

pub const fn get_saw_quoted_null(self) -> bool

pub const fn add_saw_quoted_null(&mut self)

pub const fn remove_saw_quoted_null(&mut self)

pub const fn set_saw_quoted_null(&mut self, on: bool)

pub const fn toggle_saw_quoted_null(&mut self)

pub const fn with_saw_quoted_null(self) -> Self

pub const fn without_saw_quoted_null(self) -> Self

pub const fn get_assign_assoc(self) -> bool

pub const fn add_assign_assoc(&mut self)

pub const fn remove_assign_assoc(&mut self)

pub const fn set_assign_assoc(&mut self, on: bool)

pub const fn toggle_assign_assoc(&mut self)

pub const fn with_assign_assoc(self) -> Self

pub const fn without_assign_assoc(self) -> Self

pub const fn get_assign_array(self) -> bool

pub const fn add_assign_array(&mut self)

pub const fn remove_assign_array(&mut self)

pub const fn set_assign_array(&mut self, on: bool)

pub const fn toggle_assign_array(&mut self)

pub const fn with_assign_array(self) -> Self

pub const fn without_assign_array(self) -> Self

pub const fn get_array_index(self) -> bool

pub const fn add_array_index(&mut self)

pub const fn remove_array_index(&mut self)

pub const fn set_array_index(&mut self, on: bool)

pub const fn toggle_array_index(&mut self)

pub const fn with_array_index(self) -> Self

pub const fn without_array_index(self) -> Self

pub const fn get_assign_global(self) -> bool

pub const fn add_assign_global(&mut self)

pub const fn remove_assign_global(&mut self)

pub const fn set_assign_global(&mut self, on: bool)

pub const fn toggle_assign_global(&mut self)

pub const fn with_assign_global(self) -> Self

pub const fn without_assign_global(self) -> Self

pub const fn get_no_brace(self) -> bool

pub const fn add_no_brace(&mut self)

pub const fn remove_no_brace(&mut self)

pub const fn set_no_brace(&mut self, on: bool)

pub const fn toggle_no_brace(&mut self)

pub const fn with_no_brace(self) -> Self

pub const fn without_no_brace(self) -> Self

pub const fn get_completion(self) -> bool

pub const fn add_completion(&mut self)

pub const fn remove_completion(&mut self)

pub const fn set_completion(&mut self, on: bool)

pub const fn toggle_completion(&mut self)

pub const fn with_completion(self) -> Self

pub const fn without_completion(self) -> Self

pub const fn get_check_local(self) -> bool

pub const fn add_check_local(&mut self)

pub const fn remove_check_local(&mut self)

pub const fn set_check_local(&mut self, on: bool)

pub const fn toggle_check_local(&mut self)

pub const fn with_check_local(self) -> Self

pub const fn without_check_local(self) -> Self

pub const fn get_force_local(self) -> bool

pub const fn add_force_local(&mut self)

pub const fn remove_force_local(&mut self)

pub const fn set_force_local(&mut self, on: bool)

pub const fn toggle_force_local(&mut self)

pub const fn with_force_local(self) -> Self

pub const fn without_force_local(self) -> Self

Trait Implementations

impl Clone for FFIWordFlags

fn clone(&self) -> FFIWordFlags

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for FFIWordFlags

impl Eq for FFIWordFlags

impl Hash for FFIWordFlags

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 Iterator for FFIWordFlags

type Item = (FFIWordFlags, &'static str)

The type of the elements being iterated over.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

fn next_chunk<const N: usize>( &mut self, ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values.

fn count(self) -> usize

where Self: Sized,

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

where Self: Sized,

Consumes the iterator, returning the last element.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse(self, separator: Self::Item) -> Intersperse<Self>

where Self: Sized, Self::Item: Clone,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places a copy of separator between items of the original iterator.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places an item generated by separator between items of the original iterator.

fn map<B, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F)

where Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

fn skip(self, n: usize) -> Skip<Self>

where Self: Sized,

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure.

fn flatten(self) -> Flatten<Self>

where Self: Sized, Self::Item: IntoIterator,

Creates an iterator that flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Creates a “by reference” adapter for this instance of Iterator.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn try_collect<B>( &mut self, ) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType

where Self: Sized, Self::Item: Try, <Self::Item as Try>::Residual: Residual<B>, B: FromIterator<<Self::Item as Try>::Output>,

🔬This is a nightly-only experimental API. (iterator_try_collect)

Fallibly transforms an iterator into a collection, short circuiting if a failure is encountered.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R

where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn fold<B, F>(self, init: B, f: F) -> B

where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index.

fn max(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: Copy + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: Clone + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn cycle(self) -> Cycle<Self>

where Self: Sized + Clone,

Repeats an iterator endlessly.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements.

fn cmp<I>(self, other: I) -> Ordering

where I: IntoIterator<Item = Self::Item>, Self::Item: Ord, Self: Sized,

Lexicographically compares the elements of this Iterator with those of another.

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering>

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another.

fn eq_by<I, F>(self, other: I, eq: F) -> bool

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another.

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted(self) -> bool

where Self: Sized, Self::Item: PartialOrd,

Checks if the elements of this iterator are sorted.

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

Checks if the elements of this iterator are sorted using the given key extraction function.

impl PartialEq for FFIWordFlags

fn eq(&self, other: &FFIWordFlags) -> 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 StructuralPartialEq for FFIWordFlags