HomeSort by relevance Sort by last modified time
    Searched defs:array (Results 176 - 200 of 3039) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/guava/guava-testlib/src/com/google/common/collect/testing/google/
TestStringBiMapGenerator.java 55 Entry<String, String>[] array = new Entry[entries.length]; local
60 array[i++] = e;
62 return create(array);
TestStringMultisetGenerator.java 42 String[] array = new String[elements.length]; local
45 array[i++] = (String) e;
47 return create(array);
  /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
CollectionCreationTester.java 43 E[] array = createArrayWithNullElement(); local
44 collection = getSubjectGenerator().create(array);
45 expectContents(array);
51 E[] array = createArrayWithNullElement(); local
54 getSubjectGenerator().create(array);
ListAddTester.java 39 @SuppressWarnings("unchecked") // too many "unchecked generic array creations"
66 E[] array = createArrayWithNullElement(); local
67 collection = getSubjectGenerator().create(array);
70 List<E> expected = Helpers.copyToList(array);
ListIndexOfTester.java 47 E[] array = createSamplesArray(); local
48 array[getNumElements() / 2] = samples.e0;
49 collection = getSubjectGenerator().create(array);
ListLastIndexOfTester.java 47 E[] array = createSamplesArray(); local
48 array[getNumElements() / 2] = samples.e0;
49 collection = getSubjectGenerator().create(array);
ListRetainAllTester.java 44 E[] array = createSamplesArray(); local
45 array[1] = samples.e0;
46 collection = getSubjectGenerator().create(array);
49 expectContents(array);
56 E[] array = createSamplesArray(); local
57 array[1] = samples.e0;
58 collection = getSubjectGenerator().create(array);
SetAddTester.java 50 E[] array = createArrayWithNullElement(); local
51 collection = getSubjectGenerator().create(array);
53 expectContents(array);
SetCreationTester.java 44 E[] array = createArrayWithNullElement(); local
45 array[0] = null;
46 collection = getSubjectGenerator().create(array);
49 Arrays.asList(array).subList(1, getNumElements());
56 E[] array = createSamplesArray(); local
57 array[1] = samples.e0;
58 collection = getSubjectGenerator().create(array);
61 Arrays.asList(array).subList(1, getNumElements());
69 E[] array = createArrayWithNullElement(); local
70 array[0] = null
81 E[] array = createSamplesArray(); local
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
UnmodifiableIteratorTest.java 35 final String[] array = {"a", "b", "c"}; local
41 return i < array.length;
48 return array[i++];
  /external/hamcrest/hamcrest-library/src/main/java/org/hamcrest/collection/
IsArray.java 10 * Matcher for array whose elements satisfy a sequence of matchers.
11 * The array size must equal the number of element matchers.
21 public boolean matchesSafely(T[] array) {
22 if (array.length != elementMatchers.length) return false;
24 for (int i = 0; i < array.length; i++) {
25 if (!elementMatchers[i].matches(array[i])) return false;
34 mismatchDescription.appendText("array length was ").appendValue(actual.length);
85 * positively only if the number of matchers specified is equal to the length of the examined array and
86 * each matcher[i] is satisfied by array[i].
88 * <pre>assertThat(new Integer[]{1,2,3}, is(array(equalTo(1), equalTo(2), equalTo(3))))</pre
93 public static <T> IsArray<T> array(Matcher<? super T>... elementMatchers) { method in class:IsArray
    [all...]
  /external/icu/icu4c/source/common/unicode/
uset.h 230 const uint16_t *array; member in struct:USerializedSet
232 * The length of the array that contains BMP characters.
237 * The total length of the array.
242 * A small buffer for the array to reduce memory allocations.
    [all...]
  /external/kmod/testsuite/
test-array.c 25 #include <shared/array.h>
31 struct array array; local
34 array_init(&array, 2);
35 array_append(&array, c1);
36 assert_return(array.count == 1, EXIT_FAILURE);
37 assert_return(array.array[0] == c1, EXIT_FAILURE);
38 array_free_array(&array);
43 .description = "test simple array append")
48 struct array array; local
70 struct array array; local
102 struct array array; local
131 struct array array; local
171 struct array array; local
    [all...]
  /external/libbrillo/brillo/glib/
object_unittest.cc 97 ::GPtrArray* array = ::g_ptr_array_new(); local
98 ::g_ptr_array_add(array, ::gpointer(a));
100 ScopedPtrArray<const char*> x(array);
119 ::GPtrArray* array = ::g_ptr_array_new(); local
120 ::g_ptr_array_add(array, ::gpointer(b));
122 x.reset(array);
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
stable_partition.pass.cpp 42 P array[] = local
55 const unsigned size = sizeof(array)/sizeof(array[0]);
56 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first());
57 assert(base(r) == array + 4);
58 assert(array[0] == P(1, 1));
59 assert(array[1] == P(1, 2));
60 assert(array[2] == P(3, 1));
61 assert(array[3] == P(3, 2))
71 P array[] = local
111 P array[] = local
140 P array[] = local
169 P array[] = local
198 P array[] = local
227 P array[] = local
256 P array[] = local
298 std::unique_ptr<int> array[size]; local
    [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...]
  /external/libcxx/test/std/iterators/iterator.range/
begin-end.pass.cpp 26 // template <class T, size_t N> reverse_iterator<T*> constexpr rbegin(T (&array)[N]); // C++14
27 // template <class T, size_t N> reverse_iterator<T*> constexpr rend(T (&array)[N]); // C++14
38 #include <array>
42 // std::array is explicitly allowed to be initialized with A a = { init-list };.
126 void test_const_array( const T (&array)[Sz] ) {
127 assert ( std::begin(array) == array ); variable
128 assert (*std::begin(array) == array[0] ); variable
129 assert ( std::begin(array) != std::end(array))
132 assert ( std::cbegin(array) == array ); variable
133 assert (*std::cbegin(array) == array[0] ); variable
    [all...]
  /external/mesa3d/src/egl/main/
eglarray.c 37 * Grow the size of the array.
40 _eglGrowArray(_EGLArray *array)
45 new_size = array->MaxSize;
46 while (new_size <= array->Size)
49 elems = realloc(array->Elements, new_size * sizeof(array->Elements[0]));
51 _eglLog(_EGL_DEBUG, "failed to grow %s array to %d",
52 array->Name, new_size);
56 array->Elements = elems;
57 array->MaxSize = new_size
69 _EGLArray *array; local
    [all...]
  /external/mesa3d/src/gallium/auxiliary/util/
u_fifo.h 56 void **array = (void**)&fifo[1]; local
63 array[fifo->head] = ptr;
73 void **array = (void**)&fifo[1]; local
81 *ptr = array[fifo->tail];
  /external/okhttp/okhttp-tests/src/test/java/com/squareup/okhttp/
TestUtil.java 32 char[] array = new char[count]; local
33 Arrays.fill(array, c);
34 return new String(array);
  /external/pdfium/core/fpdfapi/parser/
cpdf_object_walker_unittest.cpp 71 auto array = pdfium::MakeUnique<CPDF_Array>(); local
72 array->Add(pdfium::MakeUnique<CPDF_Reference>(nullptr, 0));
73 array->Add(pdfium::MakeUnique<CPDF_Null>());
74 array->Add(pdfium::MakeUnique<CPDF_Stream>(
76 dict->SetFor("3", std::move(array));
90 level_0->SetFor("Array", std::move(level_1));
92 // We have <</Array [ stream( << /Length 0 >>) ]>>
116 // skip other array except root.
122 // 2 objects from child array should be skipped.
  /external/proguard/src/proguard/optimize/evaluation/
SimpleEnumArrayPropagator.java 43 private Value array; field in class:SimpleEnumArrayPropagator
59 // Find the array length of the "int[] $VALUES" field.
62 if (array != null)
64 // Set the array value with the found array length. We can't use
65 // the original array, because its elements might get overwritten.
69 array.referenceValue().arrayLength(
74 array = null;
80 array = StoringInvocationUnit.getFieldValue(programField);
  /external/sfntly/cpp/src/test/
open_type_data_test.cc 31 ByteArrayPtr array = new MemoryByteArray(&(bytes[0]), bytes.size()); local
32 ReadableFontDataPtr data = new ReadableFontData(array);
  /external/skia/src/core/
SkMultiPictureDraw.cpp 65 SkTDArray<DrawData>& array = canvas->getGrContext() ? fGPUDrawData : fThreadSafeDrawData; local
66 array.append()->init(canvas, picture, matrix, paint);

Completed in 598 milliseconds

1 2 3 4 5 6 78 91011>>