org.apache.openjpa.lib.util.OrderedMap Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of openjpa-lib Show documentation
OpenJPA Utilities Library
There is a newer version: 4.0.1
/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.    
 */
package org.apache.openjpa.lib.util;

import java.io.Serializable;
import java.util.Collection;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;

/**
 * A Map with predictable iteration order.
 * 
 * @author Pinaki Poddar
 * @since 2.0.0
 */
@SuppressWarnings("serial")
public class OrderedMap implements Map, Serializable {
    private final LinkedHashMap _del;
    
    /**
     * Construct with predictable insertion order.
     */
    public OrderedMap() {
        _del = new LinkedHashMap(6,0.1f,false);
    }
    
    /**
     * Construct with predictable iteration order.
     * @param lru if true the iterator order is based on last access, false for order of insertion.
     */
    public OrderedMap(boolean lru) {
        _del = new LinkedHashMap(6,0.1f,lru);
    }
    
    public int indexOf(Object key) {
        int i = 0;
        for (K k : _del.keySet()) {
            if (key.equals(k))
                return i;
            i++;
        }
        return -1;
    }
    
    public void clear() {
    }

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

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

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

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

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

    
    public Set keySet() {
        return _del.keySet();
    }

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

    
    public void putAll(Map m) {
        _del.putAll(m);
    }

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

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

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

}