com.github.gv2011.util.icol.guava.AbstractIMapBuilder.java Source code

Introduction

Here is the source code for com.github.gv2011.util.icol.guava.AbstractIMapBuilder.java

Source

package com.github.gv2011.util.icol.guava;

/*-
 * #%L
 * The MIT License (MIT)
 * %%
 * Copyright (C) 2016 - 2017 Vinz (https://github.com/gv2011)
 * %%
 * 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,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 * #L%
 */

import static com.github.gv2011.util.Verify.notNull;
import static com.github.gv2011.util.Verify.verify;
import static com.github.gv2011.util.ex.Exceptions.format;

import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;

import com.github.gv2011.util.icol.IMap;
import com.github.gv2011.util.icol.MapBuilder;
import com.google.common.collect.ImmutableMap;

abstract class AbstractIMapBuilder<M extends IMap<K, V>, K, V, B extends MapBuilder<M, K, V, B>>
        implements MapBuilder<M, K, V, B> {

    protected final Map<K, V> map = Collections.synchronizedMap(new HashMap<>());

    protected abstract B self();

    @Override
    public B put(final K key, final V value) {
        final V actual = map.putIfAbsent(key, value);
        if (actual != null)
            throw new IllegalArgumentException(format("Map has already an entry for key {}.", key));
        return self();
    }

    @Override
    public B tryPut(final K key, final V value) {
        map.putIfAbsent(key, value);
        return self();
    }

    @Override
    public B putAll(final Map<? extends K, ? extends V> map) {
        final ImmutableMap<K, V> copy = ImmutableMap.copyOf(map);
        synchronized (this.map) {
            verify(copy.entrySet().stream()
                    .allMatch(e -> e.getKey() != null && e.getValue() != null && !map.containsKey(e.getKey())));
            this.map.putAll(copy);
        }
        return self();
    }

    @Override
    public B putAll(final IMap<? extends K, ? extends V> map) {
        synchronized (this.map) {
            verify(map.entrySet().stream().allMatch(e -> !this.map.containsKey(e.getKey())));
            this.map.putAll(map);
        }
        return self();
    }

    @Override
    public B tryPutAll(final Map<? extends K, ? extends V> map) {
        final ImmutableMap<K, V> copy = ImmutableMap.copyOf(map);
        synchronized (this.map) {
            copy.entrySet().stream().forEach(e -> this.map.putIfAbsent(notNull(e.getKey()), notNull(e.getValue())));
        }
        return self();
    }

    @Override
    public B tryPutAll(final IMap<? extends K, ? extends V> map) {
        synchronized (this.map) {
            map.entrySet().stream().forEach(e -> this.map.putIfAbsent(e.getKey(), e.getValue()));
        }
        return self();
    }

    @Override
    public B putAll(final Collection<? extends Entry<? extends K, ? extends V>> map) {
        final ImmutableMap<K, V> copy = ImmutableMap.copyOf(map);
        synchronized (this.map) {
            verify(copy.entrySet().stream().allMatch(
                    e -> e.getKey() != null && e.getValue() != null && !this.map.containsKey(e.getKey())));
            this.map.putAll(copy);
        }
        return self();
    }

    @Override
    public B tryPutAll(final Collection<? extends Entry<? extends K, ? extends V>> map) {
        final ImmutableMap<K, V> copy = ImmutableMap.copyOf(map);
        synchronized (this.map) {
            copy.entrySet().stream().forEach(e -> this.map.putIfAbsent(notNull(e.getKey()), notNull(e.getValue())));
        }
        return self();
    }

}