jyapayne/karax
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

vdom: support for thunks; key -1 means 'unused'

Browse source
This commit is contained in:
Andreas Rumpf 2017-04-10 20:12:36 +02:00
commit e4f3067e38
1 changed files with 20 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

25
vdom.nim
View file

@ -4,7 +4,7 @@ from dom import Event
type type
VNodeKind* {.pure.} = enum VNodeKind* {.pure.} = enum
text, text, int, bool, thunk,
anchor, anchor,
tdiv, tdiv,
table, tr, td, th, thead, tbody, table, tr, td, th, thead, tbody,
@ -14,7 +14,9 @@ type
const const
toTag*: array[VNodeKind, cstring] = [ toTag*: array[VNodeKind, cstring] = [
cstring"#text", "A", "DIV", "TABLE", "TR", "TD", "TH", "THEAD", "TBODY", "LINK", cstring"#text", "#int", "#bool", "#thunk", "A", "DIV", "TABLE", "TR", "TD",
"TH", "THEAD",
"TBODY", "LINK",
"SPAN", "LABEL", "BR", "SELECT", "OPTION", "FIELDSET", "INPUT", "BUTTON", "UL", "SPAN", "LABEL", "BR", "SELECT", "OPTION", "FIELDSET", "INPUT", "BUTTON", "UL",
"LI", "SECTION", "HEADER", "FOOTER", "H1", "H2", "H3", "H4", "H5", "STRONG" "LI", "SECTION", "HEADER", "FOOTER", "H1", "H2", "H3", "H4", "H5", "STRONG"
] ]
@ -40,10 +42,23 @@ type
# even index: key, odd index: value; done this way for memory efficiency: # even index: key, odd index: value; done this way for memory efficiency:
attrs: seq[cstring] attrs: seq[cstring]
events*: seq[(EventKind, EventHandler)] events*: seq[(EventKind, EventHandler)]
thunk*: proc (args: seq[VNode]): VNode
proc value*(n: VNode): cstring = n.text proc value*(n: VNode): cstring = n.text
proc `value=`*(n: VNode; v: cstring) = n.text = v proc `value=`*(n: VNode; v: cstring) = n.text = v
proc intValue*(n: VNode): int = n.key
proc vn*(i: int): VNode = VNode(kind: VNodeKind.int, key: i)
proc vn*(b: bool): VNode = VNode(kind: VNodeKind.int, key: ord(b))
proc vn*(x: cstring): VNode = VNode(kind: VNodeKind.text, key: -1, text: x)
proc callThunk*(n: VNode): VNode =
assert n.kind == VNodeKind.thunk
result = n.thunk(n.kids)
proc thunk*(cb: proc(args: seq[VNode]): VNode; args: varargs[VNode, vn]): VNode =
VNode(kind: VNodeKind.thunk, thunk: cb, kids: @args)
proc eq*(a, b: VNode): bool = proc eq*(a, b: VNode): bool =
if a.kind != b.kind: return false if a.kind != b.kind: return false
if a.id != b.id: return false if a.id != b.id: return false
@ -77,7 +92,7 @@ proc getAttr*(n: VNode; key: cstring): cstring =
proc len*(x: VNode): int = x.kids.len proc len*(x: VNode): int = x.kids.len
proc `[]`*(x: VNode; idx: int): VNode = x.kids[idx] proc `[]`*(x: VNode; idx: int): VNode = x.kids[idx]
proc add*(parent, kid: VNode) = parent.kids.add kid proc add*(parent, kid: VNode) = parent.kids.add kid
proc newVNode*(kind: VNodeKind): VNode = VNode(kind: kind) proc newVNode*(kind: VNodeKind): VNode = VNode(kind: kind, key: -1)
proc tree*(kind: VNodeKind; kids: varargs[VNode]): VNode = proc tree*(kind: VNodeKind; kids: varargs[VNode]): VNode =
result = newVNode(kind) result = newVNode(kind)
@ -88,8 +103,8 @@ proc tree*(kind: VNodeKind; attrs: openarray[(cstring, cstring)];
result = tree(kind, kids) result = tree(kind, kids)
for a in attrs: result.setAttr(a[0], a[1]) for a in attrs: result.setAttr(a[0], a[1])
proc text*(s: string): VNode = VNode(kind: VNodeKind.text, text: cstring(s)) proc text*(s: string): VNode = VNode(kind: VNodeKind.text, text: cstring(s), key: -1)
proc text*(s: cstring): VNode = VNode(kind: VNodeKind.text, text: s) proc text*(s: cstring): VNode = VNode(kind: VNodeKind.text, text: s, key: -1)
iterator items*(n: VNode): VNode = iterator items*(n: VNode): VNode =
for i in 0..<n.kids.len: yield n.kids[i] for i in 0..<n.kids.len: yield n.kids[i]