I think that it will be also good to introduce internal
hash flag which will force resorting on 1-st access and
implement internal b-tree structure for hashes. It's waiting
for really long time. I'll try to make these modifications in
some spare time.
Hi,
does b-tree have a big advantage over simple binary search in case all
data is IN MEMORY. I see no advantage in data lookup. There is advantage
in data insertion in case of large number of keys.
Best regards,
Mindaugas
P.S. b-tree is implemented in sqlmix. If there are more needs for this
algorithm, we can create some "universal" module in hbvm library and use
it in all cases (hashes, sqlmix, adsx, etc.), to avoid code duplication.
Meanwhile I can hard code support for binary
sorted hashes to serialize procedure. It should give noticable
performance improvement so the results will be comparable to
current __I18N_LOADFROMMEMORY() function.
BTW I do not see in current __I18N_*() functions sth for binary
array sorting so they will not work correctly with national
characters if you will try to sort the array at Harbour level.
best regards,
Przemek
_______________________________________________
Harbour mailing list
Harbour@harbour-project.org
http://lists.harbour-project.org/mailman/listinfo/harbour
_______________________________________________
Harbour mailing list
Harbour@harbour-project.org
http://lists.harbour-project.org/mailman/listinfo/harbour
