Searched refs:distance (Results 126 - 150 of 834) sorted by relevance

1234567891011>>

/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/
H A Drange_size.pass.cpp56 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());
114 assert(std::distance(eq.first, eq.second) == 2);
122 assert(std::distance(eq.first, eq.second) == 2);
131 assert(std::distance(eq.first, eq.second) == 1);
136 assert(std::distance(e
[all...]
H A Drange_size_hash.pass.cpp58 assert(std::distance(eq.first, eq.second) == 2);
66 assert(std::distance(eq.first, eq.second) == 2);
75 assert(std::distance(eq.first, eq.second) == 1);
80 assert(std::distance(eq.first, eq.second) == 1);
84 assert(std::distance(c.begin(), c.end()) == c.size());
85 assert(std::distance(c.cbegin(), c.cend()) == c.size());
117 assert(std::distance(eq.first, eq.second) == 2);
125 assert(std::distance(eq.first, eq.second) == 2);
134 assert(std::distance(eq.first, eq.second) == 1);
139 assert(std::distance(e
[all...]
H A Drange_size_hash_equal.pass.cpp59 assert(std::distance(eq.first, eq.second) == 2);
67 assert(std::distance(eq.first, eq.second) == 2);
76 assert(std::distance(eq.first, eq.second) == 1);
81 assert(std::distance(eq.first, eq.second) == 1);
85 assert(std::distance(c.begin(), c.end()) == c.size());
86 assert(std::distance(c.cbegin(), c.cend()) == c.size());
119 assert(std::distance(eq.first, eq.second) == 2);
127 assert(std::distance(eq.first, eq.second) == 2);
136 assert(std::distance(eq.first, eq.second) == 1);
141 assert(std::distance(e
[all...]
H A Drange_size_hash_equal_allocator.pass.cpp61 assert(std::distance(eq.first, eq.second) == 2);
69 assert(std::distance(eq.first, eq.second) == 2);
78 assert(std::distance(eq.first, eq.second) == 1);
83 assert(std::distance(eq.first, eq.second) == 1);
87 assert(std::distance(c.begin(), c.end()) == c.size());
88 assert(std::distance(c.cbegin(), c.cend()) == c.size());
122 assert(std::distance(eq.first, eq.second) == 2);
130 assert(std::distance(eq.first, eq.second) == 2);
139 assert(std::distance(eq.first, eq.second) == 1);
144 assert(std::distance(e
[all...]
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/
H A Dswap_non_member.pass.cpp45 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(c
[all...]
/external/libcxx/test/containers/unord/unord.multiset/
H A Dswap_member.pass.cpp44 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(c
[all...]
/external/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/
H A Dswap_non_member.pass.cpp44 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(c
[all...]
/external/libcxx/test/containers/unord/unord.set/
H A Dswap_member.pass.cpp44 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(c
[all...]
/external/libcxx/test/containers/unord/unord.set/unord.set.swap/
H A Dswap_non_member.pass.cpp44 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(c
[all...]
/external/replicaisland/src/com/replica/replicaisland/
H A DHitPlayerComponent.java73 public void setup(float distance, HitReactionComponent hitReact, int hitType, boolean hitPlayer) { argument
74 mDistance2 = distance * distance;
/external/chromium_org/third_party/skia/src/effects/
H A DSkDiscretePathEffect.cpp52 SkScalar distance = 0; local
56 distance += delta/2;
59 if (meas.getPosTan(distance, &p, &v)) {
64 distance += delta;
65 if (meas.getPosTan(distance, &p, &v)) {
/external/chromium_org/ui/gfx/geometry/
H A Drect_conversions.cc56 bool IsNearestRectWithinDistance(const gfx::RectF& rect, float distance) {
68 (std::abs(min_x - float_min_x) < distance) &&
69 (std::abs(min_y - float_min_y) < distance) &&
70 (std::abs(max_x - float_max_x) < distance) &&
71 (std::abs(max_y - float_max_y) < distance);
/external/libcxx/test/containers/sequences/list/list.cons/
H A Dinput_iterator.pass.cpp28 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
39 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
49 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
60 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
71 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dshortest-distance.h1 // shortest-distance.h
18 // Functions and classes to find shortest distance in an FST.
48 // Computation state of the shortest-distance algorithm. Reusable
52 // (e.g., in epsilon removal). Vector 'distance' should not be
62 vector<Weight> *distance,
65 : fst_(fst.Copy()), distance_(distance), state_queue_(opts.state_queue),
85 vector<Weight> rdistance_; // Relaxation distance.
91 // Compute the shortest distance. If 'source' is kNoStateId, use
180 // Shortest-distance algorithm: this version allows fine control
183 // This computes the shortest distance fro
60 ShortestDistanceState( const Fst<Arc> &fst, vector<Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, bool retain) argument
199 ShortestDistance( const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) argument
230 ShortestDistance(const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, bool reverse = false) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/html/
H A DHTMLMarqueeElement.js269 parameters.distance = totalWidth;
274 parameters.distance = totalWidth;
279 parameters.distance = totalHeight;
284 parameters.distance = totalHeight;
294 parameters.distance = innerWidth;
299 parameters.distance = innerWidth;
304 parameters.distance = innerHeight;
309 parameters.distance = innerHeight;
326 parameters.distance = metrics.marqueeWidth;
331 parameters.distance
[all...]
/external/openfst/src/include/fst/
H A Dpush.h31 #include <fst/shortest-distance.h>
40 // the output of ShortestDistance. 'distance' is the shortest distance from the
46 const vector<typename Arc::Weight> &distance,
49 return fst.Start() < distance.size() ?
50 distance[fst.Start()] : Arc::Weight::Zero();
53 for (typename Arc::StateId s = 0; s < distance.size(); ++s)
54 sum = Plus(sum, Times(distance[s], fst.Final(s)));
102 vector<typename Arc::Weight> distance; local
103 ShortestDistance(*fst, &distance, typ
44 ComputeTotalWeight( const Fst<Arc> &fst, const vector<typename Arc::Weight> &distance, bool reverse) argument
[all...]
/external/chromium_org/athena/wm/
H A Dtitle_drag_controller.cc117 gfx::Vector2dF distance = gesture->root_location() - drag_start_location_; local
119 transform.Translate(0, std::max(0.f, distance.y()));
126 gfx::Vector2dF distance = gesture->root_location() - drag_start_location_; local
127 EndTransition(window, distance.y() >= kMinDragDistanceForSwitch);
133 gfx::Vector2dF distance = gesture->root_location() - drag_start_location_; local
138 (distance.y() >= kMinDragDistanceForSwitch ||
/external/chromium_org/third_party/skia/src/pathops/
H A DSkLineParameters.h22 // The distance to the line for (x, y) is d(x,y) = ax + by + c
25 // distance, it's necessary to either call normalize() after xxxEndPoints(), or
138 void cubicDistanceY(const SkDCubic& pts, SkDCubic& distance) const {
141 distance[index].fX = index * oneThird;
142 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC;
146 void quadDistanceY(const SkDQuad& pts, SkDQuad& distance) const {
149 distance[index].fX = index * oneHalf;
150 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC;
/external/eigen/test/
H A Dgeo_parametrizedline.cpp39 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 );
60 VERIFY_IS_MUCH_SMALLER_THAN(l0.distance(pi), RealScalar(1));
/external/libcxx/test/containers/associative/map/map.cons/
H A Dcopy.pass.cpp46 assert(distance(m.begin(), m.end()) == 3);
54 assert(distance(mo.begin(), mo.end()) == 3);
81 assert(distance(m.begin(), m.end()) == 3);
89 assert(distance(mo.begin(), mo.end()) == 3);
117 assert(distance(m.begin(), m.end()) == 3);
125 assert(distance(mo.begin(), mo.end()) == 3);
/external/libcxx/test/containers/associative/multiset/multiset.cons/
H A Dmove.pass.cpp35 assert(distance(m.begin(), m.end()) == 0);
40 assert(distance(mo.begin(), mo.end()) == 0);
63 assert(distance(m.begin(), m.end()) == 9);
77 assert(distance(mo.begin(), mo.end()) == 0);
102 assert(distance(m.begin(), m.end()) == 9);
116 assert(distance(mo.begin(), mo.end()) == 0);
/external/libcxx/test/containers/sequences/vector.bool/
H A Diterators.pass.cpp33 assert(std::distance(i, j) == 0);
42 assert(std::distance(i, j) == 0);
51 assert(std::distance(i, j) == 0);
68 assert(std::distance(i, j) == 0);
77 assert(std::distance(i, j) == 0);
86 assert(std::distance(i, j) == 0);
/external/libcxx/test/containers/unord/unord.multimap/
H A Drehash.pass.cpp31 assert(std::distance(eq.first, eq.second) == 2);
39 assert(std::distance(eq.first, eq.second) == 2);
48 assert(std::distance(eq.first, eq.second) == 1);
53 assert(std::distance(eq.first, eq.second) == 1);
57 assert(std::distance(c.begin(), c.end()) == c.size());
58 assert(std::distance(c.cbegin(), c.cend()) == c.size());
/external/libcxx/test/containers/unord/unord.set/unord.set.cnstr/
H A Dcopy.pass.cpp62 assert(std::distance(c.begin(), c.end()) == c.size());
63 assert(std::distance(c.cbegin(), c.cend()) == c.size());
101 assert(std::distance(c.begin(), c.end()) == c.size());
102 assert(std::distance(c.cbegin(), c.cend()) == c.size());
141 assert(std::distance(c.begin(), c.end()) == c.size());
142 assert(std::distance(c.cbegin(), c.cend()) == c.size());
/external/skia/src/pathops/
H A DSkLineParameters.h22 // The distance to the line for (x, y) is d(x,y) = ax + by + c
25 // distance, it's necessary to either call normalize() after xxxEndPoints(), or
138 void cubicDistanceY(const SkDCubic& pts, SkDCubic& distance) const {
141 distance[index].fX = index * oneThird;
142 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC;
146 void quadDistanceY(const SkDQuad& pts, SkDQuad& distance) const {
149 distance[index].fX = index * oneHalf;
150 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC;

Completed in 496 milliseconds

1234567891011>>