lazy_query.h File Reference

#include <cstddef>
#include <functional>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#include "liblevenshtein/collection/dawg_node.h"
#include "liblevenshtein/transducer/intersection.h"
#include "liblevenshtein/transducer/state.h"

Include dependency graph for lazy_query.h:

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

Go to the source code of this file.

Classes
class	liblevenshtein::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. More...
class	liblevenshtein::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. More...

Namespaces
namespace	liblevenshtein
	Various utilities regarding Levenshtein transducers.

Typedefs
using	liblevenshtein::TransitionFn = std::function<State *(State *, std::vector<bool> &)>
	Returns the Levenshtein State mapped-to by another State and characteristic vector.
using	liblevenshtein::DistanceFn = std::function<std::size_t(State *, std::size_t)>
	Infers the Levenshtein distance from a final Levenshtein State and the length of the query term.