/external/ceres-solver/internal/ceres/ |
H A D | graph_test.cc | 42 EXPECT_EQ(graph.vertices().size(), 0); 51 const HashSet<int>& vertices = graph.vertices(); local 52 EXPECT_EQ(vertices.size(), 2); 67 const HashSet<int>& vertices = graph.vertices(); local 69 EXPECT_EQ(vertices.size(), 2); 73 EXPECT_EQ(vertices.size(), 2);
|
H A D | graph_algorithms_test.cc | 113 const HashSet<int>& vertices = forest->vertices(); local 114 EXPECT_EQ(vertices.size(), 2); 135 const HashSet<int>& vertices = forest->vertices(); local 136 EXPECT_EQ(vertices.size(), 5);
|
H A D | single_linkage_clustering.cc | 52 const HashSet<int>& vertices = graph.vertices(); local 53 for (HashSet<int>::const_iterator it = vertices.begin(); 54 it != vertices.end(); 59 for (HashSet<int>::const_iterator it1 = vertices.begin(); 60 it1 != vertices.end();
|
H A D | graph.h | 92 // AddEdge on a pair of vertices which do not exist in the graph yet 96 // vertices. 123 // Calling EdgeWeight on a pair of vertices where either one of the 124 // vertices is not present in the graph will result in undefined 141 const HashSet<Vertex>& vertices() const { function in class:ceres::internal::Graph
|
H A D | parameter_block_ordering.cc | 51 const HashSet<ParameterBlock*>& vertices = graph->vertices(); local 53 if (vertices.count(parameter_blocks[i]) > 0) {
|
H A D | parameter_block_ordering_test.cc | 88 const VertexSet& vertices = graph->vertices(); local 89 EXPECT_EQ(vertices.size(), 4); 92 EXPECT_TRUE(vertices.find(parameter_blocks[i]) != vertices.end()); 132 EXPECT_EQ(graph->vertices().size(), 0); 142 const VertexSet& vertices = graph->vertices(); local 144 EXPECT_EQ(vertices.size(), 3); 145 EXPECT_TRUE(vertices [all...] |
H A D | graph_algorithms.h | 46 // Compare two vertices of a graph by their degrees, if the degrees 79 // Order the vertices of a graph using its (approximately) largest 81 // vertices that have no edges connecting them. The maximum 84 // breadth first search that explores the vertices in order of 90 // search where the vertices are explored in increasing order of their 98 const HashSet<Vertex>& vertices = graph.vertices(); local 99 const int num_vertices = vertices.size(); 110 // Mark all vertices white. 113 for (typename HashSet<Vertex>::const_iterator it = vertices 175 const HashSet<Vertex>& vertices = graph.vertices(); local 287 const HashSet<Vertex>& vertices = graph.vertices(); local [all...] |
/external/eigen/demos/opengl/ |
H A D | icosphere.h | 20 const std::vector<Eigen::Vector3f>& vertices() const { return mVertices; } function in class:IcoSphere
|
H A D | gpuhelper.cpp | 100 static float vertices[][3] = { local 111 glNormal3f(0,0,-1); glVertex3fv(vertices[0]); glVertex3fv(vertices[2]); glVertex3fv(vertices[3]); glVertex3fv(vertices[1]); 112 glNormal3f(0,0, 1); glVertex3fv(vertices[4]); glVertex3fv(vertices[5]); glVertex3fv(vertices[7]); glVertex3fv(vertices[6]); 113 glNormal3f(0,-1,0); glVertex3fv(vertices[ [all...] |
/external/deqp/framework/referencerenderer/ |
H A D | rrPrimitivePacket.hpp | 45 const VertexPacket* vertices[6]; member in struct:rr::PrimitivePacket 51 * Geometry emitter handles outputting of new vertices from geometry shader
|
/external/jmonkeyengine/engine/src/bullet-native/ |
H A D | com_jme3_bullet_util_NativeMeshUtil.cpp | 52 float* vertices = (float*) env->GetDirectBufferAddress(vertexIndexBase); local 53 btTriangleIndexVertexArray* array = new btTriangleIndexVertexArray(numTriangles, triangles, triangleIndexStride, numVertices, vertices, vertexStride);
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_prim.h | 171 u_gs_prims_for_vertices(int primitive, int vertices) argument 175 return vertices; 177 return vertices / 2; 179 return vertices; 181 return vertices - 1; 183 return vertices / 3; 185 return vertices - 2; 187 return vertices - 2; 189 return vertices / 2; 191 return vertices [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/effect/shapes/ |
H A D | EmitterMeshVertexShape.java | 20 * This emiter shape emits the particles from the given shape's vertices 25 protected List<List<Vector3f>> vertices; field in class:EmitterMeshVertexShape 51 this.vertices = new ArrayList<List<Vector3f>>(meshes.size()); 70 // adding data to vertices and normals 71 List<Vector3f> vertices = new ArrayList<Vector3f>(vertToNormalMap.size()); 74 vertices.add(entry.getKey()); 77 this.vertices.add(vertices); 89 int meshIndex = FastMath.nextRandomInt(0, vertices.size() - 1); 90 int vertIndex = FastMath.nextRandomInt(0, vertices [all...] |
/external/skia/src/gpu/ |
H A D | GrPathUtils.h | 68 * path renderer will have a small fixed number of vertices that it 71 * N is the number of vertices. 74 * vertices is a pointer to the first vertex. 77 void apply(const void* vertices) { argument 78 intptr_t xyPtr = reinterpret_cast<intptr_t>(vertices); 79 intptr_t uvPtr = reinterpret_cast<intptr_t>(vertices) + UV_OFFSET;
|
H A D | GrBatch.cpp | 60 void* vertices = batchTarget->makeVertSpace(vertexStride, vertexCount, local 62 if (!vertices) { 73 return vertices;
|
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/meshes/ |
H A D | MeshHelper.java | 116 // reading vertices
117 Vector3f[] vertices = this.getVertices(structure, blenderContext);
118 int verticesAmount = vertices.length;
120 // vertices Colors
157 // this map's key is the vertex index from 'vertices 'table and the value are indices from 'vertexList'
199 Vector3f n = FastMath.computeNormal(vertices[v1], vertices[v2], vertices[v3]);
200 this.addNormal(n, normalMap, smooth, vertices[v1], vertices[v 440 addNormal(Vector3f normalToAdd, Map<Vector3f, Vector3f> normalMap, boolean smooth, Vector3f... vertices) argument [all...] |
/external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/util/ |
H A D | DebugShapeFactory.java | 137 * Constructs the buffer for the vertices of the concave shape. 139 * @param concaveShape the shape to get the vertices for / from. 155 * @param convexShape the shape to retreieve the vertices from. 156 * @return the vertices as a FloatBuffer, ordered as Triangles. 176 // The number of bytes needed is: (floats in a vertex) * (vertices in a triangle) * (# of triangles) * (size of float in bytes) 178 FloatBuffer vertices = BufferUtils.createFloatBuffer(numberOfFloats); 181 vertices.limit(numberOfFloats); 196 vertices.put(vertexA.x).put(vertexA.y).put(vertexA.z); 197 vertices.put(vertexB.x).put(vertexB.y).put(vertexB.z); 198 vertices 215 private ArrayList<Vector3f> vertices; field in class:BufferedTriangleCallback [all...] |
/external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d10tri/ |
H A D | d3d10tri.cpp | 36 static struct vertex vertices[3] = variable in typeref:struct:vertex 72 bufferd.ByteWidth = sizeof(vertices); 79 buffersd.pSysMem = vertices; 80 buffersd.SysMemPitch = sizeof(vertices); 81 buffersd.SysMemSlicePitch = sizeof(vertices);
|
/external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11tri/ |
H A D | d3d11tri.cpp | 36 static struct vertex vertices[3] = variable in typeref:struct:vertex 73 bufferd.ByteWidth = sizeof(vertices); 81 buffersd.pSysMem = vertices; 82 buffersd.SysMemPitch = sizeof(vertices); 83 buffersd.SysMemSlicePitch = sizeof(vertices);
|
/external/mesa3d/src/gallium/tests/graw/ |
H A D | fs-fragcoord.c | 24 static struct vertex vertices[] = variable in typeref:struct:vertex 47 #define NUM_VERTS (sizeof(vertices) / sizeof(vertices[0])) 73 sizeof(vertices), 74 vertices);
|
H A D | fs-frontface.c | 23 static struct vertex vertices[] = variable in typeref:struct:vertex 68 #define NUM_VERTS (sizeof(vertices) / sizeof(vertices[0])) 95 sizeof(vertices), 96 vertices);
|
H A D | fs-write-z.c | 27 static struct vertex vertices[] = variable in typeref:struct:vertex 72 #define NUM_VERTS (sizeof(vertices) / sizeof(vertices[0])) 99 sizeof(vertices), 100 vertices);
|
H A D | tri.c | 22 static struct vertex vertices[3] = variable in typeref:struct:vertex 61 sizeof(vertices), 62 vertices);
|
/external/skia/experimental/AndroidPathRenderer/ |
H A D | GrAndroidPathRenderer.cpp | 35 android::uirenderer::VertexBuffer vertices; local 37 &vertices); 56 int vertCount = vertices.getSize(); 59 SkDebugf("Failed to get space for vertices!\n"); 66 ColorVertex* outVert = reinterpret_cast<ColorVertex*>(geo.vertices()); 68 reinterpret_cast<android::uirenderer::AlphaVertex*>(vertices.getBuffer()); 82 memcpy(geo.vertices(), vertices.getBuffer(), copySize);
|
/external/skia/gm/ |
H A D | patchgrid.cpp | 79 SkPoint vertices[4][5] = { variable 119 points[SkPatchUtils::kTopP0_CubicCtrlPts] = vertices[i][j]; 120 points[SkPatchUtils::kTopP3_CubicCtrlPts] = vertices[i][j + 1]; 121 points[SkPatchUtils::kBottomP0_CubicCtrlPts] = vertices[i + 1][j]; 122 points[SkPatchUtils::kBottomP3_CubicCtrlPts] = vertices[i + 1][j + 1];
|