Searched defs:c1 (Results 76 - 100 of 649) sorted by relevance

1234567891011>>

/external/libcxx/test/containers/sequences/deque/deque.capacity/
H A Dresize_size_value.pass.cpp43 test(C& c1, int size, int x) argument
46 std::size_t c1_osize = c1.size();
47 c1.resize(size, x);
48 assert(c1.size() == size);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 CI i = c1.begin();
51 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 for (int j = c1_osize; j < c1
62 C c1 = make<C>(N, start); local
[all...]
H A Dshrink_to_fit.pass.cpp43 test(C& c1) argument
45 C s = c1;
46 c1.shrink_to_fit();
47 assert(c1 == s);
55 C c1 = make<C>(N, start); local
56 test(c1);
/external/libcxx/test/containers/sequences/deque/deque.cons/
H A Dassign_size_value.pass.cpp44 test(C& c1, int size, int v) argument
47 std::size_t c1_osize = c1.size();
48 c1.assign(size, v);
49 assert(c1.size() == size);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 for (CI i = c1.begin(); i != c1.end(); ++i)
61 C c1 local
[all...]
/external/libcxx/test/containers/sequences/deque/deque.modifiers/
H A Demplace.pass.cpp46 test(int P, C& c1) argument
50 std::size_t c1_osize = c1.size();
51 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
68 C c1 local
76 C c1 = make<C>(N, start); local
84 C c1 = make<C>(N, start); local
[all...]
H A Demplace_back.pass.cpp46 test(C& c1) argument
49 std::size_t c1_osize = c1.size();
50 c1.emplace_back(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.end();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...]
H A Demplace_front.pass.cpp46 test(C& c1) argument
49 std::size_t c1_osize = c1.size();
50 c1.emplace_front(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...]
H A Dpop_back.pass.cpp43 test(C& c1) argument
46 std::size_t c1_osize = c1.size();
47 c1.pop_back();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 0; j < c1.size(); ++j, ++i)
61 C c1 local
[all...]
H A Dpop_front.pass.cpp43 test(C& c1) argument
46 std::size_t c1_osize = c1.size();
47 c1.pop_front();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 1; j < c1.size(); ++j, ++i)
61 C c1 local
[all...]
H A Dpush_front.pass.cpp43 test(C& c1, int x) argument
46 std::size_t c1_osize = c1.size();
47 c1.push_front(x);
48 assert(c1.size() == c1_osize + 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1,
[all...]
H A Dpush_front_rvalue.pass.cpp46 test(C& c1, int x) argument
49 std::size_t c1_osize = c1.size();
50 c1.push_front(MoveOnly(x));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
64 C c1 = make<C>(N, start); local
65 test(c1,
[all...]
/external/libcxx/test/containers/sequences/deque/deque.special/
H A Dcopy.pass.cpp54 C c1 = make<C>(N, start); local
56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
57 assert(c1 == c2);
58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
59 assert(c1 == c2);
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
61 assert(c1
[all...]
H A Dcopy_backward.pass.cpp53 C c1 = make<C>(N, start); local
55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1
[all...]
H A Dmove.pass.cpp53 C c1 = make<C>(N, start); local
55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
56 assert(c1 == c2);
57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
58 assert(c1 == c2);
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
60 assert(c1
[all...]
H A Dmove_backward.pass.cpp53 C c1 = make<C>(N, start); local
55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1
[all...]
/external/libcxx/test/containers/sequences/list/list.modifiers/
H A Demplace.pass.cpp56 std::list<A> c1; local
58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
80 std::list<A, min_allocator<A>> c1; local
82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
/external/libcxx/test/containers/sequences/vector/vector.modifiers/
H A Demplace.pass.cpp112 std::vector<A> c1; local
114 std::vector<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
145 std::vector<A, min_allocator<A>> c1; local
147 std::vector<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
/external/libcxx/test/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/
H A Dlv_value.pass.cpp25 test(C c1, typename C::difference_type j, argument
29 std::insert_iterator<C> q(c1, c1.begin() + j);
33 assert(c1 == c2);
51 C c1; local
53 c1.push_back(i);
54 C c2 = c1;
56 test(c1, 0, 'a', 'b', 'c', c2);
57 c2 = c1;
59 test(c1,
69 C c1; local
[all...]
/external/mockito/src/org/mockito/internal/creation/
H A DSerializableMockitoMethodProxy.java15 private final Class<?> c1; field in class:SerializableMockitoMethodProxy
24 c1 = (Class<?>) Whitebox.getInternalState(info, "c1");
34 methodProxy = MethodProxy.create(c1, c2, desc, name, superName);
/external/openssl/crypto/
H A Do_str.c105 const unsigned char *c1=v1,*c2=v2; local
108 while(n && (ret=*c1-*c2)==0) n--,c1++,c2++;
/external/pcre/dist/
H A Dpcre_string_utils.c70 pcre_uchar c1; local
75 c1 = *str1++;
77 if (c1 != c2)
78 return ((c1 > c2) << 1) - 1;
89 pcre_uchar c1; local
94 c1 = UCHAR21INC(str1);
96 if (c1 != c2)
97 return ((c1 > c2) << 1) - 1;
109 pcre_uchar c1; local
114 c1
129 pcre_uchar c1; local
159 pcre_uchar c1; local
177 pcre_uchar c1; local
[all...]
/external/skia/samplecode/
H A DSample2PtRadial.cpp34 SkPoint c1 = { 100, 100 }; local
36 SkShader* s = SkGradientShader::CreateTwoPointRadial(c0, r0, c1, r1, colors,
/external/skia/src/utils/
H A DSkCubicInterval.cpp10 static SkScalar eval_cubic(SkScalar c1, SkScalar c2, SkScalar c3, argument
12 return SkScalarMul(SkScalarMul(SkScalarMul(c3, t) + c2, t) + c1, t);
15 static SkScalar find_cubic_t(SkScalar c1, SkScalar c2, SkScalar c3, argument
23 SkScalar x = eval_cubic(c1, c2, c3, t);
/external/valgrind/main/memcheck/tests/
H A Dleak-cycle.c39 struct n *volatile c1, *volatile c2; local
44 c1 = mkcycle();
47 c1 = c2 = 0;
50 c1 = mkcycle();
55 if (c1 < c2)
56 c2->r = c1;
58 c1->r = c2;
60 c1 = c2 = 0;
63 c1 = mkcycle();
66 c1
[all...]
H A Dvarinfo4.c36 typedef struct { short c1; char* c2[3]; } XX; member in struct:__anon33071
47 croak(1 + (char*)(&a[3].xyzzy[x*y].c1));
51 return a[3].xyzzy[x*y].c1;
/external/bison/lib/
H A Dstrverscmp.c65 unsigned char c1, c2; local
98 c1 = *p1++;
101 state = S_N | ((c1 == '0') + (ISDIGIT (c1) != 0));
103 while ((diff = c1 - c2) == 0 && c1 != '\0')
106 c1 = *p1++;
108 state |= (c1 == '0') + (ISDIGIT (c1) != 0);

Completed in 2075 milliseconds

1234567891011>>