/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |
/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/zopfli/src/zopflipng/lodepng/ |
H A D | lodepng.cpp | 451 /*the distance codes have their own symbols, 30 used, 2 unused*/ 466 /*the base backwards distances (the bits of distance codes appear after length codes and use their own huffman tree)*/ 881 /*get the distance code tree of a deflated block with fixed tree, as specified in the deflate specification*/ 888 /*there are 32 distance codes, but 30-31 are unused*/ 957 /*number of distance codes. Unlike the spec, the value 1 is added to it here already*/ 1091 HuffmanTree tree_d; /*the huffman tree for distance codes*/ 1116 unsigned code_d, distance; local 1117 unsigned numextrabits_l, numextrabits_d; /*extra bits for length and distance*/ 1128 /*part 3: get distance code*/ 1138 else error = 18; /*error: invalid distance cod 1314 addLengthDistance(uivector* values, size_t length, size_t distance) argument [all...] |
/external/vixl/src/a64/ |
H A D | assembler-a64.cc | 2148 // * the distance to the first literal load handled by this pool is greater 2149 // than the recommended distance and the literal pool can be emitted without 2151 // * the distance to the first literal load handled by this pool is greater 2152 // than twice the recommended distance. 2166 intptr_t distance = pc_ - literals_.back()->pc_; local 2167 if ((distance < kRecommendedLiteralPoolRange) || 2169 (distance < (2 * kRecommendedLiteralPoolRange)))) {
|
/external/webp/src/dsp/ |
H A D | lossless.h | 181 // Splitting of distance and length codes into prefixes and 184 static WEBP_INLINE void VP8LPrefixEncodeBitsNoLUT(int distance, int* const code, argument 186 const int highest_bit = BitsLog2Floor(--distance); 187 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; 192 static WEBP_INLINE void VP8LPrefixEncodeNoLUT(int distance, int* const code, argument 195 const int highest_bit = BitsLog2Floor(--distance); 196 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; 198 *extra_bits_value = distance & ((1 << *extra_bits) - 1); 211 static WEBP_INLINE void VP8LPrefixEncodeBits(int distance, int* const code, argument 213 if (distance < PREFIX_LOOKUP_IDX_MA 222 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.c | 267 uint32_t distance; local 285 distance = (uint32_t)(base_position - pos); 288 if (distance < 9 * xsize) { 289 const uint32_t y = distance / xsize; 290 uint32_t x = distance % xsize; 302 best_distance = distance; 306 if ((best_distance == 1 || distance == xsize) && 554 uint32_t distance) { 556 VP8LPrefixEncodeBits(distance, &code, &extra_bits); 553 GetDistanceCost(const CostModel* const m, uint32_t distance) argument
|
H A D | backward_references.h | 50 static WEBP_INLINE PixOrCopy PixOrCopyCreateCopy(uint32_t distance, argument 54 retval.argb_or_distance = distance;
|
H A D | vp8l.c | 459 int code, distance; local 465 distance = PixOrCopyDistance(v); 466 VP8LPrefixEncode(distance, &code, &n_bits, &bits);
|
/external/stlport/stlport/stl/ |
H A D | _iterator_base.h | 361 distance(_InputIterator __first, _InputIterator __last) function in struct:iterator_traits 366 inline void _STLP_CALL distance(const _InputIterator& __first, function in struct:iterator_traits 368 { __n += _STLP_STD::distance(__first, __last); } 375 { __n += _STLP_STD::distance(__first, __last); }
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | 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);
|
H A D | queue.h | 271 NaturalShortestFirstQueue(vector<W> *distance) : argument 272 ShortestFirstQueue<S, C>(C(distance, less_)) {} 501 // This constructor takes a state distance vector that, if non-null and if 503 // shortest-first queue using the natural order w.r.t to the distance. 505 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance, argument 531 if (distance && (Weight::Properties() & kPath)) { 533 comp = new Compare(distance, *less);
|
H A D | rmepsilon.h | 33 #include "fst/lib/shortest-distance.h" 61 vector<Weight> *distance, 63 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true) { 116 // Shortest distance algorithm computation state. 196 // The vector 'distance' will be used to hold the shortest distances 201 vector<typename Arc::Weight> *distance, 242 rmeps_state(*fst, distance, opts); 291 vector<Weight> distance; local 292 AutoQueue<StateId> state_queue(*fst, &distance, EpsilonArcFilte 60 RmEpsilonState(const Fst<Arc> &fst, vector<Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument 200 RmEpsilon(MutableFst<Arc> *fst, vector<typename Arc::Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument [all...] |
H A D | 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 fro 60 ShortestDistanceState( const Fst<Arc> &fst, vector<Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, bool retain) argument 199 ShortestDistance( const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) argument 230 ShortestDistance(const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, bool reverse = false) argument [all...] |
H A D | 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)[ 61 SingleShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument 173 ShortestPathCompare(const vector<Pair>& pairs, const vector<Weight>& distance, StateId sfinal, float d) argument 228 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument 353 vector<typename Arc::Weight> distance; local [all...] |
/external/skia/src/animator/ |
H A D | SkDrawExtraPathEffect.cpp | 104 virtual SkScalar next(SkPath* dst, SkScalar distance, SkPathMeasure&) const { argument 105 fMaker->setExtraPropertyCallBack(fDraw->fType, GetDistance, &distance); 113 apply->interpolate(*fMaker, SkScalarRoundToInt(distance * 1000)); 126 apply->interpolate(*fMaker, SkScalarRoundToInt(distance * 1000)); 152 if (SK_LITERAL_STR_EQUAL("distance", token, len)) {
|
/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...] |
H A D | SkPathMeasure.cpp | 84 SkScalar distance, int mint, int maxt, int ptIndex) { 90 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex); 91 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex); 94 SkScalar prevD = distance; 95 distance += d; 96 if (distance > prevD) { 98 seg->fDistance = distance; 104 return distance; 83 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument 107 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument 134 SkScalar distance = 0; local [all...] |
/external/skia/src/effects/ |
H A D | Sk1DPathEffect.cpp | 20 SkScalar distance = this->begin(length); local 21 while (distance < length) { 22 SkScalar delta = this->next(dst, distance, meas); 26 distance += delta; 178 SkScalar SkPath1DPathEffect::next(SkPath* dst, SkScalar distance, argument 183 if (meas.getPosTan(distance, &pos, NULL)) { 189 if (meas.getMatrix(distance, &matrix)) { 194 morphpath(dst, fPath, meas, distance);
|
H A D | SkDashPathEffect.cpp | 146 SkScalar distance = 0; local 176 distance += clampedInitialDashLength; 179 distance += fIntervals[1]; // skip over the next blank block too 181 distance += clampedInitialDashLength; 186 distance += SkScalarHalf(fIntervals[0]); 189 SkScalar x = pts[0].fX + SkScalarMul(tangent.fX, distance); 190 SkScalar y = pts[0].fY + SkScalarMul(tangent.fY, distance); 196 distance += fIntervalLength; 199 distance -= SkScalarHalf(fIntervals[0]); 205 SkScalar temp = length - distance; [all...] |
H A D | SkDiscretePathEffect.cpp | 52 SkScalar distance = 0; local 56 distance += delta/2; 59 if (meas.getPosTan(distance, &p, &v)) { 64 distance += delta; 65 if (meas.getPosTan(distance, &p, &v)) {
|
/external/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 315 // OPTIMIZE: using calcMask value permits skipping some distance calcuations 510 double distance = dx * dx + dy * dy; local 511 if (dist[index] <= distance) { 518 if (dist[outer] < distance) { 523 dist[index] = distance;
|
H A D | SkPathOpsCubic.cpp | 132 double distance = lineParameters.controlPtDistance(*this, 1); local 133 if (!approximately_zero(distance)) { 136 distance = lineParameters.controlPtDistance(*this, 2); 137 return approximately_zero(distance);
|
H A D | SkPathOpsPoint.h | 121 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ? 144 double dist = dA.distance(dB); // OPTIMIZATION: can we compare against distSq instead ? 165 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ? 179 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ? 195 double distance(const SkDPoint& a) const { function in struct:SkDPoint 216 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ?
|
H A D | SkPathOpsQuad.cpp | 13 // from http://blog.gludion.com/2009/08/distance-to-quadratic-bezier-curve.html 142 double distance = lineParameters.controlPtDistance(*this); local 143 return approximately_zero(distance);
|
/external/skia/src/utils/ |
H A D | SkDashPath.cpp | 268 double distance = 0; local 271 while (distance < length) { 279 lineRec.addSegment(SkDoubleToScalar(distance), 280 SkDoubleToScalar(distance + dlen), 283 meas.getSegment(SkDoubleToScalar(distance), 284 SkDoubleToScalar(distance + dlen), 288 distance += dlen;
|