/external/chromium_org/third_party/WebKit/Source/platform/audio/ |
H A D | Distance.cpp | 50 double DistanceEffect::gain(double distance) argument 52 // don't go beyond maximum distance 53 distance = std::min(distance, m_maxDistance); 55 // if clamped, don't get closer than reference distance 57 distance = std::max(distance, m_refDistance); 61 return linearGain(distance); 63 return inverseGain(distance); 65 return exponentialGain(distance); 71 linearGain(double distance) argument 78 inverseGain(double distance) argument 83 exponentialGain(double distance) argument [all...] |
H A D | Distance.h | 49 // Returns scalar gain for the given distance the current distance model is used 50 double gain(double distance); 70 double linearGain(double distance); 71 double inverseGain(double distance); 72 double exponentialGain(double distance);
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_temporal_filter.h | 19 void vp9_temporal_filter(VP9_COMP *cpi, int distance);
|
/external/libcxx/test/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/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_temporal_filter.h | 18 void vp9_temporal_filter_prepare(VP9_COMP *cpi, int distance);
|
/external/chromium-trace/trace-viewer/src/tracing/tracks/ |
H A D | ruler_track.css | 10 .ruler-track-with-distance-measurements {
|
/external/chromium_org/native_client_sdk/src/examples/demo/flock/ |
H A D | goose.cc | 19 // The minimum distance that a goose can be from this goose. If another goose 20 // comes within this distance of this goose, the flocking algorithm tries to 24 // The distance at which attractors have effect on a goose's direction. 27 // The goose will try to turn towards geese within this distance (computed 92 // Compute the distance from this goose to its neighbour. 95 double distance = goose_delta.Magnitude(); local 98 distance, goose_delta, &separation, separation_count); 101 distance, goose, &alignment, align_count); 103 distance, goose, &cohesion, cohesion_count); 125 double distance local 151 double distance = desired_direction.Magnitude(); local 170 AccumulateSeparation(double distance, const Vector2& goose_delta, Vector2* separation, int32_t separation_count) argument 184 AccumulateAlignment(double distance, const Goose& goose, Vector2* alignment, int32_t align_count) argument 195 AccumulateCohesion(double distance, const Goose& goose, Vector2* cohesion, int32_t cohesion_count) argument [all...] |
/external/libcxx/test/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/chromium_org/ash/wm/workspace/ |
H A D | magnetism_matcher_unittest.cc | 13 const int distance = MagnetismMatcher::kMagneticDistance; local 19 gfx::Rect(initial_bounds.x() - distance - 10, 20 initial_bounds.y() - distance - 10, 2, 3), &edge)); 30 initial_bounds.y() + distance + 1 , 1, 1), 38 const int distance = MagnetismMatcher::kMagneticDistance; local 44 gfx::Rect(initial_bounds.x() - distance - 10, 45 initial_bounds.y() - distance - 10, 2, 3), &edge)); 54 gfx::Rect(initial_bounds.x() + distance + 1, 68 const int distance = MagnetismMatcher::kMagneticDistance; local 74 gfx::Rect(initial_bounds.right() - distance * 97 const int distance = MagnetismMatcher::kMagneticDistance; local 120 const int distance = MagnetismMatcher::kMagneticDistance; local 145 const int distance = MagnetismMatcher::kMagneticDistance; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | ColorDistance.h | 30 static float distance(const Color& fromColor, const Color& toColor);
|
/external/libcxx/test/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/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/libcxx/test/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/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/chromium_org/third_party/skia/include/core/ |
H A D | SkPathMeasure.h | 37 /** Pins distance to 0 <= distance <= getLength(), and then computes 42 bool SK_WARN_UNUSED_RESULT getPosTan(SkScalar distance, SkPoint* position, 51 /** Pins distance to 0 <= distance <= getLength(), and then computes 56 bool SK_WARN_UNUSED_RESULT getMatrix(SkScalar distance, SkMatrix* matrix, 59 /** Given a start and stop distance, return in dst the intervening segment(s). 89 SkScalar fDistance; // total distance up to this point 102 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance, 104 SkScalar compute_cubic_segs(const SkPoint pts[3], SkScalar 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/skia/include/core/ |
H A D | SkPathMeasure.h | 37 /** Pins distance to 0 <= distance <= getLength(), and then computes 42 bool SK_WARN_UNUSED_RESULT getPosTan(SkScalar distance, SkPoint* position, 51 /** Pins distance to 0 <= distance <= getLength(), and then computes 56 bool SK_WARN_UNUSED_RESULT getMatrix(SkScalar distance, SkMatrix* matrix, 59 /** Given a start and stop distance, return in dst the intervening segment(s). 89 SkScalar fDistance; // total distance up to this point 102 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance, 104 SkScalar compute_cubic_segs(const SkPoint pts[3], SkScalar distance, [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkPathMeasure.cpp | 84 SkScalar distance, int mint, int maxt, int ptIndex) { 90 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex); 91 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex); 94 SkScalar prevD = distance; 95 distance += d; 96 if (distance > prevD) { 98 seg->fDistance = distance; 104 return distance; 83 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument 107 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument 134 SkScalar distance = 0; local [all...] |
/external/skia/src/core/ |
H A D | SkPathMeasure.cpp | 84 SkScalar distance, int mint, int maxt, int ptIndex) { 90 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex); 91 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex); 94 SkScalar prevD = distance; 95 distance += d; 96 if (distance > prevD) { 98 seg->fDistance = distance; 104 return distance; 83 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument 107 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument 134 SkScalar distance = 0; local [all...] |