Lines Matching full:lessthan
134 int32_t lessThan[kMaxSplitBranchLevels];
142 lessThan[ltLength]=writeBranchSubNode(start, i, unitIndex, length/2);
195 writeDeltaTo(lessThan[ltLength]);
263 Node *lessThan[kMaxSplitBranchLevels];
271 lessThan[ltLength]=makeBranchSubNode(start, i, unitIndex, length/2, errorCode);
310 new SplitBranchNode(middleUnits[ltLength], lessThan[ltLength], node), errorCode);
563 return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual;
571 offset=edgeNumber=lessThan->markRightEdgesFirst(edgeNumber-1);
579 lessThan->writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual->getOffset(), builder);
583 U_ASSERT(lessThan->getOffset()>0);
584 builder.writeDeltaTo(lessThan->getOffset()); // less-than
