pub struct DeterministicGraphWork {
pub effective_ef: usize,
pub hops: usize,
pub candidates_scored: usize,
pub candidates_rescored: usize,
pub pushes: usize,
pub visited: usize,
}Expand description
Scheduling-independent counters suitable for deterministic comparisons.
Fields§
§effective_ef: usizeAdaptive or explicit traversal width used for this query.
hops: usizeExpanded frontier nodes.
candidates_scored: usizeDistinct Bit4 candidates scored.
candidates_rescored: usizeRows from the retained pool read from f32 storage.
pushes: usizeSuccessful frontier insertions.
visited: usizeDistinct visited nodes.
Trait Implementations§
Source§impl Clone for DeterministicGraphWork
impl Clone for DeterministicGraphWork
impl Copy for DeterministicGraphWork
Source§impl Debug for DeterministicGraphWork
impl Debug for DeterministicGraphWork
impl Eq for DeterministicGraphWork
Source§impl PartialEq for DeterministicGraphWork
impl PartialEq for DeterministicGraphWork
impl StructuralPartialEq for DeterministicGraphWork
Auto Trait Implementations§
impl Freeze for DeterministicGraphWork
impl RefUnwindSafe for DeterministicGraphWork
impl Send for DeterministicGraphWork
impl Sync for DeterministicGraphWork
impl Unpin for DeterministicGraphWork
impl UnsafeUnpin for DeterministicGraphWork
impl UnwindSafe for DeterministicGraphWork
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