1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846
|
/*
* Copyright (C) 2007-2024 Sebastiano Vigna
*
* Licensed 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 PACKAGE;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.function.Consumer;
#if ! KEYS_REFERENCE
import it.unimi.dsi.fastutil.objects.AbstractObjectSet;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
import it.unimi.dsi.fastutil.objects.ObjectSpliterator;
import it.unimi.dsi.fastutil.objects.ObjectSpliterators;
#endif
#if KEY_INDEX != VALUE_INDEX && !(KEYS_REFERENCE && VALUES_REFERENCE)
import VALUE_PACKAGE.VALUE_COLLECTION;
import VALUE_PACKAGE.VALUE_ABSTRACT_COLLECTION;
import VALUE_PACKAGE.VALUE_ARRAYS;
#endif
#if VALUES_PRIMITIVE && ! VALUES_INT_LONG_DOUBLE && KEY_INDEX != VALUE_INDEX
import VALUE_PACKAGE.METHOD_ARG_VALUE_CONSUMER;
#endif
/** A simple, brute-force implementation of a map based on two parallel backing arrays.
*
* <p>The main purpose of this
* implementation is that of wrapping cleanly the brute-force approach to the storage of a very
* small number of pairs: just put them into two parallel arrays and scan linearly to find an item.
*/
public class ARRAY_MAP KEY_VALUE_GENERIC extends ABSTRACT_MAP KEY_VALUE_GENERIC implements java.io.Serializable, Cloneable {
private static final long serialVersionUID = 1L;
/** The keys (valid up to {@link #size}, excluded). */
protected transient KEY_TYPE[] key;
/** The values (parallel to {@link #key}). */
protected transient VALUE_TYPE[] value;
/** The number of valid entries in {@link #key} and {@link #value}. */
protected int size;
/** Cached set of entries. */
protected transient FastEntrySet KEY_VALUE_GENERIC entries;
/** Cached set of keys. */
protected transient SET KEY_GENERIC keys;
/** Cached collection of values. */
protected transient VALUE_COLLECTION VALUE_GENERIC values;
/** Creates a new empty array map with given key and value backing arrays. The resulting map will have as many entries as the given arrays.
*
* <p>It is responsibility of the caller that the elements of {@code key} are distinct.
*
* @param key the key array.
* @param value the value array (it <em>must</em> have the same length as {@code key}).
*/
public ARRAY_MAP(final KEY_TYPE[] key, final VALUE_TYPE[] value) {
this.key = key;
this.value = value;
size = key.length;
if(key.length != value.length) throw new IllegalArgumentException("Keys and values have different lengths (" + key.length + ", " + value.length + ")");
}
/** Creates a new empty array map.
*/
public ARRAY_MAP() {
this.key = ARRAYS.EMPTY_ARRAY;
this.value = VALUE_ARRAYS.EMPTY_ARRAY;
}
/** Creates a new empty array map of given capacity.
*
* @param capacity the initial capacity.
*/
public ARRAY_MAP(final int capacity) {
this.key = new KEY_TYPE[capacity];
this.value = new VALUE_TYPE[capacity];
}
/** Creates a new empty array map copying the entries of a given map.
*
* @param m a map.
*/
public ARRAY_MAP(final MAP KEY_VALUE_GENERIC m) {
this(m.size());
int i = 0;
for(MAP.Entry KEY_VALUE_GENERIC e : m.ENTRYSET()) {
key[i] = e.ENTRY_GET_KEY();
value[i] = e.ENTRY_GET_VALUE();
i++;
}
size = i;
}
/** Creates a new empty array map copying the entries of a given map.
*
* @param m a map.
*/
public ARRAY_MAP(final Map<? extends KEY_GENERIC_CLASS, ? extends VALUE_GENERIC_CLASS> m) {
this(m.size());
int i = 0;
for(Map.Entry<? extends KEY_GENERIC_CLASS, ? extends VALUE_GENERIC_CLASS> e : m.entrySet()) {
key[i] = KEY_CLASS2TYPE(e.getKey());
value[i] = VALUE_CLASS2TYPE(e.getValue());
i++;
}
size = i;
}
/** Creates a new array map with given key and value backing arrays, using the given number of elements.
*
* <p>It is responsibility of the caller that the first {@code size} elements of {@code key} are distinct.
*
* @param key the key array.
* @param value the value array (it <em>must</em> have the same length as {@code key}).
* @param size the number of valid elements in {@code key} and {@code value}.
*/
public ARRAY_MAP(final KEY_TYPE[] key, final VALUE_TYPE[] value, final int size) {
this.key = key;
this.value = value;
this.size = size;
if(key.length != value.length) throw new IllegalArgumentException("Keys and values have different lengths (" + key.length + ", " + value.length + ")");
if (size > key.length) throw new IllegalArgumentException("The provided size (" + size + ") is larger than or equal to the backing-arrays size (" + key.length + ")");
}
/** The entry class for an array map does not record key and value, but
* rather the position in the array of the corresponding entry. This
* is necessary so that calls to {@link java.util.Map.Entry#setValue(Object)}
* are reflected in the map */
private final class MapEntry implements MAP.Entry KEY_VALUE_GENERIC, Map.Entry<KEY_GENERIC_CLASS, VALUE_GENERIC_CLASS>, PAIR KEY_VALUE_GENERIC {
// The array index this entry refers to, or -1 if this entry has been deleted.
int index;
MapEntry() {}
MapEntry(final int index) {
this.index = index;
}
@Override
SUPPRESS_WARNINGS_KEY_UNCHECKED
public KEY_GENERIC_TYPE ENTRY_GET_KEY() {
return KEY_GENERIC_CAST key[index];
}
@Override
SUPPRESS_WARNINGS_KEY_UNCHECKED
public KEY_GENERIC_TYPE PAIR_LEFT() {
return KEY_GENERIC_CAST key[index];
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public VALUE_GENERIC_TYPE ENTRY_GET_VALUE() {
return VALUE_GENERIC_CAST value[index];
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public VALUE_GENERIC_TYPE PAIR_RIGHT() {
return VALUE_GENERIC_CAST value[index];
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public VALUE_GENERIC_TYPE setValue(final VALUE_GENERIC_TYPE v) {
final VALUE_GENERIC_TYPE oldValue = VALUE_GENERIC_CAST value[index];
value[index] = v;
return oldValue;
}
@Override
public PAIR KEY_VALUE_GENERIC right(final VALUE_GENERIC_TYPE v) {
value[index] = v;
return this;
}
#if KEYS_PRIMITIVE
/** {@inheritDoc}
* @deprecated Please use the corresponding type-specific method instead. */
@Deprecated
@Override
public KEY_GENERIC_CLASS getKey() {
return KEY2OBJ(key[index]);
}
#endif
#if VALUES_PRIMITIVE
/** {@inheritDoc}
* @deprecated Please use the corresponding type-specific method instead. */
@Deprecated
@Override
public VALUE_GENERIC_CLASS getValue() {
return VALUE2OBJ(value[index]);
}
/** {@inheritDoc}
* @deprecated Please use the corresponding type-specific method instead. */
@Deprecated
@Override
public VALUE_GENERIC_CLASS setValue(final VALUE_GENERIC_CLASS v) {
return VALUE2OBJ(setValue(VALUE_CLASS2TYPE(v)));
}
#endif
@SuppressWarnings("unchecked")
@Override
public boolean equals(final Object o) {
if (!(o instanceof Map.Entry)) return false;
Map.Entry<KEY_GENERIC_CLASS, VALUE_GENERIC_CLASS> e = (Map.Entry<KEY_GENERIC_CLASS, VALUE_GENERIC_CLASS>)o;
return KEY_EQUALS(key[index], KEY_CLASS2TYPE(e.getKey())) && VALUE_EQUALS(value[index], VALUE_CLASS2TYPE(e.getValue()));
}
@Override
public int hashCode() {
return KEY2JAVAHASH(key[index]) ^ VALUE2JAVAHASH(value[index]);
}
@Override
public String toString() {
return key[index] + "=>" + value[index];
}
}
private final class EntrySet extends AbstractObjectSet<MAP.Entry KEY_VALUE_GENERIC> implements FastEntrySet KEY_VALUE_GENERIC {
@Override
public ObjectIterator<MAP.Entry KEY_VALUE_GENERIC> iterator() {
return new ObjectIterator<MAP.Entry KEY_VALUE_GENERIC>() {
private MapEntry entry;
int curr = -1, next = 0;
@Override
public boolean hasNext() { return next < size; }
@Override
SUPPRESS_WARNINGS_KEY_VALUE_UNCHECKED
public Entry KEY_VALUE_GENERIC next() {
if (! hasNext()) throw new NoSuchElementException();
return entry = new MapEntry(curr = next++);
}
@Override
public void remove() {
if (curr == -1) throw new IllegalStateException();
curr = -1;
final int tail = size-- - next--;
System.arraycopy(key, next + 1, key, next, tail);
System.arraycopy(value, next + 1, value, next, tail);
entry.index = -1;
#if KEYS_REFERENCE
key[size] = null;
#endif
#if VALUES_REFERENCE
value[size] = null;
#endif
}
@Override
public int skip(int n) {
if (n < 0) throw new IllegalArgumentException("Argument must be nonnegative: " + n);
n = Math.min(n, size - next);
next += n;
if (n != 0) curr = next - 1;
return n;
}
@Override
SUPPRESS_WARNINGS_KEY_VALUE_UNCHECKED
public void forEachRemaining(final Consumer<? super MAP.Entry KEY_VALUE_GENERIC> action) {
final int max = size;
while (next < max) {
entry = new MapEntry(curr = next++);
action.accept(entry);
}
}
};
}
@Override
public ObjectIterator<MAP.Entry KEY_VALUE_GENERIC> fastIterator() {
return new ObjectIterator<MAP.Entry KEY_VALUE_GENERIC>() {
private MapEntry entry = new MapEntry();
int next = 0, curr = -1;
@Override
public boolean hasNext() { return next < size; }
@Override
SUPPRESS_WARNINGS_KEY_VALUE_UNCHECKED
public Entry KEY_VALUE_GENERIC next() {
if (! hasNext()) throw new NoSuchElementException();
entry.index = curr = next++;
return entry;
}
@Override
public void remove() {
if (curr == -1) throw new IllegalStateException();
curr = -1;
final int tail = size-- - next--;
System.arraycopy(key, next + 1, key, next, tail);
System.arraycopy(value, next + 1, value, next, tail);
entry.index = -1;
#if KEYS_REFERENCE
key[size] = null;
#endif
#if VALUES_REFERENCE
value[size] = null;
#endif
}
@Override
public int skip(int n) {
if (n < 0) throw new IllegalArgumentException("Argument must be nonnegative: " + n);
n = Math.min(n, size - next);
next += n;
if (n != 0) curr = next - 1;
return n;
}
@Override
SUPPRESS_WARNINGS_KEY_VALUE_UNCHECKED
public void forEachRemaining(final Consumer<? super MAP.Entry KEY_VALUE_GENERIC> action) {
final int max = size;
while (next < max) {
entry.index = curr = next++;
action.accept(entry);
}
}
};
}
// We already have to create an Entry object for each iteration, so the overhead from having
// skeletal implementations isn't significant.
final class EntrySetSpliterator extends ObjectSpliterators.EarlyBindingSizeIndexBasedSpliterator<MAP.Entry KEY_VALUE_GENERIC>
implements ObjectSpliterator<MAP.Entry KEY_VALUE_GENERIC> {
EntrySetSpliterator(int pos, int maxPos) {
super(pos, maxPos);
}
@Override
public int characteristics() {
return ObjectSpliterators.SET_SPLITERATOR_CHARACTERISTICS | java.util.Spliterator.SUBSIZED | java.util.Spliterator.ORDERED;
}
@Override
SUPPRESS_WARNINGS_KEY_VALUE_UNCHECKED
protected final MAP.Entry KEY_VALUE_GENERIC get(int location) {
return new MapEntry(location);
}
@Override
protected final EntrySetSpliterator makeForSplit(int pos, int maxPos) {
return new EntrySetSpliterator(pos, maxPos);
}
}
@Override
public ObjectSpliterator<MAP.Entry KEY_VALUE_GENERIC> spliterator() {
return new EntrySetSpliterator(0, size);
}
/** {@inheritDoc} */
@Override
SUPPRESS_WARNINGS_KEY_VALUE_UNCHECKED
public void forEach(final Consumer<? super MAP.Entry KEY_VALUE_GENERIC> action) {
for (int i = 0, max = size; i < max; ++i) {
action.accept(new MapEntry(i));
}
}
/** {@inheritDoc} */
@Override
SUPPRESS_WARNINGS_KEY_VALUE_UNCHECKED
public void fastForEach(final Consumer<? super MAP.Entry KEY_VALUE_GENERIC> action) {
final MapEntry entry = new MapEntry();
for (int i = 0, max = size; i < max; ++i) {
entry.index = i;
action.accept(entry);
}
}
@Override
public int size() { return size; }
@Override
SUPPRESS_WARNINGS_KEY_UNCHECKED
public boolean contains(Object o) {
if (! (o instanceof Map.Entry)) return false;
final Map.Entry<?,?> e = (Map.Entry<?,?>)o;
#if KEYS_PRIMITIVE
if (e.getKey() == null || ! (e.getKey() instanceof KEY_CLASS)) return false;
#endif
#if VALUES_PRIMITIVE
if (e.getValue() == null || ! (e.getValue() instanceof VALUE_CLASS)) return false;
#endif
final KEY_GENERIC_TYPE k = KEY_OBJ2TYPE(KEY_GENERIC_CAST e.getKey());
return ARRAY_MAP.this.containsKey(k) && VALUE_EQUALS(ARRAY_MAP.this.GET_VALUE(k), VALUE_OBJ2TYPE(e.getValue()));
}
@Override
SUPPRESS_WARNINGS_KEY_VALUE_UNCHECKED
public boolean remove(final Object o) {
if (!(o instanceof Map.Entry)) return false;
final Map.Entry<?,?> e = (Map.Entry<?,?>)o;
#if KEYS_PRIMITIVE
if (e.getKey() == null || ! (e.getKey() instanceof KEY_CLASS)) return false;
#endif
#if VALUES_PRIMITIVE
if (e.getValue() == null || ! (e.getValue() instanceof VALUE_CLASS)) return false;
#endif
final KEY_GENERIC_TYPE k = KEY_OBJ2TYPE(KEY_GENERIC_CAST e.getKey());
final VALUE_GENERIC_TYPE v = VALUE_OBJ2TYPE(VALUE_GENERIC_CAST e.getValue());
final int oldPos = ARRAY_MAP.this.findKey(k);
if (oldPos == -1 || ! VALUE_EQUALS(v, ARRAY_MAP.this.value[oldPos])) return false;
final int tail = size - oldPos - 1;
System.arraycopy(ARRAY_MAP.this.key, oldPos + 1, ARRAY_MAP.this.key, oldPos, tail);
System.arraycopy(ARRAY_MAP.this.value, oldPos + 1, ARRAY_MAP.this.value, oldPos, tail);
ARRAY_MAP.this.size--;
#if KEYS_REFERENCE
ARRAY_MAP.this.key[size] = null;
#endif
#if VALUES_REFERENCE
ARRAY_MAP.this.value[size] = null;
#endif
return true;
}
}
@Override
public FastEntrySet KEY_VALUE_GENERIC ENTRYSET() {
if (entries == null) entries = new EntrySet();
return entries;
}
private int findKey(final KEY_TYPE k) {
final KEY_TYPE[] key = this.key;
for(int i = size; i-- != 0;) if (KEY_EQUALS(key[i], k)) return i;
return -1;
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public VALUE_GENERIC_TYPE GET_VALUE(final KEY_TYPE k) {
final KEY_TYPE[] key = this.key;
for(int i = size; i-- != 0;) if (KEY_EQUALS(key[i], k)) return VALUE_GENERIC_CAST value[i];
return defRetValue;
}
@Override
public int size() { return size; }
@Override
public void clear() {
#if KEYS_REFERENCE
final KEY_TYPE[] key = this.key;
#endif
#if VALUES_REFERENCE
final VALUE_TYPE[] value = this.value;
#endif
#if KEYS_REFERENCE || VALUES_REFERENCE
for(int i = size; i-- != 0;) {
#if KEYS_REFERENCE
key[i] = null;
#endif
#if VALUES_REFERENCE
value[i] = null;
#endif
}
#endif
size = 0;
}
@Override
public boolean containsKey(final KEY_TYPE k) { return findKey(k) != -1; }
@Override
public boolean containsValue(VALUE_TYPE v) {
final VALUE_TYPE[] value = this.value;
for(int i = size; i-- != 0;) if (VALUE_EQUALS(value[i], v)) return true;
return false;
}
@Override
public boolean isEmpty() { return size == 0; }
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public VALUE_GENERIC_TYPE put(KEY_GENERIC_TYPE k, VALUE_GENERIC_TYPE v) {
final int oldKey = findKey(k);
if (oldKey != -1) {
final VALUE_GENERIC_TYPE oldValue = VALUE_GENERIC_CAST value[oldKey];
value[oldKey] = v;
return oldValue;
}
if (size == key.length) {
final KEY_TYPE[] newKey = new KEY_TYPE[size == 0 ? 2 : size * 2];
final VALUE_TYPE[] newValue = new VALUE_TYPE[size == 0 ? 2 : size * 2];
for(int i = size; i-- != 0;) {
newKey[i] = key[i];
newValue[i] = value[i];
}
key = newKey;
value = newValue;
}
key[size] = k;
value[size] = v;
size++;
return defRetValue;
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public VALUE_GENERIC_TYPE REMOVE_VALUE(final KEY_TYPE k) {
final int oldPos = findKey(k);
if (oldPos == -1) return defRetValue;
final VALUE_GENERIC_TYPE oldValue = VALUE_GENERIC_CAST value[oldPos];
final int tail = size - oldPos - 1;
System.arraycopy(key, oldPos + 1, key, oldPos, tail);
System.arraycopy(value, oldPos + 1, value, oldPos, tail);
size--;
#if KEYS_REFERENCE
key[size] = null;
#endif
#if VALUES_REFERENCE
value[size] = null;
#endif
return oldValue;
}
private final class KeySet extends ABSTRACT_SET KEY_GENERIC {
@Override
public boolean contains(final KEY_TYPE k) {
return findKey(k) != -1;
}
@Override
public boolean remove(final KEY_TYPE k) {
final int oldPos = findKey(k);
if (oldPos == -1) return false;
final int tail = size - oldPos - 1;
System.arraycopy(key, oldPos + 1, key, oldPos, tail);
System.arraycopy(value, oldPos + 1, value, oldPos, tail);
size--;
#if KEYS_REFERENCE
ARRAY_MAP.this.key[size] = null;
#endif
#if VALUES_REFERENCE
ARRAY_MAP.this.value[size] = null;
#endif
return true;
}
@Override
public KEY_ITERATOR KEY_GENERIC iterator() {
return new KEY_ITERATOR KEY_GENERIC() {
int pos = 0;
@Override
public boolean hasNext() {
return pos < size;
}
@Override
SUPPRESS_WARNINGS_KEY_UNCHECKED
public KEY_GENERIC_TYPE NEXT_KEY() {
if (! hasNext()) throw new NoSuchElementException();
return KEY_GENERIC_CAST key[pos++];
}
@Override
public void remove() {
if (pos == 0) throw new IllegalStateException();
final int tail = size - pos;
System.arraycopy(key, pos, key, pos - 1, tail);
System.arraycopy(value, pos, value, pos - 1, tail);
size--;
pos--;
#if KEYS_REFERENCE
ARRAY_MAP.this.key[size] = null;
#endif
#if VALUES_REFERENCE
ARRAY_MAP.this.value[size] = null;
#endif
}
@Override
SUPPRESS_WARNINGS_KEY_UNCHECKED
public void forEachRemaining(final METHOD_ARG_KEY_CONSUMER action) {
final KEY_TYPE[] key = ARRAY_MAP.this.key;
final int max = size;
while (pos < max) {
action.accept(KEY_GENERIC_CAST key[pos++]);
}
}
// TODO either override skip or extend from AbstractIndexBasedIterator.
};
}
final class KeySetSpliterator extends SPLITERATORS.EarlyBindingSizeIndexBasedSpliterator KEY_GENERIC
implements KEY_SPLITERATOR KEY_GENERIC {
KeySetSpliterator(int pos, int maxPos) {
super(pos, maxPos);
}
@Override
public int characteristics() {
return SPLITERATORS.SET_SPLITERATOR_CHARACTERISTICS | java.util.Spliterator.SUBSIZED | java.util.Spliterator.ORDERED;
}
@Override
SUPPRESS_WARNINGS_KEY_UNCHECKED
protected final KEY_GENERIC_TYPE get(int location) { return KEY_GENERIC_CAST key[location]; }
@Override
protected final KeySetSpliterator makeForSplit(int pos, int maxPos) {
return new KeySetSpliterator(pos, maxPos);
}
@Override
SUPPRESS_WARNINGS_KEY_UNCHECKED
public void forEachRemaining(final METHOD_ARG_KEY_CONSUMER action) {
final KEY_TYPE[] key = ARRAY_MAP.this.key;
final int max = size;
while (pos < max) {
action.accept(KEY_GENERIC_CAST key[pos++]);
}
}
}
@Override
public KEY_SPLITERATOR KEY_GENERIC spliterator() {
return new KeySetSpliterator(0, size);
}
@Override
SUPPRESS_WARNINGS_KEY_UNCHECKED
public void forEach(METHOD_ARG_KEY_CONSUMER action) {
final KEY_TYPE[] key = ARRAY_MAP.this.key;
for (int i = 0, max = size; i < max; ++i) {
action.accept(KEY_GENERIC_CAST key[i]);
}
}
@Override
public int size() {
return size;
}
@Override
public void clear() {
ARRAY_MAP.this.clear();
}
}
@Override
public SET KEY_GENERIC keySet() {
if (keys == null) keys = new KeySet();
return keys;
}
private final class ValuesCollection extends VALUE_ABSTRACT_COLLECTION VALUE_GENERIC {
@Override
public boolean contains(final VALUE_TYPE v) {
return containsValue(v);
}
@Override
public VALUE_PACKAGE.VALUE_ITERATOR VALUE_GENERIC iterator() {
return new VALUE_PACKAGE.VALUE_ITERATOR VALUE_GENERIC() {
int pos = 0;
@Override
public boolean hasNext() {
return pos < size;
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public VALUE_GENERIC_TYPE NEXT_VALUE() {
if (! hasNext()) throw new NoSuchElementException();
return VALUE_GENERIC_CAST value[pos++];
}
@Override
public void remove() {
if (pos == 0) throw new IllegalStateException();
final int tail = size - pos;
System.arraycopy(key, pos, key, pos - 1, tail);
System.arraycopy(value, pos, value, pos - 1, tail);
size--;
pos--;
#if KEYS_REFERENCE
ARRAY_MAP.this.key[size] = null;
#endif
#if VALUES_REFERENCE
ARRAY_MAP.this.value[size] = null;
#endif
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public void forEachRemaining(final METHOD_ARG_VALUE_CONSUMER action) {
final VALUE_TYPE[] value = ARRAY_MAP.this.value;
final int max = size;
while (pos < max) {
action.accept(VALUE_GENERIC_CAST value[pos++]);
}
}
// TODO either override skip or extend from AbstractIndexBasedIterator.
};
}
final class ValuesSpliterator extends VALUE_PACKAGE.VALUE_SPLITERATORS.EarlyBindingSizeIndexBasedSpliterator VALUE_GENERIC
implements VALUE_PACKAGE.VALUE_SPLITERATOR VALUE_GENERIC {
ValuesSpliterator(int pos, int maxPos) {
super(pos, maxPos);
}
@Override
public int characteristics() {
return VALUE_PACKAGE.VALUE_SPLITERATORS.COLLECTION_SPLITERATOR_CHARACTERISTICS
| java.util.Spliterator.SUBSIZED | java.util.Spliterator.ORDERED;
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
protected final VALUE_GENERIC_TYPE get(int location) { return VALUE_GENERIC_CAST value[location]; }
@Override
protected final ValuesSpliterator makeForSplit(int pos, int maxPos) {
return new ValuesSpliterator(pos, maxPos);
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public void forEachRemaining(final METHOD_ARG_VALUE_CONSUMER action) {
final VALUE_TYPE[] value = ARRAY_MAP.this.value;
final int max = size;
while (pos < max) {
action.accept(VALUE_GENERIC_CAST value[pos++]);
}
}
}
@Override
public VALUE_PACKAGE.VALUE_SPLITERATOR VALUE_GENERIC spliterator() {
return new ValuesSpliterator(0, size);
}
@Override
SUPPRESS_WARNINGS_VALUE_UNCHECKED
public void forEach(METHOD_ARG_VALUE_CONSUMER action) {
final VALUE_TYPE[] value = ARRAY_MAP.this.value;
for (int i = 0, max = size; i < max; ++i) {
action.accept(VALUE_GENERIC_CAST value[i]);
}
}
@Override
public int size() {
return size;
}
@Override
public void clear() {
ARRAY_MAP.this.clear();
}
}
@Override
public VALUE_COLLECTION VALUE_GENERIC values() {
if (values == null) values = new ValuesCollection();
return values;
}
/** Returns a deep copy of this map.
*
* <p>This method performs a deep copy of this hash map; the data stored in the
* map, however, is not cloned. Note that this makes a difference only for object keys.
*
* @return a deep copy of this map.
*/
@Override
SUPPRESS_WARNINGS_KEY_VALUE_UNCHECKED
public ARRAY_MAP KEY_VALUE_GENERIC clone() {
ARRAY_MAP KEY_VALUE_GENERIC c;
try {
c = (ARRAY_MAP KEY_VALUE_GENERIC)super.clone();
}
catch(CloneNotSupportedException cantHappen) {
throw new InternalError();
}
c.key = key.clone();
c.value = value.clone();
c.entries = null;
c.keys = null;
c.values = null;
return c;
}
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException {
s.defaultWriteObject();
final KEY_TYPE[] key = this.key;
final VALUE_TYPE[] value = this.value;
for(int i = 0, max = size; i < max; i++) {
s.WRITE_KEY(key[i]);
s.WRITE_VALUE(value[i]);
}
}
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, ClassNotFoundException {
s.defaultReadObject();
final KEY_TYPE[] key = this.key = new KEY_TYPE[size];
final VALUE_TYPE[] value = this.value = new VALUE_TYPE[size];
for(int i = 0; i < size; i++) {
key[i] = s.READ_KEY();
value[i] = s.READ_VALUE();
}
}
}
|