| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.swap/ |
| swap_non_member.pass.cpp | 45 assert(std::distance(c1.begin(), c1.end()) == c1.size());
46 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
54 assert(std::distance(c2.begin(), c2.end()) == c2.size());
55 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
93 assert(std::distance(c1.begin(), c1.end()) == c1.size());
94 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
102 assert(std::distance(c2.begin(), c2.end()) == c2.size());
103 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
131 assert(std::distance(c1.begin(), c1.end()) == c1.size());
132 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| assign_init.pass.cpp | 56 assert(std::distance(eq.first, eq.second) == 2);
64 assert(std::distance(eq.first, eq.second) == 2);
73 assert(std::distance(eq.first, eq.second) == 1);
78 assert(std::distance(eq.first, eq.second) == 1);
82 assert(std::distance(c.begin(), c.end()) == c.size());
83 assert(std::distance(c.cbegin(), c.cend()) == c.size());
113 assert(std::distance(eq.first, eq.second) == 2);
121 assert(std::distance(eq.first, eq.second) == 2);
130 assert(std::distance(eq.first, eq.second) == 1);
135 assert(std::distance(eq.first, eq.second) == 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_const_iter.pass.cpp | 45 assert(std::distance(eq.first, eq.second) == 2);
53 assert(std::distance(eq.first, eq.second) == 1);
58 assert(std::distance(eq.first, eq.second) == 1);
63 assert(std::distance(eq.first, eq.second) == 1);
67 assert(std::distance(c.begin(), c.end()) == c.size());
68 assert(std::distance(c.cbegin(), c.cend()) == c.size());
91 assert(std::distance(eq.first, eq.second) == 2);
99 assert(std::distance(eq.first, eq.second) == 1);
104 assert(std::distance(eq.first, eq.second) == 1);
109 assert(std::distance(eq.first, eq.second) == 1)
[all...] |
| insert_init.pass.cpp | 45 assert(std::distance(eq.first, eq.second) == 2);
53 assert(std::distance(eq.first, eq.second) == 2);
61 assert(std::distance(eq.first, eq.second) == 1);
66 assert(std::distance(eq.first, eq.second) == 1);
70 assert(std::distance(c.begin(), c.end()) == c.size());
71 assert(std::distance(c.cbegin(), c.cend()) == c.size());
92 assert(std::distance(eq.first, eq.second) == 2);
100 assert(std::distance(eq.first, eq.second) == 2);
108 assert(std::distance(eq.first, eq.second) == 1);
113 assert(std::distance(eq.first, eq.second) == 1)
[all...] |
| insert_range.pass.cpp | 45 assert(std::distance(eq.first, eq.second) == 2);
53 assert(std::distance(eq.first, eq.second) == 2);
61 assert(std::distance(eq.first, eq.second) == 1);
66 assert(std::distance(eq.first, eq.second) == 1);
70 assert(std::distance(c.begin(), c.end()) == c.size());
71 assert(std::distance(c.cbegin(), c.cend()) == c.size());
92 assert(std::distance(eq.first, eq.second) == 2);
100 assert(std::distance(eq.first, eq.second) == 2);
108 assert(std::distance(eq.first, eq.second) == 1);
113 assert(std::distance(eq.first, eq.second) == 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| swap_member.pass.cpp | 44 assert(std::distance(c1.begin(), c1.end()) == c1.size());
45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
53 assert(std::distance(c2.begin(), c2.end()) == c2.size());
54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
92 assert(std::distance(c1.begin(), c1.end()) == c1.size());
93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
101 assert(std::distance(c2.begin(), c2.end()) == c2.size());
102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
130 assert(std::distance(c1.begin(), c1.end()) == c1.size());
131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/ |
| swap_non_member.pass.cpp | 44 assert(std::distance(c1.begin(), c1.end()) == c1.size());
45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
53 assert(std::distance(c2.begin(), c2.end()) == c2.size());
54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
92 assert(std::distance(c1.begin(), c1.end()) == c1.size());
93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
101 assert(std::distance(c2.begin(), c2.end()) == c2.size());
102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
130 assert(std::distance(c1.begin(), c1.end()) == c1.size());
131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| swap_member.pass.cpp | 44 assert(std::distance(c1.begin(), c1.end()) == c1.size());
45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
53 assert(std::distance(c2.begin(), c2.end()) == c2.size());
54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
92 assert(std::distance(c1.begin(), c1.end()) == c1.size());
93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
101 assert(std::distance(c2.begin(), c2.end()) == c2.size());
102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
130 assert(std::distance(c1.begin(), c1.end()) == c1.size());
131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
| swap_non_member.pass.cpp | 44 assert(std::distance(c1.begin(), c1.end()) == c1.size());
45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
53 assert(std::distance(c2.begin(), c2.end()) == c2.size());
54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
92 assert(std::distance(c1.begin(), c1.end()) == c1.size());
93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
101 assert(std::distance(c2.begin(), c2.end()) == c2.size());
102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
130 assert(std::distance(c1.begin(), c1.end()) == c1.size());
131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size())
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/ |
| size_impl.hpp | 19 #include <boost/mpl/distance.hpp>
33 : distance<
40 typedef typename distance<
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/ |
| btComputeGjkEpaPenetration.h | 72 btScalar distance=btScalar(0.); local
254 distance = ((btScalar(1.)/rlen) - margin);
265 (m_catchDegeneracies && m_degenerateSimplex && ((distance+margin) < 0.01));
298 if (!isValid || (distance2 < distance))
300 distance = distance2;
320 ///reports a valid positive distance. Use the results of the second GJK instead of failing.
328 //only replace valid distances when the distance is less
329 if (!isValid || (distance2 < distance))
331 distance = distance2;
352 if (isValid && ((distance < 0) || (distance*distance < colDesc.m_maximumDistanceSquared))
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_parametrizedline.cpp | 39 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(p0), RealScalar(1) );
40 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(p0+s0*d0), RealScalar(1) );
41 VERIFY_IS_APPROX( (l0.projection(p1)-p1).norm(), l0.distance(p1) );
42 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(l0.projection(p1)), RealScalar(1) );
43 VERIFY_IS_APPROX( Scalar(l0.distance((p0+s0*d0) + d0.unitOrthogonal() * s1)), s1 );
|
| /external/libcxx/test/std/containers/sequences/list/list.cons/ |
| default_stack_alloc.pass.cpp | 24 assert(std::distance(l.begin(), l.end()) == 0);
29 assert(std::distance(l.begin(), l.end()) == 0);
34 assert(std::distance(l.begin(), l.end()) == 0);
40 assert(std::distance(l.begin(), l.end()) == 0);
45 assert(std::distance(l.begin(), l.end()) == 0);
|
| size_type.pass.cpp | 30 assert(std::distance(d.begin(), d.end()) == n);
42 assert(std::distance(l.begin(), l.end()) == 3);
53 assert(std::distance(l.begin(), l.end()) == 3);
66 assert(std::distance(l.begin(), l.end()) == 3);
80 assert(std::distance(l.begin(), l.end()) == 3);
87 assert(std::distance(l.begin(), l.end()) == 3);
99 assert(std::distance(l.begin(), l.end()) == 3);
|
| /external/libgdx/extensions/gdx-tools/src/com/badlogic/gdx/tools/distancefield/ |
| DistanceFieldGenerator.java | 27 * Generates a signed distance field image from a binary (black/white) source image.
29 * <p> Signed distance fields are used in Team Fortress 2 by Valve to enable
69 * <p> For greater accuracy, images to be used as input for a distance field are often
87 * Sets the spread of the distance field. The spread is the maximum distance in pixels
88 * that we'll scan while for a nearby edge. The resulting distance is also normalized
101 * Caclulate the squared distance between two points
107 * @return The squared distance between the two points
117 * Process the image into a distance field.
128 * @return the distance field imag
[all...] |
| /external/opencv3/modules/flann/src/ |
| flann.cpp | 34 /** Global variable indicating the distance metric to be used.
41 * Set distance type to used
47 "use cv::flann::GenericIndex<Distance> instead.\n");
51 "For other distance types you must use cv::flann::GenericIndex<Distance>\n");
|
| /frameworks/base/core/java/android/gesture/ |
| InstanceLearner.java | 54 double distance; local
56 distance = GestureUtils.minimumCosineDistance(sample.vector, vector, orientationType);
58 distance = GestureUtils.squaredEuclideanDistance(sample.vector, vector);
61 if (distance == 0) {
64 weight = 1 / distance;
|
| /hardware/bsp/intel/peripheral/libupm/src/rfr359f/ |
| rfr359f.h | 32 * @brief RFR359 Distance Interrupter library
39 * @comname RFR359F Distance Interrupter
40 * @altname Grove Distance Interrupter
47 * @brief API for the RFR359F-based Grove Distance Interrupter.
49 * UPM module for the Grove distance interrupter. The sensitivity
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| default_stack_alloc.pass.cpp | 24 assert(std::distance(l.begin(), l.end()) == 0);
29 assert(std::distance(l.begin(), l.end()) == 0);
34 assert(std::distance(l.begin(), l.end()) == 0);
40 assert(std::distance(l.begin(), l.end()) == 0);
45 assert(std::distance(l.begin(), l.end()) == 0);
|
| size_type.pass.cpp | 30 assert(std::distance(d.begin(), d.end()) == n);
42 assert(std::distance(l.begin(), l.end()) == 3);
53 assert(std::distance(l.begin(), l.end()) == 3);
66 assert(std::distance(l.begin(), l.end()) == 3);
80 assert(std::distance(l.begin(), l.end()) == 3);
87 assert(std::distance(l.begin(), l.end()) == 3);
99 assert(std::distance(l.begin(), l.end()) == 3);
|
| /packages/apps/Gallery2/res/values/ |
| filtershow_values.xml | 39 <!-- Grad filter minimum touch distance -->
42 <!-- Grad filter minimum touch distance -->
45 <!-- Grad filter minimum touch distance -->
48 <!-- Grad filter minimum touch distance -->
51 <!-- Grad filter minimum touch distance -->
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| composite_index.h | 70 template <typename Distance>
71 class CompositeIndex : public NNIndex<Distance>
74 typedef typename Distance::ElementType ElementType;
75 typedef typename Distance::ResultType DistanceType;
81 * @param d Distance functor
85 Distance d = Distance()) : index_params_(params)
87 kdtree_index_ = new KDTreeIndex<Distance>(inputData, params, d);
88 kmeans_index_ = new KMeansIndex<Distance>(inputData, params, d);
183 KMeansIndex<Distance>* kmeans_index_
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| SelectionHandle.java | 107 * Determines whether the given {@link LayoutPoint} is within the given distance in
108 * layout coordinates. The distance should incorporate at least the equivalent
109 * distance to the control coordinate space {@link #PIXEL_RADIUS}, but usually with a
113 * @param distance the distance from the center of the handle to check whether the
115 * @return true if the given point is within the given distance of this handle
117 public boolean contains(LayoutPoint point, int distance) {
118 return (point.x >= centerX - distance
119 && point.x <= centerX + distance
120 && point.y >= centerY - distance
[all...] |
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/ |
| DeltaInputStream.java | 25 * Smallest supported delta calculation distance.
30 * Largest supported delta calculation distance.
42 * Creates a new Delta decoder with the given delta calculation distance.
47 * @param distance delta calculation distance, must be in the
51 public DeltaInputStream(InputStream in, int distance) {
58 this.delta = new DeltaDecoder(distance);
|
| /external/skia/src/core/ |
| SkDistanceFieldGen.cpp | 13 float fDistSq; // distance squared to nearest (so far) edge texel
14 SkPoint fDistVector; // distance vector to nearest (so far) edge texel
107 // computes the distance to an edge given an edge normal vector and a pixel's alpha value
112 float distance; local
114 distance = 0.5f - alpha;
128 // we now compute the approximate distance, depending where the alpha falls
134 distance = 0.5f*(dx + dy) - SkScalarSqrt(2.0f*dx*dy*alpha);
137 distance = (0.5f - alpha)*dx;
141 distance = -0.5f*(dx + dy) + SkScalarSqrt(2.0f*dx*dy*(1.0f - alpha));
145 return distance;
[all...] |
