} else if (requestType.equals(MetadataResolutionRequestTypeEnum.versionedGraph)) {
            return new MetadataGraph(getTree(), true, false);
        } else if (requestType.equals(MetadataResolutionRequestTypeEnum.scopedGraph)) {
            return new MetadataGraph(getTree(), true, true);
        }
        return null;
    }
    // ----------------------------------------------------------------------------

        decodedContext.decode(buffer, 0, buffer.length);

        // Verify decoded values
        assertArrayEquals(originalKey.getKey(), decodedContext.getLeaseKey().getKey());
        assertEquals(originalLeaseState, decodedContext.getLeaseState());
        assertEquals(originalScope, decodedContext.getCacheScope());
        assertEquals(60000L, decodedContext.getMaxCacheAge());

    @Test
    @DisplayName("Should generate random lease key with correct size")
    void testRandomLeaseKeyGeneration() {
        Smb2LeaseKey key = new Smb2LeaseKey();

        assertNotNull(key.getKey());
        assertEquals(16, key.getKey().length);
        assertFalse(key.isZero());
    }

    @Test
    @DisplayName("Should create lease key from byte array")
    void testLeaseKeyFromBytes() {

    RangeMapEntry(Range<K> range, V value) {
      super(range, value);
    }

    boolean contains(K value) {
      return getKey().contains(value);
    }

    Cut<K> getLowerBound() {
      return getKey().lowerBound;
    }

    Cut<K> getUpperBound() {
      return getKey().upperBound;
    }
  }

  @Override
  public @Nullable V get(K key) {
    Entry<Range<K>, V> entry = getEntry(key);

    for (ListIterator<Entry<K, V>> i = expected.listIterator(); i.hasNext(); ) {
      if (Helpers.equal(i.next().getKey(), newEntry.getKey())) {
        i.set(newEntry);
        return;
      }
    }

    throw new IllegalArgumentException(
        Platform.format("key %s not found in entries %s", newEntry.getKey(), expected));
  }

  /**

      assertFalse(
          "Inverse should not contain entry " + reversed, inv.entrySet().contains(reversed));
      assertFalse(
          "Inverse should not contain key " + reversed.getKey(),
          inv.containsKey(reversed.getKey()));
      assertFalse(
          "Inverse should not contain value " + reversed.getValue(),
          inv.containsValue(reversed.getValue()));
      /*

            // Then
            long expectedFree = free * sectPerAlloc * bytesPerSect;
            assertEquals(expectedFree, fileFsSizeInfo.getFree());
            assertEquals(2097152L, fileFsSizeInfo.getFree()); // 512 * 8 * 512
        }

        @Test
        @DisplayName("Should handle overflow in capacity calculation")

            // Then
            long expectedFree = callerFree * sectPerAlloc * bytesPerSect;
            assertEquals(expectedFree, fileFsFullSizeInfo.getFree());
            assertEquals(2097152L, fileFsFullSizeInfo.getFree()); // 512 * 8 * 512
        }

        @Test
        @DisplayName("Should handle overflow in capacity calculation")

        // don't let the new entry get GCed
        warmed.add(entryOf(entry.getKey(), newValue));
        Object newKey = new Object();
        assertNull(cache.asMap().put(newKey, entry.getValue()));
        // this getUnchecked() call shouldn't be a cache miss; verified below
        assertEquals(newValue, cache.getUnchecked(entry.getKey()));

        assertTrue(result);
        assertEquals(1, chain.changePasswordCalls.size());
        assertEquals("testuser", chain.changePasswordCalls.get(0).getKey());
        assertEquals("newpassword123", chain.changePasswordCalls.get(0).getValue());
    }

    // Test changePassword with failure
    public void test_changePassword_failure() {