INNER CODE UNIT · C

j

1oom-fork/1oom · src/fmt_mus.c:79

        j = s->top;
        k = -1;
        while ((j >= 0) && (t >= s->tbl[j].t)) {
            k = j;
            j = s->tbl[j].next;
        }
        if (k < 0) {
            n->next = s->top;
            s->top = i;
        } else {
            s->tbl[k].next = i;
            s->tbl[i].next = j;
        }
    }
    if (++s->num > s->max) {
        s->max = s->num;
    }
    return true;

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…