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 static com.google.common.base.Preconditions.checkArgument;
11 import static java.util.Objects.requireNonNull;
13 import com.google.common.annotations.Beta;
14 import com.google.common.collect.ImmutableMap;
15 import com.google.common.collect.UnmodifiableIterator;
16 import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
17 import java.io.IOException;
18 import java.io.ObjectInputStream;
19 import java.io.ObjectOutputStream;
20 import java.io.Serializable;
21 import java.lang.reflect.Field;
22 import java.util.AbstractMap.SimpleImmutableEntry;
23 import java.util.AbstractSet;
24 import java.util.ArrayList;
25 import java.util.Arrays;
26 import java.util.Collection;
27 import java.util.Iterator;
28 import java.util.List;
31 import org.eclipse.jdt.annotation.NonNull;
32 import org.eclipse.jdt.annotation.Nullable;
35 * Implementation of the {@link Map} interface which stores a set of immutable mappings using a key-to-offset map and
36 * a backing array. This is useful for situations where the same key set is shared across a multitude of maps, as this
37 * class uses a global cache to share the key-to-offset mapping.
40 * In case the set of keys is statically known, you can use {@link ImmutableOffsetMapTemplate} to efficiently create
41 * {@link ImmutableOffsetMap} instances.
43 * @param <K> the type of keys maintained by this map
44 * @param <V> the type of mapped values
47 public abstract class ImmutableOffsetMap<K, V> implements UnmodifiableMapPhase<K, V>, Serializable {
48 static final class Ordered<K, V> extends ImmutableOffsetMap<K, V> {
49 private static final long serialVersionUID = 1L;
51 Ordered(final ImmutableMap<K, Integer> offsets, final V[] objects) {
52 super(offsets, objects);
56 public @NonNull MutableOffsetMap<K, V> toModifiableMap() {
57 return MutableOffsetMap.orderedCopyOf(this);
61 void setFields(final List<K> keys, final V[] values) throws IOException {
62 setField(this, OFFSETS_FIELD, OffsetMapCache.orderedOffsets(keys));
63 setField(this, ARRAY_FIELD, values);
67 static final class Unordered<K, V> extends ImmutableOffsetMap<K, V> {
68 private static final long serialVersionUID = 1L;
70 Unordered(final ImmutableMap<K, Integer> offsets, final V[] objects) {
71 super(offsets, objects);
75 public @NonNull MutableOffsetMap<K, V> toModifiableMap() {
76 return MutableOffsetMap.unorderedCopyOf(this);
80 void setFields(final List<K> keys, final V[] values) throws IOException {
81 final Map<K, Integer> newOffsets = OffsetMapCache.unorderedOffsets(keys);
83 setField(this, OFFSETS_FIELD, newOffsets);
84 setField(this, ARRAY_FIELD, OffsetMapCache.adjustedArray(newOffsets, keys, values));
88 private static final long serialVersionUID = 1L;
90 private final transient @NonNull ImmutableMap<K, Integer> offsets;
91 private final transient @NonNull V[] objects;
92 private transient int hashCode;
95 * Construct a new instance backed by specified key-to-offset map and array of objects.
97 * @param offsets Key-to-offset map, may not be null
98 * @param objects Array of value object, may not be null. The array is stored as is, the caller
99 * is responsible for ensuring its contents remain unmodified.
101 ImmutableOffsetMap(final ImmutableMap<K, Integer> offsets, final V[] objects) {
102 this.offsets = requireNonNull(offsets);
103 this.objects = requireNonNull(objects);
104 checkArgument(offsets.size() == objects.length);
108 public abstract @NonNull MutableOffsetMap<K, V> toModifiableMap();
110 abstract void setFields(List<K> keys, V[] values) throws IOException;
113 * Create an {@link ImmutableOffsetMap} as a copy of an existing map. This is actually not completely true, as this
114 * method returns an {@link ImmutableMap} for empty and singleton inputs, as those are more memory-efficient. This
115 * method also recognizes {@link ImmutableOffsetMap} and {@link SharedSingletonMap} on input, and returns it back
116 * without doing anything else. It also recognizes {@link MutableOffsetMap} (as returned by
117 * {@link #toModifiableMap()}) and makes an efficient copy of its contents. All other maps are converted to an
118 * {@link ImmutableOffsetMap} with the same iteration order as input.
120 * @param <K> the type of keys maintained by the map
121 * @param <V> the type of mapped values
122 * @param map Input map, may not be null.
123 * @return An isolated, immutable copy of the input map
124 * @throws NullPointerException if {@code map} or any of its elements is null.
126 public static <K, V> @NonNull Map<K, V> orderedCopyOf(final @NonNull Map<K, V> map) {
127 final Map<K, V> common = commonCopy(map);
128 if (common != null) {
132 final int size = map.size();
134 // Efficient single-entry implementation
135 final Entry<K, V> e = map.entrySet().iterator().next();
136 return SharedSingletonMap.orderedOf(e.getKey(), e.getValue());
139 final ImmutableMap<K, Integer> offsets = OffsetMapCache.orderedOffsets(map.keySet());
140 @SuppressWarnings("unchecked")
141 final V[] array = (V[]) new Object[offsets.size()];
142 for (Entry<K, V> e : map.entrySet()) {
143 array[offsets.get(e.getKey())] = e.getValue();
146 return new Ordered<>(offsets, array);
150 * Create an {@link ImmutableOffsetMap} as a copy of an existing map. This is actually not completely true, as this
151 * method returns an {@link ImmutableMap} for empty and singleton inputs, as those are more memory-efficient. This
152 * method also recognizes {@link ImmutableOffsetMap} and {@link SharedSingletonMap} on input, and returns it back
153 * without doing anything else. It also recognizes {@link MutableOffsetMap} (as returned by
154 * {@link #toModifiableMap()}) and makes an efficient copy of its contents. All other maps are converted to an
155 * {@link ImmutableOffsetMap}. Iterator order is not guaranteed to be retained.
157 * @param <K> the type of keys maintained by the map
158 * @param <V> the type of mapped values
159 * @param map Input map, may not be null.
160 * @return An isolated, immutable copy of the input map
161 * @throws NullPointerException if {@code map} or any of its elements is null.
163 public static <K, V> @NonNull Map<K, V> unorderedCopyOf(final @NonNull Map<K, V> map) {
164 final Map<K, V> common = commonCopy(map);
165 if (common != null) {
169 if (map.size() == 1) {
170 // Efficient single-entry implementation
171 final Entry<K, V> e = map.entrySet().iterator().next();
172 return SharedSingletonMap.unorderedOf(e.getKey(), e.getValue());
175 final ImmutableMap<K, Integer> offsets = OffsetMapCache.unorderedOffsets(map.keySet());
176 @SuppressWarnings("unchecked")
177 final V[] array = (V[]) new Object[offsets.size()];
178 for (Entry<K, V> e : map.entrySet()) {
179 array[offsets.get(e.getKey())] = e.getValue();
182 return new Unordered<>(offsets, array);
185 private static <K, V> @Nullable Map<K, V> commonCopy(final @NonNull Map<K, V> map) {
186 // Prevent a copy. Note that ImmutableMap is not listed here because of its potentially larger keySet overhead.
187 if (map instanceof ImmutableOffsetMap || map instanceof SharedSingletonMap) {
191 // Familiar and efficient to copy
192 if (map instanceof MutableOffsetMap) {
193 return ((MutableOffsetMap<K, V>) map).toUnmodifiableMap();
197 // Shares a single object
198 return ImmutableMap.of();
205 public final int size() {
206 return offsets.size();
210 public final boolean isEmpty() {
211 return offsets.isEmpty();
215 public final int hashCode() {
221 for (Entry<K, Integer> e : offsets.entrySet()) {
222 result += e.getKey().hashCode() ^ objects[e.getValue()].hashCode();
230 public final boolean equals(final Object obj) {
234 if (!(obj instanceof Map)) {
238 if (obj instanceof ImmutableOffsetMap) {
239 final ImmutableOffsetMap<?, ?> om = (ImmutableOffsetMap<?, ?>) obj;
241 // If the offset match, the arrays have to match, too
242 if (offsets.equals(om.offsets)) {
243 return Arrays.deepEquals(objects, om.objects);
245 } else if (obj instanceof MutableOffsetMap) {
246 // Let MutableOffsetMap do the actual work.
247 return obj.equals(this);
250 final Map<?, ?> other = (Map<?, ?>)obj;
252 // Size and key sets have to match
253 if (size() != other.size() || !keySet().equals(other.keySet())) {
258 // Ensure all objects are present
259 for (Entry<K, Integer> e : offsets.entrySet()) {
260 if (!objects[e.getValue()].equals(other.get(e.getKey()))) {
264 } catch (ClassCastException e) {
265 // Can be thrown by other.get() indicating we have incompatible key types
273 public final boolean containsKey(final Object key) {
274 return offsets.containsKey(key);
278 public final boolean containsValue(final Object value) {
279 for (Object o : objects) {
280 if (value.equals(o)) {
288 public final V get(final Object key) {
290 return (offset = offsets.get(key)) == null ? null : objects[offset];
294 public final V remove(final Object key) {
295 throw new UnsupportedOperationException();
299 public final V put(final K key, final V value) {
300 throw new UnsupportedOperationException();
304 @SuppressWarnings("checkstyle:parameterName")
305 public final void putAll(final Map<? extends K, ? extends V> m) {
306 throw new UnsupportedOperationException();
310 public final void clear() {
311 throw new UnsupportedOperationException();
315 public final Set<K> keySet() {
316 return offsets.keySet();
320 public final @NonNull Collection<V> values() {
321 return new ConstantArrayCollection<>(objects);
325 public final @NonNull Set<Entry<K, V>> entrySet() {
326 return new EntrySet();
330 public final String toString() {
331 final StringBuilder sb = new StringBuilder("{");
332 final Iterator<K> it = offsets.keySet().iterator();
334 while (it.hasNext()) {
335 sb.append(it.next()).append('=').append(objects[offset++]);
342 return sb.append('}').toString();
345 final @NonNull ImmutableMap<K, Integer> offsets() {
349 final @NonNull V[] objects() {
353 private final class EntrySet extends AbstractSet<Entry<K, V>> {
355 public @NonNull Iterator<Entry<K, V>> iterator() {
356 final Iterator<Entry<K, Integer>> it = offsets.entrySet().iterator();
357 return new UnmodifiableIterator<>() {
359 public boolean hasNext() {
364 public Entry<K, V> next() {
365 final Entry<K, Integer> e = it.next();
366 return new SimpleImmutableEntry<>(e.getKey(), objects[e.getValue()]);
373 return offsets.size();
377 private void writeObject(final ObjectOutputStream out) throws IOException {
378 out.writeInt(offsets.size());
379 for (Entry<K, V> e : entrySet()) {
380 out.writeObject(e.getKey());
381 out.writeObject(e.getValue());
385 private static final Field OFFSETS_FIELD = fieldFor("offsets");
386 private static final Field ARRAY_FIELD = fieldFor("objects");
388 private static @NonNull Field fieldFor(final @NonNull String name) {
391 f = ImmutableOffsetMap.class.getDeclaredField(name);
392 } catch (NoSuchFieldException | SecurityException e) {
393 throw new IllegalStateException("Failed to lookup field " + name, e);
396 f.setAccessible(true);
400 @SuppressFBWarnings(value = "UPM_UNCALLED_PRIVATE_METHOD",
401 justification = "https://github.com/spotbugs/spotbugs/issues/811")
402 private static void setField(final @NonNull ImmutableOffsetMap<?, ?> map, final @NonNull Field field,
403 final Object value) throws IOException {
405 field.set(map, value);
406 } catch (IllegalArgumentException | IllegalAccessException e) {
407 throw new IOException("Failed to set field " + field, e);
411 @SuppressWarnings("unchecked")
412 private void readObject(final @NonNull ObjectInputStream in) throws IOException, ClassNotFoundException {
413 final int s = in.readInt();
415 final List<K> keys = new ArrayList<>(s);
416 final V[] values = (V[]) new Object[s];
418 for (int i = 0; i < s; ++i) {
419 keys.add((K)in.readObject());
420 values[i] = (V)in.readObject();
423 setFields(keys, values);