}

    @Test
    @DisplayName("Test split returns null when no following message")
    void testSplitWithNoFollowingMessage() {
        // Given
        when(request.split()).thenReturn(null);

        // When
        CommonServerMessageBlockRequest result = request.split();

        // Then
        assertNull(result);
        verify(request, times(1)).split();
    }

   *                    v
   */
  // Define
  TF_Operation* feed = Placeholder(func_graph_, s_);
  TF_Operation* split = Split3(feed, func_graph_, s_);
  TF_Operation* add = Add({split, 0}, {split, 2}, func_graph_, s_);
  ASSERT_EQ(TF_OK, TF_GetCode(s_)) << TF_Message(s_);
  DefineT(1, {add}, {{split, 0}, {split, 2}}, {{add, 0}}, {});

  // Use, run, and verify
  TF_Operation* two = ScalarConst(2, host_graph_, s_, "two");

	// 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

            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

{ 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]...

 */

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

	// 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 {

      }
    }
    OptionalState state = new OptionalState();

    Deque<Spliterator<T>> splits = new ArrayDeque<>();
    splits.addLast(stream.spliterator());

    while (!splits.isEmpty()) {
      Spliterator<T> spliterator = splits.removeLast();

      if (spliterator.getExactSizeIfKnown() == 0) {
        continue; // drop this split
      }

	// U+0068 'h'
	// U+0065 'e'
	// U+0072 'r'
}

func ExampleSplit() {
	fmt.Printf("%q\n", bytes.Split([]byte("a,b,c"), []byte(",")))
	fmt.Printf("%q\n", bytes.Split([]byte("a man a plan a canal panama"), []byte("a ")))
	fmt.Printf("%q\n", bytes.Split([]byte(" xyz "), []byte("")))
	fmt.Printf("%q\n", bytes.Split([]byte(""), []byte("Bernardo O'Higgins")))
	// Output:
	// ["a" "b" "c"]
	// ["" "man " "plan " "canal panama"]