AddressTreeSet

extends ConcurrentSkipListSet<E>

java.lang.Object
↳	java.util.AbstractCollection<E>
	↳	java.util.AbstractSet<E>
		↳	java.util.concurrent.ConcurrentSkipListSet<E>
			↳	com.pnfsoftware.jeb.util.collect.AddressTreeSet

Class Overview

A concurrent ordered set whose values are 'addresses' hardcoded as unsigned long.

Public Constructors
	AddressTreeSet(int bitsize) Create a map designed to hold memory keys as addresses.

Public Methods
boolean	add(Long k)

Inherited Methods

From class java.util.concurrent.ConcurrentSkipListSet

boolean	add(E arg0)
E	ceiling(E arg0)
void	clear()
Object	clone()
Comparator<? super E>	comparator()
boolean	contains(Object arg0)
Iterator<E>	descendingIterator()
NavigableSet<E>	descendingSet()
boolean	equals(Object arg0)
E	first()
E	floor(E arg0)
SortedSet	headSet(Object arg0)
NavigableSet<E>	headSet(E arg0, boolean arg1)
NavigableSet<E>	headSet(E arg0)
E	higher(E arg0)
boolean	isEmpty()
Iterator<E>	iterator()
E	last()
E	lower(E arg0)
E	pollFirst()
E	pollLast()
boolean	remove(Object arg0)
boolean	removeAll(Collection<?> arg0)
int	size()
Spliterator<E>	spliterator()
SortedSet	subSet(Object arg0, Object arg1)
NavigableSet<E>	subSet(E arg0, boolean arg1, E arg2, boolean arg3)
NavigableSet<E>	subSet(E arg0, E arg1)
NavigableSet<E>	tailSet(E arg0, boolean arg1)
NavigableSet<E>	tailSet(E arg0)
SortedSet	tailSet(Object arg0)

From class java.util.AbstractSet

From class java.util.AbstractCollection

boolean	add(E arg0)
boolean	addAll(Collection<? extends E> arg0)
void	clear()
boolean	contains(Object arg0)
boolean	containsAll(Collection<?> arg0)
boolean	isEmpty()
abstract Iterator<E>	iterator()
boolean	remove(Object arg0)
boolean	removeAll(Collection<?> arg0)
boolean	retainAll(Collection<?> arg0)
abstract int	size()
<T> T[]	toArray(T[] arg0)
Object[]	toArray()
String	toString()

From class java.lang.Object

From interface java.lang.Iterable

From interface java.util.Collection

abstract boolean	add(E arg0)
abstract boolean	addAll(Collection<? extends E> arg0)
abstract void	clear()
abstract boolean	contains(Object arg0)
abstract boolean	containsAll(Collection<?> arg0)
abstract boolean	equals(Object arg0)
abstract int	hashCode()
abstract boolean	isEmpty()
abstract Iterator<E>	iterator()
abstract Stream<E>	parallelStream()
abstract boolean	remove(Object arg0)
abstract boolean	removeAll(Collection<?> arg0)
abstract boolean	removeIf(Predicate<? super E> arg0)
abstract boolean	retainAll(Collection<?> arg0)
abstract int	size()
abstract Spliterator<E>	spliterator()
abstract Stream<E>	stream()
abstract <T> T[]	toArray(T[] arg0)
abstract Object[]	toArray()
abstract <T> T[]	toArray(IntFunction<T[]> arg0)

From interface java.util.NavigableSet

abstract E	ceiling(E arg0)
abstract Iterator<E>	descendingIterator()
abstract NavigableSet<E>	descendingSet()
abstract E	floor(E arg0)
abstract NavigableSet<E>	headSet(E arg0, boolean arg1)
abstract SortedSet<E>	headSet(E arg0)
abstract E	higher(E arg0)
abstract Iterator<E>	iterator()
abstract E	lower(E arg0)
abstract E	pollFirst()
abstract E	pollLast()
abstract NavigableSet<E>	subSet(E arg0, boolean arg1, E arg2, boolean arg3)
abstract SortedSet<E>	subSet(E arg0, E arg1)
abstract SortedSet<E>	tailSet(E arg0)
abstract NavigableSet<E>	tailSet(E arg0, boolean arg1)

From interface java.util.Set

abstract boolean	add(E arg0)
abstract boolean	addAll(Collection<? extends E> arg0)
abstract void	clear()
abstract boolean	contains(Object arg0)
abstract boolean	containsAll(Collection<?> arg0)
abstract static <E> Set<E>	copyOf(Collection<? extends E> arg0)
abstract boolean	equals(Object arg0)
abstract int	hashCode()
abstract boolean	isEmpty()
abstract Iterator<E>	iterator()
abstract static <E> Set<E>	of(E arg0, E arg1, E arg2)
abstract static <E> Set<E>	of(E arg0, E arg1, E arg2, E arg3, E arg4, E arg5, E arg6, E arg7, E arg8)
abstract static <E> Set<E>	of(E arg0, E arg1, E arg2, E arg3, E arg4)
abstract static <E> Set<E>	of(E arg0, E arg1, E arg2, E arg3, E arg4, E arg5)
abstract static <E> Set<E>	of(E arg0, E arg1, E arg2, E arg3, E arg4, E arg5, E arg6, E arg7)
abstract static <E> Set<E>	of()
abstract static <E> Set<E>	of(E arg0, E arg1, E arg2, E arg3, E arg4, E arg5, E arg6, E arg7, E arg8, E arg9)
abstract static <E> Set<E>	of(E arg0, E arg1)
abstract static <E> Set<E>	of(E... arg0)
abstract static <E> Set<E>	of(E arg0, E arg1, E arg2, E arg3, E arg4, E arg5, E arg6)
abstract static <E> Set<E>	of(E arg0, E arg1, E arg2, E arg3)
abstract static <E> Set<E>	of(E arg0)
abstract boolean	remove(Object arg0)
abstract boolean	removeAll(Collection<?> arg0)
abstract boolean	retainAll(Collection<?> arg0)
abstract int	size()
abstract Spliterator<E>	spliterator()
abstract Object[]	toArray()
abstract <T> T[]	toArray(T[] arg0)

From interface java.util.SortedSet

Create a map designed to hold memory keys as addresses.

bitsize	in [1, 64]