Hi folks, I only wanted to announce that I just finished the List class and thus, the gb.data component as far as it is, is completely usable. Use it!
I attached my personal test project (adt_test) which mainly does obscure things with the objects to check for memory leaks and errors. Valgrind doesn't report anything so I'm happy with that. It may be too dirty to learn from... There is, too, some benchmark project (stress_adt) comparing the performance of List and Variant[] in three well-chosen test cases because of which it is really not good to learn from, actually ;-) Sorry, the projects date back to when the component was named gb.adt, hence the names. I never opened them with the IDE so I don't know if there can be any problems with the IDE control files I wrote. I'll quickly document the remaining stuff and then rage on to new classes. IIRC, binary search trees were anticipated very much? Regards, Tobi
adt_test-0.0.3.tar.gz
Description: Binary data
stress_adt-0.0.3.tar.gz
Description: Binary data
------------------------------------------------------------------------------ Keep yourself connected to Go Parallel: TUNE You got it built. Now make it sing. Tune shows you how. http://goparallel.sourceforge.net
_______________________________________________ Gambas-user mailing list Gambas-user@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/gambas-user
