mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-01-15 06:12:37 -03:00
1a445343f6
-BEGIN VERIFY SCRIPT-
for f in \
src/*.cpp \
src/*.h \
src/bench/*.cpp \
src/bench/*.h \
src/compat/*.cpp \
src/compat/*.h \
src/consensus/*.cpp \
src/consensus/*.h \
src/crypto/*.cpp \
src/crypto/*.h \
src/crypto/ctaes/*.h \
src/policy/*.cpp \
src/policy/*.h \
src/primitives/*.cpp \
src/primitives/*.h \
src/qt/*.cpp \
src/qt/*.h \
src/qt/test/*.cpp \
src/qt/test/*.h \
src/rpc/*.cpp \
src/rpc/*.h \
src/script/*.cpp \
src/script/*.h \
src/support/*.cpp \
src/support/*.h \
src/support/allocators/*.h \
src/test/*.cpp \
src/test/*.h \
src/wallet/*.cpp \
src/wallet/*.h \
src/wallet/test/*.cpp \
src/wallet/test/*.h \
src/zmq/*.cpp \
src/zmq/*.h
do
base=${f%/*}/ relbase=${base#src/} sed -i "s:#include \"\(.*\)\"\(.*\):if test -e \$base'\\1'; then echo \"#include <\"\$relbase\"\\1>\\2\"; else echo \"#include <\\1>\\2\"; fi:e" $f
done
-END VERIFY SCRIPT-
101 lines
2.6 KiB
C++
101 lines
2.6 KiB
C++
// Copyright (c) 2012-2016 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include <limitedmap.h>
|
|
|
|
#include <test/test_bitcoin.h>
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
BOOST_FIXTURE_TEST_SUITE(limitedmap_tests, BasicTestingSetup)
|
|
|
|
BOOST_AUTO_TEST_CASE(limitedmap_test)
|
|
{
|
|
// create a limitedmap capped at 10 items
|
|
limitedmap<int, int> map(10);
|
|
|
|
// check that the max size is 10
|
|
BOOST_CHECK(map.max_size() == 10);
|
|
|
|
// check that it's empty
|
|
BOOST_CHECK(map.size() == 0);
|
|
|
|
// insert (-1, -1)
|
|
map.insert(std::pair<int, int>(-1, -1));
|
|
|
|
// make sure that the size is updated
|
|
BOOST_CHECK(map.size() == 1);
|
|
|
|
// make sure that the new item is in the map
|
|
BOOST_CHECK(map.count(-1) == 1);
|
|
|
|
// insert 10 new items
|
|
for (int i = 0; i < 10; i++) {
|
|
map.insert(std::pair<int, int>(i, i + 1));
|
|
}
|
|
|
|
// make sure that the map now contains 10 items...
|
|
BOOST_CHECK(map.size() == 10);
|
|
|
|
// ...and that the first item has been discarded
|
|
BOOST_CHECK(map.count(-1) == 0);
|
|
|
|
// iterate over the map, both with an index and an iterator
|
|
limitedmap<int, int>::const_iterator it = map.begin();
|
|
for (int i = 0; i < 10; i++) {
|
|
// make sure the item is present
|
|
BOOST_CHECK(map.count(i) == 1);
|
|
|
|
// use the iterator to check for the expected key and value
|
|
BOOST_CHECK(it->first == i);
|
|
BOOST_CHECK(it->second == i + 1);
|
|
|
|
// use find to check for the value
|
|
BOOST_CHECK(map.find(i)->second == i + 1);
|
|
|
|
// update and recheck
|
|
map.update(it, i + 2);
|
|
BOOST_CHECK(map.find(i)->second == i + 2);
|
|
|
|
it++;
|
|
}
|
|
|
|
// check that we've exhausted the iterator
|
|
BOOST_CHECK(it == map.end());
|
|
|
|
// resize the map to 5 items
|
|
map.max_size(5);
|
|
|
|
// check that the max size and size are now 5
|
|
BOOST_CHECK(map.max_size() == 5);
|
|
BOOST_CHECK(map.size() == 5);
|
|
|
|
// check that items less than 5 have been discarded
|
|
// and items greater than 5 are retained
|
|
for (int i = 0; i < 10; i++) {
|
|
if (i < 5) {
|
|
BOOST_CHECK(map.count(i) == 0);
|
|
} else {
|
|
BOOST_CHECK(map.count(i) == 1);
|
|
}
|
|
}
|
|
|
|
// erase some items not in the map
|
|
for (int i = 100; i < 1000; i += 100) {
|
|
map.erase(i);
|
|
}
|
|
|
|
// check that the size is unaffected
|
|
BOOST_CHECK(map.size() == 5);
|
|
|
|
// erase the remaining elements
|
|
for (int i = 5; i < 10; i++) {
|
|
map.erase(i);
|
|
}
|
|
|
|
// check that the map is now empty
|
|
BOOST_CHECK(map.empty());
|
|
}
|
|
|
|
BOOST_AUTO_TEST_SUITE_END()
|