Searched defs:indices (Results 1 - 25 of 106) sorted by relevance

12345

/external/v8/test/mjsunit/
H A Dstring-indexof-1.js117 var indices = [0x5, 0x65, 0x85, 0x105, 0x205, 0x285, 0x2005, 0x2085, 0xfff0]; variable
120 for (var i = 0; i < indices.length; i++) {
121 var index = indices[i];
/external/webkit/Source/WebCore/platform/graphics/chromium/
H A DGeometryBinding.cpp49 uint16_t indices[] = { 0, 1, 2, 0, 2, 3, // The two triangles that make up the layer quad. local
57 GLC(m_context, m_context->bufferData(GraphicsContext3D::ELEMENT_ARRAY_BUFFER, sizeof(indices), indices, GraphicsContext3D::STATIC_DRAW));
/external/harfbuzz_ng/src/hb-icu-le/
H A Dletest.h51 le_int32 *indices; member in struct:TestResult
/external/icu4c/test/letest/
H A Dletest.h39 le_int32 *indices; member in struct:TestResult
H A Dgendata.cpp165 le_int32 *indices = NULL; local
260 indices = NEW_ARRAY(le_int32, glyphCount);
264 engine->getCharIndices(indices, leStatus);
269 dumpLongs(outputFile, "result-indices", indices, glyphCount);
276 DELETE_ARRAY(indices);
H A Dxmlreader.cpp150 UnicodeString result_indices = UNICODE_STRING_SIMPLE("result-indices");
180 UnicodeString text, glyphs, indices, positions; local
214 indices = element->getText(TRUE);
227 expected.indices = (le_int32 *) getHexArray(indices, indexCount);
242 DELETE_ARRAY(expected.indices);
/external/jmonkeyengine/engine/src/tools/jme3tools/converters/model/strip/
H A DPrimitiveGroup.java45 public int[] indices; field in class:PrimitiveGroup
74 if (indices[i] == prev) {
79 prev = indices[i];
99 if ( indices.length == numIndices )
100 return indices;
102 System.arraycopy(indices,0,nind,0,numIndices);
H A DTriStrip.java47 * <li>can remap indices to improve spatial locality in your vertex buffers.
120 * input index list, the indices you would use to render
155 //count the total number of indices
165 primGroupArray[0].indices = new int[numIndices];
174 primGroupArray[0].indices[indexCtr++] = tempStrips.at(i).m_faces.at(j).m_v0;
175 primGroupArray[0].indices[indexCtr++] = tempStrips.at(i).m_faces.at(j).m_v1;
176 primGroupArray[0].indices[indexCtr++] = tempStrips.at(i).m_faces.at(j).m_v2;
178 //we've removed a tri, reduce the number of indices
186 primGroupArray[0].indices[indexCtr++] = tempFaces.at(i).m_v0;
187 primGroupArray[0].indices[indexCt
272 remapIndices(int[] indices, int numVerts) argument
297 remapArrays(float[] vertexBuffer, int vertexSize, int[] indices) argument
[all...]
/external/freetype/src/psaux/
H A Dt1cmap.h75 FT_UShort* indices; member in struct:T1_CMapCustomRec_
/external/icu4c/layout/
H A DCanonShaping.cpp15 void CanonShaping::sortMarks(le_int32 *indices, const le_int32 *combiningClasses, le_int32 index, le_int32 limit) argument
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[
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/animation/
H A DPose.java50 private int[] indices; field in class:Pose
55 public Pose(String name, int targetMeshIndex, Vector3f[] offsets, int[] indices){ argument
59 this.indices = indices;
74 for (int i = 0; i < indices.length; i++){
76 int vertIndex = indices[i];
98 result.indices = this.indices.clone();
116 out.write(indices, "indices", nul
[all...]
/external/skia/include/utils/
H A DSkMeshUtils.h27 bool init(SkPoint tex[], uint16_t indices[],
31 const uint16_t* indices() const { return fIndices; } function in class:SkMeshIndices
/external/skia/legacy/include/utils/
H A DSkMeshUtils.h27 bool init(SkPoint tex[], uint16_t indices[],
31 const uint16_t* indices() const { return fIndices; } function in class:SkMeshIndices
/external/skia/legacy/src/utils/
H A DSkMeshUtils.cpp20 bool SkMeshIndices::init(SkPoint tex[], uint16_t indices[], argument
41 fIndices = indices;
49 // compute the indices
100 idx.indices(), idx.indexCount(), p);
/external/skia/src/utils/
H A DSkMeshUtils.cpp20 bool SkMeshIndices::init(SkPoint tex[], uint16_t indices[], argument
41 fIndices = indices;
49 // compute the indices
100 idx.indices(), idx.indexCount(), p);
/external/ceres-solver/internal/ceres/
H A Dparameter_block_test.cc43 // The indices to set constant within the parameter block (used later).
44 vector<int> indices; local
45 indices.push_back(1);
48 SubsetParameterization subset_wrong_size(4, indices);
57 SubsetParameterization subset(3, indices);
67 SubsetParameterization subset_different(3, indices);
/external/eigen/demos/opengl/
H A Dicosphere.cpp42 std::vector<int>& indices = *mIndices.back(); local
46 indices.push_back(tindices[i][k]);
54 const std::vector<int>& IcoSphere::indices(int level) const function in class:IcoSphere
65 const std::vector<int>& indices = *mIndices.back(); local
68 int end = indices.size();
71 int ids0[3], // indices of outer vertices
72 ids1[3]; // indices of edge vertices
76 int e0 = indices[i+k];
77 int e1 = indices[i+k1];
/external/webkit/Source/WebCore/platform/graphics/gpu/
H A DLoopBlinnLocalTriangulator.cpp156 int indices[3] = { 0 }; local
160 indices[index++] = k;
161 addTriangle(&m_vertices[indices[0]],
162 &m_vertices[indices[1]],
163 &m_vertices[indices[2]]);
172 int indices[3] = { 0 }; local
176 indices[index++] = j;
178 m_vertices[indices[0]].xyCoordinates(),
179 m_vertices[indices[1]].xyCoordinates(),
180 m_vertices[indices[
[all...]
/external/llvm/lib/CodeGen/
H A DSpiller.cpp106 SmallVector<unsigned, 2> indices; local
115 indices.push_back(i);
123 for (unsigned i = 0; i < indices.size(); ++i) {
124 unsigned mopIdx = indices[i];
/external/proguard/src/proguard/gui/
H A DClassPathPanel.java281 private void setFiltersAt(int[] indices) argument
283 for (int index = indices.length - 1; index >= 0; index--)
285 ClassPathEntry entry = (ClassPathEntry)listModel.get(indices[index]);
294 list.setSelectedIndices(indices);
H A DListPanel.java228 protected void moveElementsAt(int[] indices, int offset) argument
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) argument
251 listModel.insertElementAt(elements[index], indices[index]);
255 list.setSelectedIndices(indices);
268 protected void setElementsAt(Object[] elements, int[] indices) argument
280 removeElementsAt(int[] indices) argument
[all...]
/external/eigen/Eigen/src/Core/
H A DTranspositions.h24 * \f$[T_{n-1} \ldots T_{i} \ldots T_{0}]\f$. It is internally stored as a vector of integers \c indices.
26 * the rows \c i and \c indices[i] of the matrix \c M.
65 indices() = other.indices();
75 indices() = other.indices();
81 inline Index size() const { return indices().size(); }
84 inline const Index& coeff(Index i) const { return indices().coeff(i); }
86 inline Index& coeffRef(Index i) { return indices().coeffRef(i); }
88 inline const Index& operator()(Index i) const { return indices()(
97 const IndicesType& indices() const { return derived().indices(); } function in class:Eigen::TranspositionsBase
99 IndicesType& indices() { return derived().indices(); } function in class:Eigen::TranspositionsBase
180 Transpositions(const MatrixBase<Other>& indices) argument
207 const IndicesType& indices() const { return m_indices; } function in class:Eigen::Transpositions
209 IndicesType& indices() { return m_indices; } function in class:Eigen::Transpositions
237 Map(const Index* indices) argument
241 Map(const Index* indices, Index size) argument
264 const IndicesType& indices() const { return m_indices; } function in class:Eigen::Map
267 IndicesType& indices() { return m_indices; } function in class:Eigen::Map
294 TranspositionsWrapper(IndicesType& indices) argument
317 const IndicesType& indices() const { return m_indices; } function in class:Eigen::TranspositionsWrapper
320 IndicesType& indices() { return m_indices; } function in class:Eigen::TranspositionsWrapper
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DCompressedStorage.h18 * Stores a sparse set of values as a list of values and a list of indices.
111 static CompressedStorage Map(Index* indices, Scalar* values, size_t size) argument
114 res.m_indices = indices;
/external/freetype/src/cache/
H A Dftccmap.c75 /* codes to equivalent glyph indices. */
78 /* 128 consecutive character codes to their corresponding glyph indices. */
86 /* number of glyph indices / character code per node */
114 FT_UInt16 indices[FTC_CMAP_INDICES_MAX]; /* array of glyph indices */ member in struct:FTC_CMapNodeRec_
122 /* if (indices[n] == FTC_CMAP_UNKNOWN), we assume that the corresponding */
123 /* glyph indices haven't been queried through FT_Get_Glyph_Index() yet */
170 node->indices[nn] = FTC_CMAP_UNKNOWN;
390 gindex = FTC_CMAP_NODE( node )->indices[char_code -
428 FTC_CMAP_NODE( node )->indices[char_cod
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/util/
H A DTangentBinormalGenerator.java70 public final ArrayList<Integer> indices = new ArrayList<Integer>(); field in class:TangentBinormalGenerator.VertexInfo
412 vertexInfo.indices.add(i);
420 vertexInfo.indices.add(i);
454 TriangleData firstTriangle = vertices[vertexInfo.indices.get(0)].triangles.get(0);
462 for (int i : vertexInfo.indices) {
496 for (int i : vertexInfo.indices) {
521 int blameVertex = vertexInfo.indices.get(0);
578 for (int i : vertexInfo.indices) {

Completed in 668 milliseconds

12345