Searched refs:distance (Results 1 - 25 of 300) sorted by relevance

1234567891011>>

/external/webkit/Source/WebCore/platform/audio/
H A DDistance.cpp51 double DistanceEffect::gain(double distance) argument
53 // don't go beyond maximum distance
54 distance = min(distance, m_maxDistance);
56 // if clamped, don't get closer than reference distance
58 distance = max(distance, m_refDistance);
62 return linearGain(distance);
65 return inverseGain(distance);
68 return exponentialGain(distance);
76 linearGain(double distance) argument
81 inverseGain(double distance) argument
86 exponentialGain(double distance) argument
[all...]
H A DDistance.h46 // Returns scalar gain for the given distance the current distance model is used
47 double gain(double distance);
67 double linearGain(double distance);
68 double inverseGain(double distance);
69 double exponentialGain(double distance);
/external/jmonkeyengine/engine/src/core/com/jme3/collision/
H A DCollisionResult.java52 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/jmonkeyengine/engine/src/core/com/jme3/scene/control/
H A DAreaUtils.java55 * @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/webkit/Source/WebCore/history/
H A DBackForwardController.cpp47 bool BackForwardController::canGoBackOrForward(int distance) const
49 return m_page->canGoBackOrForward(distance);
52 void BackForwardController::goBackOrForward(int distance) argument
54 m_page->goBackOrForward(distance);
/external/openfst/src/script/
H A Dshortest-distance.cc19 #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 DSkPathMeasure.h39 /** 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_cubic_segs(const SkPoint pts[3], SkScalar distance,
[all...]
/external/skia/legacy/include/core/
H A DSkPathMeasure.h39 /** Pins distance to 0 <= distance <= getLength(), and then computes
44 bool getPosTan(SkScalar distance, SkPoint* position, SkVector* tangent);
51 /** Pins distance to 0 <= distance <= getLength(), and then computes
56 bool getMatrix(SkScalar distance, SkMatrix* matrix, MatrixFlags flags = kGetPosAndTan_MatrixFlag);
57 /** Given a start and stop distance, return in dst the intervening segment(s).
87 SkScalar fDistance; // total distance up to this point
100 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance,
102 SkScalar compute_cubic_segs(const SkPoint pts[3], SkScalar distance,
[all...]
/external/skia/src/core/
H A DSkPathMeasure.cpp89 SkScalar distance, int mint, int maxt, int ptIndex) {
95 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex);
96 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex);
99 SkScalar prevD = distance;
100 distance += d;
101 if (distance > prevD) {
103 seg->fDistance = distance;
109 return distance;
88 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument
112 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument
139 SkScalar distance = 0; local
[all...]
/external/openfst/src/include/fst/
H A Dshortest-distance.h1 // 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...]
H A Dshortest-path.h33 #include <fst/shortest-distance.h>
46 bool has_distance; // distance vector already contains the
47 // shortest distance from the initial state
68 // 'ifst'. 'distance' returns the shortest distances from the source
80 vector<typename Arc::Weight> *distance,
103 distance->clear();
125 while (distance->size() < source) {
126 distance->push_back(Weight::Zero());
131 distance->push_back(Weight::One());
141 Weight sd = (*distance)[
78 SingleShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
214 ShortestPathCompare(const vector<Pair>& pairs, const vector<Weight>& distance, StateId sfinal, float d) argument
413 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
489 vector<typename Arc::Weight> distance; local
[all...]
/external/openfst/src/include/fst/script/
H A Dprune.h35 const vector<WeightClass> *distance; member in struct:fst::script::PruneOptions
42 distance(d),
50 // If the original opts.distance is not NULL, a new distance will be
61 vector<Weight> *distance = 0; local
63 if (opts.distance) {
64 distance = new vector<Weight>(opts.distance->size());
65 for (unsigned i = 0; i < opts.distance->size(); ++i) {
66 (*distance)[
[all...]
H A Drmepsilon.h26 #include <fst/script/shortest-distance.h> // for ShortestDistanceOptions
33 %include "nlp/fst/script/shortest-distance.h"
66 vector<typename Arc::Weight> *distance,
76 AutoQueue<StateId> queue(*fst, distance, EpsilonArcFilter<Arc>());
80 RmEpsilon(fst, distance, ropts);
88 RmEpsilon(fst, distance, ropts);
96 RmEpsilon(fst, distance, ropts);
100 NaturalShortestFirstQueue<StateId, Weight> queue(*distance);
105 RmEpsilon(fst, distance, ropts);
113 RmEpsilon(fst, distance, ropt
65 RmEpsilonHelper(MutableFst<Arc> *fst, vector<typename Arc::Weight> *distance, const RmEpsilonOptions &opts) argument
138 vector<typename Arc::Weight> distance; local
[all...]
/external/chromium-trace/trace-viewer/src/tracks/
H A Druler_track.css9 .ruler-track-with-distance-measurements {
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dshortest-path.h27 #include "fst/lib/shortest-distance.h"
39 bool has_distance; // distance vector already contains the
40 // shortest distance from the initial state
51 // 'ifst'. 'distance' returns the shortest distances from the source
63 vector<typename Arc::Weight> *distance,
85 distance->clear();
95 while (distance->size() < source) {
96 distance->push_back(Weight::Zero());
101 distance->push_back(Weight::One());
111 Weight sd = (*distance)[
61 SingleShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
173 ShortestPathCompare(const vector<Pair>& pairs, const vector<Weight>& distance, StateId sfinal, float d) argument
228 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
353 vector<typename Arc::Weight> distance; local
[all...]
/external/skia/legacy/src/core/
H A DSkPathMeasure.cpp100 SkScalar distance, int mint, int maxt, int ptIndex) {
106 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex);
107 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex);
112 distance += d;
114 seg->fDistance = distance;
120 return distance;
124 SkScalar distance, int mint, int maxt, int ptIndex) {
130 distance
99 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument
123 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument
150 SkScalar d, distance = 0; local
[all...]
/external/javassist/src/main/javassist/bytecode/
H A DLineNumberAttribute.java131 int distance = 0;
133 distance = lineNumber(0) - line;
139 if ((d < 0 && d > distance)
140 || (d >= 0 && (d < distance || distance < 0))) {
141 distance = d;
148 res.line = line + distance;
/external/skia/tests/
H A DPathCoverageTest.cpp48 static inline uint32_t estimate_pointCount(int distance) { argument
50 int shift = 30 - SkCLZ(distance);
70 int distance = estimate_distance(points); local
71 return estimate_pointCount(distance);
75 int distance = estimate_distance(points); local
76 return compute_pointCount(SkIntToScalar(distance), tol);
80 SkScalar distance = compute_distance(points); local
81 return estimate_pointCount(SkScalarRound(distance));
85 SkScalar distance = compute_distance(points); local
86 return compute_pointCount(distance, to
[all...]
/external/eigen/test/eigen2/
H A Deigen2_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 );
/external/openfst/src/bin/
H A Dfstshortestdistance.cc26 #include <fst/script/shortest-distance.h>
39 string usage = "Finds shortest distance(s) in an FST.\n\n Usage: ";
41 usage += " [in.fst [distance.txt]]\n";
56 vector<s::WeightClass> distance;
83 s::ShortestDistance(*ifst, &distance, FLAGS_reverse, FLAGS_delta);
87 s::ShortestDistance(*ifst, &distance, opts);
90 s::WritePotentials(out_fname, distance);
/external/skia/legacy/src/effects/
H A DSkDiscretePathEffect.cpp47 SkScalar distance = 0;
51 distance += delta/2;
53 meas.getPosTan(distance, &p, &v);
57 distance += delta;
58 meas.getPosTan(distance, &p, &v);
/external/skia/src/effects/
H A DSkDiscretePathEffect.cpp47 SkScalar distance = 0; local
51 distance += delta/2;
54 if (meas.getPosTan(distance, &p, &v)) {
59 distance += delta;
60 if (meas.getPosTan(distance, &p, &v)) {
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/
H A Dtokenutil.py98 def CustomSearch(start_token, func, end_func=None, distance=None,
100 """Returns the first token where func is True within distance of this token.
107 distance: The number of tokens to look through before failing search. Must
114 The first token matching func within distance of this token, or None if no
119 while token and (distance is None or distance > 0):
128 if distance is not None:
129 distance -= 1
132 while token and (distance is None or distance >
[all...]
/external/jmonkeyengine/engine/src/android/com/jme3/util/
H A DFastInteger.java240 * @param distance
245 public static int rotateLeft(int i, int distance) { argument
246 if (distance == 0) {
251 * implicitly masked with 0x1F, which the negation of 'distance' is
254 return ((i << distance) | (i >>> (-distance)));
263 * @param distance
268 public static int rotateRight(int i, int distance) { argument
269 if (distance == 0) {
274 * implicitly masked with 0x1F, which the negation of 'distance' i
[all...]
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowAbsListView.java25 public void smoothScrollBy(int distance, int duration) { argument
26 this.lastSmoothScrollByDistance = distance;
49 * Robolectric accessor for the last smoothScrollBy distance
51 * @return int distance

Completed in 1890 milliseconds

1234567891011>>