mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-28 22:45:50 +03:00
51 lines
1.1 KiB
C++
51 lines
1.1 KiB
C++
#include "util/probing_hash_table.hh"
|
|
|
|
#define BOOST_TEST_MODULE ProbingHashTableTest
|
|
#include <boost/test/unit_test.hpp>
|
|
#include <boost/scoped_array.hpp>
|
|
#include <boost/functional/hash.hpp>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdint.h>
|
|
|
|
namespace util {
|
|
namespace {
|
|
|
|
struct Entry {
|
|
unsigned char key;
|
|
typedef unsigned char Key;
|
|
|
|
unsigned char GetKey() const {
|
|
return key;
|
|
}
|
|
|
|
uint64_t GetValue() const {
|
|
return value;
|
|
}
|
|
|
|
uint64_t value;
|
|
};
|
|
|
|
typedef ProbingHashTable<Entry, boost::hash<unsigned char> > Table;
|
|
|
|
BOOST_AUTO_TEST_CASE(simple) {
|
|
size_t size = Table::Size(10, 1.2);
|
|
boost::scoped_array<char> mem(new char[size]);
|
|
memset(mem.get(), 0, size);
|
|
|
|
Table table(mem.get(), size);
|
|
const Entry *i = NULL;
|
|
BOOST_CHECK(!table.Find(2, i));
|
|
Entry to_ins;
|
|
to_ins.key = 3;
|
|
to_ins.value = 328920;
|
|
table.Insert(to_ins);
|
|
BOOST_REQUIRE(table.Find(3, i));
|
|
BOOST_CHECK_EQUAL(3, i->GetKey());
|
|
BOOST_CHECK_EQUAL(static_cast<uint64_t>(328920), i->GetValue());
|
|
BOOST_CHECK(!table.Find(2, i));
|
|
}
|
|
|
|
} // namespace
|
|
} // namespace util
|