Compare commits
18 commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
78a47158a1 | ||
|
|
e63a7dbb21 | ||
|
|
cd78f5085f | ||
|
|
4c582d7c06 | ||
|
|
d3e1d28c89 | ||
|
|
91679f8ae6 | ||
|
|
8bdaab3f82 | ||
|
|
ebccc4e9a1 | ||
|
|
ed70a0cbfc | ||
|
|
393c336f90 | ||
|
|
e434517dd1 | ||
|
|
2b9880a9a2 | ||
|
|
f5e9db55c3 | ||
|
|
a304322286 | ||
|
|
443b24de3e | ||
|
|
41df9b769f | ||
|
|
1ad978804c | ||
|
|
23fc331626 |
6 changed files with 206 additions and 58 deletions
|
|
@ -165,6 +165,7 @@ proc updateDirtyElements(parent, current: Node, newNode: VNode) =
|
||||||
#if dirtyCount <= 0: return
|
#if dirtyCount <= 0: return
|
||||||
|
|
||||||
proc updateElement(parent, current: Node, newNode, oldNode: VNode) =
|
proc updateElement(parent, current: Node, newNode, oldNode: VNode) =
|
||||||
|
newNode.dom = oldNode.dom
|
||||||
if not equalsShallow(newNode, oldNode):
|
if not equalsShallow(newNode, oldNode):
|
||||||
detach(oldNode)
|
detach(oldNode)
|
||||||
let n = vnodeToDom(newNode)
|
let n = vnodeToDom(newNode)
|
||||||
|
|
@ -175,7 +176,6 @@ proc updateElement(parent, current: Node, newNode, oldNode: VNode) =
|
||||||
elif newNode.kind != VNodeKind.text:
|
elif newNode.kind != VNodeKind.text:
|
||||||
let newLength = newNode.len
|
let newLength = newNode.len
|
||||||
var oldLength = oldNode.len
|
var oldLength = oldNode.len
|
||||||
let minLength = min(newLength, oldLength)
|
|
||||||
assert oldNode.kind == newNode.kind
|
assert oldNode.kind == newNode.kind
|
||||||
when defined(simpleDiff):
|
when defined(simpleDiff):
|
||||||
for i in 0..min(newLength, oldLength)-1:
|
for i in 0..min(newLength, oldLength)-1:
|
||||||
|
|
@ -188,36 +188,46 @@ proc updateElement(parent, current: Node, newNode, oldNode: VNode) =
|
||||||
detach(oldNode[i])
|
detach(oldNode[i])
|
||||||
current.removeChild(current.lastChild)
|
current.removeChild(current.lastChild)
|
||||||
else:
|
else:
|
||||||
var commonPrefix = 0
|
var left = 0
|
||||||
while commonPrefix < minLength and
|
var rightNew = newLength - 1
|
||||||
equalsTree(newNode[commonPrefix], oldNode[commonPrefix]):
|
var rightOld = oldLength - 1
|
||||||
inc commonPrefix
|
|
||||||
|
|
||||||
var oldPos = oldLength - 1
|
while left <= min(rightNew, rightOld):
|
||||||
var newPos = newLength - 1
|
var minRight = min(rightOld, rightNew)
|
||||||
while oldPos >= commonPrefix and newPos >= commonPrefix and
|
|
||||||
equalsTree(newNode[newPos], oldNode[oldPos]):
|
|
||||||
dec oldPos
|
|
||||||
dec newPos
|
|
||||||
|
|
||||||
var pos = min(oldPos, newPos) + 1
|
while left <= minRight and
|
||||||
for i in commonPrefix..pos-1:
|
equalsTree(newNode[left], oldNode[left]):
|
||||||
updateElement(current, current.childNodes[i], newNode[i], oldNode[i])
|
newNode[left] = oldNode[left]
|
||||||
|
inc left
|
||||||
|
|
||||||
var nextChildPos = oldPos + 1
|
while rightOld > left and rightNew > left and
|
||||||
while pos <= newPos:
|
equalsTree(newNode[rightNew], oldNode[rightOld]):
|
||||||
if nextChildPos == oldLength:
|
newNode[rightNew] = oldNode[rightOld]
|
||||||
current.appendChild(vnodeToDom(newNode[pos]))
|
dec rightOld
|
||||||
|
dec rightNew
|
||||||
|
|
||||||
|
minRight = min(rightOld, rightNew)
|
||||||
|
if left <= minRight:
|
||||||
|
updateElement(current, oldNode[left].dom, newNode[left], oldNode[left])
|
||||||
|
inc left
|
||||||
|
|
||||||
|
if left < minRight:
|
||||||
|
updateElement(current, oldNode[rightOld].dom, newNode[rightNew], oldNode[rightOld])
|
||||||
|
dec rightNew
|
||||||
|
dec rightOld
|
||||||
|
|
||||||
|
var posNextElem = rightOld + 1
|
||||||
|
var isPushBack = posNextElem == oldLength
|
||||||
|
while left <= rightNew:
|
||||||
|
if isPushBack:
|
||||||
|
current.appendChild(vnodeToDom(newNode[left]))
|
||||||
else:
|
else:
|
||||||
current.insertBefore(vnodeToDom(newNode[pos]), current.childNodes[nextChildPos])
|
current.insertBefore(vnodeToDom(newNode[left]), oldNode[posNextElem].dom)
|
||||||
# added new Node, so old state of VDOM have one more Node
|
inc left
|
||||||
inc oldLength
|
|
||||||
inc pos
|
|
||||||
inc nextChildPos
|
|
||||||
|
|
||||||
for i in pos..oldPos:
|
for i in left..rightOld:
|
||||||
|
current.removeChild(oldNode[i].dom)
|
||||||
detach(oldNode[i])
|
detach(oldNode[i])
|
||||||
current.removeChild(current.childNodes[pos])
|
|
||||||
|
|
||||||
when false:
|
when false:
|
||||||
var drawTimeout: Timeout
|
var drawTimeout: Timeout
|
||||||
|
|
@ -256,6 +266,8 @@ proc redraw*() =
|
||||||
else:
|
else:
|
||||||
dodraw()
|
dodraw()
|
||||||
|
|
||||||
|
proc redrawForce*() = dodraw()
|
||||||
|
|
||||||
proc init(ev: Event) =
|
proc init(ev: Event) =
|
||||||
reqFrame(dodraw)
|
reqFrame(dodraw)
|
||||||
|
|
||||||
|
|
@ -263,6 +275,12 @@ proc setRenderer*(renderer: proc (): VNode) =
|
||||||
dorender = renderer
|
dorender = renderer
|
||||||
window.onload = init
|
window.onload = init
|
||||||
|
|
||||||
|
proc setRendererOnly*(renderer: proc (): VNode) =
|
||||||
|
dorender = renderer
|
||||||
|
|
||||||
|
proc setOnloadOnly*() =
|
||||||
|
window.onload = init
|
||||||
|
|
||||||
proc addEventHandler*(n: VNode; k: EventKind; action: EventHandler) =
|
proc addEventHandler*(n: VNode; k: EventKind; action: EventHandler) =
|
||||||
## Implements the foundation of Karax's event management.
|
## Implements the foundation of Karax's event management.
|
||||||
## Karax DSL transforms ``tag(onEvent = handler)`` to
|
## Karax DSL transforms ``tag(onEvent = handler)`` to
|
||||||
|
|
|
||||||
|
|
@ -4,7 +4,7 @@ from strutils import startsWith, toLowerAscii
|
||||||
|
|
||||||
const
|
const
|
||||||
StmtContext = ["kout", "inc", "echo", "dec", "!"]
|
StmtContext = ["kout", "inc", "echo", "dec", "!"]
|
||||||
SpecialAttrs = ["id", "class", "value", "key"]
|
SpecialAttrs = ["id", "class", "value", "key", "track"]
|
||||||
|
|
||||||
proc getName(n: NimNode): string =
|
proc getName(n: NimNode): string =
|
||||||
case n.kind
|
case n.kind
|
||||||
|
|
|
||||||
|
|
@ -102,10 +102,12 @@ type
|
||||||
kind*: VNodeKind
|
kind*: VNodeKind
|
||||||
key*: VKey
|
key*: VKey
|
||||||
id*, class*, text*: cstring
|
id*, class*, text*: cstring
|
||||||
|
track*: int
|
||||||
kids: seq[VNode]
|
kids: seq[VNode]
|
||||||
# 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)]
|
||||||
|
when false:
|
||||||
hash*: Hash
|
hash*: Hash
|
||||||
validHash*: bool
|
validHash*: bool
|
||||||
dom*: Node ## the attached real DOM node. Can be 'nil' if the virtual node
|
dom*: Node ## the attached real DOM node. Can be 'nil' if the virtual node
|
||||||
|
|
@ -146,6 +148,10 @@ proc eq*(a, b: VNode): bool =
|
||||||
|
|
||||||
proc setAttr*(n: VNode; key: cstring; val: cstring = "") =
|
proc setAttr*(n: VNode; key: cstring; val: cstring = "") =
|
||||||
if n.attrs.isNil:
|
if n.attrs.isNil:
|
||||||
|
when true:
|
||||||
|
let x = @[key, val]
|
||||||
|
shallowCopy n.attrs, x
|
||||||
|
else:
|
||||||
n.attrs = @[key, val]
|
n.attrs = @[key, val]
|
||||||
else:
|
else:
|
||||||
for i in countup(0, n.attrs.len-2, 2):
|
for i in countup(0, n.attrs.len-2, 2):
|
||||||
|
|
@ -161,6 +167,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 `[]=`*(x: VNode; idx: int; y: VNode) = x.kids[idx] = y
|
||||||
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, key: -1)
|
proc newVNode*(kind: VNodeKind): VNode = VNode(kind: kind, key: -1)
|
||||||
|
|
||||||
|
|
@ -216,6 +223,7 @@ proc toString*(n: VNode; result: var string; indent: int) =
|
||||||
for i in 1..indent: result.add ' '
|
for i in 1..indent: result.add ' '
|
||||||
result.add "\L</" & $n.kind & ">"
|
result.add "\L</" & $n.kind & ">"
|
||||||
|
|
||||||
|
when false:
|
||||||
proc calcHash*(n: VNode) =
|
proc calcHash*(n: VNode) =
|
||||||
if n.validHash: return
|
if n.validHash: return
|
||||||
n.validHash = true
|
n.validHash = true
|
||||||
|
|
|
||||||
16
uibench/index.html
Normal file
16
uibench/index.html
Normal file
|
|
@ -0,0 +1,16 @@
|
||||||
|
<!doctype html>
|
||||||
|
<html lang="en">
|
||||||
|
<head>
|
||||||
|
<meta charset="UTF-8">
|
||||||
|
<link href="https://localvoid.github.io/uibench-base/0.1.0/styles.css" rel="stylesheet" />
|
||||||
|
<title>UI Benchmark: React</title>
|
||||||
|
</head>
|
||||||
|
<body>
|
||||||
|
|
||||||
|
<div id="ROOT"></div>
|
||||||
|
|
||||||
|
<script src="https://localvoid.github.io/uibench-base/0.1.0/uibench.js"></script>
|
||||||
|
<script src="nimcache/nim_uibench.js" type="text/javascript"></script>
|
||||||
|
|
||||||
|
</body>
|
||||||
|
</html>
|
||||||
105
uibench/nim_uibench.nim
Normal file
105
uibench/nim_uibench.nim
Normal file
|
|
@ -0,0 +1,105 @@
|
||||||
|
import dom, vdom, karax, karaxdsl, jdict, jstrutils, kajax
|
||||||
|
|
||||||
|
type
|
||||||
|
HomeState {.importc.} = ref object
|
||||||
|
TableItemState {.importc.} = ref object
|
||||||
|
id: int
|
||||||
|
active: bool
|
||||||
|
props: seq[cstring]
|
||||||
|
TableState {.importc.} = ref object
|
||||||
|
items: seq[TableItemState]
|
||||||
|
AnimBoxState {.importc.} = ref object
|
||||||
|
id: int
|
||||||
|
time: int
|
||||||
|
AnimState {.importc.} = ref object
|
||||||
|
items: seq[AnimBoxState]
|
||||||
|
TreeNodeState {.importc.} = ref object
|
||||||
|
id: int
|
||||||
|
container: bool
|
||||||
|
children: seq[TreeNodeState]
|
||||||
|
TreeState {.importc.} = ref object
|
||||||
|
root: TreeNodeState
|
||||||
|
AppState {.importc.} = ref object
|
||||||
|
location: cstring
|
||||||
|
home: HomeState
|
||||||
|
table: TableState
|
||||||
|
anim: AnimState
|
||||||
|
tree: TreeState
|
||||||
|
|
||||||
|
var appState: AppState
|
||||||
|
|
||||||
|
proc createTableCell(id: cstring): VNode =
|
||||||
|
proc tableCellClick(ev: karax.Event; n: VNode) =
|
||||||
|
kout "Clicked" & id
|
||||||
|
result = buildHtml(td(class="TableCell", onclick=tableCellClick)):
|
||||||
|
text id
|
||||||
|
|
||||||
|
proc createTableRow(item: TableItemState): VNode =
|
||||||
|
let className = if item.active: cstring"TableRow active" else: cstring"TableRow"
|
||||||
|
result = buildHtml(tr(class=className, `data-id` = &item.id)):
|
||||||
|
createTableCell("#" & &item.id)
|
||||||
|
for i in 0..<len(item.props):
|
||||||
|
createTableCell(item.props[i])
|
||||||
|
|
||||||
|
proc tableCreateVNode(data: TableState): VNode =
|
||||||
|
result = buildHtml(table(class="Table")):
|
||||||
|
tbody:
|
||||||
|
for child in data.items:
|
||||||
|
createTableRow(child)
|
||||||
|
|
||||||
|
proc createAnimBox(item: AnimBoxState): VNode =
|
||||||
|
let time = item.time
|
||||||
|
let t10 = time mod 10
|
||||||
|
let color = float(t10) / 10
|
||||||
|
let divStyles = cstring"border-radius: " & &t10 &
|
||||||
|
"px; background: rgba(0,0,0," & cstring($color) & ")"
|
||||||
|
result = flatHtml(tdiv(class="AnimBox", `data-id` = &item.id, style=divStyles))
|
||||||
|
|
||||||
|
proc animCreateVNode(data: AnimState): VNode =
|
||||||
|
result = buildHtml(tdiv(class="Anim")):
|
||||||
|
for child in data.items:
|
||||||
|
createAnimBox(child)
|
||||||
|
|
||||||
|
proc createTreeNode(data: TreeNodeState): VNode =
|
||||||
|
result = buildHtml(ul(class="TreeNode")):
|
||||||
|
for n in data.children:
|
||||||
|
if n.container:
|
||||||
|
createTreeNode(n)
|
||||||
|
else:
|
||||||
|
li(class="TreeLeaf"):
|
||||||
|
text &n.id
|
||||||
|
|
||||||
|
proc treeCreateVNode(data: TreeState): VNode =
|
||||||
|
result = buildHtml(tdiv(class="Tree")):
|
||||||
|
createTreeNode(data.root)
|
||||||
|
|
||||||
|
proc update(): VNode =
|
||||||
|
assert appState != nil
|
||||||
|
let location = appState.location
|
||||||
|
var children: VNode = nil
|
||||||
|
if location == cstring"table":
|
||||||
|
children = tableCreateVNode(appState.table)
|
||||||
|
elif location == cstring"anim":
|
||||||
|
children = animCreateVNode(appState.anim)
|
||||||
|
elif location == cstring"tree":
|
||||||
|
children = treeCreateVNode(appState.tree)
|
||||||
|
result = buildHtml():
|
||||||
|
tdiv(class="Main"):
|
||||||
|
children
|
||||||
|
|
||||||
|
proc a(state: AppState) =
|
||||||
|
appState = state
|
||||||
|
redrawForce()
|
||||||
|
|
||||||
|
proc myToJson[T](x: T): cstring {.importcpp: "JSON.stringify(#, null, ' ')".}
|
||||||
|
|
||||||
|
proc b(samples: RootRef) =
|
||||||
|
document.body.innerHTML = cstring"<pre>" & myToJson(samples) & cstring"</pre>"
|
||||||
|
|
||||||
|
proc init*(a: cstring, b: cstring) {.importc: "uibench.init", nodecl.}
|
||||||
|
proc run*(a: proc(state: AppState), b: proc(samples: RootRef)) {.importc: "uibench.run", nodecl.}
|
||||||
|
|
||||||
|
init(cstring"Nim-karax", cstring"0.6.1")
|
||||||
|
|
||||||
|
setRendererOnly update
|
||||||
|
run(a, b)
|
||||||
1
uibench/nim_uibench.nims
Normal file
1
uibench/nim_uibench.nims
Normal file
|
|
@ -0,0 +1 @@
|
||||||
|
--path: "../src"
|
||||||
Loading…
Add table
Add a link
Reference in a new issue