Searched refs:begin (Results 226 - 250 of 3538) sorted by relevance

1234567891011>>

/external/llvm/include/llvm/Support/
H A DGetElementPtrTypeIterator.h33 static generic_gep_type_iterator begin(Type *Ty, ItTy It) { function in class:llvm::generic_gep_type_iterator
86 return gep_type_iterator::begin
93 return gep_type_iterator::begin
103 return generic_gep_type_iterator<const T *>::begin(Op0, A.begin());
H A DIntegersSubsetMapping.h99 clustersVector.insert(clustersVector.begin(), Items.begin(), Items.end());
100 std::sort(clustersVector.begin(), clustersVector.end(), ClustersCmp());
102 Items.insert(Items.begin(), clustersVector.begin(), clustersVector.end());
254 // sharing iterator, begin() and end(). Editing should be controlled by
275 for (CaseItemIt j = Items.begin(), i = j++, e = Items.end();
289 for (CaseItemIt L = Items.begin(), R = RHS.Items.begin(),
318 const IntTy *Low = &OldItems.begin()
579 RangeIterator begin() { return Items.begin(); } function in class:llvm::IntegersSubsetMapping
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h72 std::stable_sort(EdgeVector.begin(), EdgeVector.end(), EdgeWeightCompare());
78 for (typename EdgeWeights::iterator EWi = EdgeVector.begin(),
87 for (typename EdgeWeights::iterator EWi = EdgeVector.begin(),
100 typename MaxSpanTree::iterator begin() { function in class:llvm::MaximumSpanningTree
101 return MST.begin();
/external/llvm/lib/Transforms/ObjCARC/
H A DObjCARCAPElim.cpp74 for (Function::const_iterator I = Callee->begin(), E = Callee->end();
77 for (BasicBlock::const_iterator J = BB->begin(), F = BB->end();
97 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
168 if (llvm::next(F->begin()) != F->end())
171 Changed |= OptimizeBB(F->begin());
/external/llvm/tools/bugpoint/
H A DListReducer.h97 std::random_shuffle(ShuffledList.begin(), ShuffledList.end());
116 std::vector<ElTy> Prefix(TheList.begin(), TheList.begin()+Mid);
117 std::vector<ElTy> Suffix(TheList.begin()+Mid, TheList.end());
178 TestList.erase(TestList.begin()+i);
/external/llvm/unittests/ADT/
H A DIntervalMapTest.cpp32 EXPECT_TRUE(map.begin() == map.begin());
33 EXPECT_TRUE(map.begin() == map.end());
35 EXPECT_FALSE(map.begin() != map.begin());
36 EXPECT_FALSE(map.begin() != map.end());
38 EXPECT_FALSE(map.begin().valid());
40 UUMap::iterator I = map.begin();
46 CI = map.begin();
73 EXPECT_TRUE(map.begin()
[all...]
/external/stlport/test/unit/
H A Dcopy_test.cpp91 copy(v1.begin(), v1.end(), v2.begin());
101 insert_iterator<vector<int> > i(v2, v2.begin());
102 copy(v1.begin(), v1.end(), i);
113 copy_backward(v1.begin(), v1.end(), v2.end());
H A Dmvctor_traits_test.cpp117 vect.insert(vect.begin() + 2, vect.begin(), vect.end());
134 vect.insert(vect.begin() + 2, v2.begin(), v2.end() );
148 vect.erase(vect.begin(), vect.begin() + 2 );
167 vect.erase(vect.begin());
216 vect.insert(vect.begin() + 2, vect.begin(), vect.end());
234 vect.insert(vect.begin()
[all...]
H A Dadj_test.cpp60 location = adjacent_find(v.begin(), v.end());
63 location = adjacent_find(v.begin(), v.end());
77 location = adjacent_find(v.begin(), v.end(), equal_length);
102 adjacent_difference(v.begin(), v.end(), result.begin());
120 adjacent_difference(v.begin(), v.end(), result.begin(), mult);
H A Ddeque_test.cpp71 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()
[all...]
/external/chromium/googleurl/src/
H A Durl_canon_query.cc67 // Returns true if the characters starting at |begin| and going until |end|
72 for (int i = query.begin; i < end; i++) {
103 ConvertUTF8ToUTF16(&spec[query.begin], query.len, &utf16);
114 converter->ConvertFromUTF16(&spec[query.begin], query.len, output);
124 AppendRaw8BitQueryString(&spec[query.begin], query.len, output);
137 AppendStringOfType(&spec[query.begin], query.len, CHAR_QUERY, output);
154 out_query->begin = output->length();
158 out_query->len = output->length() - out_query->begin;
/external/clang/lib/StaticAnalyzer/Core/
H A DCheckerRegistry.cpp51 std::lower_bound(checkers.begin(), e, packageInfo, checkerNameLT);
97 std::sort(Checkers.begin(), Checkers.end(), checkerNameLT);
102 i = opts.begin(), e = opts.end(); i != e; ++i) {
108 i = enabledCheckers.begin(), e = enabledCheckers.end(); i != e; ++i) {
118 std::sort(Checkers.begin(), Checkers.end(), checkerNameLT);
126 for (CheckerInfoList::const_iterator i = Checkers.begin(), e = Checkers.end();
136 for (CheckerInfoList::const_iterator i = Checkers.begin(), e = Checkers.end();
/external/libvorbis/vq/
H A Dhuffbuild.c25 static int getval(FILE *in,int begin,int n,int group,int max){ argument
35 for(i=1;i<=begin;i++)
44 return(getval(in,begin,n,group,max));
53 "huffbuild <input>.vqd <begin,n,group>|<lorange-hirange> [noguard]\n"
54 " where begin,n,group is first scalar, \n"
65 int i,j,k,begin,n,subn,guard=1; local
85 begin=0;
87 begin=atoi(argv[2]);
139 long val=getval(file,begin,n,subn,maxval);
/external/llvm/include/llvm/ADT/
H A DMapVector.h47 iterator begin() { function in class:llvm::MapVector
48 return Vector.begin();
51 const_iterator begin() const { function in class:llvm::MapVector
52 return Vector.begin();
102 return std::make_pair(begin() + I, false);
113 (Vector.begin() + Pos->second);
119 (Vector.begin() + Pos->second);
H A DSparseSet.h169 const_iterator begin() const { return Dense.begin(); } function in class:llvm::SparseSet
171 iterator begin() { return Dense.begin(); } function in class:llvm::SparseSet
209 return begin() + i;
269 /// for (SparseSet::iterator I = Set.begin(); I != Set.end();)
278 assert(unsigned(I - begin()) < size() && "Invalid iterator");
283 Sparse[BackIdx] = I - begin();
/external/webkit/Source/JavaScriptCore/heap/
H A DMarkedSpace.cpp96 for (BlockIterator it = m_blocks.begin(); it != end; ++it) {
113 for (BlockIterator it = m_blocks.begin(); it != end; ++it)
120 for (BlockIterator it = m_blocks.begin(); it != end; ++it)
128 for (BlockIterator it = m_blocks.begin(); it != end; ++it)
137 for (BlockIterator it = m_blocks.begin(); it != end; ++it)
146 for (BlockIterator it = m_blocks.begin(); it != end; ++it)
162 for (BlockIterator it = m_blocks.begin(); it != end; ++it)
/external/webkit/Source/WebCore/page/animation/
H A DCompositeAnimation.cpp60 for (CSSPropertyTransitionsMap::const_iterator it = m_transitions.begin(); it != transitionsEnd; ++it) {
69 for (AnimationNameMap::const_iterator it = m_keyframeAnimations.begin(); it != animationsEnd; ++it) {
86 for (CSSPropertyTransitionsMap::const_iterator it = m_transitions.begin(); it != end; ++it)
182 for (CSSPropertyTransitionsMap::const_iterator it = m_transitions.begin(); it != end; ++it) {
208 for (AnimationNameMap::const_iterator it = m_keyframeAnimations.begin(); it != kfend; ++it) {
214 for (AnimationNameMap::const_iterator it = m_keyframeAnimations.begin(); it != kfend; ++it)
263 for (AnimationNameMap::const_iterator it = m_keyframeAnimations.begin(); it != kfend; ++it) {
291 for (CSSPropertyTransitionsMap::const_iterator it = m_transitions.begin(); it != end; ++it) {
300 for (Vector<AtomicStringImpl*>::const_iterator it = m_keyframeAnimationOrderMap.begin(); it != m_keyframeAnimationOrderMap.end(); ++it) {
313 for (CSSPropertyTransitionsMap::const_iterator it = m_transitions.begin(); i
[all...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h84 ExplodedNode * const *begin() const;
205 pred_iterator pred_begin() { return Preds.begin(); }
215 succ_iterator succ_begin() { return Succs.begin(); }
332 node_iterator nodes_begin() { return Nodes.begin(); }
336 const_node_iterator nodes_begin() const { return Nodes.begin(); }
340 roots_iterator roots_begin() { return Roots.begin(); }
344 const_roots_iterator roots_begin() const { return Roots.begin(); }
348 eop_iterator eop_begin() { return EndNodes.begin(); }
352 const_eop_iterator eop_begin() const { return EndNodes.begin(); }
423 Impl.insert(S.begin(),
426 inline iterator begin() { return Impl.begin(); } function in class:clang::ento::ExplodedNodeSet
429 inline const_iterator begin() const { return Impl.begin(); } function in class:clang::ento::ExplodedNodeSet
[all...]
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfAccelTable.cpp60 array_pod_sort(uniques.begin(), uniques.end());
62 std::unique(uniques.begin(), uniques.end());
63 uint32_t num = std::distance(uniques.begin(), p);
82 EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) {
85 std::stable_sort(EI->second.begin(), EI->second.end(), compareDIEs);
86 EI->second.erase(std::unique(EI->second.begin(), EI->second.end()),
154 for (HashList::const_iterator HI = Buckets[i].begin(),
168 for (HashList::const_iterator HI = Buckets[i].begin(),
187 for (HashList::const_iterator HI = Buckets[i].begin(),
197 DI = (*HI)->Data.begin(), D
[all...]
/external/llvm/lib/CodeGen/
H A DCodePlacementOpt.cpp134 assert(Begin != MF.begin() && End != MF.begin() && InsertPt != MF.begin() &&
158 if (TopMBB == MF.begin() ||
170 if (Pred == MF.begin())
186 while (Begin != MF.begin()) {
188 if (Prior == MF.begin())
260 if (TopMBB != MF.begin() &&
275 if (InsertPt != MF.begin() && HasAnalyzableTerminator(prior(InsertPt)))
289 if (BB != MF.begin()
[all...]
/external/chromium/chrome/browser/sync/engine/
H A Dconflict_resolver.cc166 sort(set->begin(), set->end());
168 for (ConflictSet::iterator i = set->begin() ; i != set->end() ; ++i )
178 for (i = conflict_set->begin() ; i != conflict_set->end() ; ++i) {
224 !binary_search(conflict_set->begin(), conflict_set->end(), parentid))
233 if (!binary_search(conflict_set->begin(), conflict_set->end(), id))
245 if (!binary_search(conflict_set->begin(), conflict_set->end(), id))
269 !binary_search(conflict_set->begin(), conflict_set->end(), parent_id)) {
292 if (!binary_search(conflict_set->begin(), conflict_set->end(), id)) {
319 if (!binary_search(conflict_set->begin(), conflict_set->end(), id)) {
342 for (i = conflict_set->begin() ;
387 LogAndSignalIfConflictStuck( BaseTransaction* trans, int attempt_count, InputIt begin, InputIt end, StatusController* status) argument
[all...]
/external/zlib/src/contrib/delphi/
H A DZLib.pas219 begin
224 begin
229 begin
234 begin
255 begin
261 begin
266 begin
273 begin
280 begin
291 begin
[all...]
/external/chromium/chrome/browser/ui/webui/
H A Ddownloads_dom_handler.cc102 OrderedDownloads::iterator it = find(download_items_.begin(),
107 const int id = static_cast<int>(it - download_items_.begin());
120 sort(download_items_.begin(), download_items_.end(), DownloadItemSorter());
123 for (OrderedDownloads::iterator it = download_items_.begin();
125 if (static_cast<int>(it - download_items_.begin()) > kMaxDownloads)
212 for (OrderedDownloads::iterator it = download_items_.begin();
214 int index = static_cast<int>(it - download_items_.begin());
225 for (OrderedDownloads::iterator it = download_items_.begin();
233 for (OrderedDownloads::iterator it = download_items_.begin();
235 if (static_cast<int>(it - download_items_.begin()
[all...]
/external/chromium/net/ftp/
H A Dftp_util.cc104 std::replace(result.begin(), result.end(), '.', '/');
105 std::replace(result.begin(), result.end(), ']', '/');
175 if (!base::StringToInt(rest.begin(),
176 rest.begin() + 2,
180 if (!base::StringToInt(rest.begin() + 3,
181 rest.begin() + 5,
186 if (!base::StringToInt(rest.begin(),
187 rest.begin() + 1,
191 if (!base::StringToInt(rest.begin() + 2,
192 rest.begin()
[all...]
/external/clang/test/SemaCXX/
H A Dfor-range-examples.cpp21 value_range_iter<T> begin(const value_range<T> &r) { return r.begin_; } function in namespace:value_range_detail
45 iterator begin() const { return iterator(it, step); } function in class:value_range_detail::value_range_step
65 T *begin() { return storage; } function in class:map_range::vector
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } function in namespace:map_range
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> {
113 typedef map_iter<F, decltype(t.begin())> iter;
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end()));
167 C begin(cons
[all...]

Completed in 5359 milliseconds

1234567891011>>