HomeSort by relevance Sort by last modified time
    Searched refs:m_indices (Results 1 - 25 of 30) sorted by null

1 2

  /external/deqp/external/vulkancts/modules/vulkan/pipeline/
vktPipelineUniqueRandomIterator.hpp 51 std::vector<deUint32> m_indices; member in class:vkt::pipeline::UniqueRandomIterator
65 m_indices = std::vector<deUint32>(numItems);
68 m_indices[itemNdx] = itemNdx;
79 m_indices = std::vector<deUint32>(uniqueIndices.begin(), uniqueIndices.end());
83 rnd.shuffle(m_indices.begin(), m_indices.end());
91 return m_currentIndex < m_indices.size();
97 DE_ASSERT(m_currentIndex < m_indices.size());
99 return getIndexedValue(m_indices[m_currentIndex++]);
vktPipelineInputAssemblyTests.cpp 159 std::vector<deUint32> m_indices; member in class:vkt::pipeline::__anon8950::InputAssemblyInstance
918 , m_indices (indexBufferData)
    [all...]
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/
btShapeHull.h 33 btAlignedObjectArray<unsigned int> m_indices; variable
57 return &m_indices[0];
btConvexPolyhedron.h 31 btAlignedObjectArray<int> m_indices; member in struct:btFace
btConvexPolyhedron.cpp 111 int numVertices = m_faces[i].m_indices.size();
116 btInternalVertexPair vp(m_faces[i].m_indices[j],m_faces[i].m_indices[k]);
156 int numVertices = m_faces[i].m_indices.size();
162 btInternalVertexPair vp(m_faces[i].m_indices[j],m_faces[i].m_indices[k]);
176 int numVertices = m_faces[i].m_indices.size();
179 const btVector3& p0 = m_vertices[m_faces[i].m_indices[0]];
183 const btVector3& p1 = m_vertices[m_faces[i].m_indices[j]];
184 const btVector3& p2 = m_vertices[m_faces[i].m_indices[k]]
    [all...]
btShapeHull.cpp 28 m_indices.clear();
34 m_indices.clear();
90 m_indices.resize(static_cast<int>(m_numIndices));
93 m_indices[i] = hr.m_Indices[i];
btPolyhedralConvexShape.cpp 124 tmpFaces[i].m_indices.push_back(src);
156 for (int v=0;v<tmpFaces[i].m_indices.size();v++)
158 btScalar eq = m_polyhedron->m_vertices[tmpFaces[i].m_indices[v]].dot(faceNormals[i]);
212 for (int f=0;f<face.m_indices.size();f++)
214 int orgIndex = face.m_indices[f];
246 combinedFace.m_indices.push_back(hull[i].m_orgIndex);
280 for(int v = 0; v < face.m_indices.size(); v++) {
281 if(face.m_indices[v] == orgpoints[i].m_orgIndex) {
  /external/eigen/Eigen/src/SparseCore/
CompressedStorage.h 36 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
40 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
46 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
55 internal::smart_copy(other.m_indices, other.m_indices + m_size, m_indices);
62 std::swap(m_indices, other.m_indices);
70 delete[] m_indices;
98 m_indices[id] = i
223 Index* m_indices; member in class:Eigen::internal::CompressedStorage
    [all...]
SparseMatrix.h 873 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer), m_id(mat.m_outerIndex[outer])
886 inline Index index() const { return m_indices[m_id]; }
895 const Index* m_indices; member in class:Eigen::SparseMatrix::InnerIterator
928 const Index* m_indices; member in class:Eigen::SparseMatrix::ReverseInnerIterator
    [all...]
  /external/eigen/Eigen/src/Core/
Transpositions.h 122 if(m_indices(k)!=k)
123 mat.row(k).swap(mat.row(m_indices(k)));
130 if(m_indices(k)!=k)
131 mat.row(k).swap(mat.row(m_indices(k)));
170 : m_indices(other.indices()) {}
175 inline Transpositions(const Transpositions& other) : m_indices(other.indices()) {}
180 explicit inline Transpositions(const MatrixBase<Other>& a_indices) : m_indices(a_indices)
196 m_indices = other.m_indices;
203 inline Transpositions(Index size) : m_indices(size
213 IndicesType m_indices; member in class:Eigen::Transpositions
271 IndicesType m_indices; member in class:Eigen::Map
324 const typename IndicesType::Nested m_indices; member in class:Eigen::TranspositionsWrapper
    [all...]
PermutationMatrix.h 327 inline PermutationMatrix(int size) : m_indices(size)
333 : m_indices(other.indices()) {}
338 inline PermutationMatrix(const PermutationMatrix& other) : m_indices(other.indices()) {}
349 explicit inline PermutationMatrix(const MatrixBase<Other>& a_indices) : m_indices(a_indices)
355 : m_indices(tr.size())
364 m_indices = other.indices();
381 m_indices = other.m_indices;
387 const IndicesType& indices() const { return m_indices; }
389 IndicesType& indices() { return m_indices; }
411 IndicesType m_indices; member in class:Eigen::PermutationMatrix
474 IndicesType m_indices; member in class:Eigen::Map
532 typename IndicesType::Nested m_indices; member in class:Eigen::PermutationWrapper
    [all...]
  /external/testng/src/main/java/org/testng/internal/
Tarjan.java 18 Map<T, Integer> m_indices = Maps.newHashMap(); field in class:Tarjan
28 m_indices.put(v, m_index);
34 if (! m_indices.containsKey(vprime)) {
40 m_lowlinks.put(v, Math.min(m_lowlinks.get(v), m_indices.get(vprime)));
44 if (Objects.equals(m_lowlinks.get(v), m_indices.get(v))) {
  /external/opencv3/modules/flann/include/opencv2/
flann.hpp 274 ::cvflann::Matrix<int> m_indices(&indices[0], 1, indices.size());
279 nnIndex->knnSearch(m_query,m_indices,m_dists,knn,searchParams);
292 ::cvflann::Matrix<int> m_indices((int*)indices.ptr<int>(0), indices.rows, indices.cols);
300 nnIndex->knnSearch(m_queries,m_indices,m_dists,knn, searchParams);
307 ::cvflann::Matrix<int> m_indices(&indices[0], 1, indices.size());
312 return nnIndex->radiusSearch(m_query,m_indices,m_dists,radius,searchParams);
324 ::cvflann::Matrix<int> m_indices((int*)indices.ptr<int>(0), indices.rows, indices.cols);
332 return nnIndex->radiusSearch(m_query,m_indices,m_dists,radius,searchParams);
441 ::cvflann::Matrix<int> m_indices(&indices[0], 1, indices.size());
444 if (nnIndex_L1) nnIndex_L1->knnSearch(m_query,m_indices,m_dists,knn,searchParams)
    [all...]
  /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/box2d/
VerticalStack.java 48 int[] m_indices = new int[e_rowCount * e_columnCount]; field in class:VerticalStack
81 m_indices[n] = n;
  /external/deqp/modules/glshared/
glsRandomShaderCase.hpp 108 std::vector<deUint16> m_indices; member in class:deqp::gls::RandomShaderCase
glsStateChangePerfTestCases.hpp 102 std::vector<deUint16> m_indices; member in class:deqp::gls::StateChangePerformanceCase
glsRandomShaderCase.cpp 207 m_indices.resize(numIndices);
213 m_indices[quadNdx*6+0] = (deUint16)(quadX + quadY*(m_gridWidth+1));
214 m_indices[quadNdx*6+1] = (deUint16)(quadX + (quadY+1)*(m_gridWidth+1));
215 m_indices[quadNdx*6+2] = (deUint16)(quadX + quadY*(m_gridWidth+1) + 1);
216 m_indices[quadNdx*6+3] = (deUint16)(m_indices[quadNdx*6+2]);
217 m_indices[quadNdx*6+4] = (deUint16)(m_indices[quadNdx*6+1]);
218 m_indices[quadNdx*6+5] = (deUint16)(quadX + (quadY+1)*(m_gridWidth+1) + 1);
365 m_indices.clear()
    [all...]
glsShaderRenderCase.cpp 152 const deUint16* getIndices (void) const { return &m_indices[0]; }
174 vector<deUint16> m_indices; member in class:deqp::gls::QuadGrid
218 m_indices.resize(3 * m_numTriangles);
229 m_indices[baseNdx + 0] = (deUint16)v10;
230 m_indices[baseNdx + 1] = (deUint16)v00;
231 m_indices[baseNdx + 2] = (deUint16)v01;
233 m_indices[baseNdx + 3] = (deUint16)v10;
234 m_indices[baseNdx + 4] = (deUint16)v01;
235 m_indices[baseNdx + 5] = (deUint16)v11;
glsStateChangePerfTestCases.cpp 229 genIndices(m_indices, m_triangleCount);
481 m_indices.clear();
633 case DRAWTYPE_INDEXED_USER_PTR: gl.drawElements(GL_TRIANGLES, m_triangleCount * 3, GL_UNSIGNED_SHORT, &m_indices[0]); break;
  /external/deqp/framework/referencerenderer/
rrRenderer.hpp 104 const void* const m_indices; // !< if indices is NULL, indices is interpreted as [first (== baseVertex) + 0, first + 1, first + 2, ...] member in class:rr::PrimitiveList
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/
btPolyhedralContactClipping.cpp 443 int numVerticesA = polyA.m_indices.size();
446 const btVector3& a = hullA.m_vertices[polyA.m_indices[e0]];
447 const btVector3& b = hullA.m_vertices[polyA.m_indices[(e0+1)%numVerticesA]];
558 const int numVertices = polyB.m_indices.size();
561 const btVector3& b = hullB.m_vertices[polyB.m_indices[e0]];
  /external/deqp/modules/gles2/functional/
es2fVertexTextureTests.cpp 196 const deUint16* getIndexPtr (void) const { return &m_indices[0]; }
204 vector<deUint16> m_indices; member in class:deqp::gles2::Functional::__anon9354::PosTexCoordQuadGrid
234 m_indices.reserve(m_gridSize*m_gridSize*3*2);
251 m_indices.push_back(deUint16(firstNdx + 0));
252 m_indices.push_back(deUint16(firstNdx + 1));
253 m_indices.push_back(deUint16(firstNdx + 2));
255 m_indices.push_back(deUint16(firstNdx + 1));
256 m_indices.push_back(deUint16(firstNdx + 3));
257 m_indices.push_back(deUint16(firstNdx + 2));
264 DE_ASSERT((int)m_indices.size() == m_gridSize*m_gridSize*3*2)
    [all...]
  /external/deqp/modules/gles3/functional/
es3fVertexArrayObjectTests.cpp 162 deUint8* m_indices; member in class:deqp::gles3::Functional::VertexArrayObjectTest
184 , m_indices (NULL)
255 m_indices = generateIndices();
264 delete[] m_indices;
577 GLU_CHECK_CALL(glDrawElements(GL_TRIANGLES, m_spec.count, m_spec.indexType, m_indices));
579 GLU_CHECK_CALL(glDrawElementsInstanced(GL_TRIANGLES, m_spec.count, m_spec.indexType, m_indices, m_spec.instances));
681 deUint8* m_indices; member in class:deqp::gles3::Functional::MultiVertexArrayObjectTest
702 , m_indices (NULL)
831 m_indices = generateIndices();
840 delete[] m_indices;
    [all...]
es3fVertexTextureTests.cpp 246 const deUint16* getIndexPtr (void) const { return &m_indices[0]; }
254 vector<deUint16> m_indices; member in class:deqp::gles3::Functional::__anon9563::PosTexCoordQuadGrid
284 m_indices.reserve(m_gridSize*m_gridSize*3*2);
301 m_indices.push_back(deUint16(firstNdx + 0));
302 m_indices.push_back(deUint16(firstNdx + 1));
303 m_indices.push_back(deUint16(firstNdx + 2));
305 m_indices.push_back(deUint16(firstNdx + 1));
306 m_indices.push_back(deUint16(firstNdx + 3));
307 m_indices.push_back(deUint16(firstNdx + 2));
314 DE_ASSERT((int)m_indices.size() == m_gridSize*m_gridSize*3*2)
    [all...]