cc/scoped_ptr_deque.h

   1 // Copyright 2012 The Chromium Authors. All rights reserved.
   2 // Use of this source code is governed by a BSD-style license that can be
   3 // found in the LICENSE file.
   4
   5 #ifndef CC_SCOPED_PTR_DEQUE_H_
   6 #define CC_SCOPED_PTR_DEQUE_H_
   7
   8 #include "base/basictypes.h"
   9 #include "base/logging.h"
  10 #include "base/memory/scoped_ptr.h"
  11 #include "base/stl_util.h"
  12 #include <deque>
  13
  14 namespace cc {
  15
  16 // This type acts like a deque<scoped_ptr> based on top of std::deque. The
  17 // ScopedPtrDeque has ownership of all elements in the deque.
  18 template <typename T>
  19 class ScopedPtrDeque {
  20  public:
  21   typedef typename std::deque<T*>::iterator iterator;
  22   typedef typename std::deque<T*>::const_iterator const_iterator;
  23   typedef typename std::deque<T*>::reverse_iterator reverse_iterator;
  24   typedef typename std::deque<T*>::const_reverse_iterator const_reverse_iterator;
  25
  26   ScopedPtrDeque() {}
  27
  28   ~ScopedPtrDeque() { clear(); }
  29
  30   size_t size() const {
  31     return data_.size();
  32   }
  33
  34   T* Peek(size_t index) const {
  35     DCHECK(index < size());
  36     return data_[index];
  37   }
  38
  39   T* operator[](size_t index) const {
  40     return Peek(index);
  41   }
  42
  43   T* first() const {
  44     DCHECK(!isEmpty());
  45     return Peek(0);
  46   }
  47
  48   T* last() const {
  49     DCHECK(!isEmpty());
  50     return Peek(size() - 1);
  51   }
  52
  53   bool isEmpty() const {
  54     return size() == 0;
  55   }
  56
  57   scoped_ptr<T> takeFirst() {
  58     scoped_ptr<T> ret(first());
  59     data_.pop_front();
  60     return ret.Pass();
  61   }
  62
  63   scoped_ptr<T> takeLast() {
  64     scoped_ptr<T> ret(last());
  65     data_.pop_back();
  66     return ret.Pass();
  67   }
  68
  69   void clear() {
  70     STLDeleteElements(&data_);
  71   }
  72
  73   void append(scoped_ptr<T> item) {
  74     data_.push_back(item.release());
  75   }
  76
  77   void insert(size_t index, scoped_ptr<T> item) {
  78     DCHECK(index < size());
  79     data_.insert(data_.begin() + index, item.release());
  80   }
  81
  82   iterator begin() { return data_.begin(); }
  83   const_iterator begin() const { return data_.begin(); }
  84   iterator end() { return data_.end(); }
  85   const_iterator end() const { return data_.end(); }
  86
  87   reverse_iterator rbegin() { return data_.rbegin(); }
  88   const_reverse_iterator rbegin() const { return data_.rbegin(); }
  89   reverse_iterator rend() { return data_.rend(); }
  90   const_reverse_iterator rend() const { return data_.rend(); }
  91
  92  private:
  93   std::deque<T*> data_;
  94
  95   DISALLOW_COPY_AND_ASSIGN(ScopedPtrDeque);
  96 };
  97
  98 }  // namespace cc
  99
 100 #endif  // CC_SCOPED_PTR_DEQUE_H_