func DestructivelyPrioritizeReplacementCandidates(cs []CandidateWithTime, primaryDigest, uncompressedDigest digest.Digest) []types.BICReplacementCandidate {
	return destructivelyPrioritizeReplacementCandidatesWithMax(cs, primaryDigest, uncompressedDigest, replacementAttempts)
}
func DestructivelyPrioritizeReplacementCandidates(cs []CandidateWithTime, primaryDigest, uncompressedDigest digest.Digest) []types.BICReplacementCandidate {
	return destructivelyPrioritizeReplacementCandidatesWithMax(cs, primaryDigest, uncompressedDigest, replacementAttempts)
}
func DestructivelyPrioritizeReplacementCandidates ( cs [ ] CandidateWithTime , primaryDigest , uncompressedDigest digest . Digest ) [ ] types . BICReplacementCandidate { return destructivelyPrioritizeReplacementCandidatesWithMax ( cs , primaryDigest , uncompressedDigest , replacementAttempts ) }
// DestructivelyPrioritizeReplacementCandidates consumes AND DESTROYS an array of possible replacement candidates with their last known existence times,
// the primary digest the user actually asked for, and the corresponding uncompressed digest (if known, possibly equal to the primary digest),
// and returns an appropriately prioritized and/or trimmed result suitable for a return value from types.BlobInfoCache.CandidateLocations.
//
// WARNING: The array of candidates is destructively modified. (The implementation of this function could of course
// make a copy, but all CandidateLocations implementations build the slice of candidates only for the single purpose of calling this function anyway.)
DestructivelyPrioritizeReplacementCandidates consumes AND DESTROYS an array of possible replacement candidates with their last known existence times the primary digest the user actually asked for and the corresponding uncompressed digest ( if known possibly equal to the primary digest ) and returns an appropriately prioritized and / or trimmed result suitable for a return value from types . BlobInfoCache . CandidateLocations . WARNING : The array of candidates is destructively modified . ( The implementation of this function could of course make a copy but all CandidateLocations implementations build the slice of candidates only for the single purpose of calling this function anyway . )