heap/test/d_ary_heap_test.cpp
Tim Blechmann 8ae6cfd336 heap: use c++14 wherever possible
* remove c++11 workarounds
* use std type traits
* use std::array
* use nullptr
* use noexcept
2024-11-09 12:55:27 +08:00

134 lines
4.2 KiB
C++

/*=============================================================================
Copyright (c) 2010 Tim Blechmann
Use, modification and distribution is subject to the Boost Software
License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
#define BOOST_TEST_MAIN
#ifdef BOOST_HEAP_INCLUDE_TESTS
# include <boost/test/included/unit_test.hpp>
#else
# include <boost/test/unit_test.hpp>
#endif
#include <algorithm>
#include <boost/heap/d_ary_heap.hpp>
#include "common_heap_tests.hpp"
#include "merge_heap_tests.hpp"
#include "mutable_heap_tests.hpp"
#include "stable_heap_tests.hpp"
template < int D, bool stable >
void run_d_ary_heap_test( void )
{
typedef boost::heap::d_ary_heap< int,
boost::heap::arity< D >,
boost::heap::stable< stable >,
boost::heap::compare< std::less< int > >,
boost::heap::allocator< std::allocator< int > > >
pri_queue;
BOOST_CONCEPT_ASSERT( (boost::heap::PriorityQueue< pri_queue >));
run_concept_check< pri_queue >();
run_common_heap_tests< pri_queue >();
run_iterator_heap_tests< pri_queue >();
run_copyable_heap_tests< pri_queue >();
run_moveable_heap_tests< pri_queue >();
run_reserve_heap_tests< pri_queue >();
run_merge_tests< pri_queue >();
run_ordered_iterator_tests< pri_queue >();
if ( stable ) {
typedef boost::heap::d_ary_heap< q_tester, boost::heap::arity< D >, boost::heap::stable< stable > > stable_pri_queue;
run_stable_heap_tests< stable_pri_queue >();
}
cmpthings ord;
boost::heap::d_ary_heap< thing, boost::heap::arity< D >, boost::heap::compare< cmpthings >, boost::heap::stable< stable > >
vpq( ord );
vpq.emplace( 5, 6, 7 );
}
BOOST_AUTO_TEST_CASE( d_ary_heap_test )
{
run_d_ary_heap_test< 2, false >();
run_d_ary_heap_test< 3, false >();
run_d_ary_heap_test< 4, false >();
run_d_ary_heap_test< 5, false >();
}
BOOST_AUTO_TEST_CASE( d_ary_heap_stable_test )
{
run_d_ary_heap_test< 2, true >();
run_d_ary_heap_test< 3, true >();
run_d_ary_heap_test< 4, true >();
run_d_ary_heap_test< 5, true >();
}
template < int D, bool stable >
void run_d_ary_heap_mutable_test( void )
{
typedef boost::heap::d_ary_heap< int, boost::heap::mutable_< true >, boost::heap::arity< D >, boost::heap::stable< stable > >
pri_queue;
BOOST_CONCEPT_ASSERT( (boost::heap::MutablePriorityQueue< pri_queue >));
run_common_heap_tests< pri_queue >();
run_moveable_heap_tests< pri_queue >();
run_reserve_heap_tests< pri_queue >();
run_mutable_heap_tests< pri_queue >();
run_merge_tests< pri_queue >();
run_ordered_iterator_tests< pri_queue >();
if ( stable ) {
typedef boost::heap::
d_ary_heap< q_tester, boost::heap::mutable_< true >, boost::heap::arity< D >, boost::heap::stable< stable > >
stable_pri_queue;
run_stable_heap_tests< stable_pri_queue >();
}
}
BOOST_AUTO_TEST_CASE( d_ary_heap_mutable_test )
{
run_d_ary_heap_mutable_test< 2, false >();
run_d_ary_heap_mutable_test< 3, false >();
run_d_ary_heap_mutable_test< 4, false >();
run_d_ary_heap_mutable_test< 5, false >();
}
BOOST_AUTO_TEST_CASE( d_ary_heap_mutable_stable_test )
{
run_d_ary_heap_mutable_test< 2, true >();
run_d_ary_heap_mutable_test< 3, true >();
run_d_ary_heap_mutable_test< 4, true >();
run_d_ary_heap_mutable_test< 5, true >();
}
BOOST_AUTO_TEST_CASE( d_ary_heap_compare_lookup_test )
{
typedef boost::heap::d_ary_heap< int,
boost::heap::arity< 2 >,
boost::heap::compare< less_with_T >,
boost::heap::allocator< std::allocator< int > > >
pri_queue;
run_common_heap_tests< pri_queue >();
}
BOOST_AUTO_TEST_CASE( d_ary_heap_leak_test )
{
typedef boost::heap::d_ary_heap< boost::shared_ptr< int >, boost::heap::arity< 2 > > pri_queue;
run_leak_check_test< pri_queue >();
}