sorted_dawg.h File Reference

#include <stack>
#include <unordered_map>
#include <unordered_set>
#include "liblevenshtein/collection/dawg.h"
#include "liblevenshtein/collection/dawg_node.h"
#include "liblevenshtein/collection/transition.h"

Include dependency graph for sorted_dawg.h:

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

Go to the source code of this file.

Classes
class	liblevenshtein::SortedDawg
	A specific type of Dawg that is constructed over lexicographically sorted terms. More...

Namespaces
namespace	liblevenshtein
	Various utilities regarding Levenshtein transducers.

Functions
template<class IterType >
auto	liblevenshtein::sorted_dawg (IterType iter, IterType end) -> SortedDawg *
	Factory function that initializes a new SortedDawg using the terms yielded from an iterator.