Welcome to the Second Life Forums Archive

These forums are CLOSED. Please visit the new forums HERE

Fast list in list storage?
Senuka Harbinger
A-Life, one bit at a time
Join date: 24 Oct 2005
Posts: 491
08-08-2007 14:31
has anyone come up with a fast method of storing lists within lists of arbitrary length, that can also have retrieval and reconstruction relatively fast?
_____________________
My SLExchange shop

Typos are forgiven; desecrating the english language with reckless abandon and necrophilic acts is not.


The function is working perfectly fine. It's just not working the way you wanted it to work.
Darien Caldwell
Registered User
Join date: 12 Oct 2006
Posts: 3,127
08-08-2007 16:02
yes, send it out to an external server :p
_____________________
RJ Source
Green Sky Labs
Join date: 10 Jan 2007
Posts: 272
08-08-2007 16:22
I did use one way once, which was relatively fast.

For example, I needed to store arbitrary and dynamically changing submenu definitions.

So ListM (for example) contained all menu names.
ListB contained all the menu items.

So if ListM had ["Menu1", "Menu2"]
ListB might have ["Button1", "Button2", "Button3, "Button1, "Button2"]
Where the first 3 items were in Menu1, and the next two in Menu2.

Then I had two more lists.
Starts = [0, 3]
Ends = [2, 4]

So the position of the menu name in ListM is used to get the position of the start and end pointers in the Starts and Ends lists into ListB:

Menu1 start in ListB = 0, and end in ListB = 2
Meny2 start in ListB = 3, and end in ListB = 4

And then to add a new menu, the name appends to ListM, the new subitems append to ListB, the start point in ListB is appended to Starts, and the end pointer in ListB is appended to ends.

The tradeoff is that there is more processing time to actually make dynamic changes to already defined menus, but for one time dynamic definitions, based on notecard values for example, it worked well enough.