1 typedef __SIZE_TYPE__ size_t;
2 template<typename _Iterator, typename _Container> class __normal_iterator {
4 const _Iterator& base() const;
6 template<typename _BI1, typename _BI2> inline
7 void copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) {
8 while (__first != __last) *--__result = *--__last;
10 template<typename _Tp> struct _Vector_base {
11 struct _Vector_impl { _Tp* _M_finish; };
14 template<typename _Tp > class vector : protected _Vector_base<_Tp> {
15 typedef vector<_Tp> vector_type;
16 typedef _Tp * pointer;
17 typedef _Tp & reference;
18 typedef __normal_iterator<pointer, vector_type> iterator;
19 typedef size_t size_type;
22 void resize(size_type __new_size) { insert(end(), __new_size); }
23 reference operator[](size_type __n);
24 void insert(iterator __position, size_type __n)
26 pointer __old_finish(this->_M_impl._M_finish);
27 copy_backward(__position.base(), __old_finish - __n, __old_finish);
38 template <class T> struct B {
39 B () : ptr (T::alloc ()) { }
40 B (T *a_ptr) : ptr (a_ptr) { }
42 B& operator= (const B<T>& a) { if (a.get () != this->get ()) { decRef ();
44 template<class U> operator B<U> () const { return B<U> (ptr); }
45 T* operator-> () const { }
46 T* get () const { return ptr; }
47 void decRef () const { if (ptr != 0) ptr->decRef (); }
48 void incRef () const { if (ptr != 0) ptr->incRef (); }
52 template <class T> inline void foo (const B<T> & x) { d.resize (1); d[0] = x;
62 void foo (vector<B<D> > & x) {
63 for (int i = 0; i < 2; ++i)