Struct BinaryMatcher 

pub struct BinaryMatcher<'a, S: Stack<u32> = StaticStack<0x10, u32>, C: Stack<usize> = StaticStack<0x10, usize>> { /* private fields */ }

The BinaryMatcher is responsible for searching a BinaryPattern within a MatchTarget.

Use BinaryMatcher::next_match to iterate through matches of the specified pattern.

Implementations

impl<'a> BinaryMatcher<'a>

pub fn new(pattern: &'a dyn BinaryPattern, target: &'a dyn MatchTarget) -> Self

Create a new BinaryMatcher instance with a statically allocated stack. The default stack size is 0x10 for the save and cursor stack.

pub fn new_with_heap_stack( pattern: &'a dyn BinaryPattern, target: &'a dyn MatchTarget, ) -> BinaryMatcher<'a, HeapStack<u32>, HeapStack<usize>>

Create a new BinaryMatcher instance with a heap allocated save and cursor stack

impl<'a, S: Stack<u32>, C: Stack<usize>> BinaryMatcher<'a, S, C>

pub fn new_with_stack( pattern: &'a dyn BinaryPattern, target: &'a dyn MatchTarget, save_stack: S, cursor_stack: C, ) -> Self

Create a new binary matcher and supply the save and cursor stacks on your own

pub fn next_match(&mut self) -> Option<&[u32]>

Finds the next match for the associated BinaryPattern within the MatchTarget.

Returns

• Some(&[u32]) containing the saved stack. The first element of the saved stack represents the start of the matched location.
  Subsequent elements can be pushed using the Atom::SaveCursor atom or the ' command within the binary pattern.
• None if no further matches are available.

pub fn next_match_within<R: RangeBounds<usize>>( &mut self, range: R, ) -> Option<&[u32]>

Finds the next match for the associated BinaryPattern within the MatchTarget within the given range. The current match offset will be clamped into the given range.