}

    private Builder(Comparator<? super K> comparator, int initialCapacity) {
      this.comparator = checkNotNull(comparator);
      this.keys = new @Nullable Object[initialCapacity];
      this.values = new @Nullable Object[initialCapacity];
    }

    private void ensureCapacity(int minCapacity) {
      if (minCapacity > keys.length) {

{{- end }} {{- end }} selector: app: {{ template "minio.name" . }} release: {{ .Release.Name }} minio/templates/statefulset.yaml {{- if eq .Values.mode "distributed" }} {{ $zoneCount := .Values.zones | int }} {{ $nodeCount := .Values.replicas | int }} {{ $drivesPerNode := .Values.drivesPerNode | int }} {{ $scheme := "http" }} {{- if .Values.tls.enabled }} {{ $scheme = "https" }} {{ end }} {{ $mountPath := .Values.mountPath }} {{ $bucketRoot := or ($.Values.bucketRoot) ($.Values.mountPath) }} {{ $subPath...

matchLabels: app: {{ include "minio.name" . }} release: {{ .Release.Name }} monitoring: true {{- end }} minio/templates/statefulset.yaml {{- if eq .Values.mode "distributed" }} {{ $poolCount := .Values.pools | int }} {{ $nodeCount := .Values.replicas | int }} {{ $drivesPerNode := .Values.drivesPerNode | int }} {{ $scheme := "http" }} {{- if .Values.tls.enabled }} {{ $scheme = "https" }} {{ end }} {{ $mountPath := .Values.mountPath }} {{ $bucketRoot := or ($.Values.bucketRoot) ($.Values.mountPath) }} {{ $subPath...

matchLabels: app: {{ include "minio.name" . }} release: {{ .Release.Name }} monitoring: "true" {{- end }} minio/templates/statefulset.yaml {{- if eq .Values.mode "distributed" }} {{ $poolCount := .Values.pools | int }} {{ $nodeCount := .Values.replicas | int }} {{ $drivesPerNode := .Values.drivesPerNode | int }} {{ $scheme := "http" }} {{- if .Values.tls.enabled }} {{ $scheme = "https" }} {{ end }} {{ $mountPath := .Values.mountPath }} {{ $bucketRoot := or ($.Values.bucketRoot) ($.Values.mountPath) }} {{ $subPath...

matchLabels: app: {{ include "minio.name" . }} release: {{ .Release.Name }} monitoring: "true" {{- end }} minio/templates/statefulset.yaml {{- if eq .Values.mode "distributed" }} {{ $poolCount := .Values.pools | int }} {{ $nodeCount := .Values.replicas | int }} {{ $drivesPerNode := .Values.drivesPerNode | int }} {{ $scheme := "http" }} {{- if .Values.tls.enabled }} {{ $scheme = "https" }} {{ end }} {{ $mountPath := .Values.mountPath }} {{ $bucketRoot := or ($.Values.bucketRoot) ($.Values.mountPath) }} {{ $subPath...

   */
  static <E> ImmutableSortedSet<E> construct(
      Comparator<? super E> comparator, int n, E... contents) {
    if (n == 0) {
      return emptySet(comparator);
    }
    checkElementsNotNull(contents, n);
    sort(contents, 0, n, comparator);
    int uniques = 1;
    for (int i = 1; i < n; i++) {
      E cur = contents[i];
      E prev = contents[uniques - 1];

func (w testNonEmptyWriter) Write(b []byte) (int, error) {
	if len(b) == 0 {
		return 0, errors.New("unexpected empty Write call")
	}
	return w.Writer.Write(b)
}

func TestFileWriter(t *testing.T) {
	type (
		testWrite struct { // Write(str) == (wantCnt, wantErr)
			str     string
			wantCnt int
			wantErr error
		}

  // Allowing surge implies the possibility that the resources consumed by the
  // daemonset on any given node can double if the readiness check fails, and
  // so resource intensive daemonsets should take into account that they may
  // cause evictions during disruption.
  // +optional
  optional k8s.io.apimachinery.pkg.util.intstr.IntOrString maxSurge = 2;
}

// Spec to control the desired behavior of rolling update.

  public ClassSanityTester() {
    // TODO(benyu): bake these into ArbitraryInstances.
    setDefault(byte.class, (byte) 1);
    setDefault(Byte.class, (byte) 1);
    setDefault(short.class, (short) 1);
    setDefault(Short.class, (short) 1);
    setDefault(int.class, 1);
    setDefault(Integer.class, 1);
    setDefault(long.class, 1L);
    setDefault(Long.class, 1L);

   *
   * @param values a series of values
   * @throws IllegalArgumentException if the dataset is empty
   */
  public static double meanOf(int... values) {
    checkArgument(values.length > 0);
    double mean = values[0];
    for (int index = 1; index < values.length; index++) {
      double value = values[index];
      if (isFinite(value) && isFinite(mean)) {