template<class K, class V>inline LCVMassociative_array_iterator<K,V> LCVMassociative_array_iterator(LCVMassociative_array<K, V> &A)

default constructor -- needs an LCVMassociative_array.

[more]classLCVMassociative_arrayK V friend ostream& operator<<<> (ostream&, const LCVMassociative_array_iterator<K, V>&)
[more]friend ostream& operator<< (ostream&, const LCVMassociative_array_iterator<K, V>&)
[more] LCVMassociative_array_iterator(LCVMassociative_array<K, V>&)
constructor(needs a LCVMassociative_array)
[more] LCVMassociative_array_iterator(const LCVMassociative_array_iterator&)
copy constructor
[more] ~LCVMassociative_array_iterator()
[more]LCVMassociative_array_iterator& operator= (const LCVMassociative_array_iterator&)
assignment operator
[more]int operator==(const LCVMassociative_array_iterator&) const
equality operator
[more]int operator!=(const LCVMassociative_array_iterator&) const
not equal operator
[more]LCVMassociative_array_iterator& operator++()
advance the iterator
[more]LCVMassociative_array_iterator& operator--()
backup the iterator
[more]LCVMassociative_array_iterator& next()
same as operator++()
[more]LCVMassociative_array_iterator& prev()
same as operator--()
[more]LCVMassociative_array_iterator& to_head()
moves the iterator to the head of the list
[more]LCVMassociative_array_iterator& to_rear()
moves the iterator to the rear of the list
[more]int at_head() const
[more]int at_rear() const
check if the iterator is at the first node
[more]int is_null() const
check if the iterator is at the last node
[more]int not_null() const
check if the iterator is null
[more]const K& key() const
check if the iterator is not null
[more]V& value() const
return the key in the node
[more]int get_size() const
return the value in the node
[more]int is_empty() const
return a count of the nodes in a list
[more]int not_empty() const
check if the list is empty
[more]void print(ostream&) const
check if the list is not empty
oLCVMdoubly_linked_list_iterator< LCVMassociative_array_node<K,V> > list_it
print function


Documentation

default constructor -- needs an LCVMassociative_array.
oclassLCVMassociative_arrayK V friend ostream& operator<<<> (ostream&, const LCVMassociative_array_iterator<K, V>&)

ofriend ostream& operator<< (ostream&, const LCVMassociative_array_iterator<K, V>&)

o LCVMassociative_array_iterator(LCVMassociative_array<K, V>&)
constructor(needs a LCVMassociative_array)

o LCVMassociative_array_iterator(const LCVMassociative_array_iterator&)
copy constructor

o ~LCVMassociative_array_iterator()

oLCVMassociative_array_iterator& operator= (const LCVMassociative_array_iterator&)
assignment operator

oint operator==(const LCVMassociative_array_iterator&) const
equality operator

oint operator!=(const LCVMassociative_array_iterator&) const
not equal operator

oLCVMassociative_array_iterator& operator++()
advance the iterator

oLCVMassociative_array_iterator& operator--()
backup the iterator

oLCVMassociative_array_iterator& next()
same as operator++()

oLCVMassociative_array_iterator& prev()
same as operator--()

oLCVMassociative_array_iterator& to_head()
moves the iterator to the head of the list

oLCVMassociative_array_iterator& to_rear()
moves the iterator to the rear of the list

oint at_head() const

oint at_rear() const
check if the iterator is at the first node

oint is_null() const
check if the iterator is at the last node

oint not_null() const
check if the iterator is null

oconst K& key() const
check if the iterator is not null

oV& value() const
return the key in the node

oint get_size() const
return the value in the node

oint is_empty() const
return a count of the nodes in a list

oint not_empty() const
check if the list is empty

ovoid print(ostream&) const
check if the list is not empty

Alphabetic index HTML hierarchy of classes or Java



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