return an iterator over the entire list . the iterator may be used to delete entries as well as to retrieve existing entries . a knowledgeable user can cast this to a hashedlistiterator and use it to add as well as delete entries . concode_field_sep Object reference concode_elem_sep HashedListElement next concode_elem_sep HashedListElement last concode_elem_sep HashedListElement current concode_elem_sep int numElements concode_elem_sep HashedListElement last concode_elem_sep HashMap hash concode_elem_sep HashedListElement prev concode_elem_sep HashedListElement first concode_elem_sep Object key concode_field_sep Object next concode_elem_sep void add concode_elem_sep void add concode_elem_sep boolean add concode_elem_sep boolean add concode_elem_sep HashedListElement add concode_elem_sep boolean hasPrev concode_elem_sep boolean containsKey concode_elem_sep Object prev concode_elem_sep boolean containsAll concode_elem_sep void clear concode_elem_sep boolean isEmpty concode_elem_sep boolean hasNext concode_elem_sep boolean replaceKey concode_elem_sep void remove concode_elem_sep boolean remove concode_elem_sep void remove concode_elem_sep boolean contains concode_elem_sep boolean removeAll concode_elem_sep boolean removeKey concode_elem_sep int size concode_elem_sep boolean addAll concode_elem_sep HashedListElement getElement concode_elem_sep Object get concode_elem_sep Object get concode_elem_sep Object[] toArray concode_elem_sep Object[] toArray concode_elem_sep void setCurrent concode_elem_sep void setKey concode_elem_sep boolean retainAll
Iterator function ( ) { return new HashedListIterator ( first ) ; }