/external/openfst/src/include/fst/ |
H A D | shortest-distance.h | 1 // 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 D | 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)[ 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/selinux/libsepol/src/ |
H A D | ebitmap.c | 145 int distance = ebitmap_cardinality(&tmp); local 147 return distance;
|
/external/skia/src/effects/ |
H A D | SkDashPathEffect.cpp | 266 SkScalar distance = 0; local 296 distance += clampedInitialDashLength; 299 distance += fIntervals[1]; // skip over the next blank block too 301 distance += clampedInitialDashLength; 306 distance += SkScalarHalf(fIntervals[0]); 309 SkScalar x = pts[0].fX + SkScalarMul(tangent.fX, distance); 310 SkScalar y = pts[0].fY + SkScalarMul(tangent.fY, distance); 316 distance += fIntervalLength; 319 distance -= SkScalarHalf(fIntervals[0]); 325 SkScalar temp = length - distance; [all...] |
/external/skia/src/pathops/ |
H A D | SkPathOpsPoint.h | 140 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ? 163 double dist = dA.distance(dB); // OPTIMIZATION: can we compare against distSq instead ? 180 double distance(const SkDPoint& a) const { function in struct:SkDPoint 201 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ? 215 double dist = dA.distance(dB); // OPTIMIZATION: can we compare against distSq instead ?
|
H A D | SkPathOpsQuad.cpp | 149 double distance = lineParameters.controlPtDistance(*this); local 155 return approximately_zero_when_compared_to(distance, largest);
|
/external/skia/src/utils/ |
H A D | SkDashPath.cpp | 269 double distance = 0; local 272 while (distance < length) { 280 lineRec.addSegment(SkDoubleToScalar(distance), 281 SkDoubleToScalar(distance + dlen), 284 meas.getSegment(SkDoubleToScalar(distance), 285 SkDoubleToScalar(distance + dlen), 289 distance += dlen;
|
/external/webp/src/dsp/ |
H A D | lossless.h | 177 // Splitting of distance and length codes into prefixes and 180 static WEBP_INLINE void VP8LPrefixEncodeBitsNoLUT(int distance, int* const code, argument 182 const int highest_bit = BitsLog2Floor(--distance); 183 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; 188 static WEBP_INLINE void VP8LPrefixEncodeNoLUT(int distance, int* const code, argument 191 const int highest_bit = BitsLog2Floor(--distance); 192 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; 194 *extra_bits_value = distance & ((1 << *extra_bits) - 1); 207 static WEBP_INLINE void VP8LPrefixEncodeBits(int distance, int* const code, argument 209 if (distance < PREFIX_LOOKUP_IDX_MA 218 VP8LPrefixEncode(int distance, int* const code, int* const extra_bits, int* const extra_bits_value) argument [all...] |
/external/webp/src/enc/ |
H A D | backward_references.h | 50 static WEBP_INLINE PixOrCopy PixOrCopyCreateCopy(uint32_t distance, argument 54 retval.argb_or_distance = distance;
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/geometry/ |
H A D | Vector3D.java | 466 /** Compute the distance between two vectors according to the L<sub>1</sub> norm. 472 * @return the distance between v1 and v2 according to the L<sub>1</sub> norm 481 /** Compute the distance between two vectors according to the L<sub>2</sub> norm. 487 * @return the distance between v1 and v2 according to the L<sub>2</sub> norm 489 public static double distance(Vector3D v1, Vector3D v2) { method in class:Vector3D 496 /** Compute the distance between two vectors according to the L<sub>∞</sub> norm. 502 * @return the distance between v1 and v2 according to the L<sub>∞</sub> norm 511 /** Compute the square of the distance between two vectors. 517 * @return the square of the distance between v1 and v2
|
/external/chromium-trace/trace-viewer/tracing/third_party/gl-matrix/src/gl-matrix/ |
H A D | vec3.js | 242 * Calculates the euclidian distance between two vec3's 246 * @returns {Number} distance between a and b 248 vec3.distance = function(a, b) { 256 * Alias for {@link vec3.distance} 259 vec3.dist = vec3.distance; 262 * Calculates the squared euclidian distance between two vec3's 266 * @returns {Number} squared distance between a and b
|
/external/deqp/framework/common/ |
H A D | tcuVectorUtil.hpp | 84 inline float distance (float x, float y) { return deFloatAbs(x - y); } function in namespace:tcu 157 inline T distance (const Vector<T, Size>& a, const Vector<T, Size>& b) function in namespace:tcu
|
/external/jmonkeyengine/engine/src/core/com/jme3/math/ |
H A D | Vector2f.java | 303 * <code>distanceSquared</code> calculates the distance squared between 306 * @param v the second vector to determine the distance squared. 307 * @return the distance squared between the two vectors. 316 * <code>distanceSquared</code> calculates the distance squared between 321 * @return the distance squared between the two vectors. 330 * <code>distance</code> calculates the distance between this vector and 333 * @param v the second vector to determine the distance. 334 * @return the distance between the two vectors. 336 public float distance(Vector2 method in class:Vector2f [all...] |
H A D | Vector3f.java | 424 * <code>distanceSquared</code> calculates the distance squared between
427 * @param v the second vector to determine the distance squared.
428 * @return the distance squared between the two vectors.
438 * <code>distance</code> calculates the distance between this vector and
441 * @param v the second vector to determine the distance.
442 * @return the distance between the two vectors.
444 public float distance(Vector3f v) {
method in class:Vector3f
|
H A D | Vector4f.java | 356 * <code>distanceSquared</code> calculates the distance squared between 359 * @param v the second vector to determine the distance squared. 360 * @return the distance squared between the two vectors. 371 * <code>distance</code> calculates the distance between this vector and 374 * @param v the second vector to determine the distance. 375 * @return the distance between the two vectors. 377 public float distance(Vector4f v) { method in class:Vector4f
|
/external/llvm/include/llvm/IR/ |
H A D | CFG.h | 233 int distance = idx - x.idx; local 234 return distance;
|
/external/opencv/cv/src/ |
H A D | _cvkdtree.hpp | 303 accum_type dist; // distance from d to query point 315 accum_type dist; // minimum distance from bounds to query point 327 // construct bbf_node given minimum distance to bounds of alternate branch 352 // compute euclidean distance between two points 354 accum_type distance(const __desctype * d, const __valuetype & p) const { function in class:CvKDTree 368 bbf_nn nn(p, distance(d, p));
|
/external/skia/src/core/ |
H A D | SkDistanceFieldGen.cpp | 13 float fDistSq; // distance squared to nearest (so far) edge texel 14 SkPoint fDistVector; // distance vector to nearest (so far) edge texel 107 // computes the distance to an edge given an edge normal vector and a pixel's alpha value 112 float distance; local 114 distance = 0.5f - alpha; 128 // we now compute the approximate distance, depending where the alpha falls 134 distance = 0.5f*(dx + dy) - SkScalarSqrt(2.0f*dx*dy*alpha); 137 distance = (0.5f - alpha)*dx; 141 distance = -0.5f*(dx + dy) + SkScalarSqrt(2.0f*dx*dy*(1.0f - alpha)); 145 return distance; [all...] |
/external/zopfli/src/zopfli/ |
H A D | 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) { argument 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 162 TryGetFromLongestMatchCache(ZopfliBlockState* s, size_t pos, size_t* limit, unsigned short* sublen, unsigned short* distance, unsigned short* length) argument 206 StoreInLongestMatchCache(ZopfliBlockState* s, size_t pos, size_t limit, const unsigned short* sublen, unsigned short distance, unsigned short length) argument 229 ZopfliFindLongestMatch(ZopfliBlockState* s, const ZopfliHash* h, const unsigned char* array, size_t pos, size_t size, size_t limit, unsigned short* sublen, unsigned short* distance, unsigned short* length) argument [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
H A D | MathUtils.java | 1969 * Calculates the L<sub>1</sub> (sum of abs) distance between two points. 1973 * @return the L<sub>1</sub> distance between the two points 1984 * Calculates the L<sub>1</sub> (sum of abs) distance between two points. 1988 * @return the L<sub>1</sub> distance between the two points 1999 * Calculates the L<sub>2</sub> (Euclidean) distance between two points. 2003 * @return the L<sub>2</sub> distance between the two points 2005 public static double distance(double[] p1, double[] p2) { method in class:MathUtils 2015 * Calculates the L<sub>2</sub> (Euclidean) distance between two points. 2019 * @return the L<sub>2</sub> distance between the two points 2021 public static double distance(in method in class:MathUtils [all...] |
/external/deqp/modules/gles2/scripts/ |
H A D | genutil.py | 171 def distance(a, b): return a.distance(b) member in class:GenMath 237 def distance(self, v): member in class:Scalar 355 def distance(self, v): member in class:Vec2 441 def distance(self, v): member in class:Vec3 534 def distance(self, v): member in class:Vec4
|
/external/deqp/modules/gles3/scripts/ |
H A D | genutil.py | 181 def distance(a, b): return a.distance(b) member in class:GenMath 263 def distance(self, v): member in class:Scalar 423 def distance(self, v): member in class:Vec2 534 def distance(self, v): member in class:Vec3 654 def distance(self, v): member in class:Vec4
|
/external/deqp/modules/gles31/scripts/ |
H A D | genutil.py | 181 def distance(a, b): return a.distance(b) member in class:GenMath 263 def distance(self, v): member in class:Scalar 425 def distance(self, v): member in class:Vec2 536 def distance(self, v): member in class:Vec3 656 def distance(self, v): member in class:Vec4
|
/external/icu/icu4c/source/i18n/ |
H A D | dtitvinf.cpp | 503 // calculate distance 504 int32_t distance = 0; local 514 distance += DIFFERENT_FIELD; 517 distance += DIFFERENT_FIELD; 520 distance += STRING_NUMERIC_DIFFERENCE; 522 distance += (inputFieldWidth > fieldWidth) ? 527 if ( distance < bestDistance ) { 529 bestDistance = distance; 532 if ( distance == 0 ) {
|
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_temporal_filter.c | 360 int distance, int group_boost) { 362 vp9_lookahead_depth(cpi->lookahead) - distance - 1; 370 if (frames_fwd > distance) 371 frames_fwd = distance; 377 if (frames_bwd < distance) 416 void vp9_temporal_filter(VP9_COMP *cpi, int distance) { argument 428 adjust_arnr_filter(cpi, distance, rc->gfu_boost); 433 start_frame = distance + frames_to_blur_forward; 359 adjust_arnr_filter(VP9_COMP *cpi, int distance, int group_boost) argument
|