Hi,
Mat is right though: TiddlyWiki is not optimized for speed. In almost
all cases TiddlyWiki prefers structural quality, correctness and
simplicity of implementation over speed. Also a lot of features are only
implemented just so they are available, but noone optimized them yet.
The search for instance (correct me if I am wrong with the following)
applies a regex to all tiddlers in which it searches, which in simple
cases (like most searches) means quadratic runtime at minimum. (So to
explain it: if you double the tiddler count, the search will take 4
times the time, provided all tiddlers are equal length).
So to answer the question: I guess Jeremy is aware that at some point
the search becomes very slow in larger TW files and that there are
significant speedups possible, however they will require work and are
currently not important enough to be worked on. So it will probably get
quicker, when TW gets more mature.
/Andreas
P.S.: Also, I have a question: Provided I would have lazy loading set up
for most of my tiddlers. Does doing a search mean that all tiddlers will
be loaded when I do the search ? Because .. It sure seems that way.
--
You received this message because you are subscribed to the Google Groups
"TiddlyWiki" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to tiddlywiki+unsubscr...@googlegroups.com.
To post to this group, send email to tiddlywiki@googlegroups.com.
Visit this group at http://groups.google.com/group/tiddlywiki.
For more options, visit https://groups.google.com/d/optout.
