33 lines
1.1 KiB
C
33 lines
1.1 KiB
C
|
#pragma once
|
||
|
|
#ifndef BLOCKS_MESSMER_BLOCKSTORE_TEST_IMPLEMENTATIONS_CACHING_CACHE_TESTUTILS_QUEUEMAPTEST_H_
|
||
|
|
#define BLOCKS_MESSMER_BLOCKSTORE_TEST_IMPLEMENTATIONS_CACHING_CACHE_TESTUTILS_QUEUEMAPTEST_H_
|
||
|
|
|
||
|
|
#include <google/gtest/gtest.h>
|
||
|
|
#include <memory>
|
||
|
|
#include "../../../../../implementations/caching/cache/QueueMap.h"
|
||
|
|
#include "MinimalKeyType.h"
|
||
|
|
#include "MinimalValueType.h"
|
||
|
|
#include <boost/optional.hpp>
|
||
|
|
|
||
|
|
// This class is a parent class for tests on QueueMap.
|
||
|
|
// It offers functions to work with a QueueMap test object which is built using types having only the minimal type requirements.
|
||
|
|
// Furthermore, the class checks that there are no memory leaks left after destructing the QueueMap (by counting leftover instances of Keys/Values).
|
||
|
|
class QueueMapTest: public ::testing::Test {
|
||
|
|
public:
|
||
|
|
QueueMapTest();
|
||
|
|
~QueueMapTest();
|
||
|
|
|
||
|
|
void push(int key, int value);
|
||
|
|
boost::optional<int> pop();
|
||
|
|
boost::optional<int> pop(int key);
|
||
|
|
boost::optional<int> peek();
|
||
|
|
int size();
|
||
|
|
|
||
|
|
private:
|
||
|
|
std::unique_ptr<blockstore::caching::QueueMap<MinimalKeyType, MinimalValueType>> _map;
|
||
|
|
};
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
#endif
|