apsara.vdom — net.clojars.ajaym/apsara 0.1.0

add-node! cljs

(add-node! parent-id node)

(add-node! parent-id node right-sibling-id)

annotate-node cljs

(annotate-node node parent-id)

attr cljs

(attr node)

attr? cljs

(attr? node)

cache-it! cljs

(cache-it! node)

children cljs

(children node)

children? cljs

(children? node)

delete-char-at! cljs

(delete-char-at! id offset)

enclose! cljs

(enclose! id enclosing-node)

fork! cljs

(fork! id nlist)

id-counter cljs

index-of cljs

(index-of node)

insert-char-at! cljs

(insert-char-at! id c offset)

last-child? cljs

(last-child? node)

leaf? cljs

(leaf? node)

left-of cljs

(left-of id)

leftmost-child-of cljs

(leftmost-child-of id)

mod-str! cljs

(mod-str! node str)

new-id cljs

(new-id)

(new-id old-id)

new-spec cljs

(new-spec)

node-from-id cljs

(node-from-id id)

node-lookup cljs

To speed up random access to the tree we have this lookup table. The flow is like so:

1. User clicks on a dom node on which we have registered a mouse-click event handler.
2. The browser would have changed the cursor position which we get by calling the getSelection API. We store the selection in cursor/selection.
3. When the next key is pressed we get the DOM node's id which we independently track in our hiccup data structure.

nth-child cljs

(nth-child node n)

on-spec-change cljs

(on-spec-change key reference old new)

parent-of cljs

(parent-of node)

picljid cljs

(picljid node)

remove-node! cljs

(remove-node! id)

replace-node! cljs

(replace-node! id new-node)

reset-id-counter! cljs

(reset-id-counter!)

reset-spec! cljs

(reset-spec!)

right-of cljs

(right-of id)

right-sibling cljs

(right-sibling id)

rightmost-child-of cljs

(rightmost-child-of id)

ROOT-ID cljs

root? cljs

(root? node)

shell-out! cljs

(shell-out! id)

siblings cljs

(siblings node)

spec cljs

The spec is our data structure to maintain editor state. spec is specified in hiccup. Note: Why we don't use zippers Zippers are neat. But they don't have a way to jump to a random node in the tree. We need to jump to a random node when the user clicks on a corresponding DOM element. For these cases, using zippers, we would have to search the tree for the given element, an O(log n) operation.

spec-list cljs

spec-of cljs

(spec-of node)

split-subtree-at cljs

(split-subtree-at id offset)

strlen cljs

(strlen id)

substitute! cljs

(substitute! id nlist)

tag cljs

(tag node)

to-string cljs

(to-string id)

transplant! cljs

(transplant! nlist new-parent-id)

uncache-it! cljs

(uncache-it! node)

walk cljs

(walk id func)

with-attr cljs

(with-attr node nattr)