/* * (c) Copyright 2010 Epimorphics Ltd. * All rights reserved. * [See end of file] */ package org.openjena.atlas.lib; import java.util.ArrayList ; import java.util.Collection ; import java.util.HashMap ; import java.util.HashSet ; import java.util.Iterator ; import java.util.Map ; import java.util.Set ; import org.openjena.atlas.iterator.Iter ; import org.openjena.atlas.iterator.IteratorConcat ; public abstract class MultiMap { // size // clear // remove // putAll // values() // Set vs List here. private Map> map = new HashMap>() ; protected abstract Collection create() ; static class MultiMapToList extends MultiMap { @Override protected Collection create() { return new ArrayList() ; }} static class MultiMapToSet extends MultiMap { @Override protected Collection create() { return new HashSet() ; }} public static MultiMap createMapList() { return new MultiMapToList() ; } public static MultiMap createMapSet() { return new MultiMapToSet() ; } protected MultiMap() { } public Collection get(K key) { return map.get(key) ; } public void put(K key, V value) { Collection x = map.get(key) ; if ( x == null ) { x = create() ; map.put(key, x) ; } x.add(value) ; } public Collection values(K key) { return map.get(key); } public Collection values() { return Iter.toList(flatten()) ; } public boolean containsKey(K key) { return map.containsKey(key) ; } //public boolean containsValue(V Value) { return map.containsKey(key) ; } public Set keys() { return map.keySet() ; } public boolean isEmpty() { return map.isEmpty() ; } /** Does not materialise the contents */ public Iterator flatten() { IteratorConcat all = new IteratorConcat() ; for ( K k : map.keySet() ) { Collection x = map.get(k) ; all.add(x.iterator()) ; } return all ; } @Override public boolean equals(Object other) { if ( this == other ) return true ; if ( ! ( other instanceof MultiMap ) ) return true ; @SuppressWarnings("unchecked") MultiMap mmap = (MultiMap)other ; return map.equals(mmap.map) ; } @Override public int hashCode() { return map.hashCode()^ 0x01010101 ; } } /* * (c) Copyright 2010 Epimorphics Ltd. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. 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. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 THE AUTHOR 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. */