// This splitter will fail on last entry, after s.err==EOF.
	split := func(data []byte, atEOF bool) (advance int, token []byte, err error) {
		advance, token, err = ScanWords(data, atEOF)
		if len(token) > 1 {
			if s.ErrOrEOF() != io.EOF {
				t.Fatal("not testing EOF")
			}
			err = testError
		}
		return
	}
	s.Split(split)
	for s.Scan() {
	}
	if s.Err() != testError {

	// Set the split function for the scanning operation.
	scanner.Split(bufio.ScanWords)
	// Count the words.
	count := 0
	for scanner.Scan() {
		count++
	}
	if err := scanner.Err(); err != nil {
		fmt.Fprintln(os.Stderr, "reading input:", err)
	}
	fmt.Printf("%d\n", count)
	// Output: 15
}

// Use a Scanner with a custom split function (built by wrapping ScanWords) to validate

        assertNotNull(arrayFields);
        assertEquals(2, arrayFields.length);

        String[] dateFields = fessConfig.getIndexAdminDateFields().split(",");
        assertNotNull(dateFields);
        assertEquals(3, dateFields.length);

        String[] requiredFields = fessConfig.getIndexAdminRequiredFields().split(",");
        assertNotNull(requiredFields);

{ text += "<table border=\"1\" cellpadding=\"5\" cellspacing=\"0\">"; if (headers.length > 0) { text += "<tr>"; headerArray = headers.split(","); for (i = 0; i < headerArray.length; i++) { text += "<th>" + headerArray[i] + "</th>"; } text += "</tr>"; } rows = content.split(";"); for (i = 0; i < rows.length; i++) { if (rows[i].length > 0) { columns = rows[i].split(","); text += "<tr>"; for (j = 0; j < columns.length; j++) { text += "<td" + (number.test(columns[j]) ? " align=\"right\">" : ">") + columns[j]...

            final String[] parts = ipv6Address.split("::");
            final String leftPart = parts.length > 0 && !parts[0].isEmpty() ? parts[0] : "";
            final String rightPart = parts.length > 1 && !parts[1].isEmpty() ? parts[1] : "";
            final int leftCount = leftPart.isEmpty() ? 0 : leftPart.split(":").length;
            final int rightCount = rightPart.isEmpty() ? 0 : rightPart.split(":").length;

	s.maxTokenSize = max
}

// Split sets the split function for the [Scanner].
// The default split function is [ScanLines].
//
// Split panics if it is called after scanning has started.
func (s *Scanner) Split(split SplitFunc) {
	if s.scanCalled {
		panic("Split called after Scan")
	}
	s.split = split
}

// Split functions

      return spliterator.tryAdvance(action);
    }

    @Override
    @Nullable GeneralSpliterator<E> trySplit() {
      Spliterator<E> split = spliterator.trySplit();
      return split == null ? null : new GeneralSpliteratorOfObject<>(split);
    }
  }

  @IgnoreJRERequirement // *should* be redundant with the annotation on SpliteratorTester
  private static final class GeneralSpliteratorOfPrimitive<

      return spliterator.tryAdvance(action);
    }

    @Override
    @Nullable GeneralSpliterator<E> trySplit() {
      Spliterator<E> split = spliterator.trySplit();
      return split == null ? null : new GeneralSpliteratorOfObject<>(split);
    }
  }

  private static final class GeneralSpliteratorOfPrimitive<
          E extends @Nullable Object, C, S extends Spliterator.OfPrimitive<E, C, S>>

};if(c)e(b,c);else{var f=function(){var c=!1;return a('script[src*="form-validator"]').each(function(){var a=this.src.split("form-validator")[1].split("node_modules").length>1;if(!a)return c=this.src.substr(0,this.src.lastIndexOf("/"))+"/","/"===c&&(c=""),!1}),c!==!1&&(e(b,c),!0)};f()||a(function(){var a=f();a||"function"==typeof d&&d()})}}})}(a),function(a){"use strict";a.split=function(b,c,d){d=void 0===d||d===!0;var e="[,|"+(d?"\\s":"")+"-]\\s*",f=new RegExp(e,"g");if("function"!=typeof c){if(!b)return[];var...

 */

package model

import java.util.LinkedList

/**
 * Split a list of elements into nearly even sublist. If an element is too large, largeElementSplitFunction will be used to split the large element into several smaller pieces;
 * if some elements are too small, they will be aggregated by smallElementAggregateFunction.
 *
 * @param list the list to split, must be ordered by size desc