for (String edge : edges) {
      checkArgument(
          edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge);
      char node1 = edge.charAt(0);
      char node2 = edge.charAt(1);
      graphMapBuilder.put(node1, node2);
      if (!directed) {
        graphMapBuilder.put(node2, node1);
      }
    }

    for (String edge : edges) {
      checkArgument(
          edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge);
      char node1 = edge.charAt(0);
      char node2 = edge.charAt(1);
      graphMapBuilder.put(node1, node2);
      if (!directed) {
        graphMapBuilder.put(node2, node1);
      }
    }

        response = spy(response);
        when(response.getHeaderStart()).thenReturn(0);

        // Due to bug in line 96, data must be written at bufferIndex=8
        // Write entries with proper nextEntryOffset chain starting at 8
        int currentOffset = 8;
        for (int i = 0; i < 3; i++) {
            // Set NextEntryOffset (104 bytes to next, 0 for last)
            SMBUtil.writeInt4(i < 2 ? 104 : 0, buffer, currentOffset);

pkg go/token, const AND_NOT_ASSIGN = 33
pkg go/token, const ARROW = 36
pkg go/token, const ASSIGN = 42
pkg go/token, const BREAK = 61
pkg go/token, const CASE = 62
pkg go/token, const CHAN = 63
pkg go/token, const CHAR = 8
pkg go/token, const COLON = 58
pkg go/token, const COMMA = 52
pkg go/token, const COMMENT = 2
pkg go/token, const CONST = 64
pkg go/token, const CONTINUE = 65
pkg go/token, const DEC = 38

        // Then
        assertNotNull(type3.getNTResponse());
        // NTLMv2 responses are typically longer than 24 bytes when target info is present
        assertTrue(type3.getNTResponse().length > 24);
    }

    @Test
    @DisplayName("Should include MIC when supported")
    void testMICInclusion() throws Exception {

        Integer.class,
        long.class,
        Long.class,
        short.class,
        Short.class,
        byte.class,
        Byte.class,
        boolean.class,
        Boolean.class,
        char.class,
        Character.class,
        int[].class,
        Object[].class,
        UnsignedInteger.class,
        UnsignedLong.class,
        BigInteger.class,
        BigDecimal.class,

        Exception level1 = new IOException("Level 1", level2);
        CrawlerSystemException topLevel = new CrawlerSystemException("Top level", level1);

        // Verify chain
        assertSame(level1, topLevel.getCause());
        assertSame(level2, topLevel.getCause().getCause());
        assertSame(level3, topLevel.getCause().getCause().getCause());

 *
 * @author Pete Gillin
 */
@NullUnmarked
public class QuantilesTest extends TestCase {

  /*
   * Since Quantiles provides a fluent-style API, each test covers a chain of methods resulting in
   * the computation of one or more quantiles (or in an error) rather than individual methods. The
   * tests are divided into three sections:
   * 1. Tests on a hardcoded dataset for chains starting with median(), quartiles(), and scale(10);

 *
 * @author Pete Gillin
 */
@NullUnmarked
public class QuantilesTest extends TestCase {

  /*
   * Since Quantiles provides a fluent-style API, each test covers a chain of methods resulting in
   * the computation of one or more quantiles (or in an error) rather than individual methods. The
   * tests are divided into three sections:
   * 1. Tests on a hardcoded dataset for chains starting with median(), quartiles(), and scale(10);

                    if (transport.isSMB2()) {
                        final Smb2TreeConnectRequest req = new Smb2TreeConnectRequest(sess.getConfig(), unc);
                        if (andx != null) {
                            req.chain((ServerMessageBlock2) andx);
                        }
                        request = req;
                    } else {