// OutOfMemoryError is not far behind
    int len = string.length();
    int size = len * count;
    char[] array = new char[size];
    for (int i = 0; i < size; i += len) {
      string.getChars(0, len, array, i);
    }
    return new String(array);
  }

  @Benchmark
  void mikeRepeat(long reps) {
    for (int i = 0; i < reps; i++) {
      String x = mikeRepeat(originalString, count);

    // OutOfMemoryError is not far behind
    int len = string.length();
    int size = len * count;
    char[] array = new char[size];
    for (int i = 0; i < size; i += len) {
      string.getChars(0, len, array, i);
    }
    return new String(array);
  }

  @Benchmark
  void mikeRepeat(long reps) {
    for (int i = 0; i < reps; i++) {
      String x = mikeRepeat(originalString, count);

            c[ci++] = ' ';
            c[ci++] = ' ';
            c[ci++] = '|';
            System.arraycopy(d, 0, c, ci, 16);
            ci += 16;
            c[ci++] = '|';
            NL.getChars(0, NL_LENGTH, c, ci);
            ci += NL_LENGTH;
        } while (si < length);

        ps.println(c);
    }

    /**
     * This is an alternative to the <code>java.lang.Integer.toHexString</code>

        final int clen = s.length();
        final int blen = 2 * clen;
        final byte[] b = new byte[blen];
        final char[] c = new char[clen];
        s.getChars(0, clen, c, 0);
        for (int i = 0, j = 0; i < clen; i++) {
            b[j] = (byte) (c[i] >>> 8);
            j++;
            b[j++] = (byte) (c[i] >>> 0);
        }
        write(b, 0, blen);
    }

    int size = (int) longSize;
    if (size != longSize) {
      throw new ArrayIndexOutOfBoundsException("Required array size too large: " + longSize);
    }

    char[] array = new char[size];
    string.getChars(0, len, array, 0);
    int n;
    for (n = len; n < size - n; n <<= 1) {
      System.arraycopy(array, 0, array, n, n);
    }
    System.arraycopy(array, 0, array, n, size - n);
    return new String(array);

        final int clen = s.length();
        final int blen = 2 * clen;
        final byte[] b = new byte[blen];
        final char[] c = new char[clen];
        s.getChars(0, clen, c, 0);
        for (int i = 0, j = 0; i < clen; i++) {
            b[j] = (byte) (c[i] >>> 8);
            j++;
            b[j++] = (byte) (c[i] >>> 0);
        }
        write(b, 0, blen);
    }

   *
   * <ul>
   *   <li>use {@link StringReader} instead of {@link CharSequenceReader}. It is faster since it can
   *       use {@link String#getChars(int, int, char[], int)} instead of copying characters one by
   *       one with {@link CharSequence#charAt(int)}.
   *   <li>use {@link Appendable#append(CharSequence)} in {@link #copyTo(Appendable)} and {@link

   *
   * <ul>
   *   <li>use {@link StringReader} instead of {@link CharSequenceReader}. It is faster since it can
   *       use {@link String#getChars(int, int, char[], int)} instead of copying characters one by
   *       one with {@link CharSequence#charAt(int)}.
   *   <li>use {@link Appendable#append(CharSequence)} in {@link #copyTo(Appendable)} and {@link

        SmbResourceLocatorImpl copy = l.clone();
        assertEquals(l.getURLPath(), copy.getURLPath());
        assertEquals(l.getUNCPath(), copy.getUNCPath());
        assertEquals(l.getShare(), copy.getShare());
        assertEquals(l.getType(), copy.getType());
        assertSame(l.getURL(), copy.getURL());
    }

    @ParameterizedTest
    @DisplayName("queryLookup extracts values case-insensitively")

    void testGetShare() {
        // Given
        String share = "testshare";
        when(mockReferralData.getShare()).thenReturn(share);

        // When
        String result = mockReferralData.getShare();

        // Then
        assertEquals(share, result);
        verify(mockReferralData).getShare();
    }

    @Test
    @DisplayName("Should get path consumed")
    void testGetPathConsumed() {