/*
* @(#)DualKeyHashMap.java 1.0 May 5, 2008
*
* The MIT License
*
* Copyright (c) 2008 Malachi de AElfweald
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
//package org.eoti.util;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
public class DualKeyHashMap extends
HashMap, VALUE> implements
DualKeyMap {
static class SimpleDualKey implements DualKey {
protected XKEY xKey;
protected YKEY yKey;
public SimpleDualKey(XKEY xKey, YKEY yKey) {
this.xKey = xKey;
this.yKey = yKey;
}
public XKEY getXKey() {
return xKey;
}
public YKEY getYKey() {
return yKey;
}
public int hashCode() {
return toString().hashCode();
}
public boolean equals(Object obj) {
return hashCode() == obj.hashCode();
}
public String toString() {
return String.format("[%s [xkey=%s][ykey=%s]", this.getClass()
.getName(), xKey.toString(), yKey.toString());
}
}
public DualKeyHashMap(int initialCapacity, float loadFactor) {
super(initialCapacity, loadFactor);
}
public DualKeyHashMap(int initialCapacity) {
super(initialCapacity);
}
public DualKeyHashMap() {
super();
}
public DualKeyHashMap(Map, ? extends VALUE> m) {
super(m);
}
public boolean containsXKey(XKEY xKey) {
for (DualKey key : keySet()) {
if (key.getXKey().equals(xKey))
return true;
}
return false;
}
public boolean containsYKey(YKEY yKey) {
for (DualKey key : keySet()) {
if (key.getYKey().equals(yKey))
return true;
}
return false;
}
public VALUE get(XKEY xKey, YKEY yKey) {
return super.get(new SimpleDualKey(xKey, yKey));
}
public Set getXKeySet() {
HashSet xKeys = new HashSet();
for (DualKey key : keySet())
xKeys.add(key.getXKey());
return xKeys;
}
public Set getYKeySet() {
HashSet yKeys = new HashSet();
for (DualKey key : keySet())
yKeys.add(key.getYKey());
return yKeys;
}
public VALUE put(XKEY xKey, YKEY yKey, VALUE value) {
return put(new SimpleDualKey(xKey, yKey), value);
}
public void putAll(DualKeyMap map) {
super.putAll(map);
}
public VALUE remove(XKEY xKey, YKEY yKey) {
return remove(new SimpleDualKey(xKey, yKey));
}
}
interface DualKeyMap extends
Map, VALUE> {
static interface DualKey {
public XKEY getXKey();
public YKEY getYKey();
public int hashCode();
public boolean equals(Object obj);
}
// static interface Entry extends Map.Entry,
// VALUE>
// public void clear();
public boolean containsXKey(XKEY xKey);
public boolean containsYKey(YKEY yKey);
// public Set> entrySet();
// public boolean equals(Object obj);
public VALUE get(XKEY xKey, YKEY yKey);
// public int hashCode();
// public boolean isEmpty();
public Set getXKeySet();
public Set getYKeySet();
public VALUE put(XKEY xKey, YKEY yKey, VALUE value);
public void putAll(DualKeyMap map);
public VALUE remove(XKEY xKey, YKEY yKey);
// public int size();
// public Collection values();
}