super(config, SMB_COM_TRANSACTION2, TRANS2_GET_DFS_REFERRAL);
        this.maxReferralLevel = maxReferralLevel;
        this.request = new DfsReferralRequestBuffer(filename, maxReferralLevel);
        this.totalDataCount = 0;
        this.maxParameterCount = 0;
        this.maxDataCount = 4096;
        this.maxSetupCount = (byte) 0x00;
    }

    /**

     * @param key the key array
     * @param ki the starting offset in the key array
     * @param klen the length of the key to use
     */
    public void init(final byte[] key, final int ki, final int klen) {
        s = new byte[256];

        for (i = 0; i < 256; i++) {
            s[i] = (byte) i;
        }

        for (i = j = 0; i < 256; i++) {
            j = j + key[ki + i % klen] + s[i] & 0xff;
            final byte t = s[i];

Troubleshoot distroless containers by adding a new container with debugging tools, either in a new copy of the pod or using an ephemeral container. (Ephemeral containers are an alpha feature that are not enabled by default.)
Troubleshoot on a node by creating a container running in the host namespaces and with access to the host’s filesystem.

### etcd moves to version 3.5.0

 * retrieval, storage, deletion, and search functionality.
 */
public class RelatedContentService extends FessAppService {

    /**
     * Default constructor.
     * Creates a new instance of RelatedContentService.
     */
    public RelatedContentService() {
        super();
    }

    /**
     * Behavior class for RelatedContent entity operations.

        .any(gradle.startParameter.taskNames::contains)

fun isRunningDocsTestTask() =
    setOf(":docs:docsTest", "docs:docsTest")
        .any(gradle.startParameter.taskNames::contains)


/**
 * Returns a new provider that takes its value from at most one
 * of the given providers. If no input provider is present, the output
 * provider will not be present. If more than one input provider

  }

  private static <K, V> Map<K, V> newHashMap(
      Collection<? extends Entry<? extends K, ? extends V>> entries) {
    HashMap<K, V> map = new HashMap<>();
    for (Entry<? extends K, ? extends V> entry : entries) {
      map.put(entry.getKey(), entry.getValue());
    }
    return map;
  }

  }

  @Override
  public Set<N> adjacentNodes() {
    return Sets.union(predecessors(), successors());
  }

  @Override
  public Set<E> incidentEdges() {
    return new AbstractSet<E>() {
      @Override
      public UnmodifiableIterator<E> iterator() {
        Iterable<E> incidentEdges =
            (selfLoopCount == 0)

     * @param errorCode the error code
     * @return a descriptive error string
     */
    public static String getErrorString(final int errorClass, final int errorCode) {
        StringBuilder result = new StringBuilder();
        switch (errorClass) {
        case SUCCESS:
            result.append("SUCCESS");
            break;
        case ERR_NAM_SRVC:
            result.append("ERR_NAM_SRVC/");

                + Hexdump.toHexString(desiredAccess, 4) + ",searchAttributes=0x" + Hexdump.toHexString(searchAttributes, 4)
                + ",fileAttributes=0x" + Hexdump.toHexString(fileAttributes, 4) + ",creationTime=" + new Date(creationTime)
                + ",openFunction=0x" + Hexdump.toHexString(openFunction, 2) + ",allocationSize=" + allocationSize + ",fileName=" + path
                + "]");
    }