1.1 --- a/epoc32/include/stdapis/stlport/stl/wrappers/_deque.h	Tue Nov 24 13:55:44 2009 +0000
     1.2 +++ b/epoc32/include/stdapis/stlport/stl/wrappers/_deque.h	Tue Mar 16 16:12:26 2010 +0000
     1.3 @@ -1,1 +1,76 @@
     1.4 -_deque.h
     1.5 +/*
     1.6 + *
     1.7 + * Copyright (c) 1994
     1.8 + * Hewlett-Packard Company
     1.9 + *
    1.10 + * Copyright (c) 1996,1997
    1.11 + * Silicon Graphics Computer Systems, Inc.
    1.12 + *
    1.13 + * Copyright (c) 1997
    1.14 + * Moscow Center for SPARC Technology
    1.15 + *
    1.16 + * Copyright (c) 1999 
    1.17 + * Boris Fomitchev
    1.18 + *
    1.19 + * This material is provided "as is", with absolutely no warranty expressed
    1.20 + * or implied. Any use is at your own risk.
    1.21 + *
    1.22 + * Permission to use or copy this software for any purpose is hereby granted 
    1.23 + * without fee, provided the above notices are retained on all copies.
    1.24 + * Permission to modify the code and to distribute modified code is granted,
    1.25 + * provided the above notices are retained, and a notice that the code was
    1.26 + * modified is included with the above copyright notice.
    1.27 + *
    1.28 + */
    1.29 +
    1.30 +#ifndef _STLP_INTERNAL_DEQUE_H
    1.31 +# include <stl/_deque.h>
    1.32 +#endif
    1.33 +
    1.34 +# if defined (_STLP_DEBUG)
    1.35 +#  define _DEQUE_SUPER_NAME _DBG_deque
    1.36 +# else
    1.37 +#  define _DEQUE_SUPER_NAME __deque__
    1.38 +# endif
    1.39 +
    1.40 +# define _DEQUE_SUPER   _DEQUE_SUPER_NAME<_Tp, _STLP_DEFAULT_ALLOCATOR(_Tp) >
    1.41 +
    1.42 +_STLP_BEGIN_NAMESPACE
    1.43 +
    1.44 +// provide a "default" deque adaptor
    1.45 +template <class _Tp>
    1.46 +class deque : public _DEQUE_SUPER {
    1.47 +public:
    1.48 +  typedef deque<_Tp> _Self;
    1.49 +  typedef _DEQUE_SUPER _Super;
    1.50 +  __IMPORT_WITH_REVERSE_ITERATORS(_Super)
    1.51 +    __IMPORT_SUPER_COPY_ASSIGNMENT(deque, _Self, _DEQUE_SUPER)
    1.52 +    deque() : _DEQUE_SUPER() { }
    1.53 +  deque(size_type __n, const _Tp& __value) : _DEQUE_SUPER(__n, __value) { }
    1.54 +  explicit deque(size_type __n) : _DEQUE_SUPER(__n) { }
    1.55 +  deque(const _Tp* __first, const _Tp* __last) : _DEQUE_SUPER(__first, __last) { }
    1.56 +  deque(const_iterator __first, const_iterator __last) : _DEQUE_SUPER(__first, __last) { }
    1.57 +  ~deque() { }
    1.58 +};
    1.59 +
    1.60 +#  if defined (_STLP_BASE_MATCH_BUG)
    1.61 +template <class _Tp>
    1.62 +inline bool 
    1.63 +operator==(const deque<_Tp>& __x, const deque<_Tp>& __y) {
    1.64 +    return __x.size() == __y.size() && equal(__x.begin(), __x.end(), __y.begin());
    1.65 +}
    1.66 +
    1.67 +template <class _Tp>
    1.68 +inline bool 
    1.69 +operator<(const deque<_Tp>& __x, const deque<_Tp>& __y) {
    1.70 +    return lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
    1.71 +}
    1.72 +#  endif /* BASE_MATCH_BUG */
    1.73 +
    1.74 +# undef _DEQUE_SUPER
    1.75 +
    1.76 +_STLP_END_NAMESPACE  
    1.77 +
    1.78 +// Local Variables:
    1.79 +// mode:C++
    1.80 +// End: