org.adblocktv.tagsserver.utils.rbtree.RedBlackTreeSet< K extends Comparable > Class Reference

Inheritance diagram for org.adblocktv.tagsserver.utils.rbtree.RedBlackTreeSet< K extends Comparable >:

Public Member Functions
void	add (K e)
boolean	contains (K e)
void	remove (K e)
Iterator< K >	iterator ()

Detailed Description

A simple implementation of a set using an underlying red-black tree.

Author

Karol Sobczak

Definition at line 12 of file RedBlackTreeSet.java.

Member Function Documentation

void org.adblocktv.tagsserver.utils.rbtree.RedBlackTreeSet< K extends Comparable >.add

(

K

e

)

Adds a value to the set.

Parameters

e	a value to be added to the set

Definition at line 42 of file RedBlackTreeSet.java.

boolean org.adblocktv.tagsserver.utils.rbtree.RedBlackTreeSet< K extends Comparable >.contains

(

K

e

)

Checks if the set contains a given value.

Parameters

e	a value to be checked for existence

Returns

true if the set contains a given value

Definition at line 54 of file RedBlackTreeSet.java.

Iterator<K> org.adblocktv.tagsserver.utils.rbtree.RedBlackTreeSet< K extends Comparable >.iterator

(

)

Returns an iterator for the set (ascending order).

Returns

an iterator for the set (ascending order)

Definition at line 75 of file RedBlackTreeSet.java.

void org.adblocktv.tagsserver.utils.rbtree.RedBlackTreeSet< K extends Comparable >.remove

(

K

e

)

Removes a given value from the set.

Parameters

e	a value to be removed from the set

Definition at line 63 of file RedBlackTreeSet.java.

---

The documentation for this class was generated from the following file:

• rbtree/RedBlackTreeSet.java