#include <safe_vector.h>
Inherits std::vector< T, Allo >.
Inheritance diagram for std::safe_vector:


Public Methods | |
| safe_vector (unsigned int __n, const T &val) | |
| safe_vector () | |
| safe_vector (unsigned int __n) | |
| safe_vector (const vector< T, Allo > &v) | |
| const vector< T, Allo > & | operator= (const vector< T, Allo > &a) |
| T & | operator[] (unsigned int n) |
| const T & | operator[] (unsigned int n) const |
| T & | at (unsigned int n) |
| const T & | at (unsigned int n) const |
| void | push_back (const T &t) |
| void | push_back () |
| vector< T, Allo > & | operator= (const vector< T, Allo > &k) |
| void | reserve (unsigned int n) |
| iterator | begin () |
| iterator | end () |
| const_iterator | end () const |
| const_iterator | begin () const |
| iterator | erase (iterator a, iterator b) |
| void | swap (safe_vector< T, Allo > &a) |
| void | resize (size_type ns, const T &x) |
| void | resize (size_type ns) |
| T & | back () |
| const T & | back () const |
| T & | front () |
| const T & | front () const |
| void | clear () |
| iterator | erase (iterator a) |
| iterator | insert (iterator positn, const T &t) |
| iterator | insert (iterator positn, unsigned int n, const T &t) |
| iterator | insert (iterator positn) |
| iterator | insert (iterator positn, unsigned int n) |
Static Private Methods | |
| int | DIE_NOW () |
| int | temprand () |
Private Attributes | |
| int | id |
|
||||||||||||||||
|
|
|
|||||||||
|
|
|
||||||||||
|
|
|
||||||||||
|
|
|
||||||||||
|
00036 {return (*((vector <T,Allo> *)this)).at(n);}
|
|
||||||||||
|
00035 { return (*((vector <T,Allo> *)this)).at(n); }
|
|
|||||||||
|
00212 {
00213 if (size()>0) return ((vector <T,Allo> *)this)->back();
00214 }
|
|
|||||||||
|
00209 {
00210 if (size()>0) return ((vector <T,Allo> *)this)->back();
00211 }
|
|
|||||||||
|
00186 {
00187 return const_iterator (((const vector<T,Allo> *)this)->begin(),this);
00188 }
|
|
|||||||||
|
00177 {
00178 return iterator (((vector<T,Allo>*)this)->begin(),this);
00179 }
|
|
|||||||||
|
00222 {
00223 ((vector <T,Allo> *)this)->clear();
00224 id++;
00225 }
|
|
|||||||||
|
00005 {
00006 return *(int*)0;
00007 }
|
|
|||||||||
|
00183 {
00184 return const_iterator (((vector<T,Allo>*)this)->end(),this);
00185 }
|
|
|||||||||
|
00180 {
00181 return iterator (((vector<T,Allo>*)this)->end(),this);
00182 }
|
|
||||||||||
|
|
|
||||||||||||||||
|
|
|
|||||||||
|
00218 {
00219 if (size()>0) return ((vector <T,Allo> *)this)->front();
00220 }
|
|
|||||||||
|
00215 {
00216 if (size()>0) return ((vector <T,Allo> *)this)->front();
00217 }
|
|
||||||||||||||||
|
00250 {
00251 positn.check_relevance();
00252 vector<T,Allo>::iterator i=vector<T,Allo>::insert (positn,n);
00253 id++;
00254 return iterator(i,this);
00255 }
|
|
||||||||||
|
00244 {
00245 positn.check_relevance();
00246 vector<T,Allo>::iterator i=vector<T,Allo>::insert (positn);
00247 id++;
00248 return iterator(i,this);
00249 }
|
|
||||||||||||||||||||
|
|
|
||||||||||||||||
|
|
|
||||||||||
|
|
|
||||||||||
|
|
|
||||||||||
|
00034 {return (*((vector <T,Allo> *)this)).at(n);}
|
|
||||||||||
|
00033 { return (*((vector <T,Allo> *)this)).at(n); }
|
|
|||||||||
|
00041 {
00042 vector<T,Allo>::push_back();
00043 id++;
00044 }
|
|
||||||||||
|
|
|
||||||||||
|
00050 {
00051 vector<T,Allo>::reserve (n);
00052 id++;
00053 }
|
|
||||||||||
|
00205 {
00206 ((vector <T,Allo> *)this)->resize(ns);
00207 id++;
00208 }
|
|
||||||||||||||||
|
00201 {
00202 ((vector <T,Allo> *)this)->resize(ns,x);
00203 id++;
00204 }
|
|
||||||||||
|
|
|
|||||||||
|
00009 {
00010 static int seed;
00011 return seed += 319282;
00012
00013 }
|
|
|||||
|
|
1.2.15