File: test_fcpqueue.h

package info (click to toggle)
libcds 2.3.3-6
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 15,632 kB
  • sloc: cpp: 135,002; ansic: 7,234; perl: 243; sh: 237; makefile: 6
file content (85 lines) | stat: -rw-r--r-- 2,550 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
// Copyright (c) 2006-2018 Maxim Khizhinsky
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)

#ifndef CDSUNIT_PQUEUE_FCPQUEUE_H
#define CDSUNIT_PQUEUE_FCPQUEUE_H

#include "test_data.h"

namespace cds_test {

    class FCPQueue : public PQueueTest
    {
    protected:
        template <class PQueue>
        void test( PQueue& pq )
        {
            data_array<value_type> arr( PQueueTest::c_nCapacity );
            value_type * pFirst = arr.begin();
            value_type * pLast = arr.end();

            ASSERT_TRUE( pq.empty());
            ASSERT_TRUE( pq.size() == 0 );

            size_t nSize = 0;

            // Push test
            for ( value_type * p = pFirst; p < pLast; ++p ) {
                ASSERT_TRUE( pq.push( *p ));
                ASSERT_TRUE( !pq.empty());
                ASSERT_EQ( pq.size(), ++nSize );
            }

            ASSERT_EQ( pq.size(), static_cast<size_t>(PQueueTest::c_nCapacity ));

            // Pop test
            key_type nPrev = PQueueTest::c_nMinValue + key_type( PQueueTest::c_nCapacity ) - 1;
            value_type kv( 0 );

            ASSERT_TRUE( pq.pop( kv ));
            EXPECT_EQ( kv.k, nPrev );

            ASSERT_EQ( pq.size(), static_cast<size_t>( PQueueTest::c_nCapacity - 1 ));
            ASSERT_TRUE( !pq.empty());

            nSize = pq.size();
            while ( pq.size() > 1 ) {
                ASSERT_TRUE( pq.pop( kv ));
                EXPECT_EQ( kv.k, nPrev - 1 );
                nPrev = kv.k;

                --nSize;
                ASSERT_EQ( pq.size(), nSize );
            }

            ASSERT_TRUE( !pq.empty());
            ASSERT_EQ( pq.size(), 1u );

            ASSERT_TRUE( pq.pop( kv ));
            EXPECT_EQ( kv.k, PQueueTest::c_nMinValue );

            ASSERT_TRUE( pq.empty());
            ASSERT_EQ( pq.size(), 0u );

            // pop from empty pqueue
            kv.k = PQueueTest::c_nCapacity * 2;
            ASSERT_FALSE( pq.pop( kv ));
            EXPECT_EQ( kv.k, PQueueTest::c_nCapacity * 2 );

            // Clear test
            for ( value_type * p = pFirst; p < pLast; ++p )
                ASSERT_TRUE( pq.push( *p ));

            ASSERT_TRUE( !pq.empty());
            ASSERT_EQ( pq.size(), static_cast<size_t>( PQueueTest::c_nCapacity ));

            pq.clear();
            ASSERT_TRUE( pq.empty());
            ASSERT_EQ( pq.size(), 0u );
        }
    };
} // namespace cds_test

#endif // CDSUNIT_PQUEUE_FCPQUEUE_H