HomeSort by relevance Sort by last modified time
    Searched refs:begin (Results 101 - 125 of 4405) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/chromium/chrome/browser/notifications/
balloon_collection_base.cc 27 for (iter = balloons_.begin(); iter != balloons_.end(); ++iter) {
40 for (iter = balloons_.begin(); iter != balloons_.end(); ++iter) {
44 for (iter = to_close.begin(); iter != to_close.end(); ++iter)
56 for (iter = balloons_.begin(); iter != balloons_.end(); ++iter) {
60 for (iter = to_close.begin(); iter != to_close.end(); ++iter)
70 for (Balloons::iterator iter = to_close.begin();
78 for (iter = balloons_.begin(); iter != balloons_.end(); ++iter) {
  /external/elfutils/libdw/
dwarf_ranges.c 138 Dwarf_Addr begin;
142 begin = read_8ubyte_unaligned_inc (die->cu->dbg, readp);
144 if (begin == (uint64_t) -1l) /* Base address entry. */
152 begin = read_4ubyte_unaligned_inc (die->cu->dbg, readp);
154 if (begin == (uint32_t) -1) /* Base address entry. */
161 if (begin == 0 && end == 0) /* End of list entry. */
165 *startp = *basep + begin;
  /frameworks/compile/mclinker/lib/Target/X86/
X86GOTPLT.cpp 39 iterator it = m_SectionData.begin();
56 X86GOTPLT::iterator X86GOTPLT::begin() function in class:mcld::X86GOTPLT
58 return m_SectionData.begin();
61 X86GOTPLT::const_iterator X86GOTPLT::begin() const function in class:mcld::X86GOTPLT
63 return m_SectionData.begin();
79 (*(m_SectionData.getFragmentList().begin())).setContent(pAddress);
96 iterator gotplt_it = begin();
  /external/stlport/test/unit/
slist_test.cpp 78 for(i = str.begin(); i != str.end(); i++)
87 for(i = str.begin(); i != str.end(); i++)
97 for(i = str.begin(); i != str.end(); i++)
106 for(i = str.begin(); i != str.end(); i++)
130 slit = sl.erase(sl.begin());
134 slit = sl.erase(sl.begin(), slit);
139 slit = sl.erase_after(sl.begin());
142 slit = sl.begin(); ++slit; ++slit;
143 slit = sl.erase_after(sl.begin(), slit);
160 sl.insert(sl.begin(), 5)
    [all...]
mvctor_test.cpp 58 v_v_ints.erase(v_v_ints.begin() + 1);
90 vec_strs.erase(vec_strs.begin() + 1);
118 unsigned int *punit = v_v_bits.front().begin()._M_iterator._M_p;
120 unsigned int *punit = v_v_bits.front().begin()._M_p;
132 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_iterator._M_p );
134 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_p );
190 vect_deque.insert(vect_deque.begin() + pos, vect_vect.begin(), vect_vect.end());
191 bufs.insert(bufs.begin() + pos, &vect_deque[pos].front());
192 bufs.insert(bufs.begin() + pos + 1, &vect_deque[pos + 1].front())
    [all...]
uninitialized_test.cpp 94 uninitialized_copy(src.begin(), src.end(), dst.begin());
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
137 uninitialized_copy(src.begin(), src.end(), dst.begin());
139 for (it = dst.begin(); it != end; ++it) {
148 vector<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
153 uninitialized_copy(src.begin(), src.end(), dst.begin());
    [all...]
  /ndk/tests/device/test-gnustl-full/unit/
slist_test.cpp 78 for(i = str.begin(); i != str.end(); i++)
87 for(i = str.begin(); i != str.end(); i++)
97 for(i = str.begin(); i != str.end(); i++)
106 for(i = str.begin(); i != str.end(); i++)
130 slit = sl.erase(sl.begin());
134 slit = sl.erase(sl.begin(), slit);
139 slit = sl.erase_after(sl.begin());
142 slit = sl.begin(); ++slit; ++slit;
143 slit = sl.erase_after(sl.begin(), slit);
160 sl.insert(sl.begin(), 5)
    [all...]
mvctor_test.cpp 58 v_v_ints.erase(v_v_ints.begin() + 1);
90 vec_strs.erase(vec_strs.begin() + 1);
118 unsigned int *punit = v_v_bits.front().begin()._M_iterator._M_p;
120 unsigned int *punit = v_v_bits.front().begin()._M_p;
132 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_iterator._M_p );
134 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_p );
190 vect_deque.insert(vect_deque.begin() + pos, vect_vect.begin(), vect_vect.end());
191 bufs.insert(bufs.begin() + pos, &vect_deque[pos].front());
192 bufs.insert(bufs.begin() + pos + 1, &vect_deque[pos + 1].front())
    [all...]
uninitialized_test.cpp 94 uninitialized_copy(src.begin(), src.end(), dst.begin());
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
137 uninitialized_copy(src.begin(), src.end(), dst.begin());
139 for (it = dst.begin(); it != end; ++it) {
148 vector<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
153 uninitialized_copy(src.begin(), src.end(), dst.begin());
    [all...]
  /ndk/tests/device/test-stlport/unit/
slist_test.cpp 78 for(i = str.begin(); i != str.end(); i++)
87 for(i = str.begin(); i != str.end(); i++)
97 for(i = str.begin(); i != str.end(); i++)
106 for(i = str.begin(); i != str.end(); i++)
130 slit = sl.erase(sl.begin());
134 slit = sl.erase(sl.begin(), slit);
139 slit = sl.erase_after(sl.begin());
142 slit = sl.begin(); ++slit; ++slit;
143 slit = sl.erase_after(sl.begin(), slit);
160 sl.insert(sl.begin(), 5)
    [all...]
mvctor_test.cpp 58 v_v_ints.erase(v_v_ints.begin() + 1);
90 vec_strs.erase(vec_strs.begin() + 1);
118 unsigned int *punit = v_v_bits.front().begin()._M_iterator._M_p;
120 unsigned int *punit = v_v_bits.front().begin()._M_p;
132 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_iterator._M_p );
134 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_p );
190 vect_deque.insert(vect_deque.begin() + pos, vect_vect.begin(), vect_vect.end());
191 bufs.insert(bufs.begin() + pos, &vect_deque[pos].front());
192 bufs.insert(bufs.begin() + pos + 1, &vect_deque[pos + 1].front())
    [all...]
uninitialized_test.cpp 94 uninitialized_copy(src.begin(), src.end(), dst.begin());
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
137 uninitialized_copy(src.begin(), src.end(), dst.begin());
139 for (it = dst.begin(); it != end; ++it) {
148 vector<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
153 uninitialized_copy(src.begin(), src.end(), dst.begin());
    [all...]
  /frameworks/compile/mclinker/lib/Target/ARM/
ARMGOT.cpp 42 iterator it = m_SectionData.begin();
114 (*(m_SectionData.getFragmentList().begin())).setContent(pAddress);
119 iterator begin = getGOTPLTBegin(); local
122 for (;begin != end ;++begin)
123 llvm::cast<GOTEntry>(*begin).setContent(pPLTBase);
131 ARMGOT::iterator ARMGOT::begin() function in class:ARMGOT
133 return m_SectionData.getFragmentList().begin();
136 ARMGOT::const_iterator ARMGOT::begin() const function in class:ARMGOT
138 return m_SectionData.getFragmentList().begin();
159 iterator begin = m_GOTPLTBegin; local
    [all...]
  /external/chromium/chrome/browser/bookmarks/
recently_used_folders_combo_model.cc 35 nodes_.insert(nodes_.begin(), node->parent());
40 nodes_.erase(nodes_.begin() + kMaxMRUFolders, nodes_.end());
46 std::vector<const BookmarkNode*>::iterator it = std::find(nodes_.begin(),
49 node_parent_index_ = static_cast<int>(it - nodes_.begin());
71 std::vector<const BookmarkNode*>::iterator it = std::find(nodes_.begin(),
  /external/chromium/googleurl/src/
url_parse_internal.h 50 // Given an already-initialized begin index and length, this shrinks the range
52 // indicate the length of untrimmed data from |*begin|, but rather the position
53 // in the input string (so the string starts at character |*begin| in the spec,
56 inline void TrimURL(const CHAR* spec, int* begin, int* len) {
58 while (*begin < *len && ShouldTrimFromURL(spec[*begin]))
59 (*begin)++;
63 while (*len > *begin && ShouldTrimFromURL(spec[*len - 1]))
url_canon_icu.cc 164 bool ReadUTFChar(const char* str, int* begin, int length,
167 U8_NEXT(str, *begin, length, code_point);
172 (*begin)--;
181 bool ReadUTFChar(const char16* str, int* begin, int length,
183 if (U16_IS_SURROGATE(str[*begin])) {
184 if (!U16_IS_SURROGATE_LEAD(str[*begin]) || *begin + 1 >= length ||
185 !U16_IS_TRAIL(str[*begin + 1])) {
191 *code_point = U16_GET_SUPPLEMENTARY(str[*begin], str[*begin + 1])
    [all...]
  /external/llvm/include/llvm/ADT/
PriorityQueue.h 36 PriorityQueue(Iterator begin, Iterator end,
39 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
50 std::find(this->c.begin(), this->c.end(), t) - this->c.begin();
72 std::make_heap(this->c.begin(), this->c.end(), this->comp);
  /external/llvm/utils/
lldbDataFormatters.py 14 begin = self.begin.GetValueAsUnsigned(0)
16 return (end - begin)/self.type_size
32 return self.begin.CreateChildAtOffset('['+str(index)+']',
48 self.begin = self.valobj.GetChildMemberWithName('BeginX')
  /frameworks/compile/linkloader/utils/
helper.cpp 26 size_t size, size_t begin, size_t end) {
27 if (end <= begin) {
32 size_t lower = begin & (~0xfUL);
38 if (i < begin) {
43 if (j == begin) {
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
for_each.h 46 * @param begin Begin iterator of input sequence.
61 for_each_template_random_access(InputIterator begin, InputIterator end,
71 return for_each_template_random_access_ed(begin, end, user_op,
76 return for_each_template_random_access_omp_loop(begin, end, user_op,
82 return for_each_template_random_access_omp_loop(begin, end, user_op,
88 return for_each_template_random_access_workstealing(begin, end,
  /frameworks/compile/mclinker/lib/MC/
SymbolCategory.cpp 80 std::swap(m_OutputSymbols[current->begin],
84 current->begin++;
95 m_pCommon->begin++;
97 m_pWeak->begin++;
99 m_pGlobal->begin++;
130 size_t pos = current->begin;
152 current->next->begin--;
171 std::swap(m_OutputSymbols[current->begin], m_OutputSymbols[pos]);
172 pos = current->begin;
173 current->begin++
248 SymbolCategory::iterator SymbolCategory::begin() function in class:SymbolCategory
258 SymbolCategory::const_iterator SymbolCategory::begin() const function in class:SymbolCategory
    [all...]
  /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...]
  /development/host/windows/usb/api/
adb_interface_enum.cpp 29 current_interface_ = interfaces_.begin();
54 current_interface_ = interfaces_.begin();
100 current_interface_ = interfaces_.begin();
  /external/astl/include/
set 83 typename impl_type::iterator i = mImpl.begin();
99 typename impl_type::const_iterator i = mImpl.begin();
113 iterator begin() { return mImpl.begin(); }
116 const_iterator begin() const { return mImpl.begin(); }
  /external/chromium/chrome/common/extensions/
extension_extent.cc 38 for (PatternList::const_iterator pattern = patterns_.begin();
50 for (PatternList::const_iterator i = patterns_.begin();
52 for (PatternList::const_iterator j = other.patterns().begin();

Completed in 1250 milliseconds

1 2 3 45 6 7 8 91011>>