mirror of
https://github.com/fraillt/bitsery.git
synced 2026-06-13 10:49:24 +00:00
101 lines
3.4 KiB
C++
101 lines
3.4 KiB
C++
//MIT License
|
|
//
|
|
//Copyright (c) 2017 Mindaugas Vinkelis
|
|
//
|
|
//Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
//of this software and associated documentation files (the "Software"), to deal
|
|
//in the Software without restriction, including without limitation the rights
|
|
//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
//copies of the Software, and to permit persons to whom the Software is
|
|
//furnished to do so, subject to the following conditions:
|
|
//
|
|
//The above copyright notice and this permission notice shall be included in all
|
|
//copies or substantial portions of the Software.
|
|
//
|
|
//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
//SOFTWARE.
|
|
|
|
#include <bitsery/ext/std_queue.h>
|
|
|
|
#include <gmock/gmock.h>
|
|
#include "serialization_test_utils.h"
|
|
|
|
using StdQueue = bitsery::ext::StdQueue;
|
|
|
|
using testing::Eq;
|
|
|
|
//inherit from queue so we could take underlying container, because priority queue doesn't have equal operator defined
|
|
template <typename T, typename C>
|
|
struct PriorityQueueCnt : public std::priority_queue<T, C>
|
|
{
|
|
static const C& getContainer(const std::priority_queue<T, C>& s )
|
|
{
|
|
//get address of underlying container
|
|
return s.*(&PriorityQueueCnt::c);
|
|
}
|
|
static C& getContainer(std::priority_queue<T, C>& s )
|
|
{
|
|
//get address of underlying container
|
|
return s.*(&PriorityQueueCnt::c);
|
|
}
|
|
};
|
|
|
|
template <typename T>
|
|
void test(SerializationContext& ctx, const T& v, T& r) {
|
|
ctx.createSerializer().ext4b(v, StdQueue{10});
|
|
ctx.createDeserializer().ext4b(r, StdQueue{10});
|
|
}
|
|
|
|
TEST(SerializeExtensionStdQueue, QueueDefaultContainer) {
|
|
std::queue<int32_t> t1{};
|
|
t1.push(3);
|
|
t1.push(-4854);
|
|
std::queue<int32_t> r1{};
|
|
|
|
SerializationContext ctx1{};
|
|
test(ctx1,t1, r1);
|
|
EXPECT_THAT(t1, Eq(r1));
|
|
}
|
|
|
|
TEST(SerializeExtensionStdQueue, QueueVectorContainer) {
|
|
std::queue<int32_t, std::vector<int32_t>> t1{};
|
|
t1.push(3);
|
|
t1.push(-4854);
|
|
std::queue<int32_t, std::vector<int32_t>> r1{};
|
|
|
|
SerializationContext ctx1{};
|
|
test(ctx1,t1, r1);
|
|
EXPECT_THAT(t1, Eq(r1));
|
|
}
|
|
|
|
TEST(SerializeExtensionStdQueue, PriorityQueueDefaultContainer) {
|
|
std::priority_queue<int32_t> t1{};
|
|
t1.push(3);
|
|
t1.push(-4854);
|
|
std::priority_queue<int32_t> r1{};
|
|
|
|
SerializationContext ctx1{};
|
|
test(ctx1,t1, r1);
|
|
auto & ct1 = PriorityQueueCnt<int32_t, std::vector<int32_t>>::getContainer(t1);
|
|
auto & cr1 = PriorityQueueCnt<int32_t, std::vector<int32_t>>::getContainer(r1);
|
|
EXPECT_THAT(ct1, Eq(cr1));
|
|
}
|
|
|
|
TEST(SerializeExtensionStdQueue, PriorityQueueDequeContainer) {
|
|
std::priority_queue<int32_t, std::deque<int32_t>> t1{};
|
|
t1.push(678);
|
|
t1.push(-44);
|
|
std::priority_queue<int32_t, std::deque<int32_t>> r1{};
|
|
|
|
SerializationContext ctx1{};
|
|
test(ctx1,t1, r1);
|
|
auto & ct1 = PriorityQueueCnt<int32_t, std::deque<int32_t>>::getContainer(t1);
|
|
auto & cr1 = PriorityQueueCnt<int32_t, std::deque<int32_t>>::getContainer(r1);
|
|
EXPECT_THAT(ct1, Eq(cr1));
|
|
}
|