enc_ndr_long(System.identityHashCode(obj));
            return;
        case 2: /* ptr */
            enc_ndr_long(getDceReferent(obj));
        }
    }

    @Override
    public String toString() {
        return "start=" + this.start + ",index=" + this.index + ",length=" + getLength();
    }

        SmbTransportInternal mockTransport = mock(SmbTransportInternal.class);
        when(mockTransport.isDisconnected()).thenReturn(true);
        when(mockTransport.toString()).thenReturn("MockTransport");

        try (RdmaTransport transport = new RdmaTransport(mockTransport, testContext)) {
            assertNotNull(transport, "Transport should not be null");

      @Override
      public Checksum get() {
        return new Adler32();
      }
    };

    public final HashFunction hashFunction;

    ChecksumType(String toString) {
      this.hashFunction = new ChecksumHashFunction(this, 32, toString);
    }
  }

  /**
   * Returns a hash function implementing FarmHash's Fingerprint64, an open-source algorithm.
   *

        for (int i = 1; i < values.length; i++) {
            buf.append('\n').append(prefix).append(i + 1).append(':').append(values[i]);
        }
        return buf.toString();
    }

        when(smbFile.getLocator()).thenReturn(locator);

        networkExplorer.doDirectory(request, response, smbFile);

        verify(response).setContentType("text/html");

        String output = stringWriter.toString();
        assertTrue(output.contains("document.pdf"));
        assertTrue(output.contains("folder/"));
    }

    /**
     * Test handling of IOException
     */
    @Test

        @Override
        public PrintWriter getWriter() {
            return writer;
        }

        public String getWrittenContent() {
            writer.flush();
            return stringWriter.toString();
        }

        // Minimal implementations for other required methods
        @Override
        public void addCookie(jakarta.servlet.http.Cookie cookie) {
        }

        @Override

                    log.debug("Retry also failed", e);
                    throw sae;
                }
            } else {
                if (!this.ctx.renewCredentials(loc.getURL().toString(), sae)) {
                    throw sae;
                }
                log.debug("Trying to renew credentials after auth error");

        assertEquals("test-1.0.0.jar", artifact.getFileName());
    }

    public void test_Artifact_toString() {
        Artifact artifact = new Artifact("test", "1.0.0");
        assertEquals("test:1.0.0", artifact.toString());
    }

    public void test_Artifact_getType() {
        Artifact dsArtifact = new Artifact("fess-ds-test", "1.0.0");
        assertEquals(ArtifactType.DATA_STORE, dsArtifact.getType());

  @Override
  public int bits() {
    return 32;
  }

  @Override
  public Hasher newHasher() {
    return new Crc32cHasher();
  }

  @Override
  public String toString() {
    return "Hashing.crc32c()";
  }

  static final class Crc32cHasher extends AbstractStreamingHasher {

    /*
     * The striding algorithm works roughly as follows: it is universally the case that

       * appears in. Each element appears in exactly half of the 2^n sets, so:
       */
      return inputSet.keySet().hashCode() << (inputSet.size() - 1);
    }

    @Override
    public String toString() {
      return "powerSet(" + inputSet + ")";
    }
  }

  /**
   * Returns the set of all subsets of {@code set} of size {@code size}. For example, {@code