this.alternatingKeysAndValues = alternatingKeysAndValues;
    this.size = size;
    this.keyOffset = 0;
    int tableSize = (size >= 2) ? ImmutableSet.chooseTableSize(size) : 0;
    this.keyHashTable = createHashTableOrThrow(alternatingKeysAndValues, size, tableSize, 0);
    Object valueHashTable = createHashTableOrThrow(alternatingKeysAndValues, size, tableSize, 1);
    this.inverse =

    }

    /**
     * Get the preferred size for send operations
     *
     * @return preferred send size in bytes
     */
    public int getPreferredSendSize() {
        return preferredSendSize;
    }

    /**
     * Set the preferred size for send operations
     *
     * @param preferredSendSize preferred send size in bytes
     */

        when(mockInputData.size()).thenReturn(100);
        request.setInputData(mockInputData);

        int size = request.size();

        // Base size 120 + 100 = 220, aligned to 8 = 224
        assertEquals(224, size);
        verify(mockInputData).size();
    }

    @Test
    @DisplayName("Test size calculation with output data")
    void testSizeWithOutputData() {

    }

    @Test
    @DisplayName("Test size calculation with empty dialects array")
    void testSizeWithEmptyDialects() {
        int[] emptyDialects = new int[0];
        ValidateNegotiateInfoRequest request =
                new ValidateNegotiateInfoRequest(DEFAULT_CAPABILITIES, defaultClientGuid, DEFAULT_SECURITY_MODE, emptyDialects);

        // Expected size: 24 (fixed) + 0
        assertEquals(24, request.size());

    int[] axesSizeProduct = new int[axes.size() + 1];
    axesSizeProduct[axes.size()] = 1;
    try {
      for (int i = axes.size() - 1; i >= 0; i--) {
        axesSizeProduct[i] = Math.multiplyExact(axesSizeProduct[i + 1], axes.get(i).size());
      }
    } catch (ArithmeticException e) {
      throw new IllegalArgumentException(
          "Cartesian product too large; must have size at most Integer.MAX_VALUE");
    }

    }
  }

  enum Topology {
    BALANCED {
      @Override
      Optional<BinaryNode> createTree(int size, Random rng) {
        if (size == 0) {
          return Optional.absent();
        } else {
          int leftChildSize = (size - 1) / 2;
          int rightChildSize = size - 1 - leftChildSize;
          return Optional.of(
              new BinaryNode(

            assertEquals(65535, buffer.getTflags());
        }

        @Test
        @DisplayName("Should handle minimum buffer size")
        void testMinimumBufferSize() {
            byte[] testBuffer = new byte[8]; // Minimum size for header

            int bytesDecoded = buffer.decode(testBuffer, 0, testBuffer.length);

            assertEquals(8, bytesDecoded);

    int numGoodQueries = (int) (numQueries * hitRate + 0.5);

    // add good queries
    int size = elementsInSet.size();
    if (size > 0) {
      int minCopiesOfEachGoodQuery = numGoodQueries / size;
      int extras = numGoodQueries % size;

      for (int i = 0; i < minCopiesOfEachGoodQuery; i++) {
        queryList.addAll(elementsInSet);
      }
      List<Element> tmp = new ArrayList<>(elementsInSet);
      shuffle(tmp, random);

   */
  static RuntimeException create(Collection<? extends Throwable> exceptions) {
    if (exceptions.size() == 0) {
      throw new IllegalArgumentException("Can't create an ExceptionCollection with no exceptions");
    }
    if (exceptions.size() == 1) {
      Throwable temp = exceptions.iterator().next();
      if (temp instanceof RuntimeException) {
        return (RuntimeException) temp;

        if (length == 0) {
            return new byte[0];
        }
        final int pad = string.charAt(length - 2) == '=' ? 2 : string.charAt(length - 1) == '=' ? 1 : 0;
        final int size = length * 3 / 4 - pad;
        final byte[] buffer = new byte[size];
        int block;
        int i = 0;
        int index = 0;
        while (i < length) {