Expand description
A set-trie data structure for fast superset/subset retrieval.
Structs§
- SetTrie
- A set-trie is a trie, which stores sets. Branches are sorted and child node is always bigger than its parent node. Each node has a leaf_size to indicate how many leaves its children have in total. It’s used to speed up the deletion. When leaf_size == 1, there is no need to go down the route for deletion. Each leaf has a leaf_set to store the route from the top to this node. This is used to get all sets this trie stores.