| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/number_fields/algebraic_num/ |
| H A D | module.cc | 101 if (B.get_no_of_columns() != O1->degree()) in module()
189 if (base.get_no_of_columns() != n) in is_whole_order()
219 lidia_size_t n = base.get_no_of_columns(); in invert()
239 n = base.get_no_of_columns(); in invert()
392 + multhelp2.get_no_of_columns() << "matrix"); in add()
394 + multhelp2.get_no_of_columns(), d); in add()
460 + tmp2.get_no_of_columns(), d); in intersect()
469 tmp.set_no_of_columns(kern.get_no_of_columns()); in intersect()
547 = a.base.get_no_of_columns()*b.base.get_no_of_columns(); in multiply()
740 lidia_size_t m = tmp.get_no_of_columns(); in divide()
[all …]
|
| H A D | ideal.cc | 148 * (b.base.get_no_of_columns()+1) - 1, d); in multiply()
161 for (i = 0; i < a.base.get_no_of_columns(); i++) { in multiply()
229 a.base.get_no_of_columns()*(a.base.get_no_of_columns()+1)/2); in square()
231 tmp1.set_no_of_columns(a.base.get_no_of_columns()*(a.base.get_no_of_columns()+1)/2); in square()
242 for (i = 0; i < a.base.get_no_of_columns(); i++) { in square()
296 lidia_size_t n = a.base.get_no_of_columns(); in multiply()
348 lidia_size_t n = a.base.get_no_of_columns(); in multiply()
420 for (i = 0; i < abase.get_no_of_columns(); i++) { in divide()
491 lidia_size_t n = b.base.get_no_of_columns(); in divide()
623 if (base.get_no_of_columns()!= n)
[all …]
|
| H A D | alg_factor.cc | 274 c0 = I.get_no_of_columns(); in operator *()
275 c1 = J.get_no_of_columns(); in operator *()
541 k = V.get_no_of_columns(), in basis_completion()
562 lidia_size_t g2 = W.get_no_of_columns(); in basis_completion()
617 l = I.get_no_of_columns(); in maximality_test()
633 lidia_size_t h_b = O.get_no_of_columns(); in maximality_test()
651 if (K.get_no_of_columns() == 1) return true; in maximality_test()
712 l = I.get_no_of_columns(); in factor()
756 noc = gA.get_no_of_columns(); in factor()
780 h_b = O.get_no_of_columns(); in factor()
[all …]
|
| H A D | order.cc | 55 return table.get_no_of_columns(); in degree()
64 if (table.get_no_of_columns() == 1) { in compute_conjugates()
358 if (solution.get_no_of_columns() != 2) { in get_one()
409 if (conjugates.get_no_of_columns() <= 1 || in get_conjugate()
423 if (conjugates.get_no_of_columns() <= 1 || in get_conjugates()
436 if (table.get_no_of_columns() == 1) in which_polynomial()
510 if (input.base.get_no_of_columns() != 1 && in operator >>()
545 if ((input.table.get_no_of_columns() == 1) in operator >>()
754 if (base->table.get_no_of_columns() == 1) in no_of_real_embeddings()
844 if (base1->base.get_no_of_columns() > 1) { in order()
[all …]
|
| H A D | prime_ideal.cc | 65 f = a.degree() - M.coeff_matrix().get_no_of_columns(); in prime_ideal()
77 } while (P2.coeff_matrix().get_no_of_columns() < in prime_ideal()
78 P1.coeff_matrix().get_no_of_columns() || in prime_ideal()
|
| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/lattices/ |
| H A D | lattice_gensys.cc | 360 lidia_size_t columns = get_no_of_columns(); in member()
394 lidia_size_t columns = get_no_of_columns(); in member()
424 lidia_size_t columns = get_no_of_columns(); in member()
452 lidia_size_t columns = get_no_of_columns(); in member()
477 lidia_size_t columns = get_no_of_columns(); in member()
501 lidia_size_t columns = get_no_of_columns(); in sto()
531 lidia_size_t columns = get_no_of_columns(); in sto()
556 lidia_size_t columns = get_no_of_columns(); in sto()
590 return (lbi->get_no_of_columns()); in get_no_of_columns()
592 return (lbf->get_no_of_columns()); in get_no_of_columns()
[all …]
|
| H A D | bil_alg3.cc | 50 #define MGET_C(a, b, t) (a = (b).get_no_of_columns())
69 if (n != Q.get_no_of_columns() || n != A.get_no_of_rows() || n != A.get_no_of_columns()) in quad_erg()
160 if (n != Q.get_no_of_columns() || n != R.get_no_of_rows() || n != R.get_no_of_columns()) { in cho_from_quad()
192 const long columns = R.get_no_of_columns(); in sort_columns()
|
| H A D | lattice_appl.cc | 63 << A.get_no_of_columns() << std::endl; in main_LiDIA()
|
| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/number_fields/quadratic_order/ |
| H A D | qo_subexp.cc | 366 A1cols = A1.get_no_of_columns(); in qo_hnf_and_det()
522 TR.set_no_of_columns(AMAT.get_no_of_columns()); in qo_hnf_and_det()
529 for (j = 0; j < AMAT.get_no_of_columns(); ++j) { in qo_hnf_and_det()
610 bad_cols = new int[RHNF.get_no_of_columns()]; in qo_hnf_and_det()
1198 Acols = AMAT.get_no_of_columns(); in qo_relations_randexp()
1199 A1cols = A1.get_no_of_columns(); in qo_relations_randexp()
1569 curr_A1 = RHNF.get_no_of_columns(); in cg_randexp()
1810 Acols = AMAT.get_no_of_columns(); in qo_relations_mpqs()
1811 A1cols = A1.get_no_of_columns(); in qo_relations_mpqs()
2270 curr_A1 = RHNF.get_no_of_columns(); in cg_mpqs()
[all …]
|
| H A D | qo_util.cc | 130 rank = Bmat.get_no_of_columns(); in decode_vector()
|
| H A D | quadratic_order3.cc | 2083 c = M.get_no_of_columns(); in remove_one_from_unit_array()
2819 std::cout << M.get_no_of_columns() << " units given." << std::endl; in find_generating_unit()
2861 std::cout << M.get_no_of_columns() << " remain after removing +-1." << std::endl; in find_generating_unit()
2864 if (M.get_no_of_columns() <= 1) { in find_generating_unit()
2867 std::cout << M.get_no_of_columns() << " units remain." << std::endl; in find_generating_unit()
2882 lidia_size_t c = M.get_no_of_columns(); in find_generating_unit()
2988 nofc = M.get_no_of_columns(); in estimate_pp_accuracy()
3055 nofc = M.get_no_of_columns(); in precompute_logarithm_bases()
|
| /dports/math/latte-integrale/latte-version_1_7_6/code/latte/genFunction/ |
| H A D | NTL_to_LiDIA.cpp | 106 int cols = lidia_m.get_no_of_columns(); in convert_bigint_matrix_to_mat_ZZ()
132 int cols = m.get_no_of_columns(); in print_debug_matrix()
|
| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/base/simple_classes/chinese_rem/ |
| H A D | crt.cc | 451 bcol = big_mat.get_no_of_columns (); in reduce()
573 bcol = big_mat.get_no_of_columns (); in reduce()
799 scol = small_mat.get_no_of_columns (); in combine()
801 Hcol = Hmat.get_no_of_columns (); in combine()
1062 Hcol = Hmat.get_no_of_columns (); in get_result()
1277 Hcol = Hmat.get_no_of_columns (); in get_result()
|
| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/base/simple_classes/ |
| H A D | matrix_GL2Z.cc | 63 if ((A.get_no_of_rows() != 2) || (A.get_no_of_columns() != 2)) { in matrix_GL2Z()
110 if ((A.get_no_of_rows() != 2) || (A.get_no_of_columns() != 2)) { in assign()
|
| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/linear_algebra/ |
| H A D | ring_matrix_appl_long.dat | 317 testing get_no_of_columns
|
| H A D | ring_matrix_appl_bigint.dat | 317 testing get_no_of_columns
|
| H A D | ring_matrix_appl_int.dat | 317 testing get_no_of_columns
|
| H A D | bigint_matrix_appl.dat | 268 testing get_no_of_columns
|
| H A D | trans_matrix.cc | 260 ii = tran.get_no_of_columns(); in set_no_of_columns()
311 ii = TR[i].get_no_of_columns(); in set_no_of_columns()
341 trans_matrix::get_no_of_columns() in get_no_of_columns() function in LiDIA::trans_matrix
|
| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/base/matrix/ |
| H A D | sparse_ring_matrix_appl_bigint.dat | 317 testing get_no_of_columns
|
| H A D | sparse_ring_matrix_appl_long.dat | 317 testing get_no_of_columns
|
| H A D | dense_ring_matrix_appl_long.dat | 317 testing get_no_of_columns
|
| H A D | dense_ring_matrix_appl_bigint.dat | 317 testing get_no_of_columns
|
| H A D | dense_ring_matrix_appl_int.dat | 317 testing get_no_of_columns
|
| H A D | sparse_ring_matrix_appl_int.dat | 317 testing get_no_of_columns
|