| /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/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-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...] |
| 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...] |
| push.h | 27 #include "fst/lib/shortest-distance.h"
42 vector<typename Arc::Weight> distance; local
43 ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL);
44 Reweight(fst, distance, type);
|
| /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/webkit/WebCore/svg/ |
| ColorDistance.h | 43 float distance() const;
|
| SVGTransformDistance.h | 45 float distance() const;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/list_update_map_/ |
| info_fn_imps.hpp | 45 { return std::distance(begin(), end()); }
|
| /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);
|
| Sk1DPathEffect.cpp | 26 SkScalar distance = this->begin(length); local
27 while (distance < length)
29 SkScalar delta = this->next(dst, distance, meas);
32 distance += delta;
180 SkScalar SkPath1DPathEffect::next(SkPath* dst, SkScalar distance, SkPathMeasure& meas)
186 meas.getPosTan(distance, &pos, NULL);
193 meas.getMatrix(distance, &matrix);
198 morphpath(dst, fPath, meas, distance);
|
| SkDashPathEffect.cpp | 110 SkScalar distance = 0; local
113 while (distance < length)
120 meas.getSegment(distance, distance + dlen, dst, true);
122 distance += dlen;
|
| /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;
|
| /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;
|
| /dalvik/tests/083-jit-regressions/src/ |
| Main.java | 50 static int rotateLeft(int i, int distance) {
51 return ((i << distance) | (i >>> (-distance)));
|
| /external/webkit/WebCore/page/ |
| History.h | 50 void go(int distance);
|
| History.idl | 42 [DoNotCheckDomainSecurity] void go(in long distance);
|
| /frameworks/base/media/libstagefright/codecs/amrwbenc/src/ |
| qpisf_2s.c | 66 Word32 i, k, temp, min_err, distance;
local
78 distance = MAX_32;
93 if(temp < distance)
95 distance = temp;
107 distance = MAX_32;
121 if(temp < distance)
123 distance = temp;
156 Word32 temp, min_err, distance;
local
168 distance = MAX_32;
182 if(temp < distance)
[all...] |
| /external/v8/src/ |
| log-utils.cc | 380 int LogRecordCompressor::GetBackwardReferenceSize(int distance, int pos) {
382 return pos == 0 ? GetNumberLength(distance) + 1
383 : GetNumberLength(distance) + GetNumberLength(pos) + 2;
388 int distance,
391 OS::SNPrintF(dest, kLineBackwardReferenceFormat, distance);
393 OS::SNPrintF(dest, kBackwardReferenceFormat, distance, pos);
424 // Distance from prev_.
425 int distance = 0;
429 int distance;
440 ++distance;
[all...] |
| /external/freetype/src/base/ |
| ftapi.c | 65 FT_Long distance )
67 return FT_Stream_Skip( stream, distance );
|
| /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/webkit/SunSpider/tests/sunspider-0.9/ |
| access-nbody.js | 96 var dx, dy, dz, distance, mag;
107 distance = Math.sqrt(dx*dx + dy*dy + dz*dz);
108 mag = dt / (distance * distance * distance);
129 var dx, dy, dz, distance;
147 distance = Math.sqrt(dx*dx + dy*dy + dz*dz);
148 e -= (bodyi.mass * bodyj.mass) / distance;
|
| /external/webkit/SunSpider/tests/sunspider-0.9.1/ |
| access-nbody.js | 96 var dx, dy, dz, distance, mag;
107 distance = Math.sqrt(dx*dx + dy*dy + dz*dz);
108 mag = dt / (distance * distance * distance);
129 var dx, dy, dz, distance;
147 distance = Math.sqrt(dx*dx + dy*dy + dz*dz);
148 e -= (bodyi.mass * bodyj.mass) / distance;
|
| /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...] |
| /frameworks/base/core/tests/coretests/src/android/widget/listview/touch/ |
| ListOfTouchablesTest.java | 79 int distance = TouchUtils.dragViewToY(this, lastChild, local
83 lastTop - (distance - ViewConfiguration.getTouchSlop() - 1), lastChild.getTop());
|
