| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/ |
| editdistance.py | 34 distances = [array(unsignedShort, (0,) * (len(str2) + 1)) for i in range(0, len(str1) + 1)]
35 # distances[0][0] = 0 since distance between str1[:0] and str2[:0] is 0
37 distances[i][0] = i # Distance between str1[:i] and str2[:0] is i
40 distances[0][j] = j # Distance between str1[:0] and str2[:j] is j
46 distances[i + 1][j + 1] = min(distances[i + 1][j] + 1, distances[i][j + 1] + 1, distances[i][j] + diff)
47 return distances[len(str1)][len(str2)]
|
| /external/chromium_org/third_party/lzma_sdk/ |
| LzFind.h | 78 UInt32 *distances, UInt32 maxLen);
90 typedef UInt32 (*Mf_GetMatches_Func)(void *object, UInt32 *distances);
106 UInt32 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
107 UInt32 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
|
| LzFind.c | 324 UInt32 *distances, UInt32 maxLen)
331 return distances;
343 *distances++ = maxLen = len;
344 *distances++ = delta - 1;
346 return distances;
355 UInt32 *distances, UInt32 maxLen)
366 return distances;
380 *distances++ = maxLen = len;
381 *distances++ = delta - 1;
386 return distances;
[all...] |
| /external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
| LzFind.h | 79 UInt32 *distances, UInt32 maxLen);
91 typedef UInt32 (*Mf_GetMatches_Func)(void *object, UInt32 *distances);
107 UInt32 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
108 UInt32 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
|
| LzFind.c | 325 UInt32 *distances, UInt32 maxLen)
332 return distances;
344 *distances++ = maxLen = len;
345 *distances++ = delta - 1;
347 return distances;
356 UInt32 *distances, UInt32 maxLen)
367 return distances;
381 *distances++ = maxLen = len;
382 *distances++ = delta - 1;
387 return distances;
[all...] |
| /external/lzma/C/ |
| LzFind.h | 78 UInt32 *distances, UInt32 maxLen);
90 typedef UInt32 (*Mf_GetMatches_Func)(void *object, UInt32 *distances);
106 UInt32 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
107 UInt32 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
|
| LzFind.c | 324 UInt32 *distances, UInt32 maxLen)
331 return distances;
343 *distances++ = maxLen = len;
344 *distances++ = delta - 1;
346 return distances;
355 UInt32 *distances, UInt32 maxLen)
366 return distances;
380 *distances++ = maxLen = len;
381 *distances++ = delta - 1;
386 return distances;
[all...] |
| LzFindMt.c | 240 UInt32 *distances = _distances + 1;
local
268 *distances++ = maxLen = len;
269 *distances++ = delta - 1;
298 UInt32 num = (UInt32)(distances - _distances);
311 void BtGetMatches(CMatchFinderMt *p, UInt32 *distances)
316 distances[1] = p->hashNumAvail;
322 distances[1] = numProcessed + p->hashNumAvail;
326 distances[curPos++] = 0;
347 UInt32 *startDistances = distances + curPos;
361 distances + curPos, p->numHashBytes - 1, p->hashBuf + p->hashBufPos, (Int32)(limit - curPos) , size, &posRes (…)
[all...] |
| LzFindMt.h | 41 typedef UInt32 * (*Mf_Mix_Matches)(void *p, UInt32 matchMinPos, UInt32 *distances);
|
| /external/lzma/CS/7zip/Compress/LZ/ |
| IMatchFinder.cs | 21 UInt32 GetMatches(UInt32[] distances);
|
| LzBinTree.cs | 118 public UInt32 GetMatches(UInt32[] distances)
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/ |
| BinTree.java | 118 public int GetMatches(int[] distances) throws IOException
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/tcpdump/ |
| print-egp.c | 144 int gateways, distances, networks; local
182 distances = *cp++;
189 while (--distances >= 0) {
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsCommon.cpp | 393 DistanceLessThan(double* distances) : fDistances(distances) { }
450 SkTArray<double, true> distances; local
451 distances.push_back_n(entries);
465 distances[row + iIndex] = dist; // oStart distance from iStart
473 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin()));
|
| /external/skia/src/pathops/ |
| SkPathOpsCommon.cpp | 393 DistanceLessThan(double* distances) : fDistances(distances) { }
450 SkTArray<double, true> distances; local
451 distances.push_back_n(entries);
465 distances[row + iIndex] = dist; // oStart distance from iStart
473 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin()));
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| HeapSnapshot.js | 804 var distances = new Int32Array(nodeCount);
807 distances[i] = noDistance;
818 if (distances[ordinal] !== noDistance)
820 distances[ordinal] = 0;
825 this._bfs(nodesToVisit, nodesToVisitLength, distances);
830 this._bfs(nodesToVisit, nodesToVisitLength, distances);
832 this._nodeDistances = distances;
838 * @param {!Int32Array} distances
840 _bfs: function(nodesToVisit, nodesToVisitLength, distances)
859 var distance = distances[nodeOrdinal] + 1
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/bounding/ |
| BoundingBox.java | 733 float[] distances = t;
local
735 new Vector3f(ray.direction).multLocal(distances[0]).addLocal(ray.origin),
736 new Vector3f(ray.direction).multLocal(distances[1]).addLocal(ray.origin)
739 CollisionResult result = new CollisionResult(points[0], distances[0]);
741 result = new CollisionResult(points[1], distances[1]);
[all...] |
| /cts/tests/tests/hardware/src/android/hardware/cts/ |
| CameraTest.java | [all...] |
| /external/blktrace/btt/doc/ |
| btt.tex | 234 Another useful measure is the variability in the sector distances
243 The first of the two sections displays values for Q2Q seek distances --
245 are to each other. The second section shows D2D seek distances --
[all...] |
| /external/iproute2/doc/ |
| ip-cref.tex | [all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar | |
| org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar | |
