|
Lines 8-14
Link Here
|
| 8 |
|
8 |
|
| 9 |
|
9 |
|
| 10 |
template <class T> CCCC_Table<T>::CCCC_Table() |
10 |
template <class T> CCCC_Table<T>::CCCC_Table() |
| 11 |
: iter_(end()), sorted(true) |
11 |
: iter_(map_t::end()), sorted(true) |
| 12 |
{ |
12 |
{ |
| 13 |
} |
13 |
} |
| 14 |
|
14 |
|
|
Lines 46-52
Link Here
|
| 46 |
{ |
46 |
{ |
| 47 |
T *retval=NULL; |
47 |
T *retval=NULL; |
| 48 |
typename map_t::iterator value_iterator=map_t::find(name); |
48 |
typename map_t::iterator value_iterator=map_t::find(name); |
| 49 |
if(value_iterator!=end()) |
49 |
if(value_iterator!=map_t::end()) |
| 50 |
{ |
50 |
{ |
| 51 |
retval=(*value_iterator).second; |
51 |
retval=(*value_iterator).second; |
| 52 |
} |
52 |
} |
|
Lines 91-97
Link Here
|
| 91 |
|
91 |
|
| 92 |
template <class T> void CCCC_Table<T>::reset_iterator() |
92 |
template <class T> void CCCC_Table<T>::reset_iterator() |
| 93 |
{ |
93 |
{ |
| 94 |
iter_=begin(); |
94 |
iter_=map_t::begin(); |
| 95 |
} |
95 |
} |
| 96 |
|
96 |
|
| 97 |
template <class T> T* CCCC_Table<T>::first_item() |
97 |
template <class T> T* CCCC_Table<T>::first_item() |
|
Lines 103-109
Link Here
|
| 103 |
template <class T> T* CCCC_Table<T>::next_item() |
103 |
template <class T> T* CCCC_Table<T>::next_item() |
| 104 |
{ |
104 |
{ |
| 105 |
T* retval=NULL; |
105 |
T* retval=NULL; |
| 106 |
if(iter_!=end()) |
106 |
if(iter_!=map_t::end()) |
| 107 |
{ |
107 |
{ |
| 108 |
retval=(*iter_).second; |
108 |
retval=(*iter_).second; |
| 109 |
iter_++; |
109 |
iter_++; |
|
Lines 113-119
Link Here
|
| 113 |
|
113 |
|
| 114 |
template <class T> int CCCC_Table<T>::records() |
114 |
template <class T> int CCCC_Table<T>::records() |
| 115 |
{ |
115 |
{ |
| 116 |
return size(); |
116 |
return map_t::size(); |
| 117 |
} |
117 |
} |
| 118 |
|
118 |
|
| 119 |
#include "cccc_db.h" |
119 |
#include "cccc_db.h" |
