Lines Matching defs:Deque

33 // FIXME: Could move what Vector and Deque share into a separate file.
34 // Deque doesn't actually use Vector.
47 class Deque {
55 Deque();
56 Deque(const Deque<T, inlineCapacity>&);
57 Deque& operator=(const Deque<T, inlineCapacity>&);
58 ~Deque();
60 void swap(Deque<T, inlineCapacity>&);
119 DequeIteratorBase(const Deque<T, inlineCapacity>*, size_t);
140 Deque<T, inlineCapacity>* m_deque;
143 friend class Deque<T, inlineCapacity>;
158 DequeIterator(Deque<T, inlineCapacity>* deque, size_t index) : Base(deque, index) { }
183 DequeConstIterator(const Deque<T, inlineCapacity>* deque, size_t index) : Base(deque, index) { }
209 DequeReverseIterator(const Deque<T, inlineCapacity>* deque, size_t index) : Base(deque, index) { }
234 DequeConstReverseIterator(const Deque<T, inlineCapacity>* deque, size_t index) : Base(deque, index) { }
254 template<typename T, size_t inlineCapacity> inline void Deque<T, inlineCapacity>::checkValidity() const { }
255 template<typename T, size_t inlineCapacity> inline void Deque<T, inlineCapacity>::checkIndexValidity(size_t) const { }
256 template<typename T, size_t inlineCapacity> inline void Deque<T, inlineCapacity>::invalidateIterators() { }
259 void Deque<T, inlineCapacity>::checkValidity() const
275 void Deque<T, inlineCapacity>::checkIndexValidity(size_t index) const
287 void Deque<T, inlineCapacity>::invalidateIterators()
301 inline Deque<T, inlineCapacity>::Deque()
312 inline Deque<T, inlineCapacity>::Deque(const Deque<T, inlineCapacity>& other)
330 void deleteAllValues(const Deque<T, inlineCapacity>& collection)
332 typedef typename Deque<T, inlineCapacity>::const_iterator iterator;
339 inline Deque<T, inlineCapacity>& Deque<T, inlineCapacity>::operator=(const Deque<T, inlineCapacity>& other)
343 Deque<T> copy(other);
349 inline void Deque<T, inlineCapacity>::destroyAll()
360 inline Deque<T, inlineCapacity>::~Deque()
368 inline void Deque<T, inlineCapacity>::swap(Deque<T, inlineCapacity>& other)
381 inline void Deque<T, inlineCapacity>::clear()
393 inline DequeIterator<T, inlineCapacity> Deque<T, inlineCapacity>::findIf(Predicate& predicate)
404 inline void Deque<T, inlineCapacity>::expandCapacityIfNeeded()
419 void Deque<T, inlineCapacity>::expandCapacity()
439 inline T Deque<T, inlineCapacity>::takeFirst()
447 inline void Deque<T, inlineCapacity>::append(const U& value)
460 inline void Deque<T, inlineCapacity>::prepend(const U& value)
473 inline void Deque<T, inlineCapacity>::removeFirst()
487 inline void Deque<T, inlineCapacity>::remove(iterator& it)
494 inline void Deque<T, inlineCapacity>::remove(const_iterator& it)
501 inline void Deque<T, inlineCapacity>::remove(size_t position)
590 inline DequeIteratorBase<T, inlineCapacity>::DequeIteratorBase(const Deque<T, inlineCapacity>* deque, size_t index)
591 : m_deque(const_cast<Deque<T, inlineCapacity>*>(deque))
683 using WTF::Deque;