It may seem counter intuitive at first, but a great methodology I like to use to learn new things is throw out my tool box and solve an old problem. Plato said "Necessity is the mother of invention". In other words, we tend not to explore when what we have works. This is only a catalyst process. Unless the new tool is actually superior, I use the old tool to solve the problem when it comes up. The new tool usually fits better somewhere else yet undiscovered.
In this particular case, I am trying to conserve as much space as possible in what would otherwise be a hash of arrays (HoA). Since I know inadvance exactly how many bytes total each array needs to be, I was hoping to use the equivalent of a C struct with pack/unpack resulting in a single hash. The trouble is that I need to include a reference and have it still work when it is unpacked.
As you can see, it is unlikely that this solution is a good fit to this problem. This doesn't mean it isn't worth pursuing since it is only an intermediate process. In fact, I doubt any process that converts a stringified reference back into a reference is very safe but the hunt for knowledge must go on. Does anyone know of a canned solution for this? In the chatterbox, tye indicated he believed there was an XS module but I couldn't find it. japhy is off working on one because it intrigued him as well.
While the problem outlined is my main focus at the moment, any memory saving/controlling techniques would be appreciated.
Cheers - L~R
In reply to Techniques On Saving Memory by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |