Home
last modified time | relevance | path

Searched refs:distances (Results 1 – 25 of 44) sorted by relevance

12

/external/lzma/C/
DLzFind.c326 UInt32 *distances, UInt32 maxLen) in Hc_GetMatchesSpec() argument
333 return distances; in Hc_GetMatchesSpec()
345 *distances++ = maxLen = len; in Hc_GetMatchesSpec()
346 *distances++ = delta - 1; in Hc_GetMatchesSpec()
348 return distances; in Hc_GetMatchesSpec()
357 UInt32 *distances, UInt32 maxLen) in GetMatchesSpec1() argument
368 return distances; in GetMatchesSpec1()
382 *distances++ = maxLen = len; in GetMatchesSpec1()
383 *distances++ = delta - 1; in GetMatchesSpec1()
388 return distances; in GetMatchesSpec1()
[all …]
DLzFindMt.c242 UInt32 *distances = _distances + 1; in GetMatchesSpecN() local
270 *distances++ = maxLen = len; in GetMatchesSpecN()
271 *distances++ = delta - 1; in GetMatchesSpecN()
300 UInt32 num = (UInt32)(distances - _distances); in GetMatchesSpecN()
313 void BtGetMatches(CMatchFinderMt *p, UInt32 *distances) in BtGetMatches() argument
318 distances[1] = p->hashNumAvail; in BtGetMatches()
324 distances[1] = numProcessed + p->hashNumAvail; in BtGetMatches()
328 distances[curPos++] = 0; in BtGetMatches()
349 UInt32 *startDistances = distances + curPos; in BtGetMatches()
363 …distances + curPos, p->numHashBytes - 1, p->hashBuf + p->hashBufPos, (Int32)(limit - curPos) , siz… in BtGetMatches()
[all …]
DLzFind.h76 UInt32 *distances, UInt32 maxLen);
88 typedef UInt32 (*Mf_GetMatches_Func)(void *object, UInt32 *distances);
104 UInt32 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
105 UInt32 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
DLzFindMt.h39 typedef UInt32 * (*Mf_Mix_Matches)(void *p, UInt32 matchMinPos, UInt32 *distances);
/external/lzma/Java/SevenZip/Compression/LZ/
DBinTree.java118 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/
DLzBinTree.cs118 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()
DIMatchFinder.cs21 UInt32 GetMatches(UInt32[] distances); in GetMatches() argument
/external/opencv3/modules/calib3d/src/
Dp3p.cpp118 double distances[3]; in solve() local
119 distances[0] = sqrt( (X1 - X2) * (X1 - X2) + (Y1 - Y2) * (Y1 - Y2) + (Z1 - Z2) * (Z1 - Z2) ); in solve()
120 distances[1] = sqrt( (X0 - X2) * (X0 - X2) + (Y0 - Y2) * (Y0 - Y2) + (Z0 - Z2) * (Z0 - Z2) ); in solve()
121 distances[2] = sqrt( (X0 - X1) * (X0 - X1) + (Y0 - Y1) * (Y0 - Y1) + (Z0 - Z1) * (Z0 - Z1) ); in solve()
130 int n = solve_for_lengths(lengths, distances, cosines); in solve()
169 int p3p::solve_for_lengths(double lengths[4][3], double distances[3], double cosines[3]) in solve_for_lengths()
175 double inv_d22 = 1. / (distances[2] * distances[2]); in solve_for_lengths()
176 double a = inv_d22 * (distances[0] * distances[0]); in solve_for_lengths()
177 double b = inv_d22 * (distances[1] * distances[1]); in solve_for_lengths()
247 double Z = distances[2] / sqrt(v); in solve_for_lengths()
Dp3p.h48 int solve_for_lengths(double lengths[4][3], double distances[3], double cosines[3]);
/external/skia/src/pathops/
DSkPathOpsCommon.cpp184 DistanceLessThan(double* distances) : fDistances(distances) { } in DistanceLessThan() argument
247 SkTDArray<double> distances; in Assemble() local
248 distances.append(entries); in Assemble()
260 distances[row + iIndex] = dist; // oStart distance from iStart in Assemble()
268 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin())); in Assemble()
/external/tcpdump/
Dprint-egp.c137 int gateways, distances, networks; in egpnrprint() local
175 distances = *cp++; in egpnrprint()
182 while (--distances >= 0) { in egpnrprint()
/external/opencv3/modules/core/src/
Dkmeans.cpp169 : distances(_distances), in KMeansDistanceComputer()
201 distances[i] = min_dist; in operator ()()
209 double *distances; member in cv::KMeansDistanceComputer
/external/opencv3/doc/py_tutorials/py_ml/py_kmeans/py_kmeans_understanding/
Dpy_kmeans_understanding.markdown63 specific accuracy is reached etc.)* **These points are such that sum of distances between test data
64 and their corresponding centroids are minimum**. Or simply, sum of distances between
/external/chromium-trace/catapult/third_party/polymer/components/webcomponentsjs/
DShadowDOM.js340 var distances = new Array(rowCount);
342 distances[i] = new Array(columnCount);
343 distances[i][0] = i;
345 for (var j = 0; j < columnCount; j++) distances[0][j] = j;
348 ….equals(current[currentStart + j - 1], old[oldStart + i - 1])) distances[i][j] = distances[i - 1][…
349 var north = distances[i - 1][j] + 1;
350 var west = distances[i][j - 1] + 1;
351 distances[i][j] = north < west ? north : west;
355 return distances;
357 spliceOperationsFromEditDistances: function(distances) { argument
[all …]
Dwebcomponents.js381 var distances = new Array(rowCount);
383 distances[i] = new Array(columnCount);
384 distances[i][0] = i;
386 for (var j = 0; j < columnCount; j++) distances[0][j] = j;
389 ….equals(current[currentStart + j - 1], old[oldStart + i - 1])) distances[i][j] = distances[i - 1][…
390 var north = distances[i - 1][j] + 1;
391 var west = distances[i][j - 1] + 1;
392 distances[i][j] = north < west ? north : west;
396 return distances;
398 spliceOperationsFromEditDistances: function(distances) { argument
[all …]
/external/chromium-trace/catapult/tracing/third_party/components/webcomponentsjs/
DShadowDOM.js340 var distances = new Array(rowCount);
342 distances[i] = new Array(columnCount);
343 distances[i][0] = i;
345 for (var j = 0; j < columnCount; j++) distances[0][j] = j;
348 ….equals(current[currentStart + j - 1], old[oldStart + i - 1])) distances[i][j] = distances[i - 1][…
349 var north = distances[i - 1][j] + 1;
350 var west = distances[i][j - 1] + 1;
351 distances[i][j] = north < west ? north : west;
355 return distances;
357 spliceOperationsFromEditDistances: function(distances) { argument
[all …]
Dwebcomponents.js381 var distances = new Array(rowCount);
383 distances[i] = new Array(columnCount);
384 distances[i][0] = i;
386 for (var j = 0; j < columnCount; j++) distances[0][j] = j;
389 ….equals(current[currentStart + j - 1], old[oldStart + i - 1])) distances[i][j] = distances[i - 1][…
390 var north = distances[i - 1][j] + 1;
391 var west = distances[i][j - 1] + 1;
392 distances[i][j] = north < west ? north : west;
396 return distances;
398 spliceOperationsFromEditDistances: function(distances) { argument
[all …]
/external/autotest/client/site_tests/firmware_TouchMTB/
Dmtb.py847 distances = []
850 distances.append(distance)
851 return distances
985 distances = map(abs, displacements)
990 if self._is_large(distances, i)]
/external/mesa3d/src/gallium/docs/source/
Dpipeline.txt43 | (consume clip distances) |
/external/opencv3/doc/tutorials/ml/non_linear_svms/
Dnon_linear_svms.markdown58 separating hyperplane and the distances to their correct regions of the samples that are
63 @note Only the distances of the samples that are misclassified are shown in the picture. The
64 distances of the rest of the samples are zero since they lay already in their correct decision
/external/cros/system_api/dbus/power_manager/
Dpolicy.proto119 // presentation mode. Other delays' distances from |screen_dim_ms| are
128 // Other delays' distances from |screen_dim_ms| are preserved after
/external/opencv3/doc/tutorials/features2d/feature_flann_matcher/
Dfeature_flann_matcher.markdown76 //-- Quick calculation of max and min distances between keypoints
/external/mesa3d/src/gallium/docs/source/cso/
Drasterizer.rst253 shader clip distances cannot be mixed, and clip distances take precedence.
/external/opencv3/doc/tutorials/features2d/feature_homography/
Dfeature_homography.markdown64 //-- Quick calculation of max and min distances between keypoints
/external/opencv3/doc/tutorials/imgproc/
Dtable_of_content_imgproc.markdown212 Where we learn how to calculate distances from the image to contours

12