if (maybeExpand && uniques * 4 > length * 3) {
        // lots of nonduplicated elements, expand the array by 50%
        sortedElements =
            Arrays.copyOf(sortedElements, IntMath.saturatedAdd(length, length / 2 + 1));
      }
      int[] sortedCounts = new int[sortedElements.length];
      for (int i = 0; i < length; i++) {
        int index = Arrays.binarySearch(sortedElements, 0, uniques, elements[i], comparator);

			}
		}
	}
	return len(errs) == notFoundCount
}

// ObjectDir is considered dangling/corrupted if any only
// if total disks - a combination of corrupted and missing
// files is lesser than N/2+1 number of disks.
// If no files were found false will be returned.
func isObjectDirDangling(errs []error) (ok bool) {
	var found int
	var notFound int
	var foundNotEmpty int
	var otherFound int

    name: minio
    sources:
    - https://github.com/minio/minio
    urls:
    - https://charts.min.io/helm-releases/minio-3.6.0.tgz
    version: 3.6.0
  - apiVersion: v1
    appVersion: RELEASE.2022-03-03T21-21-16Z
    created: "2025-01-02T21:34:25.067175653-08:00"
    description: Multi-Cloud Object Storage
    digest: 6fda968d3fdfd60470c0055a4e1a3bd8e5aee9ad0af5ba2fb7b7b926fdc9e4a0
    home: https://min.io

common:rbe_cross_compile_macos_x86 --jobs=100
test:rbe_cross_compile_macos_x86 --jobs=100
# END MACOS CROSS-COMPILE CONFIGS
# END CROSS-COMPILE CONFIGS

# Enable Java 21 language features
common --java_runtime_version=remotejdk_21

                  return false;
                }
              }
              return true;
            };
    TypeWithDuplicates a = new TypeWithDuplicates(1, 1);
    TypeWithDuplicates b1 = new TypeWithDuplicates(2, 1);
    TypeWithDuplicates b2 = new TypeWithDuplicates(2, 2);
    TypeWithDuplicates c = new TypeWithDuplicates(3, 1);
    CollectorTester.of(collector, equivalence)

        target.append(encoding[b | 0x100]);
      }
    }

    @Override
    int decodeTo(byte[] target, CharSequence chars) throws DecodingException {
      checkNotNull(target);
      if (chars.length() % 2 == 1) {
        throw new DecodingException("Invalid input length " + chars.length());
      }
      int bytesWritten = 0;
      for (int i = 0; i < chars.length(); i += 2) {

			}
		}
		// Log disk errors.
		peersLogIf(context.Background(), errors.Join(errs...))
		return false, fmt.Errorf("not enough online disks to calculate the available space, need %d, found %d", (len(di)/2)+1, nDisks)
	}

	// Check we have enough on each disk, ignoring diskFillFraction.
	perDisk := size / int64(nDisks)
	for _, disk := range di {
		if disk == nil || disk.Total == 0 {
			continue
		}

HSPLokhttp3/HttpUrl;->hashCode()I
HSPLokhttp3/HttpUrl;->redact()Ljava/lang/String;
HSPLokhttp3/HttpUrl;->toString()Ljava/lang/String;
HSPLokhttp3/HttpUrl;->uri()Ljava/net/URI;
HSPLokhttp3/JvmCallExtensionsKt$executeAsync$2$1;-><init>(Lokhttp3/Call;)V
HSPLokhttp3/JvmCallExtensionsKt$executeAsync$2$2$onResponse$1;-><init>(Lokhttp3/Call;)V
HSPLokhttp3/JvmCallExtensionsKt$executeAsync$2$2;-><init>(Lkotlinx/coroutines/CancellableContinuation;)V

following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _110 = 2*_11 // _111 = 1 + _110 // _111000 = _111 << 3 // _111111 = _111 + _111000 // x12 = _111111 << 6 + _111111 // x15 = x12 << 3 + _111 // x16 = 2*x15 + 1 // x32 = x16 << 16 + x16 // i53 = x32 << 15 // x47 = x15 + i53 // i263 = ((i53 << 17 + 1) << 143 + x47) << 47 // return (x47 + i263) << 2 + 1 // var z = new(P256Element).Set(e) var t0 = new(P256Element) var t1 = new(P256Element) z.Square(x)...

          "plugins-java"
        ],
        "parallelizationMethod": {
          "name": "TestDistribution"
        }
      }
    ]
  },
  {
    "testCoverageUuid": 21,
    "buckets": [
      {
        "subprojects": [
          "core"
        ],
        "parallelizationMethod": {
          "name": "TestDistribution"
        }
      },
      {