org.codehaus.groovy.util.ListHashMap Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of groovy-all Show documentation
Show all versions of groovy-all Show documentation
Groovy: A powerful, dynamic language for the JVM
/*
* 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.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 final Object[] listKeys;
private final 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() {
innerMap = null;
for (int i=0; i makeMap() {
Map m = new HashMap();
for (int i=0; i> entrySet() {
Map m = innerMap!=null?innerMap:makeMap();
return m.entrySet();
}
public V get(Object key) {
if(size==0) return null;
if (innerMap==null) {
for (int i=0; i keySet() {
Map m = innerMap!=null?innerMap:makeMap();
return m.keySet();
}
@SuppressWarnings("unchecked")
public V put(K key, V value) {
if (innerMap==null) {
for (int i=0; i m) {
for (Entry entry : m.entrySet()) {
put(entry.getKey(), entry.getValue());
}
}
public V remove(Object key) {
if (innerMap==null) {
for (int i=0; i entry : innerMap.entrySet()) {
listKeys[i] = entry.getKey();
listValues[i] = entry.getValue();
i++;
}
size = innerMap.size();
innerMap = null;
}
public int size() {
return size;
}
public Collection values() {
if (innerMap==null) {
ArrayList list = new ArrayList(size);
for (int i=0; i