smile.hash.PerfectMap Maven / Gradle / Ivy

Go to download
/*******************************************************************************
 * Copyright (c) 2010-2020 Haifeng Li. All rights reserved.
 *
 * Smile 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 3 of
 * the License, or (at your option) any later version.
 *
 * Smile 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 Smile.  If not, see .
 ******************************************************************************/

package smile.hash;

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

/**
 * Perfect hash based immutable map. This can be used as a lookup table with
 * constant worst-case access time.
 *
 * @author Haifeng Li
 */
public class PerfectMap {
    /** Perfect hash of keywords. */
    private PerfectHash hash;
    /** The value set. */
    private List values;

    /** Builder of perfect map. */
    public static class Builder {
        /** Key-value map. */
        private Map map = new HashMap<>();

        /** Constructor. */
        public Builder() {

        }

        /** Constructor. */
        public Builder(Map map) {
            this.map.putAll(map);
        }

        /** Add a new key-value pair. */
        public Builder add(String key, T value) {
            map.put(key, value);
            return this;
        }

        /** Builds the perfect map. */
        public PerfectMap build() {
            String[] keys = new String[map.size()];
            List values = new ArrayList<>();
            int i = 0;
            for (Map.Entry e : map.entrySet()) {
                keys[i++] = e.getKey();
                values.add(e.getValue());
            }
            return new PerfectMap<>(new PerfectHash(keys), values);
        }
    }

    /**
     * Private constructor. The user should use the Builder
     * to create the immutable map.
     */
    private PerfectMap(PerfectHash hash, List values) {
        this.hash = hash;
        this.values = values;
    }

    /**
     * Returns the value associated with the key. Returns null if
     * the key doesn't exist in the map.
     */
    public T get(String key) {
        int i = hash.get(key);
        if (i < 0) return null;
        return values.get(i);
    }
}