HomeSort by relevance Sort by last modified time
    Searched refs:numbers (Results 126 - 150 of 775) sorted by null

1 2 3 4 56 7 8 91011>>

  /prebuilts/go/linux-x86/misc/cgo/gmp/
fib.go 7 // Compute Fibonacci numbers with two goroutines
  /prebuilts/go/linux-x86/misc/cgo/stdio/
fib.go 9 // Compute Fibonacci numbers with two goroutines
  /prebuilts/go/linux-x86/src/runtime/
defs_nacl_amd64p32.go 5 // but really don't matter. Even so, use the standard numbers.
  /prebuilts/go/linux-x86/test/
235.go 7 // Solve the 2,3,5 problem (print all numbers with 2, 3, or 5 as factor) using channels.
  /prebuilts/go/linux-x86/test/ken/
cplx1.go 7 // Test simple arithmetic and assignment for complex numbers.
cplx4.go 7 // Test complex numbers,including fmt support.
cplx5.go 7 // Test compound types made of complex numbers.
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/
lineno.d 2 #name: assembly line numbers
  /external/guava/guava-tests/test/com/google/common/base/
OptionalTest.java 275 FluentIterable<? extends Number> numbers = getSomeNumbers(); local
276 Optional<? extends Number> first = numbers.first();
288 FluentIterable<? extends Number> numbers = getSomeNumbers(); local
293 Optional<Number> first = (Optional) numbers.first();
  /external/ltp/testcases/kernel/include/
regen.sh 31 * system call numbers (those __NR_ thingies).
  /external/testng/src/main/java/org/testng/
ITestNGMethod.java 235 * Which invocation numbers of this method should be used (only applicable
241 public void setInvocationNumbers(List<Integer> numbers);
244 * The list of invocation numbers that failed, which is only applicable for
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
sparsetree.go 17 // Every block has 6 numbers associated with it:
43 // exit (-adjust) numbers allow a distinction to be made
101 // numberBlock assigns entry and exit numbers for b and b's
124 // This is the in-order sequence of assigned and reserved numbers
149 // to assign entry and exit numbers in the treewalk, those
150 // numbers are also consistent with this order (i.e.,
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
sparsetree.go 17 // Every block has 6 numbers associated with it:
43 // exit (-adjust) numbers allow a distinction to be made
101 // numberBlock assigns entry and exit numbers for b and b's
124 // This is the in-order sequence of assigned and reserved numbers
149 // to assign entry and exit numbers in the treewalk, those
150 // numbers are also consistent with this order (i.e.,
  /external/valgrind/none/tests/arm/
vfp.c 1953 int numbers[8] ={ 0xaa0, 0xbb1, 0xcc2, 0xdd3, 0x11a, 0x22b, 0x33c, 0x44d }; local
    [all...]
  /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
OrderingTest.java 271 Ordering<Number> numbers = Ordering.explicit((Number) 1);
275 Ordering<Number> a = numbers.compound(numbers);
279 Ordering<Number> b = numbers.compound(objects);
280 Ordering<Number> c = objects.compound(numbers);
282 Ordering<Integer> d = numbers.compound(integers);
283 Ordering<Integer> e = integers.compound(numbers);
288 Ordering<Number> f = numbers.compound(objects).compound(objects); //bad IDEA
289 Ordering<Number> g = objects.compound(numbers).compound(objects);
290 Ordering<Number> h = objects.compound(objects).compound(numbers);
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
OrderingTest.java 273 Ordering<Number> numbers = Ordering.explicit((Number) 1);
277 Ordering<Number> a = numbers.compound(numbers);
281 Ordering<Number> b = numbers.compound(objects);
282 Ordering<Number> c = objects.compound(numbers);
284 Ordering<Integer> d = numbers.compound(integers);
285 Ordering<Integer> e = integers.compound(numbers);
290 Ordering<Number> f = numbers.compound(objects).compound(objects); //bad IDEA
291 Ordering<Number> g = objects.compound(numbers).compound(objects);
292 Ordering<Number> h = objects.compound(objects).compound(numbers);
    [all...]
  /libcore/ojluni/src/main/java/java/time/chrono/
HijrahChronology.java 1032 String[] numbers = line.split("\\\\s"); local
    [all...]
  /packages/apps/Messaging/src/com/android/messaging/util/
PhoneUtils.java 220 * Get the set of self phone numbers, all normalized
222 * @return the set of normalized self phone numbers
401 final HashSet<String> numbers = new HashSet<>(); local
402 numbers.add(getCanonicalForSelf(true/*allowOverride*/));
403 return numbers;
625 final HashSet<String> numbers = new HashSet<>(); local
627 numbers.add(PhoneUtils.get(info.getSubscriptionId()).getCanonicalForSelf(
630 return numbers;
708 // Get or set the cache of canonicalized phone numbers for a specific country
798 // This is possible for short codes and other non-localizable numbers
    [all...]
  /prebuilts/go/darwin-x86/src/math/big/
bits_test.go 7 // numbers.
204 // all different bit numbers
213 // multiple equal bit numbers
doc.go 6 Package big implements arbitrary-precision arithmetic (big numbers).
10 Rat rational numbers
11 Float floating-point numbers
  /prebuilts/go/linux-x86/src/math/big/
bits_test.go 7 // numbers.
204 // all different bit numbers
213 // multiple equal bit numbers
doc.go 6 Package big implements arbitrary-precision arithmetic (big numbers).
10 Rat rational numbers
11 Float floating-point numbers
  /external/v8/benchmarks/
base.js 55 // Automatically convert results to numbers. Used by the geometric
147 // Computes the geometric mean of a set of numbers.
148 BenchmarkSuite.GeometricMean = function(numbers) {
150 for (var i = 0; i < numbers.length; i++) {
151 log += Math.log(numbers[i]);
153 return Math.pow(Math.E, log / numbers.length);
  /external/guice/core/test/com/google/inject/
ErrorHandlingTest.java 86 @Inject void setNumbers(@Named("numbers") List<Integer> numbers) {}
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/
TimeUnitTest.java 171 int[] numbers = new int[] {1, 7}; local
245 for( int numIndex = 0; numIndex < numbers.length; ++numIndex ) {
249 timeUnitAmount = new TimeUnitAmount(numbers[numIndex], units[unitIndex]);
257 + ", value: " + numbers[numIndex],

Completed in 595 milliseconds

1 2 3 4 56 7 8 91011>>