Tanl::POS::TrieNode::counts_iterator Struct Reference

Iterator of a TrieNode. More...

#include <SuffixGuesser.h>

List of all members.

Public Member Functions
	counts_iterator (std::string &word, TrieNode *node)
	Iterator constructor.
Counts *	next ()
	This method returns the next pointer to Counts corresponding to a suffix of the specified word.
Public Attributes
std::string &	word
	Word used in the iteration process.
int	stop
	Stop position.
int	ix
	Actual iteration index.
TrieNode *	node
	Actual iteration node.
Counts *	legacy_counts
	Inherited Counts.
Counts	empty_counts
	Empty Counts object.

---

Detailed Description

Iterator of a TrieNode.

This Iterator depending on the word we are interested in, returns one by one each Counts of the word's suffices

---

Constructor & Destructor Documentation

Tanl::POS::TrieNode::counts_iterator::counts_iterator	(	std::string &	word,
		TrieNode *	node
	)			[inline]

Iterator constructor.

This constructor initializes all fields to prepare the iterator for looping

Parameters:

	word	The string we want to iterate on
	node	the starting node of the trie. Generally one must specify the root of the trie.

---

Member Function Documentation

Counts* Tanl::POS::TrieNode::counts_iterator::next

(

)

[inline]

This method returns the next pointer to Counts corresponding to a suffix of the specified word.

Returns:

Next pointer to Counts. When we arrived to the end of the trie or the word the method will return Null.

References Tanl::POS::TrieNode::tag_info.

---

The documentation for this struct was generated from the following file:

• tag/Tanlpos/SuffixGuesser.h