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 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265
|
discard """
matrix: "--mm:refc; --mm:orc"
"""
import std/packedsets
import std/sets
import sequtils
import algorithm
import std/assertions
block basicIntSetTests:
var y = initPackedSet[int]()
y.incl(1)
y.incl(2)
y.incl(7)
y.incl(1056)
y.incl(1044)
y.excl(1044)
doAssert y == [1, 2, 7, 1056].toPackedSet
doAssert toSeq(y.items) == [1, 2, 7, 1056]
doAssert y.containsOrIncl(888) == false
doAssert 888 in y
doAssert y.containsOrIncl(888) == true
doAssert y.missingOrExcl(888) == false
doAssert 888 notin y
doAssert y.missingOrExcl(888) == true
proc sortedPairs[T](t: T): auto = toSeq(t.pairs).sorted
template sortedItems(t: untyped): untyped = sorted(toSeq(t))
type Id = distinct int
proc `$`(x: Id): string {.borrow.}
proc cmp(a: Id, b: Id): int {.borrow.}
proc `==`(a: Id, b: Id): bool {.borrow.}
proc `<`(a: Id, b: Id): bool {.borrow.}
block genericTests:
# we use HashSet as groundtruth, it's well tested elsewhere
template testDel(A: typedesc, t: typed, t0: typed) =
block:
template checkEquals() =
doAssert t.len == t0.len
for k in t0:
doAssert k in t
for k in t:
doAssert k in t0
doAssert sortedItems(t) == sortedItems(t0)
template incl2(i) =
t.incl i
t0.incl i
template excl2(i) =
t.excl i
t0.excl i
var expected: seq[A]
let n = 100
let n2 = n*2
for i in 0..<n:
incl2(A(i))
checkEquals()
for i in 0..<n:
if i mod 3 == 0:
if i < n div 2:
excl2(A(i))
else:
t0.excl A(i)
doAssert A(i) in t
doAssert not t.missingOrExcl A(i)
checkEquals()
for i in n..<n2:
incl2(A(i))
checkEquals()
for i in 0..<n2:
if i mod 7 == 0:
excl2(A(i))
checkEquals()
# notin check
for i in 0..<t.len:
if i mod 7 == 0:
doAssert A(i) notin t0
doAssert A(i) notin t
# issue #13505
doAssert t.missingOrExcl(A(i))
var t: PackedSet[int]
var t0: HashSet[int]
testDel(int, t, t0)
var distT: PackedSet[Id]
var distT0: HashSet[Id]
testDel(Id, distT, distT0)
doAssert union(distT, initPackedSet[Id]()) == distT
var charT: PackedSet[char]
var charT0: HashSet[char]
testDel(char, charT, charT0)
block typeSafetyTest:
# mixing sets of different types shouldn't compile
doAssert not compiles( union(initPackedSet[Id](), initPackedSet[int]()) )
doAssert compiles( union(initPackedSet[Id](), initPackedSet[Id]()))
var ids: PackedSet[Id]
doAssert not compiles( ids.incl(3) )
doAssert compiles( ids.incl(Id(3)) )
type NonOrdinal = string
doAssert not compiles( initPackedSet[NonOrdinal]() )
type EnumABCD = enum A, B, C, D
block enumTest:
var letterSet = initPackedSet[EnumABCD]()
for x in [A, C]:
letterSet.incl(x)
doAssert A in letterSet
doAssert B notin letterSet
doAssert C in letterSet
doAssert D notin letterSet
type Foo = distinct int16
proc `$`(a: Foo): string {.borrow.} # `echo a` below won't work without `$` defined, as expected
block printTest:
var a = initPackedSet[EnumABCD]()
a.incl A
a.incl C
doAssert $a == "{A, C}"
import intsets
block legacyMainModuleTests:
template genericTests(A: typedesc[Ordinal], x: typed) =
block:
proc typSeq(s: seq[int]): seq[A] = s.map(proc (i: int): A = A(i))
x.incl(A(1))
x.incl(A(2))
x.incl(A(7))
x.incl(A(1056))
x.incl(A(1044))
x.excl(A(1044))
doAssert x == typSeq(@[1, 2, 7, 1056]).toPackedSet
doAssert x.containsOrIncl(A(888)) == false
doAssert A(888) in x
doAssert x.containsOrIncl(A(888)) == true
doAssert x.missingOrExcl(A(888)) == false
doAssert A(888) notin x
doAssert x.missingOrExcl(A(888)) == true
var xs = toSeq(items(x))
xs.sort(cmp[A])
doAssert xs == typSeq(@[1, 2, 7, 1056])
var y: PackedSet[A]
assign(y, x)
var ys = toSeq(items(y))
ys.sort(cmp[A])
doAssert ys == typSeq(@[1, 2, 7, 1056])
doAssert x == y
var z: PackedSet[A]
for i in 0..1000:
incl z, A(i)
doAssert z.len() == i+1
for i in 0..1000:
doAssert z.contains(A(i))
var w = initPackedSet[A]()
w.incl(A(1))
w.incl(A(4))
w.incl(A(50))
w.incl(A(1001))
w.incl(A(1056))
var xuw = x.union(w)
var xuws = toSeq(items(xuw))
xuws.sort(cmp)
doAssert xuws == typSeq(@[1, 2, 4, 7, 50, 1001, 1056])
var xiw = x.intersection(w)
var xiws = toSeq(items(xiw))
xiws.sort(cmp)
doAssert xiws == @[A(1), A(1056)]
var xdw = x.difference(w)
var xdws = toSeq(items(xdw))
xdws.sort(cmp[A])
doAssert xdws == @[A(2), A(7)]
var xsw = x.symmetricDifference(w)
var xsws = toSeq(items(xsw))
xsws.sort(cmp[A])
doAssert xsws == typSeq(@[2, 4, 7, 50, 1001])
x.incl(w)
xs = toSeq(items(x))
xs.sort(cmp[A])
doAssert xs == typSeq(@[1, 2, 4, 7, 50, 1001, 1056])
doAssert w <= x
doAssert w < x
doAssert(not disjoint(w, x))
var u = initPackedSet[A]()
u.incl(A(3))
u.incl(A(5))
u.incl(A(500))
doAssert disjoint(u, x)
var v = initPackedSet[A]()
v.incl(A(2))
v.incl(A(50))
x.excl(v)
xs = toSeq(items(x))
xs.sort(cmp[A])
doAssert xs == typSeq(@[1, 4, 7, 1001, 1056])
proc bug12366 =
var
x = initPackedSet[A]()
y = initPackedSet[A]()
n = 3584
for i in 0..n:
x.incl(A(i))
y.incl(A(i))
let z = symmetricDifference(x, y)
doAssert z.len == 0
doAssert $z == "{}"
bug12366()
var legacyInit = initIntSet()
genericTests(int, legacyInit)
var intGenericInit = initPackedSet[int]()
genericTests(int, intGenericInit)
var intDistinct = initPackedSet[Id]()
genericTests(Id, intDistinct)
|