This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 123]

Cliblevenshtein::demo::CommandLine
▼Cliblevenshtein::Dawg	A Directed Acyclic Word Graph (DAWG) maps sequences of characters to form words; the collection of words is known as a dictionary
Cliblevenshtein::SortedDawg	A specific type of Dawg that is constructed over lexicographically sorted terms
Cliblevenshtein::DawgIterator	Iterates over all the terms in a DAWG dictionary
Cliblevenshtein::DawgNode	Represents a position within one or more terms of a DAWG dictionary
▼Cliblevenshtein::distance::Distance	Metric that measures the edit distance between two terms, denoted `d(v,w)`
▼Cliblevenshtein::distance::MemoizedDistance	Memoizes the distance between pairs of terms
Cliblevenshtein::distance::MergeAndSplitDistance	Computes the standard Levenshtein distance extended with two additional elementary operations: (1) merge and (2) split
Cliblevenshtein::distance::StandardDistance	Computes the standard Levenshtein distance, which includes the elementary operations of insertion, deletion, and substitution
Cliblevenshtein::distance::TranspositionDistance	Computes the standard Levenshtein distance extended with the elementary operation of transposition
Cstd::hash< liblevenshtein::Dawg >	Generates a hash code for the given DAWG
Cstd::hash< liblevenshtein::DawgNode >	Overloaded hash template struct that serves to generate hash codes for DAWG nodes
Cstd::hash< liblevenshtein::distance::SymmetricPair >	Generates hash codes for SymmetricPair instances
Cliblevenshtein::Intersection	Represents an Intersection between a dictionary automaton and Levenshtein automaton, guided by the query term
Cliblevenshtein::LazyIterator< Result >	Lazily traverses the intersection between the dictionary automaton and Levenshtein automaton, guided by the query term, and yields each spelling candidate as it is matched
Cliblevenshtein::LazyQuery< Result >	Lazily traverses the intersection between the dictionary automaton and Levenshtein automaton, guided by the query term, and yields each spelling candidate as it is matched
Cliblevenshtein::Position	Represents a location within the Levenshtein automaton
Cliblevenshtein::Prefix	Represents the prefix of a dictionary term
Cliblevenshtein::State	Consists of a closure of Position nodes within the Levenshtein automaton
Cliblevenshtein::StateIterator	Iterates over the Position nodes in the linked-list of a Levenshtein State
Cliblevenshtein::StateTransition	Transitions Levenshtein States given a characteristic vector
Cliblevenshtein::distance::SymmetricPair	Represents a pair of terms sorted, lexicographically, in ascending order
Cliblevenshtein::Transducer< Type, Result >	Constructs a Levenshtein Transducer that, when given a dictionary automaton, query term, and maximum edit distance, `n`, is able to match all spelling candidates in the dictionary automaton for the query term whose edit distances are no larger than `n`
Cliblevenshtein::Transition	Represents an edge from one DawgNode to another, annotated with a character label from the current position of the dictionary term
Cliblevenshtein::UnsubsumeFn	Removes (unsubsumes) all Positions from a State that are subsumed by another Position within the same State