/usr/include/linbox/randiter/multimod-randomprime.h is in liblinbox-dev 1.4.2-3.
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 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 | /* linbox/randiter/multimod-randomprime.h
* Copyright (C) 2005 Pascal Giorgi
*
* Written by Pascal Giorgi <pascal.giorgi@ens-lyon.fr>
*
* ------------------------------------
*
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox 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.
*
* This library 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 this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*.
*/
#ifndef __LINBOX_multimod_random_prime_H
#define __LINBOX_multimod_random_prime_H
#include "linbox/integer.h"
#include "linbox/util/timer.h"
#include <vector>
namespace LinBox
{
class MultiModRandomPrime {
protected:
uint64_t _bits;
size_t _size;
integer _shift;
public:
MultiModRandomPrime(size_t n=1, uint64_t bits = 30, unsigned long seed = 0) :
_bits(bits), _size(n)
{
_shift = integer(1)<<_bits;
if (! seed)
setSeed( (unsigned long) BaseTimer::seed() );
else
setSeed( seed );
}
// define the prime type
typedef std::vector<integer> Prime_Type;
/** \c randomPrime().
* return a vector of random prime
*/
inline Prime_Type randomPrime() const
{
std::cout<<"ist used\n";
std::vector<integer> tmp(_size);
Givaro::IntPrimeDom IPD;
for (size_t i=0;i<_size; ++i){
do {
integer::random(tmp[i],_bits-1);
tmp[i]= _shift-tmp[i];
IPD.nextprimein(tmp[i]);
}
while (std::find(tmp.begin(), tmp.begin()+(long)i, tmp[i]) != (tmp.begin()+(long)i ));
}
return tmp;
}
/** @c randomPrime(Prime_Type& p).
* return a random prime
*/
inline Prime_Type randomPrime (Prime_Type& p) const
{
Givaro::IntPrimeDom IPD;
for (size_t i=0;i<p.size(); ++i){
do {
integer::random(p[i],_bits-1);
p[i]= _shift-p[i];
IPD.nextprimein(p[i]);
}
while (std::find(p.begin(), p.begin()+(long)(i-1), p[i]) != (p.begin()+(long)(i-1) ));
}
return p;
}
/** @c setSeed(unsigned long ul).
* Set the random seed to be ul.
*/
void static setSeed(unsigned long ul)
{
integer::seeding(ul);
}
inline Prime_Type createPrimes (const integer& maxPrime, const integer& productBound) const
{
Prime_Type tmp;
integer acc=1, cur=maxPrime;
Givaro::IntPrimeDom IPD;
do {
IPD.prevprimein(cur);
tmp.push_back(cur);
acc*=cur;
} while (acc < productBound);
return tmp;
}
};
}
#endif //__LINBOX_multimod_random_prime_H
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|