2 * Copyright (c) 2015 Cisco Systems, Inc. and others. All rights reserved.
4 * This program and the accompanying materials are made available under the
5 * terms of the Eclipse Public License v1.0 which accompanies this distribution,
6 * and is available at http://www.eclipse.org/legal/epl-v10.html
8 package org.opendaylight.yangtools.util;
10 import com.google.common.annotations.Beta;
11 import com.google.common.base.Preconditions;
12 import com.google.common.collect.ImmutableMap;
13 import com.google.common.collect.UnmodifiableIterator;
14 import java.io.IOException;
15 import java.io.ObjectInputStream;
16 import java.io.ObjectOutputStream;
17 import java.io.Serializable;
18 import java.lang.reflect.Field;
19 import java.util.AbstractMap.SimpleImmutableEntry;
20 import java.util.AbstractSet;
21 import java.util.ArrayList;
22 import java.util.Arrays;
23 import java.util.Collection;
24 import java.util.Iterator;
25 import java.util.List;
28 import javax.annotation.Nonnull;
31 * Implementation of the {@link Map} interface which stores a set of immutable mappings using a key-to-offset map and
32 * a backing array. This is useful for situations where the same key set is shared across a multitude of maps, as this
33 * class uses a global cache to share the key-to-offset mapping.
35 * @param <K> the type of keys maintained by this map
36 * @param <V> the type of mapped values
39 public abstract class ImmutableOffsetMap<K, V> implements UnmodifiableMapPhase<K, V>, Serializable {
40 static final class Ordered<K, V> extends ImmutableOffsetMap<K, V> {
41 private static final long serialVersionUID = 1L;
43 Ordered(final Map<K, Integer> offsets, final V[] objects) {
44 super(offsets, objects);
48 public MutableOffsetMap<K, V> toModifiableMap() {
49 return MutableOffsetMap.orderedCopyOf(this);
53 void setFields(final List<K> keys, final V[] values) throws IOException {
54 setField(this, OFFSETS_FIELD, OffsetMapCache.orderedOffsets(keys));
55 setField(this, ARRAY_FIELD, values);
59 static final class Unordered<K, V> extends ImmutableOffsetMap<K, V> {
60 private static final long serialVersionUID = 1L;
62 Unordered(final Map<K, Integer> offsets, final V[] objects) {
63 super(offsets, objects);
67 public MutableOffsetMap<K, V> toModifiableMap() {
68 return MutableOffsetMap.unorderedCopyOf(this);
72 void setFields(final List<K> keys, final V[] values) throws IOException {
73 final Map<K, Integer> offsets = OffsetMapCache.unorderedOffsets(keys);
75 setField(this, OFFSETS_FIELD, offsets);
76 setField(this, ARRAY_FIELD, OffsetMapCache.adjustedArray(offsets, keys, values));
80 private static final long serialVersionUID = 1L;
82 private transient final Map<K, Integer> offsets;
83 private transient final V[] objects;
84 private transient int hashCode;
87 * Construct a new instance backed by specified key-to-offset map and array of objects.
89 * @param offsets Key-to-offset map, may not be null
90 * @param objects Array of value object, may not be null. The array is stored as is, the caller
91 * is responsible for ensuring its contents remain unmodified.
93 ImmutableOffsetMap(@Nonnull final Map<K, Integer> offsets, @Nonnull final V[] objects) {
94 this.offsets = Preconditions.checkNotNull(offsets);
95 this.objects = Preconditions.checkNotNull(objects);
96 Preconditions.checkArgument(offsets.size() == objects.length);
100 public abstract MutableOffsetMap<K, V> toModifiableMap();
102 abstract void setFields(List<K> keys, V[] values) throws IOException;
105 * Create an {@link ImmutableOffsetMap} as a copy of an existing map. This is actually not completely true,
106 * as this method returns an {@link ImmutableMap} for empty and singleton inputs, as those are more memory-efficient.
107 * This method also recognizes {@link ImmutableOffsetMap} on input, and returns it back without doing anything else.
108 * It also recognizes {@link MutableOffsetMap} (as returned by {@link #toModifiableMap()}) and makes an efficient
109 * copy of its contents. All other maps are converted to an {@link ImmutableOffsetMap} with the same iteration
112 * @param m Input map, may not be null.
113 * @return An isolated, immutable copy of the input map
114 * @deprecated Use {@link #orderedCopyOf(Map)} or {@link #unorderedCopyOf(Map)} instead.
117 @Nonnull public static <K, V> Map<K, V> copyOf(@Nonnull final Map<K, V> m) {
118 return orderedCopyOf(m);
122 * Create an {@link ImmutableOffsetMap} as a copy of an existing map. This is actually not completely true,
123 * as this method returns an {@link ImmutableMap} for empty and singleton inputs, as those are more memory-efficient.
124 * This method also recognizes {@link ImmutableOffsetMap} on input, and returns it back without doing anything else.
125 * It also recognizes {@link MutableOffsetMap} (as returned by {@link #toModifiableMap()}) and makes an efficient
126 * copy of its contents. All other maps are converted to an {@link ImmutableOffsetMap} with the same iteration
129 * @param m Input map, may not be null.
130 * @return An isolated, immutable copy of the input map
132 @Nonnull public static <K, V> Map<K, V> orderedCopyOf(@Nonnull final Map<K, V> m) {
133 // Prevent a copy. Note that ImmutableMap is not listed here because of its potentially larger keySet overhead.
134 if (m instanceof ImmutableOffsetMap || m instanceof SharedSingletonMap) {
138 // Familiar and efficient to copy
139 if (m instanceof MutableOffsetMap) {
140 return ((MutableOffsetMap<K, V>) m).toUnmodifiableMap();
143 final int size = m.size();
145 // Shares a single object
146 return ImmutableMap.of();
149 // Efficient single-entry implementation
150 final Entry<K, V> e = m.entrySet().iterator().next();
151 return SharedSingletonMap.orderedOf(e.getKey(), e.getValue());
154 final Map<K, Integer> offsets = OffsetMapCache.orderedOffsets(m.keySet());
155 @SuppressWarnings("unchecked")
156 final V[] array = (V[]) new Object[offsets.size()];
157 for (Entry<K, V> e : m.entrySet()) {
158 array[offsets.get(e.getKey())] = e.getValue();
161 return new Ordered<>(offsets, array);
165 * Create an {@link ImmutableOffsetMap} as a copy of an existing map. This is actually not completely true,
166 * as this method returns an {@link ImmutableMap} for empty and singleton inputs, as those are more memory-efficient.
167 * This method also recognizes {@link ImmutableOffsetMap} on input, and returns it back without doing anything else.
168 * It also recognizes {@link MutableOffsetMap} (as returned by {@link #toModifiableMap()}) and makes an efficient
169 * copy of its contents. All other maps are converted to an {@link ImmutableOffsetMap}. Iterator order is not
170 * guaranteed to be retained.
172 * @param m Input map, may not be null.
173 * @return An isolated, immutable copy of the input map
175 @Nonnull public static <K, V> Map<K, V> unorderedCopyOf(@Nonnull final Map<K, V> m) {
176 // Prevent a copy. Note that ImmutableMap is not listed here because of its potentially larger keySet overhead.
177 if (m instanceof ImmutableOffsetMap || m instanceof SharedSingletonMap) {
181 // Familiar and efficient to copy
182 if (m instanceof MutableOffsetMap) {
183 return ((MutableOffsetMap<K, V>) m).toUnmodifiableMap();
186 final int size = m.size();
188 // Shares a single object
189 return ImmutableMap.of();
192 // Efficient single-entry implementation
193 final Entry<K, V> e = m.entrySet().iterator().next();
194 return SharedSingletonMap.unorderedOf(e.getKey(), e.getValue());
197 final Map<K, Integer> offsets = OffsetMapCache.unorderedOffsets(m.keySet());
198 @SuppressWarnings("unchecked")
199 final V[] array = (V[]) new Object[offsets.size()];
200 for (Entry<K, V> e : m.entrySet()) {
201 array[offsets.get(e.getKey())] = e.getValue();
204 return new Unordered<>(offsets, array);
208 public final int size() {
209 return offsets.size();
213 public final boolean isEmpty() {
214 return offsets.isEmpty();
218 public final int hashCode() {
224 for (Entry<K, Integer> e : offsets.entrySet()) {
225 result += e.getKey().hashCode() ^ objects[e.getValue()].hashCode();
233 public final boolean equals(final Object o) {
237 if (!(o instanceof Map)) {
241 if (o instanceof ImmutableOffsetMap) {
242 final ImmutableOffsetMap<?, ?> om = (ImmutableOffsetMap<?, ?>) o;
244 // If the offset match, the arrays have to match, too
245 if (offsets.equals(om.offsets)) {
246 return Arrays.deepEquals(objects, om.objects);
248 } else if (o instanceof MutableOffsetMap) {
249 // Let MutableOffsetMap do the actual work.
250 return o.equals(this);
253 final Map<?, ?> other = (Map<?, ?>)o;
255 // Size and key sets have to match
256 if (size() != other.size() || !keySet().equals(other.keySet())) {
261 // Ensure all objects are present
262 for (Entry<K, Integer> e : offsets.entrySet()) {
263 if (!objects[e.getValue()].equals(other.get(e.getKey()))) {
267 } catch (ClassCastException e) {
268 // Can be thrown by other.get() indicating we have incompatible key types
276 public final boolean containsKey(final Object key) {
277 return offsets.containsKey(key);
281 public final boolean containsValue(final Object value) {
282 for (Object o : objects) {
283 if (value.equals(o)) {
291 public final V get(final Object key) {
292 final Integer offset = offsets.get(key);
293 return offset == null ? null : objects[offset];
297 public final V remove(final Object key) {
298 throw new UnsupportedOperationException();
302 public final V put(final K key, final V value) {
303 throw new UnsupportedOperationException();
307 public final void putAll(final Map<? extends K, ? extends V> m) {
308 throw new UnsupportedOperationException();
312 public final void clear() {
313 throw new UnsupportedOperationException();
317 public final Set<K> keySet() {
318 return offsets.keySet();
322 public final Collection<V> values() {
323 return new ConstantArrayCollection<>(objects);
327 public final Set<Entry<K, V>> entrySet() {
328 return new EntrySet();
332 public final String toString() {
333 final StringBuilder sb = new StringBuilder("{");
334 final Iterator<K> it = offsets.keySet().iterator();
336 while (it.hasNext()) {
337 sb.append(it.next());
339 sb.append(objects[i++]);
346 return sb.append('}').toString();
349 final Map<K, Integer> offsets() {
353 final V[] objects() {
357 private final class EntrySet extends AbstractSet<Entry<K, V>> {
359 public Iterator<Entry<K, V>> iterator() {
360 final Iterator<Entry<K, Integer>> it = offsets.entrySet().iterator();
362 return new UnmodifiableIterator<Entry<K, V>>() {
364 public boolean hasNext() {
369 public Entry<K, V> next() {
370 final Entry<K, Integer> e = it.next();
371 return new SimpleImmutableEntry<>(e.getKey(), objects[e.getValue()]);
378 return offsets.size();
382 private void writeObject(final ObjectOutputStream out) throws IOException {
383 out.writeInt(offsets.size());
384 for (Entry<K, V> e : entrySet()) {
385 out.writeObject(e.getKey());
386 out.writeObject(e.getValue());
390 private static final Field OFFSETS_FIELD = fieldFor("offsets");
391 private static final Field ARRAY_FIELD = fieldFor("objects");
393 private static Field fieldFor(final String name) {
396 f = ImmutableOffsetMap.class.getDeclaredField(name);
397 } catch (NoSuchFieldException | SecurityException e) {
398 throw new IllegalStateException("Failed to lookup field " + name, e);
401 f.setAccessible(true);
405 private static void setField(final ImmutableOffsetMap<?, ?> map, final Field field, final Object value) throws IOException {
407 field.set(map, value);
408 } catch (IllegalArgumentException | IllegalAccessException e) {
409 throw new IOException("Failed to set field " + field, e);
413 @SuppressWarnings("unchecked")
414 private void readObject(final ObjectInputStream in) throws IOException, ClassNotFoundException {
415 final int s = in.readInt();
417 final List<K> keys = new ArrayList<>(s);
418 final V[] values = (V[]) new Object[s];
420 for (int i = 0; i < s; ++i) {
421 keys.add((K)in.readObject());
422 values[i] = (V)in.readObject();
425 setFields(keys, values);