liblevenshtein 4.0.0
A library for generating Finite State Transducers based on Levenshtein Automata.
Loading...
Searching...
No Matches
position_transition.cpp File Reference
Include dependency graph for position_transition.cpp:

Go to the source code of this file.

Namespaces

namespace  liblevenshtein
 Various utilities regarding Levenshtein transducers.
 

Functions

auto liblevenshtein::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 offset \(i\).
 
template<>
auto liblevenshtein::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 advancing the location in the dictionary by one.
 
template<>
auto liblevenshtein::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 advancing the location in the dictionary by one.
 
template<>
auto liblevenshtein::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 advancing the location in the dictionary by one.