Package com.google.common.collect

Class LinkedListMultimap.ValueForKeyIterator

java.lang.Object

com.google.common.collect.LinkedListMultimap.ValueForKeyIterator

All Implemented Interfaces:

java.util.Iterator<V>, java.util.ListIterator<V>

Enclosing class:

LinkedListMultimap<K,V>

private class LinkedListMultimap.ValueForKeyIterator
extends java.lang.Object
implements java.util.ListIterator<V>

A ListIterator over values for a specified key.

Field Summary

Fields

Modifier and Type	Field	Description
(package private) LinkedListMultimap.Node<K,V>	current
(package private) java.lang.Object	key
(package private) LinkedListMultimap.Node<K,V>	next
(package private) int	nextIndex
(package private) LinkedListMultimap.Node<K,V>	previous

Constructor Summary

Constructors

Constructor	Description
ValueForKeyIterator(java.lang.Object key)	Constructs a new iterator over all values for the specified key.
ValueForKeyIterator(java.lang.Object key, int index)	Constructs a new iterator over all values for the specified key starting at the specified index.

Method Summary

Modifier and Type	Method	Description
void	add(V value)
boolean	hasNext()
boolean	hasPrevious()
V	next()
int	nextIndex()
V	previous()
int	previousIndex()
void	remove()
void	set(V value)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Iterator

forEachRemaining

Field Detail

key

final java.lang.Object key

nextIndex

int nextIndex

next

LinkedListMultimap.Node<K,V> next

current

LinkedListMultimap.Node<K,V> current

previous

LinkedListMultimap.Node<K,V> previous

Constructor Detail

ValueForKeyIterator

ValueForKeyIterator(java.lang.Object key)

Constructs a new iterator over all values for the specified key.

ValueForKeyIterator

public ValueForKeyIterator(java.lang.Object key,
                           int index)

Constructs a new iterator over all values for the specified key starting at the specified index. This constructor is optimized so that it starts at either the head or the tail, depending on which is closer to the specified index. This allows adds to the tail to be done in constant time.

Throws:

java.lang.IndexOutOfBoundsException - if index is invalid

Method Detail

hasNext

public boolean hasNext()

Specified by:

hasNext in interface java.util.Iterator<V>

Specified by:

hasNext in interface java.util.ListIterator<V>

next

public V next()

Specified by:

next in interface java.util.Iterator<V>

Specified by:

next in interface java.util.ListIterator<V>

hasPrevious

public boolean hasPrevious()

Specified by:

hasPrevious in interface java.util.ListIterator<V>

previous

public V previous()

Specified by:

previous in interface java.util.ListIterator<V>

nextIndex

public int nextIndex()

Specified by:

nextIndex in interface java.util.ListIterator<V>

previousIndex

public int previousIndex()

Specified by:

previousIndex in interface java.util.ListIterator<V>

remove

public void remove()

Specified by:

remove in interface java.util.Iterator<V>

Specified by:

remove in interface java.util.ListIterator<V>

set

public void set(V value)

Specified by:

set in interface java.util.ListIterator<V>

add

public void add(V value)

Specified by:

add in interface java.util.ListIterator<V>