int dataLength = -1;
    try {
      DataInputStream din = new DataInputStream(in);
      // currently this assumes there is no negative ordinal; will have to be updated if we
      // add non-stateless strategies (for which we've reserved negative ordinals; see
      // Strategy.ordinal()).
      strategyOrdinal = din.readByte();
      numHashFunctions = toUnsignedInt(din.readByte());
      dataLength = din.readInt();

      /*

        // ## Test that Method enum ordinal values are sequential ##

        // ## Act & Assert ##
        assertEquals(0, Method.GET.ordinal());
        assertEquals(1, Method.POST.ordinal());
        assertEquals(2, Method.PUT.ordinal());
        assertEquals(3, Method.DELETE.ordinal());
        assertEquals(4, Method.HEAD.ordinal());
        assertEquals(5, Method.OPTIONS.ordinal());

    }

    // Test ProtocolType ordinal
    @Test
    public void test_protocolTypeOrdinal() {
        assertEquals("WEB.ordinal() should be 0", 0, ProtocolType.WEB.ordinal());
        assertEquals("FILE.ordinal() should be 1", 1, ProtocolType.FILE.ordinal());
    }

    // Test protocolType is required
    @Test

  }

  public void testDifferentOrderings_noViolations() {
    lock3.lock(); // MyOrder, ordinal() == 3
    lock01.lock(); // OtherOrder, ordinal() == 1
  }

  public void testExplicitOrderings_generalCycleDetection() {
    lock3.lock(); // MyOrder, ordinal() == 3
    lock01.lock(); // OtherOrder, ordinal() == 1

    lock3.unlock();
    PotentialDeadlockException expected =

  }

  public void testDifferentOrderings_noViolations() {
    lock3.lock(); // MyOrder, ordinal() == 3
    lock01.lock(); // OtherOrder, ordinal() == 1
  }

  public void testExplicitOrderings_generalCycleDetection() {
    lock3.lock(); // MyOrder, ordinal() == 3
    lock01.lock(); // OtherOrder, ordinal() == 1

    lock3.unlock();
    PotentialDeadlockException expected =

    default boolean hasProblemsFor(BuilderProblem.Severity severity) {
        requireNonNull(severity, "severity");
        for (BuilderProblem.Severity s : BuilderProblem.Severity.values()) {
            if (s.ordinal() <= severity.ordinal() && problemsReportedFor(s) > 0) {
                return true;
            }
        }
        return false;
    }

    /**
     * Returns total count of problems reported.
     */

      nodes.add(node);
      map.put(key, node);
    }
    // Pre-populate all allowedPriorLocks with nodes of smaller ordinal.
    for (int i = 1; i < numKeys; i++) {
      nodes.get(i).checkAcquiredLocks(Policies.THROW, nodes.subList(0, i));
    }
    // Pre-populate all disallowedPriorLocks with nodes of larger ordinal.
    for (int i = 0; i < numKeys - 1; i++) {

            // IbvSendWR sendWR = new IbvSendWR();
            // sendWR.setWr_id(System.nanoTime());
            // sendWR.setOpcode(IbvSendWR.IbvWrOpcode.IBV_WR_SEND.ordinal());
            // sendWR.setSend_flags(IbvSendWR.IBV_SEND_SIGNALED);
            //
            // LinkedList<IbvSge> sgeList = new LinkedList<>();
            // IbvSge sge = new IbvSge();

	lkctx, err := locker.GetLock(ctx, newDiskHealingTimeout)
	if err != nil {
		return fmt.Errorf("Healing of drive '%v' on %s pool, belonging to %s erasure set already in progress: %w",
			disk, humanize.Ordinal(poolIdx+1), humanize.Ordinal(setIdx+1), err)
	}
	ctx = lkctx.Context()
	defer locker.Unlock(lkctx)

	// Load healing tracker in this disk
	tracker, err := loadHealingTracker(ctx, disk)
	if err != nil {

        // Verify lease state
        assertEquals(leaseState, SMBUtil.readInt4(buffer, 40));

        // Verify directory-specific data
        assertEquals(DirectoryCacheScope.RECURSIVE_TREE.ordinal(), SMBUtil.readInt4(buffer, 56)); // CacheScope
        assertEquals(45000L, SMBUtil.readInt8(buffer, 60)); // MaxCacheAge

        // Verify flags (RECURSIVE_TREE + NOTIFICATIONS)