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
|
//===----------------------------------------------------------------------===//
//
// This source file is part of the SwiftNIO open source project
//
// Copyright (c) 2017-2020 Apple Inc. and the SwiftNIO project authors
// Licensed under Apache License v2.0
//
// See LICENSE.txt for license information
// See CONTRIBUTORS.txt for the list of SwiftNIO project authors
//
// SPDX-License-Identifier: Apache-2.0
//
//===----------------------------------------------------------------------===//
import XCTest
@testable import NIO
public func getRandomNumbers(count: Int) -> [UInt8] {
return (0..<count).map { _ in
UInt8.random(in: .min ... .max)
}
}
class HeapTests: XCTestCase {
func testSimple() throws {
var h = Heap<Int>()
h.append(3)
h.append(1)
h.append(2)
XCTAssertEqual(1, h.removeRoot())
XCTAssertTrue(h.checkHeapProperty())
}
func testSortedDesc() throws {
var minHeap = Heap<Int>()
let input = [16, 14, 10, 9, 8, 7, 4, 3, 2, 1]
input.forEach {
minHeap.append($0)
XCTAssertTrue(minHeap.checkHeapProperty())
}
var minHeapInputPtr = input.count - 1
while let minE = minHeap.removeRoot() {
XCTAssertEqual(minE, input[minHeapInputPtr])
minHeapInputPtr -= 1
XCTAssertTrue(minHeap.checkHeapProperty(), "\(minHeap.debugDescription)")
}
XCTAssertEqual(-1, minHeapInputPtr)
}
func testSortedAsc() throws {
var minHeap = Heap<Int>()
let input = Array([16, 14, 10, 9, 8, 7, 4, 3, 2, 1].reversed())
input.forEach {
minHeap.append($0)
}
var minHeapInputPtr = 0
while let minE = minHeap.removeRoot() {
XCTAssertEqual(minE, input[minHeapInputPtr])
minHeapInputPtr += 1
}
XCTAssertEqual(input.count, minHeapInputPtr)
}
func testAddAndRemoveRandomNumbers() throws {
var minHeap = Heap<UInt8>()
var minHeapLast = UInt8.min
let N = 10
for n in getRandomNumbers(count: N) {
minHeap.append(n)
XCTAssertTrue(minHeap.checkHeapProperty(), minHeap.debugDescription)
XCTAssertEqual(Array(minHeap.sorted()), Array(minHeap))
}
for _ in 0..<N/2 {
let value = minHeap.removeRoot()!
XCTAssertGreaterThanOrEqual(value, minHeapLast)
minHeapLast = value
XCTAssertTrue(minHeap.checkHeapProperty())
XCTAssertEqual(Array(minHeap.sorted()), Array(minHeap))
}
minHeapLast = UInt8.min
for n in getRandomNumbers(count: N) {
minHeap.append(n)
XCTAssertTrue(minHeap.checkHeapProperty(), minHeap.debugDescription)
}
for _ in 0..<N/2+N {
let value = minHeap.removeRoot()!
XCTAssertGreaterThanOrEqual(value, minHeapLast)
minHeapLast = value
XCTAssertTrue(minHeap.checkHeapProperty())
}
XCTAssertEqual(0, minHeap.underestimatedCount)
}
func testRemoveElement() throws {
var h = Heap<Int>()
for f in [84, 22, 19, 21, 3, 10, 6, 5, 20] {
h.append(f)
}
_ = h.remove(value: 10)
XCTAssertTrue(h.checkHeapProperty(), "\(h.debugDescription)")
}
}
extension Heap {
internal func checkHeapProperty() -> Bool {
func checkHeapProperty(index: Int) -> Bool {
let li = self.leftIndex(index)
let ri = self.rightIndex(index)
if index >= self.storage.count {
return true
} else {
let me = self.storage[index]
var lCond = true
var rCond = true
if li < self.storage.count {
let l = self.storage[li]
lCond = !self.comparator(l, me)
}
if ri < self.storage.count {
let r = self.storage[ri]
rCond = !self.comparator(r, me)
}
return lCond && rCond && checkHeapProperty(index: li) && checkHeapProperty(index: ri)
}
}
return checkHeapProperty(index: 0)
}
}
|
