public interface FastSet
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(int e) |
void |
addAll(FastSet c) |
void |
clear()
clear the set
|
void |
completeSet(int value) |
boolean |
contains(int o) |
boolean |
containsAll(FastSet c) |
boolean |
containsAny(FastSet c) |
int |
get(int i) |
boolean |
intersect(FastSet f) |
boolean |
isEmpty() |
void |
remove(int o) |
void |
removeAll(int i,
int end)
remove all elements between the two positions
|
void |
removeAllValues(int... values) |
void |
removeAt(int o) |
int |
size() |
int[] |
toIntArray() |
boolean add(int e)
e - add evoid addAll(FastSet c)
c - all elements to addvoid clear()
boolean contains(int o)
o - int to checkboolean containsAll(FastSet c)
c - elements to checkboolean isEmpty()
void remove(int o)
o - element to removeint size()
int[] toIntArray()
boolean intersect(FastSet f)
f - set to checkint get(int i)
i - positionvoid removeAt(int o)
o - position to remove element fromvoid removeAll(int i,
int end)
i - beginning positionend - end positionvoid removeAllValues(int... values)
values - elements to removeboolean containsAny(FastSet c)
c - elements to checkvoid completeSet(int value)
value - valueCopyright © 2020 The University of Manchester. All rights reserved.