108 lines
4.7 KiB
C++
108 lines
4.7 KiB
C++
|
/*
|
||
|
|
Copyright (c) 2014, Randolph Voorhies, Shane Grant
|
||
|
|
All rights reserved.
|
||
|
|
|
||
|
|
Redistribution and use in source and binary forms, with or without
|
||
|
|
modification, are permitted provided that the following conditions are met:
|
||
|
|
* Redistributions of source code must retain the above copyright
|
||
|
|
notice, this list of conditions and the following disclaimer.
|
||
|
|
* Redistributions in binary form must reproduce the above copyright
|
||
|
|
notice, this list of conditions and the following disclaimer in the
|
||
|
|
documentation and/or other materials provided with the distribution.
|
||
|
|
* Neither the name of cereal nor the
|
||
|
|
names of its contributors may be used to endorse or promote products
|
||
|
|
derived from this software without specific prior written permission.
|
||
|
|
|
||
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||
|
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||
|
|
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||
|
|
DISCLAIMED. IN NO EVENT SHALL RANDOLPH VOORHIES AND SHANE GRANT BE LIABLE FOR ANY
|
||
|
|
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||
|
|
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||
|
|
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||
|
|
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
#ifndef CEREAL_TEST_PRIORITY_QUEUE_H_
|
||
|
|
#define CEREAL_TEST_PRIORITY_QUEUE_H_
|
||
|
|
#include "common.hpp"
|
||
|
|
|
||
|
|
template <class IArchive, class OArchive> inline
|
||
|
|
void test_priority_queue()
|
||
|
|
{
|
||
|
|
std::random_device rd;
|
||
|
|
std::mt19937 gen(rd());
|
||
|
|
|
||
|
|
for(int ii=0; ii<100; ++ii)
|
||
|
|
{
|
||
|
|
std::priority_queue<int> o_podpriority_queue;
|
||
|
|
for(int j=0; j<100; ++j)
|
||
|
|
o_podpriority_queue.push(random_value<int>(gen));
|
||
|
|
|
||
|
|
std::priority_queue<StructInternalSerialize> o_iserpriority_queue;
|
||
|
|
for(int j=0; j<100; ++j)
|
||
|
|
o_iserpriority_queue.push({ random_value<int>(gen), random_value<int>(gen) });
|
||
|
|
|
||
|
|
std::priority_queue<StructInternalSplit> o_isplpriority_queue;
|
||
|
|
for(int j=0; j<100; ++j)
|
||
|
|
o_isplpriority_queue.push({ random_value<int>(gen), random_value<int>(gen) });
|
||
|
|
|
||
|
|
std::priority_queue<StructExternalSerialize> o_eserpriority_queue;
|
||
|
|
for(int j=0; j<100; ++j)
|
||
|
|
o_eserpriority_queue.push({ random_value<int>(gen), random_value<int>(gen) });
|
||
|
|
|
||
|
|
std::priority_queue<StructExternalSplit> o_esplpriority_queue;
|
||
|
|
for(int j=0; j<100; ++j)
|
||
|
|
o_esplpriority_queue.push({ random_value<int>(gen), random_value<int>(gen) });
|
||
|
|
|
||
|
|
std::ostringstream os;
|
||
|
|
{
|
||
|
|
OArchive oar(os);
|
||
|
|
|
||
|
|
oar(o_podpriority_queue);
|
||
|
|
oar(o_iserpriority_queue);
|
||
|
|
oar(o_isplpriority_queue);
|
||
|
|
oar(o_eserpriority_queue);
|
||
|
|
oar(o_esplpriority_queue);
|
||
|
|
}
|
||
|
|
|
||
|
|
std::priority_queue<int> i_podpriority_queue;
|
||
|
|
std::priority_queue<StructInternalSerialize> i_iserpriority_queue;
|
||
|
|
std::priority_queue<StructInternalSplit> i_isplpriority_queue;
|
||
|
|
std::priority_queue<StructExternalSerialize> i_eserpriority_queue;
|
||
|
|
std::priority_queue<StructExternalSplit> i_esplpriority_queue;
|
||
|
|
|
||
|
|
std::istringstream is(os.str());
|
||
|
|
{
|
||
|
|
IArchive iar(is);
|
||
|
|
|
||
|
|
iar(i_podpriority_queue);
|
||
|
|
iar(i_iserpriority_queue);
|
||
|
|
iar(i_isplpriority_queue);
|
||
|
|
iar(i_eserpriority_queue);
|
||
|
|
iar(i_esplpriority_queue);
|
||
|
|
}
|
||
|
|
|
||
|
|
auto & i_podpriority_queue_c = cereal::queue_detail::container(i_podpriority_queue);
|
||
|
|
auto & i_iserpriority_queue_c = cereal::queue_detail::container(i_iserpriority_queue);
|
||
|
|
auto & i_isplpriority_queue_c = cereal::queue_detail::container(i_isplpriority_queue);
|
||
|
|
auto & i_eserpriority_queue_c = cereal::queue_detail::container(i_eserpriority_queue);
|
||
|
|
auto & i_esplpriority_queue_c = cereal::queue_detail::container(i_esplpriority_queue);
|
||
|
|
|
||
|
|
auto & o_podpriority_queue_c = cereal::queue_detail::container(o_podpriority_queue);
|
||
|
|
auto & o_iserpriority_queue_c = cereal::queue_detail::container(o_iserpriority_queue);
|
||
|
|
auto & o_isplpriority_queue_c = cereal::queue_detail::container(o_isplpriority_queue);
|
||
|
|
auto & o_eserpriority_queue_c = cereal::queue_detail::container(o_eserpriority_queue);
|
||
|
|
auto & o_esplpriority_queue_c = cereal::queue_detail::container(o_esplpriority_queue);
|
||
|
|
|
||
|
|
check_collection(i_podpriority_queue_c, o_podpriority_queue_c);
|
||
|
|
check_collection(i_iserpriority_queue_c, o_iserpriority_queue_c);
|
||
|
|
check_collection(i_isplpriority_queue_c, o_isplpriority_queue_c);
|
||
|
|
check_collection(i_eserpriority_queue_c, o_eserpriority_queue_c);
|
||
|
|
check_collection(i_esplpriority_queue_c, o_esplpriority_queue_c);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif // CEREAL_TEST_PRIORITY_QUEUE_H_
|