int written = request.writeBytesWireFormat(buffer, offset);

        assertEquals(24, written);
        assertEquals(24, SMBUtil.readInt2(buffer, offset));

        // Verify file ID at correct position
        byte[] copiedFileId = new byte[16];
        System.arraycopy(buffer, offset + 8, copiedFileId, 0, 16);
        assertArrayEquals(testFileId, copiedFileId);
    }

    @Test

        byte[] buf = new byte[bodyLen];
        SMBUtil.writeInt2(9, buf, 0); // structureSize
        buf[2] = (byte) errorContextCount; // ErrorContextCount
        // one reserved byte at position 3
        SMBUtil.writeInt4(bc, buf, 4); // ByteCount
        if (bc > 0 && errorData != null) {
            System.arraycopy(errorData, 0, buf, 8, bc);
        }
        return buf;
    }

    @Test

        byte[] data = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8 };
        System.arraycopy(data, 0, ctx, 0x20, data.length);

        // Update base to point to the context area
        int offsetFieldPos = base.length - 8; // position of CreateContextsOffset
        SMBUtil.writeInt4(contextStartOffsetFromHeader, base, offsetFieldPos);
        SMBUtil.writeInt4(ctx.length, base, offsetFieldPos + 4);

  @Deprecated(
    message = "moved to val",
    replaceWith = ReplaceWith(expression = "size"),
    level = DeprecationLevel.ERROR,
  )
  fun size(): Int = size

  /** Returns the field at `position`. */
  fun name(index: Int): String = commonName(index)

  /** Returns the value at `index`. */
  fun value(index: Int): String = commonValue(index)

                // When
                int bytesRead = response.readBytesWireFormat(buffer, pos);

                // Then
                assertEquals(4, bytesRead, "Failed at position " + pos);
            }
        }

        @Test
        @DisplayName("Should throw exception for invalid structure size")
        void testReadBytesWireFormatInvalidStructureSize() {
            // Given

   *     {@link ByteOrder#LITTLE_ENDIAN}, to which a BYTES-long byte representation of this instance
   *     is written. In the process increases the position of {@link ByteBuffer} by BYTES.
   */
  void writeTo(ByteBuffer buffer) {
    checkNotNull(buffer);
    checkArgument(
        buffer.remaining() >= BYTES,

   * k) worst case.
   */
  private void trim() {
    int left = 0;
    int right = 2 * k - 1;

    int minThresholdPosition = 0;
    // The leftmost position at which the greatest of the k lower elements
    // -- the new value of threshold -- might be found.

    int iterations = 0;
    int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;

  }

  /**
   * Updates the specified entry to point to the new value: removes the old value from the V-to-K
   * mapping and puts the new one in. The entry is moved to the end of the insertion order, or to
   * the position of the new key if it was previously present.
   */
  private void replaceKeyInEntry(int entry, @ParametricNullness K newKey, boolean force) {
    checkArgument(entry != ABSENT);

     * @return the allocationSize
     */
    public final long getAllocationSize() {
        return this.allocationSize;
    }

    /**
     * Get the end of file position
     * @return the endOfFile
     */
    public final long getEndOfFile() {
        return this.endOfFile;
    }

    /**
     * {@inheritDoc}
     *

		}
		if !meta.IsValid() {
			inconsistent++
			continue
		}
		if meta.XLV1 != fi.XLV1 {
			inconsistent++
			continue
		}
		// check if erasure distribution order matches the index
		// position if this is not correct we discard the disk
		// and move to collect others
		if distribution[i] != meta.Erasure.Index {
			inconsistent++ // keep track of inconsistent entries
			continue
		}