/external/syslinux/com32/include/ |
sort.h | 13 * @nums: Pointer to the array 16 extern void quick_sort(int *nums, int count);
|
/external/syslinux/com32/libutil/ |
quicksort.c | 25 * @nums: The numbers to sort 36 static void quick_sort_range(int *nums, int l, int u) 42 swap(&nums[l], &nums[randint(l, u)]); 46 if (nums[i] < nums[l]) 47 swap(&nums[++m], &nums[i]); 50 swap(&nums[l], &nums[m]) [all...] |
/external/clang/test/Analysis/inlining/ |
stl.cpp | 8 void testVector(std::vector<int> &nums) { 9 if (nums.begin()) return; 10 if (nums.end()) return; 12 clang_analyzer_eval(nums.size() == 0);
|
/external/syslinux/com32/samples/ |
hello.c | 18 int *nums = NULL; local 20 nums = malloc(NUM_COUNT * sizeof(int)); 21 printf("Hello, world, from 0x%08X! malloc return %p\n", (unsigned int)&main, nums); 23 free(nums);
|
/external/clang/test/Analysis/ |
cxx-crashes.cpp | 63 int nums[n]; local 64 nums[0] = 1; 65 clang_analyzer_eval(nums[0] == 1); // expected-warning{{TRUE}}
|
/prebuilts/go/darwin-x86/test/fixedbugs/ |
issue6750.go | 11 func printmany(nums ...int) { 12 for i, n := range nums {
|
/prebuilts/go/linux-x86/test/fixedbugs/ |
issue6750.go | 11 func printmany(nums ...int) { 12 for i, n := range nums {
|
/external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
BigIntegerMath.java | 188 static BigInteger listProduct(List<BigInteger> nums) { 189 return listProduct(nums, 0, nums.size()); 192 static BigInteger listProduct(List<BigInteger> nums, int start, int end) { 197 return nums.get(start); 199 return nums.get(start).multiply(nums.get(start + 1)); 201 return nums.get(start).multiply(nums.get(start + 1)).multiply(nums.get(start + 2)) [all...] |
/frameworks/base/services/tests/servicestests/src/com/android/server/content/ |
ObserverNodeTest.java | 52 int[] nums = new int[] {4, 7, 1, 4, 2, 2, 3, 3}; local 64 for (int i = nums.length - 1; i >=0; --i) { 66 assertEquals(nums[i], calls.size()); 85 int[] nums = new int[] {7, 1, 3, 3, 1, 1, 1, 1}; local 96 assertEquals(nums[i], calls.size());
|
/external/androidplot/Examples/DemoApp/src/com/androidplot/demos/ |
ListViewActivity.java | 74 ArrayList<Number> nums = new ArrayList<Number>();
local 76 nums.add(generator.nextFloat());
87 XYSeries series = new SimpleXYSeries(nums, SimpleXYSeries.ArrayFormat.Y_VALS_ONLY, "S" + k);
|
/external/guava/guava/src/com/google/common/math/ |
BigIntegerMath.java | 371 static BigInteger listProduct(List<BigInteger> nums) { 372 return listProduct(nums, 0, nums.size()); 375 static BigInteger listProduct(List<BigInteger> nums, int start, int end) { 380 return nums.get(start); 382 return nums.get(start).multiply(nums.get(start + 1)); 384 return nums.get(start).multiply(nums.get(start + 1)).multiply(nums.get(start + 2)) [all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/ |
ltable.c | 196 static int computesizes (int nums[], int *narray) { 203 if (nums[i] > 0) { 204 a += nums[i]; 218 static int countint (const TValue *key, int *nums) { 221 nums[luaO_ceillog2(k)]++; /* count as such */ 229 static int numusearray (const Table *t, int *nums) { 232 int ause = 0; /* summation of `nums' */ 247 nums[lg] += lc; 254 static int numusehash (const Table *t, int *nums, int *pnasize) { 256 int ause = 0; /* summation of `nums' */ 345 int nums[MAXBITS+1]; \/* nums[i] = number of keys with 2^(i-1) < k <= 2^i *\/ local [all...] |
/external/skia/third_party/lua/src/ |
ltable.c | 196 static int computesizes (int nums[], int *narray) { 203 if (nums[i] > 0) { 204 a += nums[i]; 218 static int countint (const TValue *key, int *nums) { 221 nums[luaO_ceillog2(k)]++; /* count as such */ 229 static int numusearray (const Table *t, int *nums) { 232 int ause = 0; /* summation of `nums' */ 247 nums[lg] += lc; 254 static int numusehash (const Table *t, int *nums, int *pnasize) { 256 int ause = 0; /* summation of `nums' */ 345 int nums[MAXBITS+1]; \/* nums[i] = number of keys with 2^(i-1) < k <= 2^i *\/ local [all...] |
/external/syslinux/com32/lua/src/ |
ltable.c | 197 static int computesizes (int nums[], int *narray) { 204 if (nums[i] > 0) { 205 a += nums[i]; 219 static int countint (const TValue *key, int *nums) { 222 nums[luaO_ceillog2(k)]++; /* count as such */ 230 static int numusearray (const Table *t, int *nums) { 233 int ause = 0; /* summation of `nums' */ 248 nums[lg] += lc; 255 static int numusehash (const Table *t, int *nums, int *pnasize) { 257 int ause = 0; /* summation of `nums' */ 346 int nums[MAXBITS+1]; \/* nums[i] = number of keys with 2^(i-1) < k <= 2^i *\/ local [all...] |
/hardware/interfaces/tv/input/1.0/vts/functional/ |
VtsHalTvInputV1_0TargetTest.cpp | 113 * Returns DEFAULT_ID if there is no missing integer in the range [0, the size of nums). 116 int32_t getNumNotIn(std::vector<int32_t>& nums) { 118 int32_t size = static_cast<int32_t>(nums.size()); 121 int32_t target_pos = nums[i]; 122 while (target_pos >= 0 && target_pos < size && i != target_pos && nums[i] != nums[target_pos]) { 123 std::swap(nums[i], nums[target_pos]); 124 target_pos = nums[i]; 129 if (nums[i] != i) [all...] |
/external/fio/lib/ |
lfsr.c | 234 int lfsr_init(struct fio_lfsr *fl, uint64_t nums, unsigned long seed, 239 taps = find_lfsr(nums); 243 fl->max_val = nums - 1;
|
/system/core/storaged/tests/ |
storaged_test.cpp | 124 static double mean(std::deque<uint32_t> nums) { 126 for (uint32_t i : nums) { 129 return sum / nums.size(); 132 static double standard_deviation(std::deque<uint32_t> nums) { 134 double avg = mean(nums); 135 for (uint32_t i : nums) { 138 return sqrt(sum / nums.size());
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/ |
BigNumberFormatTest.java | 298 Number num = null, nums[] = null; local 306 nums = (Number[]) numo; 319 if (nums != null) { 320 n = Math.max(n, nums.length); 327 nums == null ? num : nums[i],
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
BigNumberFormatTest.java | 297 Number num = null, nums[] = null; local 305 nums = (Number[]) numo; 318 if (nums != null) { 319 n = Math.max(n, nums.length); 326 nums == null ? num : nums[i],
|
/external/guava/guava-gwt/test-super/com/google/common/base/super/com/google/common/base/ |
PredicatesTest.java | 487 Collection<Integer> nums = Arrays.asList(1, 5); local 488 Predicate<Integer> isOneOrFive = Predicates.in(nums); 497 Collection<Integer> nums = ImmutableSet.of(1, 5); local 503 .addEqualityGroup(Predicates.in(nums), Predicates.in(nums), 518 Collection<Integer> nums = new CollectionThatThrowsNPE<Integer>(); local 519 Predicate<Integer> isFalse = Predicates.in(nums); 531 Collection<Integer> nums = new CollectionThatThrowsCCE<Integer>(); local 532 nums.add(3); 533 Predicate<Integer> isThree = Predicates.in(nums); 542 Collection<Number> nums = ImmutableSet.of(); local [all...] |
/external/guava/guava-tests/test/com/google/common/base/ |
PredicatesTest.java | 696 Collection<Integer> nums = Arrays.asList(1, 5); local 697 Predicate<Integer> isOneOrFive = Predicates.in(nums); 706 Collection<Integer> nums = ImmutableSet.of(1, 5); local 712 .addEqualityGroup(Predicates.in(nums), Predicates.in(nums), 732 Collection<Integer> nums = new CollectionThatThrowsNPE<Integer>(); local 733 Predicate<Integer> isFalse = Predicates.in(nums); 745 Collection<Integer> nums = new CollectionThatThrowsCCE<Integer>(); local 746 nums.add(3); 747 Predicate<Integer> isThree = Predicates.in(nums); 756 Collection<Number> nums = ImmutableSet.of(); local [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
actions.rb | 211 nums returns [ds]: digs+=DIGIT+ 221 parser.nums.should == [ 10, 20, 30, 40, 50 ]
|
/external/vboot_reference/scripts/ |
genpadding.sh | 92 let nums=rsalen-hashlen-3 95 genFFOctets $nums
|
/libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
DoubleNodeTest.java | 168 int[] nums = new int[] { 0, 1, array.length / 2, array.length - 1, array.length }; local 169 for (int start : nums) 170 for (int end : nums) {
|
IntNodeTest.java | 166 int[] nums = new int[] { 0, 1, array.length / 2, array.length - 1, array.length }; local 167 for (int start : nums) 168 for (int end : nums) {
|