/**
   * Returns a string containing the string representation of each of {@code parts}, using the
   * previously configured separator between each.
   */
  public String join(Iterable<?> parts) {
    // We don't use the same optimization here as in the JRE flavor.
    // TODO: b/381289911 - Evaluate the performance impact of doing so.
    return join(parts.iterator());
  }

  /*

 * implementing {@code Map}, the additional type-safe operations {@link #putInstance} and {@link
 * #getInstance} are available.
 *
 * <p>Generally, implementations don't support {@link #put} and {@link #putAll} because there is no
 * way to check an object at runtime to be an instance of a {@link TypeToken}. Instead, caller
 * should use the type safe {@link #putInstance}.
 *

   * Runnable}, and arrange that {@code get} will return the given result on successful completion.
   *
   * @param runnable the runnable task
   * @param result the result to return on successful completion. If you don't need a particular
   *     result, consider using constructions of the form: {@code ListenableFuture<?> f =
   *     ListenableFutureTask.create(runnable, null)}
   */

  }

  private static long random() {
    return randomSource.nextLong();
  }

  // A random value that cannot be 0 and that is unsigned-less-than or equal
  // to the given dividend, so that we don't have half of our divisions being
  // trivial because the divisor is bigger than the dividend.
  // Using remainder here does not give us a uniform distribution but it should
  // not have a big impact on the measurement.

 * implementing {@code Map}, the additional type-safe operations {@link #putInstance} and {@link
 * #getInstance} are available.
 *
 * <p>Generally, implementations don't support {@link #put} and {@link #putAll} because there is no
 * way to check an object at runtime to be an instance of a {@link TypeToken}. Instead, caller
 * should use the type safe {@link #putInstance}.
 *

  private final BaseGraph<N> graph;
  private final Iterator<N> nodeIterator;

  @Nullable N node = null; // null is safe as an initial value because graphs don't allow null nodes

  Iterator<N> successorIterator = ImmutableSet.<N>of().iterator();

  static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {

    }

    @Test
    public void testRdmaAutoProvider() throws CIFSException {
        Properties props = new Properties();
        props.setProperty("jcifs.smb.client.useRDMA", "true");
        // Don't set provider, should default to auto

        PropertyConfiguration config = new PropertyConfiguration(props);

        assertTrue(config.isUseRDMA(), "RDMA should be enabled");

                // create it if necessary
                openFunction = OPEN_FN_TRUNC | OPEN_FN_CREATE;
            } else {
                openFunction = OPEN_FN_TRUNC;
            }
        } else // don't truncate the file
        if ((flags & SmbFile.O_CREAT) == SmbFile.O_CREAT) {
            // create it if necessary
            if ((flags & SmbFile.O_EXCL) == SmbFile.O_EXCL) {
                // fail if already exists

package jcifs.smb;

/**
 * Windows error codes used in SMB protocol operations.
 * These constants represent standard Windows error codes returned by SMB servers.
 */
public interface WinError {

    /*
     * Don't bother to edit this. Everything within the interface
     * block is automatically generated from the ntstatus package.
     */

    /** The operation completed successfully */
    int ERROR_SUCCESS = 0;

package jcifs.smb1.smb1;

/**
 * Windows error codes used in SMB protocol operations.
 * These constants represent standard Windows error codes returned by SMB servers.
 */
public interface WinError {

    /* Don't bother to edit this. Everthing within the interface
     * block is automatically generated from the ntstatus package.
     */

    /** The operation completed successfully */
    int ERROR_SUCCESS = 0;