55 */
56 static final int SALT;
57 static {
58 long nt = System.nanoTime();
59 SALT = (int)((nt >>> 32) ^ nt);
60 }
61
62 /** No instances. */
63 private ImmutableCollections() { }
64
65 /**
66 * The reciprocal of load factor. Given a number of elements
67 * to store, multiply by this factor to get the table size.
68 */
69 static final int EXPAND_FACTOR = 2;
70
71 static UnsupportedOperationException uoe() { return new UnsupportedOperationException(); }
72
73 // ---------- List Implementations ----------
74
75 abstract static class AbstractImmutableList<E> extends AbstractList<E>
76 implements RandomAccess, Serializable {
77 @Override public boolean add(E e) { throw uoe(); }
78 @Override public boolean addAll(Collection<? extends E> c) { throw uoe(); }
79 @Override public boolean addAll(int index, Collection<? extends E> c) { throw uoe(); }
80 @Override public void clear() { throw uoe(); }
81 @Override public boolean remove(Object o) { throw uoe(); }
82 @Override public boolean removeAll(Collection<?> c) { throw uoe(); }
83 @Override public boolean removeIf(Predicate<? super E> filter) { throw uoe(); }
84 @Override public void replaceAll(UnaryOperator<E> operator) { throw uoe(); }
85 @Override public boolean retainAll(Collection<?> c) { throw uoe(); }
86 @Override public void sort(Comparator<? super E> c) { throw uoe(); }
87 }
88
89 static final class List0<E> extends AbstractImmutableList<E> {
90 private static final List0<?> INSTANCE = new List0<>();
91
92 @SuppressWarnings("unchecked")
93 static <T> List0<T> instance() {
94 return (List0<T>) INSTANCE;
95 }
96
97 private List0() { }
98
99 @Override
100 public int size() {
101 return 0;
102 }
103
104 @Override
105 public E get(int index) {
106 Objects.checkIndex(index, 0); // always throws IndexOutOfBoundsException
107 return null; // but the compiler doesn't know this
108 }
109
110 @Override
111 public Iterator<E> iterator() {
112 return Collections.emptyIterator();
113 }
114
115 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
116 throw new InvalidObjectException("not serial proxy");
117 }
118
119 private Object writeReplace() {
120 return new CollSer(CollSer.IMM_LIST);
121 }
122
123 @Override
124 public boolean contains(Object o) {
125 Objects.requireNonNull(o);
126 return false;
127 }
128
129 @Override
130 public boolean containsAll(Collection<?> o) {
131 return o.isEmpty(); // implicit nullcheck of o
132 }
133
134 @Override
135 public int hashCode() {
136 return 1;
137 }
138 }
139
140 static final class List1<E> extends AbstractImmutableList<E> {
141 @Stable
142 private final E e0;
143
144 List1(E e0) {
145 this.e0 = Objects.requireNonNull(e0);
146 }
147
148 @Override
149 public int size() {
150 return 1;
151 }
152
153 @Override
154 public E get(int index) {
155 Objects.checkIndex(index, 1);
156 return e0;
157 }
158
159 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
160 throw new InvalidObjectException("not serial proxy");
161 }
162
163 private Object writeReplace() {
164 return new CollSer(CollSer.IMM_LIST, e0);
165 }
166
167 @Override
168 public boolean contains(Object o) {
169 return o.equals(e0); // implicit nullcheck of o
170 }
171
172 @Override
173 public int hashCode() {
174 return 31 + e0.hashCode();
175 }
176 }
177
178 static final class List2<E> extends AbstractImmutableList<E> {
179 @Stable
180 private final E e0;
181 @Stable
182 private final E e1;
183
184 List2(E e0, E e1) {
185 this.e0 = Objects.requireNonNull(e0);
186 this.e1 = Objects.requireNonNull(e1);
187 }
188
189 @Override
190 public int size() {
191 return 2;
192 }
193
194 @Override
195 public E get(int index) {
196 Objects.checkIndex(index, 2);
197 if (index == 0) {
198 return e0;
199 } else { // index == 1
200 return e1;
201 }
202 }
203
204 @Override
205 public boolean contains(Object o) {
206 return o.equals(e0) || o.equals(e1); // implicit nullcheck of o
207 }
208
209 @Override
210 public int hashCode() {
211 int hash = 31 + e0.hashCode();
212 return 31 * hash + e1.hashCode();
213 }
214
215 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
216 throw new InvalidObjectException("not serial proxy");
217 }
218
219 private Object writeReplace() {
220 return new CollSer(CollSer.IMM_LIST, e0, e1);
221 }
222 }
223
224 static final class ListN<E> extends AbstractImmutableList<E> {
225 @Stable
226 private final E[] elements;
227
228 @SafeVarargs
229 ListN(E... input) {
230 // copy and check manually to avoid TOCTOU
231 @SuppressWarnings("unchecked")
232 E[] tmp = (E[])new Object[input.length]; // implicit nullcheck of input
233 for (int i = 0; i < input.length; i++) {
234 tmp[i] = Objects.requireNonNull(input[i]);
235 }
236 this.elements = tmp;
237 }
238
239 @Override
240 public int size() {
241 return elements.length;
242 }
243
244 @Override
245 public E get(int index) {
246 Objects.checkIndex(index, elements.length);
247 return elements[index];
248 }
249
250 @Override
251 public boolean contains(Object o) {
252 for (E e : elements) {
253 if (o.equals(e)) { // implicit nullcheck of o
254 return true;
255 }
256 }
257 return false;
258 }
259
260 @Override
261 public int hashCode() {
262 int hash = 1;
263 for (E e : elements) {
264 hash = 31 * hash + e.hashCode();
265 }
266 return hash;
267 }
268
269 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
270 throw new InvalidObjectException("not serial proxy");
271 }
272
273 private Object writeReplace() {
274 return new CollSer(CollSer.IMM_LIST, elements);
275 }
276 }
277
278 // ---------- Set Implementations ----------
279
280 abstract static class AbstractImmutableSet<E> extends AbstractSet<E> implements Serializable {
281 @Override public boolean add(E e) { throw uoe(); }
282 @Override public boolean addAll(Collection<? extends E> c) { throw uoe(); }
283 @Override public void clear() { throw uoe(); }
284 @Override public boolean remove(Object o) { throw uoe(); }
285 @Override public boolean removeAll(Collection<?> c) { throw uoe(); }
286 @Override public boolean removeIf(Predicate<? super E> filter) { throw uoe(); }
287 @Override public boolean retainAll(Collection<?> c) { throw uoe(); }
288 }
289
290 static final class Set0<E> extends AbstractImmutableSet<E> {
291 private static final Set0<?> INSTANCE = new Set0<>();
292
293 @SuppressWarnings("unchecked")
294 static <T> Set0<T> instance() {
295 return (Set0<T>) INSTANCE;
296 }
297
298 private Set0() { }
299
300 @Override
301 public int size() {
302 return 0;
303 }
304
305 @Override
306 public boolean contains(Object o) {
307 Objects.requireNonNull(o);
308 return false;
309 }
310
311 @Override
312 public boolean containsAll(Collection<?> o) {
313 return o.isEmpty(); // implicit nullcheck of o
314 }
315
316 @Override
317 public Iterator<E> iterator() {
318 return Collections.emptyIterator();
319 }
320
321 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
322 throw new InvalidObjectException("not serial proxy");
323 }
324
325 private Object writeReplace() {
326 return new CollSer(CollSer.IMM_SET);
327 }
328
329 @Override
330 public int hashCode() {
331 return 0;
332 }
333 }
334
335 static final class Set1<E> extends AbstractImmutableSet<E> {
336 @Stable
337 private final E e0;
338
339 Set1(E e0) {
340 this.e0 = Objects.requireNonNull(e0);
341 }
342
343 @Override
344 public int size() {
345 return 1;
346 }
347
348 @Override
349 public boolean contains(Object o) {
350 return o.equals(e0); // implicit nullcheck of o
351 }
352
353 @Override
354 public Iterator<E> iterator() {
355 return Collections.singletonIterator(e0);
356 }
357
358 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
359 throw new InvalidObjectException("not serial proxy");
360 }
361
362 private Object writeReplace() {
363 return new CollSer(CollSer.IMM_SET, e0);
364 }
365
366 @Override
367 public int hashCode() {
368 return e0.hashCode();
369 }
370 }
371
372 static final class Set2<E> extends AbstractImmutableSet<E> {
373 @Stable
374 final E e0;
375 @Stable
376 final E e1;
377
378 Set2(E e0, E e1) {
379 if (e0.equals(Objects.requireNonNull(e1))) { // implicit nullcheck of e0
380 throw new IllegalArgumentException("duplicate element: " + e0);
381 }
382
383 if (SALT >= 0) {
384 this.e0 = e0;
385 this.e1 = e1;
386 } else {
387 this.e0 = e1;
388 this.e1 = e0;
389 }
390 }
391
392 @Override
393 public int size() {
394 return 2;
395 }
396
397 @Override
398 public boolean contains(Object o) {
399 return o.equals(e0) || o.equals(e1); // implicit nullcheck of o
400 }
401
402 @Override
403 public int hashCode() {
404 return e0.hashCode() + e1.hashCode();
405 }
406
407 @Override
408 public Iterator<E> iterator() {
409 return new Iterator<E>() {
410 private int idx = 0;
411
412 @Override
413 public boolean hasNext() {
414 return idx < 2;
415 }
416
417 @Override
418 public E next() {
419 if (idx == 0) {
420 idx = 1;
421 return e0;
422 } else if (idx == 1) {
423 idx = 2;
424 return e1;
425 } else {
426 throw new NoSuchElementException();
427 }
428 }
429 };
430 }
431
432 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
433 throw new InvalidObjectException("not serial proxy");
434 }
435
436 private Object writeReplace() {
437 return new CollSer(CollSer.IMM_SET, e0, e1);
438 }
439 }
440
441 /**
442 * An array-based Set implementation. The element array must be strictly
443 * larger than the size (the number of contained elements) so that at
444 * least one null is always present.
445 * @param <E> the element type
446 */
447 static final class SetN<E> extends AbstractImmutableSet<E> {
448 @Stable
449 final E[] elements;
450 @Stable
451 final int size;
452
453 @SafeVarargs
454 @SuppressWarnings("unchecked")
455 SetN(E... input) {
456 size = input.length; // implicit nullcheck of input
457
458 elements = (E[])new Object[EXPAND_FACTOR * input.length];
459 for (int i = 0; i < input.length; i++) {
460 E e = input[i];
461 int idx = probe(e); // implicit nullcheck of e
462 if (idx >= 0) {
463 throw new IllegalArgumentException("duplicate element: " + e);
464 } else {
465 elements[-(idx + 1)] = e;
466 }
467 }
468 }
469
470 @Override
471 public int size() {
472 return size;
473 }
474
475 @Override
476 public boolean contains(Object o) {
477 return probe(o) >= 0; // implicit nullcheck of o
478 }
479
480 @Override
481 public Iterator<E> iterator() {
482 return new Iterator<E>() {
483 private int idx = 0;
484
485 @Override
486 public boolean hasNext() {
487 while (idx < elements.length) {
488 if (elements[idx] != null)
489 return true;
490 idx++;
491 }
492 return false;
493 }
494
495 @Override
496 public E next() {
497 if (! hasNext()) {
532 }
533
534 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
535 throw new InvalidObjectException("not serial proxy");
536 }
537
538 private Object writeReplace() {
539 Object[] array = new Object[size];
540 int dest = 0;
541 for (Object o : elements) {
542 if (o != null) {
543 array[dest++] = o;
544 }
545 }
546 return new CollSer(CollSer.IMM_SET, array);
547 }
548 }
549
550 // ---------- Map Implementations ----------
551
552 abstract static class AbstractImmutableMap<K,V> extends AbstractMap<K,V> implements Serializable {
553 @Override public void clear() { throw uoe(); }
554 @Override public V compute(K key, BiFunction<? super K,? super V,? extends V> rf) { throw uoe(); }
555 @Override public V computeIfAbsent(K key, Function<? super K,? extends V> mf) { throw uoe(); }
556 @Override public V computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> rf) { throw uoe(); }
557 @Override public V merge(K key, V value, BiFunction<? super V,? super V,? extends V> rf) { throw uoe(); }
558 @Override public V put(K key, V value) { throw uoe(); }
559 @Override public void putAll(Map<? extends K,? extends V> m) { throw uoe(); }
560 @Override public V putIfAbsent(K key, V value) { throw uoe(); }
561 @Override public V remove(Object key) { throw uoe(); }
562 @Override public boolean remove(Object key, Object value) { throw uoe(); }
563 @Override public V replace(K key, V value) { throw uoe(); }
564 @Override public boolean replace(K key, V oldValue, V newValue) { throw uoe(); }
565 @Override public void replaceAll(BiFunction<? super K,? super V,? extends V> f) { throw uoe(); }
566 }
567
568 static final class Map0<K,V> extends AbstractImmutableMap<K,V> {
569 private static final Map0<?,?> INSTANCE = new Map0<>();
570
571 @SuppressWarnings("unchecked")
572 static <K,V> Map0<K,V> instance() {
573 return (Map0<K,V>) INSTANCE;
574 }
575
576 private Map0() { }
577
578 @Override
579 public Set<Map.Entry<K,V>> entrySet() {
580 return Set.of();
581 }
582
583 @Override
584 public boolean containsKey(Object o) {
585 Objects.requireNonNull(o);
586 return false;
587 }
588
589 @Override
590 public boolean containsValue(Object o) {
591 Objects.requireNonNull(o);
592 return false;
593 }
594
595 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
596 throw new InvalidObjectException("not serial proxy");
597 }
598
599 private Object writeReplace() {
600 return new CollSer(CollSer.IMM_MAP);
601 }
602
603 @Override
604 public int hashCode() {
605 return 0;
606 }
607 }
608
609 static final class Map1<K,V> extends AbstractImmutableMap<K,V> {
610 @Stable
611 private final K k0;
612 @Stable
613 private final V v0;
614
615 Map1(K k0, V v0) {
616 this.k0 = Objects.requireNonNull(k0);
617 this.v0 = Objects.requireNonNull(v0);
618 }
619
620 @Override
621 public Set<Map.Entry<K,V>> entrySet() {
622 return Set.of(new KeyValueHolder<>(k0, v0));
623 }
624
625 @Override
626 public boolean containsKey(Object o) {
627 return o.equals(k0); // implicit nullcheck of o
628 }
641 }
642
643 @Override
644 public int hashCode() {
645 return k0.hashCode() ^ v0.hashCode();
646 }
647 }
648
649 /**
650 * An array-based Map implementation. There is a single array "table" that
651 * contains keys and values interleaved: table[0] is kA, table[1] is vA,
652 * table[2] is kB, table[3] is vB, etc. The table size must be even. It must
653 * also be strictly larger than the size (the number of key-value pairs contained
654 * in the map) so that at least one null key is always present.
655 * @param <K> the key type
656 * @param <V> the value type
657 */
658 static final class MapN<K,V> extends AbstractImmutableMap<K,V> {
659 @Stable
660 final Object[] table; // pairs of key, value
661 @Stable
662 final int size; // number of pairs
663
664 MapN(Object... input) {
665 if ((input.length & 1) != 0) { // implicit nullcheck of input
666 throw new InternalError("length is odd");
667 }
668 size = input.length >> 1;
669
670 int len = EXPAND_FACTOR * input.length;
671 len = (len + 1) & ~1; // ensure table is even length
672 table = new Object[len];
673
674 for (int i = 0; i < input.length; i += 2) {
675 @SuppressWarnings("unchecked")
676 K k = Objects.requireNonNull((K)input[i]);
677 @SuppressWarnings("unchecked")
678 V v = Objects.requireNonNull((V)input[i+1]);
679 int idx = probe(k);
680 if (idx >= 0) {
681 throw new IllegalArgumentException("duplicate key: " + k);
682 } else {
683 int dest = -(idx + 1);
684 table[dest] = k;
685 table[dest+1] = v;
686 }
687 }
688 }
689
690 @Override
691 public boolean containsKey(Object o) {
692 return probe(o) >= 0; // implicit nullcheck of o
693 }
694
695 @Override
696 public boolean containsValue(Object o) {
697 for (int i = 1; i < table.length; i += 2) {
698 Object v = table[i];
699 if (v != null && o.equals(v)) { // implicit nullcheck of o
700 return true;
701 }
702 }
703 return false;
704 }
705
706 @Override
707 public int hashCode() {
708 int hash = 0;
709 for (int i = 0; i < table.length; i += 2) {
710 Object k = table[i];
711 if (k != null) {
712 hash += k.hashCode() ^ table[i + 1].hashCode();
713 }
714 }
715 return hash;
716 }
717
718 @Override
719 @SuppressWarnings("unchecked")
720 public V get(Object o) {
721 int i = probe(o);
722 if (i >= 0) {
723 return (V)table[i+1];
724 } else {
725 return null;
726 }
727 }
728
729 @Override
730 public int size() {
731 return size;
732 }
733
734 @Override
735 public Set<Map.Entry<K,V>> entrySet() {
736 return new AbstractSet<Map.Entry<K,V>>() {
737 @Override
738 public int size() {
739 return MapN.this.size;
740 }
931 * @throws InvalidObjectException if the tag value is illegal or if an exception
932 * is thrown during creation of the collection
933 * @throws ObjectStreamException if another serialization error has occurred
934 * @since 9
935 */
936 private Object readResolve() throws ObjectStreamException {
937 try {
938 if (array == null) {
939 throw new InvalidObjectException("null array");
940 }
941
942 // use low order 8 bits to indicate "kind"
943 // ignore high order 24 bits
944 switch (tag & 0xff) {
945 case IMM_LIST:
946 return List.of(array);
947 case IMM_SET:
948 return Set.of(array);
949 case IMM_MAP:
950 if (array.length == 0) {
951 return ImmutableCollections.Map0.instance();
952 } else if (array.length == 2) {
953 return new ImmutableCollections.Map1<>(array[0], array[1]);
954 } else {
955 return new ImmutableCollections.MapN<>(array);
956 }
957 default:
958 throw new InvalidObjectException(String.format("invalid flags 0x%x", tag));
959 }
960 } catch (NullPointerException|IllegalArgumentException ex) {
961 InvalidObjectException ioe = new InvalidObjectException("invalid object");
962 ioe.initCause(ex);
963 throw ioe;
964 }
965 }
966 }
|
55 */
56 static final int SALT;
57 static {
58 long nt = System.nanoTime();
59 SALT = (int)((nt >>> 32) ^ nt);
60 }
61
62 /** No instances. */
63 private ImmutableCollections() { }
64
65 /**
66 * The reciprocal of load factor. Given a number of elements
67 * to store, multiply by this factor to get the table size.
68 */
69 static final int EXPAND_FACTOR = 2;
70
71 static UnsupportedOperationException uoe() { return new UnsupportedOperationException(); }
72
73 // ---------- List Implementations ----------
74
75 static final List<?> EMPTY_LIST = new ListN<>();
76
77 @SuppressWarnings("unchecked")
78 static <E> List<E> emptyList() {
79 return (List<E>) EMPTY_LIST;
80 }
81
82 static abstract class AbstractImmutableList<E> extends AbstractCollection<E>
83 implements List<E>, RandomAccess {
84
85 // all mutating methods throw UnsupportedOperationException
86 @Override public boolean add(E e) { throw uoe(); }
87 @Override public void add(int index, E element) { throw uoe(); }
88 @Override public boolean addAll(Collection<? extends E> c) { throw uoe(); }
89 @Override public boolean addAll(int index, Collection<? extends E> c) { throw uoe(); }
90 @Override public void clear() { throw uoe(); }
91 @Override public boolean remove(Object o) { throw uoe(); }
92 @Override public E remove(int index) { throw uoe(); }
93 @Override public boolean removeAll(Collection<?> c) { throw uoe(); }
94 @Override public boolean removeIf(Predicate<? super E> filter) { throw uoe(); }
95 @Override public void replaceAll(UnaryOperator<E> operator) { throw uoe(); }
96 @Override public boolean retainAll(Collection<?> c) { throw uoe(); }
97 @Override public E set(int index, E element) { throw uoe(); }
98 @Override public void sort(Comparator<? super E> c) { throw uoe(); }
99
100 @Override
101 public int indexOf(Object o) {
102 // Input should be checked for null, but this needs a CSR. See JDK-8191418
103 if (o == null) {
104 return -1;
105 }
106 // Objects.requireNonNull(o);
107 ListIterator<E> it = listIterator();
108 while (it.hasNext()) {
109 if (o.equals(it.next())) {
110 return it.previousIndex();
111 }
112 }
113 return -1;
114 }
115
116 @Override
117 public int lastIndexOf(Object o) {
118 // Input should be checked for null, but this needs a CSR. See JDK-8191418
119 if (o == null) {
120 return -1;
121 }
122 // Objects.requireNonNull(o);
123
124 ListIterator<E> it = listIterator();
125 while (it.hasNext()) {
126 if (o.equals(it.next())) {
127 return it.previousIndex();
128 }
129 }
130 return -1;
131 }
132
133 @Override
134 public boolean isEmpty() {
135 return size() == 0;
136 }
137
138 @Override
139 public List<E> subList(int fromIndex, int toIndex) {
140 int size = size();
141 subListRangeCheck(fromIndex, toIndex, size);
142 if (size == 0 || fromIndex == toIndex) {
143 return emptyList();
144 } else if (size == 1) {
145 // checks above deal with corner cases subList(0,0) and subList(1,1)
146 // that would return the empty list
147 assert(fromIndex == 0 && toIndex == 1);
148 return this;
149 } else {
150 return new SubList<E>(this, fromIndex, toIndex);
151 }
152 }
153
154 private static final class SubList<E> extends AbstractImmutableList<E> implements RandomAccess {
155 private final List<E> root;
156 final int offset;
157 int size;
158
159 /**
160 * Constructs a sublist of an arbitrary AbstractList, which is
161 * not a SubList itself.
162 */
163 SubList(List<E> root, int fromIndex, int toIndex) {
164 this.root = root;
165 this.offset = fromIndex;
166 this.size = toIndex - fromIndex;
167 }
168
169 /**
170 * Constructs a sublist of another SubList.
171 */
172 SubList(SubList<E> parent, int fromIndex, int toIndex) {
173 this.root = parent.root;
174 this.offset = parent.offset + fromIndex;
175 this.size = toIndex - fromIndex;
176 }
177
178 public E get(int index) {
179 Objects.checkIndex(index, size);
180 return root.get(offset + index);
181 }
182
183 public int size() {
184 return size;
185 }
186
187 public Iterator<E> iterator() {
188 return listIterator();
189 }
190
191 public ListIterator<E> listIterator(int index) {
192 rangeCheck(index);
193
194 ListIterator<E> i = root.listIterator(offset + index);
195
196 return new ListIterator<>() {
197
198 public boolean hasNext() {
199 return nextIndex() < size;
200 }
201
202 public E next() {
203 if (hasNext()) {
204 return i.next();
205 } else {
206 throw new NoSuchElementException();
207 }
208 }
209
210 public boolean hasPrevious() {
211 return previousIndex() >= 0;
212 }
213
214 public E previous() {
215 if (hasPrevious()) {
216 return i.previous();
217 } else {
218 throw new NoSuchElementException();
219 }
220 }
221
222 public int nextIndex() {
223 return i.nextIndex() - offset;
224 }
225
226 public int previousIndex() {
227 return i.previousIndex() - offset;
228 }
229
230 public void remove() { throw uoe(); }
231 public void set(E e) { throw uoe(); }
232 public void add(E e) { throw uoe(); }
233 };
234 }
235
236 public List<E> subList(int fromIndex, int toIndex) {
237 subListRangeCheck(fromIndex, toIndex, size);
238 return new SubList<>(this, fromIndex, toIndex);
239 }
240
241 private void rangeCheck(int index) {
242 if (index < 0 || index > size) {
243 throw outOfBounds(index);
244 }
245 }
246 }
247
248 static void subListRangeCheck(int fromIndex, int toIndex, int size) {
249 if (fromIndex < 0)
250 throw new IndexOutOfBoundsException("fromIndex = " + fromIndex);
251 if (toIndex > size)
252 throw new IndexOutOfBoundsException("toIndex = " + toIndex);
253 if (fromIndex > toIndex)
254 throw new IllegalArgumentException("fromIndex(" + fromIndex +
255 ") > toIndex(" + toIndex + ")");
256 }
257
258 @Override
259 public Iterator<E> iterator() {
260 return new Itr();
261 }
262
263 @Override
264 public ListIterator<E> listIterator() {
265 return listIterator(0);
266 }
267
268 @Override
269 public ListIterator<E> listIterator(final int index) {
270 Objects.checkIndex(index, size());
271 return new ListItr(index);
272 }
273
274 private class Itr implements Iterator<E> {
275
276 int cursor;
277
278 private final int size;
279
280 Itr() {
281 size = size();
282 }
283
284 public boolean hasNext() {
285 return cursor != size;
286 }
287
288 public E next() {
289 try {
290 int i = cursor;
291 E next = get(i);
292 cursor = i + 1;
293 return next;
294 } catch (IndexOutOfBoundsException e) {
295 throw new NoSuchElementException();
296 }
297 }
298
299 public void remove() {
300 throw uoe();
301 }
302 }
303
304 private class ListItr extends Itr implements ListIterator<E> {
305 ListItr(int index) {
306 cursor = index;
307 }
308
309 public boolean hasPrevious() {
310 return cursor != 0;
311 }
312
313 public E previous() {
314 try {
315 int i = cursor - 1;
316 E previous = get(i);
317 cursor = i;
318 return previous;
319 } catch (IndexOutOfBoundsException e) {
320 throw new NoSuchElementException();
321 }
322 }
323
324 public int nextIndex() {
325 return cursor;
326 }
327
328 public int previousIndex() {
329 return cursor - 1;
330 }
331
332 public void set(E e) {
333 throw uoe();
334 }
335
336 public void add(E e) {
337 throw uoe();
338 }
339 }
340
341
342 @Override
343 public boolean equals(Object o) {
344 if (o == this) {
345 return true;
346 }
347
348 if (!(o instanceof List)) {
349 return false;
350 }
351
352 Iterator<?> e1 = iterator();
353 Iterator<?> e2 = ((List<?>) o).iterator();
354 while (e1.hasNext() && e2.hasNext()) {
355 Object o1 = e1.next(); // can't be null
356 Object o2 = e2.next();
357 if (o1.equals(o2)) {
358 return false;
359 }
360 }
361 return !(e1.hasNext() || e2.hasNext());
362 }
363
364 IndexOutOfBoundsException outOfBounds(int index) {
365 return new IndexOutOfBoundsException("Index: " + index + " Size: " + size());
366 }
367 }
368
369 static final class List12<E> extends AbstractImmutableList<E> implements Serializable {
370
371 @Stable
372 private final E e0;
373
374 @Stable
375 private final E e1;
376
377 List12(E e0) {
378 this.e0 = Objects.requireNonNull(e0);
379 this.e1 = null;
380 }
381
382 List12(E e0, E e1) {
383 this.e0 = Objects.requireNonNull(e0);
384 this.e1 = Objects.requireNonNull(e1);
385 }
386
387 @Override
388 public int size() {
389 return e1 != null ? 2 : 1;
390 }
391
392 @Override
393 public E get(int index) {
394 if (index == 0) {
395 return e0;
396 } else if (index == 1 && e1 != null) {
397 return e1;
398 }
399 throw outOfBounds(index);
400 }
401
402 @Override
403 public boolean contains(Object o) {
404 return o.equals(e0) || o.equals(e1); // implicit null check of o
405 }
406
407 @Override
408 public int hashCode() {
409 int hash = 31 + e0.hashCode();
410 if (e1 != null) {
411 hash = 31 * hash + e1.hashCode();
412 }
413 return hash;
414 }
415
416 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
417 throw new InvalidObjectException("not serial proxy");
418 }
419
420 private Object writeReplace() {
421 if (e1 == null) {
422 return new CollSer(CollSer.IMM_LIST, e0);
423 } else {
424 return new CollSer(CollSer.IMM_LIST, e0, e1);
425 }
426 }
427 }
428
429 static final class ListN<E> extends AbstractImmutableList<E> implements Serializable {
430
431 @Stable
432 private final E[] elements;
433
434 @SuppressWarnings("unchecked")
435 ListN(E e0) {
436 elements = (E[])new Object[] { e0 };
437 }
438
439 @SuppressWarnings("unchecked")
440 ListN(E e0, E e1) {
441 elements = (E[])new Object[] { e0, e1 };
442 }
443
444 @SafeVarargs
445 ListN(E... input) {
446 // copy and check manually to avoid TOCTOU
447 @SuppressWarnings("unchecked")
448 E[] tmp = (E[])new Object[input.length]; // implicit nullcheck of input
449 for (int i = 0; i < input.length; i++) {
450 tmp[i] = Objects.requireNonNull(input[i]);
451 }
452 elements = tmp;
453 }
454
455 @Override
456 public boolean isEmpty() {
457 return size() == 0;
458 }
459
460 @Override
461 public int size() {
462 return elements.length;
463 }
464
465 @Override
466 public E get(int index) {
467 return elements[index];
468 }
469
470 @Override
471 public boolean contains(Object o) {
472 Objects.requireNonNull(o);
473 for (E e : elements) {
474 if (o.equals(e)) {
475 return true;
476 }
477 }
478 return false;
479 }
480
481 @Override
482 public int hashCode() {
483 int hash = 1;
484 for (E e : elements) {
485 hash = 31 * hash + e.hashCode();
486 }
487 return hash;
488 }
489
490 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
491 throw new InvalidObjectException("not serial proxy");
492 }
493
494 private Object writeReplace() {
495 return new CollSer(CollSer.IMM_LIST, elements);
496 }
497 }
498
499 // ---------- Set Implementations ----------
500
501 static final Set<?> EMPTY_SET = new SetN<>();
502
503 @SuppressWarnings("unchecked")
504 static <E> Set<E> emptySet() {
505 return (Set<E>) EMPTY_SET;
506 }
507
508 abstract static class AbstractImmutableSet<E> extends AbstractSet<E> implements Serializable {
509 @Override public boolean add(E e) { throw uoe(); }
510 @Override public boolean addAll(Collection<? extends E> c) { throw uoe(); }
511 @Override public void clear() { throw uoe(); }
512 @Override public boolean remove(Object o) { throw uoe(); }
513 @Override public boolean removeAll(Collection<?> c) { throw uoe(); }
514 @Override public boolean removeIf(Predicate<? super E> filter) { throw uoe(); }
515 @Override public boolean retainAll(Collection<?> c) { throw uoe(); }
516 }
517
518 static final class Set12<E> extends AbstractImmutableSet<E> {
519 @Stable
520 final E e0;
521 @Stable
522 final E e1;
523
524 Set12(E e0) {
525 this.e0 = Objects.requireNonNull(e0);
526 this.e1 = null;
527 }
528
529 Set12(E e0, E e1) {
530 if (e0.equals(Objects.requireNonNull(e1))) { // implicit nullcheck of e0
531 throw new IllegalArgumentException("duplicate element: " + e0);
532 }
533
534 if (SALT >= 0) {
535 this.e0 = e0;
536 this.e1 = e1;
537 } else {
538 this.e0 = e1;
539 this.e1 = e0;
540 }
541 }
542
543 @Override
544 public int size() {
545 return (e1 == null) ? 1 : 2;
546 }
547
548 @Override
549 public boolean contains(Object o) {
550 return o.equals(e0) || o.equals(e1); // implicit nullcheck of o
551 }
552
553 @Override
554 public int hashCode() {
555 return e0.hashCode() + (e1 == null ? 0 : e1.hashCode());
556 }
557
558 @Override
559 public Iterator<E> iterator() {
560 return new Iterator<E>() {
561 private int idx = size();
562
563 @Override
564 public boolean hasNext() {
565 return idx > 0;
566 }
567
568 @Override
569 public E next() {
570 if (idx == 1) {
571 idx = 0;
572 return e0;
573 } else if (idx == 2) {
574 idx = 1;
575 return e1;
576 } else {
577 throw new NoSuchElementException();
578 }
579 }
580 };
581 }
582
583 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
584 throw new InvalidObjectException("not serial proxy");
585 }
586
587 private Object writeReplace() {
588 if (e1 == null) {
589 return new CollSer(CollSer.IMM_SET, e0);
590 } else {
591 return new CollSer(CollSer.IMM_SET, e0, e1);
592 }
593 }
594 }
595
596 /**
597 * An array-based Set implementation. The element array must be strictly
598 * larger than the size (the number of contained elements) so that at
599 * least one null is always present.
600 * @param <E> the element type
601 */
602 static final class SetN<E> extends AbstractImmutableSet<E> {
603 @Stable
604 final E[] elements;
605 @Stable
606 final int size;
607
608 @SafeVarargs
609 @SuppressWarnings("unchecked")
610 SetN(E... input) {
611 size = input.length; // implicit nullcheck of input
612
613 elements = (E[])new Object[EXPAND_FACTOR * input.length];
614 for (int i = 0; i < input.length; i++) {
615 E e = input[i];
616 int idx = probe(e); // implicit nullcheck of e
617 if (idx >= 0) {
618 throw new IllegalArgumentException("duplicate element: " + e);
619 } else {
620 elements[-(idx + 1)] = e;
621 }
622 }
623 }
624
625 @Override
626 public int size() {
627 return size;
628 }
629
630 @Override
631 public boolean contains(Object o) {
632 Objects.requireNonNull(o);
633 return size > 0 && probe(o) >= 0; // implicit nullcheck of o
634 }
635
636 @Override
637 public Iterator<E> iterator() {
638 return new Iterator<E>() {
639 private int idx = 0;
640
641 @Override
642 public boolean hasNext() {
643 while (idx < elements.length) {
644 if (elements[idx] != null)
645 return true;
646 idx++;
647 }
648 return false;
649 }
650
651 @Override
652 public E next() {
653 if (! hasNext()) {
688 }
689
690 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
691 throw new InvalidObjectException("not serial proxy");
692 }
693
694 private Object writeReplace() {
695 Object[] array = new Object[size];
696 int dest = 0;
697 for (Object o : elements) {
698 if (o != null) {
699 array[dest++] = o;
700 }
701 }
702 return new CollSer(CollSer.IMM_SET, array);
703 }
704 }
705
706 // ---------- Map Implementations ----------
707
708 static final Map<?,?> EMPTY_MAP = new MapN<>();
709
710 @SuppressWarnings("unchecked")
711 static <K,V> Map<K,V> emptyMap() {
712 return (Map<K,V>) EMPTY_MAP;
713 }
714
715 abstract static class AbstractImmutableMap<K,V> extends AbstractMap<K,V> implements Serializable {
716 @Override public void clear() { throw uoe(); }
717 @Override public V compute(K key, BiFunction<? super K,? super V,? extends V> rf) { throw uoe(); }
718 @Override public V computeIfAbsent(K key, Function<? super K,? extends V> mf) { throw uoe(); }
719 @Override public V computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> rf) { throw uoe(); }
720 @Override public V merge(K key, V value, BiFunction<? super V,? super V,? extends V> rf) { throw uoe(); }
721 @Override public V put(K key, V value) { throw uoe(); }
722 @Override public void putAll(Map<? extends K,? extends V> m) { throw uoe(); }
723 @Override public V putIfAbsent(K key, V value) { throw uoe(); }
724 @Override public V remove(Object key) { throw uoe(); }
725 @Override public boolean remove(Object key, Object value) { throw uoe(); }
726 @Override public V replace(K key, V value) { throw uoe(); }
727 @Override public boolean replace(K key, V oldValue, V newValue) { throw uoe(); }
728 @Override public void replaceAll(BiFunction<? super K,? super V,? extends V> f) { throw uoe(); }
729 }
730
731 static final class Map1<K,V> extends AbstractImmutableMap<K,V> {
732 @Stable
733 private final K k0;
734 @Stable
735 private final V v0;
736
737 Map1(K k0, V v0) {
738 this.k0 = Objects.requireNonNull(k0);
739 this.v0 = Objects.requireNonNull(v0);
740 }
741
742 @Override
743 public Set<Map.Entry<K,V>> entrySet() {
744 return Set.of(new KeyValueHolder<>(k0, v0));
745 }
746
747 @Override
748 public boolean containsKey(Object o) {
749 return o.equals(k0); // implicit nullcheck of o
750 }
763 }
764
765 @Override
766 public int hashCode() {
767 return k0.hashCode() ^ v0.hashCode();
768 }
769 }
770
771 /**
772 * An array-based Map implementation. There is a single array "table" that
773 * contains keys and values interleaved: table[0] is kA, table[1] is vA,
774 * table[2] is kB, table[3] is vB, etc. The table size must be even. It must
775 * also be strictly larger than the size (the number of key-value pairs contained
776 * in the map) so that at least one null key is always present.
777 * @param <K> the key type
778 * @param <V> the value type
779 */
780 static final class MapN<K,V> extends AbstractImmutableMap<K,V> {
781 @Stable
782 final Object[] table; // pairs of key, value
783
784 @Stable
785 final int size; // number of pairs
786
787 MapN(Object... input) {
788 if ((input.length & 1) != 0) { // implicit nullcheck of input
789 throw new InternalError("length is odd");
790 }
791 size = input.length >> 1;
792
793 int len = EXPAND_FACTOR * input.length;
794 len = (len + 1) & ~1; // ensure table is even length
795 table = new Object[len];
796
797 for (int i = 0; i < input.length; i += 2) {
798 @SuppressWarnings("unchecked")
799 K k = Objects.requireNonNull((K)input[i]);
800 @SuppressWarnings("unchecked")
801 V v = Objects.requireNonNull((V)input[i+1]);
802 int idx = probe(k);
803 if (idx >= 0) {
804 throw new IllegalArgumentException("duplicate key: " + k);
805 } else {
806 int dest = -(idx + 1);
807 table[dest] = k;
808 table[dest+1] = v;
809 }
810 }
811 }
812
813 @Override
814 public boolean containsKey(Object o) {
815 Objects.requireNonNull(o);
816 return size > 0 && probe(o) >= 0;
817 }
818
819 @Override
820 public boolean containsValue(Object o) {
821 for (int i = 1; i < table.length; i += 2) {
822 Object v = table[i];
823 if (v != null && o.equals(v)) { // implicit nullcheck of o
824 return true;
825 }
826 }
827 return false;
828 }
829
830 @Override
831 public int hashCode() {
832 int hash = 0;
833 for (int i = 0; i < table.length; i += 2) {
834 Object k = table[i];
835 if (k != null) {
836 hash += k.hashCode() ^ table[i + 1].hashCode();
837 }
838 }
839 return hash;
840 }
841
842 @Override
843 @SuppressWarnings("unchecked")
844 public V get(Object o) {
845 if (size == 0) {
846 return null;
847 }
848 int i = probe(o);
849 if (i >= 0) {
850 return (V)table[i+1];
851 } else {
852 return null;
853 }
854 }
855
856 @Override
857 public int size() {
858 return size;
859 }
860
861 @Override
862 public Set<Map.Entry<K,V>> entrySet() {
863 return new AbstractSet<Map.Entry<K,V>>() {
864 @Override
865 public int size() {
866 return MapN.this.size;
867 }
1058 * @throws InvalidObjectException if the tag value is illegal or if an exception
1059 * is thrown during creation of the collection
1060 * @throws ObjectStreamException if another serialization error has occurred
1061 * @since 9
1062 */
1063 private Object readResolve() throws ObjectStreamException {
1064 try {
1065 if (array == null) {
1066 throw new InvalidObjectException("null array");
1067 }
1068
1069 // use low order 8 bits to indicate "kind"
1070 // ignore high order 24 bits
1071 switch (tag & 0xff) {
1072 case IMM_LIST:
1073 return List.of(array);
1074 case IMM_SET:
1075 return Set.of(array);
1076 case IMM_MAP:
1077 if (array.length == 0) {
1078 return ImmutableCollections.emptyMap();
1079 } else if (array.length == 2) {
1080 return new ImmutableCollections.Map1<>(array[0], array[1]);
1081 } else {
1082 return new ImmutableCollections.MapN<>(array);
1083 }
1084 default:
1085 throw new InvalidObjectException(String.format("invalid flags 0x%x", tag));
1086 }
1087 } catch (NullPointerException|IllegalArgumentException ex) {
1088 InvalidObjectException ioe = new InvalidObjectException("invalid object");
1089 ioe.initCause(ex);
1090 throw ioe;
1091 }
1092 }
1093 }
|