/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/ |
D | editdistance.py | 34 distances = [array(unsignedShort, (0,) * (len(str2) + 1)) for i in range(0, len(str1) + 1)] 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] + … 47 return distances[len(str1)][len(str2)]
|
/external/lzma/C/ |
D | LzFind.c | 324 UInt32 *distances, UInt32 maxLen) in Hc_GetMatchesSpec() argument 331 return distances; in Hc_GetMatchesSpec() 343 *distances++ = maxLen = len; in Hc_GetMatchesSpec() 344 *distances++ = delta - 1; in Hc_GetMatchesSpec() 346 return distances; in Hc_GetMatchesSpec() 355 UInt32 *distances, UInt32 maxLen) in GetMatchesSpec1() argument 366 return distances; in GetMatchesSpec1() 380 *distances++ = maxLen = len; in GetMatchesSpec1() 381 *distances++ = delta - 1; in GetMatchesSpec1() 386 return distances; in GetMatchesSpec1() [all …]
|
D | LzFindMt.c | 240 UInt32 *distances = _distances + 1; in GetMatchesSpecN() local 268 *distances++ = maxLen = len; in GetMatchesSpecN() 269 *distances++ = delta - 1; in GetMatchesSpecN() 298 UInt32 num = (UInt32)(distances - _distances); in GetMatchesSpecN() 311 void BtGetMatches(CMatchFinderMt *p, UInt32 *distances) in BtGetMatches() argument 316 distances[1] = p->hashNumAvail; in BtGetMatches() 322 distances[1] = numProcessed + p->hashNumAvail; in BtGetMatches() 326 distances[curPos++] = 0; in BtGetMatches() 347 UInt32 *startDistances = distances + curPos; in BtGetMatches() 361 …distances + curPos, p->numHashBytes - 1, p->hashBuf + p->hashBufPos, (Int32)(limit - curPos) , siz… in BtGetMatches() [all …]
|
D | 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);
|
D | LzFindMt.h | 41 typedef UInt32 * (*Mf_Mix_Matches)(void *p, UInt32 matchMinPos, UInt32 *distances);
|
/external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
D | LzFind.c | 325 UInt32 *distances, UInt32 maxLen) in Hc_GetMatchesSpec() argument 332 return distances; in Hc_GetMatchesSpec() 344 *distances++ = maxLen = len; in Hc_GetMatchesSpec() 345 *distances++ = delta - 1; in Hc_GetMatchesSpec() 347 return distances; in Hc_GetMatchesSpec() 356 UInt32 *distances, UInt32 maxLen) in GetMatchesSpec1() argument 367 return distances; in GetMatchesSpec1() 381 *distances++ = maxLen = len; in GetMatchesSpec1() 382 *distances++ = delta - 1; in GetMatchesSpec1() 387 return distances; in GetMatchesSpec1() [all …]
|
D | 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);
|
/external/chromium_org/third_party/lzma_sdk/ |
D | LzFind.c | 324 UInt32 *distances, UInt32 maxLen) in Hc_GetMatchesSpec() argument 331 return distances; in Hc_GetMatchesSpec() 343 *distances++ = maxLen = len; in Hc_GetMatchesSpec() 344 *distances++ = delta - 1; in Hc_GetMatchesSpec() 346 return distances; in Hc_GetMatchesSpec() 355 UInt32 *distances, UInt32 maxLen) in GetMatchesSpec1() argument 366 return distances; in GetMatchesSpec1() 380 *distances++ = maxLen = len; in GetMatchesSpec1() 381 *distances++ = delta - 1; in GetMatchesSpec1() 386 return distances; in GetMatchesSpec1() [all …]
|
D | 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);
|
/external/chromium_org/content/browser/renderer_host/input/ |
D | synthetic_gesture_controller_unittest.cc | 560 params.distances.push_back(gfx::Vector2d(0, 123)); in TEST_F() 572 EXPECT_EQ(AddTouchSlopToVector(params.distances[0], target_), in TEST_F() 582 params.distances.push_back(gfx::Vector2d(-234, 0)); in TEST_F() 596 EXPECT_EQ(AddTouchSlopToVector(params.distances[0], target_).x(), in TEST_F() 598 EXPECT_LT(AddTouchSlopToVector(params.distances[0], target_).y(), in TEST_F() 600 EXPECT_GE(AddTouchSlopToVector(params.distances[0], target_).y(), in TEST_F() 630 params.distances.push_back(gfx::Vector2d(413, -83)); in TEST_F() 642 scroll_target->start_to_end_distance(), params.distances[0], target_); in TEST_F() 654 params.distances.push_back(gfx::Vector2d(21, -12)); in TEST_F() 669 scroll_target->start_to_end_distance(), params.distances[0], target_); in TEST_F() [all …]
|
D | synthetic_smooth_scroll_gesture.cc | 87 params_.distances[current_scroll_segment_]; in ForwardTouchInputEvents() 207 static_cast<int>(params_.distances.size())); in MoveTouchPoint() 216 static_cast<int>(params_.distances.size()) - 1); in ReleaseTouchPoint() 223 DCHECK_GE(params_.distances.size(), 1ul); in AddTouchSlopToFirstDistance() 224 gfx::Vector2d& first_scroll_distance = params_.distances[0]; in AddTouchSlopToFirstDistance() 235 return params_.distances[current_scroll_segment_]; in GetPositionDeltaAtTime() 241 params_.distances[current_scroll_segment_]); in GetPositionDeltaAtTime() 247 static_cast<int>(params_.distances.size())); in ComputeNextScrollSegment() 249 1e6 * (params_.distances[current_scroll_segment_].Length() / in ComputeNextScrollSegment() 270 static_cast<int>(params_.distances.size())); in IsLastScrollSegment() [all …]
|
D | touch_action_browsertest.cc | 134 params.distances.push_back(-distance); in DoTouchScroll()
|
/external/lzma/Java/SevenZip/Compression/LZ/ |
D | BinTree.java | 118 public int GetMatches(int[] distances) throws IOException in GetMatches() argument 160 distances[offset++] = maxLen = 2; in GetMatches() 161 distances[offset++] = _pos - curMatch2 - 1; in GetMatches() 168 distances[offset++] = maxLen = 3; in GetMatches() 169 distances[offset++] = _pos - curMatch3 - 1; in GetMatches() 194 distances[offset++] = maxLen = kNumHashDirectBytes; in GetMatches() 195 distances[offset++] = _pos - curMatch - 1; in GetMatches() 223 distances[offset++] = maxLen = len; in GetMatches() 224 distances[offset++] = delta - 1; in GetMatches()
|
/external/lzma/CS/7zip/Compress/LZ/ |
D | LzBinTree.cs | 118 public UInt32 GetMatches(UInt32[] distances) in GetMatches() argument 160 distances[offset++] = maxLen = 2; in GetMatches() 161 distances[offset++] = _pos - curMatch2 - 1; in GetMatches() 168 distances[offset++] = maxLen = 3; in GetMatches() 169 distances[offset++] = _pos - curMatch3 - 1; in GetMatches() 194 distances[offset++] = maxLen = kNumHashDirectBytes; in GetMatches() 195 distances[offset++] = _pos - curMatch - 1; in GetMatches() 223 distances[offset++] = maxLen = len; in GetMatches() 224 distances[offset++] = delta - 1; in GetMatches()
|
D | IMatchFinder.cs | 21 UInt32 GetMatches(UInt32[] distances); in GetMatches() argument
|
/external/chromium_org/content/common/input/ |
D | input_param_traits_unittest.cc | 44 EXPECT_EQ(a->distances.size(), b->distances.size()); in Compare() 45 for (size_t i = 0; i < a->distances.size(); i++) in Compare() 46 EXPECT_EQ(a->distances[i], b->distances[i]); in Compare() 195 gesture_params->distances.push_back(gfx::Vector2d(123, -789)); in TEST_F() 196 gesture_params->distances.push_back(gfx::Vector2d(-78, 43)); in TEST_F()
|
D | synthetic_smooth_scroll_gesture_params.cc | 23 distances(other.distances), in SyntheticSmoothScrollGestureParams()
|
D | synthetic_smooth_scroll_gesture_params.h | 28 std::vector<gfx::Vector2d> distances; // Positive X/Y to scroll left/up. member
|
/external/tcpdump/ |
D | print-egp.c | 144 int gateways, distances, networks; in egpnrprint() local 182 distances = *cp++; in egpnrprint() 189 while (--distances >= 0) { in egpnrprint()
|
/external/skia/src/pathops/ |
D | SkPathOpsCommon.cpp | 495 DistanceLessThan(double* distances) : fDistances(distances) { } in DistanceLessThan() argument 552 SkTArray<double, true> distances; in Assemble() local 553 distances.push_back_n(entries); in Assemble() 567 distances[row + iIndex] = dist; // oStart distance from iStart in Assemble() 575 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin())); in Assemble()
|
/external/chromium_org/third_party/skia/src/pathops/ |
D | SkPathOpsCommon.cpp | 495 DistanceLessThan(double* distances) : fDistances(distances) { } in DistanceLessThan() argument 552 SkTArray<double, true> distances; in Assemble() local 553 distances.push_back_n(entries); in Assemble() 567 distances[row + iIndex] = dist; // oStart distance from iStart in Assemble() 575 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin())); in Assemble()
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/heap_snapshot_worker/ |
D | HeapSnapshot.js | 1273 var distances = this._nodeDistances = new Int32Array(nodeCount); 1276 distances[i] = noDistance; 1288 if (distances[ordinal] !== noDistance) 1290 distances[ordinal] = distance; 1295 this._bfs(nodesToVisit, nodesToVisitLength, distances); 1300 this._bfs(nodesToVisit, nodesToVisitLength, distances); 1308 _bfs: function(nodesToVisit, nodesToVisitLength, distances) argument 1326 var distance = distances[nodeOrdinal] + 1; 1335 if (distances[childNodeOrdinal] !== noDistance) 1337 distances[childNodeOrdinal] = distance;
|
/external/chromium_org/third_party/brotli/src/ |
D | ots-lzma.patch | 2457 + UInt32 *distances, UInt32 maxLen) 2464 + return distances; 2476 + *distances++ = maxLen = len; 2477 + *distances++ = delta - 1; 2479 + return distances; 2488 + UInt32 *distances, UInt32 maxLen) 2499 + return distances; 2513 + *distances++ = maxLen = len; 2514 + *distances++ = delta - 1; 2519 + return distances; [all …]
|
/external/chromium_org/third_party/brotli/src/brotli/ |
D | brotlispec.txt | 192 distances. The code trees for each meta-block appear in a compact 196 (insert-and-copy lengths, literals and distances) within a meta- 242 Each type of value (insert-and-copy lengths, literals and distances) 248 the input data, and in the case of distances, the context is the copy 252 of literals and distances, the context is mapped to a context ID in 253 the rage [0, 63] for literals and [0, 3] for distances and the matrix 259 and-copy lengths, literals, distances, block types and block lengths 262 the representation of copy distances (number of "postfix bits" and 540 4. Encoding of distances 543 is a sequence of backward distances. In this section we provide the [all …]
|
/external/chromium_org/content/common/ |
D | input_messages.h | 80 IPC_STRUCT_TRAITS_MEMBER(distances)
|