| /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 | 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...] |
| 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 | 170 // 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();
|
| single_linkage_clustering.cc | 63 const HashSet<int>& neighbors = graph.Neighbors(vertex1); local
64 for (HashSet<int>::const_iterator it2 = neighbors.begin();
65 it2 != neighbors.end();
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_scan.h | 29 const int16_t *neighbors; member in struct:__anon16583
35 static INLINE int get_coef_context(const int16_t *neighbors,
37 return (1 + token_cache[neighbors[MAX_NEIGHBORS * c + 0]] +
38 token_cache[neighbors[MAX_NEIGHBORS * c + 1]]) >> 1;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/ |
| vp9_scan.h | 31 const int16_t *neighbors; member in struct:__anon30224
37 static INLINE int get_coef_context(const int16_t *neighbors,
39 return (1 + token_cache[neighbors[MAX_NEIGHBORS * c + 0]] +
40 token_cache[neighbors[MAX_NEIGHBORS * c + 1]]) >> 1;
|
| vp9_scan.c | 311 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_NEIGHBORS * n + 0]
[all...] |
| /external/opencv3/modules/features2d/test/ |
| test_nearestneighbors.cpp | 69 virtual int findNeighbors( Mat& points, Mat& neighbors ) = 0;
167 int knnSearch( Mat& points, Mat& neighbors );
168 int radiusSearch( Mat& points, Mat& neighbors );
178 int CV_FlannTest::knnSearch( Mat& points, Mat& neighbors )
180 Mat dist( points.rows, neighbors.cols, CV_32FC1);
184 index->knnSearch( points, neighbors, dist, knn, SearchParams() );
187 Mat neighbors1( neighbors.size(), CV_32SC1 );
201 if( cvtest::norm( neighbors, neighbors1, NORM_L1 ) != 0 )
207 int CV_FlannTest::radiusSearch( Mat& points, Mat& neighbors )
209 Mat dist( 1, neighbors.cols, CV_32FC1)
[all...] |
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| result_set.h | 44 /* This record represents a branch point when finding neighbors in
283 /** Class that holds the k NN neighbors
325 * @param n_neighbors the number of neighbors to copy
349 * @param n_neighbors the number of neighbors to copy
356 /** The number of neighbors in the set
365 * If we don't have enough neighbors, it returns the max possible value
385 /** Class that holds the k NN neighbors
393 * @param capacity the number of neighbors to store at max
401 /** Add a possible candidate to the best neighbors
438 /** The number of neighbors to keep *
[all...] |
| nn_index.h | 62 * \param[in] queries The query points for which to find the nearest neighbors
63 * \param[out] indices The indices of the nearest neighbors found
64 * \param[out] dists Distances to the nearest neighbors found
65 * \param[in] knn Number of nearest neighbors to return
96 * \param[out] indices The indinces of the neighbors found within the given radius
97 * \param[out] dists The distances to the nearest neighbors found
100 * \returns Number of neighbors found
|
| flann_base.hpp | 208 * \param[in] queries The query points for which to find the nearest neighbors
209 * \param[out] indices The indices of the nearest neighbors found
210 * \param[out] dists Distances to the nearest neighbors found
211 * \param[in] knn Number of nearest neighbors to return
222 * \param[out] indices The indinces of the neighbors found within the given radius
223 * \param[out] dists The distances to the nearest neighbors found
226 * \returns Number of neighbors found
|
| index_testing.h | 48 inline int countCorrectMatches(int* neighbors, int* groundTruth, int n)
53 if (neighbors[i]==groundTruth[k]) {
65 int* neighbors, int* groundTruth, int veclen, int n, const Distance& distance)
72 DistanceType num = distance(inputData[neighbors[i]], target, veclen);
95 throw FLANNException("Ground truth is not computed for as many neighbors as requested");
103 int* neighbors = &indices[skipMatches]; local
118 correct += countCorrectMatches(neighbors,matches[i], nn);
119 distR += computeDistanceRaport<Distance>(inputData, testData[i], neighbors, matches[i], (int)testData.cols, nn, distance);
|
| lsh_index.h | 184 * \param[in] queries The query points for which to find the nearest neighbors
185 * \param[out] indices The indices of the nearest neighbors found
186 * \param[out] dists Distances to the nearest neighbors found
187 * \param[in] knn Number of nearest neighbors to return
212 * Find set of nearest neighbors to vec. Their indices are stored inside
216 * result = the result object in which the indices of the nearest-neighbors are stored
217 * vec = the vector for which to search the nearest neighbors
237 /** Fills the different xor masks to use when getting the neighbors in multi-probe LSH
238 * @param key the key we build neighbors from
260 * @param k_nn the number of nearest neighbors
[all...] |
| /external/opencv3/modules/calib3d/src/ |
| calibinit.cpp | 115 struct CvCBCorner* neighbors[4]; // Neighbor corners member in struct:CvCBCorner
123 if( neighbors[i] )
125 float dx = neighbors[i]->pt.x - pt.x;
126 float dy = neighbors[i]->pt.y - pt.y;
142 int count; // Number of quad neighbors
145 bool ordered; // true if corners/neighbors are ordered counter-clockwise
147 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0
149 struct CvCBQuad *neighbors[4]; // Pointers of quad neighbors member in struct:CvCBQuad
406 // Find quad's neighbors
[all...] |
| /external/opencv3/modules/ml/src/ |
| kdtree.hpp | 21 find the K nearest neighbors among the vectors from the initial set.
67 //! finds the K nearest neighbors of "vec" while looking at Emax (at most) leaves
70 OutputArray neighbors = noArray(),
77 OutputArray neighbors = noArray(),
|
| /external/libvpx/libvpx/vp8/decoder/ |
| error_concealment.c | 427 * The neighbors are enumerated with the upper-left neighbor as the first
433 EC_BLOCK *neighbors,
444 assign_neighbor(&neighbors[i], mi - mi_stride - 1, 15);
448 assign_neighbor(&neighbors[i], mi - mi_stride, j);
456 assign_neighbor(&neighbors[i], mi - mi_stride + 1, 12);
460 assign_neighbor(&neighbors[i], mi + 1, j);
468 assign_neighbor(&neighbors[i], mi + mi_stride + 1, 0);
472 assign_neighbor(&neighbors[i], mi + mi_stride, j);
480 assign_neighbor(&neighbors[i], mi + mi_stride - 1, 4);
485 assign_neighbor(&neighbors[i], mi - 1, j)
565 EC_BLOCK neighbors[NUM_NEIGHBORS]; local
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/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...] |
| /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" );
|
| /prebuilts/go/darwin-x86/doc/play/ |
| life.go | 54 // exactly 3 neighbors: on,
55 // exactly 2 neighbors: maintain current state,
|
| /prebuilts/go/linux-x86/doc/play/ |
| life.go | 54 // exactly 3 neighbors: on,
55 // exactly 2 neighbors: maintain current state,
|
| /packages/apps/TV/res/layout/ |
| item_list.xml | 32 To work around, this view takes up extra space up to its neighbors using negative margins,
|
