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

[detail level 123]

Cdigest::ds::Adaptive	Adaptive data structure. Selects between Naive and Naive2 based on the large window size
Cdigest::ds::Adaptive64	Same as Adaptive but uses 64-bit hashes
▼Cdigest::Digester< P >	Abstract class for Digester objects
Cdigest::ModMin< P >	Child class of Digester that defines a minimizer as a kmer whose hash is equal to some target value after being modded. Parameters without a description are the same as the parameters in the Digester parent class. They are simply passed up to the parent constructor
▼Cdigest::WindowMin< P, T >	Child class of Digester that defines a minimizer as a kmer whose hash is minimal among those in the large window. Parameters without a description are the same as the parameters in the Digester parent class. They are simply passed up to the parent constructor
Cdigest::Syncmer< P, T >	This class inherits from WindowMinimizer (implementation reasons), but the represent very different things. A Syncmer is defined as a large window where the minimal hash among all kmers in the large window belong to either the leftmost or rightmost kmer. Parameters without a description are the same as the parameters in the Digester parent class. They are simply passed up to the parent constructor
▼Cstd::exception
Cdigest::BadConstructionException	Exception thrown when initializing a Digister with k (kmer size) < 4 and start (starting index) < len (length of sequence)
Cdigest::BadModException	Exception thrown when initializing a mod minimizer object where the target value after modding is greater than the mod value
Cdigest::BadWindowSizeException	Exception thrown when initializing a Window Minimizer or Syncmer with a large window size of 0
Cdigest::NotRolledTillEndException	Exception thrown when append_seq() is called before all kmers/large windows in the current sequence have been iterated over
Cdigest::thread_out::BadThreadOutParams	Exception thrown when invalid parameters are passed to the thread functions
Cdigest::ds::Interface< T >
Cdigest::ds::Naive< k >	Naive data structure. Naively loops through the array to find the minimum
Cdigest::ds::Naive2< k >	Naive2 data structure. Remembers the last minimum index and only loops through the array when this index leaves the window
Cdigest::ds::SegmentTree< k >	Segment Tree data structure. Supports log(n) point updates and range minimum queries