min 277 core/Date.cpp if (MathUtils::isInfinite(hour) || MathUtils::isInfinite(min) || MathUtils::isInfinite(sec) || MathUtils::isInfinite(ms) ||
min 278 core/Date.cpp hour != hour || min != min || sec != sec || ms != ms)
min 282 core/Date.cpp min = MathUtils::toInt(min);
min 286 core/Date.cpp return hour * (double)kMsecPerHour + min * (double)kMsecPerMinute + sec * (double)kMsecPerSecond + ms;
min 326 core/Date.cpp MakeTime(hours, min, sec, msec));
min 442 core/Date.cpp int min = (int)MinFromTime(time);
min 473 core/Date.cpp min,
min 488 core/Date.cpp min,
min 499 core/Date.cpp min,
min 559 core/Date.cpp min,
min 569 core/Date.cpp min,
min 650 core/Date.cpp if (MathUtils::isNaN(min)) {
min 651 core/Date.cpp min = MinFromTime(t);
min 661 core/Date.cpp min,
min 107 core/Date.h double min,
min 119 core/Date.h double min,
min 268 core/DateClass.cpp else if (min < 0)
min 269 core/DateClass.cpp min = numVal;
min 281 core/DateClass.cpp else if (hour >= 0 && min < 0)
min 283 core/DateClass.cpp min = numVal;
min 285 core/DateClass.cpp else if (min >= 0 && sec < 0)
min 311 core/DateClass.cpp int min = -1;
min 349 core/DateClass.cpp min,sec) == false)
min 378 core/DateClass.cpp if (min < 0)
min 379 core/DateClass.cpp min = 0;
min 387 core/DateClass.cpp min,
min 400 core/DateClass.cpp min,
min 93 core/MathClass.h double min(double x, double y, const Atom* argv, uint32_t argc);
min 109 core/MathUtils.h static double min(double x, double y) { return (x < y) ? x : y; }
min 1482 core/builtin.cpp double const ret = obj->min(
min 187 eval/eval-util.cpp uint32_t k = min(need, avail);
min 42 other-licenses/zlib/inftrees.c unsigned min, max; /* minimum and maximum code lengths */
min 126 other-licenses/zlib/inftrees.c for (min = 1; min <= MAXBITS; min++)
min 127 other-licenses/zlib/inftrees.c if (count[min] != 0) break;
min 128 other-licenses/zlib/inftrees.c if (root < min) root = min;
min 203 other-licenses/zlib/inftrees.c len = min; /* starting code length */
min 235 other-licenses/zlib/inftrees.c min = fill; /* save offset to next table */
min 266 other-licenses/zlib/inftrees.c next += min; /* here min is 1 << curr */
min 942 pcre/pcre_compile.cpp int min = 0;
min 948 pcre/pcre_compile.cpp while ((digitab[*p] & ctype_digit) != 0) min = min * 10 + *p++ - '0';
min 949 pcre/pcre_compile.cpp if (min < 0 || min > 65535)
min 958 pcre/pcre_compile.cpp if (*p == '}') max = min; else
min 969 pcre/pcre_compile.cpp if (max < min)
min 980 pcre/pcre_compile.cpp *minp = min;
min 556 pcre/pcre_exec.cpp int min;
min 1849 pcre/pcre_exec.cpp min = rep_min[c]; /* Pick up values from tables; */
min 1857 pcre/pcre_exec.cpp min = GET2(ecode, 1);
min 1878 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 1887 pcre/pcre_exec.cpp if (min == max) continue;
min 1893 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 1909 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 1954 pcre/pcre_exec.cpp min = rep_min[c]; /* Pick up values from tables; */
min 1962 pcre/pcre_exec.cpp min = GET2(ecode, 1);
min 1969 pcre/pcre_exec.cpp min = max = 1;
min 1979 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 1997 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2008 pcre/pcre_exec.cpp if (min == max) continue;
min 2019 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2039 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2061 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2088 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2128 pcre/pcre_exec.cpp min = rep_min[c]; /* Pick up values from tables; */
min 2136 pcre/pcre_exec.cpp min = GET2(ecode, 1);
min 2143 pcre/pcre_exec.cpp min = max = 1;
min 2149 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2159 pcre/pcre_exec.cpp if (min == max) continue;
min 2166 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2182 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2281 pcre/pcre_exec.cpp min = max = GET2(ecode, 1);
min 2291 pcre/pcre_exec.cpp min = 0;
min 2299 pcre/pcre_exec.cpp min = 0;
min 2306 pcre/pcre_exec.cpp min = 1;
min 2313 pcre/pcre_exec.cpp min = 0;
min 2326 pcre/pcre_exec.cpp min = rep_min[c]; /* Pick up values from tables; */
min 2341 pcre/pcre_exec.cpp if (min * length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
min 2357 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2373 pcre/pcre_exec.cpp if (min == max) continue;
min 2377 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2401 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2443 pcre/pcre_exec.cpp if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
min 2456 pcre/pcre_exec.cpp DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
min 2462 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2464 pcre/pcre_exec.cpp if (min == max) continue;
min 2467 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2480 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2501 pcre/pcre_exec.cpp for (i = 1; i <= min; i++) if (fc != *eptr++) RRETURN(MATCH_NOMATCH);
min 2502 pcre/pcre_exec.cpp if (min == max) continue;
min 2505 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2517 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2563 pcre/pcre_exec.cpp min = max = GET2(ecode, 1);
min 2569 pcre/pcre_exec.cpp min = 0;
min 2577 pcre/pcre_exec.cpp min = 0;
min 2584 pcre/pcre_exec.cpp min = 1;
min 2591 pcre/pcre_exec.cpp min = 0;
min 2598 pcre/pcre_exec.cpp min = 0;
min 2611 pcre/pcre_exec.cpp min = rep_min[c]; /* Pick up values from tables; */
min 2620 pcre/pcre_exec.cpp if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
min 2631 pcre/pcre_exec.cpp DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
min 2643 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2655 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2659 pcre/pcre_exec.cpp if (min == max) continue;
min 2668 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2682 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2704 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2726 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2754 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2764 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2768 pcre/pcre_exec.cpp if (min == max) continue;
min 2777 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2790 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 2812 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2833 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 2857 pcre/pcre_exec.cpp min = max = GET2(ecode, 1);
min 2864 pcre/pcre_exec.cpp min = 0;
min 2872 pcre/pcre_exec.cpp min = 0;
min 2879 pcre/pcre_exec.cpp min = 1;
min 2886 pcre/pcre_exec.cpp min = 0;
min 2893 pcre/pcre_exec.cpp min = 0;
min 2906 pcre/pcre_exec.cpp min = rep_min[c]; /* Pick up values from tables; */
min 2935 pcre/pcre_exec.cpp if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
min 2936 pcre/pcre_exec.cpp if (min > 0)
min 2945 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2953 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2966 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2977 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 2988 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3008 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3036 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3047 pcre/pcre_exec.cpp eptr += min;
min 3051 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3073 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3105 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3137 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3157 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3177 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3187 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3197 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3220 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3244 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3254 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3279 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3285 pcre/pcre_exec.cpp else eptr += min;
min 3289 pcre/pcre_exec.cpp eptr += min;
min 3296 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3315 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3330 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3345 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3362 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3379 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3384 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3389 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3394 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3399 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3405 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
min 3417 pcre/pcre_exec.cpp if (min == max) continue;
min 3431 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 3442 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 3457 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 3470 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 3483 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 3505 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 3534 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 3706 pcre/pcre_exec.cpp for (fi = min;; fi++)
min 3848 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 3859 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 3874 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 3887 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 3900 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 3930 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 3987 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 3996 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4011 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4028 pcre/pcre_exec.cpp c = max - min;
min 4035 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4057 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4095 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4120 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4131 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4142 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4161 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4181 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4192 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4227 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4237 pcre/pcre_exec.cpp c = max - min;
min 4244 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4263 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4273 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4283 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4294 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4305 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4314 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4323 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4332 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4341 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 4350 pcre/pcre_exec.cpp for (i = min; i < max; i++)
min 625 pcre/pcretest.cpp int min = 0;
min 641 pcre/pcretest.cpp min = mid;
min 642 pcre/pcretest.cpp mid = (mid == max - 1)? max : (max > 0)? (min + max)/2 : mid*2;
min 648 pcre/pcretest.cpp if (mid == min + 1)
min 655 pcre/pcretest.cpp mid = (min + mid)/2;
min 151 vprof/vprof.cpp f(((double)e->sum)/((double)e->count)), (long long int)e->min, (long long int)e->max, (long long int)e->sum, (long long int)e->count);
min 191 vprof/vprof.cpp e->min = MIN (e->min, value);
min 234 vprof/vprof.cpp e->min = value;
min 261 vprof/vprof.cpp e->min = MIN (e->min, value);
min 288 vprof/vprof.cpp e->min = MIN (e->min, value);
min 325 vprof/vprof.cpp e->min = value;
min 370 vprof/vprof.cpp e->min = MIN (e->min, value);
min 231 vprof/vprof.h int64_t min;
min 251 vprof/vprof.h #define _MIN ((entry_t)vprofID)->min