Home
last modified time | relevance | path

Searched refs:qq_ind (Results 1 – 22 of 22) sorted by relevance

/dports/math/igraph/igraph-0.9.5/vendor/glpk/bflib/
H A Dbtf.c82 int *qq_ind = btf->qq_ind; in btf_make_blocks() local
125 qq_ind[i] = iperm[pp_inv[i]]; in btf_make_blocks()
127 qq_inv[qq_ind[i]] = i; in btf_make_blocks()
145 int *qq_ind = btf->qq_ind; in btf_check_blocks() local
158 xassert(1 <= qq_ind[k] && qq_ind[k] <= n); in btf_check_blocks()
175 j = qq_ind[jj]; in btf_check_blocks()
273 int *qq_ind = btf->qq_ind; in btf_a_solve() local
290 t = x[qq_ind[beg_k]] = in btf_a_solve()
365 int *qq_ind = btf->qq_ind; in btf_at_solve() local
460 int *qq_ind = btf->qq_ind; in btf_at_solve1() local
[all …]
H A Dluf.h143 int *qq_ind; /* int qq_ind[1+n]; */ member
163 i1 = qq_ind[j1], i2 = qq_ind[j2]; \
164 qq_ind[j1] = i2, qq_inv[i2] = j1; \
165 qq_ind[j2] = i1, qq_inv[i1] = j2; \
H A Dscfint.c100 if (fi->scf.qq_ind != NULL) in scfint_factorize()
101 tfree(fi->scf.qq_ind); in scfint_factorize()
110 fi->scf.qq_ind = talloc(1+n0_max+nn_max, int); in scfint_factorize()
127 fi->scf.qq_ind[k] = k; in scfint_factorize()
143 int *qq_ind = fi->scf.qq_ind; in scfint_update() local
235 if (fi->scf.qq_ind != NULL) in scfint_delete()
236 tfree(fi->scf.qq_ind); in scfint_delete()
H A Dsgf.c78 int *qq_ind = luf->qq_ind; in sgf_reduce_nuc() local
276 int *qq_ind = luf->qq_ind; in sgf_singl_phase() local
310 vc_len[qq_ind[k]] = 0; in sgf_singl_phase()
333 j = qq_ind[k]; in sgf_singl_phase()
349 j = qq_ind[k]; in sgf_singl_phase()
1120 int *qq_ind = luf->qq_ind; in sgf_dense_phase() local
1129 vc_len[qq_ind[jj]] = 0; in sgf_dense_phase()
1184 qq_inv[qq_ind[jj]] = jj; in sgf_dense_phase()
1221 { sv_ind[ptr] = qq_ind[k-1+ja]; in sgf_dense_phase()
1314 int *qq_ind = luf->qq_ind; in sgf_factorize() local
[all …]
H A Dbtfint.c53 int *qq_ind = btf->qq_ind; in factorize_triv() local
66 j = qq_ind[beg_k]; in factorize_triv()
115 int *qq_ind = btf->qq_ind; in factorize_block() local
137 luf.qq_ind = btf->q1_ind + (beg_k-1); in factorize_block()
145 j = qq_ind[jj + (beg_k-1)]; in factorize_block()
246 tfree(btf->qq_ind); in btfint_factorize()
257 btf->qq_ind = talloc(1+n_max, int); in btfint_factorize()
379 tfree(btf->qq_ind); in btfint_delete()
H A Dluf.c97 int *qq_ind = luf->qq_ind; in luf_check_all() local
112 xassert(qq_ind[jj] == j); in luf_check_all()
551 int *qq_ind = luf->qq_ind; in luf_v_solve() local
558 j = qq_ind[k]; in luf_v_solve()
593 int *qq_ind = luf->qq_ind; in luf_vt_solve() local
600 j = qq_ind[k]; in luf_vt_solve()
637 int *qq_ind = luf->qq_ind; in luf_vt_solve1() local
644 j = qq_ind[k]; in luf_vt_solve1()
H A Dfhv.c162 int *qq_ind = luf->qq_ind; in fhv_ft_update() local
313 xassert(p == pp_inv[s] && q == qq_ind[s]); in fhv_ft_update()
316 qq_inv[qq_ind[k] = qq_ind[k+1]] = k; in fhv_ft_update()
319 pp_ind[pp_inv[t] = p] = qq_inv[qq_ind[t] = q] = t; in fhv_ft_update()
383 i = pp_inv[k], j = qq_ind[k]; in fhv_ft_update()
445 j = qq_ind[k]; in fhv_ft_update()
H A Dscf.h137 int *qq_ind; /* int qq_ind[1+n0+nn_max]; */ member
147 qq_ind[i1] = j2, qq_inv[j2] = i1; \
148 qq_ind[i2] = j1, qq_inv[j1] = i2; \
H A Dlufint.c83 tfree(luf->qq_ind); in lufint_factorize()
89 luf->qq_ind = talloc(1+n_max, int); in lufint_factorize()
160 tfree(luf->qq_ind); in lufint_delete()
H A Dscf.c303 int *qq_ind = scf->qq_ind; in scf_at_solve() local
307 { i = qq_ind[ii]; in scf_at_solve()
516 scf->qq_ind[k] = scf->qq_inv[k] = k; in scf_update_aug()
H A Dbtf.h88 int *qq_ind; /* int qq_ind[1+n]; */ member
/dports/math/glpk/glpk-5.0/src/bflib/
H A Dbtf.c82 int *qq_ind = btf->qq_ind; in btf_make_blocks() local
125 qq_ind[i] = iperm[pp_inv[i]]; in btf_make_blocks()
127 qq_inv[qq_ind[i]] = i; in btf_make_blocks()
145 int *qq_ind = btf->qq_ind; in btf_check_blocks() local
158 xassert(1 <= qq_ind[k] && qq_ind[k] <= n); in btf_check_blocks()
175 j = qq_ind[jj]; in btf_check_blocks()
273 int *qq_ind = btf->qq_ind; in btf_a_solve() local
290 t = x[qq_ind[beg_k]] = in btf_a_solve()
365 int *qq_ind = btf->qq_ind; in btf_at_solve() local
460 int *qq_ind = btf->qq_ind; in btf_at_solve1() local
[all …]
H A Dluf.h143 int *qq_ind; /* int qq_ind[1+n]; */ member
163 i1 = qq_ind[j1], i2 = qq_ind[j2]; \
164 qq_ind[j1] = i2, qq_inv[i2] = j1; \
165 qq_ind[j2] = i1, qq_inv[i1] = j2; \
H A Dscfint.c100 if (fi->scf.qq_ind != NULL) in scfint_factorize()
101 tfree(fi->scf.qq_ind); in scfint_factorize()
110 fi->scf.qq_ind = talloc(1+n0_max+nn_max, int); in scfint_factorize()
127 fi->scf.qq_ind[k] = k; in scfint_factorize()
143 int *qq_ind = fi->scf.qq_ind; in scfint_update() local
235 if (fi->scf.qq_ind != NULL) in scfint_delete()
236 tfree(fi->scf.qq_ind); in scfint_delete()
H A Dsgf.c78 int *qq_ind = luf->qq_ind; in sgf_reduce_nuc() local
276 int *qq_ind = luf->qq_ind; in sgf_singl_phase() local
310 vc_len[qq_ind[k]] = 0; in sgf_singl_phase()
333 j = qq_ind[k]; in sgf_singl_phase()
349 j = qq_ind[k]; in sgf_singl_phase()
1120 int *qq_ind = luf->qq_ind; in sgf_dense_phase() local
1129 vc_len[qq_ind[jj]] = 0; in sgf_dense_phase()
1184 qq_inv[qq_ind[jj]] = jj; in sgf_dense_phase()
1221 { sv_ind[ptr] = qq_ind[k-1+ja]; in sgf_dense_phase()
1314 int *qq_ind = luf->qq_ind; in sgf_factorize() local
[all …]
H A Dbtfint.c53 int *qq_ind = btf->qq_ind; in factorize_triv() local
66 j = qq_ind[beg_k]; in factorize_triv()
115 int *qq_ind = btf->qq_ind; in factorize_block() local
137 luf.qq_ind = btf->q1_ind + (beg_k-1); in factorize_block()
145 j = qq_ind[jj + (beg_k-1)]; in factorize_block()
246 tfree(btf->qq_ind); in btfint_factorize()
257 btf->qq_ind = talloc(1+n_max, int); in btfint_factorize()
379 tfree(btf->qq_ind); in btfint_delete()
H A Dluf.c97 int *qq_ind = luf->qq_ind; in luf_check_all() local
112 xassert(qq_ind[jj] == j); in luf_check_all()
551 int *qq_ind = luf->qq_ind; in luf_v_solve() local
558 j = qq_ind[k]; in luf_v_solve()
593 int *qq_ind = luf->qq_ind; in luf_vt_solve() local
600 j = qq_ind[k]; in luf_vt_solve()
637 int *qq_ind = luf->qq_ind; in luf_vt_solve1() local
644 j = qq_ind[k]; in luf_vt_solve1()
H A Dfhv.c162 int *qq_ind = luf->qq_ind; in fhv_ft_update() local
313 xassert(p == pp_inv[s] && q == qq_ind[s]); in fhv_ft_update()
316 qq_inv[qq_ind[k] = qq_ind[k+1]] = k; in fhv_ft_update()
319 pp_ind[pp_inv[t] = p] = qq_inv[qq_ind[t] = q] = t; in fhv_ft_update()
383 i = pp_inv[k], j = qq_ind[k]; in fhv_ft_update()
445 j = qq_ind[k]; in fhv_ft_update()
H A Dscf.h137 int *qq_ind; /* int qq_ind[1+n0+nn_max]; */ member
147 qq_ind[i1] = j2, qq_inv[j2] = i1; \
148 qq_ind[i2] = j1, qq_inv[j1] = i2; \
H A Dlufint.c83 tfree(luf->qq_ind); in lufint_factorize()
89 luf->qq_ind = talloc(1+n_max, int); in lufint_factorize()
160 tfree(luf->qq_ind); in lufint_delete()
H A Dscf.c303 int *qq_ind = scf->qq_ind; in scf_at_solve() local
307 { i = qq_ind[ii]; in scf_at_solve()
516 scf->qq_ind[k] = scf->qq_inv[k] = k; in scf_update_aug()
H A Dbtf.h88 int *qq_ind; /* int qq_ind[1+n]; */ member