Prefix trie of bounded values that tracks sub-tree fullness. More...

#include <memory>
#include <cassert>
#include "Molassembler/Temple/Functional.h"
#include "boost/dynamic_bitset.hpp"

Include dependency graph for BoundedNodeTrie.h:

This graph shows which files directly or indirectly include this file:

Data Structures
struct	Scine::Molassembler::Temple::BoundedNodeTrie< ChoiceIndex >
	Data structure to store chains of discrete choices with an finite range of choices at each position. More...

struct	Scine::Molassembler::Temple::BoundedNodeTrie< ChoiceIndex >::InsertResult

struct	Scine::Molassembler::Temple::BoundedNodeTrie< ChoiceIndex >::AbstractNode
	Abstract base class for nodes to allow differentiation. More...

class	Scine::Molassembler::Temple::BoundedNodeTrie< ChoiceIndex >::Node
	Most common type of nodes have other AbstractNodes as children. More...

class	Scine::Molassembler::Temple::BoundedNodeTrie< ChoiceIndex >::Leaf
	Leaf node at bottom of the tree. More...

Namespaces
	Scine::Molassembler
	Central library namespace.

	Scine::Molassembler::Temple
	Template shorthands, optimizers and constexpr data types.

Detailed Description

Prefix trie of bounded values that tracks sub-tree fullness.

Copyright: This code is licensed under the 3-clause BSD license. Copyright ETH Zurich, Department of Chemistry and Applied Biosciences, Reiher Group. See LICENSE.txt for details.

Data Structures