| /external/ceres-solver/internal/ceres/ |
| single_linkage_clustering.cc | 67 const int vertex2 = *it2; local
71 if ((vertex1 > vertex2) ||
72 (graph.EdgeWeight(vertex1, vertex2) < options.min_similarity)) {
78 const int c2 = FindConnectedComponent(vertex2, membership);
|
| graph_algorithms.h | 299 const Vertex vertex2 = *it2; local
300 if (vertex1 >= vertex2) {
303 const double weight = graph.EdgeWeight(vertex1, vertex2);
304 weighted_edges.push_back(make_pair(weight, make_pair(vertex1, vertex2)));
318 const Vertex vertex2 = edge.second; local
324 (forest->Neighbors(vertex2).size() == 2)) {
333 Vertex root2 = FindConnectedComponent(vertex2, &disjoint_set);
341 const double edge_weight = graph.EdgeWeight(vertex1, vertex2);
342 forest->AddEdge(vertex1, vertex2, edge_weight);
343 forest->AddEdge(vertex2, vertex1, edge_weight)
[all...] |
| /external/deqp/modules/gles2/functional/ |
| es2fShaderInvarianceTests.cpp | 215 const tcu::Vec4 vertex2 = genRandomVector(rnd); local
216 const tcu::Vec4 vertex3 = vertex2 + genRandomVector(rnd) * 0.01f; // generate narrow triangles
219 triangles[triNdx*3 + 1] = vertex2;
[all...] |
| /external/deqp/modules/gles3/functional/ |
| es3fShaderInvarianceTests.cpp | 215 const tcu::Vec4 vertex2 = genRandomVector(rnd); local
216 const tcu::Vec4 vertex3 = vertex2 + genRandomVector(rnd) * 0.01f; // generate narrow triangles
219 triangles[triNdx*3 + 1] = vertex2;
[all...] |
| /external/pdfium/core/src/fpdfapi/fpdf_render/ |
| fpdf_render_pattern.cpp | 330 CPDF_MeshVertex& vertex2 = triangle[(i + 1) % 3];
local
332 vertex2.x, vertex2.y, inter_x[nIntersects]);
336 r[nIntersects] = vertex1.r + FXSYS_MulDiv(vertex2.r - vertex1.r, y - vertex1.y, vertex2.y - vertex1.y);
337 g[nIntersects] = vertex1.g + FXSYS_MulDiv(vertex2.g - vertex1.g, y - vertex1.y, vertex2.y - vertex1.y);
338 b[nIntersects] = vertex1.b + FXSYS_MulDiv(vertex2.b - vertex1.b, y - vertex1.y, vertex2.y - vertex1.y);
[all...] |
