String[] suffix = {"f", "g"};
      String[] all = new String[elements.length + suffix.length];
      arraycopy(elements, 0, all, 0, elements.length);
      arraycopy(suffix, 0, all, elements.length, suffix.length);
      return ImmutableList.copyOf(all).subList(0, elements.length);
    }
  }

  public static class ImmutableListTailSubListGenerator extends TestStringListGenerator {
    @Override

        assertNotNull(response);
        assertEquals(24, response.length);
    }

    // Test getNTLMResponse
    @Test
    void testGetNTLMResponse() {
        byte[] challenge = { 1, 2, 3, 4, 5, 6, 7, 8 };
        byte[] response = NtlmPasswordAuthentication.getNTLMResponse("password", challenge);
        assertNotNull(response);
        assertEquals(24, response.length);
    }

    // Test getLMv2Response
    @Test

    checkNotNull(array);
    checkPositionIndexes(fromIndex, toIndex, array.length);
    if (array.length <= 1) {
      return;
    }

    int length = toIndex - fromIndex;
    // Obtain m = (-distance mod length), a non-negative value less than "length". This is how many
    // places left to rotate.
    int m = -distance % length;
    m = (m < 0) ? m + length : m;

        assertNotNull(entries1);
        assertNotNull(entries2);
        assertNotNull(entries3);

        assertEquals(entries1.length, entries2.length);
        assertEquals(entries2.length, entries3.length);

        for (int i = 0; i < entries1.length; i++) {
            assertEquals(entries1[i].getName(), entries2[i].getName());
            assertEquals(entries2[i].getName(), entries3[i].getName());

     * of this method.
     */
    void putAll(LockFreeBitArray other) {
      checkArgument(
          data.length() == other.data.length(),
          "BitArrays must be of equal length (%s != %s)",
          data.length(),
          other.data.length());
      for (int i = 0; i < data.length(); i++) {
        putData(i, other.data.get(i));
      }
    }

    /**

      return asList(all).subList(2, elements.length + 2);
    }
  }

  private static Double[] concat(Double[] left, Double[] right) {
    Double[] result = new Double[left.length + right.length];
    System.arraycopy(left, 0, result, 0, left.length);
    System.arraycopy(right, 0, result, left.length, right.length);
    return result;
  }

         * The priority length is the number of characters before any wildcard.
         *
         * @param pattern the path pattern
         * @return the priority length
         */
        private static int calculatePriorityLength(final String pattern) {
            // For priority, we count the pattern length, treating * as having length 0
            // and $ as having length 1
            int length = 0;

            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

        // Verify size
        assertEquals(24 + 2 * manyDialects.length, encodedLength);

        // Verify dialect count
        assertEquals(manyDialects.length, SMBUtil.readInt2(buffer, 22));

        // Verify all dialects
        for (int i = 0; i < manyDialects.length; i++) {
            assertEquals(manyDialects[i], SMBUtil.readInt2(buffer, 24 + i * 2));
        }
    }

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