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
|
# ==================================================================================================================== #
# _____ _ _ _ _ _ _ _ _ _ #
# _ __ _ |_ _|__ ___ | (_)_ __ __ _ | | (_)_ __ | | _____ __| | | (_)___| |_ #
# | '_ \| | | || |/ _ \ / _ \| | | '_ \ / _` | | | | | '_ \| |/ / _ \/ _` | | | / __| __| #
# | |_) | |_| || | (_) | (_) | | | | | | (_| |_| |___| | | | | < __/ (_| | |___| \__ \ |_ #
# | .__/ \__, ||_|\___/ \___/|_|_|_| |_|\__, (_)_____|_|_| |_|_|\_\___|\__,_|_____|_|___/\__| #
# |_| |___/ |___/ #
# ==================================================================================================================== #
# Authors: #
# Patrick Lehmann #
# #
# License: #
# ==================================================================================================================== #
# Copyright 2025-2026 Patrick Lehmann - Bötzingen, Germany #
# #
# 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. #
# #
# SPDX-License-Identifier: Apache-2.0 #
# ==================================================================================================================== #
#
"""Performance tests for list."""
from . import PerformanceTest
if __name__ == "__main__": # pragma: no cover
print("ERROR: you called a testcase declaration file as an executable module.")
print("Use: 'python -m unittest <testcase module>'")
exit(1)
class Insertion(PerformanceTest):
def test_InsertBeforeFirst(self) -> None:
def wrapper(count: int):
def func():
lst = []
for i in range(1, count):
lst.insert(0, i)
return func
self.runSizedTests(wrapper, self.counts)
def test_InsertAfterLast(self) -> None:
def wrapper(count: int):
def func():
lst = []
for i in range(1, count):
lst.append(i)
return func
self.runSizedTests(wrapper, self.counts)
class Remove(PerformanceTest):
def test_FillBuckets_RemoveList(self) -> None:
limit = 145
def wrapper(count: int):
def func():
lst =[i for i in self.randomArray[0:count]]
index = 0
collected = 0
buckets = []
buckets.append([])
lst.sort(reverse=True)
while True:
removeList = []
for pos, value in enumerate(lst):
if collected + value > limit:
continue
collected += value
buckets[index].append(value)
removeList.append(pos)
# if collected == limit:
# break
index += 1
if len(lst) > len(removeList):
collected = 0
buckets.append([])
for offset, pos in enumerate(removeList):
lst.pop(pos - offset)
else:
break
return func
self.runSizedTests(wrapper, self.counts[:-1])
def test_FillBuckets_MoveValue(self) -> None:
limit = 145
def wrapper(count: int):
def func():
lst = [i for i in self.randomArray[0:count]]
index = 0
collected = 0
buckets = []
buckets.append([])
lst.sort(reverse=True)
while True:
pos = 0
for value in lst:
if collected + value > limit:
lst[pos] = value
pos += 1
continue
collected += value
buckets[index].append(value)
lst = lst[:pos]
index += 1
if len(lst) > 0:
collected = 0
buckets.append([])
else:
break
return func
self.runSizedTests(wrapper, self.counts[:-1])
def test_FillBuckets_NewList(self) -> None:
limit = 145
def wrapper(count: int):
def func():
lst =[i for i in self.randomArray[0:count]]
index = 0
collected = 0
buckets = []
buckets.append([])
lst.sort(reverse=True)
while True:
newLst = []
for value in lst:
if collected + value > limit:
newLst.append(value)
continue
collected += value
buckets[index].append(value)
lst = newLst
index += 1
if len(lst) > 0:
collected = 0
buckets.append([])
else:
break
return func
self.runSizedTests(wrapper, self.counts[:-1])
|
