liblevenshtein
4.0.0
A library for generating Finite State Transducers based on Levenshtein Automata.
Loading...
Searching...
No Matches
merge.h
Go to the documentation of this file.
1
#ifndef LIBLEVENSHTEIN_TRANSDUCER_MERGE_H
2
#define LIBLEVENSHTEIN_TRANSDUCER_MERGE_H
3
4
#include <vector>
5
6
#include "
liblevenshtein/transducer/algorithm.h
"
7
#include "
liblevenshtein/transducer/position.h
"
8
#include "
liblevenshtein/transducer/state.h
"
9
10
namespace
liblevenshtein
{
11
19
void
insert_after
(State *state, Position *
curr
, Position *next);
20
29
template
<Algorithm Type>
30
void
merge
(
State
*state,
const
std::vector<Position *> &
positions
);
31
32
}
// namespace liblevenshtein
33
34
#endif
// LIBLEVENSHTEIN_TRANSDUCER_MERGE_H
algorithm.h
liblevenshtein::State
Consists of a closure of Position nodes within the Levenshtein automaton.
Definition
state.h:23
query
void query(ll::Dawg *dawg, const std::string &query_term, std::size_t max_distance)
Definition
main.cpp:25
liblevenshtein
Various utilities regarding Levenshtein transducers.
Definition
namespaces.dox:9
liblevenshtein::insert_after
void insert_after(State *state, Position *curr, Position *next)
Inserts one Position after another.
Definition
merge.cpp:8
liblevenshtein::merge
void merge(State *state, const std::vector< Position * > &positions)
Merges a list of Positions into the Levenshtein state.
position.h
state.h
src
liblevenshtein
transducer
merge.h
Generated by
1.10.0