HomeSort by relevance Sort by last modified time
    Searched refs:iterator_base (Results 1 - 3 of 3) sorted by null

  /external/chromium/net/tools/flip_server/
balsa_headers.h 285 // Why these base classes (iterator_base, reverse_iterator_base)? Well, if
292 // the same data as iterator_base... so it makes sense to simply have some
295 class iterator_base { class in class:net::BalsaHeaders
307 typedef iterator_base self;
310 iterator_base() : headers_(NULL), idx_(0) { } function in class:net::BalsaHeaders::iterator_base
313 iterator_base(const iterator_base& it) function in class:net::BalsaHeaders::iterator_base
357 iterator_base(const BalsaHeaders* headers, HeaderLines::size_type index) : function in class:net::BalsaHeaders::iterator_base
416 class reverse_iterator_base : public iterator_base {
419 typedef iterator_base::reference reference
    [all...]
balsa_headers.cc 72 std::ostream& BalsaHeaders::iterator_base::operator<<(std::ostream& os) const {
    [all...]
  /external/llvm/include/llvm/ADT/
SparseMultiSet.h 213 class iterator_base : public std::iterator<std::bidirectional_iterator_tag, class in class:llvm::SparseMultiSet
220 iterator_base(SMSPtrTy P, unsigned I, unsigned SI) function in class:llvm::SparseMultiSet::iterator_base
248 iterator_base(const iterator_base &RHS) function in class:llvm::SparseMultiSet::iterator_base
251 const iterator_base &operator=(const iterator_base &RHS) {
267 bool operator==(const iterator_base &RHS) const {
278 bool operator!=(const iterator_base &RHS) const {
283 iterator_base &operator--() { // predecrement - Back up
296 iterator_base &operator++() { // preincrement - Advanc
    [all...]

Completed in 84 milliseconds