| /external/ceres-solver/internal/ceres/ |
| D | parameter_block_ordering_test.cc | 96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]); in TEST_F() local
97 EXPECT_EQ(neighbors.size(), 2); in TEST_F()
98 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end()); in TEST_F()
99 EXPECT_TRUE(neighbors.find(parameter_blocks[3]) != neighbors.end()); in TEST_F()
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); in TEST_F() local
104 EXPECT_EQ(neighbors.size(), 1); in TEST_F()
105 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end()); in TEST_F()
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); in TEST_F() local
110 EXPECT_EQ(neighbors.size(), 3); in TEST_F()
111 EXPECT_TRUE(neighbors.find(parameter_blocks[0]) != neighbors.end()); in TEST_F()
[all …]
|
| D | graph_algorithms_test.cc | 139 const HashSet<int>& neighbors = forest->Neighbors(0); in TEST() local
140 EXPECT_EQ(neighbors.size(), 2); in TEST()
141 EXPECT_TRUE(neighbors.find(4) != neighbors.end()); in TEST()
142 EXPECT_TRUE(neighbors.find(3) != neighbors.end()); in TEST()
146 const HashSet<int>& neighbors = forest->Neighbors(3); in TEST() local
147 EXPECT_EQ(neighbors.size(), 1); in TEST()
148 EXPECT_TRUE(neighbors.find(0) != neighbors.end()); in TEST()
152 const HashSet<int>& neighbors = forest->Neighbors(4); in TEST() local
153 EXPECT_EQ(neighbors.size(), 1); in TEST()
154 EXPECT_TRUE(neighbors.find(0) != neighbors.end()); in TEST()
[all …]
|
| D | graph_algorithms.h | 134 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); in IndependentSetOrdering() local
135 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin(); in IndependentSetOrdering()
136 it != neighbors.end(); in IndependentSetOrdering()
209 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); in StableIndependentSetOrdering() local
210 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin(); in StableIndependentSetOrdering()
211 it != neighbors.end(); in StableIndependentSetOrdering()
295 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1); in Degree2MaximumSpanningForest() local
296 for (typename HashSet<Vertex>::const_iterator it2 = neighbors.begin(); in Degree2MaximumSpanningForest()
297 it2 != neighbors.end(); in Degree2MaximumSpanningForest()
|
| D | canonical_views_clustering.cc | 171 const IntSet& neighbors = graph_->Neighbors(candidate); in ComputeClusteringQualityDifference() local
172 for (IntSet::const_iterator neighbor = neighbors.begin(); in ComputeClusteringQualityDifference()
173 neighbor != neighbors.end(); in ComputeClusteringQualityDifference()
198 const IntSet& neighbors = graph_->Neighbors(canonical_view); in UpdateCanonicalViewAssignments() local
199 for (IntSet::const_iterator neighbor = neighbors.begin(); in UpdateCanonicalViewAssignments()
200 neighbor != neighbors.end(); in UpdateCanonicalViewAssignments()
|
| D | single_linkage_clustering.cc | 63 const HashSet<int>& neighbors = graph.Neighbors(vertex1); in ComputeSingleLinkageClustering() local
64 for (HashSet<int>::const_iterator it2 = neighbors.begin(); in ComputeSingleLinkageClustering()
65 it2 != neighbors.end(); in ComputeSingleLinkageClustering()
|
| D | visibility_based_preconditioner.cc | 514 const HashSet<int>& neighbors = forest.Neighbors(cluster1); in ForestToClusterPairs() local
515 for (HashSet<int>::const_iterator it2 = neighbors.begin(); in ForestToClusterPairs()
516 it2 != neighbors.end(); in ForestToClusterPairs()
|
| /external/libvpx/libvpx/vp9/common/ |
| D | vp9_scan.c | 311 int16_t *neighbors) { in init_scan_neighbors() argument
316 neighbors[MAX_NEIGHBORS * 0 + 0] = 0; in init_scan_neighbors()
317 neighbors[MAX_NEIGHBORS * 0 + 1] = 0; in init_scan_neighbors()
340 neighbors[MAX_NEIGHBORS * n + 0] = in init_scan_neighbors()
341 neighbors[MAX_NEIGHBORS * n + 1] = a; in init_scan_neighbors()
344 neighbors[MAX_NEIGHBORS * n + 0] = in init_scan_neighbors()
345 neighbors[MAX_NEIGHBORS * n + 1] = b; in init_scan_neighbors()
347 neighbors[MAX_NEIGHBORS * n + 0] = a; in init_scan_neighbors()
348 neighbors[MAX_NEIGHBORS * n + 1] = b; in init_scan_neighbors()
351 neighbors[MAX_NEIGHBORS * n + 0] = in init_scan_neighbors()
[all …]
|
| D | vp9_scan.h | 31 const int16_t *neighbors; member
37 static INLINE int get_coef_context(const int16_t *neighbors, in get_coef_context() argument
39 return (1 + token_cache[neighbors[MAX_NEIGHBORS * c + 0]] + in get_coef_context()
40 token_cache[neighbors[MAX_NEIGHBORS * c + 1]]) >> 1; in get_coef_context()
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/ |
| D | vp9_scan.c | 311 int16_t *neighbors) { in init_scan_neighbors() argument
316 neighbors[MAX_NEIGHBORS * 0 + 0] = 0; in init_scan_neighbors()
317 neighbors[MAX_NEIGHBORS * 0 + 1] = 0; in init_scan_neighbors()
340 neighbors[MAX_NEIGHBORS * n + 0] = in init_scan_neighbors()
341 neighbors[MAX_NEIGHBORS * n + 1] = a; in init_scan_neighbors()
344 neighbors[MAX_NEIGHBORS * n + 0] = in init_scan_neighbors()
345 neighbors[MAX_NEIGHBORS * n + 1] = b; in init_scan_neighbors()
347 neighbors[MAX_NEIGHBORS * n + 0] = a; in init_scan_neighbors()
348 neighbors[MAX_NEIGHBORS * n + 1] = b; in init_scan_neighbors()
351 neighbors[MAX_NEIGHBORS * n + 0] = in init_scan_neighbors()
[all …]
|
| D | vp9_scan.h | 31 const int16_t *neighbors; member
37 static INLINE int get_coef_context(const int16_t *neighbors, in get_coef_context() argument
39 return (1 + token_cache[neighbors[MAX_NEIGHBORS * c + 0]] + in get_coef_context()
40 token_cache[neighbors[MAX_NEIGHBORS * c + 1]]) >> 1; in get_coef_context()
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/decoder/ |
| D | error_concealment.c | 432 EC_BLOCK *neighbors, in find_neighboring_blocks() argument
443 assign_neighbor(&neighbors[i], mi - mi_stride - 1, 15); in find_neighboring_blocks()
447 assign_neighbor(&neighbors[i], mi - mi_stride, j); in find_neighboring_blocks()
455 assign_neighbor(&neighbors[i], mi - mi_stride + 1, 12); in find_neighboring_blocks()
459 assign_neighbor(&neighbors[i], mi + 1, j); in find_neighboring_blocks()
467 assign_neighbor(&neighbors[i], mi + mi_stride + 1, 0); in find_neighboring_blocks()
471 assign_neighbor(&neighbors[i], mi + mi_stride, j); in find_neighboring_blocks()
479 assign_neighbor(&neighbors[i], mi + mi_stride - 1, 4); in find_neighboring_blocks()
484 assign_neighbor(&neighbors[i], mi - 1, j); in find_neighboring_blocks()
496 EC_BLOCK *neighbors, in interpolate_mvs() argument
[all …]
|
| /external/libvpx/libvpx/vp8/decoder/ |
| D | error_concealment.c | 434 EC_BLOCK *neighbors, in find_neighboring_blocks() argument
445 assign_neighbor(&neighbors[i], mi - mi_stride - 1, 15); in find_neighboring_blocks()
449 assign_neighbor(&neighbors[i], mi - mi_stride, j); in find_neighboring_blocks()
457 assign_neighbor(&neighbors[i], mi - mi_stride + 1, 12); in find_neighboring_blocks()
461 assign_neighbor(&neighbors[i], mi + 1, j); in find_neighboring_blocks()
469 assign_neighbor(&neighbors[i], mi + mi_stride + 1, 0); in find_neighboring_blocks()
473 assign_neighbor(&neighbors[i], mi + mi_stride, j); in find_neighboring_blocks()
481 assign_neighbor(&neighbors[i], mi + mi_stride - 1, 4); in find_neighboring_blocks()
486 assign_neighbor(&neighbors[i], mi - 1, j); in find_neighboring_blocks()
498 EC_BLOCK *neighbors, in interpolate_mvs() argument
[all …]
|
| /external/opencv/cv/src/ |
| D | cvcalibinit.cpp | 104 struct CvCBCorner* neighbors[4]; // Neighbor corners member
120 struct CvCBQuad *neighbors[4]; // Pointers of quad neighbors member
597 CvCBQuad *neighbor = q->neighbors[i]; in icvOrderFoundConnectedQuads()
707 CvCBQuad *neighbor = quads[i]->neighbors[j]; in icvOrderFoundConnectedQuads()
754 if (quads[i]->neighbors[j] && quads[i]->neighbors[j]->ordered) in icvOrderFoundConnectedQuads()
786 if (!quad->neighbors[i]) // ok, create and add neighbor in icvAddOuterQuad()
797 quad->neighbors[i] = q; in icvAddOuterQuad()
799 q->neighbors[j] = quad; in icvAddOuterQuad()
825 if (quad->neighbors[(i+3)%4] && in icvAddOuterQuad()
826 quad->neighbors[(i+3)%4]->ordered && in icvAddOuterQuad()
[all …]
|
| D | cvsnakes.cpp | 82 int neighbors = win.height * win.width; in icvSnake8uC1R() local
162 Econt = (float *) cvAlloc( neighbors * sizeof( float )); in icvSnake8uC1R()
163 Ecurv = (float *) cvAlloc( neighbors * sizeof( float )); in icvSnake8uC1R()
164 Eimg = (float *) cvAlloc( neighbors * sizeof( float )); in icvSnake8uC1R()
165 E = (float *) cvAlloc( neighbors * sizeof( float )); in icvSnake8uC1R()
238 for( k = 0; k < neighbors; k++ ) in icvSnake8uC1R()
276 for( k = 0; k < neighbors; k++ ) in icvSnake8uC1R()
341 for( k = 0; k < neighbors; k++ ) in icvSnake8uC1R()
361 for( k = 0; k < neighbors; k++ ) in icvSnake8uC1R()
|
| D | mycvHaarDetectObjects.cpp | 1313 comps[idx].neighbors++; in mycvHaarDetectObjects()
1323 int n = comps[i].neighbors; in mycvHaarDetectObjects()
1331 comp.neighbors = n; in mycvHaarDetectObjects()
1349 comps[idx].neighbors++; in mycvHaarDetectObjects()
1361 int n = comps[i].neighbors; in mycvHaarDetectObjects()
1391 comp.neighbors = n; in mycvHaarDetectObjects()
1412 result_comp.neighbors = bseq == seq ? 1 : comp->neighbors; in mycvHaarDetectObjects()
1452 comp.neighbors = 1; in mycvHaarDetectObjects()
1475 comps[idx].neighbors++; in mycvHaarDetectObjects()
1486 int n = comps[i].neighbors; in mycvHaarDetectObjects()
[all …]
|
| D | cvhaar.cpp | 1281 comps[idx].neighbors++; in cvHaarDetectObjects()
1291 int n = comps[i].neighbors; in cvHaarDetectObjects()
1299 comp.neighbors = n; in cvHaarDetectObjects()
1317 comps[idx].neighbors++; in cvHaarDetectObjects()
1329 int n = comps[i].neighbors; in cvHaarDetectObjects()
1359 comp.neighbors = n; in cvHaarDetectObjects()
1380 result_comp.neighbors = bseq == seq ? 1 : comp->neighbors; in cvHaarDetectObjects()
1416 comp.neighbors = 1; in cvHaarDetectObjects()
1439 comps[idx].neighbors++; in cvHaarDetectObjects()
1450 int n = comps[i].neighbors; in cvHaarDetectObjects()
[all …]
|
| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_mcomp.c | 660 static const MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}}; in vp9_pattern_search() local
666 const MV this_mv = {br + neighbors[i].row, in vp9_pattern_search()
667 bc + neighbors[i].col}; in vp9_pattern_search()
675 const MV this_mv = {br + neighbors[i].row, in vp9_pattern_search()
676 bc + neighbors[i].col}; in vp9_pattern_search()
689 br += neighbors[best_site].row; in vp9_pattern_search()
690 bc += neighbors[best_site].col; in vp9_pattern_search()
1541 const MV neighbors[4] = {{ -1, 0}, {0, -1}, {0, 1}, {1, 0}}; in vp9_refining_search_sad_c() local
1559 const MV mv = {ref_mv->row + neighbors[j].row, in vp9_refining_search_sad_c()
1560 ref_mv->col + neighbors[j].col}; in vp9_refining_search_sad_c()
[all …]
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
| D | mcomp.c | 866 MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}} ; in vp8_hex_search() local
1002 this_mv.as_mv.row = br + neighbors[i].row; in vp8_hex_search()
1003 this_mv.as_mv.col = bc + neighbors[i].col; in vp8_hex_search()
1012 this_mv.as_mv.row = br + neighbors[i].row; in vp8_hex_search()
1013 this_mv.as_mv.col = bc + neighbors[i].col; in vp8_hex_search()
1025 br += neighbors[best_site].row; in vp8_hex_search()
1026 bc += neighbors[best_site].col; in vp8_hex_search()
1729 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; in vp8_refining_search_sad_c() local
1763 this_row_offset = ref_mv->as_mv.row + neighbors[j].row; in vp8_refining_search_sad_c()
1764 this_col_offset = ref_mv->as_mv.col + neighbors[j].col; in vp8_refining_search_sad_c()
[all …]
|
| /external/libvpx/libvpx/vp8/encoder/ |
| D | mcomp.c | 865 MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}} ; in vp8_hex_search() local
1001 this_mv.as_mv.row = br + neighbors[i].row; in vp8_hex_search()
1002 this_mv.as_mv.col = bc + neighbors[i].col; in vp8_hex_search()
1011 this_mv.as_mv.row = br + neighbors[i].row; in vp8_hex_search()
1012 this_mv.as_mv.col = bc + neighbors[i].col; in vp8_hex_search()
1024 br += neighbors[best_site].row; in vp8_hex_search()
1025 bc += neighbors[best_site].col; in vp8_hex_search()
1728 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; in vp8_refining_search_sad_c() local
1762 this_row_offset = ref_mv->as_mv.row + neighbors[j].row; in vp8_refining_search_sad_c()
1763 this_col_offset = ref_mv->as_mv.col + neighbors[j].col; in vp8_refining_search_sad_c()
[all …]
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| D | vp9_mcomp.c | 655 static const MV neighbors[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; in vp9_pattern_search() local
659 const MV this_mv = {br + neighbors[i].row, in vp9_pattern_search()
660 bc + neighbors[i].col}; in vp9_pattern_search()
670 const MV this_mv = {br + neighbors[i].row, in vp9_pattern_search()
671 bc + neighbors[i].col}; in vp9_pattern_search()
938 static const MV neighbors[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; in vp9_pattern_search_sad() local
943 const MV this_mv = {br + neighbors[i].row, in vp9_pattern_search_sad()
944 bc + neighbors[i].col}; in vp9_pattern_search_sad()
951 const MV this_mv = {br + neighbors[i].row, in vp9_pattern_search_sad()
952 bc + neighbors[i].col}; in vp9_pattern_search_sad()
[all …]
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/ |
| D | lp_bld_sample_soa.c | 694 LLVMValueRef neighbors[2][2][4]; in lp_build_sample_image_linear() local
759 data_ptr, neighbors[0][0]); in lp_build_sample_image_linear()
764 data_ptr, neighbors[0][1]); in lp_build_sample_image_linear()
770 neighbors[0][0][chan], in lp_build_sample_image_linear()
771 neighbors[0][1][chan]); in lp_build_sample_image_linear()
783 data_ptr, neighbors[1][0]); in lp_build_sample_image_linear()
788 data_ptr, neighbors[1][1]); in lp_build_sample_image_linear()
794 neighbors[0][0][chan], in lp_build_sample_image_linear()
795 neighbors[0][1][chan], in lp_build_sample_image_linear()
796 neighbors[1][0][chan], in lp_build_sample_image_linear()
[all …]
|
| /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
759 data_ptr, neighbors[0][0]); in lp_build_sample_image_linear()
764 data_ptr, neighbors[0][1]); in lp_build_sample_image_linear()
770 neighbors[0][0][chan], in lp_build_sample_image_linear()
771 neighbors[0][1][chan]); in lp_build_sample_image_linear()
783 data_ptr, neighbors[1][0]); in lp_build_sample_image_linear()
788 data_ptr, neighbors[1][1]); in lp_build_sample_image_linear()
794 neighbors[0][0][chan], in lp_build_sample_image_linear()
795 neighbors[0][1][chan], in lp_build_sample_image_linear()
796 neighbors[1][0][chan], in lp_build_sample_image_linear()
[all …]
|
| /external/opencv/ml/src/ |
| D | mlknearest.cpp | 151 float* neighbor_responses, const float** neighbors, float* dist ) const in find_neighbors_direct() argument
193 nn = neighbors ? neighbors + (start + i)*k : 0; in find_neighbors_direct()
|
| /external/opencv/cv/include/ |
| D | cvtypes.h | 378 int neighbors; member
|
| /external/libvpx/libvpx/vp9/decoder/ |
| D | vp9_detokenize.c | 206 pd->dequant, ctx, so->scan, so->neighbors, r); in vp9_decode_block_tokens()
|