Home
last modified time | relevance | path

Searched refs:sub_solutions (Results 1 – 5 of 5) sorted by relevance

/dports/math/fplll/fplll-5.4.1/fplll/enum/
H A Devaluator.cpp236 sub_solutions.resize(std::max(sub_solutions.size(), std::size_t(offset + 1))); in eval_sub_sol()
238 if (sub_solutions[offset].second.empty() || dist < sub_solutions[offset].first) in eval_sub_sol()
240 sub_solutions[offset].first = dist; in eval_sub_sol()
241 sub_solutions[offset].second = new_sub_sol_coord; in eval_sub_sol()
243 sub_solutions[offset].second[i] = 0.0; in eval_sub_sol()
335 sub_solutions.resize(std::max(sub_solutions.size(), std::size_t(offset + 1))); in eval_sub_sol()
336 if (sub_solutions[offset].second.empty() || subdist <= sub_solutions[offset].first) in eval_sub_sol()
338 sub_solutions[offset].first = subdist; in eval_sub_sol()
339 sub_solutions[offset].second = new_sub_sol_coord; in eval_sub_sol()
341 sub_solutions[offset].second[i] = 0.0; in eval_sub_sol()
H A Devaluator.h92 std::vector<std::pair<FT, std::vector<FT>>> sub_solutions; variable
171 using Evaluator<FT>::sub_solutions;
196 sub_solutions.resize(std::max(sub_solutions.size(), std::size_t(offset + 1))); in eval_sub_sol()
198 if (sub_solutions[offset].second.empty() || dist < sub_solutions[offset].first) in eval_sub_sol()
200 sub_solutions[offset].first = dist; in eval_sub_sol()
201 sub_solutions[offset].second = new_sub_sol_coord; in eval_sub_sol()
203 sub_solutions[offset].second[i] = 0.0; in eval_sub_sol()
234 using FastEvaluator<FT>::sub_solutions;
/dports/math/py-fpylll/fpylll-0.5.6/src/fpylll/fplll/
H A Denumeration.pyx78 strategy=EvaluatorStrategy.BEST_N_SOLUTIONS, bool sub_solutions=False,
85 :param sub_solutions: Compute sub-solutions
119 self._callback_wrapper[0], NULL, nr_solutions, strategy, sub_solutions)
130 self._callback_wrapper[0], NULL, nr_solutions, strategy, sub_solutions)
523 def sub_solutions(self):
537 >>> [int(round(a)) for a,b in enum.sub_solutions[:5]]
541 cdef list sub_solutions = []
546 _sub_solutions_d = self._eval_core.d.sub_solutions.begin()
547 while _sub_solutions_d != self._eval_core.d.sub_solutions.end():
554 sub_solutions.append(tuple([cur_dist, tuple(cur_sol)]))
[all …]
H A Dfplll.pxd641 vector[pair[FT, vector[FT]]] sub_solutions
660 vector[pair[FT, vector[FT]]] sub_solutions
680 vector[pair[FT, vector[FT]]] sub_solutions
/dports/math/fplll/fplll-5.4.1/fplll/
H A Dsvpcvp.cpp202 subsol_dist->resize(evaluator->sub_solutions.size()); in shortest_vector_ex()
203 for (size_t i = 0; i < evaluator->sub_solutions.size(); ++i) in shortest_vector_ex()
205 (*subsol_dist)[i] = evaluator->sub_solutions[i].first.get_d(); in shortest_vector_ex()
208 for (size_t j = 0; j < evaluator->sub_solutions[i].second.size(); ++j) in shortest_vector_ex()
210 itmp1.set_f(evaluator->sub_solutions[i].second[j]); in shortest_vector_ex()
397 subsol_dist->resize(evaluator->sub_solutions.size()); in shortest_vector_ex()
398 for (size_t i = 0; i < evaluator->sub_solutions.size(); ++i) in shortest_vector_ex()
400 (*subsol_dist)[i] = evaluator->sub_solutions[i].first.get_d(); in shortest_vector_ex()
403 for (size_t j = 0; j < evaluator->sub_solutions[i].second.size(); ++j) in shortest_vector_ex()
405 itmp1.set_f(evaluator->sub_solutions[i].second[j]); in shortest_vector_ex()