for (double tolerance : BAD_TOLERANCE_CANDIDATES) {
      assertThrows(IllegalArgumentException.class, () -> DoubleMath.fuzzyEquals(1, 2, tolerance));
    }
  }

  /*
   * We've split testFuzzyCompare() into multiple tests so that our internal Android test runner has
   * a better chance of completing each within its per-test-method timeout.
   */

  public void testFuzzyCompare0() {

     */
    private Iterator<String> linesIterator() {
      return new AbstractIterator<String>() {
        final Iterator<String> lines = LINE_SPLITTER.split(seq).iterator();

        @Override
        protected @Nullable String computeNext() {
          if (lines.hasNext()) {
            String next = lines.next();
            // skip last line if it's empty

     */
    private Iterator<String> linesIterator() {
      return new AbstractIterator<String>() {
        final Iterator<String> lines = LINE_SPLITTER.split(seq).iterator();

        @Override
        protected @Nullable String computeNext() {
          if (lines.hasNext()) {
            String next = lines.next();
            // skip last line if it's empty

        def blocksTable = withCategories { blocksSection ? blocksSection.table[0] : parse('<table/>') }
        _ * classDoc.simpleName >> name.split('\\.').last()
        _ * classDoc.name >> name
        _ * classDoc.id >> (args.id ?: name)
        _ * classDoc.classSection >> content
        _ * classDoc.propertiesSection >> propertiesSection

pkg bytes, func Replace([]uint8, []uint8, []uint8, int) []uint8
pkg bytes, func Runes([]uint8) []int32
pkg bytes, func Split([]uint8, []uint8) [][]uint8
pkg bytes, func SplitAfter([]uint8, []uint8) [][]uint8
pkg bytes, func SplitAfterN([]uint8, []uint8, int) [][]uint8
pkg bytes, func SplitN([]uint8, []uint8, int) [][]uint8
pkg bytes, func Title([]uint8) []uint8
pkg bytes, func ToLower([]uint8) []uint8

          continue
        }

        val value = value(i)
        if (result == null) {
          result = TreeSet(String.CASE_INSENSITIVE_ORDER)
        }
        for (varyField in value.split(',')) {
          result.add(varyField.trim())
        }
      }
      return result ?: emptySet()
    }

    /**

substring(String, int); public static String substring(String, int, int); public static String left(String, int); public static String right(String, int); public static String mid(String, int, int); public static String[] split(String); public static String[] split(String, String); public static String[] split(String, String, int); public static String concatenate(Object[]); public static String join(Object[], String); public static String join(java.util.Iterator, String); public static String replaceOnce(String,...

      name = name.substring(0, name.length() - 1);
    }

    checkArgument(name.length() <= MAX_LENGTH, "Domain name too long: '%s':", name);
    this.name = name;

    this.parts = ImmutableList.copyOf(DOT_SPLITTER.split(name));
    checkArgument(parts.size() <= MAX_PARTS, "Domain has too many parts: '%s'", name);
    checkArgument(validateSyntax(parts), "Not a valid domain name: '%s'", name);
  }

  /**

    }

    when {
      secondSpace != -1 && firstSpace == CLEAN.length && line.startsWith(CLEAN) -> {
        val parts =
          line
            .substring(secondSpace + 1)
            .split(' ')
        entry.readable = true
        entry.currentEditor = null
        entry.setLengths(parts)
      }

      secondSpace == -1 && firstSpace == DIRTY.length && line.startsWith(DIRTY) -> {

     * no elements below it).
     *
     * <p>Returns the new position of the element.
     */
    int crossOver(int index, E x) {
      int minChildIndex = findMinChild(index);
      // TODO(kevinb): split the && into two if's and move crossOverUp so it's
      // only called when there's no child.
      if ((minChildIndex > 0) && (ordering.compare(elementData(minChildIndex), x) < 0)) {