Searched refs:neighbors (Results 1 - 25 of 33) sorted by relevance

12

/external/ceres-solver/internal/ceres/
H A Dparameter_block_ordering_test.cc96 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);
105 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors
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...]
H A Dgraph_algorithms_test.cc139 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
147 EXPECT_EQ(neighbors.size(), 1);
148 EXPECT_TRUE(neighbors.find(0) != neighbors
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...]
H A Dsingle_linkage_clustering.cc63 const HashSet<int>& neighbors = graph.Neighbors(vertex1); local
64 for (HashSet<int>::const_iterator it2 = neighbors.begin();
65 it2 != neighbors.end();
H A Dcanonical_views_clustering.cc170 // neighbors became members of its cluster.
171 const IntSet& neighbors = graph_->Neighbors(candidate); local
172 for (IntSet::const_iterator neighbor = neighbors.begin();
173 neighbor != neighbors.end();
198 const IntSet& neighbors = graph_->Neighbors(canonical_view); local
199 for (IntSet::const_iterator neighbor = neighbors.begin();
200 neighbor != neighbors.end();
H A Dgraph_algorithms.h125 // 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();
136 it != neighbors.end();
200 // to the independent set. Mark it black and its neighbors grey.
209 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); local
210 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();
211 it != neighbors.end();
295 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1); local
296 for (typename HashSet<Vertex>::const_iterator it2 = neighbors
[all...]
H A Dvisibility_based_preconditioner.cc514 const HashSet<int>& neighbors = forest.Neighbors(cluster1); local
515 for (HashSet<int>::const_iterator it2 = neighbors.begin();
516 it2 != neighbors.end();
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
H A Dvp9_scan.h31 const int16_t *neighbors; member in struct:__anon13134
37 static INLINE int get_coef_context(const int16_t *neighbors, argument
39 return (1 + token_cache[neighbors[MAX_NEIGHBORS * c + 0]] +
40 token_cache[neighbors[MAX_NEIGHBORS * c + 1]]) >> 1;
H A Dvp9_scan.c311 int16_t *neighbors) {
316 neighbors[MAX_NEIGHBORS * 0 + 0] = 0;
317 neighbors[MAX_NEIGHBORS * 0 + 1] = 0;
340 neighbors[MAX_NEIGHBORS * n + 0] =
341 neighbors[MAX_NEIGHBORS * n + 1] = a;
344 neighbors[MAX_NEIGHBORS * n + 0] =
345 neighbors[MAX_NEIGHBORS * n + 1] = b;
347 neighbors[MAX_NEIGHBORS * n + 0] = a;
348 neighbors[MAX_NEIGHBORS * n + 1] = b;
351 neighbors[MAX_NEIGHBOR
310 init_scan_neighbors(const int16_t *scan, int16_t *iscan, int l, int16_t *neighbors) argument
[all...]
/external/libvpx/libvpx/vp9/common/
H A Dvp9_scan.h31 const int16_t *neighbors; member in struct:__anon24925
37 static INLINE int get_coef_context(const int16_t *neighbors, argument
39 return (1 + token_cache[neighbors[MAX_NEIGHBORS * c + 0]] +
40 token_cache[neighbors[MAX_NEIGHBORS * c + 1]]) >> 1;
H A Dvp9_scan.c311 int16_t *neighbors) {
316 neighbors[MAX_NEIGHBORS * 0 + 0] = 0;
317 neighbors[MAX_NEIGHBORS * 0 + 1] = 0;
340 neighbors[MAX_NEIGHBORS * n + 0] =
341 neighbors[MAX_NEIGHBORS * n + 1] = a;
344 neighbors[MAX_NEIGHBORS * n + 0] =
345 neighbors[MAX_NEIGHBORS * n + 1] = b;
347 neighbors[MAX_NEIGHBORS * n + 0] = a;
348 neighbors[MAX_NEIGHBORS * n + 1] = b;
351 neighbors[MAX_NEIGHBOR
310 init_scan_neighbors(const int16_t *scan, int16_t *iscan, int l, int16_t *neighbors) argument
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/decoder/
H A Derror_concealment.c426 * The neighbors are enumerated with the upper-left neighbor as the first
432 EC_BLOCK *neighbors,
443 assign_neighbor(&neighbors[i], mi - mi_stride - 1, 15);
447 assign_neighbor(&neighbors[i], mi - mi_stride, j);
455 assign_neighbor(&neighbors[i], mi - mi_stride + 1, 12);
459 assign_neighbor(&neighbors[i], mi + 1, j);
467 assign_neighbor(&neighbors[i], mi + mi_stride + 1, 0);
471 assign_neighbor(&neighbors[i], mi + mi_stride, j);
479 assign_neighbor(&neighbors[i], mi + mi_stride - 1, 4);
484 assign_neighbor(&neighbors[
431 find_neighboring_blocks(MODE_INFO *mi, EC_BLOCK *neighbors, int mb_row, int mb_col, int mb_rows, int mb_cols, int mi_stride) argument
495 interpolate_mvs(MACROBLOCKD *mb, EC_BLOCK *neighbors, MV_REFERENCE_FRAME dom_ref_frame) argument
564 EC_BLOCK neighbors[NUM_NEIGHBORS]; local
[all...]
/external/libvpx/libvpx/vp8/decoder/
H A Derror_concealment.c428 * 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[
433 find_neighboring_blocks(MODE_INFO *mi, EC_BLOCK *neighbors, int mb_row, int mb_col, int mb_rows, int mb_cols, int mi_stride) argument
497 interpolate_mvs(MACROBLOCKD *mb, EC_BLOCK *neighbors, MV_REFERENCE_FRAME dom_ref_frame) argument
566 EC_BLOCK neighbors[NUM_NEIGHBORS]; local
[all...]
/external/opencv/cv/src/
H A Dcvcalibinit.cpp104 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[
[all...]
H A Dcvsnakes.cpp82 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;
[all...]
H A DmycvHaarDetectObjects.cpp1313 comps[idx].neighbors++;
1323 int n = comps[i].neighbors;
1331 comp.neighbors = n;
1342 // count number of neighbors
1349 comps[idx].neighbors++;
1361 int n = comps[i].neighbors;
1391 comp.neighbors = n;
1412 result_comp.neighbors = bseq == seq ? 1 : comp->neighbors;
1452 comp.neighbors
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
H A Dmcomp.c866 MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}} ; local
991 /* check 4 1-away neighbors */
1002 this_mv.as_mv.row = br + neighbors[i].row;
1003 this_mv.as_mv.col = bc + neighbors[i].col;
1012 this_mv.as_mv.row = br + neighbors[i].row;
1013 this_mv.as_mv.col = bc + neighbors[i].col;
1025 br += neighbors[best_site].row;
1026 bc += neighbors[best_site].col;
1729 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; local
1763 this_row_offset = ref_mv->as_mv.row + neighbors[
1809 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; local
[all...]
/external/libvpx/libvpx/vp8/encoder/
H A Dmcomp.c865 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
1762 this_row_offset = ref_mv->as_mv.row + neighbors[
1808 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; local
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_mcomp.c655 static const MV neighbors[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; local
659 const MV this_mv = {br + neighbors[i].row,
660 bc + neighbors[i].col};
670 const MV this_mv = {br + neighbors[i].row,
671 bc + neighbors[i].col};
690 // are 4 1-away neighbors, and sad_list is non-null
938 static const MV neighbors[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; local
943 const MV this_mv = {br + neighbors[i].row,
944 bc + neighbors[i].col};
951 const MV this_mv = {br + neighbors[
1633 const MV neighbors[4] = {{ -1, 0}, {0, -1}, {0, 1}, {1, 0}}; local
1712 const MV neighbors[8] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}, local
[all...]
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_mcomp.c657 // Check 4 1-away neighbors if do_refine is true.
660 static const MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}}; local
666 const MV this_mv = {br + neighbors[i].row,
667 bc + neighbors[i].col};
675 const MV this_mv = {br + neighbors[i].row,
676 bc + neighbors[i].col};
689 br += neighbors[best_site].row;
690 bc += neighbors[best_site].col;
1541 const MV neighbors[4] = {{ -1, 0}, {0, -1}, {0, 1}, {1, 0}}; local
1559 const MV mv = {ref_mv->row + neighbors[
1592 const MV neighbors[4] = {{ -1, 0}, {0, -1}, {0, 1}, {1, 0}}; local
1678 const MV neighbors[8] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}, local
[all...]
/external/opencv/ml/src/
H A Dmlknearest.cpp151 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" );
150 find_neighbors_direct( const CvMat* _samples, int k, int start, int end, float* neighbor_responses, const float** neighbors, float* dist ) const argument
/external/opencv/cv/include/
H A Dcvtypes.h378 int neighbors; member in struct:CvAvgComp
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/
H A Dlp_bld_sample_soa.c694 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[
[all...]
/external/mesa3d/src/gallium/auxiliary/gallivm/
H A Dlp_bld_sample_soa.c694 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[
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/decoder/
H A Dvp9_detokenize.c212 pd->dequant, ctx, so->scan, so->neighbors, r);
/external/libvpx/libvpx/vp9/decoder/
H A Dvp9_detokenize.c206 pd->dequant, ctx, so->scan, so->neighbors, r);

Completed in 623 milliseconds

12