for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) {
      boolean tmp = array[i];
      array[i] = array[j];
      array[j] = tmp;
    }
  }

  /**
   * Performs a right rotation of {@code array} of "distance" places, so that the first element is
   * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance

    for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) {
      boolean tmp = array[i];
      array[i] = array[j];
      array[j] = tmp;
    }
  }

  /**
   * Performs a right rotation of {@code array} of "distance" places, so that the first element is
   * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance

  This may not always be possible but is a best-practice.
- [ ] Run `mvn verify` to make sure basic checks pass.
  A more thorough check will be performed on your pull request automatically.
- [ ] You have run the [Core IT][core-its] successfully.

If your pull request is about ~20 lines of code you don't need to sign an

     * {@inheritDoc}
     *
     * @see jcifs.smb.DirFileEntryEnumIteratorBase#isDone()
     */
    @Override
    protected boolean isDone() {
        return false;
    }

    /**
     * Performs internal closing operations for SMB2 enumeration.
     *
     * @throws CIFSException if an error occurs during closing
     */
    @Override
    protected void doCloseInternal() throws CIFSException {

        && network.allowsParallelEdges()
        && network.edges().size() > network.asGraph().edges().size()) {
      return true;
    }
    return hasCycle(network.asGraph());
  }

  /**
   * Performs a traversal of the nodes reachable from {@code startNode}. If we ever reach a node
   * we've already visited (following only outgoing edges and without reusing edges), we know
   * there's a cycle in the graph.
   */

        && network.allowsParallelEdges()
        && network.edges().size() > network.asGraph().edges().size()) {
      return true;
    }
    return hasCycle(network.asGraph());
  }

  /**
   * Performs a traversal of the nodes reachable from {@code startNode}. If we ever reach a node
   * we've already visited (following only outgoing edges and without reusing edges), we know
   * there's a cycle in the graph.
   */

                logger.info("No crawling target urls.");
            }
            return;
        }

        doCrawl(sessionId, configList);
    }

    /**
     * Performs the actual crawling operation for the provided data configurations.
     * This method manages the creation and execution of crawler threads,
     * monitors their progress, and handles cleanup operations.
     *

                doCloseInternal();
            } finally {
                this.next = null;
                this.treeHandle.release();
            }
        }
    }

    /**
     * Performs the internal closing operations specific to the implementation.
     *
     * @throws CIFSException if an error occurs during internal closing
     */
    protected abstract void doCloseInternal() throws CIFSException;

 */
package jcifs.internal.smb2.rdma;

/**
 * RDMA memory access permissions for registered memory regions.
 * These flags control what operations can be performed on a memory region.
 */
public enum RdmaAccess {
    /**
     * Local read access to the memory region
     */
    LOCAL_READ,

    /**
     * Local write access to the memory region
     */

- Kubeadm: removed the usage of the `--container-runtime=remote` flag for the...