Struct HashMapLexicon 

pub struct HashMapLexicon { /* private fields */ }

Simple HashMap-based lexicon implementation.

Suitable for small to medium lexicons (<100k entries). For larger lexicons, consider a trie-based or FST implementation.

Implementations

impl HashMapLexicon

pub fn new(source: impl Into<String>) -> Self

Create a new empty lexicon with the given source identifier.

pub fn insert( &mut self, text: impl Into<String>, entity_type: EntityType, confidence: f64, )

Insert an entry into the lexicon.

pub fn from_iter<I, S>(source: impl Into<String>, entries: I) -> Self

where I: IntoIterator<Item = (S, EntityType, f64)>, S: Into<String>,

Create from an iterator of (text, type, confidence) tuples.

pub fn entries(&self) -> impl Iterator<Item = (&str, &EntityType, f64)>

Get all entries as an iterator (for debugging).

Trait Implementations

impl Clone for HashMapLexicon

fn clone(&self) -> HashMapLexicon

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for HashMapLexicon

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

Formats the value using the given formatter.

impl Lexicon for HashMapLexicon

fn lookup(&self, text: &str) -> Option<(EntityType, f64)>

Lookup an exact string, returning entity type and confidence if found.

fn source(&self) -> &str

Get the lexicon source identifier (for provenance tracking).

fn len(&self) -> usize

Get approximate number of entries (for debugging/metrics).

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

Check if the lexicon contains this exact string.

fn is_empty(&self) -> bool

Check if lexicon is empty.