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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
|
#!/usr/bin/env perl
use strict;
use warnings;
use utf8;
use open qw(:std :utf8);
use Test::More;
BEGIN {
use_ok 'MCE::Queue';
}
###############################################################################
## MCE::Queue provides 2 operating modes (manager and worker).
## This will test (priority queue) by the manager process.
##
## *{ 'MCE::Queue::clear' } = \&MCE::Queue::_mce_m_clear;
## *{ 'MCE::Queue::enqueuep' } = \&MCE::Queue::_mce_m_enqueuep;
## *{ 'MCE::Queue::dequeue' } = \&MCE::Queue::_mce_m_dequeue;
## *{ 'MCE::Queue::insertp' } = \&MCE::Queue::_mce_m_insertp;
## *{ 'MCE::Queue::pending' } = \&MCE::Queue::_mce_m_pending;
## *{ 'MCE::Queue::peekp' } = \&MCE::Queue::_mce_m_peekp;
## *{ 'MCE::Queue::peekh' } = \&MCE::Queue::_mce_m_peekh;
## *{ 'MCE::Queue::heap' } = \&MCE::Queue::_mce_m_heap;
## https://sacred-texts.com/cla/usappho/sph02.htm (VII)
my $sappho_text =
"ἔλθε μοι καὶ νῦν, χαλεπᾶν δὲ λῦσον
ἐκ μερίμναν ὄσσα δέ μοι τέλεσσαι
θῦμοσ ἰμμέρρει τέλεσον, σὐ δ᾽ αὔτα
σύμμαχοσ ἔσσο." . "Ǣ";
my $translation =
"Come then, I pray, grant me surcease from sorrow,
Drive away care, I beseech thee, O goddess
Fulfil for me what I yearn to accomplish,
Be thou my ally.";
my ($q, @r, @h);
###############################################################################
## FIFO tests
$q = MCE::Queue->new( type => $MCE::Queue::FIFO );
$q->enqueuep(5, '1', '2');
$q->enqueuep(5, '3');
$q->enqueuep(5, '4');
is( join('', @{ $q->_get_aref(5) }), '1234', 'fifo, check enqueuep' );
@r = $q->dequeue(2);
push @r, $q->dequeue;
is( join('', @r), '123', 'fifo, check dequeue' );
is( join('', @{ $q->_get_aref(5) }), '4', 'fifo, check array' );
$q->clear;
is( $q->_get_aref(5), undef, 'fifo, check clear' );
$q->enqueuep(5, 'a', 'b', 'c', 'd');
$q->insertp(5, 1, 'e', 'f');
$q->insertp(5, 3, 'g');
$q->insertp(5, -2, 'h');
$q->insertp(5, 7, 'i');
$q->insertp(5, 9, 'j');
$q->insertp(5, 20, 'k');
$q->insertp(5, -10, 'l');
$q->insertp(5, -12, 'm');
$q->insertp(5, -20, 'n');
is( join('', @{ $q->_get_aref(5) }), 'nmalefgbhcidjk', 'fifo, check insertp' );
is( $q->pending(), 14, 'fifo, check pending' );
is( $q->peekp(5 ), 'n', 'fifo, check peekp at head' );
is( $q->peekp(5, 0), 'n', 'fifo, check peekp at index 0' );
is( $q->peekp(5, 2), 'a', 'fifo, check peekp at index 2' );
is( $q->peekp(5, 13), 'k', 'fifo, check peekp at index 13' );
is( $q->peekp(5, 20), undef, 'fifo, check peekp at index 20' );
is( $q->peekp(5, -2), 'j', 'fifo, check peekp at index -2' );
is( $q->peekp(5, -13), 'm', 'fifo, check peekp at index -13' );
is( $q->peekp(5, -14), 'n', 'fifo, check peekp at index -14' );
is( $q->peekp(5, -15), undef, 'fifo, check peekp at index -15' );
is( $q->peekp(5, -20), undef, 'fifo, check peekp at index -20' );
$q->clear;
$q->enqueuep(5, $sappho_text);
is( join('', @{ $q->_get_aref(5) }), $sappho_text, 'fifo, check unicode enqueuep' );
is( $q->dequeue, $sappho_text, 'fifo, check unicode dequeue' );
$q->insertp(5, 0, $sappho_text);
is( $q->peekp(5, 0), $sappho_text, 'fifo, check unicode peekp' );
is( $q->dequeue_nb, $sappho_text, 'fifo, check unicode insertp' );
$q->enqueuep(5, $sappho_text);
is( $q->dequeue_timed, $sappho_text, 'fifo, check unicode dequeue_timed' );
###############################################################################
## LIFO tests
$q = MCE::Queue->new( type => $MCE::Queue::LIFO );
$q->enqueuep(5, '1', '2');
$q->enqueuep(5, '3');
$q->enqueuep(5, '4');
## Note (lifo)
##
## Enqueue appends to an array similarly to fifo
## Thus, the enqueuep check is identical to fifo
is( join('', @{ $q->_get_aref(5) }), '1234', 'lifo, check enqueuep' );
@r = $q->dequeue(2);
push @r, $q->dequeue;
is( join('', @r), '432', 'lifo, check dequeue' );
is( join('', @{ $q->_get_aref(5) }), '1', 'lifo, check array' );
$q->clear;
is( $q->_get_aref(5), undef, 'lifo, check clear' );
$q->enqueuep(5, 'a', 'b', 'c', 'd');
$q->insertp(5, 1, 'e', 'f');
$q->insertp(5, 3, 'g');
$q->insertp(5, -2, 'h');
$q->insertp(5, 7, 'i');
$q->insertp(5, 9, 'j');
$q->insertp(5, 20, 'k');
$q->insertp(5, -10, 'l');
$q->insertp(5, -12, 'm');
$q->insertp(5, -20, 'n');
is( join('', @{ $q->_get_aref(5) }), 'kjaibhcgefldmn', 'lifo, check insertp' );
is( $q->pending(), 14, 'lifo, check pending' );
is( $q->peekp(5 ), 'n', 'lifo, check peekp at head' );
is( $q->peekp(5, 0), 'n', 'lifo, check peekp at index 0' );
is( $q->peekp(5, 2), 'd', 'lifo, check peekp at index 2' );
is( $q->peekp(5, 13), 'k', 'lifo, check peekp at index 13' );
is( $q->peekp(5, 20), undef, 'lifo, check peekp at index 20' );
is( $q->peekp(5, -2), 'j', 'lifo, check peekp at index -2' );
is( $q->peekp(5, -13), 'm', 'lifo, check peekp at index -13' );
is( $q->peekp(5, -14), 'n', 'lifo, check peekp at index -14' );
is( $q->peekp(5, -15), undef, 'lifo, check peekp at index -15' );
is( $q->peekp(5, -20), undef, 'lifo, check peekp at index -20' );
$q->clear;
$q->enqueuep(5, $sappho_text);
is( join('', @{ $q->_get_aref(5) }), $sappho_text, 'lifo, check unicode enqueuep' );
is( $q->dequeue, $sappho_text, 'lifo, check unicode dequeue' );
$q->insertp(5, 0, $sappho_text);
is( $q->peekp(5, 0), $sappho_text, 'lifo, check unicode peekp' );
is( $q->dequeue_nb, $sappho_text, 'lifo, check unicode insertp' );
$q->enqueuep(5, $sappho_text);
is( $q->dequeue_timed, $sappho_text, 'lifo, check unicode dequeue_timed' );
###############################################################################
## HIGHEST priority tests
$q = MCE::Queue->new(
porder => $MCE::Queue::HIGHEST, type => $MCE::Queue::FIFO
);
$q->enqueuep(5, 'a', 'b'); # priority queue
$q->enqueuep(7, 'e', 'f'); # priority queue
$q->enqueue ( 'i', 'j'); # normal queue
$q->enqueuep(8, 'g', 'h'); # priority queue
$q->enqueuep(6, 'c', 'd'); # priority queue
@h = $q->heap;
is( join('', @h), '8765', 'highest, check heap' );
is( $q->peekh( 0), '8', 'lowest, check peekh at index 0' );
is( $q->peekh(-2), '6', 'lowest, check peekh at index -2' );
@r = $q->dequeue(10);
is( join('', @r), 'ghefcdabij', 'highest, check dequeue' );
###############################################################################
## LOWEST priority tests
$q = MCE::Queue->new(
porder => $MCE::Queue::LOWEST, type => $MCE::Queue::FIFO
);
$q->enqueuep(5, 'a', 'b'); # priority queue
$q->enqueuep(7, 'e', 'f'); # priority queue
$q->enqueue ( 'i', 'j'); # normal queue
$q->enqueuep(8, 'g', 'h'); # priority queue
$q->enqueuep(6, 'c', 'd'); # priority queue
@h = $q->heap;
is( join('', @h), '5678', 'lowest, check heap' );
is( $q->peekh( 0), '5', 'lowest, check peekh at index 0' );
is( $q->peekh(-2), '7', 'lowest, check peekh at index -2' );
@r = $q->dequeue(10);
is( join('', @r), 'abcdefghij', 'highest, check dequeue' );
done_testing;
|
