#include <safe_vector.h>
Collaboration diagram for std::safe_vector< T, Allo >::const_iterator:
Public Methods | |
void | check_relevance () const |
const T & | operator * () |
bool | operator== (const vector< T, Allo >::iterator &i) |
bool | operator== (const vector< T, Allo >::const_iterator &i) |
bool | operator!= (const vector< T, Allo >::iterator &i) |
bool | operator!= (const vector< T, Allo >::const_iterator &i) |
const_iterator (const vector< T, Allo >::const_iterator &i, const safe_vector< T, Allo > *id) | |
const_iterator (const iterator &i) | |
const_iterator | operator++ (int) |
iterator | operator+= (int i) |
iterator | operator-= (int i) |
iterator | operator++ () |
iterator | operator-- () |
Public Attributes | |
const safe_vector< T, Allo > * | v |
int | id |
|
00147 :vector<T,Allo>::const_iterator(i) { 00148 this->v =id; 00149 this->id = id->id; 00150 } |
|
00151 : vector<T,Allo>::const_iterator(i) { 00152 v = i->v; 00153 id = i->id; 00154 } |
|
|
|
00127 { 00128 check_relevance(); 00129 return (**((vector <T,Allo>::const_iterator*)this)); 00130 } |
|
00143 { 00144 check_relevance(); 00145 return (*((vector<T,Allo>::const_iterator *)this))!=i; 00146 } |
|
00139 { 00140 check_relevance(); 00141 return (*((vector<T,Allo>::const_iterator *)this))!=i; 00142 } |
|
00170 { 00171 return (*this)+=1; 00172 } |
|
00156 { 00157 check_relevance(); 00158 return (*((vector<T,Allo>::const_iterator *)this))++; 00159 } |
|
00160 { 00161 (*((vector<T,Allo>::const_iterator *)this))+=i; 00162 check_relevance(); 00163 return *this; 00164 } |
|
00173 { 00174 return (*this)-=1; 00175 } |
|
00165 { 00166 (*((vector<T,Allo>::const_iterator *)this))-=i; 00167 check_relevance(); 00168 return *this; 00169 } |
|
00135 { 00136 check_relevance(); 00137 return (*((vector<T,Allo>::const_iterator *)this))==i; 00138 } |
|
00131 { 00132 check_relevance(); 00133 return (*((vector<T,Allo>::const_iterator *)this))==i; 00134 } |
|
|
|
|