| /external/ceres-solver/internal/ceres/ |
| D | parameter_block_ordering_test.cc | 96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]); in TEST_F() local
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); in TEST_F() local
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); in TEST_F() local
117 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]); in TEST_F() local
152 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); in TEST_F() local
158 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); in TEST_F() local
165 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]); in TEST_F() local
|
| D | graph_algorithms_test.cc | 139 const HashSet<int>& neighbors = forest->Neighbors(0); in TEST() local
146 const HashSet<int>& neighbors = forest->Neighbors(3); in TEST() local
152 const HashSet<int>& neighbors = forest->Neighbors(4); in TEST() local
158 const HashSet<int>& neighbors = forest->Neighbors(1); in TEST() local
163 const HashSet<int>& neighbors = forest->Neighbors(2); in TEST() local
|
| D | graph_algorithms.h | 134 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); in IndependentSetOrdering() local
209 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); in StableIndependentSetOrdering() local
295 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1); in Degree2MaximumSpanningForest() local
|
| D | canonical_views_clustering.cc | 171 const IntSet& neighbors = graph_->Neighbors(candidate); in ComputeClusteringQualityDifference() local
198 const IntSet& neighbors = graph_->Neighbors(canonical_view); in UpdateCanonicalViewAssignments() local
|
| D | single_linkage_clustering.cc | 63 const HashSet<int>& neighbors = graph.Neighbors(vertex1); in ComputeSingleLinkageClustering() local
|
| D | visibility_based_preconditioner.cc | 514 const HashSet<int>& neighbors = forest.Neighbors(cluster1); in ForestToClusterPairs() local
|
| /external/libvpx/libvpx/vp9/common/ |
| D | vp9_scan.h | 29 const int16_t *neighbors; member
35 static INLINE int get_coef_context(const int16_t *neighbors, in get_coef_context()
|
| /external/libvpx/libvpx/vp8/decoder/ |
| D | error_concealment.c | 432 EC_BLOCK *neighbors, in find_neighboring_blocks()
496 EC_BLOCK *neighbors, in interpolate_mvs()
564 EC_BLOCK neighbors[NUM_NEIGHBORS]; in vp8_interpolate_motion() local
|
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/ |
| D | FluidSimHeightMap.java | 182 int neighbors = 0; in load() local
|
| /external/opencv/cv/src/ |
| D | cvsnakes.cpp | 82 int neighbors = win.height * win.width; in icvSnake8uC1R() local
|
| D | cvcalibinit.cpp | 104 struct CvCBCorner* neighbors[4]; // Neighbor corners member
120 struct CvCBQuad *neighbors[4]; // Pointers of quad neighbors member
|
| /external/opencv/ml/src/ |
| D | mlknearest.cpp | 151 float* neighbor_responses, const float** neighbors, float* dist ) const in find_neighbors_direct()
|
| /external/libvpx/libvpx/vp8/encoder/ |
| D | mcomp.c | 868 MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}} ; in vp8_hex_search() local
1733 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; in vp8_refining_search_sad_c() local
1812 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; in vp8_refining_search_sadx4() local
|
| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_mcomp.c | 831 static const MV neighbors[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; in calc_int_cost_list() local
1300 static const MV neighbors[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; in vp9_pattern_search_sad() local
2209 const MV neighbors[4] = {{ -1, 0}, {0, -1}, {0, 1}, {1, 0}}; in vp9_refining_search_sad() local
2288 const MV neighbors[8] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}, in vp9_refining_search_8p_c() local
|
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| D | lp_bld_sample_soa.c | 694 LLVMValueRef neighbors[2][2][4]; in lp_build_sample_image_linear() local
|
| /external/opencv/cv/include/ |
| D | cvtypes.h | 378 int neighbors; member
|