Lines Matching refs:iterators

792 operations, such as ``begin`` and ``end`` iterators, etc.  Also, the
991 address (iterators in the final vector are just indices or pointers), and can be
1020 iterators.  If more than 'N' insertions are performed, a single quadratically
1025 Note that, unlike ``std::set``, the iterators of ``SmallPtrSet`` are invalidated
1026 whenever an insertion occurs.  Also, the values visited by the iterators are not
1115 The advantages of std::set are that its iterators are stable (deleting or
1116 inserting an element from the set does not affect iterators or pointers to other
1276 The iterators in a DenseMap are invalidated whenever an insertion occurs,
1312 The IntervalMap iterators are quite big, so they should not be passed around as
1313 STL iterators.  The heavyweight iterators allow a smaller data structure.
1326 iterate over the collection in sorted order, or if you need stable iterators
1578 However, the iterators you'll be working with in the LLVM framework are special:
1598 illustrates use of the conversion constructors provided by LLVM iterators.  By
1611 iterators from conforming to standard iterator conventions, and thus from being
1739 algorithms (such as analyses, etc.).  For this purpose above iterators come in
2646   As with all other iterators in LLVM, the naming conventions follow the