*
   * @param input the input bytes
   * @param offset the offset into the array at which to start
   * @return a long of a concatenated 8 bytes
   */
  static long load64(byte[] input, int offset) {
    // We don't want this in production code as this is the most critical part of the loop.
    assert input.length >= offset + 8;
    // Delegates to the fast (unsafe) version or the fallback.

  private static final class ByteArrayDataInputStream implements ByteArrayDataInput {
    final DataInput input;

    ByteArrayDataInputStream(ByteArrayInputStream byteArrayInputStream) {
      this.input = new DataInputStream(byteArrayInputStream);
    }

    @Override
    public void readFully(byte[] b) {
      try {
        input.readFully(b);
      } catch (IOException e) {
        throw new IllegalStateException(e);
      }

    }

    /**
     * Update digest with data
     *
     * @param input
     *            The input data to update the digest with
     * @param offset
     *            The starting offset in the input data
     * @param len
     *            The length of data to process
     */
    public void update(final byte[] input, final int offset, final int len) {
        if (log.isTraceEnabled()) {

   *       predicate.apply(b))}.
   * </ul>
   *
   * @throws NullPointerException if {@code input} is null and this predicate does not accept null
   *     arguments
   */
  boolean apply(@ParametricNullness T input);

  /**
   * Indicates whether another object is equal to this predicate.
   *
   * <p><b>Warning: do not depend</b> on the behavior of this method.
   *

  static <I extends @Nullable Object, O extends @Nullable Object> ListenableFuture<O> createAsync(
      ListenableFuture<I> input,
      AsyncFunction<? super I, ? extends O> function,
      Executor executor) {
    AsyncTransformFuture<I, O> output = new AsyncTransformFuture<>(input, function);
    input.addListener(output, rejectionPropagatingExecutor(executor, output));
    return output;
  }

        verify(cache, never()).resolveSids0(any(), any(), any());
    }

    @Test
    @DisplayName("resolveSids(CIFSContext,server,sids,offset,length) throws on invalid inputs")
    void resolveSids_invalidInputs() throws Exception {
        SIDCacheImpl cache = new SIDCacheImpl(mock(CIFSContext.class));
        CIFSContext ctx = mock(CIFSContext.class);

        // Null sids array -> NPE

  }

  private static void testSortDescending(byte[] input, byte[] expectedOutput) {
    input = Arrays.copyOf(input, input.length);
    SignedBytes.sortDescending(input);
    assertThat(input).isEqualTo(expectedOutput);
  }

  private static void testSortDescending(
      byte[] input, int fromIndex, int toIndex, byte[] expectedOutput) {
    input = Arrays.copyOf(input, input.length);

                                        <th style="width: 25%"><la:message
                                                key="labels.dict_mapping_source"/></th>
                                        <td>${f:br(f:h(inputs))}<la:hidden property="inputs"/></td>
                                    </tr>
                                    <tr>
                                        <th><la:message key="labels.dict_mapping_target"/></th>

                                        <th style="width: 25%"><la:message
                                                key="labels.dict_synonym_source"/></th>
                                        <td>${f:br(f:h(inputs))}<la:hidden property="inputs"/></td>
                                    </tr>
                                    <tr>
                                        <th><la:message key="labels.dict_synonym_target"/></th>

}

func Benchmark_hasBadPathComponent(t *testing.B) {
	tests := []struct {
		name  string
		input string
		want  bool
	}{
		{name: "empty", input: "", want: false},
		{name: "backslashes", input: `\a\a\ \\  \\\\\\\`, want: false},
		{name: "long", input: strings.Repeat("a/", 2000), want: false},
		{name: "long-fail", input: strings.Repeat("a/", 2000) + "../..", want: true},
	}
	for _, tt := range tests {