org.apache.openejb.util.Index Maven / Gradle / Ivy
The newest version!
/*
* 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.openejb.util;
import java.lang.reflect.Array;
import java.util.AbstractList;
import java.util.AbstractMap;
import java.util.AbstractSet;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.ListIterator;
import java.util.Map;
import java.util.Set;
/**
* @version $Revision$ $Date$
*/
public class Index extends AbstractMap {
private final IndexEntry[] entries;
private final LinkedHashMap keyIndicies;
private final IndexEntrySet entrySet;
private IndexValueList indexValueList;
public Index(final Map map) {
entries = new IndexEntry[map.size()];
keyIndicies = new LinkedHashMap(map.size());
int i = 0;
for (final Entry entry : map.entrySet()) {
entries[i] = new IndexEntry(entry);
keyIndicies.put(entry.getKey(), new Integer(i));
i++;
}
entrySet = new IndexEntrySet();
}
public Index(final List keys) {
entries = new IndexEntry[keys.size()];
keyIndicies = new LinkedHashMap(keys.size());
for (int i = 0; i < keys.size(); i++) {
final K key = keys.get(i);
entries[i] = new IndexEntry(key, null);
keyIndicies.put(key, new Integer(i));
}
entrySet = new IndexEntrySet();
}
public Index(final K[] keys) {
entries = new IndexEntry[keys.length];
keyIndicies = new LinkedHashMap(keys.length);
for (int i = 0; i < keys.length; i++) {
final K key = keys[i];
entries[i] = new IndexEntry(key, null);
keyIndicies.put(key, new Integer(i));
}
entrySet = new IndexEntrySet();
}
public List values() {
if (indexValueList == null) {
indexValueList = new IndexValueList();
}
return indexValueList;
}
public Set> entrySet() {
return entrySet;
}
public K getKey(final int index) {
if (index < 0 || index >= entries.length) {
throw new IndexOutOfBoundsException(String.valueOf(index));
}
return entries[index].getKey();
}
public V get(final int index) {
if (index < 0 || index >= entries.length) {
throw new IndexOutOfBoundsException(String.valueOf(index));
}
return entries[index].getValue();
}
public V set(final int index, final V value) {
if (index < 0 || index >= entries.length) {
throw new IndexOutOfBoundsException(String.valueOf(index));
}
final IndexEntry entry = entries[index];
final V oldValue = entry.getValue();
entry.setValue(value);
return oldValue;
}
public V put(final K key, final V value) {
final int i = indexOf(key);
if (i < 0) {
throw new IllegalArgumentException("Index does not contain this key and new entries cannot be added: " + (K) key);
}
final IndexEntry entry = entries[i];
final V oldValue = entry.getValue();
entry.setValue(value);
return oldValue;
}
public boolean containsKey(final Object key) {
return keyIndicies.containsKey(key);
}
public int indexOf(final K key) {
final Integer index = keyIndicies.get(key);
if (index == null) {
return -1;
}
return index;
}
public V get(final Object key) {
final int i = indexOf((K) key);
if (i < 0) {
return null;
}
final IndexEntry entryMetadata = entries[i];
final V value = entryMetadata.getValue();
return value;
}
public Iterator iterator() {
return new IndexIterator();
}
public ListIterator listIterator() {
return new IndexListIterator(0);
}
public ListIterator listIterator(final int index) {
if (index < 0 || index >= entries.length) {
throw new IndexOutOfBoundsException(String.valueOf(index));
}
return new IndexListIterator(index);
}
public Object[] toArray() {
return toArray(new Object[entries.length]);
}
public interface ListSet extends List, Set {
}
public Object[] toArray(Object[] values) {
if (values.length < entries.length) {
values = (Object[]) Array.newInstance(values.getClass().getComponentType(), entries.length);
}
for (int i = 0; i < entries.length; i++) {
final IndexEntry indexEntry = entries[i];
values[i] = indexEntry.getValue();
}
return values;
}
private static final class IndexEntry implements Map.Entry {
private final K key;
private V value;
private IndexEntry(final K key, final V value) {
this.key = key;
this.value = value;
}
private IndexEntry(final Map.Entry entry) {
this.key = entry.getKey();
this.value = entry.getValue();
}
public K getKey() {
return key;
}
public V getValue() {
return value;
}
public V setValue(final V value) {
final V oldValue = this.value;
this.value = value;
return oldValue;
}
}
private class IndexEntrySet extends AbstractSet {
public Iterator iterator() {
return new Iterator() {
private int index;
public boolean hasNext() {
return index < entries.length;
}
public Object next() {
return entries[index++];
}
public void remove() {
throw new UnsupportedOperationException("Index entries cannot be removed");
}
};
}
public int size() {
return entries.length;
}
}
private class IndexValueList extends AbstractList {
public E get(final int index) {
return (E) Index.this.get(index);
}
public E set(final int index, final E element) {
return (E) Index.this.set(index, (V) element);
}
public int size() {
return Index.this.size();
}
}
private class IndexIterator implements Iterator {
protected int index;
public boolean hasNext() {
return index < entries.length;
}
public E next() {
final IndexEntry entryMetadata = entries[index++];
return (E) entryMetadata.getValue();
}
public void remove() {
throw new UnsupportedOperationException("Index entries cannot be removed");
}
}
private class IndexListIterator extends IndexIterator implements ListIterator {
public IndexListIterator(final int index) {
this.index = index;
}
public int nextIndex() {
return index;
}
public boolean hasPrevious() {
return index > 0;
}
public E previous() {
return (E) entries[--index].getValue();
}
public int previousIndex() {
return index - 1;
}
public void set(final E o) {
entries[index].setValue((V) o);
}
public void add(final E o) {
throw new UnsupportedOperationException("Entries cannot be added to a Index");
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy