| /macosx-10.10/ntp-92/util/ |
| H A D | jitter.c | 27 double average; variable
57 average = 0;
61 average += gtod[i];
76 average = average / (NBUF - 2);
77 fprintf(stderr, "Average %13.9f\n", average);
|
| /macosx-10.10/postfix-255/postfix/src/postscreen/ |
| H A D | postscreen_dict.c | 103 #define PSC_CHECK_TIME_AFTER_LOOKUP(table, action, average) \
107 if ((average = PSC_AVERAGE(_new_delta_ms, average)) > PSC_THRESHOLD_MS \
109 msg_warn("%s: %s %s average delay is %.0f ms", \
110 myname, (table), (action), average); \
|
| /macosx-10.10/WebInspectorUI-7600.1.17/UserInterface/Views/ |
| H A D | LegacyJavaScriptProfileView.css | 34 .profile-view .data-grid th.average-column {
38 .profile-view .data-grid td.average-column {
|
| /macosx-10.10/tcl-105/tcl/tcl/generic/ |
| H A D | tclHash.c | 26 * When there are this many entries per bucket, on average, rebuild the hash
632 double average, tmp;
656 average = 0.0;
669 average += (tmp+1.0)*(tmp/tablePtr->numEntries)/2.0;
693 sprintf(p, "average search distance for entry: %.1f", average);
623 double average, tmp; local
|
| H A D | tclLiteral.c | 23 * When there are this many entries per bucket, on average, rebuild a
1030 double average, tmp;
1043 average = 0.0;
1056 average += (tmp+1.0)*(tmp/tablePtr->numEntries)/2.0;
1075 sprintf(p, "average search distance for entry: %.1f", average);
1016 double average, tmp; local
|
| /macosx-10.10/tcl-105/tcl84/tcl/generic/ |
| H A D | tclHash.c | 28 * When there are this many entries per bucket, on average, rebuild
757 double average, tmp;
769 average = 0.0;
781 average += (tmp+1.0)*(tmp/tablePtr->numEntries)/2.0;
800 sprintf(p, "average search distance for entry: %.1f", average);
748 double average, tmp; local
|
| H A D | tclLiteral.c | 22 * When there are this many entries per bucket, on average, rebuild
912 double average, tmp;
925 average = 0.0;
938 average += (tmp+1.0)*(tmp/tablePtr->numEntries)/2.0;
957 sprintf(p, "average search distance for entry: %.1f", average);
900 double average, tmp; local
|
| /macosx-10.10/CPANInternal-159.1/Data-UUID-1.219/ |
| H A D | UUID.pm | 33 interface may be just a little more straightforward for the average Perl
|
| /macosx-10.10/ICU-531.30/icuSources/test/perf/collationperf/ |
| H A D | CollPerf.pl | 199 <td>The average length of the generated sort keys, in bytes per character
|
| /macosx-10.10/vim-55/runtime/syntax/ |
| H A D | specman.vim | 36 syn keyword specmanMethod apply average count delete exists first_index get_indices
|
| H A D | pov.vim | 38 syn keyword povDescriptors agate average brick boxed bozo bumps cells checker crackle cylindrical dents facets function gradient granite hexagon julia leopard magnet mandel marble onion planar quilted radial ripples slope spherical spiral1 spiral2 spotted tiles tiles2 toroidal waves wood wrinkles
|
| H A D | winbatch.vim | 56 syn keyword winbatchImplicit atan average beep binaryalloc binarycopy binaryeodget binaryeodset
|
| H A D | tcsh.vim | 98 \ list-or-eof load-average magic-space newline normalize-path
|
| /macosx-10.10/tcl-105/tcl_ext/incrtcl/iwidgets/generic/ |
| H A D | datefield.itk | 222 # Valid settings include high, average, and low. With a high iq,
227 # With average iq, the month is limited to the values of 01-12, but
230 # date entry. With both average and low iq levels, it is assumed
236 high - average - low {
240 should be high, average or low"
|
| /macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/jpeg/ |
| H A D | jpeg.tcl | 1013 MeteringMode,1 average
1014 MeteringMode,2 "center weighted average"
|
| /macosx-10.10/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
| H A D | tommath.tex | 208 trivially factored\footnote{A Pollard-Rho factoring would take only $2^{16}$ time.} on the average desktop computer,
241 integers required even if the host platform cannot natively accomodate them\footnote{For example, the average smartcard
476 which allows the reader to find a given function very quickly. On average there are $76$ lines of code per source
506 exponentiation. In the grand scheme of ``bignum'' libraries LibTomMath is faster than the average library and usually
3816 performed at most twice, and on average once. However, if $a \ge b^2$ than it will iterate substantially more times than it should.
4730 $a^{2^{i+1}}$. This observation forms the basis of essentially all fast exponentiation algorithms. It requires $k$ squarings and on average
4872 original algorithm would on average have required $200$ multiplications and $400$ squrings to compute the same value. The total number of squarings
|
| /macosx-10.10/tcl-105/tcl_ext/tkimg/tkimg/compat/libjpeg/ |
| H A D | configure | 5135 double average;
5212 .average = 543.34343,
|
| /macosx-10.10/ntp-92/sntp/ |
| H A D | configure | 4299 double average;
4376 .average = 543.34343,
|
| /macosx-10.10/rsync-45/rsync/ |
| H A D | configure | 3444 double average;
3521 .average = 543.34343,
|
| /macosx-10.10/tcl-105/tcl_ext/tkimg/tkimg/compat/libtiff/ |
| H A D | configure | 4425 double average;
4502 .average = 543.34343,
|
| /macosx-10.10/tcl-105/tcl_ext/tkimg/tkimg/libtiff/ |
| H A D | configure.lineno | 4425 double average;
4502 .average = 543.34343,
|
| /macosx-10.10/apache-793/httpd/ |
| H A D | configure | 5917 double average;
5994 .average = 543.34343,
|
| H A D | configure.orig | 5917 double average;
5994 .average = 543.34343,
|
| /macosx-10.10/gnutar-453/gnutar/ |
| H A D | configure | 4979 double average;
5057 .average = 543.34343,
[all...] |