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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
// 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)
#include "test_fcpqueue.h"
#include <cds/container/fcpriority_queue.h>
#include <deque>
namespace cds_test {
TEST_F( FCPQueue, deque )
{
typedef cds::container::FCPriorityQueue<
value_type
,std::priority_queue<
value_type
,std::deque<value_type>
,less
>
> pqueue_type;
pqueue_type pq;
test( pq );
}
TEST_F( FCPQueue, deque_stat )
{
typedef cds::container::FCPriorityQueue<
value_type
,std::priority_queue<
value_type
,std::deque<value_type>
,less
>
,cds::container::fcpqueue::make_traits<
cds::opt::stat< cds::container::fcpqueue::stat<> >
>::type
> pqueue_type;
pqueue_type pq;
test( pq );
}
TEST_F( FCPQueue, deque_stat_single_mutex_single_condvar )
{
typedef cds::container::FCPriorityQueue<
value_type
,std::priority_queue<
value_type
,std::deque<value_type>
,less
>
,cds::container::fcpqueue::make_traits<
cds::opt::stat< cds::container::fcpqueue::stat<> >
, cds::opt::wait_strategy< cds::algo::flat_combining::wait_strategy::single_mutex_single_condvar<>>
>::type
> pqueue_type;
pqueue_type pq;
test( pq );
}
TEST_F( FCPQueue, deque_empty_wait_strategy )
{
typedef cds::container::FCPriorityQueue<
value_type
,std::priority_queue<
value_type
,std::deque<value_type>
,less
>
,cds::container::fcpqueue::make_traits<
cds::opt::stat< cds::container::fcpqueue::stat<> >
, cds::opt::wait_strategy< cds::algo::flat_combining::wait_strategy::empty >
>::type
> pqueue_type;
pqueue_type pq;
test( pq );
}
TEST_F( FCPQueue, deque_single_mutex_multi_condvar )
{
typedef cds::container::FCPriorityQueue<
value_type
,std::priority_queue<
value_type
,std::deque<value_type>
,less
>
,cds::container::fcpqueue::make_traits<
cds::opt::stat< cds::container::fcpqueue::stat<> >
, cds::opt::wait_strategy< cds::algo::flat_combining::wait_strategy::single_mutex_multi_condvar<2>>
>::type
> pqueue_type;
pqueue_type pq;
test( pq );
}
TEST_F( FCPQueue, deque_mutex )
{
typedef cds::container::FCPriorityQueue<
value_type
,std::priority_queue<
value_type
,std::deque<value_type>
>
,cds::container::fcpqueue::make_traits<
cds::opt::lock_type< std::mutex >
>::type
> pqueue_type;
pqueue_type pq;
test( pq );
}
TEST_F( FCPQueue, deque_multi_mutex_multi_condvar )
{
typedef cds::container::FCPriorityQueue<
value_type
,std::priority_queue<
value_type
,std::deque<value_type>
>
,cds::container::fcpqueue::make_traits<
cds::opt::lock_type< std::mutex >
, cds::opt::wait_strategy< cds::algo::flat_combining::wait_strategy::multi_mutex_multi_condvar<1000>>
>::type
> pqueue_type;
pqueue_type pq;
test( pq );
}
} // namespace cds_test
|
