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
|
/*
* Copyright (C) 2017-2022 Sebastiano Vigna
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package it.unimi.dsi.fastutil.ints;
import static org.junit.Assert.assertArrayEquals;
import java.util.Arrays;
import org.junit.Test;
import it.unimi.dsi.fastutil.MainRunner;
import junit.framework.TestCase;
public class IntHeapSemiIndirectPriorityQueueTest extends TestCase {
public void testTops() {
int refArray[] = { 4, 3, 2, 1, 0, 3, 2, 1, 0, 2, 1, 0, 1, 0, 0 };
int tops[] = new int[refArray.length];
final IntHeapSemiIndirectPriorityQueue queue = new IntHeapSemiIndirectPriorityQueue(refArray);
for(int i = refArray.length; i-- != 0;) queue.enqueue(i);
assertEquals(5, queue.front(tops));
assertEquals(new IntOpenHashSet(new int[] { 4, 8, 11, 13, 14 }), new IntOpenHashSet(tops, 0, 5));
for(int i = 4; i-- != 0;) {
queue.dequeue();
assertEquals(i + 1, queue.front(tops));
}
queue.dequeue();
assertEquals(4, queue.front(tops));
assertEquals(new IntOpenHashSet(new int[] { 3, 7, 10, 12 }), new IntOpenHashSet(tops, 0, 4));
for(int i = 3; i-- != 0;) {
queue.dequeue();
assertEquals(i + 1, queue.front(tops));
}
queue.dequeue();
assertEquals(3, queue.front(tops));
assertEquals(new IntOpenHashSet(new int[] { 2, 6, 9 }), new IntOpenHashSet(tops, 0, 3));
for(int i = 2; i-- != 0;) {
queue.dequeue();
assertEquals(i + 1, queue.front(tops));
}
queue.dequeue();
assertEquals(2, queue.front(tops));
assertEquals(new IntOpenHashSet(new int[] { 1, 5 }), new IntOpenHashSet(tops, 0, 2));
queue.dequeue();
assertEquals(1, queue.front(tops));
queue.dequeue();
assertEquals(1, queue.front(tops));
}
@Test
public void testFrontWithComparator() {
final int[] refArray = { 8, 16, 9 };
IntComparator comparator = (k1, k2) -> (k1 & 3) - (k2 & 3);
IntHeapSemiIndirectPriorityQueue queue = new IntHeapSemiIndirectPriorityQueue(refArray, comparator);
queue.enqueue(0);
queue.enqueue(1);
queue.enqueue(2);
final int[] front = new int[2];
assertEquals(2, queue.front(front));
Arrays.sort(front);
assertArrayEquals(new int[] { 0, 1 }, front);
}
@Test
public void testLegacyMainMethodTests() throws Exception {
MainRunner.callMainIfExists(IntHeapSemiIndirectPriorityQueue.class, "test", /*num=*/"500", /*seed=*/"39384");
}
}
|
