Thank you Randy,

I already compiled it and it is much much better then my posting. I am going through the code now to get a feel for your approach..

Thank you..
Charlie
Posted on 2003-06-07 01:44:22 by C. Wardell
I have coded a version which takes less than a minute per GB and this is with non-optimal byte scanner! I'll create an MMX scanner and post in the algo section. :)

It's going at 1800MB/min ;)
Here: http://www.asmcommunity.net/board/index.php?topic=13727
Posted on 2003-06-07 14:10:13 by bitRAKE

I have coded a version which takes less than a minute per GB and this is with non-optimal byte scanner! I'll create an MMX scanner and post in the algo section. :)

It's going at 1800MB/min ;)
Here: http://www.asmcommunity.net/board/index.php?topic=13727

Well, that sounds much better!
Cheers,
Randy Hyde
Posted on 2003-06-08 17:04:57 by rhyde
Wardell:
My point isn?t to show you how to do a fast search and count routine, because you mention what you need is generate a unique consecutive number for your data base; isn?t it ?. Well my suggestion is you must to create a info file with the last number you?d used and from this simply add 1 to generate the new one.
Sure you need to refresh the lnu (last number used) to reflect the state of your base for the next register to add.
Another improvement may be to include in this info file, the ID?s numbers of free registers product of deletion to use on new ones or wathever you like.;)
Posted on 2003-06-18 13:39:46 by wcardoso