HomeSort by relevance Sort by last modified time
    Searched refs:a1 (Results 251 - 275 of 1706) sorted by null

<<11121314151617181920>>

  /packages/apps/QuickSearchBox/tests/src/com/android/quicksearchbox/util/
PerNameExecutorTest.java 44 MockTask a1 = addTask("a", 1); local
49 assertRanNever("step 0", a1, a2, a3, b1);
50 step(); // run a1, b1
51 assertRanOnce("step 1", a1, b1);
54 assertRanOnce("step 2", a1, b1, a2);
57 assertRanOnce("step 3", a1, b1, a2, a3);
59 assertRanOnce("step 4", a1, b1, a2, a3);
63 MockTask a1 = addTask("a", 1); local
67 step(); // run a1, b1
68 assertRanOnce("step 1", a1, b1)
90 MockTask a1 = new MockTask("a", 1); local
    [all...]
  /external/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/
erase_iter_db1.pass.cpp 25 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local
26 std::unordered_map<int, int> l1(a1, a1+3);
erase_iter_iter_db4.pass.cpp 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local
28 std::unordered_map<int, int> l1(a1, a1+3);
  /external/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/
erase_iter_db1.pass.cpp 25 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local
26 std::unordered_multimap<int, int> l1(a1, a1+3);
erase_iter_iter_db4.pass.cpp 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local
28 std::unordered_multimap<int, int> l1(a1, a1+3);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/
erase_iter_db1.pass.cpp 25 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local
26 std::unordered_map<int, int> l1(a1, a1+3);
erase_iter_iter_db4.pass.cpp 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local
28 std::unordered_map<int, int> l1(a1, a1+3);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/
erase_iter_db1.pass.cpp 25 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local
26 std::unordered_multimap<int, int> l1(a1, a1+3);
erase_iter_iter_db4.pass.cpp 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local
28 std::unordered_multimap<int, int> l1(a1, a1+3);
  /bionic/libc/arch-mips/string/
memcpy.S 72 subu t0,a0,a1
87 xor t8,a1,a0
88 andi t8,t8,0x3 # t8 is a0/a1 word-displacement
93 andi a3,a3,0x3 # we need to copy a3 bytes to make a0/a1 aligned
97 LWHI t8,0(a1)
98 addu a1,a1,a3
122 pref 0,0(a1) # bring the first line of src, addr 0
123 pref 0,32(a1) # bring the second line of src, addr 32
124 pref 0,64(a1) # bring the third line of src, addr 6
    [all...]
  /bionic/libc/arch-mips64/string/
memcpy.S 72 subu t0,a0,a1
87 xor t8,a1,a0
88 andi t8,t8,0x3 # t8 is a0/a1 word-displacement
93 andi a3,a3,0x3 # we need to copy a3 bytes to make a0/a1 aligned
97 LWHI t8,0(a1)
98 addu a1,a1,a3
122 pref 0,0(a1) # bring the first line of src, addr 0
123 pref 0,32(a1) # bring the second line of src, addr 32
124 pref 0,64(a1) # bring the third line of src, addr 6
    [all...]
  /external/clang/test/Parser/
cxx-extra-semi.cpp 9 void A1();
32 int a1; member in union:B
  /external/libcxx/test/numerics/numarray/template.slice.array/slice.arr.assign/
valarray.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
  /external/libcxx/test/numerics/numarray/template.slice.array/slice.arr.comp.assign/
addition.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
and.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
divide.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
modulo.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
multiply.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
or.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
shift_left.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
shift_right.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
subtraction.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
xor.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
  /external/libcxx/test/numerics/numarray/template.slice.array/slice.arr.fill/
assign_value.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
22 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
  /external/libcxx/test/numerics/numarray/template.valarray/valarray.cassign/
and_valarray.pass.cpp 23 T a1[] = {1, 2, 3, 4, 5}; local
26 const unsigned N = sizeof(a1)/sizeof(a1[0]);
27 std::valarray<T> v1(a1, N);

Completed in 293 milliseconds

<<11121314151617181920>>