template<class NODE_TYPE>inline int LCVMdoubly_linked_list<NODE_TYPE> get_size() const

return the number of nodes in the list

[more]classLCVMdoubly_linked_list_iterator NODE_TYPE
doubly linked list class LCVMdoubly_linked_list
[more]friend ostream& operator<<<>(ostream&, const LCVMdoubly_linked_list<NODE_TYPE>&)
[more]friend ostream& operator<<(ostream&, const LCVMdoubly_linked_list<NODE_TYPE>&)
[more] LCVMdoubly_linked_list()
we start with constructors and destructors
[more] LCVMdoubly_linked_list(LCVMdoubly_linked_list<NODE_TYPE>&)
) is a bad idea.....
[more] LCVMdoubly_linked_list(LCVMdoubly_linked_list<NODE_TYPE>&, const int, const int)
) is a bad idea.....
[more] ~LCVMdoubly_linked_list()
[more]LCVMdoubly_linked_list<NODE_TYPE> & append(const NODE_TYPE&)
append to list end
[more]LCVMdoubly_linked_list<NODE_TYPE> & prepend(const NODE_TYPE&)
prepend to list font
[more]LCVMdoubly_linked_list<NODE_TYPE> & insert_after(const NODE_TYPE&)
insert after current
[more]LCVMdoubly_linked_list<NODE_TYPE> & insert_before(const NODE_TYPE&)
insert before current
[more]LCVMdoubly_linked_list<NODE_TYPE> & append(const LCVMarray<NODE_TYPE>&)
append an LCVMarray to end of list
[more]LCVMdoubly_linked_list<NODE_TYPE> & prepend(const LCVMarray<NODE_TYPE>&)
prepend an LCVMarray to front of list
[more]LCVMdoubly_linked_list<NODE_TYPE> & insert_after(const LCVMarray<NODE_TYPE>&)
insert an LCVMarray after current
[more]LCVMdoubly_linked_list<NODE_TYPE> & insert_before(const LCVMarray<NODE_TYPE>&)
insert an LCVMarray before current
[more]LCVMdoubly_linked_list<NODE_TYPE> & append(LCVMdoubly_linked_list<NODE_TYPE>&)
append the given list to end of list
[more]LCVMdoubly_linked_list<NODE_TYPE> & prepend(LCVMdoubly_linked_list<NODE_TYPE>&)
prepend the given list to front of list
[more]LCVMdoubly_linked_list<NODE_TYPE> & insert_after(LCVMdoubly_linked_list<NODE_TYPE>&)
insert the given list after current
[more]LCVMdoubly_linked_list<NODE_TYPE> & insert_before(LCVMdoubly_linked_list<NODE_TYPE>&)
insert the given list before current
[more]LCVMdoubly_linked_list<NODE_TYPE> & remove()
remove the current element (current moves ahead)
[more]LCVMdoubly_linked_list<NODE_TYPE> & remove(const int)
remove a given number of nodes
[more]LCVMdoubly_linked_list<NODE_TYPE> & erase()
remove all the nodes in a list
[more]int null_current() const
various checks on the list
[more]int not_null_current() const
check if the current pointer is null
[more]int at_head() const
check if current poiner is not null
[more]int at_rear() const
check if current pointer is at front
[more]int is_empty() const
check if current pointer is at rear
[more]int not_empty() const
check if the list is empty
[more]LCVMdoubly_linked_list<NODE_TYPE> & reverse()
various utility functions
[more]LCVMdoubly_linked_list<NODE_TYPE> & to_head()
reverse the list
[more]LCVMdoubly_linked_list<NODE_TYPE> & to_rear()
move current to front
[more]LCVMdoubly_linked_list<NODE_TYPE> & next()
move current to rear
[more]LCVMdoubly_linked_list<NODE_TYPE> & prev()
advance current pointer
[more]LCVMdoubly_linked_list<NODE_TYPE> & operator++()
backup current pointer
[more]LCVMdoubly_linked_list<NODE_TYPE> & operator--()
same as next()
[more]LCVMdoubly_linked_list<NODE_TYPE> & goto_element(const int n)
for interpretation of n
[more]NODE_TYPE& operator[](const int)
is an error
[more]int get_size() const
[more]NODE_TYPE get_data() const
return the number of elements in the list
[more]NODE_TYPE& operator*()
return the data in the node
[more]NODE_TYPE& get_data_ref()
return reference to data: same as operator*()
[more]LCVMdoubly_linked_list<NODE_TYPE> & set_data(const NODE_TYPE&)
set the data in the node: set up to allow chaining
[more]LCVMdoubly_linked_list<NODE_TYPE> & operator= (LCVMdoubly_linked_list<NODE_TYPE>&)
assignment operator--assign one list to another
[more]int operator==(LCVMdoubly_linked_list<NODE_TYPE>&)
check for equality of lists
[more]int operator!=(LCVMdoubly_linked_list<NODE_TYPE>&)
check for non equality
[more]void get_data_array(LCVMarray<NODE_TYPE>&)
return an LCVMarray<NODE_TYPE> of the data
[more]void print(ostream&) const
oint is_null(LCVMdoubly_linked_list_node_base *) const
check if the given pointer is null
oint not_null(LCVMdoubly_linked_list_node_base *) const
check if the given pointer is not null
oint at_head(LCVMdoubly_linked_list_node_base *) const
check if the given pointer is at front
oint at_rear(LCVMdoubly_linked_list_node_base *) const
check if the given pointer is at rear
oLCVMdoubly_linked_list<NODE_TYPE> & to_head(LCVMdoubly_linked_list_node_base *&)
move the given pointer to the front
oLCVMdoubly_linked_list<NODE_TYPE> & to_rear(LCVMdoubly_linked_list_node_base *&)
move the given pointer to the back
oLCVMdoubly_linked_list<NODE_TYPE> & next(LCVMdoubly_linked_list_node_base *&)
advance the given pointer
oLCVMdoubly_linked_list<NODE_TYPE> & prev(LCVMdoubly_linked_list_node_base *&)
backup the given pointer
oLCVMdoubly_linked_list_node<NODE_TYPE> * make_new_node( const NODE_TYPE&, LCVMdoubly_linked_list_node_base*, LCVMdoubly_linked_list_node_base* )
utility function to make a new node
oint index(const int) const
utility function for the [] operator
oint count
the data for the list
oLCVMdoubly_linked_list_node_base list_node
number of elements in the list
oLCVMdoubly_linked_list_node_base* current
the head node for the list
oint iterator_count
pointer to the current node
o
the number of iterators for the list


Documentation

return the number of nodes in the list
oclassLCVMdoubly_linked_list_iterator NODE_TYPE
doubly linked list class LCVMdoubly_linked_list

ofriend ostream& operator<<<>(ostream&, const LCVMdoubly_linked_list<NODE_TYPE>&)

ofriend ostream& operator<<(ostream&, const LCVMdoubly_linked_list<NODE_TYPE>&)

o LCVMdoubly_linked_list()
we start with constructors and destructors

o LCVMdoubly_linked_list(LCVMdoubly_linked_list<NODE_TYPE>&)
) is a bad idea.....

o LCVMdoubly_linked_list(LCVMdoubly_linked_list<NODE_TYPE>&, const int, const int)
) is a bad idea.....

o ~LCVMdoubly_linked_list()

oLCVMdoubly_linked_list<NODE_TYPE> & append(const NODE_TYPE&)
append to list end

oLCVMdoubly_linked_list<NODE_TYPE> & prepend(const NODE_TYPE&)
prepend to list font

oLCVMdoubly_linked_list<NODE_TYPE> & insert_after(const NODE_TYPE&)
insert after current

oLCVMdoubly_linked_list<NODE_TYPE> & insert_before(const NODE_TYPE&)
insert before current

oLCVMdoubly_linked_list<NODE_TYPE> & append(const LCVMarray<NODE_TYPE>&)
append an LCVMarray to end of list

oLCVMdoubly_linked_list<NODE_TYPE> & prepend(const LCVMarray<NODE_TYPE>&)
prepend an LCVMarray to front of list

oLCVMdoubly_linked_list<NODE_TYPE> & insert_after(const LCVMarray<NODE_TYPE>&)
insert an LCVMarray after current

oLCVMdoubly_linked_list<NODE_TYPE> & insert_before(const LCVMarray<NODE_TYPE>&)
insert an LCVMarray before current

oLCVMdoubly_linked_list<NODE_TYPE> & append(LCVMdoubly_linked_list<NODE_TYPE>&)
append the given list to end of list

oLCVMdoubly_linked_list<NODE_TYPE> & prepend(LCVMdoubly_linked_list<NODE_TYPE>&)
prepend the given list to front of list

oLCVMdoubly_linked_list<NODE_TYPE> & insert_after(LCVMdoubly_linked_list<NODE_TYPE>&)
insert the given list after current

oLCVMdoubly_linked_list<NODE_TYPE> & insert_before(LCVMdoubly_linked_list<NODE_TYPE>&)
insert the given list before current

oLCVMdoubly_linked_list<NODE_TYPE> & remove()
remove the current element (current moves ahead)

oLCVMdoubly_linked_list<NODE_TYPE> & remove(const int)
remove a given number of nodes

oLCVMdoubly_linked_list<NODE_TYPE> & erase()
remove all the nodes in a list

oint null_current() const
various checks on the list

oint not_null_current() const
check if the current pointer is null

oint at_head() const
check if current poiner is not null

oint at_rear() const
check if current pointer is at front

oint is_empty() const
check if current pointer is at rear

oint not_empty() const
check if the list is empty

oLCVMdoubly_linked_list<NODE_TYPE> & reverse()
various utility functions

oLCVMdoubly_linked_list<NODE_TYPE> & to_head()
reverse the list

oLCVMdoubly_linked_list<NODE_TYPE> & to_rear()
move current to front

oLCVMdoubly_linked_list<NODE_TYPE> & next()
move current to rear

oLCVMdoubly_linked_list<NODE_TYPE> & prev()
advance current pointer

oLCVMdoubly_linked_list<NODE_TYPE> & operator++()
backup current pointer

oLCVMdoubly_linked_list<NODE_TYPE> & operator--()
same as next()

oLCVMdoubly_linked_list<NODE_TYPE> & goto_element(const int n)
for interpretation of n

oNODE_TYPE& operator[](const int)
is an error

oint get_size() const

oNODE_TYPE get_data() const
return the number of elements in the list

oNODE_TYPE& operator*()
return the data in the node

oNODE_TYPE& get_data_ref()
return reference to data: same as operator*()

oLCVMdoubly_linked_list<NODE_TYPE> & set_data(const NODE_TYPE&)
set the data in the node: set up to allow chaining

oLCVMdoubly_linked_list<NODE_TYPE> & operator= (LCVMdoubly_linked_list<NODE_TYPE>&)
assignment operator--assign one list to another

oint operator==(LCVMdoubly_linked_list<NODE_TYPE>&)
check for equality of lists

oint operator!=(LCVMdoubly_linked_list<NODE_TYPE>&)
check for non equality

ovoid get_data_array(LCVMarray<NODE_TYPE>&)
return an LCVMarray<NODE_TYPE> of the data

ovoid print(ostream&) const

Alphabetic index HTML hierarchy of classes or Java



This page was generated with the help of DOC++.