| /external/chromium-trace/catapult/telemetry/telemetry/internal/image_processing/ |
| cv_util.py | 70 """Approximates distance between point and line for small distances using
72 an approximate distance in pixels, precision decreases with distance."""
81 """Computes the square of the distance between two sets of points, or a
88 """Computes the square of the distance between two points."""
|
| /external/libcxx/test/std/containers/sequences/list/list.cons/ |
| size_value_alloc.pass.cpp | 25 assert(std::distance(l.begin(), l.end()) == 3);
36 assert(std::distance(l.begin(), l.end()) == 3);
47 assert(std::distance(l.begin(), l.end()) == 3);
59 assert(std::distance(l.begin(), l.end()) == 3);
70 assert(std::distance(l.begin(), l.end()) == 3);
|
| /external/libgdx/extensions/gdx-tools/src/com/badlogic/gdx/tools/hiero/unicodefont/effects/ |
| DistanceFieldEffect.java | 32 * A filter to create a distance field. The resulting font can be rendered
86 return "Distance field";
93 values.add(EffectUtil.intValue("Scale", scale, "The distance field is computed from an image larger than the output glyph by this factor. Set this to a higher value for more accuracy, but slower font generation."));
94 values.add(EffectUtil.floatValue("Spread", spread, 1.0f, Float.MAX_VALUE, "The maximum distance from edges where the effect of the distance field is seen. Set this to about half the width of lines in your output font."));
|
| OutlineWobbleEffect.java | 98 float distance = (float)Math.sqrt(dx * dx + dy * dy);
local
99 if (distance >= next) {
100 float r = 1.0f / distance;
101 while (distance >= next) {
108 next -= distance;
|
| OutlineZigzagEffect.java | 98 float distance = (float)Math.sqrt(dx * dx + dy * dy);
local
99 if (distance >= next) {
100 float r = 1.0f / distance;
101 while (distance >= next) {
112 next -= distance;
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| autotuned_index.h | 48 template<typename Distance>
49 NNIndex<Distance>* create_index_by_type(const Matrix<typename Distance::ElementType>& dataset, const IndexParams& params, const Distance& distance);
69 template <typename Distance>
70 class AutotunedIndex : public NNIndex<Distance>
73 typedef typename Distance::ElementType ElementType;
74 typedef typename Distance::ResultType DistanceType;
76 AutotunedIndex(const Matrix<ElementType>& inputData, const IndexParams& params = AutotunedIndexParams(), Distance d = Distance())
[all...] |
| result_set.h | 45 the tree. It contains a record of the minimum distance to the query
53 DistanceType mindist; /* Minimum distance to query for all nodes below. */
346 /** Copy the set to two C arrays but sort it according to the distance first
364 /** The distance of the furthest neighbor
376 /** The worst distance found so far */
402 * @param dist distance for that neighbor
452 * @param radius the maximum distance of a neighbor
461 * @param dist distance for that neighbor
485 /** The distance of the furthest neighbor
498 /** The furthest distance a neighbor can be *
[all...] |
| hierarchical_clustering_index.h | 79 template <typename Distance>
80 class HierarchicalClusteringIndex : public NNIndex<Distance>
83 typedef typename Distance::ElementType ElementType;
84 typedef typename Distance::ResultType DistanceType;
127 DistanceType sq = distance(dataset[centers[index]], dataset[centers[j]], dataset.cols);
164 DistanceType dist = distance(dataset[centers[0]],dataset[dsindices[j]],dataset.cols);
166 DistanceType tmp_dist = distance(dataset[centers[i]],dataset[dsindices[j]],dataset.cols);
212 // Computing distance^2 will have the advantage of even higher probability further to pick new centers
215 closestDistSq[i] = distance(dataset[dsindices[i]], dataset[dsindices[index]], dataset.cols);
216 closestDistSq[i] = ensureSquareDistance<Distance>( closestDistSq[i] )
821 Distance distance; member in class:cvflann::HierarchicalClusteringIndex
[all...] |
| /external/skia/src/effects/ |
| SkDiscretePathEffect.cpp | 94 SkScalar distance = 0; local
98 distance += delta/2;
101 if (meas.getPosTan(distance, &p, &v)) {
106 distance += delta;
107 if (meas.getPosTan(distance, &p, &v)) {
|
| SkDashPathEffect.cpp | 202 SkScalar length = SkPoint::Distance(pts[1], pts[0]);
267 SkScalar distance = 0; local
297 distance += clampedInitialDashLength;
300 distance += fIntervals[1]; // skip over the next blank block too
302 distance += clampedInitialDashLength;
307 distance += SkScalarHalf(fIntervals[0]);
310 SkScalar x = pts[0].fX + SkScalarMul(tangent.fX, distance);
311 SkScalar y = pts[0].fY + SkScalarMul(tangent.fY, distance);
317 distance += fIntervalLength;
320 distance -= SkScalarHalf(fIntervals[0])
[all...] |
| /external/skia/src/gpu/text/ |
| GrDistanceFieldAdjustTable.cpp | 28 // essentially manipulating the geometry (in this case, the distance to the glyph
32 // The distance adjustment is calculated by determining the actual coverage value which
34 // actual coverage value (assuming it's between 0 and 1) corresponds to a distance from the
35 // actual edge. So by subtracting this distance adjustment and computing without the
84 // compute distance which gives us that t value
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| size_value_alloc.pass.cpp | 25 assert(std::distance(l.begin(), l.end()) == 3);
36 assert(std::distance(l.begin(), l.end()) == 3);
47 assert(std::distance(l.begin(), l.end()) == 3);
59 assert(std::distance(l.begin(), l.end()) == 3);
70 assert(std::distance(l.begin(), l.end()) == 3);
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/ |
| KeyDetector.java | 37 * @param keyHysteresisDistance if the pointer movement distance is smaller than this, the
103 final int distance = key.squaredDistanceToEdge(touchX, touchY); local
104 if (distance > minDistance) {
108 if (primaryKey == null || distance < minDistance
110 minDistance = distance;
|
| /external/freetype/src/gzip/ |
| infcodes.c | 1 /* infcodes.c -- process literals and length/distance pairs
20 DIST, /* i: get distance next */
21 DISTEXT, /* i: getting distance extra */
45 uInt dist; /* distance back to copy from */
53 inflate_huft *dtree; /* distance tree */
167 case DIST: /* i: get distance next */
173 if (e & 16) /* distance */
187 z->msg = (char*)"invalid distance code";
190 case DISTEXT: /* i: getting distance extra */
195 Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist))
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| DiscreteDomain.java | 29 * operations: {@link #next}, {@link #previous} and {@link #distance}, according
71 @Override public long distance(Integer start, Integer end) { method in class:DiscreteDomain.IntegerDomain
118 @Override public long distance(Long start, Long end) { method in class:DiscreteDomain.LongDomain
175 @Override public long distance(BigInteger start, BigInteger end) { method in class:DiscreteDomain.BigIntegerDomain
220 * next(next(next(start)))}, then {@code distance(start, end) == 3} and {@code
221 * distance(end, start) == -3}. As well, {@code distance(a, a)} is always
227 * @return the distance as described above, or {@link Long#MIN_VALUE} or
228 * {@link Long#MAX_VALUE} if the distance is too small or too large,
231 public abstract long distance(C start, C end) method in class:DiscreteDomain
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/gzip/ |
| infcodes.c | 1 /* infcodes.c -- process literals and length/distance pairs
20 DIST, /* i: get distance next */
21 DISTEXT, /* i: getting distance extra */
45 uInt dist; /* distance back to copy from */
53 inflate_huft *dtree; /* distance tree */
167 case DIST: /* i: get distance next */
173 if (e & 16) /* distance */
187 z->msg = (char*)"invalid distance code";
190 case DISTEXT: /* i: getting distance extra */
195 Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist))
[all...] |
| /frameworks/rs/api/ |
| rs_vector_math.spec | 62 function: distance
70 summary: Distance between two points
72 Compute the distance between two points.
78 function: distance
122 summary: Approximate distance between two points
124 Computes the approximate distance between two points.
129 See also @distance(), @native_distance().
205 summary: Approximate distance between two points
207 Computes the approximate distance between two points.
209 See also @distance(), @fast_distance()
[all...] |
| /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...] |
| /libcore/ojluni/src/main/java/sun/security/provider/certpath/ |
| Builder.java | 131 * get distance of one GeneralName from another
137 * @return distance of test name from base, where 0
143 static int distance(GeneralNameInterface base, method in class:Builder
149 debug.println("Builder.distance(): Names are different types");
154 debug.println("Builder.distance(): Names are same type but " +
173 * get hop distance of one GeneralName from another in links where
175 * For example, the hop distance from ou=D,ou=C,o=B,c=US to
176 * ou=F,ou=E,ou=C,o=B,c=US is 3: D->C, C->E, E->F. The hop distance
183 * @return distance of test name from base measured in hops in the
250 * @return distance from this certificate to target
366 int distance = distance(perName, target, -1); local
[all...] |
| /external/opencv/cv/src/ |
| cvdominants.cpp | 64 float *distance; local
90 distance = (float *) cvAlloc( n * sizeof( float ));
128 which satisfy distance constraint >dmin */
171 distance[(i + i_plus) % n] = cvSqrt( dist_r );
224 distance[ind] = cvSqrt( dist_l );
254 a = distance[leftind];
261 float b = distance[ind];
317 cvFree( &distance );
326 cvFree( &distance );
348 // [0] - minimal distance
[all...] |
| /external/zopfli/src/zopfli/ |
| lz77.c | 56 Appends the length and distance to the LZ77 arrays of the ZopfliLZ77Store.
67 Gets a score of the length given the distance. Typically, the score of the
68 length is the length itself, but if the distance is very long, decrease the
77 -avoid using a length of 3 in combination with a long distance. This only has
87 static int GetLengthScore(int length, int distance) {
89 At 1024, the distance uses 9+ extra bits and this seems to be the sweet spot
92 return distance > 1024 ? length - 1 : length;
157 Gets distance, length and sublen values from the cache if possible.
164 unsigned short* sublen, unsigned short* distance, unsigned short* length) {
185 *distance = sublen[*length]
[all...] |
| /external/javassist/src/main/javassist/bytecode/ |
| LineNumberAttribute.java | 131 int distance = 0; local
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/lzma/C/ |
| LzmaDec.c | 262 UInt32 distance;
local
268 distance = rep1;
277 distance = rep2;
282 distance = rep3;
288 rep0 = distance;
328 UInt32 distance;
local
331 TREE_6_DECODE(prob, distance);
332 if (distance >= kStartPosModelIndex)
334 unsigned posSlot = (unsigned)distance;
335 int numDirectBits = (int)(((distance >> 1) - 1));
[all...] |
| /external/v8/test/mjsunit/ |
| debug-backtrace-text.js | 48 function distance(p, q) { function
56 a=[1,2,distance];
79 // 0: Call distance on Point where distance is a property on the prototype
80 // 1: Call distance on Point where distance is a direct property
85 assertEquals("#<Array>[2](aka distance)(p=#<Point>, q=#<Point>)", exec_state.frame(2).invocationText());
|
| /external/autotest/client/site_tests/firmware_TouchMTB/ |
| noise_summary.py | 51 # extracts the distance from a line in the html report like this:
52 # Max distance slot0: 0.00 mm
88 # Update maximum distance data
89 if 'Max distance' in data:
90 distance = self._extract_distance(data)
92 if distance > CORRECT_MAX_DISTANCE:
94 self._update_data_dict(distance, DISTANCE_INDEX)
122 # maximum distance counts as one error.
175 outfile.write(' %d issues with distance over all iterations. \n' %
|
