if (x.length() != (originalString.length() * count)) {
        throw new RuntimeException("Wrong length: " + x);
      }
    }
  }

  private static String oldRepeat(String string, int count) {
    // If this multiplication overflows, a NegativeArraySizeException or
    // OutOfMemoryError is not far behind
    int len = string.length();
    int size = len * count;
    char[] array = new char[size];

            buffer[SmbConstants.SMB1_HEADER_LENGTH] = 0;
            SMBUtil.writeInt2(0, buffer, SmbConstants.SMB1_HEADER_LENGTH + 1);

            int length = testBlock.decode(buffer, 0);

            assertNotNull(testBlock.getRawPayload());
            assertEquals(length, testBlock.getRawPayload().length);
        }
    }

    @Nested

        final String[] roles = new String[roles1.length + roles2.length];

        if (roles1.length > 0) {
            System.arraycopy(roles1, 0, roles, 0, roles1.length);
        }
        if (roles2.length > 0) {
            System.arraycopy(roles2, 0, roles, roles1.length, roles2.length);
        }

        final List<SuggestItem> items = new ArrayList<>(fields.length);
        try {

    }

    @Override
    public K[] createKeyArray(int length) {
      return ((TestMultimapGenerator<K, V, M>) multimapGenerator.getInnerGenerator())
          .createKeyArray(length);
    }

    @SuppressWarnings("unchecked")
    @Override
    public Collection<V>[] createValueArray(int length) {
      return (Collection<V>[]) new Collection<?>[length];
    }
  }

    @Override
    public boolean isRoot() {
        // length == 0 should not happen
        return getShare() == null && getUNCPath().length() <= 1;
    }

    boolean isRootOrShare() {
        // length == 0 should not happen
        return getUNCPath().length() <= 1;
    }

    /**
     * @throws MalformedURLException
     *
     */
    private synchronized void canonicalizePath() {

   */
  public static boolean equalsIgnoreCase(CharSequence s1, CharSequence s2) {
    // Calling length() is the null pointer check (so do it before we can exit early).
    int length = s1.length();
    if (s1 == s2) {
      return true;
    }
    if (length != s2.length()) {
      return false;
    }
    for (int i = 0; i < length; i++) {
      char c1 = s1.charAt(i);
      char c2 = s2.charAt(i);
      if (c1 == c2) {

            // Write string data at stringOffset
            System.arraycopy(pathBytes, 0, buffer, stringOffset, pathBytes.length);
            buffer[stringOffset + pathBytes.length] = 0;
            buffer[stringOffset + pathBytes.length + 1] = 0;

            offset += referralSize;
            stringOffset += pathBytes.length + 2;
        }

        return buffer;
    }

        // Verify description
        byte[] descr = NetServerEnum2.DESCR[0].getBytes("ASCII");
        byte[] writtenDescr = new byte[descr.length];
        System.arraycopy(dst, 2, writtenDescr, 0, descr.length);
        assertArrayEquals(descr, writtenDescr);

        int currentIndex = 2 + descr.length;
        // Verify level (0x0001)
        assertEquals(1, (dst[currentIndex] & 0xFF) | ((dst[currentIndex + 1] & 0xFF) << 8));

r t=e&&e.namespaceURI,n=e&&(e.ownerDocument||e).documentElement;return!l.test(t||n&&n.nodeName||"HTML")},merge:function(e,t){for(var n=+t.length,r=0,i=e.length;r<n;r++)e[i++]=t[r];return e.length=i,e},grep:function(e,t,n){for(var r=[],i=0,o=e.length,a=!n;i<o;i++)!t(e[i],i)!==a&&r.push(e[i]);return r},map:function(e,t,n){var r,i,o=0,a=[];if(c(e))for(r=e.length;o<r;o++)null!=(i=t(e[o],o,n))&&a.push(i);else for(o in e)null!=(i=t(e[o],o,n))&&a.push(i);return g(a)},guid:1,support:le}),"function"==typeof...

     * @param length maximum length to receive
     * @return number of bytes received
     * @throws IOException if an I/O error occurs
     */
    int recv(byte[] buf, int off, int length) throws IOException;

    /**
     * Send data to the pipe
     *
     * @param buf buffer containing data to send
     * @param off offset in the buffer
     * @param length length of data to send