Struct NodeIdPositionBucket 

pub struct NodeIdPositionBucket { /* private fields */ }

A memory effecient node location store nodes with the same id are often very close together. This will bucket nodes based on id, and store several relative offsets (in a compressed form)

Trait Implementations

impl Debug for NodeIdPositionBucket

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

Formats the value using the given formatter.

impl GetSize for NodeIdPositionBucket

fn get_heap_size(&self) -> usize

Determines how many bytes this object occupies inside the heap.

fn get_stack_size() -> usize

Determines how may bytes this object occupies inside the stack.

fn get_size(&self) -> usize

Determines the total size of the object.

impl NodeIdPosition for NodeIdPositionBucket

fn new() -> Self

fn insert(&mut self, nid: i64, pos: (f64, f64))

Set this position

fn insert_i32(&mut self, nid: i64, pos: (i32, i32))

Set this position if already have explicit inner format

fn get(&self, nid: &i64) -> Result<(f64, f64)>

Return the location for this node id

fn get_many_unwrap(&self, nids: &[i64], output: &mut [(f64, f64)])

fn len(&self) -> usize

Number of nodes inside

fn detailed_size(&self) -> String

fn finished_inserting(&mut self)

fn insert_f64(&mut self, node_id: i64, pos: (f64, f64))

Set this position (f64 explict)

fn contains_key(&self, node_id: &i64) -> bool

fn get_arr(&self, node_id: &i64) -> Result<[f64; 2]>

fn get_ord( &self, node_id: &i64, ) -> Result<(OrderedFloat<f64>, OrderedFloat<f64>)>

fn get_many(&self, nids: &[i64], output: &mut [Result<(f64, f64)>])

fn is_empty(&self) -> bool

fn shrink_to_fit(&mut self)