2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 this list of conditions and the following disclaimer in the documentation
17 and/or other materials provided with the distribution.
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #include "priority_queue/hdr_intrusive_pqueue.h"
32 #include <cds/intrusive/mspriority_queue.h>
34 namespace priority_queue {
35 namespace intrusive_pqueue {
36 template <typename T, typename Traits>
37 struct constants<cds::intrusive::MSPriorityQueue<T, Traits> > {
38 static size_t const nCapacity = c_nCapacity - 1;
43 typedef cds::opt::v::dynamic_buffer< char > buffer_type;
46 void IntrusivePQueueHdrTest::MSPQueue_dyn()
48 struct pqueue_traits : public cds::intrusive::mspriority_queue::traits
50 typedef buffer_type buffer;
52 typedef cds::intrusive::MSPriorityQueue< IntrusivePQueueHdrTest::key_type, pqueue_traits > pqueue;
54 test_msq_dyn<pqueue>();
57 void IntrusivePQueueHdrTest::MSPQueue_dyn_cmp()
59 struct pqueue_traits : public cds::intrusive::mspriority_queue::traits
61 typedef buffer_type buffer;
62 typedef IntrusivePQueueHdrTest::compare compare;
64 typedef cds::intrusive::MSPriorityQueue< IntrusivePQueueHdrTest::key_type, pqueue_traits > pqueue;
66 test_msq_dyn<pqueue>();
69 void IntrusivePQueueHdrTest::MSPQueue_dyn_less()
71 struct pqueue_traits : public
72 cds::intrusive::mspriority_queue::make_traits <
73 cds::opt::buffer< buffer_type >
74 , cds::opt::less < std::less<IntrusivePQueueHdrTest::key_type> >
77 typedef cds::intrusive::MSPriorityQueue< IntrusivePQueueHdrTest::key_type, pqueue_traits > pqueue;
79 test_msq_dyn<pqueue>();
82 void IntrusivePQueueHdrTest::MSPQueue_dyn_cmpless()
84 typedef cds::intrusive::MSPriorityQueue< IntrusivePQueueHdrTest::key_type,
85 cds::intrusive::mspriority_queue::make_traits<
86 cds::opt::buffer< buffer_type >
87 ,cds::opt::less< std::less<IntrusivePQueueHdrTest::key_type> >
88 ,cds::opt::compare< IntrusivePQueueHdrTest::compare >
92 test_msq_dyn<pqueue>();
95 void IntrusivePQueueHdrTest::MSPQueue_dyn_cmp_mtx()
97 typedef cds::intrusive::MSPriorityQueue< IntrusivePQueueHdrTest::key_type,
98 cds::intrusive::mspriority_queue::make_traits<
99 cds::opt::buffer< buffer_type >
100 ,cds::opt::compare< IntrusivePQueueHdrTest::compare >
101 ,cds::opt::lock_type<std::mutex>
105 test_msq_dyn<pqueue>();
108 } // namespace priority_queue