HomeSort by relevance Sort by last modified time
    Searched full:indices (Results 1 - 25 of 809) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/icu4c/layout/
CanonShaping.cpp 15 void CanonShaping::sortMarks(le_int32 *indices, const le_int32 *combiningClasses, le_int32 index, le_int32 limit)
19 le_int32 v = indices[j];
23 if (c >= combiningClasses[indices[i]]) {
27 indices[i + 1] = indices[i];
30 indices[i + 1] = v;
40 le_int32 *indices = LE_NEW_ARRAY(le_int32, charCount); local
46 indices[i] = i;
59 sortMarks(indices, combiningClasses, i, mark);
71 le_int32 index = indices[i]
    [all...]
CanonShaping.h 26 static void sortMarks(le_int32 *indices, const le_int32 *combiningClasses, le_int32 index, le_int32 limit);
LEGlyphFilter.h 16 * recognize a set of glyph indices.
  /external/chromium/net/base/
load_log_unittest.h 23 int i, // Negative indices are reverse indices.
28 // Negative indices are reverse indices.
60 int i, // Negative indices are reverse indices.
71 int i, // Negative indices are reverse indices.
81 int i, // Negative indices are reverse indices
    [all...]
  /development/samples/GlobalTime/src/com/android/globaltime/
Annulus.java 59 short[] indices = new short[2 * 3 * radii]; local
90 indices[iidx++] = (short) (2 * i);
91 indices[iidx++] = (short) (2 * i + 1);
92 indices[iidx++] = (short) (2 * i + 2);
94 indices[iidx++] = (short) (2 * i + 1);
95 indices[iidx++] = (short) (2 * i + 3);
96 indices[iidx++] = (short) (2 * i + 2);
99 allocateBuffers(vertices, null, null, colors, indices);
LatLongSphere.java 35 short[] indices = new short[3 * tris]; local
106 indices[iidx++] = (short) (base);
107 indices[iidx++] = (short) (base + 1);
108 indices[iidx++] = (short) (base + lats + 1);
110 indices[iidx++] = (short) (base + lats);
111 indices[iidx++] = (short) (base);
112 indices[iidx++] = (short) (base + lats + 1);
116 allocateBuffers(vertices, texcoords, normals, colors, indices);
PointCloud.java 48 short[] indices = new short[numPoints]; local
50 indices[i] = (short)i;
53 allocateBuffers(vertices, null, null, null, indices);
Shape.java 30 * containing vertices, texture coordinates, colors, normals, and indices.
154 * @param indices an array of short indices
157 int[] colors, short[] indices) {
161 ByteBuffer.allocateDirect(indices.length * SHORT_BYTES);
164 shortIndexBuffer.put(indices);
178 * @param indices an array of int indices
181 int[] colors, int[] indices) {
185 ByteBuffer.allocateDirect(indices.length * INT_BYTES)
    [all...]
  /external/skia/include/utils/
SkMeshUtils.h 20 bool init(SkPoint tex[], uint16_t indices[],
24 const uint16_t* indices() const { return fIndices; } function in class:SkMeshIndices
  /external/proguard/src/proguard/gui/
ListPanel.java 228 protected void moveElementsAt(int[] indices, int offset)
234 removeElementsAt(indices);
236 // Update the element indices.
237 for (int index = 0; index < indices.length; index++)
239 indices[index] += offset;
243 insertElementsAt(selectedElements, indices);
247 protected void insertElementsAt(Object[] elements, int[] indices)
251 listModel.insertElementAt(elements[index], indices[index]);
255 list.setSelectedIndices(indices);
268 protected void setElementsAt(Object[] elements, int[] indices)
    [all...]
  /frameworks/base/opengl/java/android/opengl/
Visibility.java 35 * @param indices the indices of the triangle list. The indices are
37 * @param indicesOffset the index in the indices array where the index data
39 * @param indexCount the number of indices in use. Typically a multiple of
40 * three. If not a multiple of three, the remaining one or two indices will
46 * positions is null, positionsOffset < 0, indices is null,
47 * indicesOffset < 0, indicesOffset > indices.length - indexCount
50 float[] positions, int positionsOffset, char[] indices,
86 * @param results an integer array containing the indices of the sphere
    [all...]
  /frameworks/base/media/libstagefright/codecs/amrwbenc/src/
dtx.c 39 Word16 indices[],
45 Word16 indices[],
381 Word16 indices[],
393 if ((indices[k] + 1) != 0)
397 isf_tmp[k * M + i] = isf_old[indices[k] * M + i];
398 isf_old[indices[k] * M + i] = isf_old[indices[2] * M + i];
418 if ((indices[k] + 1) != 0)
422 isf_old[indices[k] * M + i] = isf_tmp[k * M + i];
432 Word16 indices[],
    [all...]
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
KeyDetector.java 78 * Allocates array that can hold all key indices returned by {@link #getKeyIndexAndNearbyCodes}
81 * @return Allocates and returns an array that can hold all key indices returned by
93 * Computes maximum size of the array that can contain all nearby key indices returned by
96 * @return Returns maximum size of the array that can contain all nearby key indices returned
102 * Finds all possible nearby key indices around a touch event point and returns the nearest key
109 * @param allKeys All nearby key indices are returned in this array
  /external/icu4c/layoutex/layout/
RunArrays.h 43 * maintains an array of limit indices into the text, subclasses
53 * array of limit indices.
55 * @param limits is an array of limit indices. This array must remain
66 * indices array using the <code>add</code> method.
68 * @param initialCapacity is the initial size of the limit indices array. If
85 * Get the number of entries in the limit indices array.
87 * @return the number of entries in the limit indices array.
94 * Reset the limit indices array. This method sets the number of entries in the
95 * limit indices array to zero. It does not delete the array.
125 * Add a limit index to the limit indices array and return the run inde
    [all...]
plruns.h 40 * and limit indices.
46 * @param limits is the address of an array of limit indices. This array must remain valid until
60 * indices arrays using the <code>pl_addFontRun</code> routine.
62 * @param initialCapacity is the initial size of the font and limit indices arrays. If
88 * @return the number of entries in the limit indices array.
138 * @param run is the index into the font and limit indices arrays.
174 * and limit indices.
179 * @param limits is the address of an array of limit indices. This array must remain valid until
195 * @param initialCapacity is the initial size of the value and limit indices arrays. If
306 * and limit indices
    [all...]
  /external/skia/src/utils/
SkMeshUtils.cpp 13 bool SkMeshIndices::init(SkPoint tex[], uint16_t indices[],
34 fIndices = indices;
42 // compute the indices
93 idx.indices(), idx.indexCount(), p);
SkNinePatch.cpp 35 static int fillIndices(uint16_t indices[], int xCount, int yCount) {
36 uint16_t* startIndices = indices;
41 *indices++ = n;
42 *indices++ = n + xCount + 2;
43 *indices++ = n + 1;
45 *indices++ = n;
46 *indices++ = n + xCount + 1;
47 *indices++ = n + xCount + 2;
53 return indices - startIndices;
173 // allocate 2 times, one for verts, one for texs, plus indices
178 uint16_t* indices = (uint16_t*)(texs + vCount); local
    [all...]
  /frameworks/base/graphics/java/android/graphics/
DashPathEffect.java 23 * the even indices specifying the "on" intervals, and the odd indices
  /external/iproute2/tc/
q_dsmark.c 27 fprintf(stderr,"Usage: dsmark indices INDICES [ default_index "
43 if (!strcmp(*argv,"indices")) {
156 fprintf(stderr,"dsmark: indices too short\n");
157 else fprintf(f,"indices 0x%04x ",
  /frameworks/base/tools/aapt/
StringPool.h 44 entry(const entry& o) : value(o.value), offset(o.offset), indices(o.indices) { }
48 Vector<size_t> indices; member in struct:StringPool::entry
132 // Array of indices into mEntries, in the order they were
140 // Mapping from indices in mEntryArray to indices in mValues.
146 // pool, mapping to indices in mEntries.
  /cts/tests/tests/graphics/src/android/graphics/cts/
Canvas_VertexModeTest.java 60 short[] indices = { 0, 1, 2, 3, 4, 1 }; local
74 indices,
87 indices,
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/
Cube.java 55 byte indices[] = {
84 mIndexBuffer = ByteBuffer.allocateDirect(indices.length);
85 mIndexBuffer.put(indices);
  /development/samples/BrowserPlugin/src/com/android/sampleplugin/graphics/
Cube.java 55 byte indices[] = {
84 mIndexBuffer = ByteBuffer.allocateDirect(indices.length);
85 mIndexBuffer.put(indices);
  /external/chromium/third_party/icu/source/test/letest/
letest.h 39 le_int32 *indices; member in struct:TestResult
  /external/icu4c/test/letest/
letest.h 39 le_int32 *indices; member in struct:TestResult

Completed in 1442 milliseconds

1 2 3 4 5 6 7 8 91011>>