| /external/webkit/Source/JavaScriptCore/wtf/ |
| Vector.h | 77 static void destruct(T* begin, T* end)
79 for (T* cur = begin; cur != end; ++cur)
96 static void initialize(T* begin, T* end)
98 for (T* cur = begin; cur != end; ++cur)
106 static void initialize(T* begin, T* end)
108 memset(begin, 0, reinterpret_cast<char*>(end) - reinterpret_cast<char*>(begin));
237 static void destruct(T* begin, T* end)
239 VectorDestructor<VectorTraits<T>::needsDestruction, T>::destruct(begin, end);
242 static void initialize(T* begin, T* end
[all...] |
| /external/astl/tests/ |
| test_set.cpp | 49 EXPECT_TRUE(s.begin() == s.end());
63 // begin should point to the element inserted.
64 EXPECT_TRUE(res.first == s.begin());
65 EXPECT_TRUE(s.end() != s.begin());
68 EXPECT_TRUE(*(s.begin()) == 10);
102 // begin should point to the element inserted.
103 EXPECT_TRUE(res.first == s.begin());
105 EXPECT_TRUE(s.end() != s.begin());
107 EXPECT_TRUE(*(s.begin()) == str);
|
| test_memory.cpp | 40 const char *begin = kSrc; local
42 const char *end = begin + kLen;
47 res = std::uninitialized_copy(begin, end, dest);
59 const CtorDtorCounter *begin = kSrc; local
60 const CtorDtorCounter *end = begin + kLen;
66 res = std::uninitialized_copy(begin, end, dest);
|
| /external/chromium/chrome/browser/profiles/ |
| profile_dependency_manager.cc | 25 all_components_.erase(std::remove(all_components_.begin(),
31 EdgeMap::iterator it = edges_.begin();
54 destruction_order_.begin(); it != destruction_order_.end(); ++it) {
59 destruction_order_.begin(); it != destruction_order_.end(); ++it) {
76 std::copy(all_components_.begin(),
81 for (EdgeMap::const_iterator it = edges_.begin();
83 queue_end = std::remove(queue.begin(), queue_end, it->second);
105 for (EdgeMap::iterator jt = edges.begin(); jt != edges.end(); ++jt) {
121 std::reverse(output.begin(), output.end());
|
| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGGraph.h | 44 BasicBlock(unsigned bytecodeBegin, NodeIndex begin, NodeIndex end)
46 , begin(begin)
57 NodeIndex begin; member in struct:JSC::DFG::BasicBlock
96 BasicBlock* begin = m_blocks.begin(); local
97 BasicBlock* block = binarySearch<BasicBlock, unsigned, BasicBlock::getBytecodeBegin>(begin, m_blocks.size(), bytecodeBegin);
98 ASSERT(block >= m_blocks.begin() && block < m_blocks.end());
99 return static_cast<BlockIndex>(block - begin);
|
| /external/zlib/contrib/delphi/ |
| ZLib.pas | 219 begin
224 begin
229 begin
234 begin
255 begin
261 begin
266 begin
273 begin
280 begin
291 begin
[all...] |
| /external/expat/xmlwf/ |
| xmlwf.dsp | 24 # Begin Project
84 # Begin Target
88 # Begin Group "Source Files"
91 # Begin Source File
95 # Begin Source File
100 # Begin Source File
105 # Begin Source File
109 # Begin Source File
113 # Begin Source File
118 # Begin Group "Header Files"
[all...] |
| /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...] |
| /external/llvm/unittests/ADT/ |
| DenseMapTest.cpp | 32 EXPECT_TRUE(uintMap.begin() == uintMap.end());
47 EXPECT_TRUE(uintPtrMap.begin() == uintPtrMap.end());
51 EXPECT_TRUE(uintPtrMap.find(&dummyInt) == uintPtrMap.begin());
63 EXPECT_TRUE(constUintMap.begin() == constUintMap.end());
64 EXPECT_TRUE(constUintPtrMap.begin() == constUintPtrMap.end());
73 EXPECT_FALSE(uintMap.begin() == uintMap.end());
77 DenseMap<uint32_t, uint32_t>::iterator it = uintMap.begin();
85 EXPECT_TRUE(uintMap.find(0u) == uintMap.begin());
97 EXPECT_TRUE(uintMap.begin() == uintMap.end());
103 uintMap.erase(uintMap.begin());
[all...] |
| /prebuilt/linux-x86/toolchain/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/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/libvpx/vpx_ports/ |
| vpx_timer.h | 49 LARGE_INTEGER begin, end; member in struct:vpx_usec_timer
51 struct timeval begin, end;
60 QueryPerformanceCounter(&t->begin);
62 gettimeofday(&t->begin, NULL);
84 diff.QuadPart = t->end.QuadPart - t->begin.QuadPart;
93 timersub(&t->end, &t->begin, &diff);
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/debug/ |
| vector | 174 begin()
175 { return iterator(_Base::begin(), this); }
178 begin() const
179 { return const_iterator(_Base::begin(), this); }
199 { return reverse_iterator(begin()); }
203 { return const_reverse_iterator(begin()); }
208 { return const_iterator(_Base::begin(), this); }
220 { return const_reverse_iterator(begin()); }
232 this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
356 difference_type __offset = __position - begin();
[all...] |
