Kate
#include <prefixstore.h>
Public Types | |
typedef QPair< bool, bool > | BooleanPair |
Public Member Functions | |
KatePrefixStore () | |
virtual | ~KatePrefixStore () |
void | addPrefix (const QString &prefix) |
void | clear () |
void | dump () |
QString | findPrefix (const QString &s, int start=0) const |
QString | findPrefix (const Kate::TextLine &line, int start=0) const |
int | longestPrefixLength () const |
void | removePrefix (const QString &prefix) |
Protected Types | |
typedef QHash< unsigned short, QPair< unsigned int, unsigned long long > > | CharToOccurrenceStateHash |
typedef QHash< unsigned long long, CharToOccurrenceStateHash > | TransitionFunction |
Protected Member Functions | |
int | computeLongestPrefixLength () |
unsigned long long | nextFreeState () |
Protected Attributes | |
QSet< unsigned long long > | m_acceptingStates |
unsigned long long | m_lastAssignedState |
int | m_longestPrefixLength |
QSet< QString > | m_prefixSet |
QList< unsigned long long > | m_stateFreeList |
TransitionFunction | m_transitionFunction |
Detailed Description
This class can be used to efficiently search for occurrences of strings in a given string.
Theoretically speaking, a finite deterministic automaton is constructed which exactly accepts the strings that are to be recognized. In order to check whether a given string contains one of the strings that are being searched for the constructed automaton has to applied on each position in the given string.
Definition at line 41 of file prefixstore.h.
Member Typedef Documentation
typedef QPair<bool, bool> KatePrefixStore::BooleanPair |
Definition at line 43 of file prefixstore.h.
|
protected |
Definition at line 74 of file prefixstore.h.
|
protected |
Definition at line 75 of file prefixstore.h.
Constructor & Destructor Documentation
KatePrefixStore::KatePrefixStore | ( | ) |
Definition at line 27 of file prefixstore.cpp.
|
virtual |
Definition at line 33 of file prefixstore.cpp.
Member Function Documentation
void KatePrefixStore::addPrefix | ( | const QString & | prefix | ) |
Definition at line 37 of file prefixstore.cpp.
void KatePrefixStore::clear | ( | ) |
Definition at line 163 of file prefixstore.cpp.
|
protected |
Definition at line 173 of file prefixstore.cpp.
void KatePrefixStore::dump | ( | ) |
Definition at line 109 of file prefixstore.cpp.
Returns the shortest prefix of the given string that is contained in this prefix store starting at position 'start'.
Definition at line 120 of file prefixstore.cpp.
QString KatePrefixStore::findPrefix | ( | const Kate::TextLine & | line, |
int | start = 0 |
||
) | const |
Returns the shortest prefix of the given string that is contained in this prefix store starting at position 'start'.
Definition at line 139 of file prefixstore.cpp.
int KatePrefixStore::longestPrefixLength | ( | ) | const |
Definition at line 158 of file prefixstore.cpp.
|
protected |
Definition at line 184 of file prefixstore.cpp.
void KatePrefixStore::removePrefix | ( | const QString & | prefix | ) |
Definition at line 70 of file prefixstore.cpp.
Member Data Documentation
|
protected |
Definition at line 77 of file prefixstore.h.
|
protected |
Definition at line 79 of file prefixstore.h.
|
protected |
Definition at line 70 of file prefixstore.h.
Definition at line 71 of file prefixstore.h.
|
protected |
Definition at line 78 of file prefixstore.h.
|
protected |
Definition at line 76 of file prefixstore.h.
The documentation for this class was generated from the following files:
Documentation copyright © 1996-2014 The KDE developers.
Generated on Tue Oct 14 2014 22:31:54 by doxygen 1.8.7 written by Dimitri van Heesch, © 1997-2006
KDE's Doxygen guidelines are available online.