Cross Reference: /external/stlport/stlport/stl/

Lines Matching refs:iterator
54  *  For any nonsingular iterator i:
61  *      pointer, even if i is a past-the-end iterator.
174   typedef _Deque_iterator<_Tp, _NonConstTraits> iterator;
182   //copy constructor for iterator and constructor from iterator for const_iterator
183   _Deque_iterator(const iterator& __x) :
351   typedef _Deque_iterator<_Tp, _Nonconst_traits<_Tp> > iterator;
385   iterator _M_start;
386   iterator _M_finish;
420   typedef typename _Base::iterator       iterator;
432   iterator begin() { return this->_M_start; }
433   iterator end() { return this->_M_finish; }
460     iterator __tmp = this->_M_finish;
530   // Check whether it's an integral type.  If so, it's not an iterator.
624     iterator __cur = begin();
730   iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp)) {
732   iterator insert(iterator __pos, const value_type& __x) {
743       iterator __tmp = this->_M_finish;
753   iterator insert(iterator __pos)
757   void insert(iterator __pos, size_type __n, const value_type& __x)
761   iterator _M_fill_insert_aux(iterator __pos, size_type __n, const value_type& __x, const __true_type& /*_Movable*/);
762   iterator _M_fill_insert_aux(iterator __pos, size_type __n, const value_type& __x, const __false_type& /*_Movable*/);
764   void _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
768   void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
774   void _M_insert_dispatch(iterator __pos,
781   // Check whether it's an integral type.  If so, it's not an iterator.
783   void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
789   void _M_insert_range_aux(iterator __pos,
792   void _M_insert_range_aux(iterator __pos,
795   void _M_insert_range_aux(iterator __pos,
798   void _M_insert_range_aux(iterator __pos,
802   void insert(iterator __pos,
804   void insert(iterator __pos,
829   iterator _M_erase(iterator __pos, const __true_type& /*_Movable*/);
830   iterator _M_erase(iterator __pos, const __false_type& /*_Movable*/);
832   iterator _M_erase(iterator __first, iterator __last, const __true_type& /*_Movable*/);
833   iterator _M_erase(iterator __first, iterator __last, const __false_type& /*_Movable*/);
835   iterator erase(iterator __pos) {
841   iterator erase(iterator __first, iterator __last) {
889   _STLP_UNWIND(_STLP_STD::_Destroy_Range(this->_M_start, iterator(*__cur_node, __cur_node)))
909   void _M_insert(iterator __pos,
917   void  _M_insert(iterator __pos,
925       iterator __new_start = _M_reserve_elements_at_front(__n);
933       iterator __new_finish = _M_reserve_elements_at_back(__n);
945   void _M_insert_range_aux(iterator __pos,
951       iterator __new_start = _M_reserve_elements_at_front(__n);
954         iterator __dst = __new_start;
955         iterator __src = this->_M_start;
966       iterator __new_finish = _M_reserve_elements_at_back(__n);
970         iterator __dst = __new_finish;
971         iterator __src = this->_M_finish;
984   void _M_insert_range_aux(iterator __pos,
990       iterator __new_start = _M_reserve_elements_at_front(__n);
991       iterator __old_start = this->_M_start;
995           iterator __start_n = this->_M_start + difference_type(__n);
1012       iterator __new_finish = _M_reserve_elements_at_back(__n);
1013       iterator __old_finish = this->_M_finish;
1018           iterator __finish_n = this->_M_finish - difference_type(__n);
1037   iterator _M_reserve_elements_at_front(size_type __n) {
1044   iterator _M_reserve_elements_at_back(size_type __n) {