Class TreeValueSortedMap.ValueSortedTreeMapEntrySet

java.lang.Object

java.util.AbstractCollection<Map.Entry<K,V>>

java.util.AbstractSet<Map.Entry<K,V>>

ghidra.generic.util.datastruct.TreeValueSortedMap.ValueSortedTreeMapEntrySet

All Implemented Interfaces:

ValueSortedMap.LesserList<Map.Entry<K,V>>, ValueSortedMap.ValueSortedMapEntryList<K,V>, Iterable<Map.Entry<K,V>>, Collection<Map.Entry<K,V>>, Set<Map.Entry<K,V>>

Enclosing class:

TreeValueSortedMap<K,V>

protected class TreeValueSortedMap.ValueSortedTreeMapEntrySet
extends AbstractSet<Map.Entry<K,V>>
implements ValueSortedMap.ValueSortedMapEntryList<K,V>

A public view of the map as a set of entries In addition to Set, this view implements List and Deque, since an ordered set ought to behave like a list, and since this implementation is meant to be used as a dynamic-cost priority queue. Generally, all of the mutation methods are supported.

Method Summary

Modifier and Type	Method	Description
boolean	add(Map.Entry<K,V> e)	Inserts (by copy) the entry into the owning map
void	clear()
boolean	contains(Object o)
Map.Entry<K,V>	get(int index)	Get the element at the given index
int	indexOf(Object o)	Get the index of a given element
boolean	isEmpty()
Iterator<Map.Entry<K,V>>	iterator()
ListIterator<Map.Entry<K,V>>	listIterator(int index)
Map.Entry<K,V>	poll()	Get and remove the first element
boolean	remove(Object o)
int	size()
List<Map.Entry<K,V>>	toList()	Copy this to a new list

Methods inherited from class AbstractSet

equals, hashCode, removeAll

Methods inherited from class AbstractCollection

addAll, containsAll, retainAll, toArray, toArray, toString

Methods inherited from class Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface Collection

parallelStream, removeIf, stream, toArray

Methods inherited from interface Iterable

forEach

Methods inherited from interface Set

addAll, containsAll, retainAll, spliterator, toArray, toArray

Methods inherited from interface ValueSortedMap.LesserList

removeAll

Method Details

toList

public List<Map.Entry<K,V>> toList()

Description copied from interface: ValueSortedMap.LesserList

Copy this to a new list

Specified by:

toList in interface ValueSortedMap.LesserList<Map.Entry<K,V>>

Returns:

the list

add

public boolean add(Map.Entry<K,V> e)

Inserts (by copy) the entry into the owning map

Specified by:

add in interface Collection<Map.Entry<K,V>>

Specified by:

add in interface Set<Map.Entry<K,V>>

Overrides:

add in class AbstractCollection<Map.Entry<K,V>>

clear

public void clear()

Specified by:

clear in interface Collection<Map.Entry<K,V>>

Specified by:

clear in interface Set<Map.Entry<K,V>>

Overrides:

clear in class AbstractCollection<Map.Entry<K,V>>

contains

public boolean contains(Object o)

Specified by:

contains in interface Collection<Map.Entry<K,V>>

Specified by:

contains in interface Set<Map.Entry<K,V>>

Specified by:

contains in interface ValueSortedMap.LesserList<Map.Entry<K,V>>

Overrides:

contains in class AbstractCollection<Map.Entry<K,V>>

get

public Map.Entry<K,V> get(int index)

Description copied from interface: ValueSortedMap.LesserList

Get the element at the given index

Specified by:

get in interface ValueSortedMap.LesserList<Map.Entry<K,V>>

Parameters:

index - the index

Returns:

the element

indexOf

public int indexOf(Object o)

Description copied from interface: ValueSortedMap.LesserList

Get the index of a given element

Returns the index of the element, or -1 if not found

Specified by:

indexOf in interface ValueSortedMap.LesserList<Map.Entry<K,V>>

Parameters:

o - the object

Returns:

the index or -1

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Collection<Map.Entry<K,V>>

Specified by:

isEmpty in interface Set<Map.Entry<K,V>>

Specified by:

isEmpty in interface ValueSortedMap.LesserList<Map.Entry<K,V>>

Overrides:

isEmpty in class AbstractCollection<Map.Entry<K,V>>

listIterator

public ListIterator<Map.Entry<K,V>> listIterator(int index)

Specified by:

listIterator in interface ValueSortedMap.LesserList<Map.Entry<K,V>>

iterator

public Iterator<Map.Entry<K,V>> iterator()

Specified by:

iterator in interface Collection<Map.Entry<K,V>>

Specified by:

iterator in interface Iterable<Map.Entry<K,V>>

Specified by:

iterator in interface Set<Map.Entry<K,V>>

Specified by:

iterator in class AbstractCollection<Map.Entry<K,V>>

poll

public Map.Entry<K,V> poll()

Description copied from interface: ValueSortedMap.LesserList

Get and remove the first element

Specified by:

poll in interface ValueSortedMap.LesserList<Map.Entry<K,V>>

Returns:

the first element, or null if empty

remove

public boolean remove(Object o)

Specified by:

remove in interface Collection<Map.Entry<K,V>>

Specified by:

remove in interface Set<Map.Entry<K,V>>

Specified by:

remove in interface ValueSortedMap.LesserList<Map.Entry<K,V>>

Overrides:

remove in class AbstractCollection<Map.Entry<K,V>>

size

public int size()

Specified by:

size in interface Collection<Map.Entry<K,V>>

Specified by:

size in interface Set<Map.Entry<K,V>>

Specified by:

size in interface ValueSortedMap.LesserList<Map.Entry<K,V>>

Specified by:

size in class AbstractCollection<Map.Entry<K,V>>