| /external/libpng/contrib/visupng/ |
| VisualPng.dsp | 24 # Begin Project
60 # Begin Special Build Tool
94 # Begin Special Build Tool
102 # Begin Target
106 # Begin Group "Source Files"
109 # Begin Source File
113 # Begin Source File
118 # Begin Group "Header Files"
121 # Begin Source File
125 # Begin Source File
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| find_selectors.h | 64 * @param begin1 Begin iterator of first sequence.
66 * @param begin2 Begin iterator of second sequence.
97 * @param begin1 Begin iterator of first sequence.
99 * @param begin2 Begin iterator of second sequence.
135 * @param begin1 Begin iterator of first sequence.
137 * @param begin2 Begin iterator of second sequence.
154 ForwardIterator begin; member in struct:__gnu_parallel::find_first_of_selector
157 explicit find_first_of_selector(ForwardIterator begin, ForwardIterator end)
158 : begin(begin), end(end) {
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tools.pas | 329 /// begin
407 begin
419 begin
427 begin
434 begin
441 begin
447 begin
452 begin
457 begin
464 begin
[all...] |
| /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/operator/ |
| DefaultSignatureAlgorithmIdentifierFinder.java | 12 // BEGIN android-removed
37 // BEGIN android-removed
44 // BEGIN android-removed
52 // BEGIN android-removed
63 // BEGIN android-removed
69 // BEGIN android-removed
79 // BEGIN android-removed
87 // BEGIN android-removed
93 // BEGIN android-removed
106 // BEGIN android-remove
[all...] |
| /external/stlport/test/unit/ |
| deque_test.cpp | 71 deque<int>::iterator dit = d.begin();
72 deque<int>::const_iterator cdit(d.begin());
90 //Insertion before begin:
91 dit = d.insert(d.begin(), 3);
97 //Insertion after begin:
98 dit = d.insert(d.begin() + 1, 4);
118 //Insertion of several elements before begin
119 d.insert(d.begin(), 2, 7);
124 //Insertion of several elements after begin
126 d.insert(d.begin() + 1, 2, 8)
[all...] |
| alg_test.cpp | 81 int n = count(i.begin(), i.end(), 2);
85 count(i.begin(), i.end(), 2, n);
99 sort(years.begin(), years.end());
111 sort(years.begin(), years.end()); // <-- changed!
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2);
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3);
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4);
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>())
[all...] |
| heap_test.cpp | 78 make_heap(v.begin(), v.end());
81 push_heap(v.begin(), v.end());
83 sort_heap(v.begin(), v.end());
97 make_heap(v.begin(), v.end(), greater<int>());
100 push_heap(v.begin(), v.end(), greater<int>());
102 sort_heap(v.begin(), v.end(), greater<int>());
|
| mismatch_test.cpp | 55 __iota(v1.begin(), v1.end(), 0);
58 pair <IntVec::iterator, IntVec::iterator> result = mismatch(v1.begin(), v1.end(), v2.begin());
63 result = mismatch(v1.begin(), v1.end(), v2.begin());
65 CPPUNIT_ASSERT((result.first - v1.begin())==5);
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| deque_test.cpp | 71 deque<int>::iterator dit = d.begin();
72 deque<int>::const_iterator cdit(d.begin());
90 //Insertion before begin:
91 dit = d.insert(d.begin(), 3);
97 //Insertion after begin:
98 dit = d.insert(d.begin() + 1, 4);
118 //Insertion of several elements before begin
119 d.insert(d.begin(), 2, 7);
124 //Insertion of several elements after begin
126 d.insert(d.begin() + 1, 2, 8)
[all...] |
| alg_test.cpp | 81 int n = count(i.begin(), i.end(), 2);
85 count(i.begin(), i.end(), 2, n);
99 sort(years.begin(), years.end());
111 sort(years.begin(), years.end()); // <-- changed!
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2);
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3);
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4);
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>())
[all...] |
| heap_test.cpp | 78 make_heap(v.begin(), v.end());
81 push_heap(v.begin(), v.end());
83 sort_heap(v.begin(), v.end());
97 make_heap(v.begin(), v.end(), greater<int>());
100 push_heap(v.begin(), v.end(), greater<int>());
102 sort_heap(v.begin(), v.end(), greater<int>());
|
| mismatch_test.cpp | 55 __iota(v1.begin(), v1.end(), 0);
58 pair <IntVec::iterator, IntVec::iterator> result = mismatch(v1.begin(), v1.end(), v2.begin());
63 result = mismatch(v1.begin(), v1.end(), v2.begin());
65 CPPUNIT_ASSERT((result.first - v1.begin())==5);
|
| /ndk/tests/device/test-stlport/unit/ |
| deque_test.cpp | 71 deque<int>::iterator dit = d.begin();
72 deque<int>::const_iterator cdit(d.begin());
90 //Insertion before begin:
91 dit = d.insert(d.begin(), 3);
97 //Insertion after begin:
98 dit = d.insert(d.begin() + 1, 4);
118 //Insertion of several elements before begin
119 d.insert(d.begin(), 2, 7);
124 //Insertion of several elements after begin
126 d.insert(d.begin() + 1, 2, 8)
[all...] |
| alg_test.cpp | 81 int n = count(i.begin(), i.end(), 2);
85 count(i.begin(), i.end(), 2, n);
99 sort(years.begin(), years.end());
111 sort(years.begin(), years.end()); // <-- changed!
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2);
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3);
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4);
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>())
[all...] |
| heap_test.cpp | 78 make_heap(v.begin(), v.end());
81 push_heap(v.begin(), v.end());
83 sort_heap(v.begin(), v.end());
97 make_heap(v.begin(), v.end(), greater<int>());
100 push_heap(v.begin(), v.end(), greater<int>());
102 sort_heap(v.begin(), v.end(), greater<int>());
|
| mismatch_test.cpp | 55 __iota(v1.begin(), v1.end(), 0);
58 pair <IntVec::iterator, IntVec::iterator> result = mismatch(v1.begin(), v1.end(), v2.begin());
63 result = mismatch(v1.begin(), v1.end(), v2.begin());
65 CPPUNIT_ASSERT((result.first - v1.begin())==5);
|
| /external/webkit/Source/WebCore/page/ |
| ContentSecurityPolicy.cpp | 165 void parse(const UChar* begin, const UChar* end);
167 bool parseSource(const UChar* begin, const UChar* end, String& scheme, String& host, int& port, bool& hostHasWildcard, bool& portHasWildcard);
168 bool parseScheme(const UChar* begin, const UChar* end, String& scheme);
169 bool parseHost(const UChar* begin, const UChar* end, String& host, bool& hostHasWildcard);
170 bool parsePort(const UChar* begin, const UChar* end, int& port, bool& portHasWildcard);
200 void CSPSourceList::parse(const UChar* begin, const UChar* end)
202 const UChar* position = begin;
233 bool CSPSourceList::parseSource(const UChar* begin, const UChar* end,
237 if (begin == end)
240 if (equalIgnoringCase("'self'", begin, end - begin))
[all...] |
| /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/operator/bc/ |
| BcUtil.java | 3 // BEGIN android-removed
12 // BEGIN android-removed
18 // BEGIN android-removed
24 // BEGIN android-removed
43 // BEGIN android-removed
65 // BEGIN android-removed
|
| /external/libvpx/libvpx/vpx_ports/ |
| vpx_timer.h | 50 LARGE_INTEGER begin, end; member in struct:vpx_usec_timer
52 struct timeval begin, end;
61 QueryPerformanceCounter(&t->begin);
63 gettimeofday(&t->begin, NULL);
85 diff.QuadPart = t->end.QuadPart - t->begin.QuadPart;
92 timersub(&t->end, &t->begin, &diff);
|
| /frameworks/compile/mclinker/include/mcld/Fragment/ |
| FGNode.h | 59 slot_iterator slot_begin () { return m_Slots.begin(); }
60 const_slot_iterator slot_begin () const { return m_Slots.begin(); }
64 signal_iterator signal_begin () { return m_Signals.begin(); }
65 const_signal_iterator signal_begin () const { return m_Signals.begin(); }
69 frag_iterator frag_begin () { return m_Fragments.begin(); }
70 const_frag_iterator frag_begin () const { return m_Fragments.begin(); }
|
| /frameworks/compile/mclinker/include/mcld/Target/ |
| SymbolEntryMap.h | 51 const_iterator begin() const { return m_Pool.begin(); } function in class:mcld::SymbolEntryMap
52 iterator begin() { return m_Pool.begin(); } function in class:mcld::SymbolEntryMap
68 for (mapping = m_Pool.begin(); mapping != mEnd; ++mapping) {
82 for (mapping = m_Pool.begin(); mapping != mEnd; ++mapping) {
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.partitions/ |
| is_partitioned.pass.cpp | 30 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
36 assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
42 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
48 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
54 assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
55 input_iterator<const int*>(std::begin(ia)),
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/forwardlist/forwardlist.cons/ |
| copy.pass.cpp | 27 C c0(std::begin(t), std::end(t), A(10));
30 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
32 assert(n == std::end(t) - std::begin(t));
42 C c0(std::begin(t), std::end(t), A(10));
45 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
47 assert(n == std::end(t) - std::begin(t));
|
| copy_alloc.pass.cpp | 27 C c0(std::begin(t), std::end(t), A(10));
30 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
32 assert(n == std::end(t) - std::begin(t));
41 C c0(std::begin(t), std::end(t), A(10));
44 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
46 assert(n == std::end(t) - std::begin(t));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.cons/ |
| size_value_alloc.pass.cpp | 24 assert(std::distance(l.begin(), l.end()) == 3);
25 std::list<int>::const_iterator i = l.begin();
35 assert(std::distance(l.begin(), l.end()) == 3);
36 std::list<int>::const_iterator i = l.begin();
46 assert(std::distance(l.begin(), l.end()) == 3);
47 std::list<int>::const_iterator i = l.begin();
|
