}
        }
        return false;
    }

    private static boolean pathNamesPossiblyEqual(final String path1, final String path2) {
        int p1, p2, l1, l2;

        // if unsure return this method returns true

        p1 = path1.lastIndexOf('/');
        p2 = path2.lastIndexOf('/');
        l1 = path1.length() - p1;
        l2 = path2.length() - p2;

   * starts from a {@link File} and will return all files and directories it encounters.
   *
   * <p><b>Warning:</b> {@code File} provides no support for symbolic links, and as such there is no
   * way to ensure that a symbolic link to a directory is not followed when traversing the tree. In
   * this case, iterables created by this traverser could contain files that are outside of the

    return partitionPoint;
  }

  /**
   * Selects the pivot to use, namely the median of the values at {@code from}, {@code to}, and
   * halfway between the two (rounded down), from {@code array}, and ensure (by swapping elements if
   * necessary) that that pivot value appears at the start of the slice i.e. at {@code from}.
   * Expects that {@code from} is strictly less than {@code to}.
   */

 *  Fix: Don't release HTTP/2 connections that have multiple canceled calls. We had a bug where
    canceling calls would cause the shared HTTP/2 connection to be unnecessarily released. This
    harmed connection reuse.
 *  Fix: Ensure canceled and discarded HTTP/2 data is not permanently counted against the limited
    flow control window. We had a few bugs where window size accounting was broken when streams
    were canceled or reset.

            // When
            byte[] bytes = message.toByteArray();

            // Then
            assertNotNull(bytes);
            // Ensure target name is NOT written to the byte array
            int flags = Type2Message.readULong(bytes, 20);
            assertFalse((flags & Type2Message.NTLMSSP_REQUEST_TARGET) != 0);
        }

        @Test

     */
    map2.putAll(map1);
    assertWithMessage("table size after adding %s elements", size)
        .that(bucketsOf(map1))
        .isEqualTo(initialBuckets);

    // Ensure that referenceMap, which doesn't use WithExpectedSize, ends up with the same table
    // size as the other two maps. If it ended up with a smaller size that would imply that we
    // computed the wrong initial capacity.

   * reference; instead use the reference this method <i>returns</i>. At runtime, these point to the
   * same instance, but only the returned reference has the correct generic type information to
   * ensure type safety. For best results, use the standard method-chaining idiom illustrated in the
   * class documentation above, configuring a builder and building your cache in a single statement.

### Bug or Regression

- Do not fail sorting empty elements. ([#94666](https://github.com/kubernetes/kubernetes/pull/94666), [@soltysh](https://github.com/soltysh)) [SIG CLI]
- Ensure getPrimaryInterfaceID not panic when network interfaces for Azure VMSS are null ([#94801](https://github.com/kubernetes/kubernetes/pull/94801), [@nilo19](https://github.com/nilo19)) [SIG Cloud Provider]

    void testSecureKeyWiping() {
        // Given
        byte[] originalEncKey = testEncryptionKey.clone();
        byte[] originalDecKey = testDecryptionKey.clone();

        // Ensure keys are not zero initially
        assertFalse(isAllZeros(originalEncKey), "Original encryption key should not be all zeros");
        assertFalse(isAllZeros(originalDecKey), "Original decryption key should not be all zeros");

            getClient().clearScroll(scrollId);
        }

        refresh();
    }

    /**
     * Generates a unique ID for a document based on session ID and URL.
     * Uses hashing for long IDs to ensure they fit within OpenSearch limits.
     *
     * @param sessionId The session ID.
     * @param url The URL.
     * @return The generated unique ID.
     */