SerializableTester.reserializeAndAssert(Floats.stringConverter());
  }

  public void testToArray() {
    // need explicit type parameter to avoid javac warning!?
    List<Float> none = Arrays.<Float>asList();
    assertThat(Floats.toArray(none)).isEqualTo(EMPTY);

    List<Float> one = Arrays.asList(1.0f);
    assertThat(Floats.toArray(one)).isEqualTo(ARRAY1);

    float[] array = {0.0f, 1.0f, 3.0f};

    SerializableTester.reserializeAndAssert(Floats.stringConverter());
  }

  public void testToArray() {
    // need explicit type parameter to avoid javac warning!?
    List<Float> none = Arrays.<Float>asList();
    assertThat(Floats.toArray(none)).isEqualTo(EMPTY);

    List<Float> one = Arrays.asList(1.0f);
    assertThat(Floats.toArray(one)).isEqualTo(ARRAY1);

    float[] array = {0.0f, 1.0f, 3.0f};

     */
    int getLineNumber();

    /**
     * Gets the one-based index of the column containing the problem. The column number should refer to some text file
     * that is given by {@link #getSource()}.
     *
     * @return the one-based index of the column containing the problem or non-positive value if unknown
     */
    int getColumnNumber();

    /**
     * SAX event handler called when an XML start element is encountered.
     * Processes collection definitions and tracks the element hierarchy.
     *
     * @param uri the namespace URI, or empty string if none
     * @param localName the local name without prefix, or empty string if namespace processing is not performed
     * @param qName the qualified name with prefix, or empty string if qualified names are not available

import com.google.errorprone.annotations.CanIgnoreReturnValue;
import java.io.Serializable;
import java.util.ArrayDeque;
import java.util.Collection;
import java.util.Queue;

/**
 * A non-blocking queue which automatically evicts elements from the head of the queue when
 * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO

      subsequently incorporated within the Work.

   2. Grant of Copyright License. Subject to the terms and conditions of
      this License, each Contributor hereby grants to You a perpetual,
      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
      copyright license to reproduce, prepare Derivative Works of,
      publicly display, publicly perform, sublicense, and distribute the

  static final Random rng = new Random();

  /** Number of CPUS, to place bound on table size */
  static final int NCPU = Runtime.getRuntime().availableProcessors();

  /** Table of cells. When non-null, size is a power of 2. */
  transient volatile Cell @Nullable [] cells;

  /**
   * Base value, used mainly when there is no contention, but also as a fallback during table
   * initialization races. Updated via CAS.

        HANDLE.set(array, offset, value);
      }
    };

    @Override
    public boolean usesFastPath() {
      return true;
    }

    /*
     * non-private so that our `-source 8` build doesn't need to generate a synthetic accessor
     * method, whose mention of VarHandle would upset WriteReplaceOverridesTest under Java 8.
     */

            assertEquals(2, bytesWritten);
            assertEquals(0, SMBUtil.readInt2(buffer, 0));
        }

        @Test
        @DisplayName("Should encode at non-zero offset")
        void testEncodeWithOffset() {
            int offset = 100;
            int[] ciphers = { EncryptionNegotiateContext.CIPHER_AES128_GCM };

 *
 *  * In queries, ' ' is encoded to '+' and '+' is encoded to "%2B".
 *
 *  * Characters in `encodeSet` are percent-encoded.
 *
 *  * Control characters and non-ASCII characters are percent-encoded.
 *
 *  * All other characters are copied without transformation.
 *
 * @param alreadyEncoded true to leave '%' as-is; false to convert it to '%25'.