| /tools/tradefederation/core/src/com/android/tradefed/util/ |
| DirectedGraph.java | 34 private Map<V,List<V>> neighbors = new HashMap<V, List<V>>(); field in class:DirectedGraph
42 for (V v: neighbors.keySet()) s.append("\n " + v + " -> " + neighbors.get(v));
50 if (neighbors.containsKey(vertex)) {
53 neighbors.put(vertex, new ArrayList<V>());
60 return neighbors.containsKey(vertex);
70 neighbors.get(from).add(to);
82 neighbors.get(from).remove(to);
91 for (V v: neighbors.keySet()) {
95 for (V from: neighbors.keySet())
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_scan.h | 29 const int16_t *neighbors; member in struct:__anon26190
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]]) >>
|
| /external/libvpx/libvpx/vp8/decoder/ |
| error_concealment.c | 355 * The neighbors are enumerated with the upper-left neighbor as the first
360 static void find_neighboring_blocks(MODE_INFO *mi, EC_BLOCK *neighbors,
367 if (mb_col > 0) assign_neighbor(&neighbors[i], mi - mi_stride - 1, 15);
371 assign_neighbor(&neighbors[i], mi - mi_stride, j);
376 if (mb_row > 0) assign_neighbor(&neighbors[i], mi - mi_stride + 1, 12);
379 for (j = 0; j <= 12; j += 4, ++i) assign_neighbor(&neighbors[i], mi + 1, j);
385 assign_neighbor(&neighbors[i], mi + mi_stride + 1, 0);
389 assign_neighbor(&neighbors[i], mi + mi_stride, j);
395 assign_neighbor(&neighbors[i], mi + mi_stride - 1, 4);
399 assign_neighbor(&neighbors[i], mi - 1, j)
464 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...] |
| mycvHaarDetectObjects.cpp | [all...] |
| cvhaar.cpp | [all...] |
| /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,
|
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| lp_bld_sample_aos.c | 851 LLVMValueRef neighbors[2][2][2]; \/* [z][y][x] *\/ local
[all...] |
| lp_bld_sample_soa.c | 895 LLVMValueRef neighbors[2][2][4]; local
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| mcomp.c | 846 MV neighbors[4] = { { 0, -1 }, { -1, 0 }, { 1, 0 }, { 0, 1 } }; local
978 /* check 4 1-away neighbors */
986 this_mv.as_mv.row = br + neighbors[i].row;
987 this_mv.as_mv.col = bc + neighbors[i].col;
995 this_mv.as_mv.row = br + neighbors[i].row;
996 this_mv.as_mv.col = bc + neighbors[i].col;
1008 br += neighbors[best_site].row;
1009 bc += neighbors[best_site].col;
1638 MV neighbors[4] = { { -1, 0 }, { 0, -1 }, { 0, 1 }, { 1, 0 } }; local
1716 MV neighbors[4] = { { -1, 0 }, { 0, -1 }, { 0, 1 }, { 1, 0 } }; local
[all...] |
| /external/libvpx/libvpx/vp9/decoder/ |
| vp9_detokenize.c | 252 dequant, ctx, sc->scan, sc->neighbors, r);
260 dequant, ctx, sc->scan, sc->neighbors, r);
269 dequant, ctx, sc->scan, sc->neighbors, r);
281 dequant, ctx, sc->scan, sc->neighbors, r);
|
| /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" );
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/ |
| ProximityInfo.java | 259 // Since in the practice each cell does not have a lot of neighbors, most of this space is
361 final ArrayList<Key> neighbors = new ArrayList<>(indexEnd - indexStart); local
363 neighbors.add(neighborsFlatBuffer[index]);
365 mGridNeighbors[i] = Collections.unmodifiableList(neighbors);
|
| /external/opencv/cv/include/ |
| cvtypes.h | 378 int neighbors; member in struct:CvAvgComp
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_mcomp.c | 818 static const MV neighbors[4] = { { 0, -1 }, { 1, 0 }, { 0, 1 }, { -1, 0 } }; local
1272 static const MV neighbors[4] = { { 0, -1 }, { 1, 0 }, { 0, 1 }, { -1, 0 } }; local
2050 const MV neighbors[4] = { { -1, 0 }, { 0, -1 }, { 0, 1 }, { 1, 0 } }; local
2124 const MV neighbors[8] = { { -1, 0 }, { 0, -1 }, { 0, 1 }, { 1, 0 }, local
[all...] |
| vp9_tokenize.c | 383 nb = so->neighbors;
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| PhotoView.java | [all...] |
| /packages/apps/Settings/src/com/android/settings/widget/ |
| ChartSweepView.java | 161 public void setNeighbors(ChartSweepView... neighbors) {
162 mNeighbors = neighbors;
|
| /external/ImageMagick/www/api/ |
| effect.php | 195 <p>DespeckleImage() reduces the speckle noise in an image while perserving the edges of the original image. A speckle removing filter uses a complementary hulling technique (raising pixels that are darker than their surrounding neighbors, then complementarily lowering pixels that are brighter than their surrounding neighbors) to reduce the speckle index of that image (reference Crimmins speckle removal).</p>
|
| /external/opencv/ml/include/ |
| ml.h | 274 // k Nearest Neighbors
290 const float** neighbors=0, CvMat* neighbor_responses=0, CvMat* dist=0 ) const;
305 float* neighbor_responses, const float** neighbors, float* dist ) const;
[all...] |
| /prebuilts/go/darwin-x86/src/math/big/ |
| ftoa.go | 203 // would round to the original mantissa and not the neighbors.
|
| /prebuilts/go/darwin-x86/src/strconv/ |
| ftoa.go | 283 // would round to the original mantissa and not the neighbors.
|
| /prebuilts/go/linux-x86/src/math/big/ |
| ftoa.go | 203 // would round to the original mantissa and not the neighbors.
|
