Algorithms: Array Techniques

int next_greater(const std::vector<int>& a, std::vector<int>& output) {
    alg_require(a.size() <= 1000000);
    alg_require(output.size() <= 1000000);
    int n = (int)a.size();
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((int)a.size() == n));
    alg_require(((int)output.size() == n));
    std::vector<int> stack(alg_size(alg_add(n, 1)), 0);
    int top = 0;
    int i = 0;
    int index = 0;
    while ((i < n)) {

    static int next_greater(ReadOnlySpan<int> a, Span<int> output) {
        checked {
            int n = a.Length;
            alg_require(((n >= 0) && (n <= 1000000)));
            alg_require((a.Length == n));
            alg_require((output.Length == n));
            int[] stack = new int[alg_size((n + 1))];
            int top = 0;
            int i = 0;
            int index = 0;
            while ((i < n)) {
                output[i] = (-1);

function next_greater(array $a, array &$output): int {
    alg_require(array_is_list($a));
    alg_require(array_is_list($output));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    alg_require((count($output) == $n));
    $stack = array_fill(0, alg_size(alg_add($n, 1)), 0);
    $top = 0;
    $i = 0;
    $index = 0;
    while (($i < $n)) {

    static int rotate_right(int[] a, int k) {
        java.util.Objects.requireNonNull(a, "a");
        int n = a.length;
        alg_require(((n >= 0) && (n <= 1000000)));
        alg_require((a.length == n));
        alg_require((k >= 0));
        if ((n == 0)) {
            return 0;
        }
        k = (k % n);
        int phase = 0;
        int left = 0;

function rotate_right(a, k) {
    alg_require(a instanceof Int32Array);
    alg_require(Number.isInteger(k) && k >= -2147483648 && k <= 2147483647);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    alg_require((k >= 0));
    if ((n == 0)) {
        return 0;
    }
    k = (k % n);
    let phase = 0;