| /packages/services/Car/service/src/com/android/car/ |
| SparseArrayStream.java | 27 public static <E> IntStream keyStream(SparseArray<E> array) {
28 return IntStream.range(0, array.size()).map(array::keyAt);
31 public static <E> Stream<E> valueStream(SparseArray<E> array) {
32 return IntStream.range(0, array.size()).mapToObj(array::valueAt);
35 public static <E> Stream<Pair<Integer, E>> pairStream(SparseArray<E> array) {
36 return IntStream.range(0, array.size()).mapToObj(
37 i -> new Pair<>(array.keyAt(i), array.valueAt(i)))
[all...] |
| /art/test/655-jit-clinit/src/ |
| Main.java | 32 for (int i = 0; i < array.length; ++i) {
33 array[i] = array;
38 array = new Object[10000];
50 static Object[] array; field in class:Foo
|
| /bionic/libc/arch-mips/bionic/ |
| crtbegin.c | 44 structors_array_t array; local
45 array.preinit_array = &__PREINIT_ARRAY__;
46 array.init_array = &__INIT_ARRAY__;
47 array.fini_array = &__FINI_ARRAY__;
49 __libc_init(raw_args, NULL, &main, &array);
|
| /bionic/libc/arch-mips64/bionic/ |
| crtbegin.c | 44 structors_array_t array; local
45 array.preinit_array = &__PREINIT_ARRAY__;
46 array.init_array = &__INIT_ARRAY__;
47 array.fini_array = &__FINI_ARRAY__;
49 __libc_init(raw_args, NULL, &main, &array);
|
| /external/libpng/scripts/ |
| dfn.awk | 22 array[""]=""
41 for (entry in array) {
42 while (array[entry] != "") {
44 value = array[key]
45 array[key] = ""
47 for (alt in array) {
48 if (array[alt] != "" && alt < key) {
49 array[key] = value
50 value = array[alt]
52 array[alt] = "
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| sort.pass.cpp | 85 // create array length N filled with M different numbers
86 int* array = new int[N]; local
90 array[i] = x;
95 std::sort(array, array+N);
96 assert(std::is_sorted(array, array+N));
98 std::shuffle(array, array+N, randomness);
99 std::sort(array, array+N)
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
| stable_sort.pass.cpp | 85 // create array length N filled with M different numbers
86 int* array = new int[N]; local
90 array[i] = x;
95 std::stable_sort(array, array+N);
96 assert(std::is_sorted(array, array+N));
98 std::shuffle(array, array+N, randomness);
99 std::stable_sort(array, array+N)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| sort.pass.cpp | 85 // create array length N filled with M different numbers
86 int* array = new int[N]; local
90 array[i] = x;
95 std::sort(array, array+N);
96 assert(std::is_sorted(array, array+N));
98 std::shuffle(array, array+N, randomness);
99 std::sort(array, array+N)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
| stable_sort.pass.cpp | 85 // create array length N filled with M different numbers
86 int* array = new int[N]; local
90 array[i] = x;
95 std::stable_sort(array, array+N);
96 assert(std::is_sorted(array, array+N));
98 std::shuffle(array, array+N, randomness);
99 std::stable_sort(array, array+N)
[all...] |
| /external/python/cpython2/Lib/test/ |
| test_array.py | 9 import array, cStringIO
13 class ArraySubclass(array.array):
16 class ArraySubclassWithKwargs(array.array):
18 array.array.__init__(self, typecode)
28 self.assertRaises(TypeError, array.array)
29 self.assertRaises(TypeError, array.array, spam=42
[all...] |
| /frameworks/support/slices/core/src/main/java/androidx/slice/ |
| ArrayUtils.java | 23 import java.lang.reflect.Array;
31 public static <T> boolean contains(T[] array, T item) {
32 for (T t : array) {
40 public static <T> T[] appendElement(Class<T> kind, T[] array, T element) {
43 if (array != null) {
44 end = array.length;
45 result = (T[]) Array.newInstance(kind, end + 1);
46 System.arraycopy(array, 0, result, 0, end);
49 result = (T[]) Array.newInstance(kind, 1);
55 public static <T> T[] removeElement(Class<T> kind, T[] array, T element)
[all...] |
| /prebuilts/jdk/jdk8/darwin-x86/sample/forkjoin/mergesort/ |
| MergeSort.java | 47 * A class for sorting an array of {@code ints} in parallel.
49 * algorithm the array is split into halves and a new sub task is created
52 * This happens until the size of the array is at most 2
53 * elements long. At this point the array is sorted using a simple compare
59 * a small array for each merge (creating a lot of objects), this could
60 * be avoided by keeping a single array.
66 private final int[] array; field in class:MergeSort.MergeSortTask
72 * Creates a {@code MergeSortTask} containing the array and the bounds of the array
74 * @param array the array to sor
[all...] |
| /prebuilts/jdk/jdk8/linux-x86/sample/forkjoin/mergesort/ |
| MergeSort.java | 47 * A class for sorting an array of {@code ints} in parallel.
49 * algorithm the array is split into halves and a new sub task is created
52 * This happens until the size of the array is at most 2
53 * elements long. At this point the array is sorted using a simple compare
59 * a small array for each merge (creating a lot of objects), this could
60 * be avoided by keeping a single array.
66 private final int[] array; field in class:MergeSort.MergeSortTask
72 * Creates a {@code MergeSortTask} containing the array and the bounds of the array
74 * @param array the array to sor
[all...] |
| /external/libcups/cups/ |
| testarray.c | 2 * Array test program for CUPS.
22 #include "array-private.h"
31 static int load_words(const char *filename, cups_array_t *array);
42 cups_array_t *array, /* Test array */ local
43 *dup_array; /* Duplicate array */
45 char *text; /* Text from array */
68 array = cupsArrayNew((cups_array_func_t)strcmp, data);
70 if (array)
83 if (cupsArrayUserData(array) == data
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-ot-var-avar-table.hh | 65 return value - array[0].fromCoord + array[0].toCoord;
68 if (value <= array[0].fromCoord)
69 return value - array[0].fromCoord + array[0].toCoord;
73 for (i = 1; i < count && value > array[i].fromCoord; i++)
76 if (value >= array[i].fromCoord)
77 return value - array[i].fromCoord + array[i].toCoord;
79 if (unlikely (array[i-1].fromCoord == array[i].fromCoord)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_array.py | 10 import array, cStringIO
13 class ArraySubclass(array.array):
16 class ArraySubclassWithKwargs(array.array):
18 array.array.__init__(self, typecode)
26 self.assertRaises(TypeError, array.array)
27 self.assertRaises(TypeError, array.array, spam=42
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_array.py | 10 import array, cStringIO
13 class ArraySubclass(array.array):
16 class ArraySubclassWithKwargs(array.array):
18 array.array.__init__(self, typecode)
26 self.assertRaises(TypeError, array.array)
27 self.assertRaises(TypeError, array.array, spam=42
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_array.py | 10 import array, cStringIO
13 class ArraySubclass(array.array):
16 class ArraySubclassWithKwargs(array.array):
18 array.array.__init__(self, typecode)
26 self.assertRaises(TypeError, array.array)
27 self.assertRaises(TypeError, array.array, spam=42
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_array.py | 10 import array, cStringIO
13 class ArraySubclass(array.array):
16 class ArraySubclassWithKwargs(array.array):
18 array.array.__init__(self, typecode)
26 self.assertRaises(TypeError, array.array)
27 self.assertRaises(TypeError, array.array, spam=42
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_array.py | 9 import array, cStringIO
12 class ArraySubclass(array.array):
15 class ArraySubclassWithKwargs(array.array):
17 array.array.__init__(self, typecode)
25 self.assertRaises(TypeError, array.array)
26 self.assertRaises(TypeError, array.array, spam=42)
[all...] |
| /art/test/499-bce-phi-array-length/src/ |
| Main.java | 18 public static int foo(int start, int[] array) {
21 // for the array length which will only be used within the loop.
23 result += array[i];
25 // The HBoundsCheck for this array access will be updated to access
26 // the array length phi created for the deoptimization checks of the
27 // first loop. This crashed the compiler which used to DCHECK an array
29 result += array[j];
35 public static int bar(int start, int[] array) {
38 result += array[i];
40 result += array[j]
[all...] |
| /external/mesa3d/src/egl/main/ |
| eglarray.h | 58 _eglDestroyArray(_EGLArray *array, void (*free_cb)(void *));
62 _eglAppendArray(_EGLArray *array, void *elem);
66 _eglEraseArray(_EGLArray *array, EGLint i, void (*free_cb)(void *));
70 _eglFindArray(_EGLArray *array, void *elem);
74 _eglFilterArray(_EGLArray *array, void **data, EGLint size,
79 _eglFlattenArray(_EGLArray *array, void *buffer, EGLint elem_size, EGLint size,
84 _eglGetArraySize(_EGLArray *array)
86 return (array) ? array->Size : 0;
|
| /frameworks/support/core/ktx/src/androidTest/java/androidx/core/util/ |
| LongSparseArrayTest.kt | 32 val array = LongSparseArray<String>()
33 assertEquals(0, array.size)
34 array.put(1L, "one")
35 assertEquals(1, array.size)
39 val array = LongSparseArray<String>()
40 assertFalse(1L in array)
41 array.put(1L, "one")
42 assertTrue(1L in array)
46 val array = LongSparseArray<String>()
48 array.put(1L, "one"
[all...] |
| /external/guava/guava/src/com/google/common/primitives/ |
| SignedBytes.java | 106 * Returns the least value present in {@code array}.
108 * @param array a <i>nonempty</i> array of {@code byte} values
109 * @return the value present in {@code array} that is less than or equal to
110 * every other value in the array
111 * @throws IllegalArgumentException if {@code array} is empty
113 public static byte min(byte... array) {
114 checkArgument(array.length > 0);
115 byte min = array[0];
116 for (int i = 1; i < array.length; i++)
[all...] |
| /external/valgrind/memcheck/tests/ |
| custom_alloc.c | 111 int *array, *array3; local
114 array = custom_alloc(sizeof(int) * 10);
115 array[8] = 8;
116 array[9] = 8;
117 array[10] = 10; // invalid write (ok w/o MALLOCLIKE -- in superblock)
119 VALGRIND_RESIZEINPLACE_BLOCK(array, sizeof(int) * 10, sizeof(int) * 5, RZ);
120 array[4] = 7;
121 array[5] = 9; // invalid write
123 // Make the entire array defined again such that it can be verified whether
125 (void) VALGRIND_MAKE_MEM_DEFINED(array, sizeof(int) * 10)
[all...] |
