| /external/skia/include/effects/ |
| Sk1DPathEffect.h | 27 /** Called with the current distance along the path, with the current matrix
28 for the point/tangent at the specified distance.
29 Return the distance to travel for the next call. If return <= 0, then that
55 @param phase distance (mod advance) along path for its initial position
|
| /external/skia/src/gpu/text/ |
| GrDistanceFieldAdjustTable.h | 14 // Distance field text needs this table to compute a value for use in the fragment shader.
|
| /hardware/bsp/intel/peripheral/libupm/examples/java/ |
| HCSR04Sample.java | 48 System.out.println("Get distance");
49 double distance = sonar.getDistance(upm_hcsr04.javaupm_hcsr04Constants.CM); local
50 System.out.println("Distance: " + distance);
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_temporal_filter.h | 18 void vp9_temporal_filter_prepare(VP9_COMP *cpi, int distance);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_front.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 1);
33 assert(distance(c.begin(), c.end()) == 2);
42 assert(distance(c.begin(), c.end()) == 1);
46 assert(distance(c.begin(), c.end()) == 2);
|
| push_front_rv.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 1);
33 assert(distance(c.begin(), c.end()) == 2);
42 assert(distance(c.begin(), c.end()) == 1);
46 assert(distance(c.begin(), c.end()) == 2);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.capacity/ |
| resize_size_value.pass.cpp | 25 assert(std::distance(l.begin(), l.end()) == 2);
32 assert(std::distance(l.begin(), l.end()) == 10);
41 assert(std::distance(l.begin(), l.end()) == 2);
48 assert(std::distance(l.begin(), l.end()) == 10);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| move.pass.cpp | 60 assert(std::distance(c.begin(), c.end()) == c.size());
61 assert(std::distance(c.cbegin(), c.cend()) == c.size());
94 assert(std::distance(eq.first, eq.second) == 2);
102 assert(std::distance(eq.first, eq.second) == 2);
111 assert(std::distance(eq.first, eq.second) == 1);
116 assert(std::distance(eq.first, eq.second) == 1);
120 assert(std::distance(c.begin(), c.end()) == c.size());
121 assert(std::distance(c.cbegin(), c.cend()) == c.size());
160 assert(std::distance(c.begin(), c.end()) == c.size());
161 assert(std::distance(c.cbegin(), c.cend()) == c.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| iterators.fail.cpp | 43 assert(std::distance(c.begin(), c.end()) == c.size());
44 assert(std::distance(c.cbegin(), c.cend()) == c.size());
64 assert(std::distance(c.begin(), c.end()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| iterators.fail.cpp | 43 assert(std::distance(c.begin(), c.end()) == c.size());
44 assert(std::distance(c.cbegin(), c.cend()) == c.size());
64 assert(std::distance(c.begin(), c.end()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/vector/aux_/ |
| iterator.hpp | 82 , typename Distance
84 struct advance< v_iter<Vector,n_>,Distance>
88 , (n_ + BOOST_MPL_AUX_NESTED_VALUE_WKND(long, Distance))
97 struct distance< v_iter<Vector,n_>, v_iter<Vector,m_> > struct in namespace:boost::mpl
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| ScrollerHelper.java | 84 // Returns the distance that over the scroll limit.
85 public int startScroll(int distance, int min, int max) {
89 int newPosition = Utils.clamp(finalPosition + distance, min, max);
95 return finalPosition + distance - newPosition;
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/util/ |
| LevenshteinDistance.java | 20 * This class represents the matrix used in the Levenshtein distance algorithm, together
60 * Implementation of Levenshtein distance algorithm.
62 * @return The Levenshtein distance.
77 int distance = distTab[s-1][t] + 1; local
81 if (d + 1 < distance ) {
82 distance = d + 1;
87 if (d + cost < distance) {
88 distance = d + cost;
91 distTab[s][t] = distance;
|
| /external/opencv3/modules/cudafeatures2d/src/ |
| brute_force_matcher.cpp | 59 const PtrStepSzi& trainIdx, const PtrStepSzf& distance,
62 const PtrStepSzi& trainIdx, const PtrStepSzf& distance,
65 const PtrStepSzi& trainIdx, const PtrStepSzf& distance,
69 const PtrStepSzi& trainIdx, const PtrStepSzi& imgIdx, const PtrStepSzf& distance,
72 const PtrStepSzi& trainIdx, const PtrStepSzi& imgIdx, const PtrStepSzf& distance,
75 const PtrStepSzi& trainIdx, const PtrStepSzi& imgIdx, const PtrStepSzf& distance,
82 const PtrStepSzb& trainIdx, const PtrStepSzb& distance, const PtrStepSzf& allDist,
85 const PtrStepSzb& trainIdx, const PtrStepSzb& distance, const PtrStepSzf& allDist,
88 const PtrStepSzb& trainIdx, const PtrStepSzb& distance, const PtrStepSzf& allDist,
92 const PtrStepSzb& trainIdx, const PtrStepSzb& imgIdx, const PtrStepSzb& distance,
[all...] |
| /art/runtime/interpreter/mterp/arm/ |
| op_shl_long.S | 4 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
5 * 6 bits of the shift distance.
|
| op_shr_long.S | 4 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
5 * 6 bits of the shift distance.
|
| op_ushr_long.S | 4 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
5 * 6 bits of the shift distance.
|
| /art/runtime/interpreter/mterp/mips/ |
| op_shl_long.S | 4 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
5 * 6 bits of the shift distance.
|
| op_shr_long.S | 4 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
5 * 6 bits of the shift distance.
|
| op_ushr_long.S | 4 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
5 * 6 bits of the shift distance.
|
| /art/runtime/interpreter/mterp/x86/ |
| op_shl_long.S | 4 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
5 * 6 bits of the shift distance. x86 shifts automatically mask off
|
| op_shr_long.S | 4 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
5 * 6 bits of the shift distance. x86 shifts automatically mask off
|
| op_ushr_long.S | 4 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
5 * 6 bits of the shift distance. x86 shifts automatically mask off
|
| /external/ImageMagick/Magick++/lib/Magick++/ |
| TypeMetric.h | 30 // Ascent, the distance in pixels from the text baseline to the
34 // Descent, the distance in pixels from the baseline to the lowest
|
| /external/clang/unittests/AST/ |
| ASTTypeTraitsTest.cpp | 44 unsigned Distance = 1;
45 EXPECT_TRUE(DNT<Expr>().isBaseOf(DNT<Expr>(), &Distance));
46 EXPECT_EQ(0u, Distance);
48 EXPECT_TRUE(DNT<Stmt>().isBaseOf(DNT<IfStmt>(), &Distance));
49 EXPECT_EQ(1u, Distance);
51 Distance = 3;
52 EXPECT_TRUE(DNT<DeclaratorDecl>().isBaseOf(DNT<ParmVarDecl>(), &Distance));
53 EXPECT_EQ(2u, Distance);
|
