I'd suggest including a small test game to show an example of the few main points.
Adding/removing from parts of the list (start/middle/end)
Searching the list
Creating/deleting the list
Multiple lists per object
I'm definitely going to include a showcase ASL file for the full version (Land o' Lists). The documentation for the Lite version shows you how to do everything you've mentioned, I think. The Lite version doesn't include a function to return the count of how many times a specific item occurs in a list, however. Although I have that coded already, I didn't include it. Maybe I should - it's kind of basic and handy.
I've also changed the IsInList function to return the position of the first occurence of a searched-for item (rather than just a 1 if it finds the item at all, and a 0 if it doesn't). I thought I had already done that, but it appears I didn't save the changes.
.. On the subject of searching for multiple instances of an item in the list - can you put it into some sort of for loop?
So you can search the list, get the first instance, do something, search again, get the second instance.
You use a for-loop to iterate through the items in a list. For getting the first instance of an item, performing actions with/on it, then getting the next instance and repeating - I do have a scheme for that, but it's not coded yet. Will definitely be included in the full version. The same scheme will also be available to step through all the items in a list without having to use a for-loop. (IE, GetNext, GetPrevious, GetFirst, GetLast, etc.)
Seems like a good standard way to create and manage lists using properties.
I *think* it's pretty good, but then again I'm only one scripter, and may certainly be blinded by my own preferences/experience. With this implementation you can embed lists within lists to create any n-dimensional array you want. The arrays can be
jagged or rectangular. Looking at it a bit differently, you can implement a tree structure (of any depth) and use one procedure recursively to discover all the items in the tree. (Recursion was fun to figure out. I had to use a list (a stack) in order to achieve it.)