How to use hashCode method of org.assertj.core.test.jdk11.ImmutableCollections class

Best Assertj code snippet using org.assertj.core.test.jdk11.ImmutableCollections.hashCode

Source:ImmutableCollections.java Github

copy

Full Screen

...204 }205 return -1;206 }207 @Override208 public int hashCode() {209 int hash = 1;210 for (int i = 0, s = size(); i < s; i++) {211 hash = 31 * hash + get(i).hashCode();212 }213 return hash;214 }215 @Override216 public boolean contains(Object o) {217 return indexOf(o) >= 0;218 }219 IndexOutOfBoundsException outOfBounds(int index) {220 return new IndexOutOfBoundsException("Index: " + index + " Size: " + size());221 }222 }223 static final class ListItr<E> implements ListIterator<E> {224 private final List<E> list;225 private final int size;226 private final boolean isListIterator;227 private int cursor;228 ListItr(List<E> list, int size) {229 this.list = list;230 this.size = size;231 this.cursor = 0;232 isListIterator = false;233 }234 ListItr(List<E> list, int size, int index) {235 this.list = list;236 this.size = size;237 this.cursor = index;238 isListIterator = true;239 }240 public boolean hasNext() {241 return cursor != size;242 }243 public E next() {244 try {245 int i = cursor;246 E next = list.get(i);247 cursor = i + 1;248 return next;249 } catch (IndexOutOfBoundsException e) {250 throw new NoSuchElementException();251 }252 }253 public void remove() {254 throw uoe();255 }256 public boolean hasPrevious() {257 if (!isListIterator) {258 throw uoe();259 }260 return cursor != 0;261 }262 public E previous() {263 if (!isListIterator) {264 throw uoe();265 }266 try {267 int i = cursor - 1;268 E previous = list.get(i);269 cursor = i;270 return previous;271 } catch (IndexOutOfBoundsException e) {272 throw new NoSuchElementException();273 }274 }275 public int nextIndex() {276 if (!isListIterator) {277 throw uoe();278 }279 return cursor;280 }281 public int previousIndex() {282 if (!isListIterator) {283 throw uoe();284 }285 return cursor - 1;286 }287 public void set(E e) {288 throw uoe();289 }290 public void add(E e) {291 throw uoe();292 }293 }294 static final class SubList<E> extends AbstractImmutableList<E>295 implements RandomAccess {296 private final List<E> root;297 private final int offset;298 private final int size;299 private SubList(List<E> root, int offset, int size) {300 this.root = root;301 this.offset = offset;302 this.size = size;303 }304 /**305 * Constructs a sublist of another SubList.306 */307 static <E> SubList<E> fromSubList(SubList<E> parent, int fromIndex, int toIndex) {308 return new SubList<>(parent.root, parent.offset + fromIndex, toIndex - fromIndex);309 }310 /**311 * Constructs a sublist of an arbitrary AbstractImmutableList, which is312 * not a SubList itself.313 */314 static <E> SubList<E> fromList(List<E> list, int fromIndex, int toIndex) {315 return new SubList<>(list, fromIndex, toIndex - fromIndex);316 }317 public E get(int index) {318 // Replacement for Objects.checkIndex(index, size);319 if (index < 0 || index >= size) {320 throw new IndexOutOfBoundsException(String.format("Index %s out of bounds for length %s", index, size));321 }322 return root.get(offset + index);323 }324 public int size() {325 return size;326 }327 public Iterator<E> iterator() {328 return new ListItr<>(this, size());329 }330 public ListIterator<E> listIterator(int index) {331 rangeCheck(index);332 return new ListItr<>(this, size(), index);333 }334 public List<E> subList(int fromIndex, int toIndex) {335 subListRangeCheck(fromIndex, toIndex, size);336 return SubList.fromSubList(this, fromIndex, toIndex);337 }338 private void rangeCheck(int index) {339 if (index < 0 || index > size) {340 throw outOfBounds(index);341 }342 }343 }344 static final class List12<E> extends AbstractImmutableList<E>345 implements Serializable {346 private final E e0;347 private final E e1;348 List12(E e0) {349 this.e0 = Objects.requireNonNull(e0);350 this.e1 = null;351 }352 List12(E e0, E e1) {353 this.e0 = Objects.requireNonNull(e0);354 this.e1 = Objects.requireNonNull(e1);355 }356 @Override357 public int size() {358 return e1 != null ? 2 : 1;359 }360 @Override361 public E get(int index) {362 if (index == 0) {363 return e0;364 } else if (index == 1 && e1 != null) {365 return e1;366 }367 throw outOfBounds(index);368 }369 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {370 throw new InvalidObjectException("not serial proxy");371 }372 private Object writeReplace() {373 if (e1 == null) {374 return new CollSer(CollSer.IMM_LIST, e0);375 } else {376 return new CollSer(CollSer.IMM_LIST, e0, e1);377 }378 }379 }380 static final class ListN<E> extends AbstractImmutableList<E>381 implements Serializable {382 // EMPTY_LIST may be initialized from the CDS archive.383 static List<?> EMPTY_LIST;384 static {385 // VM.initializeFromArchive(ListN.class);386 if (EMPTY_LIST == null) {387 EMPTY_LIST = new ListN<>();388 }389 }390 private final E[] elements;391 @SafeVarargs392 ListN(E... input) {393 // copy and check manually to avoid TOCTOU394 @SuppressWarnings("unchecked")395 E[] tmp = (E[]) new Object[input.length]; // implicit nullcheck of input396 for (int i = 0; i < input.length; i++) {397 tmp[i] = Objects.requireNonNull(input[i]);398 }399 elements = tmp;400 }401 @Override402 public boolean isEmpty() {403 return size() == 0;404 }405 @Override406 public int size() {407 return elements.length;408 }409 @Override410 public E get(int index) {411 return elements[index];412 }413 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {414 throw new InvalidObjectException("not serial proxy");415 }416 private Object writeReplace() {417 return new CollSer(CollSer.IMM_LIST, elements);418 }419 }420 // ---------- Set Implementations ----------421 static abstract class AbstractImmutableSet<E> extends AbstractImmutableCollection<E>422 implements Set<E> {423 @Override424 public boolean equals(Object o) {425 if (o == this) {426 return true;427 } else if (!(o instanceof Set)) {428 return false;429 }430 Collection<?> c = (Collection<?>) o;431 if (c.size() != size()) {432 return false;433 }434 for (Object e : c) {435 if (e == null || !contains(e)) {436 return false;437 }438 }439 return true;440 }441 @Override442 public abstract int hashCode();443 }444 @SuppressWarnings("unchecked")445 static <E> Set<E> emptySet() {446 return (Set<E>) SetN.EMPTY_SET;447 }448 static final class Set12<E> extends AbstractImmutableSet<E>449 implements Serializable {450 final E e0;451 final E e1;452 Set12(E e0) {453 this.e0 = Objects.requireNonNull(e0);454 this.e1 = null;455 }456 Set12(E e0, E e1) {457 if (e0.equals(Objects.requireNonNull(e1))) { // implicit nullcheck of e0458 throw new IllegalArgumentException("duplicate element: " + e0);459 }460 this.e0 = e0;461 this.e1 = e1;462 }463 @Override464 public int size() {465 return (e1 == null) ? 1 : 2;466 }467 @Override468 public boolean contains(Object o) {469 return o.equals(e0) || o.equals(e1); // implicit nullcheck of o470 }471 @Override472 public int hashCode() {473 return e0.hashCode() + (e1 == null ? 0 : e1.hashCode());474 }475 @Override476 public Iterator<E> iterator() {477 return new Iterator<E>() {478 private int idx = size();479 @Override480 public boolean hasNext() {481 return idx > 0;482 }483 @Override484 public E next() {485 if (idx == 1) {486 idx = 0;487 return SALT >= 0 || e1 == null ? e0 : e1;488 } else if (idx == 2) {489 idx = 1;490 return SALT >= 0 ? e1 : e0;491 } else {492 throw new NoSuchElementException();493 }494 }495 };496 }497 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {498 throw new InvalidObjectException("not serial proxy");499 }500 private Object writeReplace() {501 if (e1 == null) {502 return new CollSer(CollSer.IMM_SET, e0);503 } else {504 return new CollSer(CollSer.IMM_SET, e0, e1);505 }506 }507 }508 /**509 * An array-based Set implementation. The element array must be strictly510 * larger than the size (the number of contained elements) so that at511 * least one null is always present.512 * @param <E> the element type513 */514 static final class SetN<E> extends AbstractImmutableSet<E>515 implements Serializable {516 // EMPTY_SET may be initialized from the CDS archive.517 static Set<?> EMPTY_SET;518 static {519 // VM.initializeFromArchive(SetN.class);520 if (EMPTY_SET == null) {521 EMPTY_SET = new SetN<>();522 }523 }524 final E[] elements;525 final int size;526 @SafeVarargs527 @SuppressWarnings("unchecked")528 SetN(E... input) {529 size = input.length; // implicit nullcheck of input530 elements = (E[]) new Object[EXPAND_FACTOR * input.length];531 for (int i = 0; i < input.length; i++) {532 E e = input[i];533 int idx = probe(e); // implicit nullcheck of e534 if (idx >= 0) {535 throw new IllegalArgumentException("duplicate element: " + e);536 } else {537 elements[-(idx + 1)] = e;538 }539 }540 }541 @Override542 public int size() {543 return size;544 }545 @Override546 public boolean contains(Object o) {547 Objects.requireNonNull(o);548 return size > 0 && probe(o) >= 0;549 }550 private final class SetNIterator implements Iterator<E> {551 private int remaining;552 private int idx;553 SetNIterator() {554 remaining = size();555 if (remaining > 0) {556 idx = Math.floorMod(SALT, elements.length);557 }558 }559 @Override560 public boolean hasNext() {561 return remaining > 0;562 }563 private int nextIndex() {564 int idx = this.idx;565 if (SALT >= 0) {566 if (++idx >= elements.length) {567 idx = 0;568 }569 } else {570 if (--idx < 0) {571 idx = elements.length - 1;572 }573 }574 return this.idx = idx;575 }576 @Override577 public E next() {578 if (hasNext()) {579 E element;580 // skip null elements581 while ((element = elements[nextIndex()]) == null) {}582 remaining--;583 return element;584 } else {585 throw new NoSuchElementException();586 }587 }588 }589 @Override590 public Iterator<E> iterator() {591 return new SetN<E>.SetNIterator();592 }593 @Override594 public int hashCode() {595 int h = 0;596 for (E e : elements) {597 if (e != null) {598 h += e.hashCode();599 }600 }601 return h;602 }603 // returns index at which element is present; or if absent,604 // (-i - 1) where i is location where element should be inserted.605 // Callers are relying on this method to perform an implicit nullcheck606 // of pe607 private int probe(Object pe) {608 int idx = Math.floorMod(pe.hashCode(), elements.length);609 while (true) {610 E ee = elements[idx];611 if (ee == null) {612 return -idx - 1;613 } else if (pe.equals(ee)) {614 return idx;615 } else if (++idx == elements.length) {616 idx = 0;617 }618 }619 }620 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {621 throw new InvalidObjectException("not serial proxy");622 }623 private Object writeReplace() {624 Object[] array = new Object[size];625 int dest = 0;626 for (Object o : elements) {627 if (o != null) {628 array[dest++] = o;629 }630 }631 return new CollSer(CollSer.IMM_SET, array);632 }633 }634 // ---------- Map Implementations ----------635 @SuppressWarnings("unchecked")636 static <K, V> Map<K, V> emptyMap() {637 return (Map<K, V>) MapN.EMPTY_MAP;638 }639 abstract static class AbstractImmutableMap<K, V> extends AbstractMap<K, V> implements Serializable {640 @Override641 public void clear() {642 throw uoe();643 }644 @Override645 public V compute(K key, BiFunction<? super K, ? super V, ? extends V> rf) {646 throw uoe();647 }648 @Override649 public V computeIfAbsent(K key, Function<? super K, ? extends V> mf) {650 throw uoe();651 }652 @Override653 public V computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> rf) {654 throw uoe();655 }656 @Override657 public V merge(K key, V value, BiFunction<? super V, ? super V, ? extends V> rf) {658 throw uoe();659 }660 @Override661 public V put(K key, V value) {662 throw uoe();663 }664 @Override665 public void putAll(Map<? extends K, ? extends V> m) {666 throw uoe();667 }668 @Override669 public V putIfAbsent(K key, V value) {670 throw uoe();671 }672 @Override673 public V remove(Object key) {674 throw uoe();675 }676 @Override677 public boolean remove(Object key, Object value) {678 throw uoe();679 }680 @Override681 public V replace(K key, V value) {682 throw uoe();683 }684 @Override685 public boolean replace(K key, V oldValue, V newValue) {686 throw uoe();687 }688 @Override689 public void replaceAll(BiFunction<? super K, ? super V, ? extends V> f) {690 throw uoe();691 }692 }693 static final class Map1<K, V> extends AbstractImmutableMap<K, V> {694 private final K k0;695 private final V v0;696 Map1(K k0, V v0) {697 this.k0 = Objects.requireNonNull(k0);698 this.v0 = Objects.requireNonNull(v0);699 }700 @Override701 public Set<Map.Entry<K, V>> entrySet() {702 return Jdk11.Set.of(new KeyValueHolder<>(k0, v0));703 }704 @Override705 public V get(Object o) {706 return o.equals(k0) ? v0 : null; // implicit nullcheck of o707 }708 @Override709 public boolean containsKey(Object o) {710 return o.equals(k0); // implicit nullcheck of o711 }712 @Override713 public boolean containsValue(Object o) {714 return o.equals(v0); // implicit nullcheck of o715 }716 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {717 throw new InvalidObjectException("not serial proxy");718 }719 private Object writeReplace() {720 return new CollSer(CollSer.IMM_MAP, k0, v0);721 }722 @Override723 public int hashCode() {724 return k0.hashCode() ^ v0.hashCode();725 }726 }727 /**728 * An array-based Map implementation. There is a single array "table" that729 * contains keys and values interleaved: table[0] is kA, table[1] is vA,730 * table[2] is kB, table[3] is vB, etc. The table size must be even. It must731 * also be strictly larger than the size (the number of key-value pairs contained732 * in the map) so that at least one null key is always present.733 * @param <K> the key type734 * @param <V> the value type735 */736 static final class MapN<K, V> extends AbstractImmutableMap<K, V> {737 // EMPTY_MAP may be initialized from the CDS archive.738 static Map<?, ?> EMPTY_MAP;739 static {740 // VM.initializeFromArchive(MapN.class);741 EMPTY_MAP = new MapN<>();742 }743 final Object[] table; // pairs of key, value744 final int size; // number of pairs745 MapN(Object... input) {746 if ((input.length & 1) != 0) { // implicit nullcheck of input747 throw new InternalError("length is odd");748 }749 size = input.length >> 1;750 int len = EXPAND_FACTOR * input.length;751 len = (len + 1) & ~1; // ensure table is even length752 table = new Object[len];753 for (int i = 0; i < input.length; i += 2) {754 @SuppressWarnings("unchecked")755 K k = Objects.requireNonNull((K) input[i]);756 @SuppressWarnings("unchecked")757 V v = Objects.requireNonNull((V) input[i + 1]);758 int idx = probe(k);759 if (idx >= 0) {760 throw new IllegalArgumentException("duplicate key: " + k);761 } else {762 int dest = -(idx + 1);763 table[dest] = k;764 table[dest + 1] = v;765 }766 }767 }768 @Override769 public boolean containsKey(Object o) {770 Objects.requireNonNull(o);771 return size > 0 && probe(o) >= 0;772 }773 @Override774 public boolean containsValue(Object o) {775 Objects.requireNonNull(o);776 for (int i = 1; i < table.length; i += 2) {777 Object v = table[i];778 if (v != null && o.equals(v)) {779 return true;780 }781 }782 return false;783 }784 @Override785 public int hashCode() {786 int hash = 0;787 for (int i = 0; i < table.length; i += 2) {788 Object k = table[i];789 if (k != null) {790 hash += k.hashCode() ^ table[i + 1].hashCode();791 }792 }793 return hash;794 }795 @Override796 @SuppressWarnings("unchecked")797 public V get(Object o) {798 if (size == 0) {799 Objects.requireNonNull(o);800 return null;801 }802 int i = probe(o);803 if (i >= 0) {804 return (V) table[i + 1];805 } else {806 return null;807 }808 }809 @Override810 public int size() {811 return size;812 }813 class MapNIterator implements Iterator<Map.Entry<K, V>> {814 private int remaining;815 private int idx;816 MapNIterator() {817 remaining = size();818 if (remaining > 0) {819 idx = Math.floorMod(SALT, table.length >> 1) << 1;820 }821 }822 @Override823 public boolean hasNext() {824 return remaining > 0;825 }826 private int nextIndex() {827 int idx = this.idx;828 if (SALT >= 0) {829 if ((idx += 2) >= table.length) {830 idx = 0;831 }832 } else {833 if ((idx -= 2) < 0) {834 idx = table.length - 2;835 }836 }837 return this.idx = idx;838 }839 @Override840 public Map.Entry<K, V> next() {841 if (hasNext()) {842 while (table[nextIndex()] == null) {}843 @SuppressWarnings("unchecked")844 Map.Entry<K, V> e = new KeyValueHolder<>((K) table[idx], (V) table[idx + 1]);845 remaining--;846 return e;847 } else {848 throw new NoSuchElementException();849 }850 }851 }852 @Override853 public Set<Map.Entry<K, V>> entrySet() {854 return new AbstractSet<Map.Entry<K, V>>() {855 @Override856 public int size() {857 return MapN.this.size;858 }859 @Override860 public Iterator<Map.Entry<K, V>> iterator() {861 return new MapNIterator();862 }863 };864 }865 // returns index at which the probe key is present; or if absent,866 // (-i - 1) where i is location where element should be inserted.867 // Callers are relying on this method to perform an implicit nullcheck868 // of pk.869 private int probe(Object pk) {870 int idx = Math.floorMod(pk.hashCode(), table.length >> 1) << 1;871 while (true) {872 @SuppressWarnings("unchecked")873 K ek = (K) table[idx];874 if (ek == null) {875 return -idx - 1;876 } else if (pk.equals(ek)) {877 return idx;878 } else if ((idx += 2) == table.length) {879 idx = 0;880 }881 }882 }883 private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {884 throw new InvalidObjectException("not serial proxy");...

Full Screen

Full Screen

hashCode

Using AI Code Generation

copy

Full Screen

1import org.assertj.core.test.jdk11.ImmutableCollections;2import org.assertj.core.api.Assertions;3import java.util.List;4import java.util.Map;5import java.util.Set;6public class ImmutableCollectionsTest {7 public static void main(String[] args) {8 List<String> list = ImmutableCollections.listOf("one", "two", "three");9 Set<String> set = ImmutableCollections.setOf("one", "two", "three");10 Map<String, String> map = ImmutableCollections.mapOf("one", "1", "two", "2", "three", "3");11 Assertions.assertThat(list.hashCode()).isEqualTo(set.hashCode());12 Assertions.assertThat(list.hashCode()).isEqualTo(map.keySet().hashCode());13 Assertions.assertThat(set.hashCode()).isEqualTo(map.keySet().hashCode());14 }15}16 at org.assertj.core.api.AbstractAssert.isEqualTo(AbstractAssert.java:85)17 at org.assertj.core.api.Assertions$AbstractObjectAssert.isEqualTo(Assertions.java:1033)18 at org.assertj.core.api.Assertions.assertThat(Assertions.java:1094)19 at org.assertj.core.api.Assertions.assertThat(Assertions.java:1050)20 at org.assertj.core.test.jdk11.ImmutableCollectionsTest.main(ImmutableCollectionsTest.java:19)21assertThat(list.hashCode()).isEqualTo(set.hashCode());22assertThat(list.hashCode()).isEqualTo(map.keySet().hashCode());23assertThat(set.hashCode()).isEqualTo(map.keySet().hashCode());24import org.assertj.core.test.jdk11.ImmutableCollections;25import org.assertj.core.api.Assertions;26import java.util.List;27import java.util.Map;28import java.util.Set;29public class ImmutableCollectionsTest {30 public static void main(String[] args) {31 List<String> list = ImmutableCollections.listOf("one", "two", "three");32 Set<String> set = ImmutableCollections.setOf("one", "two", "three");33 Map<String, String> map = ImmutableCollections.mapOf("one", "1", "two", "2", "three", "3");34 System.out.println("list.hashCode() = " + list.hashCode());35 System.out.println("set.hashCode() = " + set.hashCode());36 System.out.println("map.keySet().hashCode() = " + map.keySet().hashCode());37 Assertions.assertThat(list.hashCode()).isEqualTo(set.hashCode

Full Screen

Full Screen

hashCode

Using AI Code Generation

copy

Full Screen

1import org.assertj.core.test.jdk11.ImmutableCollections;2assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));3import org.assertj.core.test.jdk11.ImmutableCollections;4assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));5import org.assertj.core.test.jdk11.ImmutableCollections;6assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));7import org.assertj.core.test.jdk11.ImmutableCollections;8assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));9import org.assertj.core.test.jdk11.ImmutableCollections;10assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));11import org.assertj.core.test.jdk11.ImmutableCollections;12assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));13import org.assertj.core.test.jdk11.ImmutableCollections;14assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));15import org.assertj.core.test.jdk11.ImmutableCollections;16assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));17import org.assertj.core.test.jdk11.ImmutableCollections;18assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));19import org.assertj.core.test.jdk11.ImmutableCollections;20assertThat(ImmutableCollections.of("foo")).hasSameHashCodeAs(ImmutableCollections.of("foo"));21import org.assertj.core.test.jdk11

Full Screen

Full Screen

hashCode

Using AI Code Generation

copy

Full Screen

1 public void should_use_hashCode_of_java_9_immutable_collections() {2 List<Integer> list = ImmutableCollections.listOf(1, 2, 3);3 Map<Integer, String> map = ImmutableCollections.mapOf(1, "1", 2, "2", 3, "3");4 assertThat(list).hasSameHashCodeAs(ImmutableCollections.listOf(1, 2, 3));5 assertThat(map).hasSameHashCodeAs(ImmutableCollections.mapOf(1, "1", 2, "2", 3, "3"));6 }7 public void should_use_hashCode_of_java_9_immutable_collections() {8 List<Integer> list = ImmutableCollections.listOf(1, 2, 3);9 Map<Integer, String> map = ImmutableCollections.mapOf(1, "1", 2, "2", 3, "3");10 assertThat(list).hasSameHashCodeAs(ImmutableCollections.listOf(1, 2, 3));11 assertThat(map).hasSameHashCodeAs(ImmutableCollections.mapOf(1, "1", 2, "2", 3, "3"));12 }13 public void should_use_hashCode_of_java_9_immutable_collections() {14 List<Integer> list = ImmutableCollections.listOf(1, 2, 3);15 Map<Integer, String> map = ImmutableCollections.mapOf(1, "1", 2, "2", 3, "3");16 assertThat(list).hasSameHashCodeAs(ImmutableCollections.listOf(1, 2, 3));17 assertThat(map).hasSameHashCodeAs(ImmutableCollections.mapOf(1, "1", 2, "2", 3, "3"));18 }19 public void should_use_hashCode_of_java_9_immutable_collections() {20 List<Integer> list = ImmutableCollections.listOf(1, 2, 3);

Full Screen

Full Screen

hashCode

Using AI Code Generation

copy

Full Screen

1public class ImmutableCollectionsHashCodeTest {2 void should_return_same_hashCode_for_equal_instances() {3 ImmutableCollections immutableCollections1 = new ImmutableCollections("a", "b");4 ImmutableCollections immutableCollections2 = new ImmutableCollections("a", "b");5 assertThat(immutableCollections1.hashCode()).isEqualTo(immutableCollections2.hashCode());6 }7 void should_return_different_hashCode_for_different_instances() {8 ImmutableCollections immutableCollections1 = new ImmutableCollections("a", "b");9 ImmutableCollections immutableCollections2 = new ImmutableCollections("a", "c");10 assertThat(immutableCollections1.hashCode()).isNotEqualTo(immutableCollections2.hashCode());11 }12}13public class ImmutableCollections {14 private final List<String> list;15 private final Set<String> set;16 public ImmutableCollections(String... values) {17 this.list = List.of(values);18 this.set = Set.of(values);19 }20 public List<String> getList() {21 return list;22 }23 public Set<String> getSet() {24 return set;25 }26 public boolean equals(Object o) {27 if (this == o) return true;28 if (o == null || getClass() != o.getClass()) return false;29 ImmutableCollections that = (ImmutableCollections) o;30 return Objects.equals(list, that.list) &&31 Objects.equals(set, that.set);32 }33 public int hashCode() {34 return 0;35 }36}

Full Screen

Full Screen

hashCode

Using AI Code Generation

copy

Full Screen

1import static org.assertj.core.api.Assertions.assertThat;2import static org.assertj.core.test.jdk11.ImmutableCollections.*;3public class ImmutableCollectionsTest {4 public void should_use_hashCode_of_immutable_collections() {5 assertThat(emptyList()).hasSameHashCodeAs(emptyList());6 assertThat(emptyList()).hasSameHashCodeAs(emptySet());7 assertThat(emptyList()).hasSameHashCodeAs(emptyMap().keySet());8 assertThat(emptyList()).hasSameHashCodeAs(emptyMap().values());9 assertThat(emptyList()).hasSameHashCodeAs(emptyMap().entrySet());10 assertThat(emptySet()).hasSameHashCodeAs(emptyList());11 assertThat(emptySet()).hasSameHashCodeAs(emptySet());12 assertThat(emptySet()).hasSameHashCodeAs(emptyMap().keySet());13 assertThat(emptySet()).hasSameHashCodeAs(emptyMap().values());14 assertThat(emptySet()).hasSameHashCodeAs(emptyMap().entrySet());15 assertThat(emptyMap().keySet()).hasSameHashCodeAs(emptyList());16 assertThat(emptyMap().keySet()).hasSameHashCodeAs(emptySet());17 assertThat(emptyMap().keySet()).hasSameHashCodeAs(emptyMap().keySet());18 assertThat(emptyMap().keySet()).hasSameHashCodeAs(emptyMap().values());19 assertThat(emptyMap().keySet()).hasSameHashCodeAs(emptyMap().entrySet());20 assertThat(emptyMap().values()).hasSameHashCodeAs(emptyList());21 assertThat(emptyMap().values()).hasSameHashCodeAs(emptySet());22 assertThat(emptyMap().values()).hasSameHashCodeAs(emptyMap().keySet());23 assertThat(emptyMap().values()).hasSameHashCodeAs(emptyMap().values());24 assertThat(emptyMap().values()).hasSameHashCodeAs(emptyMap().entrySet());25 assertThat(emptyMap().entrySet()).hasSameHashCodeAs(emptyList());26 assertThat(emptyMap().entrySet()).hasSameHashCodeAs(emptySet());27 assertThat(emptyMap().entrySet()).hasSameHashCodeAs(emptyMap().keySet());28 assertThat(emptyMap().entrySet()).hasSameHashCodeAs(emptyMap().values());29 assertThat(emptyMap().entrySet()).hasSameHashCodeAs(emptyMap().entrySet());30 }31}

Full Screen

Full Screen

hashCode

Using AI Code Generation

copy

Full Screen

1 [junit] java.lang.RuntimeException: java.lang.IllegalAccessError: class org.assertj.core.test.jdk11.ImmutableCollections (in unnamed module @0x6b6e0a6) cannot access class java.util.Collections (in module java.base) because module java.base does not export java.util to unnamed module @0x6b6e0a62 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:1013)3 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:99)4 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:82)5 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:68)6 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:64)7 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:60)8 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:56)9 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:52)10 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:48)11 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:44)12 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:40)13 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:36)14 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:32)15 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:28)16 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:24)17 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:20)18 [junit] at org.assertj.core.api.Assertions.assertThat(Assertions.java:16)19 [junit] at org.assertj.core.test.EqualsHashCodeContractAssert.hasValidEqualsAndHashCodeContract(EqualsHashCodeContractAssert.java:59)20 [junit] at org.assertj.core.test.EqualsHashCodeContractAssert.hasValidEqualsAndHashCodeContract(EqualsHashCodeContractAssert.java:54)

Full Screen

Full Screen

Automation Testing Tutorials

Learn to execute automation testing from scratch with LambdaTest Learning Hub. Right from setting up the prerequisites to run your first automation test, to following best practices and diving deeper into advanced test scenarios. LambdaTest Learning Hubs compile a list of step-by-step guides to help you be proficient with different test automation frameworks i.e. Selenium, Cypress, TestNG etc.

LambdaTest Learning Hubs:

YouTube

You could also refer to video tutorials over LambdaTest YouTube channel to get step by step demonstration from industry experts.

Run Assertj automation tests on LambdaTest cloud grid

Perform automation testing on 3000+ real desktop and mobile devices online.

... View sample repo... View DocumentationSign up Free
›
_

Most used method in ImmutableCollections

Try LambdaTest Now !!

Get 100 minutes of automation test minutes FREE!!

...
Sign up with GoogleSign up with Email
Next-Gen App & Browser Testing Cloud

Was this article helpful?

Helpful

NotHelpful