</difference>
						<difference>
							<className>jcifs/Configuration</className>
							<differenceType>7012</differenceType>
							<method>boolean isSendNTLMTargetName()</method>
						</difference>

						<difference>
							<className>jcifs/Configuration</className>
							<differenceType>7012</differenceType>
							<method>boolean isAllowGuestFallback()</method>
						</difference>
						<difference>

        ImmutableMap.of(Range.closedOpen(5, 7), 1, Range.closed(7, 10), 2), sub.asMapOfRanges());
    assertEquals(
        ImmutableMap.of(Range.open(3, 7), 1, Range.closed(7, 10), 2, Range.closed(12, 16), 3),
        rangeMap.asMapOfRanges());

    sub.putCoalescing(Range.singleton(7), 1);
    assertEquals(
        ImmutableMap.of(Range.closed(5, 7), 1, Range.openClosed(7, 10), 2), sub.asMapOfRanges());
    assertEquals(

   *
   * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
   * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7,
   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *

    @Test
    public void testMultipleWrites() throws IOException {
        // Multiple write calls should accumulate
        ContentOutputStream cos = new ContentOutputStream(10, Curl.tmpDir);
        cos.write(new byte[] { 0, 1, 2 });
        assertTrue(cos.isInMemory());
        cos.write(new byte[] { 3, 4 });
        assertTrue(cos.isInMemory());
        cos.write(new byte[] { 5 });
        assertTrue(cos.isInMemory());

   *
   * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
   * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7,
   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *

    // separate above
    expected =
        assertThrows(
            IllegalArgumentException.class, () -> range.intersection(Range.closed(10, 12)));
    assertThat(expected).hasMessageThat().contains("connected");
  }

  public void testGap_overlapping() {
    Range<Integer> range = Range.closedOpen(3, 5);

            assertEquals(0x02, SMBUtil.readInt2(buffer, 6));
            assertEquals(0x03, SMBUtil.readInt2(buffer, 8));
            assertArrayEquals(salt, Arrays.copyOfRange(buffer, 10, 12));
        }

        @Test
        @DisplayName("Should encode null hash algorithms and salt")
        void testEncodeNullHashAlgosAndSalt() {

    CacheTesting.warmUp(cache, 0, 10);
    Set<Integer> keySet = cache.asMap().keySet();
    assertThat(keySet).containsExactly(0, 1, 2, 3, 4, 5, 6, 7, 8, 9);

    // re-order
    getAll(cache, asList(0, 1, 2));
    CacheTesting.drainRecencyQueues(cache);
    assertThat(keySet).containsExactly(3, 4, 5, 6, 7, 8, 9, 0, 1, 2);

    // evict 3, 4, 5
    getAll(cache, asList(10, 11, 12));

/*
 * Copyright (C) 2012 The Guava Authors
 *
 * 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,

/*
 * Copyright (C) 2012 The Guava Authors
 *
 * 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,