HomeSort by relevance Sort by last modified time
    Searched defs:ab (Results 1 - 25 of 202) sorted by null

1 2 3 4 5 6 7 8 9

  /external/compiler-rt/test/asan/TestCases/Helpers/
initialization-nobug-extra.cc 3 static int ab = getAB(); variable
  /external/libcxx/test/std/containers/sequences/deque/deque.cons/
copy_alloc.pass.cpp 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]);
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3))
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
    [all...]
move_alloc.pass.cpp 26 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
27 int* an = ab + sizeof(ab)/sizeof(ab[0]);
30 for (int* p = ab; p < an; ++p)
33 for (int* p = ab; p < an; ++p)
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
42 int* an = ab + sizeof(ab)/sizeof(ab[0])
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
    [all...]
move_assign.pass.cpp 26 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
27 int* an = ab + sizeof(ab)/sizeof(ab[0]);
30 for (int* p = ab; p < an; ++p)
33 for (int* p = ab; p < an; ++p)
42 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
43 int* an = ab + sizeof(ab)/sizeof(ab[0])
58 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
    [all...]
copy.pass.cpp 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int>(ab, an));
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]);
52 test(std::deque<int, min_allocator<int>>(ab, an))
    [all...]
move.pass.cpp 26 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
27 int* an = ab + sizeof(ab)/sizeof(ab[0]);
30 for (int* p = ab; p < an; ++p)
33 for (int* p = ab; p < an; ++p)
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
42 int* an = ab + sizeof(ab)/sizeof(ab[0])
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
    [all...]
op_equal.pass.cpp 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]);
33 test(std::deque<int>(ab, an));
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]);
53 test(std::deque<int, min_allocator<int>>(ab, an))
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/
copy_alloc.pass.cpp 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]);
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3))
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
    [all...]
move_alloc.pass.cpp 26 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
27 int* an = ab + sizeof(ab)/sizeof(ab[0]);
30 for (int* p = ab; p < an; ++p)
33 for (int* p = ab; p < an; ++p)
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
42 int* an = ab + sizeof(ab)/sizeof(ab[0])
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
    [all...]
move_assign.pass.cpp 26 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
27 int* an = ab + sizeof(ab)/sizeof(ab[0]);
30 for (int* p = ab; p < an; ++p)
33 for (int* p = ab; p < an; ++p)
42 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
43 int* an = ab + sizeof(ab)/sizeof(ab[0])
58 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
    [all...]
copy.pass.cpp 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int>(ab, an));
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]);
52 test(std::deque<int, min_allocator<int>>(ab, an))
    [all...]
move.pass.cpp 26 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
27 int* an = ab + sizeof(ab)/sizeof(ab[0]);
30 for (int* p = ab; p < an; ++p)
33 for (int* p = ab; p < an; ++p)
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
42 int* an = ab + sizeof(ab)/sizeof(ab[0])
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
    [all...]
op_equal.pass.cpp 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]);
33 test(std::deque<int>(ab, an));
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]);
53 test(std::deque<int, min_allocator<int>>(ab, an))
    [all...]
iter_iter_alloc.pass.cpp 40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[0]);
42 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3));
43 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4));
44 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5));
45 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6));
47 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>());
48 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>())
    [all...]
iter_iter.pass.cpp 53 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
54 int* an = ab + sizeof(ab)/sizeof(ab[0]);
55 test(input_iterator<const int*>(ab), input_iterator<const int*>(an));
56 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an));
57 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an));
58 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an));
59 test<limited_allocator<int, 4096> >(ab, an);
61 test<min_allocator<int> >(ab, an)
    [all...]
  /external/pcre/dist2/src/
pcre2_valid_utf.c 136 register uint32_t ab, d; local
155 ab = PRIV(utf8_table4)[c & 0x3f]; /* Number of additional bytes (1-5) */
156 if (length < ab) /* Missing bytes */
159 switch(ab - length)
168 length -= ab; /* Length remaining */
182 switch (ab)
310 if (ab > 3)
312 *erroroffset = (int)(p - string) - ab;
313 return (ab == 4)? PCRE2_ERROR_UTF8_ERR11 : PCRE2_ERROR_UTF8_ERR12;
  /toolchain/binutils/binutils-2.27/ld/testsuite/ld-srec/
sr1.c 9 static char ab[] = "This is a string constant"; variable
17 fn1 (ab);
  /external/owasp/sanitizer/src/main/org/owasp/html/
PolicyFactory.java 178 ImmutableMap.Builder<String, AttributePolicy> ab = ImmutableMap.builder(); local
182 ab.put(
191 ab.put(attrName, e.getValue());
194 allGlobalAttrPolicies = ab.build();
  /dalvik/dx/tests/119-merge-conflict/com/android/dx/merge/
MergeConflictTest.java 31 Dex ab = new DexMerger(new Dex[]{a, b}, CollisionPolicy.FAIL).merge(); local
33 // a and ab overlap; this should fail
34 DexMerger dexMerger = new DexMerger(new Dex[]{a, ab}, CollisionPolicy.FAIL);
  /developers/build/prebuilts/gradle/ActionBarCompat-Styled/Application/src/main/java/com/example/android/actionbarcompat/styled/
MainActivity.java 46 ActionBar ab = getSupportActionBar(); local
47 ab.setNavigationMode(ActionBar.NAVIGATION_MODE_TABS);
50 ab.addTab(ab.newTab().setText("Tab 1").setTabListener(this));
51 ab.addTab(ab.newTab().setText("Tab 2").setTabListener(this));
52 ab.addTab(ab.newTab().setText("Tab 3").setTabListener(this));
  /developers/samples/android/ui/actionbarcompat/ActionBarCompat-Styled/Application/src/main/java/com/example/android/actionbarcompat/styled/
MainActivity.java 46 ActionBar ab = getSupportActionBar(); local
47 ab.setNavigationMode(ActionBar.NAVIGATION_MODE_TABS);
50 ab.addTab(ab.newTab().setText("Tab 1").setTabListener(this));
51 ab.addTab(ab.newTab().setText("Tab 2").setTabListener(this));
52 ab.addTab(ab.newTab().setText("Tab 3").setTabListener(this));
  /development/samples/browseable/ActionBarCompat-Styled/src/com.example.android.actionbarcompat.styled/
MainActivity.java 46 ActionBar ab = getSupportActionBar(); local
47 ab.setNavigationMode(ActionBar.NAVIGATION_MODE_TABS);
50 ab.addTab(ab.newTab().setText("Tab 1").setTabListener(this));
51 ab.addTab(ab.newTab().setText("Tab 2").setTabListener(this));
52 ab.addTab(ab.newTab().setText("Tab 3").setTabListener(this));
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
GLVMultiplier.java 31 BigInteger[] ab = glvEndomorphism.decomposeScalar(k.mod(n)); local
32 BigInteger a = ab[0], b = ab[1];
  /external/clang/test/Sema/
decl-in-prototype.c 23 struct ab { // expected-note {{previous definition is here}} expected-note {{previous definition is here}} struct in struct:aA
28 int f5(struct aA { struct ab { int j; } b; struct ab { char glorx; } glorx; } *); // expected-warning {{declaration of 'struct aA' will not be visible}} expected-warning {{redefinition of 'ab' will not be visible}} expected-warning {{redefinition of 'ab' will not be visible}}
string-plus-char.c 3 struct AB{const char *a; const char*b;};
5 const char *foo(const struct AB *ab) {
6 return ab->a + 'b'; // expected-warning {{adding 'char' to a string pointer does not append to the string}} expected-note {{use array indexing to silence this warning}}
23 struct AB ab; local
24 constStr = foo(&ab) + 'c'; // expected-warning {{adding 'char' to a string pointer does not append to the string}} expected-note {{use array indexing to silence this warning}}

Completed in 266 milliseconds

1 2 3 4 5 6 7 8 9