/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/ |
ReadOnlyIntBufferTest.java | 42 buf.array(); 82 int array[] = new int[1]; local 84 buf.put(array); 98 int array[] = new int[1]; local 100 buf.put(array, 0, array.length); 118 buf.put(array, -1, array.length);
|
ReadOnlyLongBufferTest.java | 42 buf.array(); 82 long array[] = new long[1]; local 84 buf.put(array); 98 long array[] = new long[1]; local 100 buf.put(array, 0, array.length); 118 buf.put(array, -1, array.length);
|
ReadOnlyShortBufferTest.java | 42 buf.array(); 82 short array[] = new short[1]; local 84 buf.put(array); 98 short array[] = new short[1]; local 100 buf.put(array, 0, array.length); 118 buf.put(array, -1, array.length);
|
/prebuilts/go/darwin-x86/test/fixedbugs/ |
issue18906.go | 19 array = [257]int{} 20 slice = array[1:] 24 for i := range array { 25 array[i] = i - 1 18 array = [257]int{} var
|
issue5609.go | 7 // issue 5609: overflow when calculating array size 13 var foo [Large]uint64 // ERROR "array bound is too large|array bound overflows"
|
issue7525b.go | 7 // Issue 7525: self-referential array types. 12 d [len(y.d)]int // ERROR "array bound|typechecking loop|invalid array"
|
issue7525c.go | 7 // Issue 7525: self-referential array types. 12 e [cap(z.e)]int // ERROR "array bound|typechecking loop|invalid array"
|
/prebuilts/go/linux-x86/test/fixedbugs/ |
issue18906.go | 19 array = [257]int{} 20 slice = array[1:] 24 for i := range array { 25 array[i] = i - 1 18 array = [257]int{} var
|
/tools/tradefederation/core/src/com/android/tradefed/result/ |
ByteArrayInputStreamSource.java | 25 public ByteArrayInputStreamSource(byte[] array) { 26 mArray = array;
|
/external/eigen/test/ |
mixingtypes.cpp | 97 VERIFY_MIX_SCALAR(vf.array() / scf, vf.template cast<complex<float> >().array() / scf); 98 VERIFY_MIX_SCALAR(scd / vd.array() , scd / vd.template cast<complex<double> >().array()); 101 VERIFY_MIX_SCALAR(vcf.array() + sf , vcf.array() + complex<float>(sf)); 102 VERIFY_MIX_SCALAR(sd + vcd.array(), complex<double>(sd) + vcd.array()); 103 VERIFY_MIX_SCALAR(vf.array() + scf, vf.template cast<complex<float> >().array() + scf) [all...] |
/external/python/cpython3/Tools/demo/ |
sortvisu.py | 8 - an array visualizer with methods that implement basic sorting 14 all using the array visualizer for its basic operations and with calls 29 class Array: 102 raise Array.Cancelled 196 def __init__(self, array, index, value): 197 self.array = array 200 self.canvas = array.canvas 202 self.item_id = array.canvas.create_rectangle(x1, y1, x2, y2, 210 self.array = Non [all...] |
/art/test/045-reflect-array/src/ |
Main.java | 5 import java.lang.reflect.Array; 8 * Test java.lang.reflect.Array. 27 intArray = Array.newInstance(Integer.TYPE, 2); 29 int[] array = (int[]) intArray; local 30 array[0] = 5; 31 Array.setInt(intArray, 1, 6); 33 if (Array.getInt(intArray, 0) != 5) 35 if (array[1] != 6) 38 array[2] = 27; 42 Array.setInt(intArray, 2, 27) 75 char[] array = (char[]) charArray; local 146 long[] array = (long[]) longArray; local 167 String[] array = (String[]) strArray; local [all...] |
/cts/tests/tests/preference2/src/android/preference2/cts/ |
ListPreferenceTest.java | 44 R.array.entries_list_preference); 51 R.array.entryvalues_list_preference); 60 private synchronized String[] convertToStringArray(CharSequence[] array){ 61 String[] strArray = new String[array.length]; 62 for(int i = 0; i < array.length; i++){ 63 strArray[i] = (String) array[i];
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
sanitizer_common_test.cc | 25 static bool IsSorted(const uptr *array, uptr n) { 27 if (array[i] < array[i - 1]) return false; 33 uptr array[100]; local 37 array[i] = i; 39 SortArray(array, n); 40 EXPECT_TRUE(IsSorted(array, n)); 43 array[i] = n - 1 - i; 45 SortArray(array, n); 46 EXPECT_TRUE(IsSorted(array, n)) [all...] |
/external/libcxx/test/std/containers/sequences/array/array.data/ |
data.pass.cpp | 10 // <array> 14 #include <array> 18 // std::array is explicitly allowed to be initialized with A a = { init-list };. 26 typedef std::array<T, 3> C; 35 typedef std::array<T, 0> C; 42 typedef std::array<const T, 0> C; 50 typedef std::array<T, 0> C; 62 typedef std::array<T, 0> C;
|
data_const.pass.cpp | 10 // <array> 14 #include <array> 19 // std::array is explicitly allowed to be initialized with A a = { init-list };. 27 typedef std::array<T, 3> C; 36 typedef std::array<T, 0> C; 46 typedef std::array<T, 0> C; 53 typedef std::array<T, 0> C; 62 typedef std::array<int, 5> C;
|
/external/libcxx/test/std/containers/sequences/array/array.swap/ |
swap.pass.cpp | 10 // <array> 12 // void swap(array& a); 13 // namespace std { void swap(array<T, N> &x, array<T, N> &y); 16 #include <array> 20 // std::array is explicitly allowed to be initialized with A a = { init-list };. 35 typedef std::array<T, 3> C; 50 typedef std::array<T, 3> C; 66 typedef std::array<T, 0> C; 75 typedef std::array<T, 0> C [all...] |
/external/libcxx/test/std/iterators/iterator.container/ |
data.pass.cpp | 15 // template <class T, size_t N> constexpr T* data(T (&array)[N]) noexcept; // C++17 21 #include <array> 59 void test_const_array( const T (&array)[Sz] ) 61 ASSERT_NOEXCEPT(std::data(array)); 62 assert ( std::data(array) == &array[0]); variable 68 std::array<int, 1> a; a[0] = 3;
|
/external/python/cpython2/Demo/tkinter/guido/ |
sortvisu.py | 7 - an array visualizer with methods that implement basic sorting 13 all using the array visualizer for its basic operations and with calls 32 class Array: 85 Cancelled = "Array.Cancelled" # Exception 104 raise Array.Cancelled 198 def __init__(self, array, index, value): 199 self.array = array 203 self.item = Rectangle(array.canvas, x1, y1, x2, y2, 211 self.array = Non [all...] |
/external/sfntly/cpp/src/sfntly/data/ |
growable_memory_byte_array.h | 34 virtual int32_t CopyTo(ByteArray* array) { return ByteArray::CopyTo(array); } 35 virtual int32_t CopyTo(ByteArray* array, int32_t offset, int32_t length) { 36 return ByteArray::CopyTo(array, offset, length); 39 ByteArray* array, 42 return ByteArray::CopyTo(dst_offset, array, src_offset, length);
|
memory_byte_array.h | 26 // Construct a new MemoryByteArray with a new array of the size given. It is 27 // assumed that none of the array is filled and readable. 33 // Construct a new MemoryByteArray using byte array. 34 // @param b the byte array that provides the actual storage 35 // @param filled_length the index of the last byte in the array has data 46 virtual int32_t CopyTo(ByteArray* array) { return ByteArray::CopyTo(array); } 47 virtual int32_t CopyTo(ByteArray* array, int32_t offset, int32_t length) { 48 return ByteArray::CopyTo(array, offset, length); 51 ByteArray* array, [all...] |
/frameworks/av/services/camera/libcameraservice/device3/ |
DistortionMapper.h | 21 #include <array> 74 * coordPairs: A pointer to an array of consecutive (x,y) points 83 * rects: A pointer to an array of consecutive (x,y, w, h) rectangles 92 * coordPairs: A pointer to an array of consecutive (x,y) points 102 * rects: A pointer to an array of consecutive (x,y, w, h) rectangles 112 std::array<float, 8> coords; 145 static const std::array<uint32_t, 3> kMeteringRegionsToCorrect; 148 static const std::array<uint32_t, 1> kRequestRectsToCorrect; 151 static const std::array<uint32_t, 1> kResultRectsToCorrect; 154 static const std::array<uint32_t, 2> kResultPointsToCorrect [all...] |
/hardware/interfaces/tests/expression/1.0/ |
IExpressionExt.hal | 40 foo3(int32_t[IExpression.Constants:MAX_ARRAY_SIZE] array); 41 foo2(SixteenColors array); 42 foo1(int32_t[Constants:CONST_FOO + 5] array);
|
/libcore/luni/src/test/java/libcore/java/util/ |
TimSortTest.java | 47 Integer[] array = createBugTriggerData(); local 48 Arrays.sort(array); 50 assertSorted(array); 54 Integer[] array = createBugTriggerData(); local 55 Arrays.sort(array, NATURAL_ORDER_COMPARATOR); 57 assertSorted(array); 63 fail("Array not sorted at element " + i + ": " + Arrays.toString(arrayToSort));
|
/packages/inputmethods/LatinIME/native/jni/src/dictionary/utils/ |
entry_counters.h | 20 #include <array> 32 explicit EntryCounts(const std::array<int, MAX_PREV_WORD_COUNT_FOR_N_GRAM + 1> &counters) 39 const std::array<int, MAX_PREV_WORD_COUNT_FOR_N_GRAM + 1> &getCountArray() const { 48 const std::array<int, MAX_PREV_WORD_COUNT_FOR_N_GRAM + 1> mEntryCounts; 58 const std::array<int, MAX_PREV_WORD_COUNT_FOR_N_GRAM + 1> &counters) 86 std::array<int, MAX_PREV_WORD_COUNT_FOR_N_GRAM + 1> mEntryCounters;
|