25 T *
elem()
const {
return m_elem; }
47 int size()
const {
return count; }
52 first = new_list_elem;
65 first = new_list_elem;
70 first = new_list_elem;
79 while (curr && curr->
elem() != elem) {
86 if (curr == last) last =
NULp;
91 if (curr == last) last = pred;
99 if (!elem || !count)
return false;
102 while (curr && curr->
elem()!=elem) {
111 #error ed4_list.hxx included twice
112 #endif // ED4_LIST_HXX
ED4_list_elem< T > * tail() const
void set_next(ED4_list_elem *the_next)
ED4_list_elem * next() const
void append_elem(T *elem)
bool has_elem(const T *elem) const
ED4_list_elem< T > * head() const
void remove_elem(const T *elem)
void prepend_elem(T *elem)
ED4_list_elem(T *element)