| /external/skia/src/effects/ |
| SkDiscretePathEffect.cpp | 47 SkScalar distance = 0;
51 distance += delta/2;
53 meas.getPosTan(distance, &p, &v);
57 distance += delta;
58 meas.getPosTan(distance, &p, &v);
|
| Sk1DPathEffect.cpp | 17 SkScalar distance = this->begin(length); local
18 while (distance < length) {
19 SkScalar delta = this->next(dst, distance, meas);
23 distance += delta;
161 SkScalar SkPath1DPathEffect::next(SkPath* dst, SkScalar distance,
166 meas.getPosTan(distance, &pos, NULL);
171 meas.getMatrix(distance, &matrix);
175 morphpath(dst, fPath, meas, distance);
|
| /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;
|
| /external/openfst/src/include/fst/script/ |
| rmepsilon.h | 26 #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, ropts)
138 vector<typename Arc::Weight> distance; local
[all...] |
| shortest-distance.h | 28 #include <fst/shortest-distance.h>
36 // See nlp/fst/lib/shortest-distance.h for the template options class
73 const vector<typename Arc::Weight> *distance) {
74 return new AutoQueue<typename Arc::StateId>(fst, distance, ArcFilter());
85 const vector<typename Arc::Weight> *distance) {
87 typename Arc::Weight>(*distance);
207 vector<typename Arc::Weight> distance; local
209 ShortestDistance(fst, &distance, args->arg3, args->arg4);
213 retval->resize(distance.size());
215 for (unsigned i = 0; i < distance.size(); ++i)
[all...] |
| /external/openfst/src/include/fst/ |
| shortest-path.h | 33 #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)[s]
489 vector<typename Arc::Weight> distance; local
[all...] |
| push.h | 31 #include <fst/shortest-distance.h>
40 // the output of ShortestDistance. 'distance' is the shortest distance from the
46 const vector<typename Arc::Weight> &distance,
49 return fst.Start() < distance.size() ?
50 distance[fst.Start()] : Arc::Weight::Zero();
53 for (typename Arc::StateId s = 0; s < distance.size(); ++s)
54 sum = Plus(sum, Times(distance[s], fst.Final(s)));
102 vector<typename Arc::Weight> distance; local
103 ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL, delta)
[all...] |
| /device/samsung/tuna/libsensors/ |
| ProximitySensor.cpp | 60 mPendingEvent.distance = indexToValue(absinfo.value);
68 mPendingEvent.distance = indexToValue(event->value);
|
| /external/jmonkeyengine/engine/src/android/com/jme3/util/ |
| FastInteger.java | 240 * @param distance
245 public static int rotateLeft(int i, int distance) {
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) {
269 if (distance == 0) {
274 * implicitly masked with 0x1F, which the negation of 'distance' i
[all...] |
| /external/webkit/Source/WebCore/history/ |
| BackForwardController.h | 47 bool canGoBackOrForward(int distance) const;
48 void goBackOrForward(int distance);
|
| /external/webkit/Source/WebCore/page/ |
| History.h | 51 void go(int distance);
55 void go(ScriptExecutionContext*, int distance);
|
| History.cpp | 84 void History::go(int distance)
89 m_frame->navigationScheduler()->scheduleHistoryNavigation(distance);
92 void History::go(ScriptExecutionContext* context, int distance)
105 m_frame->navigationScheduler()->scheduleHistoryNavigation(distance);
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/ |
| KeyDetector.java | 33 * @param keyHysteresisDistance if the pointer movement distance is smaller than this, the
93 final int distance = key.squaredDistanceToEdge(touchX, touchY); local
95 if (primaryKey == null || distance < minDistance
96 || (distance == minDistance && isOnKey && key.mCode > primaryKey.mCode)) {
97 minDistance = distance;
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| HitPlayerComponent.java | 73 public void setup(float distance, HitReactionComponent hitReact, int hitType, boolean hitPlayer) {
74 mDistance2 = distance * distance;
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| ScrollerHelper.java | 84 // Returns the distance that over the scroll limit.
85 public int startScroll(int distance, int min, int max) {
89 int newPosition = Utils.clamp(finalPosition + distance, min, max);
95 return finalPosition + distance - newPosition;
|
| /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...] |
| 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);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/grid/ |
| GridDropHandler.java | 91 // offset by the top left corner distance
125 // be considered and subtracted from the overall proposed distance!
211 int distance = abs(columnX - x1);
212 if (distance <= max) {
213 columnMatches.add(new GridMatch(SegmentType.LEFT, distance, columnX, column,
244 int distance = abs((x1 + x2) / 2 - matchedLine);
245 if (distance <= 2 * max) {
247 columnMatches.add(new GridMatch(SegmentType.CENTER_HORIZONTAL, distance,
257 int distance = mGrid.getRowDistance(row, y1);
258 if (distance <= max)
[all...] |
| /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 | 51 static int rotateLeft(int i, int distance) {
52 return ((i << distance) | (i >>> (-distance)));
|
| /external/guava/guava/src/com/google/common/collect/ |
| DiscreteDomain.java | 27 * operations: {@link #next}, {@link #previous} and {@link #distance}, according
71 * next(next(next(start)))}, then {@code distance(start, end) == 3} and {@code
72 * distance(end, start) == -3}. As well, {@code distance(a, a)} is always
78 * @return the distance as described above, or {@link Long#MIN_VALUE} or
79 * {@link Long#MIN_VALUE} if the distance is too small or too large,
82 public abstract long distance(C start, C end); method in class:DiscreteDomain
|
| /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/constraints/ |
| ConstraintShrinkWrap.java | 75 float distance = Float.MAX_VALUE;
local
77 float temp = currentTranslation.distance(p);
78 if(temp < distance) {
79 distance = temp;
|
| /external/webkit/Source/WebCore/svg/ |
| SVGTransformDistance.h | 43 float distance() const;
|
| /frameworks/av/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/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/ |
| BresenhamTerrainPicker.java | 51 * all of the TerrainPatches hit (in distance order.) The triangles of each patch
105 float distance = worldPickRay.origin.distance(intersection); local
106 CollisionResult cr = new CollisionResult(intersection, distance);
123 float distance = worldPickRay.origin.distance(intersection); local
124 CollisionResult cr = new CollisionResult(intersection, distance);
151 float distance = worldPickRay.origin.distance(intersection); local
152 CollisionResult cr = new CollisionResult(intersection, distance);
[all...] |
