Level0s: []Level0{},
				},
				{
					Value:   "value4-4",
					Level0s: []Level0{},
				},
			},
		},
	}
	if err := DB.Create(&want[1]).Error; err != nil {
		t.Error(err)
	}

	var got []Level3
	if err := DB.Preload("Level2").Preload("Level2.Level1s").Preload("Level2_1").Preload("Level2_1.Level1s").Preload("Level2_1.Level1s.Level0s").Find(&got).Error; err != nil {
		t.Error(err)
	}

        // 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));

   * 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);

 *       <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>

            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 {

            FileSystemInformation.FS_FULL_SIZE_INFO })
    void testConstructorWithDifferentInformationLevels(int informationLevel) {
        // Test constructor with different information levels
        response = new Trans2QueryFSInformationResponse(config, informationLevel);

        assertNotNull(response);
        assertEquals(informationLevel, response.getInformationLevel());

        void testInfoQuota() {
            assertEquals(4, Smb2Constants.SMB2_0_INFO_QUOTA, "Quota info level must be 4");
        }

        @Test
        @DisplayName("All info levels should be sequential")
        void testInfoLevelsSequential() {
            assertEquals(Smb2Constants.SMB2_0_INFO_FILE + 1, Smb2Constants.SMB2_0_INFO_FILESYSTEM, "Filesystem should be File + 1");

        return problemsReportedFor(BuilderProblem.Severity.values());
    }

    /**
     * Returns count of problems reported for given severities.
     *
     * @param severities the severity levels to count problems for
     * @return the total count of problems for the specified severities
     */
    int problemsReportedFor(BuilderProblem.Severity... severities);

    /**

        FileInformation basicInfo = mock(FileInformation.class);
        FileInformation standardInfo = mock(FileInformation.class);
        FileInformation internalInfo = mock(FileInformation.class);

        // Set different levels
        when(basicInfo.getFileInformationLevel()).thenReturn(FileInformation.FILE_BASIC_INFO);
        when(standardInfo.getFileInformationLevel()).thenReturn(FileInformation.FILE_STANDARD_INFO);