Struct HashIndex 

pub struct HashIndex { /* private fields */ }

Hash Index structure

Maintains indexes for fast key lookups. Structure: table_name → (column_name → HashMap<value, Vec<row_id>>)

Implementations

impl HashIndex

pub fn new() -> Self

Create a new empty hash index

pub fn create_index(&self, table: &str, column: &str) -> DbxResult<()>

Create an index on a specific column

Arguments

• table - Table name
• column - Column name to index

Example

let index = HashIndex::new();
index.create_index("users", "id").unwrap();

pub fn drop_index(&self, table: &str, column: &str) -> DbxResult<()>

Drop an index

Arguments

• table - Table name
• column - Column name

pub fn lookup( &self, table: &str, column: &str, value: &[u8], ) -> DbxResult<Vec<usize>>

Lookup row IDs by indexed value

Arguments

• table - Table name
• column - Column name
• value - Value to lookup

Returns

Vector of row IDs that match the value

pub fn update_on_insert( &self, table: &str, column: &str, value: &[u8], row_id: usize, ) -> DbxResult<()>

Update index on insert

Arguments

• table - Table name
• column - Column name
• value - Value being inserted
• row_id - Row ID of the inserted row

pub fn update_on_delete( &self, table: &str, column: &str, value: &[u8], row_id: usize, ) -> DbxResult<()>

Update index on delete

Arguments

• table - Table name
• column - Column name
• value - Value being deleted
• row_id - Row ID of the deleted row

pub fn has_index(&self, table: &str, column: &str) -> bool

Check if an index exists

Trait Implementations

impl Default for HashIndex

fn default() -> Self

Returns the “default value” for a type.