HomeSort by relevance Sort by last modified time
    Searched full:numbers (Results 76 - 100 of 2152) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/v8/test/mjsunit/
unicode-string-to-number.js 29 // characters when converting to numbers.
33 // Check that long string can convert to proper numbers.
  /external/bluetooth/glib/docs/reference/glib/tmpl/
random_numbers.sgml 2 Random Numbers
21 internally. Whenever you need a stream of reproducible random numbers, you
24 with a certain seed will produce exactly the same series of random numbers
30 equally distributed random numbers, whereas for example the
32 yield equally distributed numbers.
49 GLib-2.0 algorithms only if you have sequences of numbers generated
  /packages/apps/Contacts/tests/src/com/android/contacts/
RecentCallsListActivityTests.java 110 * unknown numbers.
236 // HELPERS to insert numbers in the call log DB.
240 * Insert a certain number of random numbers in the DB. Makes sure
261 * @param number The phone number. For unknown and private numbers,
319 * Insert a range [start, end) of random numbers in the DB. For
321 * marked as PRIVATE or UNKNOWN or VOICEMAIL. For regular numbers, a number is
329 * the numbers are random some tests may want to enforce the
330 * insertion of such numbers.
332 // TODO: Should insert numbers with contact entries too.
GroupingListAdapterTests.java 112 private void buildCursor(String... numbers) {
115 for (String number : numbers) {
293 String[] numbers = new String[500]; local
294 for (int i = 0; i < numbers.length; i++) {
297 numbers[i] = String.valueOf((i / 2) * 2);
300 buildCursor(numbers);
  /external/ppp/pppd/include/net/
slcompress.h 36 * numbers have changed (bottom 5 bits). The next octet is a
44 * There are 5 numbers which can change (they are always inserted
50 * use a variable length coding with one octet for numbers in the
51 * range 1 - 255 and 3 octets (0, MSB, LSB) for numbers in the
69 * and in the interest of conserving bits, numbers are chosen so the
vjcompress.h 36 * numbers have changed (bottom 5 bits). The next octet is a
44 * There are 5 numbers which can change (they are always inserted
50 * use a variable length coding with one octet for numbers in the
51 * range 1 - 255 and 3 octets (0, MSB, LSB) for numbers in the
69 * and in the interest of conserving bits, numbers are chosen so the
  /external/stlport/test/unit/
equal_test.cpp 43 int numbers[10] = { 0, 0, 1, 1, 2, 2, 2, 2, 3, 3 }; local
44 pair<int*, int*> range = equal_range((int*)numbers, (int*)numbers + 10, 2);
45 CPPUNIT_ASSERT( (range.first - numbers) == 4 );
46 CPPUNIT_ASSERT( (range.second - numbers) == 8 );
adj_test.cpp 87 int numbers[5] = { 1, 2, 4, 8, 16 }; local
89 adjacent_difference(numbers, numbers + 5, (int*)difference);
  /external/bison/src/
derives.c 33 /* Linked list of rule numbers. */
71 /* DSET[NTERM - NTOKENS] -- A linked list of the numbers of the rules
77 indexed by rule numbers. */
gram.h 33 Numbers 0 to NTOKENS - 1 are for tokens, and NTOKENS to NSYMS - 1
38 The rules receive rule numbers 1 to NRULES in the order they are
42 presented to the user, we subtract 1, so *displayed* rule numbers
46 instance RITEM stores both symbol (the RHS) and rule numbers: the
83 The right hand side is stored as symbol numbers in a portion of
95 Item numbers are used in the finite state machine to represent
147 /* Rule numbers. */
251 /* Print the grammar's rules numbers from BEGIN (inclusive) to END
tables.h 28 YYTRANSLATE = vector mapping yylex's token numbers into bison's
29 token numbers.
33 YYTOKNUM = vector of yylex token numbers corresponding to entries
36 YYRLINE = vector of line-numbers of all rules. For yydebug
  /external/icu4c/i18n/unicode/
numsys.h 36 * numbers are to be presented to the end user. In its simplest form, a numbering
38 * numbers, such as Western digits, Thai digits, Arabic-Indic digits, etc.
46 * numbers locale keyword.
  /external/webkit/WebCore/svg/
SVGComponentTransferFunctionElement.cpp 118 SVGNumberList* numbers = tableValues(); local
121 unsigned int nr = numbers->numberOfItems();
123 func.tableValues.append(numbers->getItem(i, ec));
  /external/strace/linux/
syscall.h 161 * IA64 syscall numbers (the only ones available from standard header
162 * files) are disjoint from IA32 syscall numbers. We need to define
216 * IA64 syscall numbers (the only ones available from standard
217 * header files) are disjoint from IA32 syscall numbers. We need
263 * IA64 syscall numbers (the only ones available from standard header
264 * files) are disjoint from IA32 syscall numbers. We need to define
  /external/strace/strace/linux/
syscall.h 161 * IA64 syscall numbers (the only ones available from standard header
162 * files) are disjoint from IA32 syscall numbers. We need to define
216 * IA64 syscall numbers (the only ones available from standard
217 * header files) are disjoint from IA32 syscall numbers. We need
263 * IA64 syscall numbers (the only ones available from standard header
264 * files) are disjoint from IA32 syscall numbers. We need to define
  /external/gtest/samples/
sample1.cc 48 // Trivial case 1: small numbers
51 // Trivial case 2: even numbers
  /external/kernel-headers/original/asm-generic/
ioctl.h 57 /* used to create numbers */
66 /* used to decode ioctl numbers.. */
  /frameworks/base/core/java/android/widget/
Scroller.java 239 * numbers will scroll the content to the left.
240 * @param startY Starting vertical scroll offset in pixels. Positive numbers
242 * @param dx Horizontal distance to travel. Positive numbers will scroll the
244 * @param dy Vertical distance to travel. Positive numbers will scroll the
255 * numbers will scroll the content to the left.
256 * @param startY Starting vertical scroll offset in pixels. Positive numbers
258 * @param dx Horizontal distance to travel. Positive numbers will scroll the
260 * @param dy Vertical distance to travel. Positive numbers will scroll the
  /build/tools/
merge-event-log-tags.py 21 output file, stripped of comments. Checks that no tag numbers conflict
67 # Explicit tag numbers must be unique. (If the tag name is also the
141 # numbers should stay relatively stable as tags are added.
153 # by_tagnum should be complete now; we've assigned numbers to all tags.
  /dalvik/libcore/math/src/test/java/org/apache/harmony/math/tests/java/math/
BigIntegerAddTest.java 39 * Add two positive numbers of the same length
65 * Add two negative numbers of the same length
91 * Add two numbers of the same length.
119 * Add two numbers of the same length.
147 * Add two numbers of the same length.
175 * Add two numbers of the same length.
203 * Add two positive numbers of different length.
230 * Add two positive numbers of different length.
255 * Add two negative numbers of different length.
282 * Add two negative numbers of different length
    [all...]
  /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/digests/
SHA384Digest.java 74 * of the 9th through 16th prime numbers
SHA512Digest.java 75 * of the first eight prime numbers
  /external/blktrace/doc/
blkrawverify.1 17 sequence numbers and time stamps, also does reasonable checks for other
  /external/clearsilver/cs/
test_first_last.cs 2 <?cs each:num = Numbers ?>
  /external/icu4c/common/
common.rc 2 // It will permanently substitute version numbers that are intended to be

Completed in 1607 milliseconds

1 2 34 5 6 7 8 91011>>