| /dports/math/z3/z3-z3-4.8.13/src/math/polynomial/ |
| H A D | upolynomial_factorization_int.h | 74 for (unsigned i = 0; i < factors.distinct_factors(); ++ i) { in factorization_degree_set()
165 : m_total_size(factors.distinct_factors()), in factorization_combination_iterator_base()
166 m_max_size(factors.distinct_factors()/2), in factorization_combination_iterator_base()
170 SASSERT(factors.total_factors() == factors.distinct_factors()); in factorization_combination_iterator_base()
172 m_enabled.resize(m_factors.distinct_factors(), true); in factorization_combination_iterator_base()
174 m_current.resize(m_factors.distinct_factors()+1, m_factors.distinct_factors()); in factorization_combination_iterator_base()
193 int max_upper_bound = m_factors.distinct_factors(); in next()
300 for (unsigned i = 0; i < m_factors.distinct_factors(); ++ i) { in display()
372 while (current < m_factors.distinct_factors()) { in get_right_tail_coeff()
398 while (current < m_factors.distinct_factors()) { in right()
|
| H A D | polynomial_cache.cpp | 178 void factor(polynomial * p, polynomial_ref_vector & distinct_factors) { in factor()
179 distinct_factors.reset(); in factor()
187 distinct_factors.reset(); in factor()
189 distinct_factors.push_back(old_entry->m_result[i]); in factor()
195 unsigned sz = fs.distinct_factors(); in factor()
200 distinct_factors.push_back(h); in factor()
227 void cache::factor(polynomial const * p, polynomial_ref_vector & distinct_factors) { in factor() argument
228 m_imp->factor(const_cast<polynomial*>(p), distinct_factors); in factor()
|
| H A D | upolynomial_factorization.cpp | 384 for (unsigned i = 0; i < sq_free_factors.distinct_factors(); ++ i) { in zp_factor()
385 unsigned j = factors.distinct_factors(); in zp_factor()
388 for (; j < factors.distinct_factors(); ++ j) { in zp_factor()
421 unsigned first_factor = factors.distinct_factors(); in zp_factor_square_free_berlekamp()
454 unsigned current_factor_end = factors.distinct_factors(); in zp_factor_square_free_berlekamp()
497 if (factors.distinct_factors() - first_factor == r) { in zp_factor_square_free_berlekamp()
838 if (zpe_fs.distinct_factors() != zp_fs.distinct_factors()) { in check_hensel_lift()
901 for (int i = 0, i_end = zp_fs.distinct_factors()-1; i < i_end; ++ i) { in hensel_lift()
1138 if (zp_fs.distinct_factors() == 0 || zp_fs.total_factors() > current_fs.total_factors()) { in factor_square_free()
1179 …() << "(polynomial-factorization :num-candidate-factors " << zpe_fs.distinct_factors() << ")" << s… in factor_square_free()
|
| H A D | polynomial_cache.h | 38 void factor(polynomial const * p, polynomial_ref_vector & distinct_factors);
|
| H A D | upolynomial.h | 74 unsigned distinct_factors() const { return m_factors.size(); } in distinct_factors() function
|
| H A D | algebraic_numbers.cpp | 623 unsigned num_factors = fs.distinct_factors(); in isolate_roots()
1062 unsigned num_fs = fs.distinct_factors(); in mk_binary()
1143 unsigned num_fs = fs.distinct_factors(); in mk_unary()
|
| H A D | polynomial.h | 138 unsigned distinct_factors() const { return m_factors.size(); } in distinct_factors() function
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/math/polynomial/ |
| H A D | upolynomial_factorization_int.h | 74 for (unsigned i = 0; i < factors.distinct_factors(); ++ i) { in factorization_degree_set()
165 : m_total_size(factors.distinct_factors()), in factorization_combination_iterator_base()
166 m_max_size(factors.distinct_factors()/2), in factorization_combination_iterator_base()
170 SASSERT(factors.total_factors() == factors.distinct_factors()); in factorization_combination_iterator_base()
172 m_enabled.resize(m_factors.distinct_factors(), true); in factorization_combination_iterator_base()
174 m_current.resize(m_factors.distinct_factors()+1, m_factors.distinct_factors()); in factorization_combination_iterator_base()
191 int max_upper_bound = m_factors.distinct_factors(); in next()
298 for (unsigned i = 0; i < m_factors.distinct_factors(); ++ i) { in display()
370 while (current < m_factors.distinct_factors()) { in get_right_tail_coeff()
396 while (current < m_factors.distinct_factors()) { in right()
|
| H A D | polynomial_cache.cpp | 178 void factor(polynomial * p, polynomial_ref_vector & distinct_factors) { in factor()
179 distinct_factors.reset(); in factor()
187 distinct_factors.reset(); in factor()
189 distinct_factors.push_back(old_entry->m_result[i]); in factor()
195 unsigned sz = fs.distinct_factors(); in factor()
200 distinct_factors.push_back(h); in factor()
227 void cache::factor(polynomial const * p, polynomial_ref_vector & distinct_factors) { in factor() argument
228 m_imp->factor(const_cast<polynomial*>(p), distinct_factors); in factor()
|
| H A D | upolynomial_factorization.cpp | 384 for (unsigned i = 0; i < sq_free_factors.distinct_factors(); ++ i) { in zp_factor()
385 unsigned j = factors.distinct_factors(); in zp_factor()
388 for (; j < factors.distinct_factors(); ++ j) { in zp_factor()
421 unsigned first_factor = factors.distinct_factors(); in zp_factor_square_free_berlekamp()
454 unsigned current_factor_end = factors.distinct_factors(); in zp_factor_square_free_berlekamp()
497 if (factors.distinct_factors() - first_factor == r) { in zp_factor_square_free_berlekamp()
838 if (zpe_fs.distinct_factors() != zp_fs.distinct_factors()) { in check_hensel_lift()
901 for (int i = 0, i_end = zp_fs.distinct_factors()-1; i < i_end; ++ i) { in hensel_lift()
1138 if (zp_fs.distinct_factors() == 0 || zp_fs.total_factors() > current_fs.total_factors()) { in factor_square_free()
1179 …() << "(polynomial-factorization :num-candidate-factors " << zpe_fs.distinct_factors() << ")" << s… in factor_square_free()
|
| H A D | polynomial_cache.h | 38 void factor(polynomial const * p, polynomial_ref_vector & distinct_factors);
|
| H A D | upolynomial.h | 74 unsigned distinct_factors() const { return m_factors.size(); } in distinct_factors() function
|
| H A D | algebraic_numbers.cpp | 623 unsigned num_factors = fs.distinct_factors(); in isolate_roots()
1062 unsigned num_fs = fs.distinct_factors(); in mk_binary()
1143 unsigned num_fs = fs.distinct_factors(); in mk_unary()
|
| H A D | polynomial.h | 136 unsigned distinct_factors() const { return m_factors.size(); } in distinct_factors() function
|
| /dports/math/singular/Singular-Release-4-2-1/factory/ |
| H A D | cf_cyclo.cc | 115 int* distinct_factors= makeDistinct (prime_factors, prime_factors_length, in cyclotomicPoly() local
124 result= leftShift (result, distinct_factors[i])/result; in cyclotomicPoly()
125 prod *= distinct_factors[i]; in cyclotomicPoly()
127 delete [] distinct_factors; in cyclotomicPoly()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/tactic/arith/ |
| H A D | factor_tactic.cpp | 62 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in mk_eq()
73 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in mk_split_eq()
103 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in mk_comp()
116 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in split_even_odd()
195 SASSERT(fs.distinct_factors() > 0); in factor()
197 if (fs.distinct_factors() == 1 && fs.get_degree(0) == 1) in factor()
|
| /dports/math/z3/z3-z3-4.8.13/src/tactic/arith/ |
| H A D | factor_tactic.cpp | 62 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in mk_eq()
73 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in mk_split_eq()
103 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in mk_comp()
116 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in split_even_odd()
195 SASSERT(fs.distinct_factors() > 0); in factor()
197 if (fs.distinct_factors() == 1 && fs.get_degree(0) == 1) in factor()
|
| /dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/rustfft-5.1.1/src/ |
| H A D | math_utils.rs | 562 distinct_factors: u32, in test_prime_factors() field
570 distinct_factors: u32, in test_prime_factors()
577 distinct_factors, in test_prime_factors()
606 expected.distinct_factors in test_prime_factors()
|
| /dports/math/z3/z3-z3-4.8.13/src/nlsat/tactic/ |
| H A D | goal2nlsat.cpp | 102 SASSERT(fs.distinct_factors() > 0); in factor_atom()
103 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in factor_atom()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/nlsat/tactic/ |
| H A D | goal2nlsat.cpp | 102 SASSERT(fs.distinct_factors() > 0); in factor_atom()
103 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in factor_atom()
|
| /dports/math/z3/z3-z3-4.8.13/src/cmd_context/extra_cmds/ |
| H A D | polynomial_cmds.cpp | 68 unsigned num_factors = fs.distinct_factors(); in factor()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/cmd_context/extra_cmds/ |
| H A D | polynomial_cmds.cpp | 68 unsigned num_factors = fs.distinct_factors(); in factor()
|
| /dports/math/z3/z3-z3-4.8.13/src/test/ |
| H A D | upolynomial.cpp | 891 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in tst_fact()
894 std::cout << fs.distinct_factors() << " " << num_distinct_factors << "\n"; in tst_fact()
895 ENSURE(fs.distinct_factors() == num_distinct_factors); in tst_fact()
|
| H A D | polynomial.cpp | 1024 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in tst_mfact()
1027 ENSURE(fs.distinct_factors() == num_distinct_factors); in tst_mfact()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/test/ |
| H A D | upolynomial.cpp | 891 for (unsigned i = 0; i < fs.distinct_factors(); i++) { in tst_fact()
894 std::cout << fs.distinct_factors() << " " << num_distinct_factors << "\n"; in tst_fact()
895 ENSURE(fs.distinct_factors() == num_distinct_factors); in tst_fact()
|