HomeSort by relevance Sort by last modified time
    Searched full:array (Results 26 - 50 of 22317) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/eigen/doc/snippets/
MatrixBase_array.cpp 2 v.array() += 3;
3 v.array() -= 2;
Tutorial_Map_rowmajor.cpp 1 int array[8]; variable
2 for(int i = 0; i < 8; ++i) array[i] = i;
3 cout << "Column-major:\n" << Map<Matrix<int,2,4> >(array) << endl;
4 cout << "Row-major:\n" << Map<Matrix<int,2,4,RowMajor> >(array) << endl;
6 Map<Matrix<int,2,4>, Unaligned, Stride<1,4> >(array) << endl;
  /external/icu/icu4c/source/samples/layout/
arraymem.h 12 #define ARRAY_SIZE(array) (sizeof array / sizeof array[0])
18 #define DELETE_ARRAY(array) free((void *) (array))
20 #define GROW_ARRAY(array,newSize) realloc((void *) (array), (newSize) * sizeof (array)[0])
  /external/robolectric/src/test/resources/res/values/
string_arrays.xml 3 <string-array name="more_items">
6 </string-array>
8 <string-array name="greetings">
11 </string-array>
13 <string-array name="alertDialogTestItems">
16 </string-array>
18 <string-array name="emailAddressTypes">
21 </string-array>
  /external/chromium_org/v8/test/mjsunit/
array-push7.js 9 function push_wrapper(array, value) {
10 array.push(value);
12 function pop_wrapper(array) {
13 return array.pop();
17 // Array.push() and Array.pop() both from optimized and un-optimized code.
18 var array = []; variable
24 Object.observe(array, somethingChanged);
25 push_wrapper(array, 1);
27 assertEquals(1, array.length)
    [all...]
array-push8.js 7 function push_wrapper(array, value) {
8 array.push(value);
10 function pop_wrapper(array) {
11 return array.pop();
16 var array = [2, 2]; variable
17 Object.freeze(array);
19 try { push_wrapper(array, 1); } catch (e) {}
20 assertEquals(2, array.length);
21 try { push_wrapper(array, 1); } catch (e) {}
22 assertEquals(2, array.length)
    [all...]
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...]
  /external/proguard/src/proguard/util/
ArrayUtil.java 23 import java.lang.reflect.Array;
33 * @param array1 the first array.
34 * @param array2 the second array.
54 * @param array1 the first array.
55 * @param array2 the second array.
75 * @param array1 the first array.
76 * @param array2 the second array.
96 * @param array1 the first array.
97 * @param array2 the second array.
116 * Returns a hash code for the elements of the given array
    [all...]
  /frameworks/base/core/java/com/android/internal/util/
GrowingArrayUtils.java 21 * arrays. Common array operations are implemented for efficient use in dynamic containers.
23 * All methods in this class assume that the length of an array is equivalent to its capacity and
24 * NOT the number of elements in the array. The current size of the array is always passed in as a
32 * Appends an element to the end of the array, growing the array if there is no more room.
33 * @param array The array to which to append the element. This must NOT be null.
34 * @param currentSize The number of elements in the array. Must be less than or equal to
35 * array.length
    [all...]
  /frameworks/support/v4/jellybean/android/support/v4/app/
BundleUtil.java 13 * Get an array of Bundle objects from a parcelable array field in a bundle.
14 * Update the bundle to have a typed array so fetches in the future don't need
15 * to do an array copy.
18 Parcelable[] array = bundle.getParcelableArray(key); local
19 if (array instanceof Bundle[] || array == null) {
20 return (Bundle[]) array;
22 Bundle[] typedArray = Arrays.copyOf(array, array.length
    [all...]
  /libcore/luni/src/test/java/libcore/java/util/
OldAndroidArrayListTest.java 30 ArrayList array = new ArrayList(); local
31 assertEquals(0, array.size());
32 assertTrue(array.isEmpty());
34 array.add(new Integer(0));
35 array.add(0, new Integer(1));
36 array.add(1, new Integer(2));
37 array.add(new Integer(3));
38 array.add(new Integer(1));
40 assertEquals(5, array.size());
41 assertFalse(array.isEmpty())
    [all...]
  /external/stlport/test/unit/
bnegate_test.cpp 32 int array [4] = { 4, 9, 7, 1 }; local
34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
35 CPPUNIT_ASSERT(array[0]==1);
36 CPPUNIT_ASSERT(array[1]==4);
37 CPPUNIT_ASSERT(array[2]==7);
38 CPPUNIT_ASSERT(array[3]==9);
42 int array [4] = { 4, 9, 7, 1 }; local
43 sort(array, array + 4, not2(greater<int>()))
    [all...]
greater_test.cpp 33 int array[4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, greater<int>() );
36 CPPUNIT_ASSERT(array[0]==4);
37 CPPUNIT_ASSERT(array[1]==3);
38 CPPUNIT_ASSERT(array[2]==2);
39 CPPUNIT_ASSERT(array[3]==1);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array + 4, greater_equal<int>())
    [all...]
less_test.cpp 33 int array [4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, less<int>());
36 CPPUNIT_ASSERT(array[0]==1);
37 CPPUNIT_ASSERT(array[1]==2);
38 CPPUNIT_ASSERT(array[2]==3);
39 CPPUNIT_ASSERT(array[3]==4);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array + 4, less_equal<int>())
    [all...]
  /ndk/tests/device/test-gnustl-full/unit/
bnegate_test.cpp 32 int array [4] = { 4, 9, 7, 1 }; local
34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
35 CPPUNIT_ASSERT(array[0]==1);
36 CPPUNIT_ASSERT(array[1]==4);
37 CPPUNIT_ASSERT(array[2]==7);
38 CPPUNIT_ASSERT(array[3]==9);
42 int array [4] = { 4, 9, 7, 1 }; local
43 sort(array, array + 4, not2(greater<int>()))
    [all...]
greater_test.cpp 33 int array[4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, greater<int>() );
36 CPPUNIT_ASSERT(array[0]==4);
37 CPPUNIT_ASSERT(array[1]==3);
38 CPPUNIT_ASSERT(array[2]==2);
39 CPPUNIT_ASSERT(array[3]==1);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array + 4, greater_equal<int>())
    [all...]
less_test.cpp 33 int array [4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, less<int>());
36 CPPUNIT_ASSERT(array[0]==1);
37 CPPUNIT_ASSERT(array[1]==2);
38 CPPUNIT_ASSERT(array[2]==3);
39 CPPUNIT_ASSERT(array[3]==4);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array + 4, less_equal<int>())
    [all...]
  /ndk/tests/device/test-stlport/unit/
bnegate_test.cpp 32 int array [4] = { 4, 9, 7, 1 }; local
34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
35 CPPUNIT_ASSERT(array[0]==1);
36 CPPUNIT_ASSERT(array[1]==4);
37 CPPUNIT_ASSERT(array[2]==7);
38 CPPUNIT_ASSERT(array[3]==9);
42 int array [4] = { 4, 9, 7, 1 }; local
43 sort(array, array + 4, not2(greater<int>()))
    [all...]
greater_test.cpp 33 int array[4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, greater<int>() );
36 CPPUNIT_ASSERT(array[0]==4);
37 CPPUNIT_ASSERT(array[1]==3);
38 CPPUNIT_ASSERT(array[2]==2);
39 CPPUNIT_ASSERT(array[3]==1);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array + 4, greater_equal<int>())
    [all...]
less_test.cpp 33 int array [4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, less<int>());
36 CPPUNIT_ASSERT(array[0]==1);
37 CPPUNIT_ASSERT(array[1]==2);
38 CPPUNIT_ASSERT(array[2]==3);
39 CPPUNIT_ASSERT(array[3]==4);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array + 4, less_equal<int>())
    [all...]
  /libcore/luni/src/test/java/libcore/java/lang/reflect/
ArrayTest.java 19 import java.lang.reflect.Array;
45 assertEquals(booleans[0], Array.getBoolean(booleans, 0));
46 try { Array.getBoolean(bytes, 0); fail(); } catch (IllegalArgumentException expected) {}
47 try { Array.getBoolean(chars, 0); fail(); } catch (IllegalArgumentException expected) {}
48 try { Array.getBoolean(doubles, 0); fail(); } catch (IllegalArgumentException expected) {}
49 try { Array.getBoolean(floats, 0); fail(); } catch (IllegalArgumentException expected) {}
50 try { Array.getBoolean(ints, 0); fail(); } catch (IllegalArgumentException expected) {}
51 try { Array.getBoolean(longs, 0); fail(); } catch (IllegalArgumentException expected) {}
52 try { Array.getBoolean(shorts, 0); fail(); } catch (IllegalArgumentException expected) {}
53 try { Array.getBoolean(null, 0); fail(); } catch (NullPointerException expected) {
    [all...]
  /libcore/luni/src/main/java/java/lang/reflect/
Array.java 38 public final class Array {
39 private Array() {
43 throw new IllegalArgumentException("Not an array: " + o.getClass());
47 throw new IllegalArgumentException("Array has incompatible type: " + o.getClass());
50 private static RuntimeException badArray(Object array) {
51 if (array == null) {
52 throw new NullPointerException("array == null");
53 } else if (!array.getClass().isArray()) {
54 throw notAnArray(array);
56 throw incompatibleType(array);
    [all...]
  /external/chromium_org/chrome/app/
app-Info.plist 10 <array>
13 <array>
15 </array>
19 <array>
21 </array>
25 <array>
27 </array>
33 <array>
36 </array>
40 <array>
    [all...]
  /external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/
stable_partition.pass.cpp 43 P array[] = local
56 const unsigned size = sizeof(array)/sizeof(array[0]);
57 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first());
58 assert(base(r) == array + 4);
59 assert(array[0] == P(1, 1));
60 assert(array[1] == P(1, 2));
61 assert(array[2] == P(3, 1));
62 assert(array[3] == P(3, 2))
72 P array[] = local
112 P array[] = local
141 P array[] = local
170 P array[] = local
199 P array[] = local
228 P array[] = local
257 P array[] = local
299 std::unique_ptr<int> array[size]; local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/
stable_partition.pass.cpp 43 P array[] = local
56 const unsigned size = sizeof(array)/sizeof(array[0]);
57 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first());
58 assert(base(r) == array + 4);
59 assert(array[0] == P(1, 1));
60 assert(array[1] == P(1, 2));
61 assert(array[2] == P(3, 1));
62 assert(array[3] == P(3, 2))
72 P array[] = local
112 P array[] = local
141 P array[] = local
170 P array[] = local
199 P array[] = local
228 P array[] = local
257 P array[] = local
299 std::unique_ptr<int> array[size]; local
    [all...]

Completed in 706 milliseconds

12 3 4 5 6 7 8 91011>>