org.wildfly.naming.client.util.FastHashtable Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of wildfly-naming-client Show documentation
There is a newer version: 2.0.1.Final
Show newest version
/*
 * JBoss, Home of Professional Open Source.
 * Copyright 2015, Red Hat, Inc., and individual contributors
 * as indicated by the @author tags. See the copyright.txt file in the
 * distribution for a full listing of individual contributors.
 *
 * This is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation; either version 2.1 of
 * the License, or (at your option) any later version.
 *
 * This software 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this software; if not, write to the Free
 * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
 * 02110-1301 USA, or see the FSF site: http://www.fsf.org.
 */

package org.wildfly.naming.client.util;

import java.util.Collection;
import java.util.Enumeration;
import java.util.Hashtable;
import java.util.Map;
import java.util.Set;
import java.util.concurrent.ConcurrentHashMap;
import java.util.function.BiConsumer;
import java.util.function.BiFunction;
import java.util.function.Function;

/**
 * A hashtable that is implemented in terms of a fast concurrent map instead of a slow synchronized hash table.
 *
 * @author David M. Lloyd
 */
public class FastHashtable extends Hashtable {
    private static final long serialVersionUID = 85183000443454665L;

    private final ConcurrentHashMap backingMap;

    public FastHashtable(final int initialCapacity, final float loadFactor) {
        super(0);
        backingMap = new ConcurrentHashMap<>(initialCapacity, loadFactor);
    }

    public FastHashtable(final int initialCapacity) {
        super(0);
        backingMap = new ConcurrentHashMap<>(initialCapacity);
    }

    public FastHashtable() {
        super(0);
        backingMap = new ConcurrentHashMap<>();
    }

    @SuppressWarnings("unchecked")
    public FastHashtable(final Map t) {
        super(0);
        backingMap = new ConcurrentHashMap<>(t instanceof FastHashtable ? ((FastHashtable)t).backingMap : t);
    }

    public int size() {
        return backingMap.size();
    }

    public boolean isEmpty() {
        return backingMap.isEmpty();
    }

    public V get(final Object key) {
        return backingMap.get(key);
    }

    public boolean containsKey(final Object key) {
        return backingMap.containsKey(key);
    }

    public boolean containsValue(final Object value) {
        return backingMap.containsValue(value);
    }

    public V put(final K key, final V value) {
        return backingMap.put(key, value);
    }

    public void putAll(final Map m) {
        backingMap.putAll(m);
    }

    public V remove(final Object key) {
        return backingMap.remove(key);
    }

    public void clear() {
        backingMap.clear();
    }

    public ConcurrentHashMap.KeySetView keySet() {
        return backingMap.keySet();
    }

    public Collection values() {
        return backingMap.values();
    }

    public Set> entrySet() {
        return backingMap.entrySet();
    }

    public int hashCode() {
        return System.identityHashCode(this);
    }

    public String toString() {
        return backingMap.toString();
    }

    public boolean equals(final Object o) {
        return this == o;
    }

    public V putIfAbsent(final K key, final V value) {
        return backingMap.putIfAbsent(key, value);
    }

    public boolean remove(final Object key, final Object value) {
        return backingMap.remove(key, value);
    }

    public boolean replace(final K key, final V oldValue, final V newValue) {
        return backingMap.replace(key, oldValue, newValue);
    }

    public V replace(final K key, final V value) {
        return backingMap.replace(key, value);
    }

    public V getOrDefault(final Object key, final V defaultValue) {
        return backingMap.getOrDefault(key, defaultValue);
    }

    public void forEach(final BiConsumer action) {
        backingMap.forEach(action);
    }

    public void replaceAll(final BiFunction function) {
        backingMap.replaceAll(function);
    }

    public V computeIfAbsent(final K key, final Function mappingFunction) {
        return backingMap.computeIfAbsent(key, mappingFunction);
    }

    public V computeIfPresent(final K key, final BiFunction remappingFunction) {
        return backingMap.computeIfPresent(key, remappingFunction);
    }

    public V compute(final K key, final BiFunction remappingFunction) {
        return backingMap.compute(key, remappingFunction);
    }

    public V merge(final K key, final V value, final BiFunction remappingFunction) {
        return backingMap.merge(key, value, remappingFunction);
    }

    public boolean contains(final Object value) {
        return backingMap.contains(value);
    }

    public Enumeration keys() {
        return backingMap.keys();
    }

    public Enumeration elements() {
        return backingMap.elements();
    }

    public FastHashtable clone() {
        return new FastHashtable<>(this);
    }

    protected void rehash() {
        // no-op
    }

    public long mappingCount() {
        return backingMap.mappingCount();
    }

    public ConcurrentHashMap.KeySetView keySet(final V mappedValue) {
        return backingMap.keySet(mappedValue);
    }

    public static  FastHashtable of(final Hashtable other) {
        if (other instanceof FastHashtable) {
            return (FastHashtable) other;
        } else {
            return new FastHashtable<>(other);
        }
    }
}