Code::Blocks  SVN r11506
Classes | Typedefs
searchtree.h File Reference
#include "prep.h"
#include <wx/string.h>
#include <vector>
#include <map>
#include <set>
Include dependency graph for searchtree.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  BasicSearchTreeIterator
 SearchTreeIterator lets us iterate through the nodes of a BasicSearchTree. More...
 
class  SearchTreePoint
 This class is used to access items of the tree, each node may contains a lot of items, E.g. More...
 
class  SearchTreeNode
 This class represents a node of the tree, we still take an example E.g. More...
 
class  BasicSearchTree
 This class is generally a string -> size_t map, the tree details (graph) is already show in the declaration of. More...
 
class  SearchTree< T >
 this is a class template derived from BasicSearchTree class, the type T was stored in a vector, and instead of returning a item number, the new class template can return an instance of T. More...
 

Typedefs

typedef size_t nSearchTreeNode
 node index, we hold the node address in a vector and reference it by index More...
 
typedef size_t nSearchTreeLabel
 label index, we put the labels (strings) in a vector, and access them by index More...
 
typedef std::map< wxChar, nSearchTreeNode, std::less< wxChar > > SearchTreeLinkMap
 SearchTreeLinkMap is the list of the edges towards child nodes. More...
 
typedef std::vector< SearchTreeNode * > SearchTreeNodesArray
 SearchTreeNodesArray contains all the nodes for a search tree, currently the vector should have all the slots filled with a valid node address, so remove a node from the vector is not allowed. More...
 
typedef std::vector< SearchTreePointSearchTreePointsArray
 SearchTreePointsArray contains a list of tree points defining strings (keys),. More...
 
typedef std::map< size_t, size_t, std::less< size_t > > SearchTreeItemsMap
 SearchTreeItemsMap contains all the items belonging to an node, the key is the depth of the point, which is the string length from the root node to the current point, the value is an index to point array,. More...
 
typedef std::vector< wxStringSearchTreeLabelsArray
 SearchTreeLabelsArray contains the labels used by the nodes, each node contains an incoming edge string, to identify the edge string, we need three member variables: 1, a string index in the vector,. More...
 

Typedef Documentation

◆ nSearchTreeLabel

typedef size_t nSearchTreeLabel

label index, we put the labels (strings) in a vector, and access them by index

Definition at line 19 of file searchtree.h.

◆ nSearchTreeNode

typedef size_t nSearchTreeNode

node index, we hold the node address in a vector and reference it by index

Definition at line 17 of file searchtree.h.

◆ SearchTreeItemsMap

typedef std::map<size_t,size_t, std::less<size_t> > SearchTreeItemsMap

SearchTreeItemsMap contains all the items belonging to an node, the key is the depth of the point, which is the string length from the root node to the current point, the value is an index to point array,.

See also
SearchTreeNode as a reference.

Definition at line 46 of file searchtree.h.

◆ SearchTreeLabelsArray

typedef std::vector<wxString> SearchTreeLabelsArray

SearchTreeLabelsArray contains the labels used by the nodes, each node contains an incoming edge string, to identify the edge string, we need three member variables: 1, a string index in the vector,.

See also
SearchTreeNode::nSearchTreeLabel 2, the edge's start index in the string,
SearchTreeNode::m_LabelStart 3, the edge's length,
SearchTreeNode::m_LabelLen

Definition at line 54 of file searchtree.h.

◆ SearchTreeLinkMap

typedef std::map<wxChar, nSearchTreeNode, std::less<wxChar> > SearchTreeLinkMap

SearchTreeLinkMap is the list of the edges towards child nodes.

The character is the key, and the child node index is the value,

See also
SearchTreeNode for a reference.

Definition at line 23 of file searchtree.h.

◆ SearchTreeNodesArray

typedef std::vector<SearchTreeNode*> SearchTreeNodesArray

SearchTreeNodesArray contains all the nodes for a search tree, currently the vector should have all the slots filled with a valid node address, so remove a node from the vector is not allowed.

Definition at line 35 of file searchtree.h.

◆ SearchTreePointsArray

typedef std::vector<SearchTreePoint> SearchTreePointsArray

SearchTreePointsArray contains a list of tree points defining strings (keys),.

See also
SearchTreePoint for details about how unique strings(key) are referenced by SearchTreePoint.

Definition at line 40 of file searchtree.h.