mirror of
https://github.com/nim-lang/Nim.git
synced 2025-12-30 18:02:05 +00:00
dedb04fa9e
* cycle collector: new implementation * cycle collector: make self-adaptive based on its previous effectiveness * cycle collector: added Lins's jump stack to improve traversal from 3*N to 2*N * cycle collector: make tests green * API extensions and bugfixes * code cleanup and use --gc:orc for tasyncawait
55 lines
990 B
Nim
55 lines
990 B
Nim
discard """
|
|
output: "MEM 0"
|
|
cmd: "nim c --gc:orc $file"
|
|
"""
|
|
|
|
type
|
|
Node = ref object of RootObj
|
|
le, ri: Node
|
|
name: char
|
|
|
|
proc edge(a, b: Node) =
|
|
if a.le == nil: a.le = b
|
|
else: a.ri = b
|
|
|
|
proc createNode(name: char): Node =
|
|
new result
|
|
result.name = name
|
|
|
|
#[
|
|
|
|
+---------+ +------+
|
|
| | | |
|
|
| A +----->+ <------+-------------+
|
|
+--+------+ | | | |
|
|
| | | | C |
|
|
| | R | | |
|
|
+--v------+ | | +-------------+
|
|
| | | | ^
|
|
| B <------+ | |
|
|
| | | +--------+
|
|
+---------+ | |
|
|
+------+
|
|
|
|
]#
|
|
|
|
proc main =
|
|
let a = createNode('A')
|
|
let b = createNode('B')
|
|
let r = createNode('R')
|
|
let c = createNode('C')
|
|
|
|
a.edge b
|
|
a.edge r
|
|
|
|
r.edge b
|
|
r.edge c
|
|
|
|
c.edge r
|
|
|
|
|
|
let mem = getOccupiedMem()
|
|
main()
|
|
GC_fullCollect()
|
|
echo "MEM ", getOccupiedMem() - mem
|