if (obj instanceof Smb2LeaseKey) {
            return Arrays.equals(key, ((Smb2LeaseKey)obj).key);
        }
        return false;
    }
    
    @Override
    public int hashCode() {
        return Arrays.hashCode(key);
    }
}
```

### 4.2 Lease Context Structure
```java
package jcifs.internal.smb2.lease;

import jcifs.internal.smb2.create.Smb2CreateContext;

        public void clear() {
            parent.clear();
        }

        public boolean equals(final Object o) {
            return parent.equals(o);
        }

        public int hashCode() {
            return parent.hashCode();
        }

        public E get(final int index) {
            return parent.get(index);
        }

        public E set(final int index, final E element) {

      LocalCache<Object, Object> map = makeLocalCache(builder);

      Object keyOne = new Object();
      Object valueOne = new Object();
      int hashOne = map.hash(keyOne);
      ReferenceEntry<Object, Object> entryOne = map.newEntry(keyOne, hashOne, null);
      ValueReference<Object, Object> valueRefOne = map.newValueReference(entryOne, valueOne, 1);
      assertThat(valueRefOne.get()).isSameInstanceAs(valueOne);

      LocalCache<Object, Object> map = makeLocalCache(builder);

      Object keyOne = new Object();
      Object valueOne = new Object();
      int hashOne = map.hash(keyOne);
      ReferenceEntry<Object, Object> entryOne = map.newEntry(keyOne, hashOne, null);
      ValueReference<Object, Object> valueRefOne = map.newValueReference(entryOne, valueOne, 1);
      assertThat(valueRefOne.get()).isSameInstanceAs(valueOne);

     *
     * @return True if the item has been deleted.
     */
    public boolean isDeleted() {
        return isUpdated() && newToken.length() == 0;
    }

    @Override
    public int hashCode() {
        return Objects.hash(pos, reading, segmentation, token);
    }

    @Override
    public boolean equals(final Object obj) {
        if (this == obj) {
            return true;
        }

                        && Objects.equals(type, that.type)
                        && Objects.equals(coordinatesString, that.coordinatesString);
            }

            @Override
            public int hashCode() {
                return Objects.hash(groupId, artifactId, version, classifier, extension, type, coordinatesString);
            }

            @Override
            public String toString() {

                        && Objects.equals(repositories, that.repositories)
                        && nature == that.nature;
            }

            @Override
            public int hashCode() {
                return Objects.hash(artifactCoordinates, repositories, nature);
            }

            @Override
            public String toString() {

    } else {
      return false;
    }
  }

  @Override
  public int hashCode() {
    // racy single-check idiom
    int h = hashCode;
    if (h == 0) {
      h = hash(type, subtype, parametersAsMap());
      hashCode = h;
    }
    return h;
  }

  private static final MapJoiner PARAMETER_JOINER = Joiner.on("; ").withKeyValueSeparator("=");

  private static final int MAX_HASH_BUCKET_LENGTH = 9;

  // The way the `table`, `entries`, `keys`, and `values` arrays work together is as follows.
  //
  // The `table` array always has a size that is a power of 2. The hashcode of a key in the map
  // is masked in order to correspond to the current table size. For example, if the table size
  // is 128 then the mask is 127 == 0x7f, keeping the bottom 7 bits of the hash value.

            assertTrue(testBlock.isResponse());
        }

        @Test
        @DisplayName("Test hashCode method")
        void testHashCode() {
            testBlock.setMid(0x1234);
            assertEquals(0x1234, testBlock.hashCode());
        }

        @Test
        @DisplayName("Test equals method")
        void testEquals() {
            testBlock.setMid(0x1234);