pub struct Shape {
pub nodes: usize,
pub widest: usize,
pub search: usize,
pub mixed: usize,
}Expand description
What a rule set costs to match against, which is what the header of a generated table says and what a test that the tree is a tree asserts.
Fields§
§nodes: usizeHow many nodes the trie has.
widest: usizeHow many branches the widest node has, which is what a scan over it would cost.
search: usizeHow many comparisons a binary search over that many branches takes.
mixed: usizeHow many nodes ask more than one kind of question, and so depend on the order the kinds are tried in. Nothing shipped here does.
Trait Implementations§
impl Copy for Shape
impl Eq for Shape
impl StructuralPartialEq for Shape
Auto Trait Implementations§
impl Freeze for Shape
impl RefUnwindSafe for Shape
impl Send for Shape
impl Sync for Shape
impl Unpin for Shape
impl UnsafeUnpin for Shape
impl UnwindSafe for Shape
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more