Home
last modified time | relevance | path

Searched refs:indexMap (Results 1 - 20 of 20) sorted by relevance

/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DBidiLine.java661 int[] indexMap = new int[levels.length]; in prepareReorder()
664 indexMap[start] = start; in prepareReorder()
667 return indexMap; in prepareReorder()
676 int[] indexMap = prepareReorder(levels, aMinLevel, aMaxLevel); in reorderLogical()
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 in reorderVisual()
[all...]
H A DBidi.java5084 * <code>indexMap[logicalIndex]==visualIndex</code>, where
5085 * <code>indexMap</code> represents the returned array.
5126 * <code>indexMap[visualIndex]==logicalIndex</code>, where
5127 * <code>indexMap</code> represents the returned array.
5163 * <code>indexMap[logicalIndex]==visualIndex</code>, where
5164 * <code>indexMap</code> represents the returned array.
5186 * <code>indexMap[visualIndex]==logicalIndex</code>, where
5187 * <code>indexMap</code> represents the returned array.
5687 int[] indexMap = reorderVisual(reorderLevels); in reorderVisually()
5691 objects[objectStart + i] = temp[indexMap[ in reorderVisually()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DBidiLine.java662 int[] indexMap = new int[levels.length]; in prepareReorder()
665 indexMap[start] = start; in prepareReorder()
668 return indexMap; in prepareReorder()
677 int[] indexMap = prepareReorder(levels, aMinLevel, aMaxLevel); in reorderLogical()
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 in reorderVisual()
[all...]
H A DBidi.java5020 * <code>indexMap[logicalIndex]==visualIndex</code>, where
5021 * <code>indexMap</code> represents the returned array.
5061 * <code>indexMap[visualIndex]==logicalIndex</code>, where
5062 * <code>indexMap</code> represents the returned array.
5097 * <code>indexMap[logicalIndex]==visualIndex</code>, where
5098 * <code>indexMap</code> represents the returned array.
5118 * <code>indexMap[visualIndex]==logicalIndex</code>, where
5119 * <code>indexMap</code> represents the returned array.
5593 int[] indexMap = reorderVisual(reorderLevels); in reorderVisually()
5597 objects[objectStart + i] = temp[indexMap[ in reorderVisually()
[all...]
/third_party/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/localedistance/
H A DIndexer.java28 private final Map<T, Integer> indexMap = new LinkedHashMap<>(); field in Indexer
38 indexMap.putIfAbsent(checkNotNull(value), indexMap.size()); in apply()
39 return convertIndexFn.apply(indexMap.get(value)); in apply()
44 return Collections.unmodifiableSet(indexMap.keySet()); in getValues()
/third_party/icu/icu4c/source/common/
H A Dubidiln.cpp711 int32_t *indexMap, in prepareReorder()
741 indexMap[start]=start; in prepareReorder()
750 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderLogical() argument
754 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) { in ubidi_reorderLogical()
799 indexMap[start]=sumOfSosEos-indexMap[start]; in ubidi_reorderLogical()
813 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderVisual() argument
817 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, in ubidi_reorderVisual()
710 prepareReorder(const UBiDiLevel *levels, int32_t length, int32_t *indexMap, UBiDiLevel *pMinLevel, UBiDiLevel *pMaxLevel) prepareReorder() argument
1110 ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode) ubidi_getLogicalMap() argument
1211 ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode) ubidi_getVisualMap() argument
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dubidiln.cpp711 int32_t *indexMap, in prepareReorder()
741 indexMap[start]=start; in prepareReorder()
750 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderLogical() argument
754 if(indexMap==nullptr || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) { in ubidi_reorderLogical()
799 indexMap[start]=sumOfSosEos-indexMap[start]; in ubidi_reorderLogical()
813 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderVisual() argument
817 if(indexMap==nullptr || !prepareReorder(levels, length, indexMap, in ubidi_reorderVisual()
710 prepareReorder(const UBiDiLevel *levels, int32_t length, int32_t *indexMap, UBiDiLevel *pMinLevel, UBiDiLevel *pMaxLevel) prepareReorder() argument
1110 ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode) ubidi_getLogicalMap() argument
1211 ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode) ubidi_getVisualMap() argument
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dubidiln.cpp711 int32_t *indexMap, in prepareReorder()
741 indexMap[start]=start; in prepareReorder()
750 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderLogical() argument
754 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) { in ubidi_reorderLogical()
799 indexMap[start]=sumOfSosEos-indexMap[start]; in ubidi_reorderLogical()
813 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderVisual() argument
817 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, in ubidi_reorderVisual()
710 prepareReorder(const UBiDiLevel *levels, int32_t length, int32_t *indexMap, UBiDiLevel *pMinLevel, UBiDiLevel *pMaxLevel) prepareReorder() argument
1110 ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode) ubidi_getLogicalMap() argument
1211 ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode) ubidi_getVisualMap() argument
[all...]
/third_party/skia/tests/
H A DPolyUtilsTest.cpp14 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, pol in DEF_TEST()
[all...]
/third_party/skia/fuzz/
H A DFuzzPolyUtils.cpp38 SkAutoSTMalloc<64, uint16_t> indexMap(count); in DEF_FUZZ()
40 fuzz->next(&indexMap[index]); in DEF_FUZZ()
43 ignoreResult(SkTriangulateSimplePolygon(polygon, indexMap, count, &outputIndices)); in DEF_FUZZ()
/third_party/icu/icu4c/source/common/unicode/
H A Dubidi.h1709 * @param indexMap is a pointer to an array of <code>ubidi_getProcessedLength()</code>
1712 * of elements allocated in <code>indexMap</code> must be no less than
1715 * The index map will result in <code>indexMap[logicalIndex]==visualIndex</code>.
1726 ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode);
1745 * @param indexMap is a pointer to an array of <code>ubidi_getResultLength()</code>
1748 * of elements allocated in <code>indexMap</code> must be no less than
1751 * The index map will result in <code>indexMap[visualIndex]==logicalIndex</code>.
1762 ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode);
1778 * @param indexMap is a pointer to an array of <code>length</code>
1781 * The index map will result in <code>indexMap[logicalInde
[all...]
/third_party/node/deps/icu-small/source/common/unicode/
H A Dubidi.h1709 * @param indexMap is a pointer to an array of <code>ubidi_getProcessedLength()</code>
1712 * of elements allocated in <code>indexMap</code> must be no less than
1715 * The index map will result in <code>indexMap[logicalIndex]==visualIndex</code>.
1726 ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode);
1745 * @param indexMap is a pointer to an array of <code>ubidi_getResultLength()</code>
1748 * of elements allocated in <code>indexMap</code> must be no less than
1751 * The index map will result in <code>indexMap[visualIndex]==logicalIndex</code>.
1762 ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode);
1778 * @param indexMap is a pointer to an array of <code>length</code>
1781 * The index map will result in <code>indexMap[logicalInde
[all...]
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Dubidi.h1708 * @param indexMap is a pointer to an array of <code>ubidi_getProcessedLength()</code>
1711 * of elements allocated in <code>indexMap</code> must be no less than
1714 * The index map will result in <code>indexMap[logicalIndex]==visualIndex</code>.
1725 ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode);
1744 * @param indexMap is a pointer to an array of <code>ubidi_getResultLength()</code>
1747 * of elements allocated in <code>indexMap</code> must be no less than
1750 * The index map will result in <code>indexMap[visualIndex]==logicalIndex</code>.
1761 ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode);
1777 * @param indexMap is a pointer to an array of <code>length</code>
1780 * The index map will result in <code>indexMap[logicalInde
[all...]
/third_party/skia/bench/
H A DPolyUtilsBench.cpp87 SkAutoSTMalloc<64, uint16_t> indexMap(poly.count());
89 indexMap[i] = i;
93 SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),
/third_party/skia/src/utils/
H A DSkPolyUtils.h101 * @param indexMap Mapping from index in the given array to the final index in the triangulation.
106 bool SkTriangulateSimplePolygon(const SkPoint* polygonVerts, uint16_t* indexMap, int polygonSize,
H A DSkShadowTessellator.cpp593 // TODO: only create and fill indexMap when fTransparent is true? in stitchConcaveRings()
594 SkAutoSTMalloc<64, uint16_t> indexMap(umbraPolygon.count()); in stitchConcaveRings()
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()
H A DSkPolyUtils.cpp1602 bool SkTriangulateSimplePolygon(const SkPoint* polygonVerts, uint16_t* indexMap, int polygonSize, in SkTriangulateSimplePolygon() argument
1717 indices[0] = indexMap[p0->fIndex]; in SkTriangulateSimplePolygon()
1718 indices[1] = indexMap[earVertex->fIndex]; in SkTriangulateSimplePolygon()
1719 indices[2] = indexMap[p2->fIndex]; in SkTriangulateSimplePolygon()
1737 *triangleIndices->push() = indexMap[vertex->fIndex]; in SkTriangulateSimplePolygon()
/third_party/ffmpeg/libavcodec/
H A Dtexturedspenc.c184 static const uint32_t indexMap[8] = { in match_colors() local
230 mask |= indexMap[bits]; in match_colors()
/third_party/icu/ohos_icu4c/src/
H A Dicu_addon.cpp775 void ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode) in ubidi_getLogicalMap() argument
777 U_ICU_ENTRY_POINT_RENAME(ubidi_getLogicalMap)(pBiDi, indexMap, pErrorCode); in ubidi_getLogicalMap()
823 void ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode) in ubidi_getVisualMap() argument
825 U_ICU_ENTRY_POINT_RENAME(ubidi_getVisualMap)(pBiDi, indexMap, pErrorCode); in ubidi_getVisualMap()
855 void ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) in ubidi_reorderLogical() argument
857 U_ICU_ENTRY_POINT_RENAME(ubidi_reorderLogical)(levels, length, indexMap); in ubidi_reorderLogical()
859 void ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) in ubidi_reorderVisual() argument
861 U_ICU_ENTRY_POINT_RENAME(ubidi_reorderVisual)(levels, length, indexMap); in ubidi_reorderVisual()
/third_party/skia/third_party/externals/sfntly/java/lib/
H A Dicu4j-4_8_1_1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/ibm/ com/ibm/icu/ com/ibm/icu/impl/ ...

Completed in 44 milliseconds