All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.semanticweb.owlapi.util.MultiMap Maven / Gradle / Ivy

Go to download

There is a newer version: 5.5.1
Show newest version
/*
 * This file is part of the OWL API.
 *
 * The contents of this file are subject to the LGPL License, Version 3.0.
 *
 * Copyright (C) 2011, The University of Manchester
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see http://www.gnu.org/licenses/.
 *
 *
 * Alternatively, the contents of this file may be used under the terms of the Apache License, Version 2.0
 * in which case, the provisions of the Apache License Version 2.0 are applicable instead of those above.
 *
 * Copyright 2011, The University of Manchester
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.semanticweb.owlapi.util;

import gnu.trove.map.hash.TCustomHashMap;
import gnu.trove.set.hash.TCustomHashSet;
import gnu.trove.strategy.HashingStrategy;

import java.io.Serializable;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.Map;
import java.util.Set;

/**
 * @param 
 *        key type
 * @param 
 *        value type
 * @author ignazio palmisano
 */
public class MultiMap implements Serializable {

    private static final long serialVersionUID = 30406L;
    private static final int DEFAULT_INITIAL_CAPACITY = 5;
    private static final float DEFAULT_LOAD_FACTOR = 0.75f;
    private final Map> map;
    private final HashcodeGuardedHashingStrategy keyHashcodeGuardedHashingStrategy = new HashcodeGuardedHashingStrategy();
    private int size = 0;
    private boolean useSets = true;
    private boolean threadSafe = false;

    /** default constructor */
    public MultiMap() {
        this(false);
    }

    /**
     * @param threadsafe
     *        true if threadsafe collections should be used
     */
    public MultiMap(boolean threadsafe) {
        threadSafe = threadsafe;
        if (threadSafe) {
            map = Collections.synchronizedMap(createMap());
        } else {
            map = createMap();
        }
    }

    /**
     * @param threadsafe
     *        true if threadsafe collections should be used
     * @param usesets
     *        true if sets should be used
     */
    public MultiMap(boolean threadsafe, boolean usesets) {
        this(threadsafe);
        this.useSets = usesets;
    }

    /**
     * @param key
     *        key
     * @param value
     *        value
     * @return true if an insertion occurs
     */
    public boolean put(Key key, Value value) {
        Collection set = this.map.get(key);
        if (set == null) {
            set = createCollection();
            this.map.put(key, set);
        }
        boolean toReturn = set.add(value);
        if (toReturn) {
            size = -1;
        }
        return toReturn;
    }

    protected Collection createCollection() {
        Collection toReturn;
        if (useSets) {
            Set set = createSet(DEFAULT_INITIAL_CAPACITY,
                    DEFAULT_LOAD_FACTOR);
            if (threadSafe) {
                toReturn = Collections.synchronizedSet(set);
            } else {
                toReturn = set;
            }
        } else {
            ArrayList list = new ArrayList();
            if (threadSafe) {
                toReturn = Collections.synchronizedList(list);
            } else {
                toReturn = list;
            }
        }
        return toReturn;
    }

    private static class HashcodeGuardedHashingStrategy implements
            HashingStrategy {

        @Override
        public int computeHashCode(Value object) {
            return object.hashCode();
        }

        @Override
        public boolean equals(Value o1, Value o2) {
            if (o1 == o2) {
                return true;
            }
            if (o1 == null || o2 == null) {
                return false;
            }
            if (computeHashCode(o1) != computeHashCode(o2)) {
                return false;
            }
            return o1.equals(o2);
        }
    }

    protected Map> createMap() {
        return new TCustomHashMap>(
                keyHashcodeGuardedHashingStrategy, 17, DEFAULT_LOAD_FACTOR);
    }

    private Set createSet(int initialCapacity, float loadFactor) {
        return new TCustomHashSet(keyHashcodeGuardedHashingStrategy,
                initialCapacity, loadFactor);
        // return new THashSet(initialCapacity, loadFactor);
    }

    /**
     * set an entry to a set of values
     * 
     * @param key
     *        key
     * @param values
     *        values
     */
    public void setEntry(Key key, Collection values) {
        this.map.put(key, values);
        this.size = -1;
    }

    /**
     * returns a mutable set of values connected to the key; if no value is
     * connected, returns an immutable empty set.
     * 
     * @param key
     *        key
     * @return the set of values connected with the key
     */
    public Collection get(Key key) {
        final Collection collection = this.map.get(key);
        if (collection != null) {
            return collection;
        }
        return Collections.emptyList();
    }

    /** @return the set of keys */
    public Set keySet() {
        return this.map.keySet();
    }

    /** @return all values in the map */
    public Set getAllValues() {
        Set toReturn = CollectionFactory.createSet();
        for (Collection s : this.map.values()) {
            toReturn.addAll(s);
        }
        return toReturn;
    }

    /**
     * removes the set of values connected to the key.
     * 
     * @param key
     *        key
     * @return true if removal occurs
     */
    public boolean remove(Key key) {
        if (this.map.remove(key) != null) {
            size = -1;
            return true;
        }
        return false;
    }

    /**
     * removes the value connected to the key; if there is more than one value
     * connected to the key, only one is removed.
     * 
     * @param key
     *        key
     * @param value
     *        value
     * @return true if removal occurs
     */
    public boolean remove(Key key, Value value) {
        Collection c = this.map.get(key);
        if (c != null) {
            boolean toReturn = c.remove(value);
            // if false, no change was actually made - skip the rest
            if (!toReturn) {
                return false;
            }
            size = -1;
            if (c.isEmpty()) {
                this.map.remove(key);
            }
            return true;
        }
        return false;
    }

    /** @return the size of the multimap (sum of all the sizes of the sets) */
    public int size() {
        if (size < 0) {
            size = getAllValues().size();
        }
        return this.size;
    }

    /**
     * @param k
     *        key
     * @param v
     *        value
     * @return true if the pairing (k, v) is in the map (set equality for v)
     */
    public boolean contains(Key k, Value v) {
        final Collection collection = this.map.get(k);
        if (collection == null) {
            return false;
        }
        return collection.contains(v);
    }

    /**
     * @param k
     *        the key
     * @return true if k is a key for the map
     */
    public boolean containsKey(Key k) {
        return this.map.containsKey(k);
    }

    /**
     * @param v
     *        value
     * @return true if v is a value for a key in the map
     */
    public boolean containsValue(Value v) {
        for (Collection c : map.values()) {
            if (c.contains(v)) {
                return true;
            }
        }
        return false;
    }

    /** clear map */
    public void clear() {
        this.map.clear();
        this.size = 0;
    }

    @Override
    public String toString() {
        return "MultiMap " + size() + "\n" + map.toString();// .replace(",",
                                                            // "\n");
    }

    /**
     * add all entries from other map.
     * 
     * @param otherMap
     *        map to add
     */
    public void putAll(MultiMap otherMap) {
        for (Key k : otherMap.keySet()) {
            putAll(k, otherMap.get(k));
        }
    }

    /**
     * @param k
     *        key
     * @param v
     *        all entries to add
     */
    public void putAll(Key k, Collection v) {
        Collection set = map.get(k);
        if (set == null) {
            set = createCollection();
            setEntry(k, set);
        }
        set.addAll(v);
        size = -1;
    }

    /** @return true if all value collections are equal */
    public boolean isValueSetsEqual() {
        if (map.size() < 2) {
            return true;
        }
        List> list = new ArrayList>(
                map.values());
        for (int i = 1; i < list.size(); i++) {
            if (!list.get(0).equals(list.get(i))) {
                return false;
            }
        }
        return true;
    }
}
    

    

    

                
 
            

    

                
 
            



    
    






    
© 2015 - 2024 Weber Informatics LLC | Privacy Policy