Searched refs:distances (Results 1 - 25 of 30) sorted by relevance

12

/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/
H A Deditdistance.py34 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/content/common/input/
H A Dsynthetic_smooth_scroll_gesture_params.cc23 distances(other.distances),
H A Dsynthetic_smooth_scroll_gesture_params.h28 std::vector<gfx::Vector2d> distances; // Positive X/Y to scroll left/up. member in struct:content::SyntheticSmoothScrollGestureParams
H A Dinput_param_traits_unittest.cc44 EXPECT_EQ(a->distances.size(), b->distances.size());
45 for (size_t i = 0; i < a->distances.size(); i++)
46 EXPECT_EQ(a->distances[i], b->distances[i]);
195 gesture_params->distances.push_back(gfx::Vector2d(123, -789));
196 gesture_params->distances.push_back(gfx::Vector2d(-78, 43));
/external/chromium_org/content/browser/renderer_host/input/
H A Dsynthetic_smooth_scroll_gesture.cc87 params_.distances[current_scroll_segment_];
207 static_cast<int>(params_.distances.size()));
216 static_cast<int>(params_.distances.size()) - 1);
223 DCHECK_GE(params_.distances.size(), 1ul);
224 gfx::Vector2d& first_scroll_distance = params_.distances[0];
235 return params_.distances[current_scroll_segment_];
241 params_.distances[current_scroll_segment_]);
247 static_cast<int>(params_.distances.size()));
249 1e6 * (params_.distances[current_scroll_segment_].Length() /
270 static_cast<int>(params_.distances
[all...]
H A Dsynthetic_gesture_controller_unittest.cc560 params.distances.push_back(gfx::Vector2d(0, 123));
572 EXPECT_EQ(AddTouchSlopToVector(params.distances[0], target_),
582 params.distances.push_back(gfx::Vector2d(-234, 0));
594 //EXPECT_EQ(AddTouchSlopToVector(params.distances[0], target_),
596 EXPECT_EQ(AddTouchSlopToVector(params.distances[0], target_).x(),
598 EXPECT_LT(AddTouchSlopToVector(params.distances[0], target_).y(),
600 EXPECT_GE(AddTouchSlopToVector(params.distances[0], target_).y(),
630 params.distances.push_back(gfx::Vector2d(413, -83));
642 scroll_target->start_to_end_distance(), params.distances[0], target_);
654 params.distances
[all...]
H A Dtouch_action_browsertest.cc134 params.distances.push_back(-distance);
/external/chromium_org/third_party/lzma_sdk/
H A DLzFind.h78 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);
H A DLzFind.c324 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;
322 Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *distances, UInt32 maxLen) argument
353 GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *distances, UInt32 maxLen) argument
484 Bt2_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
495 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
506 Bt3_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
539 Bt4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
586 Hc4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
635 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
[all...]
/external/chromium_org/third_party/ots/third_party/lzma_sdk/
H A DLzFind.h79 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);
H A DLzFind.c325 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;
323 Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *distances, UInt32 maxLen) argument
354 GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *distances, UInt32 maxLen) argument
485 Bt2_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
496 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
507 Bt3_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
540 Bt4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
587 Hc4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
636 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
[all...]
/external/lzma/C/
H A DLzFind.h78 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);
H A DLzFind.c324 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;
322 Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *distances, UInt32 maxLen) argument
353 GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *distances, UInt32 maxLen) argument
484 Bt2_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
495 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
506 Bt3_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
539 Bt4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
586 Hc4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
635 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) argument
[all...]
H A DLzFindMt.c240 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) argument
316 distances[1] = p->hashNumAvail;
322 distances[1] = numProcessed + p->hashNumAvail;
326 distances[curPos++] = 0;
347 UInt32 *startDistances = distances + curPos;
361 distances
557 MixMatches2(CMatchFinderMt *p, UInt32 matchMinPos, UInt32 *distances) argument
577 MixMatches3(CMatchFinderMt *p, UInt32 matchMinPos, UInt32 *distances) argument
667 MatchFinderMt2_GetMatches(CMatchFinderMt *p, UInt32 *distances) argument
685 MatchFinderMt_GetMatches(CMatchFinderMt *p, UInt32 *distances) argument
[all...]
H A DLzFindMt.h41 typedef UInt32 * (*Mf_Mix_Matches)(void *p, UInt32 matchMinPos, UInt32 *distances);
/external/lzma/CS/7zip/Compress/LZ/
H A DIMatchFinder.cs21 UInt32 GetMatches(UInt32[] distances); argument
H A DLzBinTree.cs118 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 DBinTree.java118 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/tcpdump/
H A Dprint-egp.c144 int gateways, distances, networks; local
182 distances = *cp++;
189 while (--distances >= 0) {
/external/chromium_org/content/common/
H A Dinput_messages.h80 IPC_STRUCT_TRAITS_MEMBER(distances)
/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsCommon.cpp495 DistanceLessThan(double* distances) : fDistances(distances) { } argument
552 SkTArray<double, true> distances; local
553 distances.push_back_n(entries);
567 distances[row + iIndex] = dist; // oStart distance from iStart
575 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin()));
/external/skia/src/pathops/
H A DSkPathOpsCommon.cpp495 DistanceLessThan(double* distances) : fDistances(distances) { } argument
552 SkTArray<double, true> distances; local
553 distances.push_back_n(entries);
567 distances[row + iIndex] = dist; // oStart distance from iStart
575 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin()));
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/heap_snapshot_worker/
H A DHeapSnapshot.js937 this._progress.updateStatus("Calculating distances\u2026");
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);
1306 * @param {!Int32Array} distances
1308 _bfs: function(nodesToVisit, nodesToVisitLength, distances)
1326 var distance = distances[nodeOrdina
[all...]
/external/chromium_org/content/renderer/gpu/
H A Dgpu_benchmarking_extension.cc543 gesture_params->distances.push_back(distance);
635 gesture_params->distances.push_back(distance);
636 gesture_params->distances.push_back(-distance + overscroll);
/external/blktrace/btt/doc/
H A Dbtt.tex234 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 --
836 seek distances based solely upon the ending block address of one IO,
839 section~\ref{sec:seek} for more details about seek distances.

Completed in 600 milliseconds

12