> -----Original Message----- > From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]]On Behalf Of > [EMAIL PROTECTED] > Sent: Wednesday, December 19, 2001 6:45 PM > To: [EMAIL PROTECTED] > Subject: [REBOL] Re: Objects, references & values
> have you checked that you need hash! permanently valid? > for me most of the time i create the hash > on the fly when i know i do a task with some searching. Hi, well that's quite a solution. Might not be very sophisticated but perhaps is the most pragmatic way. I have to check this out. The problem is that I have a very dynamic datastructure and need to do all kind of lookups to grow it etc. What I'm currently doing is creating a graph-layouter in Rebol. You can throw a simple graph-structure at it and it will create a niche layout for you. Traversing such graphs can become quite complex. > for normal storage i stay with a tree-form > (series of objects with series with objects..), > which can be saved/loaded pretty well. Yes, IMO that's the way to go. I would use the same or implement a simple saver/loader that flattens the datastructure and recreates it on loading. Robert -- To unsubscribe from this list, please send an email to [EMAIL PROTECTED] with "unsubscribe" in the subject, without the quotes.
