testHash.C

Go to the documentation of this file.

 
/* Aleph-w
 
     / \  | | ___ _ __ | |__      __      __
    / _ \ | |/ _ \ '_ \| '_ \ ____\ \ /\ / / Data structures & Algorithms
   / ___ \| |  __/ |_) | | | |_____\ V  V /  version 1.9c
  /_/   \_\_|\___| .__/|_| |_|      \_/\_/   https://github.com/lrleon/Aleph-w
                 |_|         
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2018 Leandro Rabindranath Leon 
 
  This program is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
 
  This program 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
  General Public License for more details.
 
  You should have received a copy of the GNU General Public License
  along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
 
# include <ctime>
 
# include <gsl/gsl_rng.h>
 
# include <tclap/CmdLine.h>
 
# include <iostream>
# include <aleph.H>
# include <tpl_dynSetHash.H>
 
# include <cassert>
using namespace std;
# include <cassert>
using namespace TCLAP;
 
CmdLine cmd = { "testHash", ' ', "0" };
 
ValueArg<size_t> num_keys =
  { "n", "num", "num of keys", false, 10, "num of keys", cmd };
 
ValueArg<size_t> seed = { "s", "seed", "seed", false, (size_t) time(nullptr),
        "seed for random", cmd };
 
void test(size_t n, unsigned long seed)
{
  gsl_rng * r = gsl_rng_alloc(gsl_rng_mt19937);
  gsl_rng_set(r, seed % gsl_rng_max(r));
 
  DynMapHash<size_t, string> tbl;
  DynArray<pair<size_t, string>> a;
 
  for (size_t i = 0; i < n; ++i)
    {
      unsigned long val = gsl_rng_get(r);
      const string sval = to_string(val);
      a.append(make_pair(i, sval));
      tbl.insert(i, sval);
    }
 
  tbl.for_each([] (auto p) { cout << p.first << ", " << p.second << endl; });
 
  for (auto it = tbl.get_it(); it.has_curr(); it.next())
    {
      auto p = it.get_curr();
      auto key = p.first;
      auto ptr = tbl.search(key);
      cout << key << " == " << ptr->first << " " << p.second << " == "
     << ptr->second << endl;
      assert(key == ptr->first);
      assert(p.second == ptr->second);
    }
 
  for (size_t i = 0; i < n; ++i)
    {
      auto p1 = a(i);
      auto ptr = tbl.search(p1.first);
      assert(p1.first == ptr->first);
      assert(p1.second == ptr->second);
    }
 
  gsl_rng_free(r);
}
 
int main(int argc, char *argv[])
{
  cmd.parse(argc, argv);
  test(num_keys.getValue(), seed.getValue());
}