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 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
|
discard """
targets: "c js"
matrix: "--mm:refc; --mm:orc"
output: '''
x + y = 30
'''
"""
import std/[sugar, algorithm, random, sets, tables, strutils, sequtils]
import std/[syncio, assertions]
type # for capture test, ref #20679
FooCapture = ref object
x: int
proc mainProc() =
block: # bug #16967
var s = newSeq[proc (): int](5)
{.push exportc.}
proc bar() =
for i in 0 ..< s.len:
let foo = i + 1
capture foo:
s[i] = proc(): int = foo
{.pop.}
bar()
for i, p in s.pairs:
let foo = i + 1
doAssert p() == foo
template main() =
block: # `=>`
block:
let f1 = () => 42
doAssert f1() == 42
let f2 = (x: int) => x + 1
doAssert f2(42) == 43
let f3 = (x, y: int) => x + y
doAssert f3(1, 2) == 3
var x = 0
let f4 = () => (x = 12)
f4()
doAssert x == 12
let f5 = () => (discard) # simplest proc that returns void
f5()
block:
proc call1(f: () -> int): int = f()
doAssert call1(() => 12) == 12
proc call2(f: int -> int): int = f(42)
doAssert call2(x => x) == 42
doAssert call2((x) => x) == 42
doAssert call2((x: int) => x) == 42
proc call3(f: (int, int) -> int): int = f(1, 2)
doAssert call3((x, y) => x + y) == 3
doAssert call3((x, y: int) => x + y) == 3
doAssert call3((x: int, y: int) => x + y) == 3
var a = 0
proc call4(f: int -> void) = f(42)
call4((x: int) => (a = x))
doAssert a == 42
proc call5(f: (int {.noSideEffect.} -> int)): int = f(42)
doAssert call5(x {.noSideEffect.} => x + 1) == 43
block: # `->`
doAssert $(() -> int) == "proc (): int{.closure.}"
doAssert $(float -> int) == "proc (i0: float): int{.closure.}"
doAssert $((float) -> int) == "proc (i0: float): int{.closure.}"
doAssert $((float, bool) -> int) == "proc (i0: float, i1: bool): int{.closure.}"
doAssert $(() -> void) == "proc (){.closure.}"
doAssert $(float -> void) == "proc (i0: float){.closure.}"
doAssert $((float) -> void) == "proc (i0: float){.closure.}"
doAssert $((float, bool) -> void) == "proc (i0: float, i1: bool){.closure.}"
doAssert $(() {.inline.} -> int) == "proc (): int{.inline.}"
doAssert $(float {.inline.} -> int) == "proc (i0: float): int{.inline.}"
doAssert $((float) {.inline.} -> int) == "proc (i0: float): int{.inline.}"
doAssert $((float, bool) {.inline.} -> int) == "proc (i0: float, i1: bool): int{.inline.}"
block: # capture
var closure1: () -> int
for i in 0 .. 10:
if i == 5:
capture i:
closure1 = () => i
doAssert closure1() == 5
var closure2: () -> (int, int)
for i in 0 .. 10:
for j in 0 .. 10:
if i == 5 and j == 3:
capture i, j:
closure2 = () => (i, j)
doAssert closure2() == (5, 3)
block: # issue #20679
# this should compile. Previously was broken as `var int` is an `nnkHiddenDeref`
# which was not handled correctly
block:
var x = 5
var s1 = newSeq[proc (): int](2)
proc function(data: var int) =
for i in 0 ..< 2:
data = (i+1) * data
capture data:
s1[i] = proc(): int = data
function(x)
doAssert s1[0]() == 5
doAssert s1[1]() == 10
block:
var y = @[5, 10]
var s2 = newSeq[proc (): seq[int]](2)
proc functionS(data: var seq[int]) =
for i in 0 ..< 2:
data.add (i+1) * 5
capture data:
s2[i] = proc(): seq[int] = data
functionS(y)
doAssert s2[0]() == @[5, 10, 5]
doAssert s2[1]() == @[5, 10, 5, 10]
template typeT(typ, val: untyped): untyped =
var x = val
var s = newSeq[proc (): typ](2)
proc functionT[T](data: var T) =
for i in 0 ..< 2:
if i == 1:
data = default(T)
capture data:
s[i] = proc (): T = data
functionT(x)
doAssert s[0]() == val
doAssert s[1]() == x # == default
doAssert s[1]() == default(typ)
block:
var x = 1.1
typeT(float, x)
block:
var x = "hello"
typeT(string, x)
block:
var f = FooCapture(x: 5)
typeT(FooCapture, f)
block: # dup
block dup_with_field:
type
Foo = object
col, pos: int
name: string
proc inc_col(foo: var Foo) = inc(foo.col)
proc inc_pos(foo: var Foo) = inc(foo.pos)
proc name_append(foo: var Foo, s: string) = foo.name &= s
let a = Foo(col: 1, pos: 2, name: "foo")
block:
let b = a.dup(inc_col, inc_pos):
_.pos = 3
name_append("bar")
inc_pos
doAssert(b == Foo(col: 2, pos: 4, name: "foobar"))
block:
let b = a.dup(inc_col, pos = 3, name = "bar"):
name_append("bar")
inc_pos
doAssert(b == Foo(col: 2, pos: 4, name: "barbar"))
block:
var a = @[1, 2, 3, 4, 5, 6, 7, 8, 9]
doAssert dup(a, sort(_)) == sorted(a)
doAssert a.dup(sort) == sorted(a)
# Chaining:
var aCopy = a
aCopy.insert(10)
doAssert a.dup(insert(10)).dup(sort()) == sorted(aCopy)
block:
when nimvm: discard
else:
const b = @[0, 1, 2]
discard b.dup shuffle()
doAssert b[0] == 0
doAssert b[1] == 1
block: # collect
let data = @["bird", "word"] # if this gets stuck in your head, its not my fault
doAssert collect(newSeq, for (i, d) in data.pairs: (if i mod 2 == 0: d)) == @["bird"]
doAssert collect(initTable(2), for (i, d) in data.pairs: {i: d}) ==
{0: "bird", 1: "word"}.toTable
doAssert collect(initHashSet(), for d in data.items: {d}) == data.toHashSet
block:
let x = collect(newSeqOfCap(4)):
for (i, d) in data.pairs:
if i mod 2 == 0: d
doAssert x == @["bird"]
block: # bug #12874
let bug = collect(
newSeq,
for (i, d) in data.pairs:(
block:
if i mod 2 == 0:
d
else:
d & d
)
)
doAssert bug == @["bird", "wordword"]
block:
let y = collect(newSeq):
for (i, d) in data.pairs:
try: parseInt(d) except: 0
doAssert y == @[0, 0]
block:
let z = collect(newSeq):
for (i, d) in data.pairs:
case d
of "bird": "word"
else: d
doAssert z == @["word", "word"]
block:
proc tforum(): seq[int] =
collect(newSeq):
for y in 0..10:
if y mod 5 == 2:
for x in 0..y:
x
doAssert tforum() == @[0, 1, 2, 0, 1, 2, 3, 4, 5, 6, 7]
block:
let x = collect:
for d in data.items:
when d is int: "word"
else: d
doAssert x == @["bird", "word"]
block:
doAssert collect(for (i, d) in pairs(data): (i, d)) == @[(0, "bird"), (1, "word")]
doAssert collect(for d in data.items: (try: parseInt(d) except: 0)) == @[0, 0]
doAssert collect(for (i, d) in pairs(data): {i: d}) ==
{1: "word", 0: "bird"}.toTable
doAssert collect(for d in data.items: {d}) == data.toHashSet
block: # bug #14332
template foo =
discard collect(newSeq, for i in 1..3: i)
foo()
block: # dump
# symbols in templates are gensym'd
let
x {.inject.} = 10
y {.inject.} = 20
dump(x + y) # x + y = 30
block: # dumpToString
template square(x): untyped = x * x
let x {.inject.} = 10
doAssert dumpToString(square(x)) == "square(x): x * x = 100"
let s = dumpToString(doAssert 1+1 == 2)
doAssert "failedAssertImpl" in s
let s2 = dumpToString:
doAssertRaises(AssertionDefect): doAssert false
doAssert "except AssertionDefect" in s2
block: # bug #20704
proc test() =
var xs, ys: seq[int]
for i in 0..5:
xs.add(i)
xs.apply(proc (d: auto) = ys.add(d))
# ^ can be turned into d => ys.add(d) when we can infer void return type, #16906
doAssert ys == @[0, 1, 2, 3, 4, 5]
test()
mainProc()
when not defined(js): # TODO fixme JS VM
static:
main()
main()
|