gentrie.trie package¶

Submodules¶

gentrie.trie.access module¶

Data access operations for the trie.

class gentrie.trie.access.TrieAccessMixin¶

Bases: object

Mixin providing data access operations.

Note: This mixin accesses private attributes of the mixing class. This is intentional and necessary for the mixin pattern.

get(key: TrieId | Sequence[TrieKeyToken], default: Any | None = None) → TrieEntry | Any | None¶

Returns the TrieEntry for the ident or key with the passed identifier.

The identifier can be either the TrieId (ident) or the GeneralizedKey (key) for the entry.

If the key is not found, it returns the default value if provided or None if not provided.

Parameters:

key (TrieId | GeneralizedKey) – the identifier to retrieve.
default (Optional[TrieEntry | Any], default=None) – The default value to return if the key is not found.

Returns: TrieEntry: TrieEntry for the key with the passed identifier or the default value if not found.

gentrie.trie.base module¶

Base trie functionality and initialization.

class gentrie.trie.base.TrieBase(runtime_validation: bool = True)¶

Bases: object

Base class providing core trie structure and utilities.

Properties:: runtime_validation (bool): Whether to enable runtime validation of keys.

clear() → None¶: Clears all keys from the trie.

gentrie.trie.collection module¶

Collection operations for GeneralizedTrie.

class gentrie.trie.collection.TrieCollectionMixin¶

Bases: object

Mixin providing collection operations (__len__, __iter__, keys, values, items).

items() → Generator[tuple[TrieId, TrieEntry], None, None]¶

Returns an iterator for the trie.

The keys are the TrieIds and the values are the TrieEntry instances.

The generator yields the TrieId and TrieEntry for each key in the trie.

Returns:: Generator for the trie.
Return type:: Generator[tuple[TrieId, TrieEntry], None, None]

keys() → Generator[TrieId, None, None]¶

Returns an iterator for all the TrieIds in the trie.

The generator yields the TrieId for each key in the trie.

It returns TrieIds instead of GeneralizedKeys because TrieIds are

Faster: Lookups using TrieIds are O(1) for time regardless of the length of the GeneralizedKey they are associated with vs O(n) to the length of keys for operations using GeneralizedKeys to look up entries.
More efficient memory usage: TrieIds are typically smaller in size compared to GeneralizedKeys, leading to reduced memory overhead when storing and processing keys in the trie.
Guaranteed stable even with key modifications: TrieIds remain consistent even if the underlying GeneralizedKey changes, making them more reliable for long-term storage and retrieval.

Returns:: Generator for the trie.
Return type:: Generator[TrieId, None, None]

values() → Generator[TrieEntry, None, None]¶

Returns an iterator for all the TrieEntry entries in the trie.

The generator yields the TrieEntry for each key in the trie.

Returns:: Generator for the trie.
Return type:: Generator[TrieEntry, None, None]

gentrie.trie.mutation module¶

Mutation operations for the trie.

class gentrie.trie.mutation.TrieMutationMixin¶

Bases: object

Mixin providing mutation operations.

gentrie.trie.removal module¶

Entry removal operations for the trie.

class gentrie.trie.removal.TrieRemovalMixin¶

Bases: object

Mixin providing entry removal operations.

Note: This mixin accesses private attributes of the mixing class. This is intentional and necessary for the mixin pattern

remove(key: TrieId | Sequence[TrieKeyToken]) → None¶

Remove the specified key from the trie.

Removes the key from the trie. If the key is not found, it raises a KeyError. The key can be specified either as a TrieId or as a GeneralizedKey.

Parameters:

key (TrieId | GeneralizedKey) – identifier for key to remove.

Raises:

TrieTypeError – if the key arg is not a TrieId or a valid GeneralizedKey.
TrieKeyError – if the key arg does not match the id or trie key of any entries in the trie.

gentrie.trie.storage module¶

Entry storage operations for the trie.

class gentrie.trie.storage.TrieStorageMixin¶

Bases: object

Mixin providing entry storage operations.

add(key: Sequence[TrieKeyToken], value: Any | None = None) → TrieId¶

Adds the key to the trie.

Warning

Keys Must Be Immutable

Once a key is added to the trie, neither the key sequence itself nor any of its constituent tokens should be mutated. Modifying a key after it has been added can corrupt the internal state of the trie, leading to unpredictable behavior and making entries unreachable. The trie does not create a deep copy of keys for performance reasons.

If you need to modify a key, you should remove the old key and add a new one with the modified value.

Parameters:

key (GeneralizedKey) – Must be an object that can be iterated and that when iterated returns elements conforming to the TrieKeyToken protocol.
value (Optional[Any], default=None) – Optional value to associate with the key.

Raises:

InvalidGeneralizedKeyError – If key is not a valid GeneralizedKey.
DuplicateKeyError – If the key is already in the trie.

Returns:

Id of the inserted key. If the key was not in the trie, it returns the id of the new entry. If the key was already in the trie, it raises a DuplicateKeyError.

Return type:

TrieId

update(key: Sequence[TrieKeyToken], value: Any | None = None) → TrieId¶

Updates the key/value pair in the trie.

Warning

Keys Must Be Immutable

If you need to modify a key, you should remove the old key and add a new one with the modified value.

Parameters:

key (GeneralizedKey) – Must be an object that can be iterated and that when iterated returns elements conforming to the TrieKeyToken protocol.
value (Optional[Any], default=None) – Optional value to associate with the key.

Raises:

InvalidGeneralizedKeyError – If key is not a valid GeneralizedKey.

Returns:

Id of the inserted key. If the key was already in the trie with the same value it returns the id for the already existing entry. If the key was not already in the trie, it returns the id for a new entry.

Return type:

TrieId

gentrie.trie.traversal module¶

Traversal operations for GeneralizedTrie.

class gentrie.trie.traversal.TrieTraversalMixin¶

Bases: object

Mixin providing traversal operations (prefixes, prefixed_by).

prefixed_by(key: Sequence[TrieKeyToken], depth: int = -1) → Generator[TrieEntry, None, None]¶

Yields all entries in the trie that are prefixed by the given key, up to a specified depth.

Searches the trie for all keys that start with the provided key and yields their TrieEntry instances.

Note

The prefixed_by method finds all keys that start with the given prefix. For example, trie.prefixed_by(‘app’) will find entries for keys like ‘apple’ and ‘application’.

Warning

GOTCHA: Generators

Because generators are not executed until the first iteration, they may not behave as expected if not consumed properly. For example, exceptions will not be raised until the generator is iterated over.

Parameters:

key (GeneralizedKey) – Key for matching.
depth (int, default=-1) – Depth starting from the matched key to include. The depth determines how many ‘layers’ deeper into the trie to look for prefixed_by.: * A depth of -1 (the default) includes ALL entries for the exact match and all children nodes. * A depth of 0 only includes the entries for the exact match for the key. * A depth of 1 includes entries for the exact match and the next layer down. * A depth of 2 includes entries for the exact match and the next two layers down.

Yields:

TrieEntry – The next matching TrieEntry instance.

Raises:

InvalidGeneralizedKeyError – If key arg is not a valid GeneralizedKey.
TrieTypeError – If depth arg is not an int.
TrieValueError – If depth arg is less than -1.

Usage:

from gentrie import GeneralizedTrie, TrieEntry

trie = GeneralizedTrie()
keys: list[str] = ['abcdef', 'abc', 'a', 'abcd', 'qrs']
for entry in keys:
    trie.add(entry)
matches_generator = trie.prefixed_by('abcd')

for trie_entry in sorted(list(matches_generator)):
    print(f'{trie_entry.ident}: {trie_entry.key}')

# 1: abcdef
# 4: abcd

prefixes(key: Sequence[TrieKeyToken]) → Generator[TrieEntry, None, None]¶

Yields TrieEntry instances for all keys in the trie that are a prefix of the passed key.

Searches the trie for all keys that are prefix matches for the key and yields their TrieEntry instances.

Note

The prefixes method finds all keys that are prefixes of the passed key. For example, trie.prefixes(‘apple’) will find entries for keys like ‘a’, ‘apple’ and ‘app’.

Warning

GOTCHA: Generators

Parameters:: key (GeneralizedKey) – Key for matching.
Yields:: TrieEntry – The next matching TrieEntry instance.
Raises:: InvalidGeneralizedKeyError – If key is not a valid GeneralizedKey (is not a Sequence of TrieKeyToken objects).

Usage:

from gentrie import GeneralizedTrie, TrieEntry

trie: GeneralizedTrie = GeneralizedTrie()
keys: list[str] = ['abcdef', 'abc', 'a', 'abcd', 'qrs']
for entry in keys:
    trie.add(entry)
matches_generator: Generator[TrieEntry, None, None] = trie.prefixes('abcd')
for trie_entry in sorted(list(matches_generator)):
    print(f'{trie_entry.ident}: {trie_entry.key}')

# 2: abc
# 3: a
# 4: abcd

gentrie.trie.trie_mixins module¶

Protocol for all GeneralizedTrie trie mixins.

class gentrie.trie.trie_mixins.TrieMixinsInterface(*args, **kwargs)¶

Bases: Protocol

Protocol defining the complete public API and shared private state for all mixins used within the GeneralizedTrie implementation.

add(key: Sequence[TrieKeyToken], value: Any | None = None) → TrieId¶

children: dict[TrieKeyToken, Node]¶

get(key: TrieId | Sequence[TrieKeyToken], default: Any | None = None) → TrieEntry | Any¶

ident: TrieId | None¶

parent: TrieMixinsInterface | None¶

prefixed_by(key: Sequence[TrieKeyToken], depth: int = -1) → Iterator[TrieEntry]¶

prefixes(key: Sequence[TrieKeyToken]) → Iterator[TrieEntry]¶

remove(key: TrieId | Sequence[TrieKeyToken]) → None¶

runtime_validation: bool¶

token: TrieKeyToken | None¶

update(key: Sequence[TrieKeyToken], value: Any | None = None) → TrieId¶

value: Any¶

Module contents¶

Main GeneralizedTrie implementation.

class gentrie.trie.GeneralizedTrie(runtime_validation: bool = True)¶

Bases: TrieBase, TrieStorageMixin, TrieAccessMixin, TrieRemovalMixin, TrieTraversalMixin, TrieMutationMixin, TrieCollectionMixin

A general purpose trie.

Unlike many trie implementations which only support strings as keys and token match only at the character level, it is agnostic as to the types of tokens used to key it and thus far more general purpose.

It requires only that the indexed tokens be hashable. This is verified at runtime using the gentrie.TrieKeyToken protocol.

Tokens in a key do NOT have to all be the same type as long as they can be compared for equality.

It can handle a Sequence of TrieKeyToken conforming objects as keys for the trie out of the box.

You can ‘mix and match’ types of objects used as token in a key as long as they all conform to the TrieKeyToken protocol.

The code emphasizes robustness and correctness.

Warning

GOTCHA: Using User Defined Classes As Tokens In Keys

Objects of user-defined classes are conformant with the TrieKeyToken protocol by default, but this will not work as naively expected. The hash value of an object is based on its memory address by default. This results in the hash value of an object changing every time the object is created and means that the object will not be found in the trie unless you have a reference to the original object.

If you want to use a user-defined class as a token in a key to look up by value instead of the instance, you must implement the __eq__() and __hash__() dunder methods in a content aware way (the hash and eq values must depend on the content of the object).

Tip

Using `dataclasses.dataclass` For Content-Aware User Defined Classes

A simple way to implement a user-defined class that is content aware hashable is to use the dataclasses.dataclass decorator using the frozen=True and eq=True options . This will automatically implement appropriate __eq__() and __hash__() methods for you.

Example of a content-aware user-defined class¶

from dataclasses import dataclass

from gentrie import TrieKeyToken

@dataclass(frozen=True, eq=True)
class MyTokenClass:
    name: str
    value: int

# Create an instance of the token class
token = MyTokenClass(name="example", value=42)

# Check if the token is hashable
if isinstance(token, TrieKeyToken):
    print("token is usable as a TrieKeyToken")
else:
    print("token is not usable as a TrieKeyToken")