On Friday, May 14, 2021 at 6:37:16 PM UTC+2 Mohammad wrote: One more question: > > If you add a new key:value to a dataTiddler in Tiddlywiki, does it > recreate the whole tiddler again? Seems yes ( I am talking about this with > your recent discussion on immutability of tiddlers) >
Yes. It's just like any other tiddler with the same size. .. But writing to internal storage is fast. > If s, then a big dataTiddler like the one has few hundred keys, then it > will affect the performance > As I wrote. If you add a new entry to a data tiddler, the per tiddler "cache" will be cleared. The next time you access an element the cache will be created again. Every other "read" action will directly use the cached indexes. So it should be reasonably fast. The performance penalty for data tiddlers is in the refresh cycle, if many elements of the data tiddler are shown _and_ the tiddler is changed. ... It may cause a "refresh cascade" that is less performant than using single tiddlers. I'm currently working on a "filter performance" widget, that will allow users to see, how filters behave. ... It may be part of the Advanced Search "Filter tab", if "performance instrumentation" option is active. ... The discussion can be found at: https://github.com/Jermolene/TiddlyWiki5/issues/5674 -mario -- 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 [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/tiddlywiki/41be435c-a297-4b09-b83b-5d5d420d5058n%40googlegroups.com.
