tsugar.nim 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308
  1. discard """
  2. matrix: "--mm:refc; --mm:orc"
  3. output: '''
  4. x + y = 30
  5. '''
  6. """
  7. import std/[sugar, algorithm, random, sets, tables, strutils, sequtils]
  8. import std/[syncio, assertions]
  9. type # for capture test, ref #20679
  10. FooCapture = ref object
  11. x: int
  12. proc mainProc() =
  13. block: # bug #16967
  14. var s = newSeq[proc (): int](5)
  15. {.push exportc.}
  16. proc bar() =
  17. for i in 0 ..< s.len:
  18. let foo = i + 1
  19. capture foo:
  20. s[i] = proc(): int = foo
  21. {.pop.}
  22. bar()
  23. for i, p in s.pairs:
  24. let foo = i + 1
  25. doAssert p() == foo
  26. template main() =
  27. block: # `=>`
  28. block:
  29. let f1 = () => 42
  30. doAssert f1() == 42
  31. let f2 = (x: int) => x + 1
  32. doAssert f2(42) == 43
  33. let f3 = (x, y: int) => x + y
  34. doAssert f3(1, 2) == 3
  35. var x = 0
  36. let f4 = () => (x = 12)
  37. f4()
  38. doAssert x == 12
  39. let f5 = () => (discard) # simplest proc that returns void
  40. f5()
  41. block:
  42. proc call1(f: () -> int): int = f()
  43. doAssert call1(() => 12) == 12
  44. proc call2(f: int -> int): int = f(42)
  45. doAssert call2(x => x) == 42
  46. doAssert call2((x) => x) == 42
  47. doAssert call2((x: int) => x) == 42
  48. proc call3(f: (int, int) -> int): int = f(1, 2)
  49. doAssert call3((x, y) => x + y) == 3
  50. doAssert call3((x, y: int) => x + y) == 3
  51. doAssert call3((x: int, y: int) => x + y) == 3
  52. var a = 0
  53. proc call4(f: int -> void) = f(42)
  54. call4((x: int) => (a = x))
  55. doAssert a == 42
  56. proc call5(f: (int {.noSideEffect.} -> int)): int = f(42)
  57. doAssert call5(x {.noSideEffect.} => x + 1) == 43
  58. block: # `->`
  59. doAssert $(() -> int) == "proc (): int{.closure.}"
  60. doAssert $(float -> int) == "proc (i0: float): int{.closure.}"
  61. doAssert $((float) -> int) == "proc (i0: float): int{.closure.}"
  62. doAssert $((float, bool) -> int) == "proc (i0: float, i1: bool): int{.closure.}"
  63. doAssert $(() -> void) == "proc (){.closure.}"
  64. doAssert $(float -> void) == "proc (i0: float){.closure.}"
  65. doAssert $((float) -> void) == "proc (i0: float){.closure.}"
  66. doAssert $((float, bool) -> void) == "proc (i0: float, i1: bool){.closure.}"
  67. doAssert $(() {.inline.} -> int) == "proc (): int{.inline.}"
  68. doAssert $(float {.inline.} -> int) == "proc (i0: float): int{.inline.}"
  69. doAssert $((float) {.inline.} -> int) == "proc (i0: float): int{.inline.}"
  70. doAssert $((float, bool) {.inline.} -> int) == "proc (i0: float, i1: bool): int{.inline.}"
  71. block: # capture
  72. var closure1: () -> int
  73. for i in 0 .. 10:
  74. if i == 5:
  75. capture i:
  76. closure1 = () => i
  77. doAssert closure1() == 5
  78. var closure2: () -> (int, int)
  79. for i in 0 .. 10:
  80. for j in 0 .. 10:
  81. if i == 5 and j == 3:
  82. capture i, j:
  83. closure2 = () => (i, j)
  84. doAssert closure2() == (5, 3)
  85. block: # issue #20679
  86. # this should compile. Previously was broken as `var int` is an `nnkHiddenDeref`
  87. # which was not handled correctly
  88. block:
  89. var x = 5
  90. var s1 = newSeq[proc (): int](2)
  91. proc function(data: var int) =
  92. for i in 0 ..< 2:
  93. data = (i+1) * data
  94. capture data:
  95. s1[i] = proc(): int = data
  96. function(x)
  97. doAssert s1[0]() == 5
  98. doAssert s1[1]() == 10
  99. block:
  100. var y = @[5, 10]
  101. var s2 = newSeq[proc (): seq[int]](2)
  102. proc functionS(data: var seq[int]) =
  103. for i in 0 ..< 2:
  104. data.add (i+1) * 5
  105. capture data:
  106. s2[i] = proc(): seq[int] = data
  107. functionS(y)
  108. doAssert s2[0]() == @[5, 10, 5]
  109. doAssert s2[1]() == @[5, 10, 5, 10]
  110. template typeT(typ, val: untyped): untyped =
  111. var x = val
  112. var s = newSeq[proc (): typ](2)
  113. proc functionT[T](data: var T) =
  114. for i in 0 ..< 2:
  115. if i == 1:
  116. data = default(T)
  117. capture data:
  118. s[i] = proc (): T = data
  119. functionT(x)
  120. doAssert s[0]() == val
  121. doAssert s[1]() == x # == default
  122. doAssert s[1]() == default(typ)
  123. block:
  124. var x = 1.1
  125. typeT(float, x)
  126. block:
  127. var x = "hello"
  128. typeT(string, x)
  129. block:
  130. var f = FooCapture(x: 5)
  131. typeT(FooCapture, f)
  132. block: # dup
  133. block dup_with_field:
  134. type
  135. Foo = object
  136. col, pos: int
  137. name: string
  138. proc inc_col(foo: var Foo) = inc(foo.col)
  139. proc inc_pos(foo: var Foo) = inc(foo.pos)
  140. proc name_append(foo: var Foo, s: string) = foo.name &= s
  141. let a = Foo(col: 1, pos: 2, name: "foo")
  142. block:
  143. let b = a.dup(inc_col, inc_pos):
  144. _.pos = 3
  145. name_append("bar")
  146. inc_pos
  147. doAssert(b == Foo(col: 2, pos: 4, name: "foobar"))
  148. block:
  149. let b = a.dup(inc_col, pos = 3, name = "bar"):
  150. name_append("bar")
  151. inc_pos
  152. doAssert(b == Foo(col: 2, pos: 4, name: "barbar"))
  153. block:
  154. var a = @[1, 2, 3, 4, 5, 6, 7, 8, 9]
  155. doAssert dup(a, sort(_)) == sorted(a)
  156. doAssert a.dup(sort) == sorted(a)
  157. # Chaining:
  158. var aCopy = a
  159. aCopy.insert(10)
  160. doAssert a.dup(insert(10)).dup(sort()) == sorted(aCopy)
  161. block:
  162. when nimvm: discard
  163. else:
  164. const b = @[0, 1, 2]
  165. discard b.dup shuffle()
  166. doAssert b[0] == 0
  167. doAssert b[1] == 1
  168. block: # collect
  169. let data = @["bird", "word"] # if this gets stuck in your head, its not my fault
  170. doAssert collect(newSeq, for (i, d) in data.pairs: (if i mod 2 == 0: d)) == @["bird"]
  171. doAssert collect(initTable(2), for (i, d) in data.pairs: {i: d}) ==
  172. {0: "bird", 1: "word"}.toTable
  173. doAssert collect(initHashSet(), for d in data.items: {d}) == data.toHashSet
  174. block:
  175. let x = collect(newSeqOfCap(4)):
  176. for (i, d) in data.pairs:
  177. if i mod 2 == 0: d
  178. doAssert x == @["bird"]
  179. block: # bug #12874
  180. let bug = collect(
  181. newSeq,
  182. for (i, d) in data.pairs:(
  183. block:
  184. if i mod 2 == 0:
  185. d
  186. else:
  187. d & d
  188. )
  189. )
  190. doAssert bug == @["bird", "wordword"]
  191. block:
  192. let y = collect(newSeq):
  193. for (i, d) in data.pairs:
  194. try: parseInt(d) except: 0
  195. doAssert y == @[0, 0]
  196. block:
  197. let z = collect(newSeq):
  198. for (i, d) in data.pairs:
  199. case d
  200. of "bird": "word"
  201. else: d
  202. doAssert z == @["word", "word"]
  203. block:
  204. proc tforum(): seq[int] =
  205. collect(newSeq):
  206. for y in 0..10:
  207. if y mod 5 == 2:
  208. for x in 0..y:
  209. x
  210. doAssert tforum() == @[0, 1, 2, 0, 1, 2, 3, 4, 5, 6, 7]
  211. block:
  212. let x = collect:
  213. for d in data.items:
  214. when d is int: "word"
  215. else: d
  216. doAssert x == @["bird", "word"]
  217. block:
  218. doAssert collect(for (i, d) in pairs(data): (i, d)) == @[(0, "bird"), (1, "word")]
  219. doAssert collect(for d in data.items: (try: parseInt(d) except: 0)) == @[0, 0]
  220. doAssert collect(for (i, d) in pairs(data): {i: d}) ==
  221. {1: "word", 0: "bird"}.toTable
  222. doAssert collect(for d in data.items: {d}) == data.toHashSet
  223. block: # bug #14332
  224. template foo =
  225. discard collect(newSeq, for i in 1..3: i)
  226. foo()
  227. block: # dump
  228. # symbols in templates are gensym'd
  229. let
  230. x {.inject.} = 10
  231. y {.inject.} = 20
  232. dump(x + y) # x + y = 30
  233. block: # dumpToString
  234. template square(x): untyped = x * x
  235. let x {.inject.} = 10
  236. doAssert dumpToString(square(x)) == "square(x): x * x = 100"
  237. let s = dumpToString(doAssert 1+1 == 2)
  238. doAssert "failedAssertImpl" in s
  239. let s2 = dumpToString:
  240. doAssertRaises(AssertionDefect): doAssert false
  241. doAssert "except AssertionDefect" in s2
  242. block: # bug #20704
  243. proc test() =
  244. var xs, ys: seq[int]
  245. for i in 0..5:
  246. xs.add(i)
  247. xs.apply(proc (d: auto) = ys.add(d))
  248. # ^ can be turned into d => ys.add(d) when we can infer void return type, #16906
  249. doAssert ys == @[0, 1, 2, 3, 4, 5]
  250. test()
  251. static:
  252. main()
  253. mainProc()
  254. main()
  255. mainProc()