Hallo Olaf, Am Dienstag, den 17.02.2015, 11:05 +0100 schrieb Dr. Olaf Klinke:
I have a function that builds a (cyclic) data structure for searching text. The resulting object can be serialized and re-built. Real-world problems would, however, result in a tree with about 10^9 nodes. I take it that standard data type declarations are not very memory-efficient, so my (fully evaluated) search tree would not fit into memory as a heap object. Its serialised form should be of tractable size, e.g. by storing an array of labels and the tree structure as a bit array of parentheses.
you say cyclic, but you also say it is a tree. Do you mean that it locally looks like a tree, but is in fact a graph, due to self-references?
I'd like to separate serialization (IO) from traversal of the stucture (pure), but how can one avoid the entire heap object from being built? Can lazyness be exploited?
I would say „yes“, but need more information for a more concrete answer :-) Grüße aus Karlsruhe, Joachim -- Joachim “nomeata” Breitner mail@joachim-breitner.de • http://www.joachim-breitner.de/ Jabber: nomeata@joachim-breitner.de • GPG-Key: 0xF0FBF51F Debian Developer: nomeata@debian.org