1 files changed, 0 insertions, 66 deletions
diff --git a/btl/generic_bench/utils/LinearCongruential.hh b/btl/generic_bench/utils/LinearCongruential.hh
deleted file mode 100644
index 2ab21ae..0000000
--- a/btl/generic_bench/utils/LinearCongruential.hh
+++ /dev/null
@@ -1,66 +0,0 @@
-#ifndef LINEARCONGRUENTIAL_HH_
-#define LINEARCONGRUENTIAL_HH_
-
-#include <vector>
-
-class LinearCongruential
-{
-  typedef std::vector<unsigned> buffer_t;
-  typedef unsigned int_t;
-
-public:
-  LinearCongruential(const int_t& seed) :
-    a_(1664525u), c_(1013904223u), m_(getM()), i_(0)
-  {
-    buffer_.resize(4096/sizeof(unsigned));
-    fillBuffer(seed);
-  }
-
-  int_t a() const { return a_; }
-  int_t c() const { return c_; }
-  int_t m() const { return m_; }
-
-  int_t get_int() {
-    if (i_ >= buffer_.size()) {
-        fillBuffer();
-        i_ = 0;
-    }
-    return buffer_.at(i_++);
-  }
-
-  double get_01() {
-    return static_cast<double>(get_int())/static_cast<double>(m_);
-  }
-
-private:
-  buffer_t buffer_;
-  const int_t a_, c_, m_;
-  std::size_t i_;
-
-  void fillBuffer(const int_t& seed)
-  {
-    buffer_.front() = (seed*a_+c_) & m_;
-    for (
-        typename buffer_t::iterator i = buffer_.begin()+1, end = buffer_.end();
-        i != end; ++i)
-      *i = (*(i-1)*a_ + c_) & m_;
-  }
-
-  void fillBuffer()
-  {
-    const int_t seed = buffer_.back();
-    fillBuffer(seed);
-  }
-
-  static int_t getM()
-  {
-    int_t _m = 1;
-    for (int i = 1; i < 32; ++i) {
-      _m <<= 1;
-      _m += 1;
-    }
-    return _m;
-  }
-};
-
-#endif /* LINEARCONGRUENTIAL_HH_ */