*
   * <p>The current implementation uses the concurrency level to create a fixed number of hashtable
   * segments, each governed by its own write lock. The segment lock is taken once for each explicit
   * write, and twice for each cache loading computation (once prior to loading the new value, and
   * once after loading completes). Much internal cache management is performed at the segment

        verify(mockNdrBuffer).align(4);
        verify(mockNdrBuffer, times(2)).enc_ndr_short(0); // length and maximum_length are both 0
        verify(mockNdrBuffer, times(2)).enc_ndr_referent(null, 1); // Called twice for name.buffer and sid
        verify(mockDeferredNdrBuffer, never()).enc_ndr_long(anyInt());
        verify(mockDeferredNdrBuffer, never()).enc_ndr_short(anyShort());
        // Note: NdrBuffer does not have encode method

        case WILL_CLOSE:
        case CLOSING:
        case CLOSED:
          throw new IllegalStateException("Cannot call finishToFuture() twice");

        case OPEN:
          throw new AssertionError();
      }
    }
    return future;
  }

  /**

      }

      // the base implementation from AbstractSet uses size() and containsAll()
      // both require iterating over the entire SetView
      // we avoid iterating twice by doing the equivalent of both in one iteration
      int thisSize = 0;
      for (E e : this) {
        try {
          if (!that.contains(e)) {
            return false;
          }

//           non-alphanumeric characters to '_' to make resulting names match
//           the "[a-z][a-z0-9_]*" pattern for operation argument names.
//           `inputs` cannot contain the same tensor twice.
//  noutputs - number of elements in `outputs` array
//  outputs - array of TF_Outputs that specify the outputs of the function.
//            If `noutputs` is zero (the function returns no outputs), `outputs`

// into smaller bulks if some object names are found to be duplicated in the delete list, splitting
// into smaller bulks will avoid holding twice the write lock of the duplicated object names.
func (er erasureObjects) DeleteObjects(ctx context.Context, bucket string, objects []ObjectToDelete, opts ObjectOptions) ([]DeletedObject, []error) {
	if !opts.NoAuditLog {

     * need to be on the same host. This operation does not copy extended
     * file attibutes such as ACLs but it does copy regular attributes as
     * well as create and last write times. This method is almost twice as
     * efficient as manually copying as it employs an additional write
     * thread to read and write data concurrently.
     *
     * It is not possible (nor meaningful) to copy entire workgroups or

# For Python 3.13t, do not install twine as it does not have pre-built wheels
# for this Python version and building it from source fails. We only need twine
# to be present on the system Python which in this case is 3.12.
# Same reason for Python 3.14.
if [[ ${VERSION} == "python3.13-nogil" || ${VERSION} == "python3.14" || ${VERSION} == "python3.14-nogil" ]]; then
  grep -v "twine" $REQUIREMENTS > requirements_without_twine.txt

# For Python 3.13t, do not install twine as it does not have pre-built wheels
# for this Python version and building it from source fails. We only need twine
# to be present on the system Python which in this case is 3.12.
if [[ ${VERSION} == "python3.13-nogil" || ${VERSION} == "python3.14" || ${VERSION} == "python3.14-nogil" ]]; then
  grep -v "twine" $REQUIREMENTS > requirements_without_twine.txt

portpicker==1.6.0
# For wheel verification, and uploading
auditwheel ~= 6.1.0
twine ~= 6.1.0

# uv is faster than pip for installing Python packages.