/external/icu/android_icu4j/src/main/java/android/icu/text/ |
D | BidiLine.java | 662 int[] indexMap = new int[levels.length]; in prepareReorder() local 665 indexMap[start] = start; in prepareReorder() 668 return indexMap; in prepareReorder() 677 int[] indexMap = prepareReorder(levels, aMinLevel, aMaxLevel); in reorderLogical() local 678 if (indexMap == null) { in reorderLogical() 687 return indexMap; in reorderLogical() 726 indexMap[start] = sumOfSosEos - indexMap[start]; in reorderLogical() 737 return indexMap; in reorderLogical() 747 int[] indexMap = prepareReorder(levels, aMinLevel, aMaxLevel); in reorderVisual() local 748 if (indexMap == null) { in reorderVisual() [all …]
|
D | Bidi.java | 5593 int[] indexMap = reorderVisual(reorderLevels); in reorderVisually() local 5597 objects[objectStart + i] = temp[indexMap[i]]; in reorderVisually()
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
D | BidiLine.java | 661 int[] indexMap = new int[levels.length]; in prepareReorder() local 664 indexMap[start] = start; in prepareReorder() 667 return indexMap; in prepareReorder() 676 int[] indexMap = prepareReorder(levels, aMinLevel, aMaxLevel); in reorderLogical() local 677 if (indexMap == null) { in reorderLogical() 686 return indexMap; in reorderLogical() 725 indexMap[start] = sumOfSosEos - indexMap[start]; in reorderLogical() 736 return indexMap; in reorderLogical() 746 int[] indexMap = prepareReorder(levels, aMinLevel, aMaxLevel); in reorderVisual() local 747 if (indexMap == null) { in reorderVisual() [all …]
|
D | Bidi.java | 5687 int[] indexMap = reorderVisual(reorderLevels); in reorderVisually() local 5691 objects[objectStart + i] = temp[indexMap[i]]; in reorderVisually()
|
/external/icu/icu4c/source/common/ |
D | ubidiln.cpp | 713 int32_t *indexMap, in prepareReorder() argument 743 indexMap[start]=start; in prepareReorder() 752 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderLogical() argument 756 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) { in ubidi_reorderLogical() 801 indexMap[start]=sumOfSosEos-indexMap[start]; in ubidi_reorderLogical() 815 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderVisual() argument 819 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) { in ubidi_reorderVisual() 857 temp=indexMap[start]; in ubidi_reorderVisual() 858 indexMap[start]=indexMap[end]; in ubidi_reorderVisual() 859 indexMap[end]=temp; in ubidi_reorderVisual() [all …]
|
/external/skia/tests/ |
D | PolyUtilsTest.cpp | 14 uint16_t indexMap[1024]; in DEF_TEST() local 16 indexMap[i] = i; in DEF_TEST() 27 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 36 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 46 REPORTER_ASSERT(reporter, !SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 57 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 69 REPORTER_ASSERT(reporter, !SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 80 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 110 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 122 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() [all …]
|
/external/skqp/tests/ |
D | PolyUtilsTest.cpp | 14 uint16_t indexMap[1024]; in DEF_TEST() local 16 indexMap[i] = i; in DEF_TEST() 27 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 36 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 46 REPORTER_ASSERT(reporter, !SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 57 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 69 REPORTER_ASSERT(reporter, !SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 80 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 110 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() 122 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST() [all …]
|
/external/skia/fuzz/ |
D | FuzzPolyUtils.cpp | 34 SkAutoSTMalloc<64, uint16_t> indexMap(count); in DEF_FUZZ() local 36 fuzz->next(&indexMap[index]); in DEF_FUZZ() 39 ignoreResult(SkTriangulateSimplePolygon(polygon, indexMap, count, &outputIndices)); in DEF_FUZZ()
|
/external/skqp/fuzz/ |
D | FuzzPolyUtils.cpp | 34 SkAutoSTMalloc<64, uint16_t> indexMap(count); in DEF_FUZZ() local 36 fuzz->next(&indexMap[index]); in DEF_FUZZ() 39 ignoreResult(SkTriangulateSimplePolygon(polygon, indexMap, count, &outputIndices)); in DEF_FUZZ()
|
/external/icu/libandroidicu/include/unicode/ |
D | ubidi.h | 1722 ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode); 1758 ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode); 1781 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap); 1804 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap);
|
/external/icu/icu4c/source/common/unicode/ |
D | ubidi.h | 1722 ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode); 1758 ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode); 1781 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap); 1804 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap);
|
/external/antlr/runtime/Python/unittests/ |
D | testtreewizard.py | 337 def __simplifyIndexMap(self, indexMap): argument 340 for ttype, nodes in indexMap.items() 346 indexMap = wiz.index(tree) 347 found = self.__simplifyIndexMap(indexMap) 355 indexMap = wiz.index(tree) 356 found = self.__simplifyIndexMap(indexMap) 364 indexMap = wiz.index(tree) 365 found = self.__simplifyIndexMap(indexMap)
|
/external/antlr/runtime/Python3/unittests/ |
D | testtreewizard.py | 336 def __simplifyIndexMap(self, indexMap): argument 339 for ttype, nodes in indexMap.items() 345 indexMap = wiz.index(tree) 346 found = self.__simplifyIndexMap(indexMap) 354 indexMap = wiz.index(tree) 355 found = self.__simplifyIndexMap(indexMap) 363 indexMap = wiz.index(tree) 364 found = self.__simplifyIndexMap(indexMap)
|
/external/skqp/bench/ |
D | PolyUtilsBench.cpp | 81 SkAutoSTMalloc<64, uint16_t> indexMap(poly.count()); in onDraw() local 83 indexMap[i] = i; in onDraw() 87 SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in onDraw()
|
/external/skia/bench/ |
D | PolyUtilsBench.cpp | 81 SkAutoSTMalloc<64, uint16_t> indexMap(poly.count()); in onDraw() local 83 indexMap[i] = i; in onDraw() 87 SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in onDraw()
|
/external/cldr/tools/java/org/unicode/cldr/util/ |
D | VerifyCompactNumbers.java | 83 Map<String, String> indexMap = new TreeMap<>(CLDR_CONFIG.getCollator()); in main() local 113 indexMap.put(english.getName(locale), locale + ".html"); in main() 117 DateTimeFormats.writeIndexMap(indexMap, index); in main()
|
D | VerifyZones.java | 294 Map<String, String> indexMap = new TreeMap<>(CLDR_CONFIG.getCollator()); in main() local 316 indexMap.put(english.getName(localeID), localeID + ".html"); in main() 319 DateTimeFormats.writeIndexMap(indexMap, index); in main()
|
/external/skia/src/utils/ |
D | SkPolyUtils.h | 103 bool SkTriangulateSimplePolygon(const SkPoint* polygonVerts, uint16_t* indexMap, int polygonSize,
|
D | SkShadowTessellator.cpp | 594 SkAutoSTMalloc<64, uint16_t> indexMap(umbraPolygon.count()); in stitchConcaveRings() local 638 indexMap[currUmbra] = 1; in stitchConcaveRings() 654 indexMap[nextUmbra] = currUmbraIndex; in stitchConcaveRings() 692 indexMap[nextUmbra] = currUmbraIndex; in stitchConcaveRings() 711 indexMap[nextUmbra] = currUmbraIndex; in stitchConcaveRings() 717 SkTriangulateSimplePolygon(umbraPolygon.begin(), indexMap, umbraPolygon.count(), in stitchConcaveRings()
|
D | SkPolyUtils.cpp | 1576 bool SkTriangulateSimplePolygon(const SkPoint* polygonVerts, uint16_t* indexMap, int polygonSize, in SkTriangulateSimplePolygon() argument 1691 indices[0] = indexMap[p0->fIndex]; in SkTriangulateSimplePolygon() 1692 indices[1] = indexMap[earVertex->fIndex]; in SkTriangulateSimplePolygon() 1693 indices[2] = indexMap[p2->fIndex]; in SkTriangulateSimplePolygon() 1711 *triangleIndices->push() = indexMap[vertex->fIndex]; in SkTriangulateSimplePolygon()
|
/external/skqp/src/utils/ |
D | SkPolyUtils.h | 103 bool SkTriangulateSimplePolygon(const SkPoint* polygonVerts, uint16_t* indexMap, int polygonSize,
|
D | SkShadowTessellator.cpp | 594 SkAutoSTMalloc<64, uint16_t> indexMap(umbraPolygon.count()); in stitchConcaveRings() local 638 indexMap[currUmbra] = 1; in stitchConcaveRings() 654 indexMap[nextUmbra] = currUmbraIndex; in stitchConcaveRings() 692 indexMap[nextUmbra] = currUmbraIndex; in stitchConcaveRings() 711 indexMap[nextUmbra] = currUmbraIndex; in stitchConcaveRings() 717 SkTriangulateSimplePolygon(umbraPolygon.begin(), indexMap, umbraPolygon.count(), in stitchConcaveRings()
|
D | SkPolyUtils.cpp | 1554 bool SkTriangulateSimplePolygon(const SkPoint* polygonVerts, uint16_t* indexMap, int polygonSize, in SkTriangulateSimplePolygon() argument 1669 indices[0] = indexMap[p0->fIndex]; in SkTriangulateSimplePolygon() 1670 indices[1] = indexMap[earVertex->fIndex]; in SkTriangulateSimplePolygon() 1671 indices[2] = indexMap[p2->fIndex]; in SkTriangulateSimplePolygon() 1689 *triangleIndices->push() = indexMap[vertex->fIndex]; in SkTriangulateSimplePolygon()
|
/external/icu/libandroidicu/static_shim/ |
D | shim.cpp | 562 void ubidi_getLogicalMap_android(UBiDi * pBiDi, int32_t * indexMap, UErrorCode * pErrorCode) { in ubidi_getLogicalMap_android() argument 563 ubidi_getLogicalMap(pBiDi, indexMap, pErrorCode); in ubidi_getLogicalMap_android() 595 void ubidi_getVisualMap_android(UBiDi * pBiDi, int32_t * indexMap, UErrorCode * pErrorCode) { in ubidi_getVisualMap_android() argument 596 ubidi_getVisualMap(pBiDi, indexMap, pErrorCode); in ubidi_getVisualMap_android() 619 void ubidi_reorderLogical_android(const UBiDiLevel * levels, int32_t length, int32_t * indexMap) { in ubidi_reorderLogical_android() argument 620 ubidi_reorderLogical(levels, length, indexMap); in ubidi_reorderLogical_android() 622 void ubidi_reorderVisual_android(const UBiDiLevel * levels, int32_t length, int32_t * indexMap) { in ubidi_reorderVisual_android() argument 623 ubidi_reorderVisual(levels, length, indexMap); in ubidi_reorderVisual_android()
|