2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
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 #ifndef CDSUNIT_PQUEUE_TEST_DATA_H
32 #define CDSUNIT_PQUEUE_TEST_DATA_H
34 #include <cds_test/fixture.h>
39 class PQueueTest : public ::cds_test::fixture
51 value_type( value_type const& kv )
56 value_type( key_type key )
61 value_type( key_type key, int val )
66 value_type( std::pair<key_type, int> const& p )
73 int operator()( value_type k1, value_type k2 ) const
80 bool operator()( value_type k1, value_type k2 ) const
95 std::unique_ptr<T[]> pFirst;
99 data_array( size_t nSize )
100 : pFirst( new T[nSize] )
101 , pLast( pFirst.get() + nSize )
103 key_type i = c_nMinValue;
104 for ( T * p = pFirst.get(); p != pLast; ++p, ++i )
107 shuffle( pFirst.get(), pLast );
110 T * begin() { return pFirst.get(); }
111 T * end() { return pLast; }
114 return pLast - pFirst;
118 } // namespace cds_test
122 struct less<cds_test::PQueueTest::value_type>
124 bool operator()( cds_test::PQueueTest::value_type const& v1, cds_test::PQueueTest::value_type const& v2 ) const
126 return cds_test::PQueueTest::less()(v1, v2);
131 #endif // CDSUNIT_PQUEUE_FCPQUEUE_H