_Ref
template <class _Tp, class _Ref, class _Ptr>
typedef _Ref reference;
template <class _Tp, class _Ref, class _Ptr, size_t __bufsiz>
iterator_category(const _Deque_iterator<_Tp,_Ref,_Ptr,__bufsiz>&) {
template <class _Tp, class _Ref, class _Ptr, size_t __bufsiz>
value_type(const _Deque_iterator<_Tp,_Ref,_Ptr,__bufsiz>&) {
template <class _Tp, class _Ref, class _Ptr, size_t __bufsiz>
distance_type(const _Deque_iterator<_Tp,_Ref,_Ptr,__bufsiz>&) {
template <class _Tp, class _Ref, class _Ptr>
iterator_category(const _Deque_iterator<_Tp,_Ref,_Ptr>&)
template <class _Tp, class _Ref, class _Ptr>
value_type(const _Deque_iterator<_Tp,_Ref,_Ptr>&) { return 0; }
template <class _Tp, class _Ref, class _Ptr>
distance_type(const _Deque_iterator<_Tp,_Ref,_Ptr>&) {
template <class _Tp, class _Ref, class _Ptr, size_t __bufsiz>
template <class _BiIter, class _Tp, class _Ref,
const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __x,
const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y)
template <class _RandAccIter, class _Tp, class _Ref, class _Dist>
inline reverse_iterator<_RandAccIter, _Tp, _Ref, _Dist>
const reverse_iterator<_RandAccIter, _Tp, _Ref, _Dist>& __x)
return reverse_iterator<_RandAccIter, _Tp, _Ref, _Dist>(__x.base() - __n);
iterator_category(const _List_iterator<_Tp, _Ref, _Ptr>&)
template <class _Tp, class _Ref, class _Ptr>
value_type(const _List_iterator<_Tp, _Ref, _Ptr>&)
template <class _Tp, class _Ref, class _Ptr>
distance_type(const _List_iterator<_Tp, _Ref, _Ptr>&)
template<class _Tp, class _Ref, class _Ptr>
typedef _Ref reference;
template <class _Tp, class _Ref, class _Ptr>
template <class _Tp, class _Ref, class _Ptr>
typedef _Ref reference;
template <class _Tp, class _Ref, class _Ptr>
inline _Tp* value_type(const _Slist_iterator<_Tp, _Ref, _Ptr>&) {
template <class _Value, class _Ref, class _Ptr>
typedef _Ref reference;
template <class _Value, class _Ref, class _Ptr>
inline _Value* value_type(const _Rb_tree_iterator<_Value, _Ref, _Ptr>&) {