public Index(final Map<K, V> map) { entries = new IndexEntry[map.size()]; keyIndicies = new LinkedHashMap<K, Integer>(map.size()); int i = 0; for (final Entry<K, V> entry : map.entrySet()) { entries[i] = new IndexEntry<K, V>(entry); keyIndicies.put(entry.getKey(), new Integer(i)); i++; } entrySet = new IndexEntrySet(); }
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 void set(final E o) { entries[index].setValue((V) o); }
public void set(final E o) { entries[index].setValue((V) o); }
public void set(E o) { entries[index].setValue((V) o); }
public K getKey(int index) { if (index < 0 || index >= entries.length) throw new IndexOutOfBoundsException("" + index); return entries[index].getKey(); }
public V get(final Object key) { final int i = indexOf((K) key); if (i < 0) { return null; } final IndexEntry<K, V> entryMetadata = entries[i]; final V value = entryMetadata.getValue(); return value; }
public Index(final K[] keys) { entries = new IndexEntry[keys.length]; keyIndicies = new LinkedHashMap<K, Integer>(keys.length); for (int i = 0; i < keys.length; i++) { final K key = keys[i]; entries[i] = new IndexEntry<K, V>(key, null); keyIndicies.put(key, new Integer(i)); } entrySet = new IndexEntrySet(); }
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++) { IndexEntry indexEntry = entries[i]; values[i] = indexEntry.getValue(); } return values; }
public Index(List<K> keys) { entries = new IndexEntry[keys.size()]; keyIndicies = new LinkedHashMap<K,Integer>(keys.size()); for (int i = 0; i < keys.size(); i++) { K key = keys.get(i); entries[i] = new IndexEntry<K,V>(key, null); keyIndicies.put(key, new Integer(i)); } entrySet = new IndexEntrySet(); }
public Index(final K[] keys) { entries = new IndexEntry[keys.length]; keyIndicies = new LinkedHashMap<K, Integer>(keys.length); for (int i = 0; i < keys.length; i++) { final K key = keys[i]; entries[i] = new IndexEntry<K, V>(key, null); keyIndicies.put(key, new Integer(i)); } entrySet = new IndexEntrySet(); }
public V get(int index) { if (index < 0 || index >= entries.length) throw new IndexOutOfBoundsException("" + index); return entries[index].getValue(); }
public Index(final Map<K, V> map) { entries = new IndexEntry[map.size()]; keyIndicies = new LinkedHashMap<K, Integer>(map.size()); int i = 0; for (final Entry<K, V> entry : map.entrySet()) { entries[i] = new IndexEntry<K, V>(entry); keyIndicies.put(entry.getKey(), new Integer(i)); i++; } entrySet = new IndexEntrySet(); }
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<K, V> entry = entries[i]; final V oldValue = entry.getValue(); entry.setValue(value); return oldValue; }
public Index(K[] keys) { entries = new IndexEntry[keys.length]; keyIndicies = new LinkedHashMap<K,Integer>(keys.length); for (int i = 0; i < keys.length; i++) { K key = keys[i]; entries[i] = new IndexEntry<K,V>(key, null); keyIndicies.put(key, new Integer(i)); } entrySet = new IndexEntrySet(); }
public Index(Map<K,V> map) { entries = new IndexEntry[map.size()]; keyIndicies = new LinkedHashMap<K,Integer>(map.size()); int i = 0; for (Entry<K, V> entry : map.entrySet()) { entries[i] = new IndexEntry<K,V>(entry); keyIndicies.put(entry.getKey(), new Integer(i)); i++; } entrySet = new IndexEntrySet(); }
public Index(final List<K> keys) { entries = new IndexEntry[keys.size()]; keyIndicies = new LinkedHashMap<K, Integer>(keys.size()); for (int i = 0; i < keys.size(); i++) { final K key = keys.get(i); entries[i] = new IndexEntry<K, V>(key, null); keyIndicies.put(key, new Integer(i)); } entrySet = new IndexEntrySet(); }
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; }
public K getKey(final int index) { if (index < 0 || index >= entries.length) { throw new IndexOutOfBoundsException(String.valueOf(index)); } return entries[index].getKey(); }