Home
last modified time | relevance | path

Searched refs:WTT_Node (Results 1 – 4 of 4) sorted by relevance

/aoo41x/main/l10ntools/inc/
H A Dwtranode.hxx50 class WTT_Node // WordTransTree-Node class
61 WTT_Node(
67 WTT_Node * i_pNode );
70 ~WTT_Node();
73 WTT_Node * GetNextNode(
92 inline WTT_Node *
95 inline WTT_Node::E_TokenType
96 WTT_Node::TokenType() const in TokenType()
99 WTT_Node::Value() const in Value()
102 WTT_Node::IsOnDeleting() const in IsOnDeleting()
[all …]
H A Dwtratree.hxx42 class WTT_Node;
108 WTT_Node * dpParsingTreeTop; // DYN
109 WTT_Node * pUnknownAlpha;
117 WTT_Node * pCurParseNode;
/aoo41x/main/l10ntools/source/
H A Dwtranode.cxx37 WTT_Node::WTT_Node( UINT8 i_nValue, in WTT_Node() function in WTT_Node
38 WTT_Node * i_pDefaultBranch, in WTT_Node()
39 WTT_Node * i_pDefaultBranchForAlphas ) in WTT_Node()
58 WTT_Node::SetBranch( UINT8 i_cBranch, in SetBranch()
59 WTT_Node * i_pNode ) in SetBranch()
68 WTT_Node::SetAsTokenToReplace(const ByteString & i_sReplaceString) in SetAsTokenToReplace()
74 WTT_Node::~WTT_Node() in ~WTT_Node()
H A Dwtratree.cxx84 …pUnknownAlpha = new WTT_Node(BR_ALPHABASE,0,0); // This will be deleted as part of the parsing tre… in WordTransTree()
90 dpParsingTreeTop = new WTT_Node(BR_START,0,pUnknownAlpha); in WordTransTree()
92 WTT_Node * dpNonAlpha = new WTT_Node(BR_NONALPHA,0,0); in WordTransTree()
97 WTT_Node * dpBackslash = new WTT_Node(BR_BACKSLASH,dpNonAlpha,dpNonAlpha); in WordTransTree()
168 WTT_Node * pBranch = 0; in AddWordPair()
179 pBranch = new WTT_Node(cBranch,0,pUnknownAlpha); in AddWordPair()
223 WTT_Node * pBranch = 0; in TransformNextToken()
272 if (pCurParseNode->TokenType() == WTT_Node::token_to_keep) in TransformNextToken()
286 if (pCurParseNode->TokenType() == WTT_Node::token_to_keep) in TransformNextToken()

Completed in 25 milliseconds