| /external/protobuf/java/core/src/main/java/com/google/protobuf/ |
| DoubleArrayList.java | 40 * An implementation of {@link DoubleList} on top of a primitive array.
59 private double[] array; field in class:DoubleArrayList
62 * The size of the list distinct from the length of the array. That is, it is the number of
77 private DoubleArrayList(double[] array, int size) {
78 this.array = array;
95 final double[] arr = other.array;
97 if (array[i] != arr[i]) {
109 long bits = Double.doubleToLongBits(array[i]);
120 return new DoubleArrayList(Arrays.copyOf(array, capacity), size)
[all...] |
| FloatArrayList.java | 40 * An implementation of {@link FloatList} on top of a primitive array.
58 private float[] array; field in class:FloatArrayList
61 * The size of the list distinct from the length of the array. That is, it is the number of
76 private FloatArrayList(float[] array, int size) {
77 this.array = array;
94 final float[] arr = other.array;
96 if (array[i] != arr[i]) {
108 result = (31 * result) + Float.floatToIntBits(array[i]);
118 return new FloatArrayList(Arrays.copyOf(array, capacity), size)
[all...] |
| IntArrayList.java | 40 * An implementation of {@link IntList} on top of a primitive array.
58 private int[] array; field in class:IntArrayList
61 * The size of the list distinct from the length of the array. That is, it is the number of
76 private IntArrayList(int[] array, int size) {
77 this.array = array;
94 final int[] arr = other.array;
96 if (array[i] != arr[i]) {
108 result = (31 * result) + array[i];
118 return new IntArrayList(Arrays.copyOf(array, capacity), size)
[all...] |
| LongArrayList.java | 40 * An implementation of {@link LongList} on top of a primitive array.
58 private long[] array; field in class:LongArrayList
61 * The size of the list distinct from the length of the array. That is, it is the number of
76 private LongArrayList(long[] array, int size) {
77 this.array = array;
94 final long[] arr = other.array;
96 if (array[i] != arr[i]) {
108 result = (31 * result) + Internal.hashLong(array[i]);
118 return new LongArrayList(Arrays.copyOf(array, capacity), size)
[all...] |
| /external/libcxx/test/std/containers/sequences/array/array.cons/ |
| initializer_list.pass.cpp | 10 // <array>
14 #include <array>
17 // std::array is explicitly allowed to be initialized with A a = { init-list };.
25 typedef std::array<T, 3> C;
34 typedef std::array<T, 0> C;
41 typedef std::array<T, 3> C;
48 typedef std::array<T, 1> C;
|
| /external/libcxx/test/std/containers/sequences/array/array.tuple/ |
| tuple_size.pass.cpp | 10 // <array>
12 // tuple_size<array<T, N> >::value
14 #include <array>
20 typedef std::array<T, N> C;
24 typedef std::array<T const, N> C;
28 typedef std::array<T volatile, N> C;
32 typedef std::array<T const volatile, N> C;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/array/array.cons/ |
| initializer_list.pass.cpp | 10 // <array>
14 #include <array>
17 // std::array is explicitly allowed to be initialized with A a = { init-list };.
25 typedef std::array<T, 3> C;
34 typedef std::array<T, 0> C;
41 typedef std::array<T, 3> C;
48 typedef std::array<T, 1> C;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/array/array.tuple/ |
| tuple_size.pass.cpp | 10 // <array>
12 // tuple_size<array<T, N> >::value
14 #include <array>
20 typedef std::array<T, N> C;
24 typedef std::array<T const, N> C;
28 typedef std::array<T volatile, N> C;
32 typedef std::array<T const volatile, N> C;
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| ShellSorter.java | 26 * to pass over the array each time. Currently this function uses Robert Cruse's suggestion
30 public void sort(Type[] array, int count, Comparator<Type> comparator) {
36 insertionSort(array, count, start, increment, comparator);
44 insertionSort(array, count, 0, 1, comparator );
58 public void insertionSort(Type[] array, int count, int start, int increment,
67 int delta = comparator.compare(array[j], array[k]);
72 temp = array[j];
74 array[j] = array[k]
[all...] |
| /dalvik/dx/src/com/android/dx/io/instructions/ |
| ShortArrayCodeInput.java | 26 /** source array to read from */
27 private final short[] array; field in class:ShortArrayCodeInput
32 public ShortArrayCodeInput(short[] array) {
33 if (array == null) {
34 throw new NullPointerException("array == null");
37 this.array = array;
43 return cursor() < array.length;
50 int value = array[cursor()];
|
| /external/eigen/demos/mix_eigen_and_c/ |
| example.c | 34 // this helper function takes a plain C array and prints it in one line
35 void print_array(double *array, int n)
37 struct C_Map_MatrixXd *m = Map_MatrixXd_new(array, 1, n);
45 double array[5]; local
49 for(i = 0; i < 5; ++i) array[i] = i;
50 printf("Initially, the array is:\n");
51 print_array(array, 5);
53 map = Map_MatrixXd_new(array, 5, 1);
57 printf("Now the array is:\n");
58 print_array(array, 5)
[all...] |
| /external/valgrind/drd/tests/ |
| custom_alloc.c | 67 int* array; local
70 array = custom_alloc(sizeof(int) * 10);
71 array[8] = 8;
72 array[9] = 8;
73 array[10] = 10; // invalid write (ok w/o MALLOCLIKE -- in superblock)
75 custom_free(array); // ok
83 return array[0]; // use after free (ok without MALLOCLIKE)
|
| /frameworks/base/core/java/android/os/ |
| HwBlob.java | 98 * @param array destination array
100 * @throws IllegalArgumentException array.length < size
103 public native final void copyToBoolArray(long offset, boolean[] array, int size);
109 * @param array destination array
111 * @throws IllegalArgumentException array.length < size
114 public native final void copyToInt8Array(long offset, byte[] array, int size);
120 * @param array destination array
[all...] |
| /frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/unit/ |
| ByteArrayHelpers.java | 21 import java.lang.reflect.Array;
32 * Convert an array of byte primitives to a {@code byte[]} using native endian order.
37 * @param array array of primitives
38 * @return array
40 public static byte[] toByteArray(byte[] array) {
41 return array;
45 * Convert an array of shorts to a {@code byte[]} using native endian order.
47 * @param array array of short
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/ |
| WrappedCharBufferTest1.java | 41 char array[] = new char[BUFFER_LENGTH]; local
43 CharBuffer.wrap(array, -1, 0);
49 CharBuffer.wrap(array, BUFFER_LENGTH + 1, 0);
55 CharBuffer.wrap(array, 0, -1);
61 CharBuffer.wrap(array, 0, BUFFER_LENGTH + 1);
67 CharBuffer.wrap(array, Integer.MAX_VALUE, 1);
73 CharBuffer.wrap(array, 1, Integer.MAX_VALUE);
|
| /external/tensorflow/tensorflow/compiler/tests/ |
| nary_ops_test.py | 58 [np.array([[1, 2, 3]], dtype=np.float32)],
59 expected=np.array([[1, 2, 3]], dtype=np.float32))
62 [np.array([1, 2], dtype=np.float32),
63 np.array([10, 20], dtype=np.float32)],
64 expected=np.array([11, 22], dtype=np.float32))
66 [np.array([-4], dtype=np.float32),
67 np.array([10], dtype=np.float32),
68 np.array([42], dtype=np.float32)],
69 expected=np.array([48], dtype=np.float32))
74 math_ops.add_n, [np.array([[1 + 2j, 2 - 3j, 3 + 4j]], dtype=dtype)]
[all...] |
| binary_ops_test.py | 69 np.array([[[[-1, 2.00009999], [-3, b]]]], dtype=dtype),
70 np.array([[[[a, 2], [-3.00009, 4]]]], dtype=dtype),
71 expected=np.array([[[[False, True], [True, False]]]], dtype=dtype))
75 np.array([3, 3, -1.5, -8, 44], dtype=dtype),
76 np.array([2, -2, 7, -4, 0], dtype=dtype),
77 expected=np.array(
84 np.array([1, 2], dtype=dtype),
89 np.array([10, 4], dtype=dtype),
90 np.array([2, 3], dtype=dtype),
91 expected=np.array([100, 64], dtype=dtype)
[all...] |
| /external/mesa3d/src/compiler/glsl/ |
| ast_array_index.cpp | 40 * If \c ir is a reference to an array for which we are tracking the max array
44 * This function also checks whether the array is a built-in array whose
58 * the size of a built-in array to be too large.
66 * - Accessing an element of an array that is a member of a named
69 * - Accessing an element of an array that is a member of a named
70 * interface block array (e.g. ifc[j].foo[i]).
72 * - Accessing an element of an array that is a member of a named
73 * interface block array of arrays (e.g. ifc[j][k].foo[i])
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableList.java | 34 private final transient Object[] array; field in class:RegularImmutableList
36 RegularImmutableList(Object[] array, int offset, int size) {
39 this.array = array;
42 RegularImmutableList(Object[] array) {
43 this(array, 0, array.length);
52 return size != array.length;
57 System.arraycopy(array, offset, dst, dstOff, size);
66 return (E) array[index + offset]
[all...] |
| /external/pdfium/core/fpdfdoc/ |
| cpdf_dest_unittest.cpp | 22 // |array| must outlive |dest|.
23 auto array = pdfium::MakeUnique<CPDF_Array>(); local
24 array->AddNew<CPDF_Number>(0); // Page Index.
25 array->AddNew<CPDF_Name>("XYZ");
26 array->AddNew<CPDF_Number>(4); // X
33 auto dest = pdfium::MakeUnique<CPDF_Dest>(array.get());
36 array->AddNew<CPDF_Number>(5); // Y
37 array->AddNew<CPDF_Number>(6); // Zoom.
39 auto dest = pdfium::MakeUnique<CPDF_Dest>(array.get());
49 array->SetNewAt<CPDF_Number>(4, 0)
[all...] |
| /external/google-tv-pairing-protocol/java/src/com/google/polo/pairing/ |
| HexDump.java | 23 public static String dumpHexString(byte[] array)
25 return dumpHexString(array, 0, array.length);
28 public static String dumpHexString(byte[] array, int offset, int length)
61 byte b = array[i];
99 public static String toHexString(byte[] array)
101 return toHexString(array, 0, array.length);
104 public static String toHexString(byte[] array, int offset, int length)
111 byte b = array[i]
[all...] |
| /art/test/412-new-array/src/ |
| Main.java | 116 // Use an array initializer to hint the use of filled-new-array.
125 // Use an array initializer to hint the use of filled-new-array.
144 int[] array = new int[-1]; local
210 // Ensure the elements in filled-new-array must be assignable
211 // to the array component type.
224 int[] array = new int[0]; local
225 Object[] args = { array };
227 assertEquals(0, array.length)
256 int[] array = new int[7]; local
295 int[] array = new int[7]; local
334 short[] array = new short[7]; local
373 long[] array = new long[7]; local
412 char[] array = new char[7]; local
[all...] |
| /external/guava/guava/src/com/google/common/primitives/ |
| Booleans.java | 82 * {@code array}.
84 * <p><b>Note:</b> consider representing the array as a {@link
85 * BitSet} instead, replacing {@code Booleans.contains(array, true)}
86 * with {@code !bitSet.isEmpty()} and {@code Booleans.contains(array, false)}
89 * @param array an array of {@code boolean} values, possibly empty
91 * @return {@code true} if {@code array[i] == target} for some value of {@code
94 public static boolean contains(boolean[] array, boolean target) {
95 for (boolean value : array) {
105 * {@code array}
356 final boolean[] array; field in class:Booleans.BooleanArrayAsList
[all...] |
| /external/pdfium/fxbarcode/qrcode/ |
| BC_QRCoderMaskUtil.cpp | 40 uint8_t* array = matrix->GetArray(); local
45 int32_t value = array[y * width + x];
46 if (value == array[y * width + x + 1] &&
47 value == array[(y + 1) * width + x] &&
48 value == array[(y + 1) * width + x + 1]) {
59 uint8_t* array = matrix->GetArray(); local
78 if (x + 6 < width && array[y * width + x] == 1 &&
79 array[y * width + x + 1] == 0 && array[y * width + x + 2] == 1 &&
80 array[y * width + x + 3] == 1 && array[y * width + x + 4] == 1 &
111 uint8_t* array = matrix->GetArray(); local
179 uint8_t* array = matrix->GetArray(); local
[all...] |
| /external/compiler-rt/lib/builtins/ |
| emutls.c | 101 uintptr_t size; /* number of elements in the 'data' array */
108 emutls_address_array* array = (emutls_address_array*)ptr; local
110 for (i = 0; i < array->size; ++i) {
111 if (array->data[i])
112 emutls_memalign_free(array->data[i]);
140 static __inline void emutls_check_array_set_size(emutls_address_array *array,
142 if (array == NULL)
144 array->size = size;
145 pthread_setspecific(emutls_pthread_key, (void*)array);
148 /* Returns the new 'data' array size, number of elements
164 emutls_address_array* array = pthread_getspecific(emutls_pthread_key); local
185 emutls_address_array* array = emutls_get_address_array(index); local
[all...] |
