/usr/include/fplll/enum/enumerate.h is in libfplll-dev 5.0.3-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 | /* Copyright (C) 2008-2011 Xavier Pujol
(C) 2015 Michael Walter.
(C) 2016 Marc Stevens. (generic improvements, auxiliary solutions, subsolutions)
This file is part of fplll. fplll is free software: you
can redistribute it and/or modify it under the terms of the GNU Lesser
General Public License as published by the Free Software Foundation,
either version 2.1 of the License, or (at your option) any later version.
fplll is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with fplll. If not, see <http://www.gnu.org/licenses/>. */
#ifndef FPLLL_ENUMERATE_H
#define FPLLL_ENUMERATE_H
#include <array>
#include <memory>
#include <fplll/gso.h>
#include <fplll/enum/evaluator.h>
#include <fplll/enum/enumerate_base.h>
FPLLL_BEGIN_NAMESPACE
template<typename FT>
class EnumerationDyn : public EnumerationBase
{
public:
EnumerationDyn(MatGSO<Integer, FT>& gso, Evaluator<FT>& evaluator)
: _gso(gso), _evaluator(evaluator)
{
}
void enumerate(int first, int last,
FT& fmaxdist, long fmaxdistexpo,
const vector<FT>& target_coord = vector<FT>(),
const vector<enumxt>& subtree = vector<enumxt>(),
const vector<enumf>& pruning = vector<enumf>(),
bool dual = false);
inline uint64_t get_nodes() const { return nodes; }
private:
MatGSO<Integer, FT>& _gso;
Evaluator<FT>& _evaluator;
vector<enumf> pruning_bounds;
enumf maxdist;
vector<FT> fx;
void prepare_enumeration(const vector<enumxt>& subtree, bool solvingsvp);
void do_enumerate();
void set_bounds();
virtual void process_solution(enumf newmaxdist);
virtual void process_subsolution(int offset, enumf newdist);
};
template<typename FT>
class Enumeration
{
public:
Enumeration(MatGSO<Integer, FT>& gso, Evaluator<FT>& evaluator)
: enumdyn(new EnumerationDyn<FT>(gso, evaluator))
{
}
void enumerate(int first, int last,
FT& fmaxdist, long fmaxdistexpo,
const vector<FT>& target_coord = vector<FT>(),
const vector<enumxt>& subtree = vector<enumxt>(),
const vector<enumf>& pruning = vector<enumf>(),
bool dual = false)
{
enumdyn->enumerate(first,last,fmaxdist,fmaxdistexpo,target_coord,subtree,pruning,dual);
}
inline uint64_t get_nodes() const { return enumdyn->get_nodes(); }
private:
std::unique_ptr< EnumerationDyn<FT> > enumdyn;
};
FPLLL_END_NAMESPACE
#endif
|