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

1 2 3 4 5 6 78 91011>>

  /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/
nearest_neighbor.c 22 const size_t* array,
29 (array[i] < value) ? (value - array[i]) : (array[i] - value);
  /external/deqp/framework/delibs/depool/
dePoolHeap.h 59 DE_DECLARE_POOL_ARRAY(TYPENAME##Array, VALUETYPE); \
63 TYPENAME##Array* array; \
80 heap->array = TYPENAME##Array_create(pool); \
81 if (!heap->array) \
88 return TYPENAME##Array_getNumElements(heap->array); \
93 return TYPENAME##Array_reserve(heap->array, capacity); \
98 TYPENAME##Array_setSize(heap->array, 0); \
103 TYPENAME##Array* array = heap->array;
    [all...]
  /external/guava/guava/src/com/google/common/collect/
ObjectArrays.java 24 import java.lang.reflect.Array;
42 * Returns a new array of the given length with the specified component type.
45 * @param length the length of the new array
47 @GwtIncompatible("Array.newInstance(Class, int)")
50 return (T[]) Array.newInstance(type, length);
54 * Returns a new array of the given length with the same type as a reference
55 * array.
57 * @param reference any array of the desired type
58 * @param length the length of the new array
65 * Returns a new array that contains the concatenated contents of two arrays
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
ObjectArrays.java 40 * Returns a new array of the given length with the same type as a reference
41 * array.
43 * @param reference any array of the desired type
44 * @param length the length of the new array
51 * Returns a new array that prepends {@code element} to {@code array}.
53 * @param element the element to prepend to the front of {@code array}
54 * @param array the array of elements to append
55 * @return an array whose size is one larger than {@code array}, wit
    [all...]
  /art/test/559-bce-ssa/src/
Main.java 19 public static void foo(int[] array, int[] array2, int start, int end) {
21 array[i] = array2[array.length] + 1;
  /cts/tests/tests/media/libaudiojni/
sl-utils.h 62 // overloaded JNI array helper functions (same as in android_media_AudioRecord)
64 jbyte *envGetArrayElements(JNIEnv *env, jbyteArray array, jboolean *isCopy) {
65 return env->GetByteArrayElements(array, isCopy);
69 void envReleaseArrayElements(JNIEnv *env, jbyteArray array, jbyte *elems, jint mode) {
70 env->ReleaseByteArrayElements(array, elems, mode);
74 jshort *envGetArrayElements(JNIEnv *env, jshortArray array, jboolean *isCopy) {
75 return env->GetShortArrayElements(array, isCopy);
79 void envReleaseArrayElements(JNIEnv *env, jshortArray array, jshort *elems, jint mode) {
80 env->ReleaseShortArrayElements(array, elems, mode);
84 jfloat *envGetArrayElements(JNIEnv *env, jfloatArray array, jboolean *isCopy)
    [all...]
  /dalvik/dx/src/com/android/dx/dex/file/
EncodedArrayItem.java 24 * Encoded array of constant values.
30 /** {@code non-null;} the array to represent */
31 private final CstArray array; field in class:EncodedArrayItem
42 * @param array {@code non-null;} array to represent
44 public EncodedArrayItem(CstArray array) {
51 if (array == null) {
52 throw new NullPointerException("array == null");
55 this.array = array;
    [all...]
  /external/compiler-rt/test/asan/TestCases/
vla_loop_overfow.cc 11 char array[len]; // NOLINT local
12 assert(!(reinterpret_cast<uintptr_t>(array) & 31L));
13 array[index + i] = 0;
  /external/icu/icu4c/source/layoutex/
LXUtilities.h 22 static le_int32 search(le_int32 value, const le_int32 array[], le_int32 count);
23 static void reverse(le_int32 array[], le_int32 count);
24 static void reverse(float array[], le_int32 count);
  /external/icu/icu4c/source/samples/numfmt/
util.h 15 #define UPRV_LENGTHOF(array) (int32_t)(sizeof(array)/sizeof((array)[0]))
  /external/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/
nth_element.pass.cpp 29 int* array = new int[N];
31 array[i] = i;
32 std::shuffle(array, array+N, randomness);
33 std::nth_element(array, array+M, array+N);
34 assert(array[M] == M);
35 std::nth_element(array, array+N, array+N); // begin, end, en
    [all...]
  /external/libcxx/test/std/containers/sequences/array/
empty.pass.cpp 10 // <array>
12 // class array
16 #include <array>
25 typedef std::array<int, 2> C;
31 typedef std::array<int, 0> C;
max_size.pass.cpp 10 // <array>
12 // class array
16 #include <array>
25 typedef std::array<int, 2> C;
31 typedef std::array<int, 0> C;
  /external/pdfium/core/fxcrt/
fx_random_unittest.cpp 7 #include <array>
18 std::set<std::array<uint32_t, 16>> seen;
19 std::array<uint32_t, 16> current;
  /external/vboot_reference/tests/
cgptlib_test.h 19 #define ARRAY_SIZE(array) (sizeof(array) / sizeof(array[0]))
  /frameworks/base/core/tests/utiltests/src/android/util/
MemoryIntArrayTest.java 44 MemoryIntArray array = null; local
46 array = new MemoryIntArray(3);
47 assertEquals("size must be three", 3, array.size());
49 IoUtils.closeQuietly(array);
55 MemoryIntArray array = null; local
57 array = new MemoryIntArray(3);
59 array.set(0, 1);
60 array.set(1, 2);
61 array.set(2, 3);
63 assertEquals("First element should be 1", 1, array.get(0))
73 MemoryIntArray array = null; local
84 MemoryIntArray array = null; local
126 MemoryIntArray array = null; local
169 MemoryIntArray array = null; local
207 MemoryIntArray array = null; local
252 MemoryIntArray array = new MemoryIntArray(1); local
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.nth.element/
nth_element.pass.cpp 29 int* array = new int[N];
31 array[i] = i;
32 std::shuffle(array, array+N, randomness);
33 std::nth_element(array, array+M, array+N);
34 assert(array[M] == M);
35 std::nth_element(array, array+N, array+N); // begin, end, en
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/array/array.cons/
default.pass.cpp 10 // <array>
12 // array();
14 #include <array>
21 typedef std::array<T, 3> C;
27 typedef std::array<T, 0> C;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/array/array.data/
data.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;
  /toolchain/binutils/binutils-2.27/gold/testsuite/
odr_violation1.cc 11 void SortAscending(int array[], int size) {
12 std::sort(array, array + size, Ordering());
odr_violation2.cc 18 void SortDescending(int array[], int size) {
19 std::sort(array, array + size, Ordering());
  /external/python/cpython3/Lib/test/
test_array.py 14 import array
15 from array import _array_reconstructor as array_reconstructor
19 # of the array module under test
25 sizeof_wchar = array.array('u').itemsize
28 class ArraySubclass(array.array):
31 class ArraySubclassWithKwargs(array.array):
33 array.array.__init__(self
    [all...]
  /external/skia/tests/
TemplatesTest.cpp 13 SkAutoSTMalloc<1, int> array; local
16 array[0] = 1;
17 REPORTER_ASSERT(reporter, array[0] == 1);
20 array.realloc(1);
22 array[0] = 1;
23 REPORTER_ASSERT(reporter, array[0] == 1);
26 array.realloc(2);
27 REPORTER_ASSERT(reporter, array[0] == 1);
30 array.realloc(1);
31 REPORTER_ASSERT(reporter, array[0] == 1)
    [all...]
  /external/skqp/tests/
TemplatesTest.cpp 13 SkAutoSTMalloc<1, int> array; local
16 array[0] = 1;
17 REPORTER_ASSERT(reporter, array[0] == 1);
20 array.realloc(1);
22 array[0] = 1;
23 REPORTER_ASSERT(reporter, array[0] == 1);
26 array.realloc(2);
27 REPORTER_ASSERT(reporter, array[0] == 1);
30 array.realloc(1);
31 REPORTER_ASSERT(reporter, array[0] == 1)
    [all...]
  /external/protobuf/java/core/src/main/java/com/google/protobuf/
BooleanArrayList.java 40 * An implementation of {@link BooleanList} on top of a primitive array.
59 private boolean[] array; field in class:BooleanArrayList
62 * The size of the list distinct from the length of the array. That is, it is the number of
77 private BooleanArrayList(boolean[] array, int size) {
78 this.array = array;
95 final boolean[] arr = other.array;
97 if (array[i] != arr[i]) {
109 result = (31 * result) + Internal.hashBoolean(array[i]);
119 return new BooleanArrayList(Arrays.copyOf(array, capacity), size)
    [all...]

Completed in 1238 milliseconds

1 2 3 4 5 6 78 91011>>