libcruft-util/test/pool.cpp

98 lines
2.7 KiB
C++
Raw Normal View History

#include "pool.hpp"
2016-01-19 18:31:49 +11:00
2015-04-13 16:45:56 +10:00
#include "tap.hpp"
#include <set>
#include <vector>
#include <algorithm>
2016-01-19 18:31:49 +11:00
//-----------------------------------------------------------------------------
void
2016-01-19 18:31:49 +11:00
check_single (util::TAP::logger &tap)
{
// Ensure a single element doesn't break the circular linked list
2016-01-19 18:31:49 +11:00
util::pool<uint64_t> single(1);
tap.expect_nothrow ([&] {
single.release (single.acquire ());
}, "single element acquire-release");
}
2016-01-19 18:31:49 +11:00
//-----------------------------------------------------------------------------
void
2016-01-19 18:31:49 +11:00
check_unique_ptr (util::TAP::logger &tap)
{
util::pool<uint64_t> uintpool (1025);
std::set<uint64_t *> uintset;
// Take all pointers out, checking they are unique, then replace for destruction.
2016-01-19 18:31:49 +11:00
while (!uintpool.empty ())
uintset.insert (uintpool.acquire ());
2016-01-19 18:31:49 +11:00
tap.expect_eq (uintset.size (), uintpool.capacity (), "extracted maximum elements");
for (auto i: uintset)
uintpool.release (i);
tap.expect_eq (uintpool.size (), 0u, "re-inserted maximum elements");
uintset.clear ();
// Do the above one more time to ensure that releasing works right
2016-01-19 18:31:49 +11:00
while (!uintpool.empty ())
uintset.insert (uintpool.acquire ());
tap.expect_eq (uintset.size (), uintpool.capacity (), "re-extracted maximum elements");
}
2016-01-19 18:31:49 +11:00
//-----------------------------------------------------------------------------
void
2016-01-19 18:31:49 +11:00
check_keep_value (util::TAP::logger &tap)
{
// Ensure that items keep their values.
2016-01-19 18:31:49 +11:00
util::pool<uint64_t> uintpool(256);
std::vector<uint64_t*> uintvector;
uintvector.reserve(uintpool.capacity ());
// Give every item a unique value
for (unsigned int i = 0; i < uintpool.capacity (); ++i) {
uint64_t *item = uintpool.acquire ();
*item = i;
uintvector.push_back(item);
}
2016-01-19 18:31:49 +11:00
CHECK_EQ (uintvector.size (), uintpool.capacity ());
// Ensure they're all still present
2016-01-19 18:31:49 +11:00
std::vector<bool> present(uintpool.capacity (), false);
for (auto i = uintvector.begin (); i != uintvector.end (); ++i) {
CHECK (**i < uintpool.capacity ());
CHECK (present[**i] != true);
present[**i] = true;
}
// All must have been marked as present...
2016-01-19 18:31:49 +11:00
tap.expect (std::find (present.begin (), present.end (), false) == present.end (), "values retained");
// Release all back into the pool for destruction
2016-01-19 18:31:49 +11:00
//for (auto i = uintvector.begin (); i != uintvector.end (); ++i)
// uintpool.release (*i);
//uintvector.clear ();
}
2016-01-19 18:31:49 +11:00
//-----------------------------------------------------------------------------
2015-04-13 18:06:08 +10:00
int
2016-01-19 18:31:49 +11:00
main (int, char **)
{
2015-04-13 16:45:56 +10:00
util::TAP::logger tap;
2016-01-19 18:31:49 +11:00
check_single (tap);
check_unique_ptr (tap);
check_keep_value (tap);
return tap.status ();
}