Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Namespaces
SuffixTrie.h File Reference
#include <ext/iostream>
#include <ext/algorithm>
#include <alib/string>
#include <alib/set>
#include <alib/trie>
#include <alib/optional>
#include <common/DefaultSymbolType.h>
#include <core/components.hpp>
#include <exception/CommonException.h>
#include <core/normalize.hpp>
#include <alphabet/common/SymbolNormalize.h>
#include <indexes/common/IndexesNormalize.h>
Include dependency graph for SuffixTrie.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  indexes::stringology::SuffixTrie< SymbolType >
 Suffix trie string index. Tree like representation of all suffixes. Nodes of the trie are optionally containing index of the suffix. The parent child relationship of nodes is represented by single symbol. The class does not checks whether the trie actually is suffix trie. More...
 
class  core::SetConstraint< indexes::stringology::SuffixTrie< SymbolType >, SymbolType, indexes::stringology::GeneralAlphabet >
 
struct  core::normalize< indexes::stringology::SuffixTrie< SymbolType > >
 

Namespaces

namespace  indexes
 
namespace  indexes::stringology
 
namespace  core