| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| D | BreakTransliterator.java | 25 private String insertion; field in BreakTransliterator
29 … public BreakTransliterator(String ID, UnicodeFilter filter, BreakIterator bi, String insertion) { in BreakTransliterator() argument
32 this.insertion = insertion; in BreakTransliterator()
42 return insertion; in getInsertion()
48 public void setInsertion(String insertion) { in setInsertion() argument
49 this.insertion = insertion; in setInsertion()
122 delta = boundaryCount * insertion.length(); in handleTransliterate()
129 text.replace(boundary, boundary, insertion); in handleTransliterate()
416 targetSet.addAll(insertion); in addSourceTargetSet()
|
| /third_party/icu/icu4j/main/classes/translit/src/com/ibm/icu/text/ |
| D | BreakTransliterator.java | 24 private String insertion; field in BreakTransliterator
28 … public BreakTransliterator(String ID, UnicodeFilter filter, BreakIterator bi, String insertion) { in BreakTransliterator() argument
31 this.insertion = insertion; in BreakTransliterator()
41 return insertion; in getInsertion()
47 public void setInsertion(String insertion) { in setInsertion() argument
48 this.insertion = insertion; in setInsertion()
121 delta = boundaryCount * insertion.length(); in handleTransliterate()
128 text.replace(boundary, boundary, insertion); in handleTransliterate()
415 targetSet.addAll(insertion); in addSourceTargetSet()
|
| /third_party/python/Doc/library/ |
| D | bisect.rst | 15 having to sort the list after each insertion. For long lists of items with
26 Locate the insertion point for *x* in *a* to maintain sorted order.
29 already present in *a*, the insertion point will be before (to the left of)
33 The returned insertion point *i* partitions the array *a* into two halves so
48 Similar to :func:`bisect_left`, but returns an insertion point which comes
51 The returned insertion point *i* partitions the array *a* into two halves so
71 This function first runs :func:`bisect_left` to locate an insertion point.
76 insertion step.
92 This function first runs :func:`bisect_right` to locate an insertion point.
97 insertion step.
[all …]
|
| /third_party/flutter/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
| D | IntermTraverse.cpp | 507 const NodeInsertMultipleEntry &insertion = mInsertions[mInsertions.size() - ii - 1]; in updateTree() local
508 ASSERT(insertion.parent); in updateTree()
509 if (!insertion.insertionsAfter.empty()) in updateTree()
511 bool inserted = insertion.parent->insertChildNodes(insertion.position + 1, in updateTree()
512 insertion.insertionsAfter); in updateTree()
515 if (!insertion.insertionsBefore.empty()) in updateTree()
518 insertion.parent->insertChildNodes(insertion.position, insertion.insertionsBefore); in updateTree()
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
| D | IntermTraverse.cpp | 522 const NodeInsertMultipleEntry &insertion = mInsertions[mInsertions.size() - ii - 1]; in updateTree() local
523 ASSERT(insertion.parent); in updateTree()
524 if (!insertion.insertionsAfter.empty()) in updateTree()
526 bool inserted = insertion.parent->insertChildNodes(insertion.position + 1, in updateTree()
527 insertion.insertionsAfter); in updateTree()
530 if (!insertion.insertionsBefore.empty()) in updateTree()
533 insertion.parent->insertChildNodes(insertion.position, insertion.insertionsBefore); in updateTree()
|
| /third_party/skia/third_party/externals/dawn/src/common/ |
| D | ConcurrentCache.h | 40 auto insertion = mCache.insert(object); in Insert() local
41 return std::make_pair(*(insertion.first), insertion.second); in Insert()
|
| /third_party/libabigail/tests/data/test-diff-suppr/ |
| D | test4-local-suppr-report-0.txt | 10 1 data member insertion:
16 1 data member insertion:
22 1 data member insertion:
|
| D | test6-fn-suppr-report-0.txt | 10 1 base class insertion:
19 1 base class insertion:
29 1 base class insertion:
|
| D | test6-fn-suppr-report-0-1.txt | 10 1 base class insertion:
19 1 base class insertion:
29 1 base class insertion:
|
| D | test7-var-suppr-report-0.txt | 10 1 data member insertion:
19 1 data member insertion:
|
| D | test7-var-suppr-report-8.txt | 10 1 data member insertion:
19 1 data member insertion:
|
| D | test4-local-suppr-report-1.txt | 10 1 data member insertion:
17 1 data member insertion:
|
| D | test25-typedef-report-0.txt | 11 1 data member insertion:
19 1 data member insertion:
|
| D | test41-enumerator-changes-report-0.txt | 9 1 enumerator insertion:
17 1 enumerator insertion:
|
| D | test3-struct-suppr-report-0.txt | 10 1 data member insertion:
17 1 data member insertion:
|
| D | test6-fn-suppr-report-4.txt | 10 1 base class insertion:
19 1 base class insertion:
|
| D | test6-fn-suppr-report-2.txt | 10 1 base class insertion:
20 1 base class insertion:
|
| D | test6-fn-suppr-report-3.txt | 10 1 base class insertion:
20 1 base class insertion:
|
| D | test6-fn-suppr-report-1.txt | 10 1 base class insertion:
20 1 base class insertion:
|
| /third_party/libabigail/tests/data/test-diff-pkg/ |
| D | tbb-4.1-9.20130314.fc22.x86_64--tbb-4.3-3.20141204.fc23.x86_64-report-1.txt | 38 1 data member insertion:
49 1 enumerator insertion:
58 1 base class insertion:
65 1 base class insertion:
72 1 base class insertion:
79 1 base class insertion:
86 1 base class insertion:
93 1 base class insertion:
|
| D | tbb-4.1-9.20130314.fc22.x86_64--tbb-4.3-3.20141204.fc23.x86_64-report-0.txt | 41 1 base class insertion:
53 1 data member insertion:
84 1 base class insertion:
95 1 base class insertion:
101 1 member function insertion:
114 1 data member insertion:
123 1 base class insertion:
191 1 base class insertion:
198 1 enumerator insertion:
207 1 base class insertion:
[all …]
|
| D | nss-3.23.0-1.0.fc23.x86_64-report-0.txt | 11 1 enumerator insertion:
32 1 enumerator insertion:
42 1 data member insertion:
105 1 enumerator insertion:
|
| /third_party/libabigail/include/ |
| D | abg-diff-utils.h | 564 class insertion
571 insertion(int insertion_point, in insertion() function
577 insertion(int insertion_point = 0)
627 vector<insertion> insertions_;
635 const vector<insertion>&
639 vector<insertion>&
691 for (vector<insertion>::const_iterator i = insertions().begin(); in num_insertions()
1511 insertion ins(insertion_index); in compute_diff()
1562 insertion ins(a_begin - a_base); in compute_diff()
1612 insertion ins(p.x()); in compute_diff()
[all …]
|
| /third_party/node/deps/npm/node_modules/pseudomap/ |
| D | README.md | 24 guaranteed to be identical to insertion order, the insertion order
27 module works, `forEach` does traverse data in insertion order.
|
| /third_party/libabigail/tests/data/test-diff-filter/ |
| D | test2-report.txt | 14 1 data member insertion:
21 1 data member insertion:
|