137     int32_t lessThan[kMaxSplitBranchLevels];  in writeBranchSubNode()  local
145         lessThan[ltLength]=writeBranchSubNode(start, i, unitIndex, length/2);  in writeBranchSubNode()
198         writeDeltaTo(lessThan[ltLength]);  in writeBranchSubNode()
266     Node *lessThan[kMaxSplitBranchLevels];  in makeBranchSubNode()  local
274         lessThan[ltLength]=makeBranchSubNode(start, i, unitIndex, length/2, errorCode);  in makeBranchSubNode()
313             new SplitBranchNode(middleUnits[ltLength], lessThan[ltLength], node), errorCode);  in makeBranchSubNode()
562     return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual;  in operator ==()
570         offset=edgeNumber=lessThan->markRightEdgesFirst(edgeNumber-1);  in markRightEdgesFirst()
578     lessThan->writeUnlessInsideRightEdge(firstEdgeNumber, greaterOrEqual->getOffset(), builder);  in write()
582     U_ASSERT(lessThan->getOffset()>0);  in write()
583     builder.writeDeltaTo(lessThan->getOffset());  // less-than  in write()