|
Post by chriscrawford on Sept 16, 2015 8:08:35 GMT -8
I have decided that I am wasting my time trying to adapt Facundo's code to my needs. He built a complex system to satisfy several tough requirements that do not apply to me. First, he had to keep memory usage down; at the time we felt it necessary to permit LogLizard to handle arbitrary large playings of the storyworld. I am willing to restrict the length of a log to something that can fit in memory. If necessary, I can add the capability to save the log data to disk.
In keeping with this requirement, Facundo designed a brilliant system that stored only key points in the log, and reconstituted them at runtime. I can dispense with all of that.
Also, Facundo had to deal with the complications arising from the client-server code. Again, that doesn't apply to me.
Therefore, I think it best to abandon Facundo's code completely and start from scratch writing my own code. It really shouldn't be that difficult: all I need is a tree in which each node is a short string. The structure of the tree is dictated by the place in the engine code that adds to the tree. Then I just display the tree in a window.
What could possibly go wrong? ;-)
|
|
|
Post by chriscrawford on Sept 16, 2015 11:44:57 GMT -8
12:44 I have gotten the basic data structure in place and I have the engine contributing nodes to the tree. So far, so good. Now I need to get the window to display to see what the tree looks like.
|
|
|
Post by chriscrawford on Sept 16, 2015 19:25:50 GMT -8
8:25 PM It's getting late and I have run into some problems getting the window up and running. There are all these damn independent threads running in the code whose functions completely escape me. I have started ripping them out to see what happens, and in most cases, they don't seem to have any effect. Most of them are set up to handle the client-server issues, especially all the delays associated with client-server communications. Since this code doesn't need client-server architecture, I can delete it without ill effect. I hope.
|
|