Struct elipdotter::index::DocumentMap

pub struct DocumentMap { /* private fields */ }

Map of documents and their Ids to quickly get name from id and vice versa.

Implementations

impl DocumentMap

pub fn new() -> Self

pub fn reserve_id(&mut self, name: impl Into<String> + AsRef<str>) -> Id

pub fn insert<'a>( &mut self, name: impl Into<String> + AsRef<str>, content: &str, provider: &mut impl Provider<'a> )

Alternatively, Self::reserve_id and then drop the lock, go to a different thread, and make a new Simple. Simple::digest_document, then Simple::ingest the second index into the first.

pub fn contains(&self, name: &str) -> bool

O(1)

pub fn get_id(&self, name: &str) -> Option<Id>

O(1)

pub fn get_name(&self, id: Id) -> Option<&str>

O(log n)

But since this is a BTree, this is often faster than O(1) in a hash map, if we assume you have < 10_000 documents.

pub fn force_remove<'a>( &mut self, document: Id, provider: &mut impl Provider<'a> )

Trait Implementations

impl Debug for DocumentMap

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

Formats the value using the given formatter.

impl Default for DocumentMap

fn default() -> Self

Returns the “default value” for a type.