| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| init_size_hash_equal_allocator.pass.cpp | 61 assert(std::distance(c.begin(), c.end()) == c.size());
62 assert(std::distance(c.cbegin(), c.cend()) == c.size());
97 assert(std::distance(c.begin(), c.end()) == c.size());
98 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| range_size.pass.cpp | 60 assert(std::distance(c.begin(), c.end()) == c.size());
61 assert(std::distance(c.cbegin(), c.cend()) == c.size());
95 assert(std::distance(c.begin(), c.end()) == c.size());
96 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| range_size_hash.pass.cpp | 62 assert(std::distance(c.begin(), c.end()) == c.size());
63 assert(std::distance(c.cbegin(), c.cend()) == c.size());
98 assert(std::distance(c.begin(), c.end()) == c.size());
99 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| assign_init.pass.cpp | 57 assert(std::distance(c.begin(), c.end()) == c.size());
58 assert(std::distance(c.cbegin(), c.cend()) == c.size());
90 assert(std::distance(c.begin(), c.end()) == c.size());
91 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size.pass.cpp | 57 assert(std::distance(c.begin(), c.end()) == c.size());
58 assert(std::distance(c.cbegin(), c.cend()) == c.size());
90 assert(std::distance(c.begin(), c.end()) == c.size());
91 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size_hash.pass.cpp | 59 assert(std::distance(c.begin(), c.end()) == c.size());
60 assert(std::distance(c.cbegin(), c.cend()) == c.size());
93 assert(std::distance(c.begin(), c.end()) == c.size());
94 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size_hash_equal.pass.cpp | 60 assert(std::distance(c.begin(), c.end()) == c.size());
61 assert(std::distance(c.cbegin(), c.cend()) == c.size());
95 assert(std::distance(c.begin(), c.end()) == c.size());
96 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size_hash_equal_allocator.pass.cpp | 61 assert(std::distance(c.begin(), c.end()) == c.size());
62 assert(std::distance(c.cbegin(), c.cend()) == c.size());
97 assert(std::distance(c.begin(), c.end()) == c.size());
98 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| range_size.pass.cpp | 60 assert(std::distance(c.begin(), c.end()) == c.size());
61 assert(std::distance(c.cbegin(), c.cend()) == c.size());
95 assert(std::distance(c.begin(), c.end()) == c.size());
96 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| range_size_hash.pass.cpp | 62 assert(std::distance(c.begin(), c.end()) == c.size());
63 assert(std::distance(c.cbegin(), c.cend()) == c.size());
98 assert(std::distance(c.begin(), c.end()) == c.size());
99 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/ |
| functions.hpp | 21 #include <boost/range/distance.hpp>
|
| /packages/apps/Gallery2/gallerycommon/src/com/android/gallery3d/common/ |
| Scroller.java | 66 private static float START_TENSION = 0.4f; // Tension at start: (0.4 * total T, 1.0 * Distance)
182 * @return The new X offset as an absolute distance from the origin.
191 * @return The new Y offset as an absolute distance from the origin.
210 * @return The start X offset as an absolute distance from the origin.
219 * @return The start Y offset as an absolute distance from the origin.
228 * @return The final X offset as an absolute distance from the origin.
237 * @return The final Y offset as an absolute distance from the origin.
303 * Start scrolling by providing a starting point and the distance to travel.
311 * @param dx Horizontal distance to travel. Positive numbers will scroll the
313 * @param dy Vertical distance to travel. Positive numbers will scroll th
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| std_common.i | 50 template <class Iterator, class Category,class T, class Reference, class Pointer, class Distance>
51 struct iterator_traits<__reverse_bi_iterator<Iterator,Category,T,Reference,Pointer,Distance> > {
52 typedef Distance difference_type;
64 distance(_InputIterator __first, _InputIterator __last)
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-mmix/ |
| pushjs1r.d | 9 # When linking relocatable, check that PUSHJ with a distance to the end of
|
| pushjs2r.d | 10 # When linking relocatably, check that PUSHJ with a distance to the end of
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| KMeansPlusPlusClusterer.java | 41 /** Split the cluster with largest distance variance. */
64 * algorithm iterations is to split the cluster with largest distance variance.
173 // For each data point x, compute D(x), the distance between x and
201 * Get a random point from the {@link Cluster} with the largest distance variance.
213 // compute the distance variance of the current cluster
292 final double distance = points.get(i).distanceFrom(center); local
293 if (distance > maxDistance) {
294 maxDistance = distance;
324 final double distance = point.distanceFrom(c.getCenter()); local
325 if (distance < minDistance)
[all...] |
| /external/clang/include/clang/Sema/ |
| TypoCorrection.h | 28 // "Distance" for unusable corrections
30 // The largest distance still considered valid (larger edit distances are
34 // Relative weightings of the "edit distance" components. The higher the
36 // weights mean greater contribution to the total edit distance, with the
37 // best correction candidates having the lowest edit distance).
104 // Convert the given weighted edit distance to a roughly equivalent number of
113 /// \brief Gets the "edit distance" of the typo correction from the typo.
114 /// If Normalized is true, scale the distance down by the CharDistanceWeight
115 /// to return the edit distance in terms of single-character edits.
261 /// determine whether to return an edit distance of 0 or InvalidDistance
[all...] |
| /external/opencv3/modules/features2d/src/ |
| matchers.cpp | 64 UMat &trainIdx, UMat &distance, int distType)
73 ensureSizeIsEnough(1, query_rows, CV_32F, distance);
107 idx = k.set(idx, ocl::KernelArg::PtrWriteOnly(distance));
117 static bool ocl_matchConvert(const Mat &trainIdx, const Mat &distance, std::vector< std::vector<DMatch> > &matches)
119 if (trainIdx.empty() || distance.empty())
122 if( (trainIdx.type() != CV_32SC1) || (distance.type() != CV_32FC1 || distance.cols != trainIdx.cols) )
131 const float *distance_ptr = distance.ptr<float>();
150 static bool ocl_matchDownload(const UMat &trainIdx, const UMat &distance, std::vector< std::vector<DMatch> > &matches)
152 if (trainIdx.empty() || distance.empty()
698 UMat trainIdx, distance; local
708 UMat trainIdx, distance; local
857 UMat trainIdx, distance, nMatches; local
[all...] |
| /frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
| ClusterManager.java | 128 float distance = mLocationClusters.get(i).distanceToCenter(mLastLocation); local
129 Log.v(TAG, "clulster " + i + " is within " + distance + " meters");
130 if (distance < bestClusterDistance) {
131 bestClusterDistance = distance;
186 float distance = local
188 if (distance < LOCATION_CLUSTER_RADIUS) {
209 float distance = cluster.distanceToCluster(candidate); local
210 Log.v(TAG, distance + "distance to semantic cluster: " +
213 if (distance < bestClusterDistance)
[all...] |
| /frameworks/support/design/src/android/support/design/widget/ |
| SwipeDismissBehavior.java | 133 * @param distance a ratio of a view's width, values are clamped to 0 >= x <= 1f;
135 public void setDragDismissDistance(float distance) {
136 mDragDismissThreshold = clamp(0f, distance, 1f);
140 * The minimum swipe distance before the view's alpha is modified.
142 * @param fraction the distance as a fraction of the view's width.
149 * The maximum swipe distance for the view's alpha is modified.
151 * @param fraction the distance as a fraction of the view's width.
288 final int distance = child.getLeft() - mOriginalCapturedViewLeft;
290 return Math.abs(distance) >= thresholdDistance;
349 final float distance = fraction(startAlphaDistance, endAlphaDistance, left)
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/internal/actions/ |
| swipe.js | 14 this.distance_ = opt_options.distance;
32 // This class swipes a page for a specified distance.
|
| /external/eigen/unsupported/doc/examples/ |
| BVH_Example.cpp | 43 std::cout << "Brute force distance = " << sqrt(minDistSq) << ", calls = " << minimizer.calls << std::endl;
49 std::cout << "BVH distance = " << sqrt(minDistSq) << ", calls = " << minimizer.calls << std::endl;
|
| /external/libcxx/test/std/containers/associative/map/map.cons/ |
| copy_assign.pass.cpp | 47 assert(distance(m.begin(), m.end()) == 3);
55 assert(distance(mo.begin(), mo.end()) == 3);
97 assert(distance(m.begin(), m.end()) == 3);
105 assert(distance(mo.begin(), mo.end()) == 3);
133 assert(distance(m.begin(), m.end()) == 3);
141 assert(distance(mo.begin(), mo.end()) == 3);
168 assert(distance(m.begin(), m.end()) == 3);
176 assert(distance(mo.begin(), mo.end()) == 3);
|
| /external/libcxx/test/std/containers/sequences/list/list.special/ |
| swap.pass.cpp | 39 assert(distance(c2.begin(), c2.end()) == 0);
48 assert(distance(c1.begin(), c1.end()) == 0);
58 assert(distance(c1.begin(), c1.end()) == 0);
60 assert(distance(c2.begin(), c2.end()) == 0);
107 assert(distance(c2.begin(), c2.end()) == 0);
116 assert(distance(c1.begin(), c1.end()) == 0);
126 assert(distance(c1.begin(), c1.end()) == 0);
128 assert(distance(c2.begin(), c2.end()) == 0);
|
| /external/libcxx/test/std/containers/sequences/vector/vector.special/ |
| swap.pass.cpp | 47 assert(distance(c2.begin(), c2.end()) == 0);
60 assert(distance(c1.begin(), c1.end()) == 0);
74 assert(distance(c1.begin(), c1.end()) == 0);
76 assert(distance(c2.begin(), c2.end()) == 0);
135 assert(distance(c2.begin(), c2.end()) == 0);
148 assert(distance(c1.begin(), c1.end()) == 0);
162 assert(distance(c1.begin(), c1.end()) == 0);
164 assert(distance(c2.begin(), c2.end()) == 0);
|
