HomeSort by relevance Sort by last modified time
    Searched refs:indices (Results 1 - 25 of 469) 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);
  /external/jmonkeyengine/engine/src/core/com/jme3/animation/
Pose.java 50 private int[] indices; field in class:Pose
55 public Pose(String name, int targetMeshIndex, Vector3f[] offsets, int[] indices){
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", null)
    [all...]
  /frameworks/ml/bordeaux/learning/multiclass_pa/jni/
jni_multiclass_pa.cpp 26 void CreateIndexValuePairs(const int* indices, const float* values,
31 pair<int, float> new_pair(indices[i], values[i]);
67 jint* indices = env->GetIntArrayElements(index_array, NULL); local
71 if (values && indices && value_len == index_len) {
74 CreateIndexValuePairs(indices, values, value_len, &inputs);
76 env->ReleaseIntArrayElements(index_array, indices, JNI_ABORT);
81 env->ReleaseIntArrayElements(index_array, indices, JNI_ABORT);
100 jint* indices = env->GetIntArrayElements(index_array, NULL); local
104 if (values && indices && value_len == index_len) {
106 CreateIndexValuePairs(indices, values, value_len, &inputs)
    [all...]
  /external/eigen/Eigen/src/Core/
Transpositions.h 24 * \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()(i);
97 const IndicesType& indices() const { return derived().indices(); } function in class:Eigen::TranspositionsBase
99 IndicesType& indices() { return derived().indices(); } function in class:Eigen::TranspositionsBase
207 const IndicesType& indices() const { return m_indices; } function in class:Eigen::Transpositions
209 IndicesType& indices() { return m_indices; } function in class:Eigen::Transpositions
264 const IndicesType& indices() const { return m_indices; } function in class:Eigen::Map
267 IndicesType& indices() { return m_indices; } function in class:Eigen::Map
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...]
PermutationMatrix.h 82 indices() = other.indices();
102 indices() = other.indices();
108 inline Index rows() const { return indices().size(); }
111 inline Index cols() const { return indices().size(); }
113 /** \returns the size of a side of the respective square matrix, i.e., the number of indices */
114 inline Index size() const { return indices().size(); }
122 other.coeffRef(indices().coeff(i),i) = typename DenseDerived::Scalar(1);
135 /** const version of indices(). *
136 const IndicesType& indices() const { return derived().indices(); } function in class:Eigen::PermutationBase
138 IndicesType& indices() { return derived().indices(); } function in class:Eigen::PermutationBase
358 const IndicesType& indices() const { return m_indices; } function in class:Eigen::PermutationMatrix
360 IndicesType& indices() { return m_indices; } function in class:Eigen::PermutationMatrix
439 const IndicesType& indices() const { return m_indices; } function in class:Eigen::Map
441 IndicesType& indices() { return m_indices; } function in class:Eigen::Map
499 indices() const { return m_indices; } function in class:Eigen::PermutationWrapper
    [all...]
  /frameworks/native/opengl/tools/glgen/stubs/gles11/
glDrawElementsInstanced.java 1 // C function void glDrawElementsInstanced ( GLenum mode, GLsizei count, GLenum type, const GLvoid *indices, GLsizei instanceCount )
7 java.nio.Buffer indices,
11 // C function void glDrawElementsInstanced ( GLenum mode, GLsizei count, GLenum type, const GLvoid *indices, GLsizei instanceCount )
glDrawElementsInstanced.cpp 1 /* void glDrawElementsInstanced ( GLenum mode, GLsizei count, GLenum type, const GLvoid *indices, GLsizei instanceCount ) */
8 GLvoid *indices = (GLvoid *) 0; local
10 indices = (GLvoid *)getPointer(_env, indices_buf, &_array, &_remaining, &_bufferOffset);
11 if (indices == NULL) {
13 indices = (GLvoid *) (_indicesBase + _bufferOffset);
19 (GLvoid *)indices,
23 releasePointer(_env, _array, indices, JNI_FALSE);
27 /* void glDrawElementsInstanced ( GLenum mode, GLsizei count, GLenum type, const GLvoid *indices, GLsizei instanceCount ) */
  /external/jmonkeyengine/engine/src/tools/jme3tools/converters/model/strip/
PrimitiveGroup.java 45 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);
TriStrip.java 47 * <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[indexCtr++] = tempFaces.at(i).m_v1;
    [all...]
  /frameworks/base/core/java/com/android/internal/widget/
PasswordEntryKeyboardView.java 43 int[] indices = getKeyboard().getShiftKeyIndices(); local
44 for (int index : indices) {
  /cts/suite/audio_quality/test/
TaskSequentialTest.cpp 53 std::list<TaskCase::IndexPair>* indices = mTestCase->findAllIndices(RE); local
54 ASSERT_TRUE(indices != NULL);
55 ASSERT_TRUE(indices->size() == 1);
60 delete indices;
  /external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/
Curve.java 99 short[] indices = new short[(spline.getControlPoints().size() - 1) * nbSubSegments * 2]; local
128 indices[i] = (short) k;
131 indices[i] = (short) k;
137 this.setBuffer(VertexBuffer.Type.Index, 2, indices);//(spline.getControlPoints().size() - 1) * nbSubSegments * 2
179 short[] indices = new short[(centerPointsAmount - 1) * nbSubSegments << 1]; local
182 indices[i++] = (short) k;
184 indices[i++] = (short) k;
189 this.setBuffer(VertexBuffer.Type.Index, 2, indices);
218 short[] indices = new short[nbSubSegments << 1]; local
220 indices[i++] = (short) j
233 short[] indices = new short[(spline.getControlPoints().size() - 1) * 2]; local
    [all...]
Surface.java 106 int[] indices = new int[uSegments * vSegments * 6]; local
110 indices[arrayIndex++] = j + i * uVerticesAmount;
111 indices[arrayIndex++] = j + i * uVerticesAmount + 1;
112 indices[arrayIndex++] = j + i * uVerticesAmount + uVerticesAmount;
113 indices[arrayIndex++] = j + i * uVerticesAmount + 1;
114 indices[arrayIndex++] = j + i * uVerticesAmount + uVerticesAmount + 1;
115 indices[arrayIndex++] = j + i * uVerticesAmount + uVerticesAmount;
121 for (int i = 0; i < indices.length; i += 3) {
122 Vector3f n = FastMath.computeNormal(vertices[indices[i]], vertices[indices[i + 1]], vertices[indices[i + 2]]);
    [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...]
  /external/eigen/test/eigen2/
eigen2_prec_inverse_4x4.cpp 33 Vector4i indices(0,1,2,3);
37 m(indices(0),0) = 1;
38 m(indices(1),1) = 1;
39 m(indices(2),2) = 1;
40 m(indices(3),3) = 1;
44 std::next_permutation(indices.data(),indices.data()+4);
  /external/ceres-solver/internal/ceres/
parameter_block_test.cc 43 // 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/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/av/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...]
  /external/webkit/Source/ThirdParty/ANGLE/src/libGLESv2/geometry/
IndexDataManager.cpp 70 void computeRange(const IndexType *indices, GLsizei count, GLuint *minIndex, GLuint *maxIndex)
72 *minIndex = indices[0];
73 *maxIndex = indices[0];
77 if (*minIndex > indices[i]) *minIndex = indices[i];
78 if (*maxIndex < indices[i]) *maxIndex = indices[i];
82 void computeRange(GLenum type, const void *indices, GLsizei count, GLuint *minIndex, GLuint *maxIndex)
86 computeRange(static_cast<const GLubyte*>(indices), count, minIndex, maxIndex);
90 computeRange(static_cast<const GLuint*>(indices), count, minIndex, maxIndex)
    [all...]
  /external/chromium/chrome/browser/tabs/
tab_strip_model.cc 726 std::vector<int> indices = GetIndicesForCommand(context_index); local
727 for (size_t i = 0; i < indices.size(); ++i) {
728 TabContentsWrapper* tab = GetTabContentsAt(indices[i]);
742 std::vector<int> indices = GetIndicesForCommand(context_index); local
743 for (size_t i = 0; i < indices.size(); ++i) {
744 if (delegate_->CanDuplicateContentsAt(indices[i]))
754 std::vector<int> indices = GetIndicesForCommand(context_index); local
755 for (size_t i = 0; i < indices.size(); ++i) {
756 if (!IsAppTab(indices[i]))
805 std::vector<int> indices = GetIndicesForCommand(context_index) local
819 std::vector<int> indices = GetIndicesForCommand(context_index); local
836 std::vector<int> indices = GetIndicesForCommand(context_index); local
881 std::vector<int> indices = GetIndicesForCommand(context_index); local
919 std::vector<int> indices; local
955 std::vector<int> indices; local
964 std::vector<int> indices = GetIndicesForCommand(index); local
1088 std::vector<int> indices; local
    [all...]
  /external/skia/include/utils/
SkMeshUtils.h 27 bool init(SkPoint tex[], uint16_t indices[],
31 const uint16_t* indices() const { return fIndices; } function in class:SkMeshIndices
  /external/skia/legacy/include/utils/
SkMeshUtils.h 27 bool init(SkPoint tex[], uint16_t indices[],
31 const uint16_t* indices() const { return fIndices; } function in class:SkMeshIndices
  /sdk/emulator/opengl/host/libs/Translator/GLES_V2/
GLESv2Context.h 32 void setupArraysPointers(GLESConversionArrays& fArrs,GLint first,GLsizei count,GLenum type,const GLvoid* indices,bool direct);
45 bool needConvert(GLESConversionArrays& fArrs,GLint first,GLsizei count,GLenum type,const GLvoid* indices,bool direct,GLESpointer* p,GLenum array_id);
  /device/generic/goldfish/opengl/shared/OpenglCodecCommon/
glUtils.h 66 template <class T> void minmax(T *indices, int count, int *min, int *max) {
69 T *ptr = indices;
77 template <class T> void shiftIndices(T *indices, int count, int offset) {
78 T *ptr = indices;

Completed in 794 milliseconds

1 2 3 4 5 6 7 8 91011>>