Lines Matching defs:node
65 // Pending linear-match node, append remaining bytes to str_.
110 // the branch node.
127 // We only get here if we started in a pending linear-match node
132 int32_t node=*pos++;
133 if(node>=kMinValueLead) {
135 UBool isFinal=(UBool)(node&kValueIsFinal);
136 value_=readValue(pos, node>>1);
140 pos_=skipValue(pos, node);
148 if(node<kMinLinearMatch) {
149 if(node==0) {
150 node=*pos++;
152 pos=branchNext(pos, node+1, errorCode);
157 // Linear-match node, append length bytes to str_.
158 int32_t length=node-kMinLinearMatch+1;
178 // Branch node, needs to take the first outbound edge and push state for the rest.
193 int32_t node=*pos++;
194 UBool isFinal=(UBool)(node&kValueIsFinal);
195 int32_t value=readValue(pos, node>>1);
196 pos=skipValue(pos, node);
