varseq_qsort(t.seq, 0, t.last-t.first + 1);
varseq_qsort(t.seq, 0, t.lastVar-t.firstVar + 1); t.firstLevel = bddvar2level[t.seq[0]]; t.lastLevel = bddvar2level[t.seq[t.lastVar-t.firstVar]];
    BddTree reorder_block(BddTree t, int method) {        BddTree dis;        if (t == null)            return null;        if (!t.fixed /*BDD_REORDER_FREE*/            && t.nextlevel != null) {            switch (method) {                case BDD_REORDER_WIN2 :                    t.nextlevel = reorder_win2(t.nextlevel);                    break;                case BDD_REORDER_WIN2ITE :                    t.nextlevel = reorder_win2ite(t.nextlevel);                    break;                case BDD_REORDER_SIFT :                    t.nextlevel = reorder_sift(t.nextlevel);                    break;                case BDD_REORDER_SIFTITE :                    t.nextlevel = reorder_siftite(t.nextlevel);                    break;                case BDD_REORDER_WIN3 :                    t.nextlevel = reorder_win3(t.nextlevel);                    break;                case BDD_REORDER_WIN3ITE :                    t.nextlevel = reorder_win3ite(t.nextlevel);                    break;                case BDD_REORDER_RANDOM :                    t.nextlevel = reorder_random(t.nextlevel);                    break;            }        }        for (dis = t.nextlevel; dis != null; dis = dis.next)            reorder_block(dis, method);        if (t.seq != null) {            //Arrays.sort(t.seq, 0, t.last-t.first + 1);            varseq_qsort(t.seq, 0, t.last-t.first + 1);        }        return t;    }