, including all inherited members.
| approxOccurrenceCount(int p=-1) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| arrayByteSpanSize(int p=-1) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| ca(int p=-1) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| down() | ugdiss::TSA_tree_iterator< TKN > | [inline, virtual] |
| extend(Token const &id) | ugdiss::TSA_tree_iterator< TKN > | [inline, virtual] |
| extend(id_type id) | ugdiss::TSA_tree_iterator< TKN > | [inline, virtual] |
| fillBitSet(boost::dynamic_bitset< uint64_t > &bitset) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| filterSentences(bitvector &foo) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| getOffset(int p) const | ugdiss::TSA_tree_iterator< TKN > | |
| getPid(int p=-1) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| getSequenceId() const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| getSid() const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| getToken(int p) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| grow(Token const *t, Token const *stop) | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| grow(Token const *snt, bitvector const &cov) | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| lower | ugdiss::TSA_tree_iterator< TKN > | [protected] |
| lower_bound(int p) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| markEndOfSequence(Token const *start, Token const *stop, boost::dynamic_bitset< uint64_t > &dest) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| markOccurrences(boost::dynamic_bitset< uint64_t > &bitset, bool markOnlyStartPosition=false) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| markOccurrences(std::vector< ushort > &dest) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| markSentences(boost::dynamic_bitset< uint64_t > &bitset) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| markSequence(Token const *start, Token const *stop, bitvector &dest) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| match(Token const *start, Token const *stop) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| match(id_type sid) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| over() | ugdiss::TSA_tree_iterator< TKN > | [inline, virtual] |
| randomSample(int level, size_t N) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| rawCnt(int p=-1) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| root | ugdiss::TSA_tree_iterator< TKN > | |
| showBounds(std::ostream &out) const | ugdiss::TSA_tree_iterator< TKN > | [protected] |
| size() const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| sntCnt(int p=-1) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| str(TokenIndex const *V=NULL, int start=0, int stop=0) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| tfAndRoot(bitvector const &ref, bitvector const &snt, bitvector &dest) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| Token typedef | ugdiss::TSA_tree_iterator< TKN > | |
| TSA_tree_iterator(TSA< Token > const *s) | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| TSA_tree_iterator(TSA< Token > const *s, TSA_tree_iterator< Token > const &other) | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| TSA_tree_iterator(TSA< Token > const *r, id_type const *s, size_t const len) | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| TSA_tree_iterator(TSA< Token > const *s, Token const *kstart, size_t const len, bool full_match_only=true) | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| TSA_tree_iterator(TSA< Token > const *s, Token const *kstart, Token const *kend, bool full_match_only=true) | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| TSA_tree_iterator(TSA< Token > const *s, TokenIndex const &V, std::string const &key) | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| up() | ugdiss::TSA_tree_iterator< TKN > | [inline, virtual] |
| upper | ugdiss::TSA_tree_iterator< TKN > | [protected] |
| upper_bound(int p) const | ugdiss::TSA_tree_iterator< TKN > | [inline] |
| ~TSA_tree_iterator() | ugdiss::TSA_tree_iterator< TKN > | [inline, virtual] |
