* value returned by this method is the {@code i} in that range such that {@code allRequired[i]}
   * is as close as possible to the center of the range [{@code from}, {@code to}]. Choosing the
   * value closest to the center of the range first is the most efficient strategy because it
   * minimizes the size of the subranges from which the remaining selections must be done.
   */

 * </ul>
 *
 * <p>Using a converter:
 *
 * <ul>
 *   <li>Convert one instance in the "forward" direction using {@code converter.convert(a)}.
 *   <li>Convert multiple instances "forward" using {@code converter.convertAll(as)}.
 *   <li>Convert in the "backward" direction using {@code converter.reverse().convert(b)} or {@code
 *       converter.reverse().convertAll(bs)}.

  }

  public void testStringConverter_convert() {
    Converter<String, Long> converter = Longs.stringConverter();
    assertThat(converter.convert("1")).isEqualTo((Long) 1L);
    assertThat(converter.convert("0")).isEqualTo((Long) 0L);
    assertThat(converter.convert("-1")).isEqualTo((Long) (-1L));
    assertThat(converter.convert("0xff")).isEqualTo((Long) 255L);
    assertThat(converter.convert("0xFF")).isEqualTo((Long) 255L);

  }

  public void testStringConverter_convert() {
    Converter<String, Long> converter = Longs.stringConverter();
    assertThat(converter.convert("1")).isEqualTo((Long) 1L);
    assertThat(converter.convert("0")).isEqualTo((Long) 0L);
    assertThat(converter.convert("-1")).isEqualTo((Long) (-1L));
    assertThat(converter.convert("0xff")).isEqualTo((Long) 255L);
    assertThat(converter.convert("0xFF")).isEqualTo((Long) 255L);

  }

  public void testStringConverter_convert() {
    Converter<String, Double> converter = Doubles.stringConverter();
    assertThat(converter.convert("1.0")).isEqualTo((Double) 1.0);
    assertThat(converter.convert("0.0")).isEqualTo((Double) 0.0);
    assertThat(converter.convert("-1.0")).isEqualTo((Double) (-1.0));
    assertThat(converter.convert("1")).isEqualTo((Double) 1.0);

  }

  public void testStringConverter_convert() {
    Converter<String, Double> converter = Doubles.stringConverter();
    assertThat(converter.convert("1.0")).isEqualTo((Double) 1.0);
    assertThat(converter.convert("0.0")).isEqualTo((Double) 0.0);
    assertThat(converter.convert("-1.0")).isEqualTo((Double) (-1.0));
    assertThat(converter.convert("1")).isEqualTo((Double) 1.0);

          if (newValue == 0) {
            // Just CASed to 0; remove the entry to clean up the map. If the removal fails,
            // another thread has already replaced it with a new counter, which is fine.
            countMap.remove(element, existingCounter);
          }
          return oldValue;
        }
      } else {
        return 0;
      }
    }
  }

  /**

  @GwtIncompatible // threads
  public void testOverflowTimeout() throws Exception {
    // First, sanity check that naive multiplication would really overflow to a negative number:
    long nanosPerSecond = NANOSECONDS.convert(1, SECONDS);
    assertThat(nanosPerSecond * Long.MAX_VALUE).isLessThan(0L);

    // Check that we wait long enough anyway (presumably as long as MAX_VALUE nanos):

   *
   * <p>Note that if any input list is empty, the Cartesian product will also be empty. If no lists
   * at all are provided (an empty list), the resulting Cartesian product has one element, an empty
   * list (counter-intuitive, but mathematically consistent).
   *
   * <p><i>Performance notes:</i> while the cartesian product of lists of size {@code m, n, p} is a

      void doIt(ImmutableDoubleArray.Builder builder, AtomicInteger counter) {
        builder.add(counter.getAndIncrement());
      }
    },
    ADD_ARRAY {
      @Override
      void doIt(ImmutableDoubleArray.Builder builder, AtomicInteger counter) {
        double[] array = new double[RANDOM.nextInt(10)];
        for (int i = 0; i < array.length; i++) {
          array[i] = counter.getAndIncrement();
        }