Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Namespaces
PositionHeap.h File Reference
#include <ext/algorithm>
#include <ext/iostream>
#include <alib/string>
#include <alib/set>
#include <alib/trie>
#include <common/DefaultSymbolType.h>
#include <core/components.hpp>
#include <exception/CommonException.h>
#include <string/LinearString.h>
#include <indexes/common/IndexesNormalize.h>
Include dependency graph for PositionHeap.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::PositionHeap< SymbolType >
 Position heap string index. Tree like representation of all suffixes. The suffixes are themselves represented by their prefixes. The prefix of each suffix needs to be unique from all representants (prefixes again) of shorter suffixes. Nodes of the trie contain index of the suffix. The parent child relationship of nodes is represented by single symbol. The class does not checks whether the trie structure actually is position heap. More...
 
struct  core::normalize< indexes::stringology::PositionHeap< common::ranked_symbol< SymbolType > > >
 
struct  core::normalize< indexes::stringology::PositionHeap< SymbolType > >
 

Namespaces

namespace  indexes
 
namespace  indexes::stringology
 
namespace  core