1#ifndef LIBLEVENSHTEIN_TRANSDUCER_POSITION_TRANSITION_H
2#define LIBLEVENSHTEIN_TRANSDUCER_POSITION_TRANSITION_H
26auto index_of(std::vector<bool> &characteristic_vector, std::size_t
k,
27 std::size_t
i) -> std::size_t;
41template <Algorithm Type>
43 std::vector<bool> &characteristic_vector,
44 std::size_t
offset) -> std::vector<Position *>;
63 std::size_t
offset) -> std::vector<Position *>;
82 std::size_t
offset) -> std::vector<Position *>;
101 std::size_t
offset) -> std::vector<Position *>;
Represents a location within the Levenshtein automaton.
void query(ll::Dawg *dawg, const std::string &query_term, std::size_t max_distance)
Various utilities regarding Levenshtein transducers.
auto position_transition(std::size_t n, Position *position, std::vector< bool > &characteristic_vector, std::size_t offset) -> std::vector< Position * >
Returns the closure over possible next Positions that are reachable from the current Position by adva...
auto position_transition< Algorithm::TRANSPOSITION >(std::size_t n, Position *position, std::vector< bool > &characteristic_vector, std::size_t offset) -> std::vector< Position * >
Returns the closure over possible next Positions that are reachable from the current Position by adva...
auto index_of(std::vector< bool > &characteristic_vector, std::size_t k, std::size_t i) -> std::size_t
Returns the first index of the desired character in the characteristic vector, beginning at the offse...
auto position_transition< Algorithm::STANDARD >(std::size_t n, Position *position, std::vector< bool > &characteristic_vector, std::size_t offset) -> std::vector< Position * >
Returns the closure over possible next Positions that are reachable from the current Position by adva...
auto position_transition< Algorithm::MERGE_AND_SPLIT >(std::size_t n, Position *position, std::vector< bool > &characteristic_vector, std::size_t offset) -> std::vector< Position * >
Returns the closure over possible next Positions that are reachable from the current Position by adva...