/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/ |
H A D | Integers.java | 5 public static int rotateLeft(int i, int distance) argument 7 return Integer.rotateLeft(i, distance); 10 public static int rotateRight(int i, int distance) argument 12 return Integer.rotateRight(i, distance);
|
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_temporal_filter.h | 19 void vp9_temporal_filter(VP9_COMP *cpi, int distance);
|
/external/jmonkeyengine/engine/src/core/com/jme3/collision/ |
H A D | CollisionResult.java | 52 private float distance; field in class:CollisionResult 55 public CollisionResult(Geometry geometry, Vector3f contactPoint, float distance, int triangleIndex) { argument 58 this.distance = distance; 62 public CollisionResult(Vector3f contactPoint, float distance) { argument 64 this.distance = distance; 83 this.distance = dist; 102 if (distance < other.distance) [all...] |
/external/libcxx/test/std/re/re.results/re.results.acc/ |
H A D | position.pass.cpp | 25 assert(m.position() == std::distance(s, m[0].first)); 26 assert(m.position(0) == std::distance(s, m[0].first)); 27 assert(m.position(1) == std::distance(s, m[1].first)); 28 assert(m.position(2) == std::distance(s, m[2].first)); 29 assert(m.position(3) == std::distance(s, m[3].first)); 30 assert(m.position(4) == std::distance(s, m[4].first));
|
/external/jmonkeyengine/engine/src/core/com/jme3/scene/control/ |
H A D | AreaUtils.java | 55 * @param distance The distance from camera to object. 59 public static float calcScreenArea(BoundingVolume bound, float distance, float screenWidth) { argument 61 return calcScreenArea((BoundingSphere) bound, distance, screenWidth); 63 return calcScreenArea((BoundingBox) bound, distance, screenWidth); 68 private static float calcScreenArea(BoundingSphere bound, float distance, float screenWidth) { argument 74 float radius = (bound.getRadius() * screenWidth) / (distance * 2); 78 private static float calcScreenArea(BoundingBox bound, float distance, float screenWidth) { argument 83 return ((radiusSquare * screenWidth * screenWidth) / (distance * distance * [all...] |
/external/libcxx/test/std/containers/sequences/list/list.cons/ |
H A D | 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);
|
H A D | default.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); 50 assert(std::distance(l.begin(), l.end()) == 0); 55 assert(std::distance(l.begin(), l.end()) == 0);
|
/external/skia/src/core/ |
H A D | SkPathMeasure.cpp | 85 SkScalar distance, int mint, int maxt, int ptIndex) { 91 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex); 92 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex); 95 SkScalar prevD = distance; 96 distance += d; 97 if (distance > prevD) { 99 seg->fDistance = distance; 105 return distance; 84 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument 108 compute_conic_segs(const SkConic& conic, SkScalar distance, int mint, int maxt, int ptIndex) argument 132 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument 159 SkScalar distance = 0; local [all...] |
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | push_front_const.pass.cpp | 27 assert(distance(c.begin(), c.end()) == 1); 31 assert(distance(c.begin(), c.end()) == 2); 40 assert(distance(c.begin(), c.end()) == 1); 44 assert(distance(c.begin(), c.end()) == 2);
|
H A D | 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);
|
H A D | resize_size.pass.cpp | 27 assert(distance(c.begin(), c.end()) == 0); 29 assert(distance(c.begin(), c.end()) == 10); 31 assert(distance(c.begin(), c.end()) == 20); 33 assert(distance(c.begin(), c.end()) == 5); 35 assert(distance(c.begin(), c.end()) == 0); 44 assert(distance(c.begin(), c.end()) == 3); 50 assert(distance(c.begin(), c.end()) == 6); 59 assert(distance(c.begin(), c.end()) == 6); 73 assert(distance(c.begin(), c.end()) == 0); 75 assert(distance( [all...] |
H A D | pop_front.pass.cpp | 30 assert(distance(c.begin(), c.end()) == 1); 33 assert(distance(c.begin(), c.end()) == 0); 43 assert(distance(c.begin(), c.end()) == 1); 46 assert(distance(c.begin(), c.end()) == 0); 58 assert(distance(c.begin(), c.end()) == 1); 61 assert(distance(c.begin(), c.end()) == 0); 71 assert(distance(c.begin(), c.end()) == 1); 74 assert(distance(c.begin(), c.end()) == 0);
|
H A D | clear.pass.cpp | 27 assert(distance(c.begin(), c.end()) == 0); 36 assert(distance(c.begin(), c.end()) == 0); 39 assert(distance(c.begin(), c.end()) == 0); 47 assert(distance(c.begin(), c.end()) == 0); 56 assert(distance(c.begin(), c.end()) == 0); 59 assert(distance(c.begin(), c.end()) == 0);
|
/external/libcxx/test/std/containers/sequences/list/list.capacity/ |
H A D | resize_size.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()) == 5); 47 assert(std::distance(l.begin(), l.end()) == 20); 55 assert(std::distance(l.begin(), l.end()) == 2); 62 assert(std::distance(l.begin(), l.end()) == 10); 71 assert(std::distance(l.begin(), l.end()) == 5); 77 assert(std::distance(l.begin(), l.end()) == 20);
|
/external/skia/include/core/ |
H A D | SkPathMeasure.h | 39 /** Pins distance to 0 <= distance <= getLength(), and then computes 44 bool SK_WARN_UNUSED_RESULT getPosTan(SkScalar distance, SkPoint* position, 53 /** Pins distance to 0 <= distance <= getLength(), and then computes 58 bool SK_WARN_UNUSED_RESULT getMatrix(SkScalar distance, SkMatrix* matrix, 61 /** Given a start and stop distance, return in dst the intervening segment(s). 91 SkScalar fDistance; // total distance up to this point 104 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance, 106 SkScalar compute_conic_segs(const SkConic&, SkScalar distance, in [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/ |
H A D | local_iterators.pass.cpp | 48 assert(std::distance(i, j) == 0); 53 assert(std::distance(i, j) == 2); 61 assert(std::distance(i, j) == 2); 69 assert(std::distance(i, j) == 1); 75 assert(std::distance(i, j) == 1); 81 assert(std::distance(i, j) == 0); 86 assert(std::distance(i, j) == 0); 106 assert(std::distance(i, j) == 0); 111 assert(std::distance(i, j) == 2); 119 assert(std::distance( [all...] |
H A D | local_iterators.fail.cpp | 46 assert(std::distance(i, j) == 0); 51 assert(std::distance(i, j) == 2); 60 assert(std::distance(i, j) == 2); 68 assert(std::distance(i, j) == 1); 74 assert(std::distance(i, j) == 1); 80 assert(std::distance(i, j) == 0); 85 assert(std::distance(i, j) == 0); 105 assert(std::distance(i, j) == 0); 110 assert(std::distance(i, j) == 2); 118 assert(std::distance( [all...] |
/external/libcxx/test/std/containers/unord/unord.set/ |
H A D | local_iterators.fail.cpp | 46 assert(std::distance(i, j) == 0); 51 assert(std::distance(i, j) == 2); 60 assert(std::distance(i, j) == 2); 68 assert(std::distance(i, j) == 1); 74 assert(std::distance(i, j) == 1); 80 assert(std::distance(i, j) == 0); 85 assert(std::distance(i, j) == 0); 105 assert(std::distance(i, j) == 0); 110 assert(std::distance(i, j) == 2); 118 assert(std::distance( [all...] |
/external/openfst/src/script/ |
H A D | shortest-distance.cc | 19 #include <fst/script/shortest-distance.h> 25 void ShortestDistance(const FstClass &fst, vector<WeightClass> *distance, argument 27 ShortestDistanceArgs1 args(fst, distance, opts); 34 void ShortestDistance(const FstClass &ifst, vector<WeightClass> *distance, argument 36 ShortestDistanceArgs2 args(ifst, distance, reverse, delta);
|
/external/libcxx/test/std/containers/sequences/list/list.ops/ |
H A D | splice_pos_list.pass.cpp | 32 assert(distance(l1.begin(), l1.end()) == 0); 34 assert(distance(l2.begin(), l2.end()) == 0); 41 assert(distance(l1.begin(), l1.end()) == 1); 43 assert(distance(l2.begin(), l2.end()) == 0); 52 assert(distance(l1.begin(), l1.end()) == 2); 54 assert(distance(l2.begin(), l2.end()) == 0); 65 assert(distance(l1.begin(), l1.end()) == 3); 67 assert(distance(l2.begin(), l2.end()) == 0); 80 assert(distance(l1.begin(), l1.end()) == 1); 82 assert(distance(l [all...] |
/external/openfst/src/include/fst/ |
H A D | shortest-distance.h | 1 // shortest-distance.h 19 // Functions and classes to find shortest distance in an FST. 63 // Computation state of the shortest-distance algorithm. Reusable 68 // may not be freed before this class. Vector 'distance' should not be 79 vector<Weight> *distance, 82 : fst_(fst), distance_(distance), state_queue_(opts.state_queue), 104 vector<Weight> rdistance_; // Relaxation distance. 113 // Compute the shortest distance. If 'source' is kNoStateId, use 223 // Shortest-distance algorithm: this version allows fine control 226 // This computes the shortest distance fro 77 ShortestDistanceState( const Fst<Arc> &fst, vector<Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, bool retain) argument 244 ShortestDistance( const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) argument 281 ShortestDistance(const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, bool reverse = false, float delta = kDelta) argument 326 vector<Weight> distance; local [all...] |
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | iterator.pass.cpp | 66 assert(std::distance(m.begin(), m.end()) == m.size()); 67 assert(std::distance(m.rbegin(), m.rend()) == m.size()); 106 assert(std::distance(m.begin(), m.end()) == m.size()); 107 assert(std::distance(m.cbegin(), m.cend()) == m.size()); 108 assert(std::distance(m.rbegin(), m.rend()) == m.size()); 109 assert(std::distance(m.crbegin(), m.crend()) == m.size()); 147 assert(std::distance(m.begin(), m.end()) == m.size()); 148 assert(std::distance(m.rbegin(), m.rend()) == m.size()); 187 assert(std::distance(m.begin(), m.end()) == m.size()); 188 assert(std::distance( [all...] |
/external/libcxx/test/std/containers/associative/set/ |
H A D | iterator.pass.cpp | 66 assert(std::distance(m.begin(), m.end()) == m.size()); 67 assert(std::distance(m.rbegin(), m.rend()) == m.size()); 105 assert(std::distance(m.begin(), m.end()) == m.size()); 106 assert(std::distance(m.cbegin(), m.cend()) == m.size()); 107 assert(std::distance(m.rbegin(), m.rend()) == m.size()); 108 assert(std::distance(m.crbegin(), m.crend()) == m.size()); 145 assert(std::distance(m.begin(), m.end()) == m.size()); 146 assert(std::distance(m.rbegin(), m.rend()) == m.size()); 184 assert(std::distance(m.begin(), m.end()) == m.size()); 185 assert(std::distance( [all...] |
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | 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(e [all...] |
H A D | 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(e [all...] |