Enum Wrap 

pub enum Wrap<T32, T64> {
    T32(T32),
    T64(T64),
}

Wraps 32-bit and 64-bit variants.

Variants

T32(T32)

T64(T64)

Implementations

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Pe32, Pe64>

pub fn image(&self) -> &'a [u8]

pub fn align(&self) -> Align

pub fn as_ref(&self) -> Wrap<&Pe32, &Pe64>

pub fn dos_header(&self) -> &'a IMAGE_DOS_HEADER

pub fn dos_image(&self) -> &'a [u8]

pub fn nt_headers(&self) -> Wrap<&'a IMAGE_NT_HEADERS32, &'a IMAGE_NT_HEADERS64>

pub fn file_header(&self) -> &'a IMAGE_FILE_HEADER

pub fn optional_header( &self, ) -> Wrap<&'a IMAGE_OPTIONAL_HEADER32, &'a IMAGE_OPTIONAL_HEADER64>

pub fn data_directory(&self) -> &'a [IMAGE_DATA_DIRECTORY]

pub fn section_headers(&self) -> &'a SectionHeaders

pub fn slice(&self, rva: u32, min_size: usize, align: usize) -> Result<&'a [u8]>

pub fn slice_bytes(&self, rva: u32) -> Result<&'a [u8]>

pub fn get_section_bytes( &self, section_header: &IMAGE_SECTION_HEADER, ) -> Result<&'a [u8]>

pub fn derva<T>(&self, rva: u32) -> Result<&'a T>

where T: Pod,

pub fn derva_copy<T>(&self, rva: u32) -> Result<T>

where T: Copy + Pod,

pub fn derva_into<T>(&self, rva: u32, dest: &mut T) -> Result<()>

where T: ?Sized + Pod,

pub fn derva_slice<T>(&self, rva: u32, len: usize) -> Result<&'a [T]>

where T: Pod,

pub fn derva_slice_f<T, F>(&self, rva: u32, f: F) -> Result<&'a [T]>

where T: Pod, F: FnMut(&'a T) -> bool,

pub fn derva_slice_s<T>(&self, rva: u32, sentinel: T) -> Result<&'a [T]>

where T: PartialEq + Pod,

pub fn derva_c_str(&self, rva: u32) -> Result<&'a CStr>

pub fn derva_string<T>(&self, rva: u32) -> Result<&'a T>

where T: FromBytes + ?Sized,

pub fn headers(&self) -> Wrap<Headers<Pe32>, Headers<Pe64>>

pub fn rich_structure(&self) -> Result<RichStructure<'a>>

pub fn exports(&self) -> Result<Wrap<Exports<'a, Pe32>, Exports<'a, Pe64>>>

pub fn imports(&self) -> Result<Wrap<Imports<'a, Pe32>, Imports<'a, Pe64>>>

pub fn iat(&self) -> Result<Wrap<IAT<'a, Pe32>, IAT<'a, Pe64>>>

pub fn base_relocs(&self) -> Result<BaseRelocs<'a>>

pub fn load_config( &self, ) -> Result<Wrap<LoadConfig<'a, Pe32>, LoadConfig<'a, Pe64>>>

pub fn tls(&self) -> Result<Wrap<Tls<'a, Pe32>, Tls<'a, Pe64>>>

pub fn security(&self) -> Result<Security<'a>>

pub fn exception( &self, ) -> Result<Wrap<Exception<'a, Pe32>, Exception<'a, Pe64>>>

pub fn debug(&self) -> Result<Wrap<Debug<'a, Pe32>, Debug<'a, Pe64>>>

pub fn resources(&self) -> Result<Resources<'a>>

pub fn scanner(&self) -> Wrap<Scanner<Pe32>, Scanner<Pe64>>

impl<'a> Wrap<PeView<'a>, PeView<'a>>

pub fn from_bytes<T: AsRef<[u8]> + ?Sized>(image: &'a T) -> Result<PeView<'a>>

impl<'a> Wrap<PeFile<'a>, PeFile<'a>>

pub fn from_bytes<T: AsRef<[u8]> + ?Sized>(image: &'a T) -> Result<PeFile<'a>>

Constructs a PeFile from byte slice.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Headers<Pe32>, Headers<Pe64>>

Describes the PE headers.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image(&self) -> &'a [u8]

Gets the PE headers as a byte slice.

pub fn check_sum(&self) -> u32

Calculates the optional header’s CheckSum.

pub fn code_range(&self) -> Range<u32>

Gets the code range from the optional header.

pub fn image_range(&self) -> Range<u32>

Gets the full image range excluding the PE headers.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Exports<'a, Pe32>, Exports<'a, Pe64>>

Export directory.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image(&self) -> &'a IMAGE_EXPORT_DIRECTORY

Returns the underlying export directory image.

pub fn dll_name(&self) -> Result<&'a CStr>

Gets the export directory’s name for this library.

pub fn ordinal_base(&self) -> u16

Gets the ordinal base for the exported functions.

pub fn functions(&self) -> Result<&'a [u32]>

Gets the export address table.

pub fn names(&self) -> Result<&'a [u32]>

Gets the name address table.

pub fn name_indices(&self) -> Result<&'a [u16]>

Gets the name index table.

pub fn by(&self) -> Result<Wrap<By<'a, Pe32>, By<'a, Pe64>>>

Query the exports.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<By<'a, Pe32>, By<'a, Pe64>>

Export directory symbol lookup.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image(&self) -> &'a IMAGE_EXPORT_DIRECTORY

Returns the underlying export directory image.

pub fn dll_name(&self) -> Result<&'a CStr>

Gets the export directory’s name for this library.

pub fn ordinal_base(&self) -> u16

Gets the ordinal base for the exported functions.

pub fn functions(&self) -> &'a [u32]

Gets the export address table.

pub fn names(&self) -> &'a [u32]

Gets the name address table.

pub fn name_indices(&self) -> &'a [u16]

Gets the name index table.

pub fn check_sorted(&self) -> Result<bool>

Validates and checks if the name table is sorted.

pub fn ordinal(&self, ordinal: u16) -> Result<Export<'a>>

Looks up an Export by its ordinal.

pub fn name_linear<S: AsRef<[u8]> + ?Sized>( &self, name: &S, ) -> Result<Export<'a>>

Looks up an Export by its name.

pub fn name<S: AsRef<[u8]> + ?Sized>(&self, name: &S) -> Result<Export<'a>>

Looks up an Export by its name.

pub fn import(&self, import: Import<'_>) -> Result<Export<'a>>

Looks up an Export by its import.

pub fn index(&self, index: usize) -> Result<Export<'a>>

Looks up an export by its index.

pub fn hint(&self, hint: usize) -> Result<Export<'a>>

Looks up an export by its hint.

pub fn hint_name<S: AsRef<[u8]> + ?Sized>( &self, hint: usize, name: &S, ) -> Result<Export<'a>>

Looks up an export by its hint and falls back to the name if the hint is incorrect.

pub fn name_of_hint(&self, hint: usize) -> Result<&'a CStr>

Looks up the name for a hint.

pub fn name_lookup(&self, index: usize) -> Result<Import<'a>>

Given an index in the functions array, gets the named export.

pub fn iter<'s>( &'s self, ) -> impl 's + Clone + Iterator<Item = Result<Export<'a>>>

Iterate over exported functions.

pub fn iter_names<'s>( &'s self, ) -> impl 's + Clone + Iterator<Item = (Result<&'a CStr>, Result<Export<'a>>)>

Iterate over functions exported by name.

pub fn iter_name_indices<'s>( &'s self, ) -> impl 's + Clone + Iterator<Item = (Result<&'a CStr>, usize)>

Iterate over functions exported by name, returning their name and index in the functions table.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Pe32, Pe64>

Convenient way to get an exported address.

pub fn get_export_by_ordinal(&self, ordinal: u16) -> Result<Export<'a>>

Convenient method to get an exported function by ordinal.

pub fn get_export_by_import(&self, import: Import<'a>) -> Result<Export<'a>>

Convenient method to get an exported function by import.

pub fn get_export_by_name<S: ?Sized + AsRef<[u8]>>( &self, name: &S, ) -> Result<Export<'a>>

Convenient method to get an exported function by name.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Imports<'a, Pe32>, Imports<'a, Pe64>>

Import directory.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image(&self) -> &'a [IMAGE_IMPORT_DESCRIPTOR]

Returns the underlying import directory image array.

pub fn iter(&self) -> Wrap<Iter<'a, Pe32>, Iter<'a, Pe64>>

Iterator over the import descriptors.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<IAT<'a, Pe32>, IAT<'a, Pe64>>

Import Address Table.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image(&self) -> Wrap<&'a [u32], &'a [u64]>

Returns the underlying iat array.

pub fn iter( &self, ) -> Wrap<impl Clone + Iterator<Item = (&'a u32, Result<Import<'a>>)>, impl Clone + Iterator<Item = (&'a u64, Result<Import<'a>>)>>

Iterate over the IAT.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Desc<'a, Pe32>, Desc<'a, Pe64>>

Import library descriptor.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image(&self) -> &'a IMAGE_IMPORT_DESCRIPTOR

Returns the underlying import descriptor image.

pub fn dll_name(&self) -> Result<&'a CStr>

Gets the name of the DLL imported from.

pub fn iat(&self) -> Result<Wrap<Iter<'a, u32>, Iter<'a, u64>>>

Gets the import address table.

pub fn int(&self) -> Result<impl Clone + Iterator<Item = Result<Import<'a>>>>

Gets the import name table.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<LoadConfig<'a, Pe32>, LoadConfig<'a, Pe64>>

Load Config Directory.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image( &self, ) -> Wrap<&'a IMAGE_LOAD_CONFIG_DIRECTORY32, &'a IMAGE_LOAD_CONFIG_DIRECTORY64>

Returns the underlying load config directory image.

pub fn security_cookie(&self) -> Result<&'a u32>

Gets the default security cookie for the image.

pub fn se_handler_table(&self) -> Result<Wrap<&'a [u32], &'a [u64]>>

Gets the structured exception handler table.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Tls<'a, Pe32>, Tls<'a, Pe64>>

TLS Directory.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image( &self, ) -> Wrap<&'a IMAGE_TLS_DIRECTORY32, &'a IMAGE_TLS_DIRECTORY64>

Returns the underlying TLS directory image.

pub fn raw_data(&self) -> Result<&'a [u8]>

Gets the raw TLS initialization data.

pub fn slot(&self) -> Result<&'a u32>

Gets the TLS slot location.

pub fn callbacks(&self) -> Result<Wrap<&'a [u32], &'a [u64]>>

Gets the TLS initialization callbacks.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Debug<'a, Pe32>, Debug<'a, Pe64>>

Debug directory.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image(&self) -> &'a [IMAGE_DEBUG_DIRECTORY]

Returns the underlying debug directories image.

pub fn pdb_file_name(&self) -> Option<&'a CStr>

Gets the CodeView PDB file name.

pub fn iter(&self) -> Wrap<Iter<'a, Pe32>, Iter<'a, Pe64>>

Iterator over the debug directories.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Dir<'a, Pe32>, Dir<'a, Pe64>>

Debug directory entry.

pub fn pe(&self) -> Wrap<Pe32, Pe64>

Gets the PE instance.

pub fn image(&self) -> &'a IMAGE_DEBUG_DIRECTORY

Gets the underlying debug directory image.

pub fn data(&self) -> Option<&'a [u8]>

Gets the raw data of this debug directory entry.

pub fn entry(&self) -> Result<Entry<'a>>

Interprets the directory entry.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Scanner<Pe32>, Scanner<Pe64>>

Pattern scanner.

pub fn finds(&self, pat: &[Atom], range: Range<u32>, save: &mut [u32]) -> bool

Finds the unique match for the pattern in the given range.

pub fn finds_code(&self, pat: &[Atom], save: &mut [u32]) -> bool

Finds the unique code match for the pattern.

pub fn matches<'pat>( &self, pat: &'pat [Atom], range: Range<u32>, ) -> Wrap<Matches<'pat, Pe32>, Matches<'pat, Pe64>>

Returns an iterator over the matches of a pattern within the given range.

pub fn matches_code<'pat>( &self, pat: &'pat [Atom], ) -> Wrap<Matches<'pat, Pe32>, Matches<'pat, Pe64>>

Returns an iterator over the code matches of a pattern.

pub fn exec(&self, cursor: u32, pat: &[Atom], save: &mut [u32]) -> bool

Pattern interpreter, returns if the pattern matches the binary image at the given rva.

impl<'a, 'pat, Pe32: Pe<'a>, Pe64: Pe<'a>> Wrap<Matches<'pat, Pe32>, Matches<'pat, Pe64>>

pub fn scanner(&self) -> Wrap<Scanner<Pe32>, Scanner<Pe64>>

Gets the scanner instance.

pub fn pattern(&self) -> &'pat [Atom]

Gets the pattern.

pub fn range(&self) -> Range<u32>

Gets the remaining range to scan.

pub fn hits(&self) -> u32

Performance counter.

pub fn next(&mut self, save: &mut [u32]) -> bool

Finds the next match with the given save array.

impl<T32, T64> Wrap<Result<T32>, Result<T64>>

pub fn transpose(self) -> Result<Wrap<T32, T64>>

Transposes a wrap of results in a result of a wrap.

impl<T32, T64> Wrap<Option<T32>, Option<T64>>

pub fn transpose(self) -> Option<Wrap<T32, T64>>

Transposes a wrap of options in an option of a wrap.

impl<T> Wrap<T, T>

pub fn into(self) -> T

Unwraps the wrapped value of equal types.

Trait Implementations

impl<T32: Clone, T64: Clone> Clone for Wrap<T32, T64>

fn clone(&self) -> Wrap<T32, T64>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T32: Debug, T64: Debug> Debug for Wrap<T32, T64>

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

Formats the value using the given formatter.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> IntoIterator for Wrap<Debug<'a, Pe32>, Debug<'a, Pe64>>

type Item = Wrap<Dir<'a, Pe32>, Dir<'a, Pe64>>

The type of the elements being iterated over.

type IntoIter = Wrap<Iter<'a, Pe32>, Iter<'a, Pe64>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, Pe32: Pe<'a>, Pe64: Pe<'a>> IntoIterator for Wrap<Imports<'a, Pe32>, Imports<'a, Pe64>>

type Item = Wrap<Desc<'a, Pe32>, Desc<'a, Pe64>>

The type of the elements being iterated over.

type IntoIter = Wrap<Iter<'a, Pe32>, Iter<'a, Pe64>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<Iter32: Iterator, Iter64: Iterator> Iterator for Wrap<Iter32, Iter64>

type Item = Wrap<<Iter32 as Iterator>::Item, <Iter64 as Iterator>::Item>

The type of the elements being iterated over.

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 size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

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 adjacent 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 adjacent 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 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_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_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_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<T32: PartialEq, T64: PartialEq> PartialEq for Wrap<T32, T64>

fn eq(&self, other: &Wrap<T32, T64>) -> 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<T32: Copy, T64: Copy> Copy for Wrap<T32, T64>

impl<T32: Eq, T64: Eq> Eq for Wrap<T32, T64>

impl<T32, T64> StructuralPartialEq for Wrap<T32, T64>