Message from JavaScript discussions

May 2017

— Same result as "Hello".split('')


> Object.values("Hello")
[ 'H', 'e', 'l', 'l', 'o' ]
> "Hello".split('')
[ 'H', 'e', 'l', 'l', 'o' ]

— I still don't know if navigating the tree is possible without looping

— An iterative approach will either need a loop or recursion

— Or metarecursion with a loop

— Are there other approaches?

— I could try recursion, but I doubt it will make much difference

— I think it would be heaps slower haha

— Hmm..

— Would it be faster if I created the whole tree from the second first char and appended the chain to this after?

Message permanent page

— I am still leaning towards seperating storage and representation, I think it would solve this issue by simplifying storage, thereby making it faster

Message permanent page

— I realize that .end might also not be the most elegant solution