001/*
002 * JPPF.
003 * Copyright (C) 2005-2018 JPPF Team.
004 * http://www.jppf.org
005 *
006 * Licensed under the Apache License, Version 2.0 (the "License");
007 * you may not use this file except in compliance with the License.
008 * You may obtain a copy of the License at
009 *
010 *   http://www.apache.org/licenses/LICENSE-2.0
011 *
012 * Unless required by applicable law or agreed to in writing, software
013 * distributed under the License is distributed on an "AS IS" BASIS,
014 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
015 * See the License for the specific language governing permissions and
016 * limitations under the License.
017 */
018
019package org.jppf.utils.collections;
020
021import java.util.*;
022import java.util.concurrent.ConcurrentHashMap;
023
024/**
025 * A {@link ConcurrentHashMap} whose values are {@link Collection} instances (specialized in concrete subclasses).
026 * @param <K> the type of the keys.
027 * @param <V> the type of the objects in the map's collection values.
028 * @author Laurent Cohen
029 */
030public abstract class AbstractCollectionConcurrentMap<K, V> extends AbstractCollectionMap<K, V> {
031  /**
032   * Explicit serialVersionUID.
033   */
034  private static final long serialVersionUID = 1L;
035
036  /**
037   * Default constructor.
038   */
039  public AbstractCollectionConcurrentMap() {
040    this.map = createMap();
041  }
042
043  @Override
044  protected Map<K, Collection<V>> createMap() {
045    return new ConcurrentHashMap<>();
046  }
047
048  @Override
049  public void putValue(final K key, final V value) {
050    final Collection<V> newColl = newCollection();
051    Collection<V> coll = ((ConcurrentHashMap<K, Collection<V>>) map).putIfAbsent(key, newColl);
052    if (coll == null) coll = newColl;
053    coll.add(value);
054  }
055
056  @Override
057  public void addValues(final K key, @SuppressWarnings("unchecked") final V... values) {
058    final Collection<V> newColl = newCollection();
059    Collection<V> coll = ((ConcurrentHashMap<K, Collection<V>>) map).putIfAbsent(key, newColl);
060    if (coll == null) coll = newColl;
061    for (final V value : values) coll.add(value);
062  }
063}