| /external/skia/src/core/ |
| SkPathMeasure.cpp | 108 SkScalar distance, int mint, int maxt, int ptIndex) {
114 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex);
115 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex);
117 SkScalar d = SkPoint::Distance(pts[0], pts[2]);
120 distance += d;
122 seg->fDistance = distance;
128 return distance;
132 SkScalar distance, int mint, int maxt, int ptIndex)
158 SkScalar d, distance = 0; local
[all...] |
| /external/skia/include/core/ |
| SkPathMeasure.h | 46 /** Pins distance to 0 <= distance <= getLength(), and then computes
51 bool getPosTan(SkScalar distance, SkPoint* position, SkVector* tangent);
58 /** Pins distance to 0 <= distance <= getLength(), and then computes
63 bool getMatrix(SkScalar distance, SkMatrix* matrix, MatrixFlags flags = kGetPosAndTan_MatrixFlag);
64 /** Given a start and stop distance, return in dst the intervening segment(s).
94 SkScalar fDistance; // total distance up to this point
106 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance,
108 SkScalar compute_cubic_segs(const SkPoint pts[3], SkScalar distance,
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| shortest-distance.h | 1 // 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 from the 'opts.source' state t
[all...] |
| shortest-path.h | 27 #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)[s]
353 vector<typename Arc::Weight> distance; local
[all...] |
| /dalvik/vm/mterp/x86/ |
| OP_GOTO.S | 6 * The branch distance is a signed code-unit offset, which we need to
|
| OP_GOTO_16.S | 6 * The branch distance is a signed code-unit offset
|
| OP_GOTO_32.S | 6 * The branch distance is a signed code-unit offset.
|
| OP_SHL_LONG.S | 5 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
6 * 6 bits of the shift distance. x86 shifts automatically mask off
|
| OP_SHR_LONG.S | 5 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
6 * 6 bits of the shift distance. x86 shifts automatically mask off
|
| OP_USHR_LONG.S | 5 * distance) is 32-bit. Also, Dalvik requires us to mask off the low
6 * 6 bits of the shift distance. x86 shifts automatically mask off
|
| /frameworks/base/graphics/java/android/graphics/ |
| PathMeasure.java | 75 * Pins distance to 0 <= distance <= getLength(), and then computes the
80 * @param distance The distance along the current contour to sample
85 public boolean getPosTan(float distance, float pos[], float tan[]) {
90 return native_getPosTan(native_instance, distance, pos, tan);
97 * Pins distance to 0 <= distance <= getLength(), and then computes the
101 * @param distance The distance along the associated pat
[all...] |
| /external/skia/include/effects/ |
| Sk1DPathEffect.h | 36 /** Called with the current distance along the path, with the current matrix
37 for the point/tangent at the specified distance.
38 Return the distance to travel for the next call. If return <= 0, then that
41 virtual SkScalar next(SkPath* dst, SkScalar distance, SkPathMeasure&) = 0;
60 @param phase distance (mod advance) along path for its initial position
74 virtual SkScalar next(SkPath* dst, SkScalar distance, SkPathMeasure&);
|
| /external/skia/src/effects/ |
| SkDiscretePathEffect.cpp | 59 SkScalar distance = 0;
64 distance += delta/2;
66 meas.getPosTan(distance, &p, &v);
71 distance += delta;
72 meas.getPosTan(distance, &p, &v);
|
| /frameworks/base/core/java/android/gesture/ |
| InstanceLearner.java | 54 double distance; local
56 distance = GestureUtils.minimumCosineDistance(sample.vector, vector, orientationType);
58 distance = GestureUtils.squaredEuclideanDistance(sample.vector, vector);
61 if (distance == 0) {
64 weight = 1 / distance;
|
| /frameworks/base/core/java/android/widget/ |
| Scroller.java | 129 * @return The new X offset as an absolute distance from the origin.
138 * @return The new Y offset as an absolute distance from the origin.
158 * @return The start X offset as an absolute distance from the origin.
167 * @return The start Y offset as an absolute distance from the origin.
176 * @return The final X offset as an absolute distance from the origin.
185 * @return The final Y offset as an absolute distance from the origin.
218 float distance = (mVelocity * timePassedSeconds) local
221 mCurrX = mStartX + Math.round(distance * mCoeffX);
226 mCurrY = mStartY + Math.round(distance * mCoeffY);
247 * Start scrolling by providing a starting point and the distance to travel
[all...] |
| /external/webkit/WebCore/platform/graphics/ |
| PathTraversalState.cpp | 118 // approximateDistance() + current total distance > desired distance
162 float distance = distanceLine(m_current, m_start); local
164 return distance;
175 float distance = distanceLine(m_current, point); local
177 return distance;
182 float distance = curveLength<QuadraticBezier>(*this, QuadraticBezier(m_current, newControl, newEnd)); local
190 return distance;
195 float distance = curveLength<CubicBezier>(*this, CubicBezier(m_current, newControl1, newControl2, newEnd)); local
203 return distance;
[all...] |
| /external/chromium/third_party/zlib/ |
| inffast.c | 33 Decode literal, length, and distance codes and write out the resulting
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
62 - The maximum bytes that a single length/distance pair can output is 258
78 unsigned dmax; /* maximum distance from zlib header */
89 unsigned dmask; /* mask for first level of distance codes */
94 unsigned dist; /* match distance */
164 if (op & 16) { /* distance base */
178 strm->msg = (char *)"invalid distance too far back"
[all...] |
| inftrees.h | 16 distance, an end-of-block, or an invalid code. For a table
18 that table. For a length or distance, the low four bits of op
22 of a literal, the base length or distance, or the offset from
33 0001eeee - length or distance, eeee is the number of extra bits
|
| /external/qemu/distrib/zlib-1.2.3/ |
| inffast.c | 33 Decode literal, length, and distance codes and write out the resulting
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
62 - The maximum bytes that a single length/distance pair can output is 258
78 unsigned dmax; /* maximum distance from zlib header */
89 unsigned dmask; /* mask for first level of distance codes */
94 unsigned dist; /* match distance */
164 if (op & 16) { /* distance base */
178 strm->msg = (char *)"invalid distance too far back"
[all...] |
| inftrees.h | 16 distance, an end-of-block, or an invalid code. For a table
18 that table. For a length or distance, the low four bits of op
22 of a literal, the base length or distance, or the offset from
33 0001eeee - length or distance, eeee is the number of extra bits
|
| /external/zlib/ |
| inffast.c | 33 Decode literal, length, and distance codes and write out the resulting
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
62 - The maximum bytes that a single length/distance pair can output is 258
78 unsigned dmax; /* maximum distance from zlib header */
89 unsigned dmask; /* mask for first level of distance codes */
94 unsigned dist; /* match distance */
164 if (op & 16) { /* distance base */
178 strm->msg = (char *)"invalid distance too far back"
[all...] |
| inftrees.h | 16 distance, an end-of-block, or an invalid code. For a table
18 that table. For a length or distance, the low four bits of op
22 of a literal, the base length or distance, or the offset from
33 0001eeee - length or distance, eeee is the number of extra bits
39 1444, which is the sum of 852 for literal/length codes and 592 for distance
44 returns returns 852, and "enough 30 6 15" for distance codes returns 592.
|
| /external/zlib/contrib/infback9/ |
| inftree9.h | 16 distance, an end-of-block, or an invalid code. For a table
18 that table. For a length or distance, the low four bits of op
22 of a literal, the base length or distance, or the offset from
33 100eeeee - length or distance, eeee is the number of extra bits
39 1446, which is the sum of 852 for literal/length codes and 594 for distance
44 returns returns 852, and "enough 32 6 15" for distance codes returns 594.
|
| /frameworks/base/location/tests/locationtests/src/android/location/ |
| LocationTest.java | 157 float distance; local
166 distance = zeroLocation.distanceTo(zeroLocation);
167 message = "distanceToTest: Distance should be 0, actual value is " +
168 String.valueOf(distance);
169 assertEquals(message, distance, 0, 0);
171 distance = zeroLocation.distanceTo(testLocation);
172 message = "distanceToTest: Distance should be 8885140, actual value is " +
173 String.valueOf(distance);
174 assertEquals(message, distance, 8885140.0, 1);
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/util/ |
| LevenshteinDistance.java | 20 * This class represents the matrix used in the Levenshtein distance algorithm, together
60 * Implementation of Levenshtein distance algorithm.
62 * @return The Levenshtein distance.
77 int distance = distTab[s-1][t] + 1; local
81 if (d + 1 < distance ) {
82 distance = d + 1;
87 if (d + cost < distance) {
88 distance = d + cost;
91 distTab[s][t] = distance;
|
