| /frameworks/base/services/accessibility/java/com/android/server/accessibility/ |
| GestureUtils.java | 27 int timeout, int distance, int actionIndex) {
32 if (deltaMove >= distance) {
|
| /frameworks/support/compat/java/android/support/v4/view/ |
| NestedScrollingParent.java | 102 * <p>Both the consumed and unconsumed portions of the scroll distance are reported to the
110 * @param dxConsumed Horizontal scroll distance in pixels already consumed by target
111 * @param dyConsumed Vertical scroll distance in pixels already consumed by target
112 * @param dxUnconsumed Horizontal scroll distance in pixels not consumed by target
113 * @param dyUnconsumed Vertical scroll distance in pixels not consumed by target
134 * @param dx Horizontal scroll distance in pixels
135 * @param dy Vertical scroll distance in pixels
136 * @param consumed Output. The horizontal and vertical scroll distance consumed by this parent
|
| /frameworks/support/v17/leanback/api21/android/support/v17/leanback/transition/ |
| TransitionHelperApi21.java | 98 public static Object createFadeAndShortSlide(int edge, float distance) {
100 slide.setDistance(distance);
|
| /hardware/bsp/intel/peripheral/libupm/examples/javascript/ |
| maxsonarez.js | 38 // Every second, sample the sonar and output the distance to an
47 ", distance in inches: " + mySonar.inches());
|
| /hardware/bsp/intel/peripheral/libupm/examples/python/ |
| maxsonarez.py | 50 # Every second, sample the sonar and output the distance to an
57 print "AREF: {0}, distance in inches: {1}".format(
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/ |
| assign_initializer_list.pass.cpp | 43 assert(distance(m.begin(), m.end()) == 3);
68 assert(distance(m.begin(), m.end()) == 3);
|
| initializer_list.pass.cpp | 39 assert(distance(m.begin(), m.end()) == 3);
60 assert(distance(m.begin(), m.end()) == 3);
|
| initializer_list_compare.pass.cpp | 39 assert(distance(m.begin(), m.end()) == 3);
61 assert(distance(m.begin(), m.end()) == 3);
|
| iter_iter.pass.cpp | 40 assert(distance(m.begin(), m.end()) == 3);
62 assert(distance(m.begin(), m.end()) == 3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| insert_initializer_list.pass.cpp | 41 assert(distance(m.begin(), m.end()) == 3);
64 assert(distance(m.begin(), m.end()) == 3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| insert_initializer_list.pass.cpp | 30 assert(distance(m.begin(), m.end()) == m.size());
49 assert(distance(m.begin(), m.end()) == m.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| assign_initializer_list.pass.cpp | 30 assert(distance(m.begin(), m.end()) == 6);
47 assert(distance(m.begin(), m.end()) == 6);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| insert_initializer_list.pass.cpp | 30 assert(distance(m.begin(), m.end()) == m.size());
48 assert(distance(m.begin(), m.end()) == m.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
| assign_initializer_list.pass.cpp | 30 assert(distance(m.begin(), m.end()) == 6);
46 assert(distance(m.begin(), m.end()) == 6);
|
| copy_alloc.pass.cpp | 44 assert(distance(m.begin(), m.end()) == 3);
52 assert(distance(mo.begin(), mo.end()) == 3);
|
| initializer_list.pass.cpp | 29 assert(distance(m.begin(), m.end()) == 6);
44 assert(distance(m.begin(), m.end()) == 6);
|
| iter_iter.pass.cpp | 42 assert(distance(m.begin(), m.end()) == 3);
65 assert(distance(m.begin(), m.end()) == 3);
|
| iter_iter_alloc.pass.cpp | 52 assert(distance(m.begin(), m.end()) == 3);
77 assert(distance(m.begin(), m.end()) == 3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| iter_iter_alloc.pass.cpp | 31 assert(d.size() == std::distance(f, l));
32 assert(distance(d.begin(), d.end()) == d.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
| assign_move.pass.cpp | 71 assert(std::distance(c.begin(), c.end()) == c.size());
72 assert(std::distance(c.cbegin(), c.cend()) == c.size());
116 assert(std::distance(c.begin(), c.end()) == c.size());
117 assert(std::distance(c.cbegin(), c.cend()) == c.size());
162 assert(std::distance(c.begin(), c.end()) == c.size());
163 assert(std::distance(c.cbegin(), c.cend()) == c.size());
209 assert(std::distance(c.begin(), c.end()) == c.size());
210 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/stream.iterators/istream.iterator/ |
| types.pass.cpp | 13 // class Distance = ptrdiff_t>
15 // : public iterator<input_iterator_tag, T, Distance, const T*, const T&>
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| LocationClustering.java | 38 // If the total distance change is less than this ratio, stop iterating.
222 // (sum of distance from each point to its group center) * sqrt(k).
255 float distance = (float) GalleryUtils.fastDistanceMeters( local
257 // We may have small non-zero distance introduced by
260 if (distance < 1) {
261 distance = 0;
263 if (distance < bestDistance) {
264 bestDistance = distance;
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/result/ |
| suggestions_output_utils.cpp | 204 // Get the distance for the first word of the suggestion
205 const float distance = terminalDicNode->getNormalizedCompoundDistanceAfterFirstWord(); local
217 // Expected distance is about 0.2 ~ 2.0, but consider 0.0 ~ 2.0
227 // The smaller the edit distance, the higher the contribution. MIN_EXPECTED_DISTANCE means 0
229 // weight of the distance. Clamp to avoid overflows.
230 const float clampedDistance = distance < MIN_EXPECTED_DISTANCE ? MIN_EXPECTED_DISTANCE
231 : distance > MAX_EXPECTED_DISTANCE ? MAX_EXPECTED_DISTANCE : distance;
|
| /external/llvm/lib/Analysis/ |
| LoopAccessAnalysis.cpp | [all...] |
| /external/opencv3/3rdparty/zlib/ |
| deflate.h | 40 /* number of distance codes */
119 * bytes. With this organization, matches are limited to a distance of
196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
200 struct tree_desc_s d_desc; /* desc. for distance tree */
307 /* Mapping from a distance to a distance code. dist is the distance - 1 and
330 # define _tr_tally_dist(s, distance, length, flush) \
332 ush dist = (distance); \
342 # define _tr_tally_dist(s, distance, length, flush)
[all...] |
