/usr/include/linbox/randiter/random-integer.h is in liblinbox-dev 1.3.2-1.1+b1.
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 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 | /* Copyright (C) 2010 LinBox
* Written by <brice.boyer@imag.fr>
* (adapted form random-prime.h)
*
*
*
* ========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========
*/
/*! @file randiter/random-integer.h
* @ingroup randiter
* @ingroup integer
* @brief Generates random \ref integers.
*/
#ifndef __LINBOX_random_integer_iterator_H
#define __LINBOX_random_integer_iterator_H
#include "linbox/integer.h"
#include "linbox/util/timer.h"
#include "linbox/util/debug.h"
namespace LinBox
{
/*!@brief Random Prime Generator.
* @ingroup integers
* @ingroup randiter
*
* Generates integers of specified length.
* @tparam _Unsigned if \c true, then only non negative integers
* are generated, if \c false, their sign is random.
*/
template<bool _Unsigned=true>
class RandomIntegerIterator {
unsigned int _bits; //!< common lenght of all integers
integer _integer; //!< the generated integer.
public:
/*! Constructor.
* @param bits size of integers (in bits)
* @param seed if \c 0 a seed will be generated, otherwise, the
* provided seed will be use.
*/
RandomIntegerIterator(unsigned int bits = 30, unsigned long seed = 0) :
_bits(bits)
{
linbox_check(bits>1);
if (! seed)
RandomIntegerIterator::setSeed( BaseTimer::seed() );
else
RandomIntegerIterator::setSeed( seed );
integer::random_exact<_Unsigned>(_integer,_bits);
}
typedef integer Integer_Type ;
/** @brief operator++()
* creates a new random integer.
*/
inline RandomIntegerIterator &operator ++ ()
{
integer::random_exact<_Unsigned>(_integer,_bits);
return *this;
}
/** @brief get the random integer.
* returns the actual integer.
*/
const Integer_Type &operator * () const
{
return _integer;
}
/** @brief get the random integer.
* returns the actual integer.
* @warning a new integer is not generated.
*/
const Integer_Type & randomInteger() const
{
return _integer;
}
/** @brief Sets the seed.
* Set the random seed to be \p ul.
* @param ul the new seed.
*/
void static setSeed(unsigned long ul)
{
integer::seeding(ul);
}
};
/*! @brief Random Integer Iterator.
* @ingroup integers
* @ingroup randiter
*
* Generates integers of size smaller than a prescribed one.
* This class is closer to the LinBox::RandIterArchetype.
* @todo
* one could create the same one on a LinBox::PID_double ?
* @tparam _Unsigned if \c true, then only non negative integers
* are generated, if \c false, their sign is random.
*/
template<bool _Unsigned=true>
class RandomIntegerIter {
unsigned int _bits; //!< max length for all integers
integer _seed; //!< the generated integer.
public:
/*! Constructor.
* @param bits max size of integers (in bits)
* @param seed if \c 0 a seed will be generated, otherwise, the
* provided seed will be use.
*/
RandomIntegerIter(unsigned int bits = 30, unsigned long seed = 0) :
_bits(bits)
{
linbox_check(bits>1);
if (! seed)
_seed = BaseTimer::seed() ;
else
_seed = seed ;
integer::seeding(_seed);
}
/// destructor.
~RandomIntegerIter() {}
/// copy constructor.
/// @param R random iterator to be copied.
RandomIntegerIter (const RandomIntegerIter &R) :
_bits(R._bits), _seed(R._seed)
{}
typedef integer Element ;
/// copy.
/// @param R random iterator to be copied.
RandomIntegerIter &operator=(const RandomIntegerIter &R)
{
if (this != &R) {
_bits = R._bits;
_seed = R._seed;
}
return *this;
}
/** @brief get the random integer.
* @param[out] a the new integer number
*/
const integer & random (integer & a) const
{
integer::random_lessthan<_Unsigned>(a,_bits);
return a;
}
void setBits (unsigned int bits)
{
_bits = bits;
}
unsigned int getBits () const
{
return _bits ;
}
};
}
#endif //__LINBOX_random_integer_iterator_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:
|