You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

hash_tests.cpp 1.5KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950
  1. // Copyright (c) 2013 The Bitcoin Core developers
  2. // Distributed under the MIT software license, see the accompanying
  3. // file COPYING or http://www.opensource.org/licenses/mit-license.php.
  4. #include "hash.h"
  5. #include "utilstrencodings.h"
  6. #include "test/test_bitcoin.h"
  7. #include <vector>
  8. #include <boost/test/unit_test.hpp>
  9. using namespace std;
  10. BOOST_FIXTURE_TEST_SUITE(hash_tests, BasicTestingSetup)
  11. BOOST_AUTO_TEST_CASE(murmurhash3)
  12. {
  13. #define T(expected, seed, data) BOOST_CHECK_EQUAL(MurmurHash3(seed, ParseHex(data)), expected)
  14. // Test MurmurHash3 with various inputs. Of course this is retested in the
  15. // bloom filter tests - they would fail if MurmurHash3() had any problems -
  16. // but is useful for those trying to implement Bitcoin libraries as a
  17. // source of test data for their MurmurHash3() primitive during
  18. // development.
  19. //
  20. // The magic number 0xFBA4C795 comes from CBloomFilter::Hash()
  21. T(0x00000000, 0x00000000, "");
  22. T(0x6a396f08, 0xFBA4C795, "");
  23. T(0x81f16f39, 0xffffffff, "");
  24. T(0x514e28b7, 0x00000000, "00");
  25. T(0xea3f0b17, 0xFBA4C795, "00");
  26. T(0xfd6cf10d, 0x00000000, "ff");
  27. T(0x16c6b7ab, 0x00000000, "0011");
  28. T(0x8eb51c3d, 0x00000000, "001122");
  29. T(0xb4471bf8, 0x00000000, "00112233");
  30. T(0xe2301fa8, 0x00000000, "0011223344");
  31. T(0xfc2e4a15, 0x00000000, "001122334455");
  32. T(0xb074502c, 0x00000000, "00112233445566");
  33. T(0x8034d2a0, 0x00000000, "0011223344556677");
  34. T(0xb4698def, 0x00000000, "001122334455667788");
  35. #undef T
  36. }
  37. BOOST_AUTO_TEST_SUITE_END()