Struct FilterTree

pub struct FilterTree { /* private fields */ }

A tree-structure that can efficiently determine whether an instruction is covered by a large set of filters.

Implementations

impl FilterTree

pub fn new() -> FilterTree

Creates an empty FilterTree.

pub fn len(&self) -> usize

Returns the number of tree nodes in use.

pub fn is_empty(&self) -> bool

Returns true if the tree has no nodes.

pub fn count_nodes(&self) -> usize

Returns the number of nodes in use in the tree. Counts all nodes recursively.

pub fn filter(&mut self, filter: &InstructionFilter)

Inserts the filter into the tree

pub fn prune(&mut self, instruction: &Instruction)

Prunes the tree, removing matches before or furthest away from instruction. This operation reduces the memory used for the tree.

pub fn filter_below(&mut self, below: &Instruction)

Filters all instruction below below.

pub fn filter_above(&mut self, start: &Instruction)

Filters all instruction above start.

pub fn find_next(&self, instr: &Instruction) -> Option<Instruction>

Returns the (lexicographically) next instruction not matched by any filter.

pub fn covers(&self, filter: &InstructionFilter) -> bool

Returns true if the tree fully covers all instructions matched by the filter.

Trait Implementations

impl Debug for FilterTree

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

Formats the value using the given formatter.

impl Default for FilterTree

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for FilterTree

fn eq(&self, other: &Self) -> 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.