| /external/lzma/CS/7zip/Compress/LZ/ |
| H A D | IMatchFinder.cs | 21 UInt32 GetMatches(UInt32[] distances);
argument
|
| H A D | LzBinTree.cs | 118 public UInt32 GetMatches(UInt32[] distances)
argument
160 distances[offset++] = maxLen = 2;
161 distances[offset++] = _pos - curMatch2 - 1;
168 distances[offset++] = maxLen = 3;
169 distances[offset++] = _pos - curMatch3 - 1;
194 distances[offset++] = maxLen = kNumHashDirectBytes;
195 distances[offset++] = _pos - curMatch - 1;
223 distances[offset++] = maxLen = len;
224 distances[offset++] = delta - 1;
|
| /external/lzma/Java/SevenZip/Compression/LZ/ |
| H A D | BinTree.java | 118 public int GetMatches(int[] distances) throws IOException
argument
160 distances[offset++] = maxLen = 2;
161 distances[offset++] = _pos - curMatch2 - 1;
168 distances[offset++] = maxLen = 3;
169 distances[offset++] = _pos - curMatch3 - 1;
194 distances[offset++] = maxLen = kNumHashDirectBytes;
195 distances[offset++] = _pos - curMatch - 1;
223 distances[offset++] = maxLen = len;
224 distances[offset++] = delta - 1;
|
| /external/skia/src/pathops/ |
| H A D | SkPathWriter.cpp | 179 DistanceLessThan(double* distances) : fDistances(distances) { } argument
226 SkSTArray<8, double, true> distances(entries);
239 distances.push_back(dist); // oStart distance from iStart
245 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin()));
|
| /external/skqp/src/pathops/ |
| H A D | SkPathWriter.cpp | 179 DistanceLessThan(double* distances) : fDistances(distances) { } argument
226 SkSTArray<8, double, true> distances(entries);
239 distances.push_back(dist); // oStart distance from iStart
245 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin()));
|
| /external/tcpdump/ |
| H A D | print-egp.c | 138 int gateways, distances, networks; local
182 distances = *cp++;
190 while (--distances >= 0) {
|
| /external/tensorflow/tensorflow/contrib/factorization/kernels/ |
| H A D | clustering_ops.cc | 71 // proportion to the squared distances from selected points.
144 // distances to first selected point.
153 // If v is drawn from Uniform[0, distances.sum()), then
154 // Prob[cumsum(distances)(i - 1) <= v < cumsum(distances)(i)] is
155 // proportional to distances(i).
240 InvalidArgument("Input distances should be a vector."));
251 auto distances = distances_tensor.flat<float>(); variable
254 float selected_distance = distances(selected_index);
257 const float candidate_distance = distances(
[all...] |
| /external/lzma/C/ |
| H A D | LzFind.c | 359 UInt32 *distances, UInt32 maxLen)
366 return distances;
378 *distances++ = maxLen = len;
379 *distances++ = delta - 1;
381 return distances;
390 UInt32 *distances, UInt32 maxLen)
401 return distances;
415 *distances++ = maxLen = len;
416 *distances++ = delta - 1;
421 return distances;
357 Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *distances, UInt32 maxLen) argument
388 GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *distances, UInt32 maxLen) argument
526 Bt2_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
537 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
548 Bt3_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
572 distances[0] = maxLen; local
585 Bt4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
626 distances[offset - 2] = maxLen; local
717 Hc4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
758 distances[offset - 2] = maxLen; local
853 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
[all...] |
| H A D | LzFindMt.c | 242 UInt32 *distances = _distances + 1;
local
270 *distances++ = maxLen = len;
271 *distances++ = delta - 1;
300 UInt32 num = (UInt32)(distances - _distances);
313 static void BtGetMatches(CMatchFinderMt *p, UInt32 *distances)
argument
319 distances[1] = p->hashNumAvail;
326 distances[1] = numProcessed + p->hashNumAvail;
329 distances[0] = curPos + p->hashNumAvail;
330 distances += curPos;
332 *distances
564 MixMatches2(CMatchFinderMt *p, UInt32 matchMinPos, UInt32 *distances) argument
585 MixMatches3(CMatchFinderMt *p, UInt32 matchMinPos, UInt32 *distances) argument
677 MatchFinderMt2_GetMatches(CMatchFinderMt *p, UInt32 *distances) argument
695 MatchFinderMt_GetMatches(CMatchFinderMt *p, UInt32 *distances) argument
[all...] |