org.codehaus.groovy.util.ListHashMap Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of groovy Show documentation
Groovy: A powerful, dynamic language for the JVM
There is a newer version: 3.0.21
/*
 * Copyright 2003-2010 the original author or authors.
 *
 * Licensed 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.codehaus.groovy.util;

import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;

/**
 * This represents a 
 * @author Jochen "blackdrag" Theodorou
 */
public class ListHashMap implements Map {
    private int listFill = 0;
    private Object[] listKeys;
    private Object[] listValues;
    private int size = 0;
    private Map innerMap;
    private final int maxListFill;
    
    public ListHashMap() {
        this(3);
    }
    
    public ListHashMap(int listSize){
        this.listKeys = new Object[listSize];
        this.listValues = new Object[listSize];
        maxListFill = listSize;
    }
    
    public void clear() {
        listFill = 0;
        innerMap = null;
        for (int i=0; i makeMap() {
        Map m = new HashMap();
        for (int i=0; i> entrySet() {
        Map m;
        if (size>=maxListFill) {
            m = innerMap;
        } else {
            m = makeMap();
        }
        return m.entrySet();
    }

    public V get(Object key) {
        if(size==0) return null;
        if (size keySet() {
        Map m;
        if (size>=maxListFill) {
            m = innerMap;
        } else {
            m = makeMap();
        }
        return m.keySet();
    }

    public V put(K key, V value) {
        if (size m) {
       if (size+m.size() entry : m.entrySet()) {
               listKeys[listFill] = entry.getKey();
               listValues[listFill] = entry.getValue();
               listFill++;
           }
           size += m.size();
           return;
       } 
       if (size entry : innerMap.entrySet()) {
            listKeys[i] = entry.getKey();
            listValues[i] = entry.getValue();
            i++;
        }
        listFill = innerMap.size();
        innerMap = null;
    }

    public int size() {
        return size;
    }

    public Collection values() {
        if (size list = new ArrayList(size);
            for (int i=0; i