/* Copyright (c) 2001-2014, 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 java.util.
NoSuchElementException;
import org.hsqldb.map.
BaseHashMap;
/**
* This class does not store null keys.
*
* @author Fred Toussi (fredt@users dot sourceforge.net)
* @version 1.9.0
* @since 1.7.2
*/
public class
IntValueHashMap extends
BaseHashMap {
Set keySet;
private
Collection values;
public
IntValueHashMap() {
this(8);
}
public
IntValueHashMap(int
initialCapacity)
throws
IllegalArgumentException {
super(
initialCapacity,
BaseHashMap.
objectKeyOrValue,
BaseHashMap.
intKeyOrValue, false);
}
public int
get(
Object key) throws
NoSuchElementException {
if (
key == null) {
throw new
NoSuchElementException();
}
int
hash =
key.
hashCode();
int
lookup =
getLookup(
key,
hash);
if (
lookup != -1) {
return
intValueTable[
lookup];
}
throw new
NoSuchElementException();
}
public int
get(
Object key, int
defaultValue) {
if (
key == null) {
throw new
NoSuchElementException();
}
int
hash =
key.
hashCode();
int
lookup =
getLookup(
key,
hash);
if (
lookup != -1) {
return
intValueTable[
lookup];
}
return
defaultValue;
}
public boolean
get(
Object key, int[]
value) {
if (
key == null) {
throw new
NoSuchElementException();
}
int
hash =
key.
hashCode();
int
lookup =
getLookup(
key,
hash);
if (
lookup != -1) {
value[0] =
intValueTable[
lookup];
return true;
}
return false;
}
public
Object getKey(int
value) {
BaseHashIterator it = new
BaseHashIterator(false);
while (
it.
hasNext()) {
int
i =
it.
nextInt();
if (
i ==
value) {
return
objectKeyTable[
it.
getLookup()];
}
}
return null;
}
public boolean
put(
Object key, int
value) {
if (
key == null) {
throw new
NoSuchElementException();
}
int
oldSize =
size();
super.addOrRemove(0,
value,
key, null, false);
return
oldSize !=
size();
}
public boolean
remove(
Object key) {
int
oldSize =
size();
super.addOrRemove(0, 0,
key, null, true);
return
oldSize !=
size();
}
public boolean
containsKey(
Object key) {
return super.containsKey(
key);
}
public boolean
containsValue(int
value) {
throw new
UnsupportedOperationException();
}
public
Set keySet() {
if (
keySet == null) {
keySet = new
KeySet();
}
return
keySet;
}
public
Collection values() {
if (
values == null) {
values = new
Values();
}
return
values;
}
class
KeySet implements
Set {
public
Iterator iterator() {
return
IntValueHashMap.this.new
BaseHashIterator(true);
}
public int
size() {
return
IntValueHashMap.this.
size();
}
public boolean
contains(
Object o) {
return
containsKey(
o);
}
public
Object get(
Object key) {
int
lookup =
IntValueHashMap.this.
getLookup(
key,
key.
hashCode());
if (
lookup < 0) {
return null;
} else {
return
IntValueHashMap.this.
objectKeyTable[
lookup];
}
}
public boolean
add(
Object value) {
throw new
UnsupportedOperationException();
}
public boolean
addAll(
Collection c) {
throw new
UnsupportedOperationException();
}
public boolean
remove(
Object o) {
int
oldSize =
size();
IntValueHashMap.this.
remove(
o);
return
size() !=
oldSize;
}
public boolean
isEmpty() {
return
size() == 0;
}
public void
clear() {
IntValueHashMap.this.
clear();
}
}
class
Values implements
Collection {
public
Iterator iterator() {
return
IntValueHashMap.this.new
BaseHashIterator(false);
}
public int
size() {
return
IntValueHashMap.this.
size();
}
public boolean
contains(
Object o) {
throw new
UnsupportedOperationException();
}
public boolean
add(
Object value) {
throw new
UnsupportedOperationException();
}
public boolean
addAll(
Collection c) {
throw new
UnsupportedOperationException();
}
public boolean
remove(
Object o) {
throw new
UnsupportedOperationException();
}
public boolean
isEmpty() {
return
size() == 0;
}
public void
clear() {
IntValueHashMap.this.
clear();
}
}
public void
putAll(
IntValueHashMap t) {
Iterator it =
t.
keySet().
iterator();
while (
it.
hasNext()) {
Object key =
it.
next();
put(
key,
t.
get(
key));
}
}
}