Lines Matching refs:node
35 int32_t node;
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
37 valueResult(node) : USTRINGTRIE_NO_VALUE;
83 int32_t node=*pos;
84 if(node&kValueIsFinal) {
90 // int32_t delta=readValue(pos, node);
92 if(node<kMinTwoUnitValueLead) {
93 delta=node;
94 } else if(node<kThreeUnitValueLead) {
95 delta=((node-kMinTwoUnitValueLead)<<16)|*pos++;
102 node=*pos;
103 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
113 int32_t node=*pos;
114 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
123 int32_t node=*pos++;
125 if(node<kMinLinearMatch) {
126 return branchNext(pos, node, uchar);
127 } else if(node<kMinValueLead) {
129 int32_t length=node-kMinLinearMatch; // Actual match length minus 1.
133 return (length<0 && (node=*pos)>=kMinValueLead) ?
134 valueResult(node) : USTRINGTRIE_NO_VALUE;
139 } else if(node&kValueIsFinal) {
144 pos=skipNodeValue(pos, node);
145 node&=kNodeTypeMask;
160 // Remaining part of a linear-match node.
164 int32_t node;
165 return (length<0 && (node=*pos)>=kMinValueLead) ?
166 valueResult(node) : USTRINGTRIE_NO_VALUE;
188 // Continue a linear-match node without rechecking sLength<0.
195 int32_t node;
196 return (length<0 && (node=*pos)>=kMinValueLead) ?
197 valueResult(node) : USTRINGTRIE_NO_VALUE;
215 int32_t node;
216 return (length<0 && (node=*pos)>=kMinValueLead) ?
217 valueResult(node) : USTRINGTRIE_NO_VALUE;
233 int32_t node=*pos++;
235 if(node<kMinLinearMatch) {
236 UStringTrieResult result=branchNext(pos, node, uchar);
258 node=*pos++;
259 } else if(node<kMinValueLead) {
261 length=node-kMinLinearMatch; // Actual match length minus 1.
269 } else if(node&kValueIsFinal) {
275 pos=skipNodeValue(pos, node);
276 node&=kNodeTypeMask;
296 int32_t node=*pos++;
297 UBool isFinal=(UBool)(node>>15);
298 node&=0x7fff;
299 int32_t value=readValue(pos, node);
300 pos=skipValue(pos, node);
322 int32_t node=*pos++;
324 if(node<kMinLinearMatch) {
325 if(node==0) {
326 node=*pos++;
328 pos=findUniqueValueFromBranch(pos, node+1, haveUniqueValue, uniqueValue);
333 node=*pos++;
334 } else if(node<kMinValueLead) {
335 // linear-match node
336 pos+=node-kMinLinearMatch+1; // Ignore the match units.
337 node=*pos++;
339 UBool isFinal=(UBool)(node>>15);
342 value=readValue(pos, node&0x7fff);
344 value=readNodeValue(pos, node);
357 pos=skipNodeValue(pos, node);
358 node&=kNodeTypeMask;
370 out.appendCodeUnit(*pos); // Next unit of a pending linear-match node.
373 int32_t node=*pos++;
374 if(node>=kMinValueLead) {
375 if(node&kValueIsFinal) {
378 pos=skipNodeValue(pos, node);
379 node&=kNodeTypeMask;
382 if(node<kMinLinearMatch) {
383 if(node==0) {
384 node=*pos++;
386 out.reserveAppendCapacity(++node);
387 getNextBranchUChars(pos, node, out);
388 return node;
390 // First unit of the linear-match node.
