| /external/ceres-solver/internal/ceres/ |
| parameter_block_ordering_test.cc | 96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]); local
97 EXPECT_EQ(neighbors.size(), 2);
98 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end());
99 EXPECT_TRUE(neighbors.find(parameter_blocks[3]) != neighbors.end());
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); local
104 EXPECT_EQ(neighbors.size(), 1)
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); local
117 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]); local
152 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); local
158 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); local
165 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]); local
[all...] |
| graph_algorithms_test.cc | 117 EXPECT_EQ(forest->Neighbors(0).size(), 1.0);
139 const HashSet<int>& neighbors = forest->Neighbors(0); local
140 EXPECT_EQ(neighbors.size(), 2);
141 EXPECT_TRUE(neighbors.find(4) != neighbors.end());
142 EXPECT_TRUE(neighbors.find(3) != neighbors.end());
146 const HashSet<int>& neighbors = forest->Neighbors(3) local
152 const HashSet<int>& neighbors = forest->Neighbors(4); local
158 const HashSet<int>& neighbors = forest->Neighbors(1); local
163 const HashSet<int>& neighbors = forest->Neighbors(2); local
[all...] |
| graph_algorithms.h | 52 if (graph_.Neighbors(lhs).size() == graph_.Neighbors(rhs).size()) {
55 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
108 // to the independent set. Mark it black and its neighbors grey.
117 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); local
118 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();
119 it != neighbors.end();
203 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1) local
[all...] |
| graph_test.cc | 55 EXPECT_EQ(graph.Neighbors(0).size(), 1);
56 EXPECT_EQ(graph.Neighbors(1).size(), 1);
80 EXPECT_EQ(graph.Neighbors(0).size(), 1);
81 EXPECT_EQ(graph.Neighbors(1).size(), 1);
93 EXPECT_DEATH_IF_SUPPORTED(graph.Neighbors(2), "key not found");
|
| canonical_views_clustering.cc | 165 // neighbors became members of its cluster.
166 const IntSet& neighbors = graph_->Neighbors(candidate); local
167 for (IntSet::const_iterator neighbor = neighbors.begin();
168 neighbor != neighbors.end();
193 const IntSet& neighbors = graph_->Neighbors(canonical_view); local
194 for (IntSet::const_iterator neighbor = neighbors.begin();
195 neighbor != neighbors.end();
|
| graph.h | 134 // Calling Neighbors on a vertex not in the graph will result in
136 const HashSet<Vertex>& Neighbors(const Vertex& vertex) const {
|
| visibility_based_preconditioner.cc | 517 const HashSet<int>& neighbors = forest.Neighbors(cluster1); local
518 for (HashSet<int>::const_iterator it2 = neighbors.begin();
519 it2 != neighbors.end();
|
| /external/libvpx/libvpx/vp8/decoder/ |
| error_concealment.c | 428 * The neighbors are enumerated with the upper-left neighbor as the first
434 EC_BLOCK *neighbors,
445 assign_neighbor(&neighbors[i], mi - mi_stride - 1, 15);
449 assign_neighbor(&neighbors[i], mi - mi_stride, j);
457 assign_neighbor(&neighbors[i], mi - mi_stride + 1, 12);
461 assign_neighbor(&neighbors[i], mi + 1, j);
469 assign_neighbor(&neighbors[i], mi + mi_stride + 1, 0);
473 assign_neighbor(&neighbors[i], mi + mi_stride, j);
481 assign_neighbor(&neighbors[i], mi + mi_stride - 1, 4);
486 assign_neighbor(&neighbors[i], mi - 1, j)
566 EC_BLOCK neighbors[NUM_NEIGHBORS]; local
[all...] |
| /external/opencv/cv/src/ |
| cvcalibinit.cpp | 104 struct CvCBCorner* neighbors[4]; // Neighbor corners member in struct:CvCBCorner
113 int count; // Number of quad neighbors
116 bool ordered; // true if corners/neighbors are ordered counter-clockwise
118 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0
120 struct CvCBQuad *neighbors[4]; // Pointers of quad neighbors member in struct:CvCBQuad
366 // Find quad's neighbors
597 CvCBQuad *neighbor = q->neighbors[i];
691 { // ok, look at neighbors
707 CvCBQuad *neighbor = quads[i]->neighbors[j]
[all...] |
| cvsnakes.cpp | 82 int neighbors = win.height * win.width; local
162 Econt = (float *) cvAlloc( neighbors * sizeof( float ));
163 Ecurv = (float *) cvAlloc( neighbors * sizeof( float ));
164 Eimg = (float *) cvAlloc( neighbors * sizeof( float ));
165 E = (float *) cvAlloc( neighbors * sizeof( float ));
238 for( k = 0; k < neighbors; k++ )
276 for( k = 0; k < neighbors; k++ )
341 for( k = 0; k < neighbors; k++ )
360 /* Find Minimize point in the neighbors */
361 for( k = 0; k < neighbors; k++
[all...] |
| mycvHaarDetectObjects.cpp | [all...] |
| _cvkdtree.hpp | 301 struct bbf_nn { // info on found neighbors (approx k nearest)
381 // finds (with high probability) the k nearest neighbors of d,
383 // ret_nn_pq is an array containing the (at most) k nearest neighbors
|
| cvhaar.cpp | [all...] |
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/ |
| FluidSimHeightMap.java | 182 int neighbors = 0;
local
186 neighbors++;
190 neighbors++;
194 neighbors++;
198 neighbors++;
200 if (neighbors != 4) {
201 neighborsValue *= 4 / neighbors;
|
| AbstractHeightMap.java | 428 * Smooth the terrain. For each node, its 8 neighbors heights
435 * The factor to what extend the neighbors average has an influence.
436 * Value of 0 will ignore neighbors (no smoothing)
444 * Smooth the terrain. For each node, its X(determined by radius) neighbors heights
451 * The factor to what extend the neighbors average has an influence.
452 * Value of 0 will ignore neighbors (no smoothing)
|
| ParticleDepositionHeightMap.java | 198 //check neighbors to see if we are higher.
270 //check the left and right neighbors
289 //check the upper and lower neighbors.
|
| /external/tcpdump/ |
| print-dvmrp.c | 45 #define DVMRP_PROBE 1 /* for finding neighbors */
48 /* of this router's neighbors */
59 #define DVMRP_NF_TUNNEL 0x01 /* neighbors reached via tunnel */
111 printf(" Ask-neighbors(old)");
115 printf(" Neighbors(old)");
|
| /external/opencv/ml/src/ |
| mlknearest.cpp | 44 * K-Nearest Neighbors Classifier *
47 // k Nearest Neighbors
151 float* neighbor_responses, const float** neighbors, float* dist ) const
193 nn = neighbors ? neighbors + (start + i)*k : 0;
354 "The distances from the neighbors (if present) must be floating-point matrix of <num_samples> x <k> size" );
|
| /external/libvpx/libvpx/vp8/encoder/ |
| mcomp.c | 862 MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}} ; local
987 /* check 4 1-away neighbors */
998 this_mv.as_mv.row = br + neighbors[i].row;
999 this_mv.as_mv.col = bc + neighbors[i].col;
1008 this_mv.as_mv.row = br + neighbors[i].row;
1009 this_mv.as_mv.col = bc + neighbors[i].col;
1021 br += neighbors[best_site].row;
1022 bc += neighbors[best_site].col;
1725 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; local
1805 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; local
[all...] |
| /packages/apps/Camera/jni/feature_mos/src/mosaic/ |
| MosaicTypes.h | 74 BlendRect vcrect; // brect clipped using the voronoi neighbors
|
| /packages/apps/Gallery2/jni_mosaic/feature_mos/src/mosaic/ |
| MosaicTypes.h | 74 BlendRect vcrect; // brect clipped using the voronoi neighbors
|
| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| MosaicTypes.h | 74 BlendRect vcrect; // brect clipped using the voronoi neighbors
|
| /external/libvpx/libvpx/vp8/common/ |
| entropy.h | 76 are decoded, e.g., prior to the first token, a zero means that my neighbors
|
| /external/jpeg/ |
| jcsample.c | 43 * eight neighbors. P's weight is 1-8*SF and each neighbor's weight is SF,
315 * eight edge-adjacent neighbors contribute SF to each of two smoothed
355 /* The edge-neighbors count twice as much as corner-neighbors */
357 /* Add in the corner-neighbors */
|
| /external/qemu/distrib/jpeg-6b/ |
| jcsample.c | 43 * eight neighbors. P's weight is 1-8*SF and each neighbor's weight is SF,
315 * eight edge-adjacent neighbors contribute SF to each of two smoothed
355 /* The edge-neighbors count twice as much as corner-neighbors */
357 /* Add in the corner-neighbors */
|
