liblevenshtein 4.0.0
A library for generating Finite State Transducers based on Levenshtein Automata.
Loading...
Searching...
No Matches
distance.h
Go to the documentation of this file.
1#ifndef LIBLEVENSHTEIN_TRANSDUCER_DISTANCE_H
2#define LIBLEVENSHTEIN_TRANSDUCER_DISTANCE_H
3
4#include <cstddef>
5
8
9namespace liblevenshtein {
10
20template <Algorithm Type>
21auto distance(State *state, std::size_t query_length) -> std::size_t;
22
34template <>
35auto distance<Algorithm::STANDARD>(State *state, std::size_t query_length)
36 -> std::size_t;
37
49template <>
50auto distance<Algorithm::TRANSPOSITION>(State *state, std::size_t query_length)
51 -> std::size_t;
52
53
65template <>
67 std::size_t query_length)
68 -> std::size_t;
69
70} // namespace liblevenshtein
71
72#endif // LIBLEVENSHTEIN_TRANSDUCER_DISTANCE_H
Consists of a closure of Position nodes within the Levenshtein automaton.
Definition state.h:23
Various utilities regarding Levenshtein transducers.
Definition namespaces.dox:9
auto distance< Algorithm::STANDARD >(State *state, std::size_t query_length) -> std::size_t
Infers the Levenshtein distance from the given State and query length for the standard Levenshtein di...
Definition distance.cpp:10
auto distance< Algorithm::TRANSPOSITION >(State *state, std::size_t query_length) -> std::size_t
Infers the Levenshtein distance from the given State and query length for the standard Levenshtein di...
Definition distance.cpp:25
auto distance(State *state, std::size_t query_length) -> std::size_t
Infers the Levenshtein distance from the given State and query length.
auto distance< Algorithm::MERGE_AND_SPLIT >(State *state, std::size_t query_length) -> std::size_t
Infers the Levenshtein distance from the given State and query length for the standard Levenshtein di...
Definition distance.cpp:42