epoc32/include/stdapis/stlport/stl/debug/_deque.h
author William Roberts <williamr@symbian.org>
Wed, 31 Mar 2010 12:27:01 +0100
branchSymbian2
changeset 3 e1b950c65cb4
parent 0 061f57f2323e
permissions -rw-r--r--
Attempt to represent the S^2->S^3 header reorganisation as a series of "hg rename" operations
williamr@2
     1
/*
williamr@2
     2
 *
williamr@2
     3
 * Copyright (c) 1994
williamr@2
     4
 * Hewlett-Packard Company
williamr@2
     5
 *
williamr@2
     6
 * Copyright (c) 1996,1997
williamr@2
     7
 * Silicon Graphics Computer Systems, Inc.
williamr@2
     8
 *
williamr@2
     9
 * Copyright (c) 1997
williamr@2
    10
 * Moscow Center for SPARC Technology
williamr@2
    11
 *
williamr@2
    12
 * Copyright (c) 1999 
williamr@2
    13
 * Boris Fomitchev
williamr@2
    14
 *
williamr@2
    15
 * This material is provided "as is", with absolutely no warranty expressed
williamr@2
    16
 * or implied. Any use is at your own risk.
williamr@2
    17
 *
williamr@2
    18
 * Permission to use or copy this software for any purpose is hereby granted 
williamr@2
    19
 * without fee, provided the above notices are retained on all copies.
williamr@2
    20
 * Permission to modify the code and to distribute modified code is granted,
williamr@2
    21
 * provided the above notices are retained, and a notice that the code was
williamr@2
    22
 * modified is included with the above copyright notice.
williamr@2
    23
 *
williamr@2
    24
 */
williamr@2
    25
williamr@2
    26
/* NOTE: This is an internal header file, included by other STL headers.
williamr@2
    27
 *   You should not attempt to use it directly.
williamr@2
    28
 */
williamr@2
    29
williamr@2
    30
#ifndef _STLP_INTERNAL_DBG_DEQUE_H
williamr@2
    31
#define _STLP_INTERNAL_DBG_DEQUE_H
williamr@2
    32
williamr@2
    33
#include <stl/debug/_iterator.h>
williamr@2
    34
williamr@2
    35
# if !defined (_STLP_USE_WRAPPER_FOR_ALLOC_PARAM) && !defined (_STLP_NO_DEFAULT_NON_TYPE_PARAM)
williamr@2
    36
#  undef  _DBG_deque
williamr@2
    37
#  define _DBG_deque deque
williamr@2
    38
# endif
williamr@2
    39
williamr@2
    40
# define _DEQUE_WRAPPER _DBG_deque<_Tp,_Alloc>
williamr@2
    41
williamr@2
    42
# define _STLP_DEQUE_SUPER   __WORKAROUND_DBG_RENAME(deque) <_Tp,_Alloc>
williamr@2
    43
williamr@2
    44
_STLP_BEGIN_NAMESPACE
williamr@2
    45
williamr@2
    46
# ifdef _STLP_DEBUG_USE_DISTINCT_VALUE_TYPE_HELPERS
williamr@2
    47
template <class _Tp, class _Alloc>
williamr@2
    48
inline _Tp* value_type(const  _DBG_iter_base< _STLP_DEQUE_SUPER >&) {
williamr@2
    49
  return (_Tp*)0;
williamr@2
    50
}
williamr@2
    51
template <class _Tp, class _Alloc>
williamr@2
    52
inline random_access_iterator_tag iterator_category(const  _DBG_iter_base< _STLP_DEQUE_SUPER >&) {
williamr@2
    53
  return random_access_iterator_tag();
williamr@2
    54
}
williamr@2
    55
# endif
williamr@2
    56
williamr@2
    57
template <class _Tp, _STLP_DBG_ALLOCATOR_SELECT(_Tp) >
williamr@2
    58
class _DBG_deque : public _STLP_DEQUE_SUPER {
williamr@2
    59
williamr@2
    60
  typedef _DBG_deque<_Tp,_Alloc> _Self;
williamr@2
    61
  typedef _STLP_DEQUE_SUPER _Base;
williamr@2
    62
williamr@2
    63
public:                         // Basic types
williamr@2
    64
williamr@2
    65
  __IMPORT_CONTAINER_TYPEDEFS(_Base)
williamr@2
    66
williamr@2
    67
public:                         // Iterators
williamr@2
    68
  typedef _DBG_iter< _STLP_DEQUE_SUPER, _Nonconst_traits<value_type> >    iterator;
williamr@2
    69
  typedef _DBG_iter< _STLP_DEQUE_SUPER, _Const_traits<value_type> >   const_iterator;
williamr@2
    70
williamr@2
    71
  _STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS;
williamr@2
    72
williamr@2
    73
protected:
williamr@2
    74
  __owned_list _M_iter_list;
williamr@2
    75
  void _Invalidate_iterator(const iterator& __it) { 
williamr@2
    76
    __invalidate_iterator(&_M_iter_list,__it);
williamr@2
    77
  }
williamr@2
    78
  void _Invalidate_all() {
williamr@2
    79
      _M_iter_list._Invalidate_all();
williamr@2
    80
  }
williamr@2
    81
williamr@2
    82
public:                         // Basic accessors
williamr@2
    83
  iterator begin() { return iterator(&_M_iter_list, this->_M_start); }
williamr@2
    84
  iterator end() { return iterator(&_M_iter_list, this->_M_finish); }
williamr@2
    85
  const_iterator begin() const { 
williamr@2
    86
    return const_iterator(&_M_iter_list, this->_M_start); 
williamr@2
    87
  }
williamr@2
    88
  const_iterator end() const { 
williamr@2
    89
    return const_iterator(&_M_iter_list,  this->_M_finish); 
williamr@2
    90
  }
williamr@2
    91
williamr@2
    92
  reverse_iterator rbegin() { return reverse_iterator(end()); }
williamr@2
    93
  reverse_iterator rend() { return reverse_iterator(begin()); }
williamr@2
    94
  const_reverse_iterator rbegin() const 
williamr@2
    95
    { return const_reverse_iterator(end()); }
williamr@2
    96
  const_reverse_iterator rend() const 
williamr@2
    97
    { return const_reverse_iterator(begin()); }
williamr@2
    98
williamr@2
    99
  reference operator[](size_type __n)
williamr@2
   100
    { return begin()[difference_type(__n)]; }
williamr@2
   101
  const_reference operator[](size_type __n) const 
williamr@2
   102
    { return begin()[difference_type(__n)]; }
williamr@2
   103
williamr@2
   104
  reference front() { return *begin(); }
williamr@2
   105
  reference back() {
williamr@2
   106
    iterator __tmp = end();
williamr@2
   107
    --__tmp;
williamr@2
   108
    return *__tmp;
williamr@2
   109
  }
williamr@2
   110
  const_reference front() const { return *begin(); }
williamr@2
   111
  const_reference back() const {
williamr@2
   112
    const_iterator __tmp = end();
williamr@2
   113
    --__tmp;
williamr@2
   114
    return *__tmp;
williamr@2
   115
  }
williamr@2
   116
williamr@2
   117
public:                         // Constructor, destructor.
williamr@2
   118
williamr@2
   119
  const _Base* _Get_base() const { return (const _Base*)this; }
williamr@2
   120
williamr@2
   121
  explicit _DBG_deque(const allocator_type& __a = allocator_type()) :
williamr@2
   122
    _STLP_DEQUE_SUPER(__a), _M_iter_list(_Get_base()) {}
williamr@2
   123
  _DBG_deque(const _Self& __x) : _STLP_DEQUE_SUPER(__x), _M_iter_list(_Get_base()) {}
williamr@2
   124
  _DBG_deque(size_type __n, const value_type& __value,
williamr@2
   125
        const allocator_type& __a = allocator_type()) : 
williamr@2
   126
    _STLP_DEQUE_SUPER(__n, __value, __a), _M_iter_list(_Get_base()) {}
williamr@2
   127
  explicit _DBG_deque(size_type __n) : _STLP_DEQUE_SUPER(__n), _M_iter_list(_Get_base()) {}
williamr@2
   128
williamr@2
   129
#ifdef _STLP_MEMBER_TEMPLATES
williamr@2
   130
  template <class _InputIterator>
williamr@2
   131
  _DBG_deque(_InputIterator __first, _InputIterator __last,
williamr@2
   132
        const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) : 
williamr@2
   133
    _STLP_DEQUE_SUPER(__first, __last, __a) , _M_iter_list(_Get_base()) {}
williamr@2
   134
# ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS
williamr@2
   135
  template <class _InputIterator>
williamr@2
   136
  _DBG_deque(_InputIterator __first, _InputIterator __last):
williamr@2
   137
    _STLP_DEQUE_SUPER(__first, __last, allocator_type()) , _M_iter_list(_Get_base()) {}
williamr@2
   138
# endif
williamr@2
   139
#else /* _STLP_MEMBER_TEMPLATES */
williamr@2
   140
  _DBG_deque(const value_type* __first, const value_type* __last,
williamr@2
   141
        const allocator_type& __a = allocator_type()) 
williamr@2
   142
    : _STLP_DEQUE_SUPER(__first, __last, __a), _M_iter_list(_Get_base()) {}
williamr@2
   143
williamr@2
   144
  _DBG_deque(const_iterator __first, const_iterator __last,
williamr@2
   145
        const allocator_type& __a = allocator_type()) 
williamr@2
   146
    : _STLP_DEQUE_SUPER(__first._M_iterator, __last._M_iterator, __a), 
williamr@2
   147
      _M_iter_list(_Get_base()) {}
williamr@2
   148
#endif /* _STLP_MEMBER_TEMPLATES */
williamr@2
   149
williamr@2
   150
  _Self& operator= (const _Self& __x) {
williamr@2
   151
    _Invalidate_all();
williamr@2
   152
    (_Base&)*this = (const _Base&)__x; 
williamr@2
   153
    return *this;
williamr@2
   154
  }
williamr@2
   155
williamr@2
   156
  void swap(_Self& __x) {
williamr@2
   157
    _M_iter_list._Swap_owners(__x._M_iter_list);
williamr@2
   158
    _Base::swap(__x);
williamr@2
   159
  }
williamr@2
   160
williamr@2
   161
public: 
williamr@2
   162
  void assign(size_type __n, const _Tp& __val) {
williamr@2
   163
    _Base::assign(__n, __val);
williamr@2
   164
  }
williamr@2
   165
williamr@2
   166
#ifdef _STLP_MEMBER_TEMPLATES
williamr@2
   167
williamr@2
   168
  template <class _InputIterator>
williamr@2
   169
  void assign(_InputIterator __first, _InputIterator __last) {
williamr@2
   170
    _Base::assign(__first, __last);
williamr@2
   171
  }
williamr@2
   172
#endif /* _STLP_MEMBER_TEMPLATES */
williamr@2
   173
williamr@2
   174
public:                         // push_* and pop_*
williamr@2
   175
  
williamr@2
   176
  void push_back(const value_type& __t) {
williamr@2
   177
    _Invalidate_all();
williamr@2
   178
    _Base::push_back(__t);
williamr@2
   179
  }
williamr@2
   180
williamr@2
   181
  void push_back() {
williamr@2
   182
    _Invalidate_all();
williamr@2
   183
    _Base::push_back();
williamr@2
   184
  }
williamr@2
   185
williamr@2
   186
  void push_front(const value_type& __t) {
williamr@2
   187
    _Invalidate_all();
williamr@2
   188
    _Base::push_front(__t);
williamr@2
   189
  }
williamr@2
   190
williamr@2
   191
  void push_front() {
williamr@2
   192
    _Base::push_front();
williamr@2
   193
    _Invalidate_all();
williamr@2
   194
  }
williamr@2
   195
williamr@2
   196
williamr@2
   197
  void pop_back() {
williamr@2
   198
    _Invalidate_iterator(end());
williamr@2
   199
    _Base::pop_back();
williamr@2
   200
  }
williamr@2
   201
williamr@2
   202
  void pop_front() {
williamr@2
   203
    _Invalidate_iterator(begin());        
williamr@2
   204
    _Base::pop_front();
williamr@2
   205
  }
williamr@2
   206
williamr@2
   207
public:                         // Insert
williamr@2
   208
williamr@2
   209
  iterator insert(iterator __position, const value_type& __x) {
williamr@2
   210
    _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list, __position))
williamr@2
   211
    // fbp : invalidation !
williamr@2
   212
    return iterator(&_M_iter_list, _Base::insert(__position._M_iterator, __x));
williamr@2
   213
  }
williamr@2
   214
williamr@2
   215
  iterator insert(iterator __position) { 
williamr@2
   216
    _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list, __position))
williamr@2
   217
    // fbp : invalidation !
williamr@2
   218
    return iterator(&_M_iter_list, _Base::insert(__position._M_iterator));
williamr@2
   219
  }
williamr@2
   220
williamr@2
   221
  void insert(iterator __position, size_type __n, const value_type& __x) {
williamr@2
   222
    _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list, __position))
williamr@2
   223
    // fbp : invalidation !
williamr@2
   224
    _Base::insert(__position._M_iterator, __n, __x);
williamr@2
   225
  }
williamr@2
   226
williamr@2
   227
#ifdef _STLP_MEMBER_TEMPLATES  
williamr@2
   228
  template <class _InputIterator>
williamr@2
   229
  void insert(iterator __position, _InputIterator __first, _InputIterator __last) {
williamr@2
   230
    _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list, __position))
williamr@2
   231
    // fbp : invalidation !
williamr@2
   232
    _Base::insert(__position._M_iterator, __first, __last);
williamr@2
   233
  }
williamr@2
   234
#else /* _STLP_MEMBER_TEMPLATES */
williamr@2
   235
  void insert(iterator __position,
williamr@2
   236
              const value_type* __first, const value_type* __last) {
williamr@2
   237
    _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list, __position))
williamr@2
   238
    _Base::insert(__position._M_iterator, __first, __last);
williamr@2
   239
  }
williamr@2
   240
  void insert(iterator __position,
williamr@2
   241
              const_iterator __first, const_iterator __last) {
williamr@2
   242
    _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list, __position))
williamr@2
   243
    _Base::insert(__position._M_iterator, __first._M_iterator, __last._M_iterator);
williamr@2
   244
  }
williamr@2
   245
#endif /* _STLP_MEMBER_TEMPLATES */
williamr@2
   246
williamr@2
   247
public:                         // Erase
williamr@2
   248
  iterator erase(iterator __pos) {
williamr@2
   249
    _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list, __pos) && (__pos != end()))
williamr@2
   250
    return iterator (&_M_iter_list, _Base::erase(__pos._M_iterator));
williamr@2
   251
  }
williamr@2
   252
williamr@2
   253
  iterator erase(iterator __first, iterator __last) {
williamr@2
   254
    _STLP_DEBUG_CHECK(__first >= begin() && __last <= end())
williamr@2
   255
    return iterator (&_M_iter_list, _Base::erase(__first._M_iterator, __last._M_iterator));
williamr@2
   256
  }
williamr@2
   257
  
williamr@2
   258
  void clear() {
williamr@2
   259
    _Invalidate_all();
williamr@2
   260
    _Base::clear();
williamr@2
   261
  }
williamr@2
   262
};
williamr@2
   263
williamr@2
   264
#define _STLP_TEMPLATE_HEADER template <class _Tp, class _Alloc>
williamr@2
   265
#define _STLP_TEMPLATE_CONTAINER _DBG_deque<_Tp, _Alloc>
williamr@2
   266
#define _STLP_TEMPLATE_CONTAINER_BASE _STLP_DEQUE_SUPER
williamr@2
   267
#include <stl/debug/_relops_cont.h>
williamr@2
   268
#undef _STLP_TEMPLATE_CONTAINER_BASE
williamr@2
   269
#undef _STLP_TEMPLATE_CONTAINER
williamr@2
   270
#undef _STLP_TEMPLATE_HEADER
williamr@2
   271
williamr@2
   272
_STLP_END_NAMESPACE 
williamr@2
   273
williamr@2
   274
# undef _DBG_deque
williamr@2
   275
# undef _STLP_DEQUE_SUPER
williamr@2
   276
  
williamr@2
   277
#endif /* _STLP_INTERNAL_DEQUE_H */
williamr@2
   278
williamr@2
   279
// Local Variables:
williamr@2
   280
// mode:C++
williamr@2
   281
// End: