Searched refs:dist (Results 1 - 10 of 10) sorted by relevance

/ast/src/lib/libvcodex/
H A Dvcperiod.c36 Vcsfxint_t *dist, *peak, *lcp; local
62 /* dist[k] counts number of matches at distance k */
63 dist = sfx->inv; memset(dist, 0, sz*sizeof(Vcsfxint_t));
79 dist[m] += 1;
81 dist[n] += 1;
89 m += dist[i];
93 { if(dist[i] > 2*(m - dist[i]) )
95 m = m - dist[
[all...]
/ast/src/lib/libz/
H A Dinffast.c95 unsigned dist; /* match distance */ local
166 dist = (unsigned)(this.val);
176 dist += (unsigned)hold & ((1U << op) - 1);
178 if (dist > dmax) {
186 Tracevv((stderr, "inflate: distance %u\n", dist));
188 if (dist > op) { /* see if copy from window */
189 op = dist - op; /* distance back in window */
203 from = out - dist; /* rest from output */
221 from = out - dist; /* rest from output */
232 from = out - dist; /* res
[all...]
H A Ddeflate.h283 int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
290 #define d_code(dist) \
291 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
292 /* Mapping from a distance to a distance code. dist is the distance - 1 and
317 ush dist = (distance); \
318 s->d_buf[s->last_lit] = dist; \
320 dist--; \
322 s->dyn_dtree[d_code(dist)]
[all...]
H A Dtrees.c246 int dist; /* distance index */ local
274 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
275 dist = 0;
277 base_dist[code] = dist;
279 _dist_code[dist++] = (uch)code;
282 Assert (dist == 256, "tr_static_init: dist != 256");
283 dist >>= 7; /* from now on, all distances are divided by 128 */
285 base_dist[code] = dist <<
1077 unsigned dist; /* distance of matched string */ local
[all...]
H A Dinflate.c328 unsigned copy, dist; local
355 dist = state->wsize - state->write;
356 if (dist > copy) dist = copy;
357 zmemcpy(state->window + state->write, strm->next_out - copy, dist);
358 copy -= dist;
365 state->write += dist;
367 if (state->whave < state->wsize) state->whave += dist;
/ast/src/lib/libtk/generic/
H A DtkCanvLine.c822 double bestDist, dist;
870 dist = hypot(coordPtr[0] - pointPtr[0], coordPtr[1] - pointPtr[1])
872 if (dist <= 0.0) {
875 } else if (dist < bestDist) {
876 bestDist = dist;
908 dist = TkPolygonToPoint(poly, 5, pointPtr);
909 if (dist <= 0.0) {
912 } else if (dist < bestDist) {
913 bestDist = dist;
934 dist
815 double bestDist, dist; local
[all...]
H A DtkCanvArc.c760 double vertex[2], pointAngle, diff, dist, newDist;
804 dist = hypot(pointPtr[0] - arcPtr->center1[0],
808 if (newDist < dist) {
811 return dist;
827 dist = TkPolygonToPoint(arcPtr->outlinePtr, PIE_OUTLINE1_PTS,
832 dist = TkLineToPoint(vertex, arcPtr->center1, pointPtr);
835 if (newDist < dist) {
836 dist = newDist;
840 if (newDist < dist) {
841 dist
753 double vertex[2], pointAngle, diff, dist, newDist; local
[all...]
H A DtkTrig.c474 double x, y, dist;
565 dist = hypot(pointPtr[0] - x, pointPtr[1] - y);
566 if (dist < bestDist) {
567 bestDist = dist;
1335 double dist; /* Distance of miter points from p2. */
1337 * dist (fudge factors for bounding
1364 dist = 0.5*width/sin(0.5*theta);
1365 if (dist < 0.0) {
1366 dist = -dist;
470 double x, y, dist; local
1322 double dist; /* Distance of miter points from p2. */ local
[all...]
H A DtkCanvText.c1079 double xDiff, yDiff, dist, minDist;
1125 dist = hypot(xDiff, yDiff);
1126 if ((dist < minDist) || (minDist < 0.0)) {
1127 minDist = dist;
1070 double xDiff, yDiff, dist, minDist; local
/ast/src/cmd/INIT/
H A Dratz.c1493 int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
1500 #define d_code(dist) \
1501 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
1502 /* Mapping from a distance to a distance code. dist is the distance - 1 and
1527 ush dist = (distance); \
1528 s->d_buf[s->last_lit] = dist; \
1530 dist--; \
1532 s->dyn_dtree[d_code(dist)]
2091 unsigned dist; /* match distance */ local
2547 unsigned copy, dist; local
[all...]

Completed in 49 milliseconds