input | ordinal
        0     | "0th"
        1     | "1st"
        2     | "2nd"
        3     | "3rd"
        4     | "4th"
        10    | "10th"
        11    | "11th"
        12    | "12th"
        13    | "13th"
        14    | "14th"
        20    | "20th"
        21    | "21st"
        22    | "22nd"
        23    | "23rd"
        24    | "24th"
        100   | "100th"

			description:    "1st IP address indexed with IPv4",
		},
		{
			clusterCIDRStr: "127.123.0.0/16",
			subnetMaskSize: 24,
			index:          15,
			CIDRBlock:      "127.123.15.0/24",
			description:    "16th IP address indexed with IPv4",
		},
		{
			clusterCIDRStr: "192.168.5.219/28",
			subnetMaskSize: 32,
			index:          5,
			CIDRBlock:      "192.168.5.213/32",

 * limitations under the License.
 */

@groovy.transform.CompileStatic
void createDeprecations(int iterations) {
    for (int i = 0; i < iterations; i++) {
        // every 10th deprecation should have a different message
        if (i % 10 == 0) {
            nagUserOfDeprecated("Some unique deprecation No #\$i")
        }
        nagUserOfDeprecated("Some repetitive Deprecation")
    }
}

connate with the Rays, and immutable; as may appear by the 13th, 14th, and 15th Observations, compared with the fourth and eighteenth. By the Precedent Observations it appears also, that whiteness is a dissimilar mixture of all Colours, and that Light is a mixture of Rays endued with all those Colours. For, considering the multitude of the Rings of Colours in the 3d, 12th, and 24th Observations, it is manifest, that although in the 4th and 18th Observations there appear no more than eight or nine of...

immutable; as may appear by the 13th, 14th, and 15th Observations,
compared with the fourth and eighteenth.

By the Precedent Observations it appears also, that whiteness is a
dissimilar mixture of all Colours, and that Light is a mixture of Rays
endued with all those Colours. For, considering the multitude of the
Rings of Colours in the 3d, 12th, and 24th Observations, it is manifest,

            return result.toPlainString() + UNITS.get(baseExponent);
        }
    }

    /**
     * gets ordinal String representation of given value (e.g. 1 -> 1st, 12 -> 12th, 22 -> 22nd, etc.)
     */
    public static String ordinal(int value) {
        switch (value % 100) {
            case 11:
            case 12:
            case 13:

			checker: func(t *testing.T, c []gcCycleResult) {
				n := len(c)
				if n > 13 {
					// After the 12th GC, the heap will stop growing. Now, just make sure that:
					// 1. Utilization isn't varying _too_ much, and
					// 2. The pacer is mostly keeping up with the goal.
					// We start at the 13th here because we want to use the 12th as a reference.
					assertInRange(t, "goal ratio", c[n-1].goalRatio(), 0.95, 1.05)

		assert.Empty(t, tracker.pods)
		metrics.PodStartSLIDuration.Reset()
	})
}

func TestSinglePodMultipleDownloadsAndRestartsRecorded(t *testing.T) {

	t.Run("single pod; started in 30s, image pulling between 10th and 20th seconds", func(t *testing.T) {

		wants := `

		if err != nil {
			scannerLogIf(ctx, err)
			continue
		}
		if attempts > 10 {
			saveConfig(ctx, objAPI, dataUsageObjNamePath+".bkp", dataUsageJSON) // Save a backup every 10th update.
			attempts = 1
		}
		if err = saveConfig(ctx, objAPI, dataUsageObjNamePath, dataUsageJSON); err != nil {
			scannerLogOnceIf(ctx, err, dataUsageObjNamePath)
		}
		attempts++
	}
}

			in:        []byte{0xd7, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x01},
			wantN:     -11,
			wantValue: 0,
		},
		{
			name:      "invalid: 10th byte",
			in:        []byte{0xd7, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x7f},
			wantN:     -10,
			wantValue: 0,
		},
	}

	for _, tt := range tests {
		tt := tt