/external/ceres-solver/internal/ceres/ |
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...] |
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...] |
schur_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...] |
canonical_views_clustering.cc | 167 // neighbors became members of its cluster. 168 const IntSet& neighbors = graph_->Neighbors(candidate); local 169 for (IntSet::const_iterator neighbor = neighbors.begin(); 170 neighbor != neighbors.end(); 195 const IntSet& neighbors = graph_->Neighbors(canonical_view); local 196 for (IntSet::const_iterator neighbor = neighbors.begin(); 197 neighbor != neighbors.end();
|
graph_algorithms.h | 55 if (graph_.Neighbors(lhs).size() == graph_.Neighbors(rhs).size()) { 58 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size(); 72 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size(); 125 // to the independent set. Mark it black and its neighbors grey. 134 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); local 135 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin() 209 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); local 295 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1); local [all...] |
visibility_based_preconditioner.cc | 485 const HashSet<int>& neighbors = forest.Neighbors(cluster1); local 486 for (HashSet<int>::const_iterator it2 = neighbors.begin(); 487 it2 != neighbors.end();
|
/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;
|
/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/ |
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...] |
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...] |
/external/libvpx/libvpx/vp8/encoder/ |
mcomp.c | 865 MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}} ; local 990 /* check 4 1-away neighbors */ 1001 this_mv.as_mv.row = br + neighbors[i].row; 1002 this_mv.as_mv.col = bc + neighbors[i].col; 1011 this_mv.as_mv.row = br + neighbors[i].row; 1012 this_mv.as_mv.col = bc + neighbors[i].col; 1024 br += neighbors[best_site].row; 1025 bc += neighbors[best_site].col; 1728 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; local 1808 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; local [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/ |
lp_bld_sample_soa.c | 694 LLVMValueRef neighbors[2][2][4]; local 759 data_ptr, neighbors[0][0]); 764 data_ptr, neighbors[0][1]); 770 neighbors[0][0][chan], 771 neighbors[0][1][chan]); 783 data_ptr, neighbors[1][0]); 788 data_ptr, neighbors[1][1]); 794 neighbors[0][0][chan], 795 neighbors[0][1][chan], 796 neighbors[1][0][chan] [all...] |
/external/libvpx/libvpx/vp9/encoder/ |
vp9_mcomp.c | 892 // Check 4 1-away neighbors if do_refine is true. 895 static const MV neighbors[4] = { local 903 this_mv.row = br + neighbors[i].row; 904 this_mv.col = bc + neighbors[i].col; 913 this_mv.row = br + neighbors[i].row; 914 this_mv.col = bc + neighbors[i].col; 927 br += neighbors[best_site].row; 928 bc += neighbors[best_site].col; 1825 MV neighbors[4] = {{ -1, 0}, {0, -1}, {0, 1}, {1, 0}}; local 1909 MV neighbors[4] = {{ -1, 0}, {0, -1}, {0, 1}, {1, 0}}; local 2027 MV neighbors[8] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}, local [all...] |
/external/mesa3d/src/gallium/auxiliary/gallivm/ |
lp_bld_sample_soa.c | 694 LLVMValueRef neighbors[2][2][4]; local 759 data_ptr, neighbors[0][0]); 764 data_ptr, neighbors[0][1]); 770 neighbors[0][0][chan], 771 neighbors[0][1][chan]); 783 data_ptr, neighbors[1][0]); 788 data_ptr, neighbors[1][1]); 794 neighbors[0][0][chan], 795 neighbors[0][1][chan], 796 neighbors[1][0][chan] [all...] |
/external/opencv/cv/include/ |
cvtypes.h | 378 int neighbors; member in struct:CvAvgComp
|