* Returns the ancestor of the current domain at the given number of levels "higher" (rightward)
   * in the subdomain list. The number of levels must be non-negative, and less than {@code N-1},
   * where {@code N} is the number of parts in the domain.
   *
   * <p>TODO: Reasonable candidate for addition to public API.
   */
  private InternetDomainName ancestor(int levels) {

    // optimistically fill index position with elements from lower levels,
    // moving the hole down. In most cases this reduces the number of
    // comparisons with toTrickle, but in some cases we will need to bubble it
    // all the way up again.
    int vacated = heap.fillHoleAt(index);
    // Try to see if toTrickle can be bubbled up min levels.
    int bubbledTo = heap.bubbleUpAlternatingLevels(vacated, toTrickle);

 * Provides common functionality for various SMB2/SMB3 file system information classes
 * used in query file system information operations, with constants for information levels.
 *
 * @author mbechler
 */
public interface FileSystemInformation extends Decodable {

    /**
     * SMB information allocation constant.
     */
    byte SMB_INFO_ALLOCATION = -1;

    /**

        Exception level2 = new IllegalStateException("Level 2", level3);
        Exception level1 = new IOException("Level 1", level2);
        CrawlerSystemException topLevel = new CrawlerSystemException("Top level", level1);

        // Verify chain
        assertSame(level1, topLevel.getCause());
        assertSame(level2, topLevel.getCause().getCause());

 *       <ul>
 *         <li>2 levels: average of 64ns per lock()/unlock()
 *         <li>3 levels: average of 77ns per lock()/unlock()
 *         <li>4 levels: average of 99ns per lock()/unlock()
 *         <li>5 levels: average of 103ns per lock()/unlock()
 *         <li>10 levels: average of 184ns per lock()/unlock()
 *         <li>20 levels: average of 393ns per lock()/unlock()
 *       </ul>
 * </ul>

            assertTrue(s);
        }
    }

    @DisplayName("Test exception handling for invalid information levels")
    @ParameterizedTest
    @ValueSource(ints = { 0, 1, 2, 4, 5, 6, 8, 100, -2, -100, Integer.MIN_VALUE, Integer.MAX_VALUE })
    void testInvalidInformationLevels(int invalidLevel) {
        // Skip valid levels

  @Override public void log(String message) {
    Timber.tag("OkHttp").d(message);
  }
});
```

**Warning**: The logs generated by this interceptor when using the `HEADERS` or `BODY` levels have
the potential to leak sensitive information such as "Authorization" or "Cookie" headers and the
contents of request and response bodies. This data should only be logged in a controlled way or in
a non-production environment.

            assertEquals("Expected structureSize = 24", exception.getMessage());
        }

        @ParameterizedTest
        @DisplayName("Should read different oplock levels correctly")
        @ValueSource(bytes = { 0x00, 0x01, 0x02, 0x08, (byte) 0xFF })
        void testReadDifferentOplockLevels(byte oplockLevel) throws Exception {

    /**
     * Path or URL to be crawled by this configuration.
     */
    @Required
    @Size(max = 1000)
    public String crawlingConfigPath;

    /**
     * Maximum depth for crawling (how many levels deep to follow links).
     */
    @Min(value = 0)
    @Max(value = 2147483647)
    @ValidateTypeFailure
    public Integer depth;

    /**
     * Maximum number of pages/documents to access during crawling.

        // Should read nothing (returns 0)
        assertEquals(0, read);
    }

    @Test
    void testMapInformationLevel() {
        // Test valid information levels
        assertEquals(0x0101, Trans2QueryPathInformation.mapInformationLevel(FileInformation.FILE_BASIC_INFO));
        assertEquals(0x0102, Trans2QueryPathInformation.mapInformationLevel(FileInformation.FILE_STANDARD_INFO));