Arrays: new and old keys, i

[Mark Brownell]

>From: Mark Wieder <mwieder at ahsoftware.net>
...
>Maybe a property of arrays would do this:
>
>set the sortorder of theDataA to empty -- unsorted, fastest
>set the sortorder of theDataA to "first input" -- FIFO
>set the sortorder of theDataA to "last input" -- LFIFO
>set the sortorder of theDataA to "alpha" -- alphabetic
>set the sortorder of theDataA to "MySortFunction" -- custom sort
>set the sortorder of theDataA to "random" -- just kidding
>
----

We can have both worlds right now. If you need sorted and unsorted keys & order of entry per dimensional layer or not all you need do is add layer [9] assuming you will never need layer 9.

">set the sortorder of theDataA to empty -- unsorted, fastest"

To All this thread,

Let's assume that there is no sort function for keys added or order of entry set controls.

put chars 4000 to 5000 of zigzag into myArray[4]["4000to5000"]
put "4000to5000, " after myArray[9]["sorted"]
put "4000to5000, " after myArray[9]["notSorted"]
put "4000to5000, " after myArray[9]["entryOrder"] -- same as unsorted
put "4000to5000, " after myArray[9]["globalEntryOrder"] -- for the whole array



Later you can sort the list of keys in myArray[9]["sorted"]

You now have a sorted and non sorted index map of all your keys. One by entry the other by sorting. What's more important is, is that you can keep track per dimensional layer. I'm for keeping the multidimensional layers fast. 

Mark