Class RBTreeSetTester<K extends java.lang.Comparable<K>>

java.lang.Object

RBTreeSetTester<K>

All Implemented Interfaces:

java.lang.Iterable<K>, SetTesterADT<K>

public class RBTreeSetTester<K extends java.lang.Comparable<K>>
extends java.lang.Object
implements SetTesterADT<K>

SetTesterADT implementation using a Java's Treeset, which uses a Red-Black tree as the data structure. DO NOT MODIFY THIS CLASS.

Author:

CS367

Field Summary

Fields

Modifier and Type	Field and Description
(package private) java.util.TreeSet<K>	rbTree

Constructor Summary

Constructors

Constructor and Description
RBTreeSetTester()

Method Summary

Modifier and Type	Method and Description
void	add(K item) Add the key to the set.
void	clear() Clears all the keys in the set.
boolean	contains(K item) Return true iff the set contains the key.
void	displayTree(int maxDisplayLevels) Displays the set but only maxNumLevels from the top of the data structure used by the implementation.
java.util.Iterator<K>	iterator() Returns an iterator for the set.
int	size() Returns the number of keys in the set.
java.util.List<K>	subSet(K minValue, K maxValue) Returns the sorted list of keys in the tree that are in the specified range (inclusive of minValue, exclusive of maxValue).

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Detail

rbTree

java.util.TreeSet<K extends java.lang.Comparable<K>> rbTree

Constructor Detail

RBTreeSetTester

public RBTreeSetTester()

Method Detail

add

public void add(K item)

Description copied from interface: SetTesterADT

Add the key to the set.

Specified by:

add in interface SetTesterADT<K extends java.lang.Comparable<K>>

Parameters:

item - the key to add

contains

public boolean contains(K item)

Description copied from interface: SetTesterADT

Return true iff the set contains the key.

Specified by:

contains in interface SetTesterADT<K extends java.lang.Comparable<K>>

Parameters:

item - the key to search

Returns:

true iff the tester contains the key

subSet

public java.util.List<K> subSet(K minValue,
                                K maxValue)

Description copied from interface: SetTesterADT

Returns the sorted list of keys in the tree that are in the specified range (inclusive of minValue, exclusive of maxValue).

Specified by:

subSet in interface SetTesterADT<K extends java.lang.Comparable<K>>

Parameters:

minValue - the minimum value of the desired range (inclusive)

maxValue - the maximum value of the desired range (exclusive)

Returns:

the sorted list of keys in the specified range

clear

public void clear()

Description copied from interface: SetTesterADT

Clears all the keys in the set.

Specified by:

clear in interface SetTesterADT<K extends java.lang.Comparable<K>>

size

public int size()

Description copied from interface: SetTesterADT

Returns the number of keys in the set.

Specified by:

size in interface SetTesterADT<K extends java.lang.Comparable<K>>

Returns:

the number of keys

displayTree

public void displayTree(int maxDisplayLevels)

Description copied from interface: SetTesterADT

Displays the set but only maxNumLevels from the top of the data structure used by the implementation.

Specified by:

displayTree in interface SetTesterADT<K extends java.lang.Comparable<K>>

Parameters:

maxDisplayLevels - number of levels to display

iterator

public java.util.Iterator<K> iterator()

Description copied from interface: SetTesterADT

Returns an iterator for the set.

Specified by:

iterator in interface java.lang.Iterable<K extends java.lang.Comparable<K>>

Specified by:

iterator in interface SetTesterADT<K extends java.lang.Comparable<K>>

Returns:

the iterator