Diff2::LevenshteinTable

Search for usage in LXR

Diff2::LevenshteinTable< SequencePair > Class Template Reference

#include <levenshteintable.h>

Public Member Functions

 LevenshteinTable (unsigned int width, unsigned int height)
 
int chooseRoute (int c1, int c2, int c3, int current)
 
void createListsOfMarkers (void)
 
unsigned int createTable (SequencePair *sequences)
 
void dumpLevenshteinTable (void)
 
int getContent (unsigned int posX, unsigned int posY) const
 
unsigned int height () const
 
int setContent (unsigned int posX, unsigned int posY, int value)
 
bool setSize (unsigned int width, unsigned int height)
 
unsigned int width () const
 

Protected Member Functions

 LevenshteinTable (const LevenshteinTable &table)
 
const LevenshteinTableoperator= (const LevenshteinTable &table)
 

Detailed Description

template<class SequencePair>
class Diff2::LevenshteinTable< SequencePair >

Computes the Levenshtein distance between two sequences.

The actual sequence contents must be prepended with one virtual item each for easier index access.

Definition at line 26 of file levenshteintable.h.

Member Function Documentation

◆ createTable()

template<class SequencePair >
unsigned int Diff2::LevenshteinTable< SequencePair >::createTable ( SequencePair *  sequences)

This calculates the levenshtein distance of 2 sequences.

This object takes ownership of the argument

Definition at line 135 of file levenshteintable.h.

◆ dumpLevenshteinTable()

template<class SequencePair >
void Diff2::LevenshteinTable< SequencePair >::dumpLevenshteinTable ( void  )

Debug method to check if the table is properly filled.

Definition at line 122 of file levenshteintable.h.


The documentation for this class was generated from the following file:
This file is part of the KDE documentation.
Documentation copyright © 1996-2022 The KDE developers.
Generated on Mon Aug 8 2022 04:11:40 by doxygen 1.8.17 written by Dimitri van Heesch, © 1997-2006

KDE's Doxygen guidelines are available online.