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

com.inet.lib.less.HashMultimap Maven / Gradle / Ivy

/**
 * MIT License (MIT)
 *
 * Copyright (c) 2014 - 2018 Volker Berlin
 *
 * 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,
 * UT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 *
 * @author Volker Berlin
 * @license: The MIT license 
 */
package com.inet.lib.less;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map.Entry;

/**
 * A HashMap that hold multiple values for a single key.
 *
 * @param 
 *            The key type
 * @param 
 *            the values type
 */
class HashMultimap {

    private final HashMap> map = new HashMap<>();

    private HashMultimap parent;

    /**
     * Default constructor
     */
    HashMultimap() {
    }

    /**
     * Constructor with parent
     * 
     * @param parent
     *            parent, will be hold by reference
     */
    HashMultimap( HashMultimap parent ) {
        this.parent = parent;
    }

    /**
     * Add a value to this map. If the map previously contained a mapping for the key, then there are two values now.
     * @param key the key
     * @param value the value
     */
    void add( K key, V value ) {
        List rules = map.get( key );
        if( rules == null ) {
            rules = new ArrayList<>();
            map.put( key, rules );
        }
        rules.add( value );
    }

    /**
     * Get all values for the given key. If no key exists then null is return.
     * 
     * @param key
     *            the key
     * @return the list or null
     */
    List get( K key ) {
        List result = map.get( key );
        if( parent != null ) {
            List resultParent = parent.get( key );
            if( result == null ) {
                return resultParent;
            } else if( resultParent == null ){
                return result;
            } else {
                for( V value : resultParent ) {
                    if( !result.contains( value ) ) {
                        result.add( value );
                    }
                }
            }
        }
        return result;
    }

    /**
     * Add all values of the mappings from the specified map to this map.
     * 
     * @param m
     *            mappings to be stored in this map
     */
    void addAll( HashMultimap m ) {
        if( m == this ) {
            return;
        }
        for( Entry> entry : m.map.entrySet() ) {
            K key = entry.getKey();
            List rules = map.get( key );
            if( rules == null ) {
                rules = new ArrayList<>();
                map.put( key, rules );
            }
            for( V value : entry.getValue() ) {
                if( !rules.contains( value ) ) {
                    rules.add( value );
                }
            }
        }
    }

    /**
     * {@inheritDoc}
     */
    @Override
    public String toString() {
        return map.toString();
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy