Module example.com/retract/self/prerelease is a module that retracts its own
latest version and all other release version.

A pre-release version higher than the highest release version is still
available, and that should be matched by @latest.

-- .mod --
module example.com/retract/self/prerelease

go 1.15

-- .info --
{"Version":"v1.9.1-pre"}

-- p.go --

Module example.com/retract/self/prerelease is a module that retracts its own
latest version and all other release version.

A pre-release version higher than the highest release version is still
available, and that should be matched by @latest.

-- .mod --
module example.com/retract/self/prerelease

go 1.15

retract v1.0.0 // bad
retract v1.9.0 // self

-- .info --
{"Version":"v1.9.0"}

-- p.go --

Module example.com/retract/self/prerelease is a module that retracts its own
latest version and all other release version.

A pre-release version higher than the highest release version is still
available, and that should be matched by @latest.

-- .mod --
module example.com/retract/self/prerelease

go 1.15

-- .info --
{"Version":"v1.0.0"}

-- p.go --

     * from levels higher than the specified granularity will be ignored.
     * <p>The default granularity is -1, which specifies that test events from only the most granular level should be logged.  Setting this value to something lower will cause events

** If both parts are numeric, the highest numeric value is **higher**: `1.1` < `1.2`
** If one part is numeric, it is considered **higher** than the non-numeric part: `1.a` < `1.1`
** If both are non-numeric, the parts are compared **alphabetically**, in a **case-sensitive** manner: `1.A` < `1.B` < `1.a` < `1.b`
** A version with an extra numeric part is considered **higher** than a version without (even when it's zero): `1.1` < `1.1.0`

    /**
     * Sets the order of precedence of attributes when resolving ambiguity. Attributes listed first have higher precedence.
     * <p>
     * By default, there is no explicit precedence between attributes and all attributes must be considered when disambiguating.
     *
     * @param attributes the attributes in order, highest priority first
     * @since 7.5
     */
    @Incubating

				return int64(math.MinInt64)
			}
			// The bigger the earliestStartTimeOnNode, the higher the score.
			return earliestStartTimeOnNode.UnixNano()
		}

		// Each scoreFunc scores the nodes according to specific rules and keeps the name of the node
		// with the highest score. If and only if the scoreFunc has more than one node with the highest
		// score, we will execute the other scoreFunc in order of precedence.

		h.underflow.Add(1)
		return
	}
	// bucketBit is the target bit for the bucket which is usually the
	// highest 1 bit, but if we're less than the minimum, is the highest
	// 1 bit of the minimum (which will be zero in the duration).
	//
	// bucket is the bucket index, which is the bucketBit minus the
	// highest bit of the minimum, plus one to leave room for the catch-all
	// bucket for samples lower than the minimum.

 * </ul>
 * </li>
 * <li>The equivalent parts of 2 versions are compared using the following rules:
 * <ul>
 *     <li>If both parts are numeric, the highest numeric value is <b>higher</b>: `1.1 {@literal <} 1.2`</li>
 *     <li>If one part is numeric, it is considered <b>higher</b> than the non-numeric part: `1.a {@literal <} 1.1`</li>

			return 0
		}
		return nodeScore / weightSum
	}
}

// The unused capacity is calculated on a scale of 0-MaxNodeScore
// 0 being the lowest priority and `MaxNodeScore` being the highest.
// The more unused resources the higher the score is.
func leastRequestedScore(requested, capacity int64) int64 {
	if capacity == 0 {
		return 0
	}
	if requested > capacity {
		return 0
	}