* Constant representing an infinite timeout.
     */
    int FOREVER = -1;

    /**
     * When specified as the <code>shareAccess</code> constructor parameter,
     * other SMB clients (including other threads making calls into jCIFS)
     * will not be permitted to access the target file and will receive "The
     * file is being accessed by another process" message.
     */
    int FILE_NO_SHARE = 0x00;
    /**

- **MinIO chooses the largest EC set size which divides into the total number of drives or total number of nodes given - making sure to keep the uniform distribution i.e each node participates equal number of drives per set**.
- **Each object is written to a single EC set, and therefore is spread over no more than 16 drives.**

	next := 0
	for i, ok := range prefer {
		if !ok || p.readers[i] == nil {
			continue
		}
		if i == next {
			next++
			continue
		}
		// Move reader with index i to index next.
		// Do this by swapping next and i
		p.readers[next], p.readers[i] = p.readers[i], p.readers[next]
		p.readerToBuf[next] = i
		p.readerToBuf[i] = next
		next++
	}
}

// Returns if buf can be erasure decoded.

   * if the processor stops processing early.
   *
   * <p><b>Users who can use {@code Stream}:</b> If your input is a {@link Reader}, consider
   * wrapping it with a {@link BufferedReader} and operating on the {@link java.util.stream.Stream}
   * of lines returned by {@link BufferedReader#lines()}.
   *
   * @throws IOException if an I/O error occurs
   * @since 14.0
   */

        }
        return this.handle.acquire();
    }

    /**
     * Converts an SmbException to an IOException
     *
     * @param se the SmbException to convert
     * @return an IOException wrapping the SmbException
     */
    protected static IOException seToIoe(final SmbException se) {
        IOException ioe = se;
        Throwable root = se.getCause();
        if (root instanceof TransportException) {

	return &LimitWriter{w, skipBytes, limit}
}

type nopCloser struct {
	io.Writer
}

func (nopCloser) Close() error { return nil }

// NopCloser returns a WriteCloser with a no-op Close method wrapping
// the provided Writer w.
func NopCloser(w io.Writer) io.WriteCloser {
	return nopCloser{w}
}

// SkipReader skips a given number of bytes and then returns all
// remaining data.
type SkipReader struct {

   *     such index exists.
   */
  public static int indexOf(float[] array, float target) {
    return indexOf(array, target, 0, array.length);
  }

  // TODO(kevinb): consider making this public
  private static int indexOf(float[] array, float target, int start, int end) {
    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }
    return -1;

      iterator.remove();
      assertEquals(initialSize - 1, map.size());
      // (We can't assert that the values collection no longer contains the
      // removed value, because the underlying map can have multiple mappings
      // to the same value.)
      assertInvariants(map);
      assertThrows(IllegalStateException.class, iterator::remove);
    } else {
      iterator.next();

 * </ul>
 * <p>
 * <b>Repository and Profile Pruning</b>: The consumer POM removal strategy:
 * <ul>
 *   <li>Removes the central repository (only non-central repositories are kept)</li>
 *   <li>Removes build, mailing lists, issue management, and other build-specific information</li>
 *   <li>Removes profiles that have no activation, build, dependencies, or properties</li>
 *   <li>Preserves relocation information in distribution management</li>

          test.remove(rangeToRemove);
          verify(model, test);
        }
      }
    }
  }

  // identical to testPutTwoAndRemove,
  // verifies that putCoalescing() doesn't cause any mappings to change relative to put()
  public void testPutCoalescingTwoAndRemove() {
    for (Range<Integer> rangeToPut1 : RANGES) {
      for (Range<Integer> rangeToPut2 : RANGES) {