/* Copyright (c) 2001-2016, The HSQL Development Group
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* Neither the name of the HSQL Development Group nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL HSQL DEVELOPMENT GROUP, HSQLDB.ORG,
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package org.hsqldb.lib;
import org.hsqldb.map.
BaseHashMap;
/**
* This class does not store null keys.
*
* @author Fred Toussi (fredt@users dot sourceforge.net)
* @version 2.3.4
* @since 1.7.2
*/
public class
HashSet extends
BaseHashMap implements
Set {
public
HashSet() {
this(8);
}
public
HashSet(int
initialCapacity) throws
IllegalArgumentException {
super(
initialCapacity,
BaseHashMap.
objectKeyOrValue,
BaseHashMap.
noKeyOrValue, false);
}
public void
setComparator(
ObjectComparator comparator) {
super.setComparator(
comparator);
}
public boolean
contains(
Object key) {
return super.containsKey(
key);
}
public boolean
containsAll(
Collection col) {
Iterator it =
col.
iterator();
while (
it.
hasNext()) {
if (
contains(
it.
next())) {
continue;
}
return false;
}
return true;
}
public
Object get(
Object key) {
int
lookup =
getLookup(
key,
key.
hashCode());
if (
lookup < 0) {
return null;
} else {
return
objectKeyTable[
lookup];
}
}
/** returns true if added */
public boolean
add(
Object key) {
int
count =
size();
super.addOrRemove(0, 0,
key, null, false);
return
count !=
size();
}
/** returns true if any added */
public boolean
addAll(
Collection c) {
boolean
changed = false;
Iterator it =
c.
iterator();
while (
it.
hasNext()) {
changed |=
add(
it.
next());
}
return
changed;
}
/** returns true if any added */
public boolean
addAll(
Object[]
keys) {
boolean
changed = false;
for (int
i = 0;
i <
keys.length;
i++) {
changed |=
add(
keys[
i]);
}
return
changed;
}
/** returns true if any added */
public boolean
addAll(
Object[]
keys, int
start, int
limit) {
boolean
changed = false;
for (int
i =
start;
i <
keys.length &&
i <
limit;
i++) {
changed |=
add(
keys[
i]);
}
return
changed;
}
/** returns true if removed */
public boolean
remove(
Object key) {
return super.removeObject(
key, false) != null;
}
/** returns true if all were removed */
public boolean
removeAll(
Collection c) {
Iterator it =
c.
iterator();
boolean
result = true;
while (
it.
hasNext()) {
result &=
remove(
it.
next());
}
return
result;
}
/** returns true if all were removed */
public boolean
removeAll(
Object[]
keys) {
boolean
result = true;
for (int
i = 0;
i <
keys.length;
i++) {
result &=
remove(
keys[
i]);
}
return
result;
}
public void
toArray(
Object[]
a) {
Iterator it =
iterator();
for (int
i = 0;
it.
hasNext();
i++) {
a[
i] =
it.
next();
}
}
public
Object[]
toArray() {
if (
isEmpty()) {
return
emptyObjectArray;
}
Object[]
array = new
Object[
size()];
toArray(
array);
return
array;
}
public
Iterator iterator() {
return new
BaseHashIterator(true);
}
/**
* Returns a String like "[Drei, zwei, Eins]", exactly like
* java.util.HashSet.
*/
public
String toString() {
Iterator it =
iterator();
StringBuffer sb = new
StringBuffer();
while (
it.
hasNext()) {
if (
sb.
length() > 0) {
sb.
append(", ");
} else {
sb.
append('[');
}
sb.
append(
it.
next());
}
return
sb.
toString() + ']';
}
}