| /third_party/skia/third_party/externals/sfntly/java/src/com/google/typography/font/sfntly/table/opentype/component/ |
| H A D | Rule.java | 27 private final RuleSegment lookAhead; field in Rule
31 Rule(RuleSegment backtrack, RuleSegment input, RuleSegment lookAhead, RuleSegment subst) { in Rule() argument
34 this.lookAhead = lookAhead; in Rule()
62 for (RuleSegment seg : new RuleSegment[] { input, backtrack, lookAhead }) { in addMatchingTargetGlyphs()
333 if (lookAhead != null) { in match()
334 thisAllSegments.addAll(lookAhead); in match()
342 if (other.lookAhead != null) { in match()
343 otherAllSegments.addAll(other.lookAhead); in match()
376 return new Rule(other.backtrack, input, other.lookAhead, othe in prependToInput()
397 oneToOneRules(RuleSegment backtrack, List<Integer> inputs, RuleSegment lookAhead, List<Integer> substs) oneToOneRules() argument
[all...] |
| H A D | RuleExtractor.java | 319 RuleSegment lookAhead = ruleSegmentFromGlyphs(table.lookAheadGlyphs); in extract()
321 Rule ruleSansSubst = new Rule(backtrack, inputRow, lookAhead, null); in extract()
411 RuleSegment lookAhead = ruleSegmentFromClasses(table.lookAheadGlyphs, lookAheadClassDef); in extract()
413 Rule ruleSansSubst = new Rule(backtrack, inputRow, lookAhead, null); in extract()
|
| /third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| H A D | CollationIterator.java | 713 int lookAhead = 1; in nextCE32FromContraction()
738 sinceMatch < lookAhead)) { in nextCE32FromContraction()
748 lookAhead -= sinceMatch - 1; in nextCE32FromContraction()
753 d, suffixes, ce32, lookAhead, c); in nextCE32FromContraction()
765 ++lookAhead; in nextCE32FromContraction()
774 int lookAhead, int c) { in nextCE32FromDiscontiguousContraction()
800 ++lookAhead; in nextCE32FromDiscontiguousContraction()
809 // We have read and matched (lookAhead-2) code points, in nextCE32FromDiscontiguousContraction()
817 if(lookAhead > 2) { in nextCE32FromDiscontiguousContraction()
819 backwardNumCodePoints(lookAhead); in nextCE32FromDiscontiguousContraction()
772 nextCE32FromDiscontiguousContraction( CollationData d, CharsTrie suffixes, int ce32, int lookAhead, int c) nextCE32FromDiscontiguousContraction() argument
[all...] |
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/ |
| H A D | CollationIterator.java | 715 int lookAhead = 1; in nextCE32FromContraction()
740 sinceMatch < lookAhead)) { in nextCE32FromContraction()
750 lookAhead -= sinceMatch - 1; in nextCE32FromContraction()
755 d, suffixes, ce32, lookAhead, c); in nextCE32FromContraction()
767 ++lookAhead; in nextCE32FromContraction()
776 int lookAhead, int c) { in nextCE32FromDiscontiguousContraction()
802 ++lookAhead; in nextCE32FromDiscontiguousContraction()
811 // We have read and matched (lookAhead-2) code points, in nextCE32FromDiscontiguousContraction()
819 if(lookAhead > 2) { in nextCE32FromDiscontiguousContraction()
821 backwardNumCodePoints(lookAhead); in nextCE32FromDiscontiguousContraction()
774 nextCE32FromDiscontiguousContraction( CollationData d, CharsTrie suffixes, int ce32, int lookAhead, int c) nextCE32FromDiscontiguousContraction() argument
[all...] |
| /third_party/icu/icu4c/source/i18n/ |
| H A D | collationiterator.cpp | 497 int32_t lookAhead = 1; in nextCE32FromContraction() local
522 sinceMatch < lookAhead)) { in nextCE32FromContraction()
532 lookAhead -= sinceMatch - 1; in nextCE32FromContraction()
537 d, suffixes, ce32, lookAhead, c, errorCode); in nextCE32FromContraction()
549 ++lookAhead; in nextCE32FromContraction()
559 int32_t lookAhead, UChar32 c, in nextCE32FromDiscontiguousContraction()
588 ++lookAhead; in nextCE32FromDiscontiguousContraction()
597 // We have read and matched (lookAhead-2) code points, in nextCE32FromDiscontiguousContraction()
609 if(lookAhead > 2) { in nextCE32FromDiscontiguousContraction()
611 backwardNumCodePoints(lookAhead, errorCod in nextCE32FromDiscontiguousContraction()
557 nextCE32FromDiscontiguousContraction( const CollationData *d, UCharsTrie &suffixes, uint32_t ce32, int32_t lookAhead, UChar32 c, UErrorCode &errorCode) nextCE32FromDiscontiguousContraction() argument
[all...] |
| H A D | regexcmp.h | 75 lookAhead = -4, enumerator
|
| H A D | collationiterator.h | 298 int32_t lookAhead, UChar32 c,
|
| /third_party/node/deps/icu-small/source/i18n/ |
| H A D | collationiterator.cpp | 497 int32_t lookAhead = 1; in nextCE32FromContraction() local
522 sinceMatch < lookAhead)) { in nextCE32FromContraction()
532 lookAhead -= sinceMatch - 1; in nextCE32FromContraction()
537 d, suffixes, ce32, lookAhead, c, errorCode); in nextCE32FromContraction()
549 ++lookAhead; in nextCE32FromContraction()
559 int32_t lookAhead, UChar32 c, in nextCE32FromDiscontiguousContraction()
588 ++lookAhead; in nextCE32FromDiscontiguousContraction()
597 // We have read and matched (lookAhead-2) code points, in nextCE32FromDiscontiguousContraction()
609 if(lookAhead > 2) { in nextCE32FromDiscontiguousContraction()
611 backwardNumCodePoints(lookAhead, errorCod in nextCE32FromDiscontiguousContraction()
557 nextCE32FromDiscontiguousContraction( const CollationData *d, UCharsTrie &suffixes, uint32_t ce32, int32_t lookAhead, UChar32 c, UErrorCode &errorCode) nextCE32FromDiscontiguousContraction() argument
[all...] |
| H A D | regexcmp.h | 75 lookAhead = -4, enumerator
|
| H A D | collationiterator.h | 298 int32_t lookAhead, UChar32 c,
|
| /third_party/skia/third_party/externals/icu/source/i18n/ |
| H A D | collationiterator.cpp | 497 int32_t lookAhead = 1; in nextCE32FromContraction() local
522 sinceMatch < lookAhead)) { in nextCE32FromContraction()
532 lookAhead -= sinceMatch - 1; in nextCE32FromContraction()
537 d, suffixes, ce32, lookAhead, c, errorCode); in nextCE32FromContraction()
549 ++lookAhead; in nextCE32FromContraction()
559 int32_t lookAhead, UChar32 c, in nextCE32FromDiscontiguousContraction()
588 ++lookAhead; in nextCE32FromDiscontiguousContraction()
597 // We have read and matched (lookAhead-2) code points, in nextCE32FromDiscontiguousContraction()
609 if(lookAhead > 2) { in nextCE32FromDiscontiguousContraction()
611 backwardNumCodePoints(lookAhead, errorCod in nextCE32FromDiscontiguousContraction()
557 nextCE32FromDiscontiguousContraction( const CollationData *d, UCharsTrie &suffixes, uint32_t ce32, int32_t lookAhead, UChar32 c, UErrorCode &errorCode) nextCE32FromDiscontiguousContraction() argument
[all...] |
| H A D | regexcmp.h | 79 lookAhead = -4, enumerator
|
| H A D | collationiterator.h | 298 int32_t lookAhead, UChar32 c,
|
| /third_party/icu/icu4c/source/common/ |
| H A D | rbbinode.h | 35 lookAhead, enumerator
|
| H A D | rbbitblb.cpp | 216 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) { in calcNullable()
258 n->fType == RBBINode::lookAhead || in calcFirstPos()
304 n->fType == RBBINode::lookAhead || in calcLastPos()
732 if (node->fType != RBBINode::NodeType::lookAhead) { in mapLookAheadRules()
763 if (node->fType != RBBINode::NodeType::lookAhead) { in mapLookAheadRules()
847 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus); in flagLookAheadStates()
853 U_ASSERT(lookAheadNode->fType == RBBINode::NodeType::lookAhead); in flagLookAheadStates()
|
| /third_party/node/deps/icu-small/source/common/ |
| H A D | rbbinode.h | 35 lookAhead, enumerator
|
| H A D | rbbitblb.cpp | 216 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) { in calcNullable()
258 n->fType == RBBINode::lookAhead || in calcFirstPos()
304 n->fType == RBBINode::lookAhead || in calcLastPos()
717 if (node->fType != RBBINode::NodeType::lookAhead) { in mapLookAheadRules()
748 if (node->fType != RBBINode::NodeType::lookAhead) { in mapLookAheadRules()
832 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus); in flagLookAheadStates()
838 U_ASSERT(lookAheadNode->fType == RBBINode::NodeType::lookAhead); in flagLookAheadStates()
|
| /third_party/skia/third_party/externals/icu/source/common/ |
| H A D | rbbinode.h | 35 lookAhead, enumerator
|
| H A D | rbbitblb.cpp | 216 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) { in calcNullable()
258 n->fType == RBBINode::lookAhead || in calcFirstPos()
304 n->fType == RBBINode::lookAhead || in calcLastPos()
731 if (node->fType != RBBINode::NodeType::lookAhead) { in mapLookAheadRules()
762 if (node->fType != RBBINode::NodeType::lookAhead) { in mapLookAheadRules()
846 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus); in flagLookAheadStates()
852 U_ASSERT(lookAheadNode->fType == RBBINode::NodeType::lookAhead); in flagLookAheadStates()
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| H A D | RBBITableBuilder.java | 231 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) { in calcNullable()
273 n.fType == RBBINode.lookAhead || in calcFirstPos()
316 n.fType == RBBINode.lookAhead || in calcLastPos()
637 if (node.fType != RBBINode.lookAhead) { in mapLookAheadRules()
667 if (node.fType != RBBINode.lookAhead) { in mapLookAheadRules()
737 fRB.fTreeRoots[fRootIx].findNodes(lookAheadNodes, RBBINode.lookAhead); in flagLookAheadStates()
|
| H A D | RBBINode.java | 28 static final int lookAhead = 4; field in RBBINode
47 "lookAhead",
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| H A D | RBBITableBuilder.java | 224 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) { in calcNullable()
266 n.fType == RBBINode.lookAhead || in calcFirstPos()
309 n.fType == RBBINode.lookAhead || in calcLastPos()
631 if (node.fType != RBBINode.lookAhead) { in mapLookAheadRules()
661 if (node.fType != RBBINode.lookAhead) { in mapLookAheadRules()
732 fRB.fTreeRoots[fRootIx].findNodes(lookAheadNodes, RBBINode.lookAhead); in flagLookAheadStates()
|
| H A D | RBBINode.java | 29 static final int lookAhead = 4; field in RBBINode
48 "lookAhead",
|
| /third_party/skia/modules/skparagraph/src/ |
| H A D | TextWrapper.h | 232 void lookAhead(SkScalar maxWidth, Cluster* endOfClusters, bool applyRoundingHack, WordBreakType wordBreakType,
|
| H A D | TextWrapper.cpp | 81 void TextWrapper::lookAhead(SkScalar maxWidth, Cluster* endOfClusters, bool applyRoundingHack, in lookAhead() function in skia::textlayout::TextWrapper
781 this->lookAhead(newWidth, end, parent->getApplyRoundingHack(), parent->getWordBreakType(), in moveForward()
1000 void TextWrapper::lookAhead(SkScalar maxWidth, Cluster* endOfClusters, bool applyRoundingHack) { in moveForward()
1227 this->lookAhead(maxWidth, end, parent->getApplyRoundingHack()); in moveForward()
|