Struct CompressedIndex 

pub struct CompressedIndex { /* private fields */ }

Compressed index using multiple encoding strategies

Implementations

impl CompressedIndex

pub fn new() -> Self

pub fn add_to_label_index(&self, label: &str, node_id: u64)

Add node to label index

pub fn get_nodes_by_label(&self, label: &str) -> Vec<u64>

Get all nodes with a specific label

pub fn has_label(&self, label: &str, node_id: u64) -> bool

Check if node has label (fast bitmap lookup)

pub fn count_label(&self, label: &str) -> u64

Count nodes with label

pub fn intersect_labels(&self, labels: &[&str]) -> Vec<u64>

Intersect multiple labels (efficient bitmap AND)

pub fn union_labels(&self, labels: &[&str]) -> Vec<u64>

Union multiple labels (efficient bitmap OR)

pub fn encode_string(&self, s: &str) -> u32

Encode string using dictionary

pub fn decode_string(&self, id: u32) -> Option<String>

Decode string from dictionary

Trait Implementations

impl Default for CompressedIndex

fn default() -> Self

Returns the “default value” for a type.