typedef __SIZE_TYPE__ size_t;
|
typedef __SIZE_TYPE__ size_t;
|
template class __normal_iterator {
|
template class __normal_iterator {
|
public:
|
public:
|
const _Iterator& base() const;
|
const _Iterator& base() const;
|
};
|
};
|
template inline
|
template inline
|
void copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) {
|
void copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) {
|
while (__first != __last) *--__result = *--__last;
|
while (__first != __last) *--__result = *--__last;
|
}
|
}
|
template struct _Vector_base {
|
template struct _Vector_base {
|
struct _Vector_impl { _Tp* _M_finish; };
|
struct _Vector_impl { _Tp* _M_finish; };
|
_Vector_impl _M_impl;
|
_Vector_impl _M_impl;
|
};
|
};
|
template class vector : protected _Vector_base<_Tp> {
|
template class vector : protected _Vector_base<_Tp> {
|
typedef vector<_Tp> vector_type;
|
typedef vector<_Tp> vector_type;
|
typedef _Tp * pointer;
|
typedef _Tp * pointer;
|
typedef _Tp & reference;
|
typedef _Tp & reference;
|
typedef __normal_iterator iterator;
|
typedef __normal_iterator iterator;
|
typedef size_t size_type;
|
typedef size_t size_type;
|
public:
|
public:
|
iterator end();
|
iterator end();
|
void resize(size_type __new_size) { insert(end(), __new_size); }
|
void resize(size_type __new_size) { insert(end(), __new_size); }
|
reference operator[](size_type __n);
|
reference operator[](size_type __n);
|
void insert(iterator __position, size_type __n)
|
void insert(iterator __position, size_type __n)
|
{
|
{
|
pointer __old_finish(this->_M_impl._M_finish);
|
pointer __old_finish(this->_M_impl._M_finish);
|
copy_backward(__position.base(), __old_finish - __n, __old_finish);
|
copy_backward(__position.base(), __old_finish - __n, __old_finish);
|
}
|
}
|
};
|
};
|
struct A {
|
struct A {
|
virtual ~A ();
|
virtual ~A ();
|
void incRef ();
|
void incRef ();
|
void decRef ();
|
void decRef ();
|
};
|
};
|
struct C : public A {
|
struct C : public A {
|
static C *alloc ();
|
static C *alloc ();
|
};
|
};
|
template struct B {
|
template struct B {
|
B () : ptr (T::alloc ()) { }
|
B () : ptr (T::alloc ()) { }
|
B (T *a_ptr) : ptr (a_ptr) { }
|
B (T *a_ptr) : ptr (a_ptr) { }
|
~B () { decRef (); }
|
~B () { decRef (); }
|
B& operator= (const B& a) { if (a.get () != this->get ()) { decRef ();
|
B& operator= (const B& a) { if (a.get () != this->get ()) { decRef ();
|
incRef (); } }
|
incRef (); } }
|
template operator B () const { return B (ptr); }
|
template operator B () const { return B (ptr); }
|
T* operator-> () const { }
|
T* operator-> () const { }
|
T* get () const { return ptr; }
|
T* get () const { return ptr; }
|
void decRef () const { if (ptr != 0) ptr->decRef (); }
|
void decRef () const { if (ptr != 0) ptr->decRef (); }
|
void incRef () const { if (ptr != 0) ptr->incRef (); }
|
void incRef () const { if (ptr != 0) ptr->incRef (); }
|
T *ptr;
|
T *ptr;
|
};
|
};
|
struct D : public C {
|
struct D : public C {
|
template inline void foo (const B & x) { d.resize (1); d[0] = x;
|
template inline void foo (const B & x) { d.resize (1); d[0] = x;
|
}
|
}
|
vector > d;
|
vector > d;
|
};
|
};
|
struct E : public C {
|
struct E : public C {
|
static E *alloc ();
|
static E *alloc ();
|
};
|
};
|
struct F : public D {
|
struct F : public D {
|
static F *alloc ();
|
static F *alloc ();
|
};
|
};
|
void foo (vector > & x) {
|
void foo (vector > & x) {
|
for (int i = 0; i < 2; ++i)
|
for (int i = 0; i < 2; ++i)
|
{
|
{
|
B l;
|
B l;
|
B m;
|
B m;
|
l->foo (m);
|
l->foo (m);
|
}
|
}
|
}
|
}
|
|
|
