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

com.metsci.glimpse.util.var.DisposableGroupMap Maven / Gradle / Ivy

The newest version!
/*
 * Copyright (c) 2020, Metron, Inc.
 * 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 Metron, Inc. 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 METRON, INC. 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 com.metsci.glimpse.util.var;

import java.util.ArrayList;
import java.util.LinkedHashMap;
import java.util.Map;

public class DisposableGroupMap implements Disposable
{

    protected final Map groups;


    public DisposableGroupMap( )
    {
        this.groups = new LinkedHashMap<>( );
    }

    public DisposableGroup get( K key )
    {
        if ( !this.groups.containsKey( key ) )
        {
            this.groups.put( key, new DisposableGroup( ) );
        }
        return this.groups.get( key );
    }

    public void dispose( K key )
    {
        Disposable removed = this.groups.remove( key );
        if ( removed != null )
        {
            removed.dispose( );
        }
    }

    @Override
    public void dispose( )
    {
        for ( K key : new ArrayList<>( this.groups.keySet( ) ) )
        {
            this.dispose( key );
        }
    }

}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy