| /external/chromium_org/extensions/common/ |
| url_pattern_set.cc | 41 std::set_intersection(set1.patterns_.begin(), set1.patterns_.end(),
42 set2.patterns_.begin(), set2.patterns_.end(),
44 out->patterns_, out->patterns_.begin()));
52 std::set_union(set1.patterns_.begin(), set1.patterns_.end(),
53 set2.patterns_.begin(), set2.patterns_.end(),
55 out->patterns_, out->patterns_.begin()));
123 patterns_.insert(set.patterns().begin(),
132 for (URLPatternSet::const_iterator it = other.begin();
142 for (URLPatternSet::const_iterator it = begin();
151 for (URLPatternSet::const_iterator pattern = patterns_.begin();
[all...] |
| /external/chromium_org/url/ |
| url_canon_internal_file.h | 26 // spec is returned (after the colon when a drive spec is found, the begin
29 static int FileDoDriveSpec(const CHAR* spec, int begin, int end,
33 int num_slashes = CountConsecutiveSlashes(spec, begin, end);
34 int after_slashes = begin + num_slashes;
37 return begin; // Haven't consumed any characters
57 static void FileDoPath(const CHAR* spec, int begin, int end,
60 // canonicalizer expects the input to begin in a slash already so
62 int num_slashes = CountConsecutiveSlashes(spec, begin, end);
63 int after_slashes = begin + num_slashes;
91 new_parsed->scheme.begin = output->length()
[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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/ |
| move.pass.cpp | 35 assert(distance(m.begin(), m.end()) == 0);
40 assert(distance(mo.begin(), mo.end()) == 0);
62 assert(distance(m.begin(), m.end()) == 3);
63 assert(*m.begin() == V(1, 1));
64 assert(*next(m.begin()) == V(2, 1));
65 assert(*next(m.begin(), 2) == V(3, 1));
70 assert(distance(mo.begin(), mo.end()) == 0);
81 assert(distance(m.begin(), m.end()) == 0);
86 assert(distance(mo.begin(), mo.end()) == 0);
108 assert(distance(m.begin(), m.end()) == 3)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| remove.pass.cpp | 27 C c1(std::begin(t1), std::end(t1));
28 C c2(std::begin(t2), std::end(t2));
36 C c1(std::begin(t1), std::end(t1));
46 C c1(std::begin(t1), std::end(t1));
47 C c2(std::begin(t2), std::end(t2));
64 C c1(std::begin(t1), std::end(t1));
65 C c2(std::begin(t2), std::end(t2));
75 C c1(std::begin(t1), std::end(t1));
76 C c2(std::begin(t2), std::end(t2));
84 C c1(std::begin(t1), std::end(t1))
[all...] |
| remove_if.pass.cpp | 32 C c1(std::begin(t1), std::end(t1));
33 C c2(std::begin(t2), std::end(t2));
41 C c1(std::begin(t1), std::end(t1));
51 C c1(std::begin(t1), std::end(t1));
52 C c2(std::begin(t2), std::end(t2));
69 C c1(std::begin(t1), std::end(t1));
70 C c2(std::begin(t2), std::end(t2));
80 C c1(std::begin(t1), std::end(t1));
81 C c2(std::begin(t2), std::end(t2));
89 C c1(std::begin(t1), std::end(t1))
[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...] |
| /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...] |
| /external/chromium_org/chrome/browser/extensions/api/identity/ |
| extension_token_key_unittest.cc | 46 for (extension_it = extension_ids.begin();
49 for (user_it = user_ids.begin(); user_it != user_ids.end(); ++user_it) {
50 for (scope_it = scopesets.begin(); scope_it != scopesets.end();
59 for (ExtensionTokenKeyIterator it = keys.begin(); it != keys.end(); ++it) {
64 std::sort(keys.begin(), keys.end());
65 for (ExtensionTokenKeyIterator it1 = keys.begin(); it1 != keys.end(); ++it1) {
|
| /external/chromium_org/chrome/browser/ui/android/tab_model/ |
| tab_model_list.cc | 31 std::find(tab_models().begin(), tab_models().end(), tab_model);
51 for (TabModelList::const_iterator i = TabModelList::begin();
65 for (TabModelList::const_iterator i = TabModelList::begin();
75 for (TabModelList::const_iterator i = TabModelList::begin();
84 TabModelList::const_iterator TabModelList::begin() { function in class:TabModelList
85 return tab_models().begin();
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| fts2k.test | 32 BEGIN TRANSACTION;
44 BEGIN TRANSACTION;
56 BEGIN TRANSACTION;
75 BEGIN TRANSACTION;
86 BEGIN;
97 BEGIN;
|
| fts3ak.test | 32 BEGIN TRANSACTION;
44 BEGIN TRANSACTION;
56 BEGIN TRANSACTION;
75 BEGIN TRANSACTION;
86 BEGIN;
97 BEGIN;
|
| /external/chromium_org/third_party/sqlite/src/tool/ |
| split-sqlite3c.tcl | 13 set BEGIN {^/\*+ Begin file ([a-zA-Z0-9_.]+) \*+/}
22 if {[regexp $BEGIN $line]} break
30 regexp $::BEGIN $firstline all filename
62 while {[regexp $BEGIN $line]} {
74 if {[regexp $BEGIN $line]} break
|
| /external/libvpx/libvpx/vpx_ports/ |
| vpx_timer.h | 49 LARGE_INTEGER begin, end; member in struct:vpx_usec_timer
51 struct timeval begin, end;
59 QueryPerformanceCounter(&t->begin);
61 gettimeofday(&t->begin, NULL);
81 diff.QuadPart = t->end.QuadPart - t->begin.QuadPart;
88 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++/libcxx/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++/libcxx/test/containers/associative/map/map.access/ |
| size.pass.cpp | 33 m.erase(m.begin());
35 m.erase(m.begin());
37 m.erase(m.begin());
51 m.erase(m.begin());
53 m.erase(m.begin());
55 m.erase(m.begin());
|
