| /external/guava/guava/src/com/google/common/primitives/ |
| Booleans.java | 74 * {@code array}.
76 * <p><b>Note:</b> consider representing the array as a {@link
77 * BitSet} instead, replacing {@code Booleans.contains(array, true)}
78 * with {@code !bitSet.isEmpty()} and {@code Booleans.contains(array, false)}
81 * @param array an array of {@code boolean} values, possibly empty
83 * @return {@code true} if {@code array[i] == target} for some value of {@code
86 public static boolean contains(boolean[] array, boolean target) {
87 for (boolean value : array) {
97 * {@code array}
348 final boolean[] array; field in class:Booleans.BooleanArrayAsList
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| array-shift.js | 28 // Check that shifting array of holes keeps it as array of holes
30 var array = new Array(10);
31 array.shift();
32 assertFalse(0 in array);
35 // Now check the case with array of holes and some elements on prototype.
38 var array = new Array(len);
39 Array.prototype[3] = "@3"
[all...] |
| array-join.js | 28 // Test that array join calls toString on subarrays.
46 // Replace array.prototype.toString.
47 var oldToString = Array.prototype.toString;
48 Array.prototype.toString = function() { return "array"; };
50 assertEquals('array*3*4*array*array', a.join('*'));
51 assertEquals('array**3**4**array**array', a.join('**'))
[all...] |
| /cts/tests/tests/renderscript/src/android/renderscript/cts/ |
| RSUtils.java | 30 public static void genRandom(long seed, int factor, int offset, float array[]) {
32 for (int i = 0; i < array.length; i++) {
33 array[i] = r.nextFloat() * factor + offset;
37 public static void genRandom(long seed, int factor, int offset, float array[],
40 for (int i = 0; i < array.length / stride; i++) {
43 array[i * stride + j] = 0;
45 array[i * stride + j] = r.nextFloat() * factor + offset;
50 public static void genRandom(long seed, int max, int factor, int offset, int array[]) {
52 for (int i = 0; i < array.length; i++) {
53 array[i] = (r.nextInt(max) * factor + offset)
[all...] |
| /cts/tests/tests/rscpp/src/android/cts/rscpp/ |
| RSUtils.java | 30 public static void genRandom(long seed, int factor, int offset, float array[]) {
32 for (int i = 0; i < array.length; i++) {
33 array[i] = r.nextFloat() * factor + offset;
37 public static void genRandom(long seed, int factor, int offset, float array[],
40 for (int i = 0; i < array.length / stride; i++) {
43 array[i * stride + j] = 0;
45 array[i * stride + j] = r.nextFloat() * factor + offset;
50 public static void genRandom(long seed, int max, int factor, int offset, int array[]) {
52 for (int i = 0; i < array.length; i++) {
53 array[i] = (r.nextInt(max) * factor + offset)
[all...] |
| /external/smack/src/org/xbill/DNS/ |
| DNSOutput.java | 14 private byte [] array; field in class:DNSOutput
24 array = new byte[size];
57 if (array.length - pos >= n) {
60 int newsize = array.length * 2;
65 System.arraycopy(array, 0, newarray, 0, pos);
66 array = newarray;
112 array[pos++] = (byte)(val & 0xFF);
123 array[pos++] = (byte)((val >>> 8) & 0xFF);
124 array[pos++] = (byte)(val & 0xFF);
138 array[where++] = (byte)((val >>> 8) & 0xFF)
[all...] |
| /frameworks/base/core/tests/coretests/src/android/util/ |
| LongSparseLongArrayTest.java | 33 final LongSparseLongArray array = new LongSparseLongArray(5); local
36 array.put(value, value);
40 assertEquals(value, array.get(value, -1));
41 assertEquals(-1, array.get(-value, -1));
46 final LongSparseLongArray array = new LongSparseLongArray(5); local
49 array.put(value, value);
53 assertEquals(value, array.get(value, -1));
54 assertEquals(-1, array.get(-value, -1));
59 final LongSparseLongArray array = new LongSparseLongArray(5); local
62 array.put(value, value)
78 final LongSparseLongArray array = new LongSparseLongArray(r.nextInt(128)); local
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/animation/ |
| CompactQuaternionArray.java | 46 * creates a compact Quaternion array
52 * creates a compact Quaternion array
53 * @param dataArray the data array
54 * @param index the indices array
74 out.write(array, "array", null);
81 array = in.readFloatArray("array", null);
88 array[j] = store.getX();
89 array[j + 1] = store.getY();
[all...] |
| /cts/tests/tests/jni/src/android/jni/cts/ |
| JniInstanceTest.java | 115 short[] array = target.returnShortArray(); local
116 assertSame(short[].class, array.getClass());
117 assertEquals(3, array.length);
118 assertEquals(10, array[0]);
119 assertEquals(20, array[1]);
120 assertEquals(30, array[2]);
127 String[] array = target.returnStringArray(); local
128 assertSame(String[].class, array.getClass());
129 assertEquals(100, array.length);
130 assertEquals("blort", array[0])
[all...] |
| /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/file/ |
| DynamicArray.java | 37 * An array that can be dynamically modified/
40 * the type of stored data in the array
44 /** An array object that holds the required data. */
45 private T[] array;
field in class:DynamicArray
54 * Constructor. Builds an empty array of the specified sizes.
70 this.array = (T[]) new Object[totalSize];
74 * Constructor. Builds an empty array of the specified sizes.
92 this.array = data;
108 return array[position];
112 * This method returns a value on the specified position in multidimensional array. Be careful not to exceed the
[all...] |
| /external/v8/test/mjsunit/ |
| array-unshift.js | 28 // Check that unshifting array of holes keeps the original array
29 // as array of holes
31 var array = new Array(10);
32 assertEquals(13, array.unshift('1st', '2ns', '3rd'));
33 assertTrue(0 in array);
34 assertTrue(1 in array);
35 assertTrue(2 in array);
36 assertFalse(3 in array);
[all...] |
| array-join.js | 28 // Test that array join calls toString on subarrays.
46 // Replace array.prototype.toString.
47 var oldToString = Array.prototype.toString;
48 Array.prototype.toString = function() { return "array"; };
50 assertEquals('array*3*4*array*array', a.join('*'));
51 assertEquals('array**3**4**array**array', a.join('**'))
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/gl/ |
| GrGLVertexArray.cpp | 23 AttribArrayState* array = &fAttribArrayStates[index]; local
24 if (!array->fEnableIsValid || !array->fEnabled) {
26 array->fEnableIsValid = true;
27 array->fEnabled = true;
29 if (!array->fAttribPointerIsValid ||
30 array->fVertexBufferID != buffer->bufferID() ||
31 array->fSize != size ||
32 array->fNormalized != normalized ||
33 array->fStride != stride |
[all...] |
| /external/skia/src/gpu/gl/ |
| GrGLVertexArray.cpp | 23 AttribArrayState* array = &fAttribArrayStates[index]; local
24 if (!array->fEnableIsValid || !array->fEnabled) {
26 array->fEnableIsValid = true;
27 array->fEnabled = true;
29 if (!array->fAttribPointerIsValid ||
30 array->fVertexBufferID != buffer->bufferID() ||
31 array->fSize != size ||
32 array->fNormalized != normalized ||
33 array->fStride != stride |
[all...] |
| /external/chromium_org/v8/test/webkit/ |
| sparse-array.js | 25 'This tests some sparse array operations.'
28 var array = [ ]; variable
30 array[50000] = 100;
32 shouldBe('array[0]', 'undefined');
33 shouldBe('array[49999]', 'undefined');
34 shouldBe('array[50000]', '100');
35 shouldBe('array[50001]', 'undefined');
36 array[0]++;
37 shouldBe('array[0]', 'NaN');
38 shouldBe('array[49999]', 'undefined')
[all...] |
| /external/ceres-solver/internal/ceres/ |
| evaluator_test_utils.cc | 56 EXPECT_TRUE((actual_residuals_vector.array() ==
57 expected_residuals_vector.array()).all())
68 EXPECT_TRUE((actual_gradient_vector.array() ==
69 expected_gradient_vector.array()).all())
81 EXPECT_TRUE((actual_jacobian_matrix.array() ==
82 expected_jacobian_matrix.array()).all())
|
| /external/chromium_org/third_party/WebKit/Source/modules/webaudio/ |
| AnalyserNode.h | 64 void getFloatFrequencyData(Float32Array* array) { m_analyser.getFloatFrequencyData(array); }
65 void getByteFrequencyData(Uint8Array* array) { m_analyser.getByteFrequencyData(array); }
66 void getByteTimeDomainData(Uint8Array* array) { m_analyser.getByteTimeDomainData(array); }
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_common_test.cc | 20 static bool IsSorted(const uptr *array, uptr n) {
22 if (array[i] < array[i - 1]) return false;
28 uptr array[100]; local
32 array[i] = i;
34 SortArray(array, n);
35 EXPECT_TRUE(IsSorted(array, n));
38 array[i] = n - 1 - i;
40 SortArray(array, n);
41 EXPECT_TRUE(IsSorted(array, n))
[all...] |
| /external/eigen/test/ |
| first_aligned.cpp | 13 void test_first_aligned_helper(Scalar *array, int size)
16 VERIFY(((size_t(array) + sizeof(Scalar) * internal::first_aligned(array, size)) % packet_size) == 0);
20 void test_none_aligned_helper(Scalar *array, int size)
22 EIGEN_UNUSED_VARIABLE(array);
24 VERIFY(internal::packet_traits<Scalar>::size == 1 || internal::first_aligned(array, size) == size);
|
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| EncodedArrayItem.java | 33 * Encoded array of constant values.
39 /** {@code non-null;} the array to represent */
40 private final CstArray array; field in class:EncodedArrayItem
51 * @param array {@code non-null;} array to represent
53 public EncodedArrayItem(CstArray array) {
60 if (array == null) {
61 throw new NullPointerException("array == null");
64 this.array = array;
[all...] |
| /external/clang/test/CodeGenCXX/ |
| array-construction.cpp | 26 xpto array[2][3][4]; local
30 printf("array[%d][%d][%d] = {%d, %f}\n",
31 h, i, j, array[h][i][j].i, array[h][i][j].f);
|
| /external/compiler-rt/lib/asan/lit_tests/TestCases/ |
| asan-symbolize-sanity-test.cc | 28 int *array = (int*)malloc(40); local
29 inc2(array, 1);
30 inc2(array, -1); // BOOM
|
| /external/eigen/doc/examples/ |
| Tutorial_ArrayClass_interop.cpp | 18 result = (m.array() + 4).matrix() * m;
20 result = (m.array() * n.array()).matrix() * m;
|
| /external/valgrind/main/drd/tests/ |
| pth_barrier.c | 29 int8_t* array; member in struct:threadinfo
45 /** Single thread, which touches p->iterations elements of array p->array.
46 * Each modification of an element of p->array is a data race. */
50 int8_t* const array = p->array; local
59 pthread_self(), i + 1, &array[i]);
60 array[i] = i;
73 int8_t* array; local
76 array = malloc(iterations * sizeof(array[0]))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/array/array.fill/ |
| fill.pass.cpp | 10 // <array>
14 #include <array>
21 typedef std::array<T, 3> C;
31 typedef std::array<T, 0> C;
|
