}
    return total;
  }

  // TODO(lukes): consider allowing callers to pass in a buffer to use, some callers would be able
  // to reuse buffers, others would be able to size them more appropriately than the constant
  // defaults

  /**
   * Copies all characters between the {@link Reader} and {@link StringBuilder} objects. Does not
   * close or flush the reader.
   *

    } catch (AssertionError expected) {
      return;
    }
    fail();
  }

  private static class BadEqualsFactory {
    /** oneConstantOnly matters now since it can be either null or the constant. */
    @Keep
    public static Object bad(String a, int b, @Nullable OneConstantEnum oneConstantOnly) {
      return new GoodEquals(a, b);
    }
  }

                        versionExpressionSeverity,
                        Version.V20,
                        "version",
                        null,
                        "must be a constant version but is '" + m.getVersion() + "'.",
                        m);
            }

            Build build = m.getBuild();
            if (build != null) {
                for (Plugin p : build.getPlugins()) {

import (
	"context"
	"errors"
	"io"
	"os"
	"runtime/debug"
	"time"

	"github.com/dustin/go-humanize"
	"github.com/minio/minio/internal/bpool"
	"github.com/minio/minio/internal/disk"
)

// Block sizes constant.
const (
	SmallBlock  = 32 * humanize.KiByte  // Default r/w block size for smaller objects.
	MediumBlock = 128 * humanize.KiByte // Default r/w block size for medium sized objects.

import java.util.List;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.Queue;
import org.jspecify.annotations.Nullable;

/**
 * A double-ended priority queue, which provides constant-time access to both its least element and
 * its greatest element, as determined by the queue's specified comparator. If no comparator is
 * given at creation time, the natural order of elements is used. If no maximum size is given at

   * key, the choice of {@link KeyAbsentBehavior} decides which index is returned.
   *
   * <p>This method runs in log(n) time on random-access lists, which offer near-constant-time
   * access to each list element.
   *
   * @param list the list to be searched.
   * @param key the value to be searched for.
   * @param comparator the comparator by which the list is ordered.

#### *Try your first TensorFlow program*

```shell
$ python
```

```python
>>> import tensorflow as tf
>>> tf.add(1, 2).numpy()
3
>>> hello = tf.constant('Hello, TensorFlow!')
>>> hello.numpy()
b'Hello, TensorFlow!'
```

For more examples, see the
[TensorFlow Tutorials](https://www.tensorflow.org/tutorials/).

## Contribution guidelines

        }
    }

    @Nested
    @DisplayName("Pipe Flags Tests")
    class PipeFlagsTests {

        @Test
        @DisplayName("Should have correct pipe flags constant")
        void testPipeFlags() {
            int expectedFlags = (0x2019F << 16) | SmbPipeResource.PIPE_TYPE_RDWR | SmbPipeResource.PIPE_TYPE_DCE_TRANSACT;
            assertEquals(expectedFlags, DcerpcPipeHandle.pipeFlags);

  private static final Iterable<@Nullable Integer> iterableFourNulls =
      Arrays.asList((Integer) null, null, null, null);

  /*
   * Both of these fields *are* immutable/constant. They don't use the type ImmutableList because
   * they need to behave slightly differently.
   */
  @SuppressWarnings("ConstantCaseForConstants")
  private static final List<Integer> UNDERREPORTING_SIZE_LIST;

   * key, the choice of {@link KeyAbsentBehavior} decides which index is returned.
   *
   * <p>This method runs in log(n) time on random-access lists, which offer near-constant-time
   * access to each list element.
   *
   * @param list the list to be searched.
   * @param key the value to be searched for.
   * @param comparator the comparator by which the list is ordered.