| /external/webkit/Source/WebCore/rendering/style/ |
| KeyframeList.cpp | 44 Vector<KeyframeValue>::const_iterator it2 = o.m_keyframes.begin();
45 for (Vector<KeyframeValue>::const_iterator it1 = m_keyframes.begin(); it1 != m_keyframes.end(); ++it1) {
86 for (Vector<KeyframeValue>::const_iterator it = m_keyframes.begin(); it != m_keyframes.end(); ++it) {
88 for (HashSet<int>::const_iterator it = currKeyframe.properties().begin(); it != currKeyframe.properties().end(); ++it)
92 for (HashSet<int>::const_iterator it = keyframe.properties().begin(); it != keyframe.properties().end(); ++it)
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| par_loop.h | 48 * @param begin Begin iterator of element sequence.
68 for_each_template_random_access_ed(RandomAccessIterator begin,
78 const difference_type length = end - begin;
106 new(reduct) Result(f(o, begin + start));
114 *reduct = r(*reduct, f(o, begin + start));
125 f.finish_iterator = begin + length;
|
| 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/chromium/googleurl/src/ |
| url_canon_internal.h | 161 // Reads one character in UTF-8 starting at |*begin| in |str| and places
166 // |*begin| will be updated to point to the last character consumed so it
171 bool ReadUTFChar(const char* str, int* begin, int length,
238 // Reads one character in UTF-16 starting at |*begin| in |str| and places
243 // |*begin| will be updated to point to the last character consumed so it
248 bool ReadUTFChar(const char16* str, int* begin, int length,
267 // update the |*begin| pointer and add a placeholder character to the
270 // We will append the character starting at ch[begin] with the buffer ch
271 // being |length|. |*begin| will be updated to point to the last character
281 // Assumes that ch[begin] is within range in the array, but does not assum
[all...] |
| url_canon_etc.cc | 121 out_scheme->begin = output->length();
130 for (int i = scheme.begin; i < end; i++) {
134 if (i == scheme.begin) {
163 out_scheme->len = output->length() - out_scheme->begin;
188 out_username->begin = output->length();
191 AppendStringOfType(&username_spec[username.begin], username.len,
194 out_username->len = output->length() - out_username->begin;
200 out_password->begin = output->length();
201 AppendStringOfType(&password_spec[password.begin], password.len,
203 out_password->len = output->length() - out_password->begin;
[all...] |
| /external/stlport/test/unit/ |
| equal_test.cpp | 56 pair<IntVec::iterator, IntVec::iterator> range = equal_range(v.begin(), v.end(), 2);
57 CPPUNIT_ASSERT( (range.first - v.begin()) == 6 );
58 CPPUNIT_ASSERT( (range.second - v.begin()) == 9 );
62 range = equal_range(v.begin(), v.end(), 4);
113 it = upper_bound(tv.begin(), tv.end(), 5);
117 it = lower_bound(tv.begin(), tv.end(), 5);
121 p = equal_range(tv.begin(), tv.end(), 5);
145 CPPUNIT_ASSERT( !equal(v1.begin(), v1.end(), v2.begin()) );
147 copy(v1.begin(), v1.end(), v2.begin())
[all...] |
| partial_test.cpp | 83 partial_sort(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
106 partial_sort(v1.begin(), v1.begin() + nameSize / 2, v1.end(), str_compare);
145 partial_sort_copy(v1.begin(), v1.end(), result.begin(), result.end());
162 partial_sort_copy(v1.begin(), v1.end(), result.begin(), result.end(), str_compare);
190 partial_sort_copy(numbers, numbers + s, result.begin(), result.end(), less_equal<int>());
219 __iota(v1.begin(), v1.end(), 0)
[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/ |
| equal_test.cpp | 56 pair<IntVec::iterator, IntVec::iterator> range = equal_range(v.begin(), v.end(), 2);
57 CPPUNIT_ASSERT( (range.first - v.begin()) == 6 );
58 CPPUNIT_ASSERT( (range.second - v.begin()) == 9 );
62 range = equal_range(v.begin(), v.end(), 4);
113 it = upper_bound(tv.begin(), tv.end(), 5);
117 it = lower_bound(tv.begin(), tv.end(), 5);
121 p = equal_range(tv.begin(), tv.end(), 5);
145 CPPUNIT_ASSERT( !equal(v1.begin(), v1.end(), v2.begin()) );
147 copy(v1.begin(), v1.end(), v2.begin())
[all...] |
| partial_test.cpp | 83 partial_sort(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
106 partial_sort(v1.begin(), v1.begin() + nameSize / 2, v1.end(), str_compare);
145 partial_sort_copy(v1.begin(), v1.end(), result.begin(), result.end());
162 partial_sort_copy(v1.begin(), v1.end(), result.begin(), result.end(), str_compare);
190 partial_sort_copy(numbers, numbers + s, result.begin(), result.end(), less_equal<int>());
219 __iota(v1.begin(), v1.end(), 0)
[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/ |
| equal_test.cpp | 56 pair<IntVec::iterator, IntVec::iterator> range = equal_range(v.begin(), v.end(), 2);
57 CPPUNIT_ASSERT( (range.first - v.begin()) == 6 );
58 CPPUNIT_ASSERT( (range.second - v.begin()) == 9 );
62 range = equal_range(v.begin(), v.end(), 4);
113 it = upper_bound(tv.begin(), tv.end(), 5);
117 it = lower_bound(tv.begin(), tv.end(), 5);
121 p = equal_range(tv.begin(), tv.end(), 5);
145 CPPUNIT_ASSERT( !equal(v1.begin(), v1.end(), v2.begin()) );
147 copy(v1.begin(), v1.end(), v2.begin())
[all...] |
| partial_test.cpp | 83 partial_sort(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
106 partial_sort(v1.begin(), v1.begin() + nameSize / 2, v1.end(), str_compare);
145 partial_sort_copy(v1.begin(), v1.end(), result.begin(), result.end());
162 partial_sort_copy(v1.begin(), v1.end(), result.begin(), result.end(), str_compare);
190 partial_sort_copy(numbers, numbers + s, result.begin(), result.end(), less_equal<int>());
219 __iota(v1.begin(), v1.end(), 0)
[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);
|
| /frameworks/base/opengl/java/android/opengl/ |
| EGLLogWrapper.java | 49 begin("eglChooseConfig");
66 begin("eglCopyBuffers");
80 begin("eglCreateContext");
96 begin("eglCreatePbufferSurface");
111 begin("eglCreatePixmapSurface");
127 begin("eglCreateWindowSurface");
142 begin("eglDestroyContext");
154 begin("eglDestroySurface");
167 begin("eglGetConfigAttrib");
182 begin("eglGetConfigs")
392 private void begin(String name) { method in class:EGLLogWrapper
[all...] |
| /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/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/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 59 iterator begin() { return Frontiers.begin(); } function in class:llvm::DominanceFrontierBase
60 const_iterator begin() const { return Frontiers.begin(); } function in class:llvm::DominanceFrontierBase
74 for (iterator I = begin(), E = end(); I != E; ++I)
94 for (DomSetType::const_iterator I = DS2.begin(),
98 for (DomSetType::const_iterator I = DS1.begin(),
119 for (DomSetMapType::const_iterator I = Other.begin(),
123 for (DomSetMapType::iterator I = tmpFrontiers.begin(),
|
| /build/tools/atree/ |
| atree.cpp | 171 for (vector<string>::iterator it=g_listFiles.begin();
175 for (vector<string>::iterator it=g_inputBases.begin();
192 for (vector<string>::iterator it=g_listFiles.begin();
202 for (vector<FileRecord>::iterator it=files.begin();
208 for (vector<FileRecord>::iterator it=files.begin();
214 for (vector<FileRecord>::iterator it=more.begin();
220 for (vector<FileRecord>::iterator it=files.begin();
230 for (vector<FileRecord>::iterator it=files.begin();
244 for (vector<FileRecord>::iterator it=files.begin();
252 for (set<string>::iterator it=deleted.begin();
[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...] |
| /external/chromium/chrome/browser/sync/engine/ |
| update_applicator.cc | 21 const UpdateIterator& begin,
27 begin_(begin),
29 pointer_(begin),
33 size_t item_count = end - begin;
123 for (i = conflicting_ids_.begin(); i != conflicting_ids_.end(); ++i) {
127 for (i = successful_ids_.begin(); i != successful_ids_.end(); ++i) {
|
| /external/chromium/net/http/ |
| http_auth.h | 181 ChallengeTokenizer(std::string::const_iterator begin,
183 : begin_(begin),
185 scheme_begin_(begin),
186 scheme_end_(begin),
189 Init(begin, end);
208 void Init(std::string::const_iterator begin,
|
