Fred, You are absolutely correct, the key order [unlike the slot allocation order] has no effect. [I was reviewing my old code which happened to maintain the descending key order ...]
I can also see [from the daily digest] that you've already made the very same suggestion, but somehow it went unnoticed: "Store the list starting at the end of the memory area. That way you can use one MVCL to move the list down (toward lower addresses) in memory to open the slot for a new entry. That should be much faster than moving every individual entry" -Victor- On Wed, 25 Aug 2010 08:32:32 +0200, Fred van der Windt <[email protected]> wrote: >> In your step #3 - if the list is kept in descending order >> [i.e. bottom-to-top] you can happily employ a single MVCL as >> it won't be overlapping. >> Of course, your binary search needs to know the order is descending. > >I don't think the order has anything to do with it. The list can be stored in ascending or descending order but it must be stored at the end of the allocated area (free space at the start of the area) to be able to use one MVCL(E) to move existing entries down in memory and create an opening for a new item. > >Fred!
