Le 30/11/2012 21:47, Tobias Boege a écrit : > ...binary search trees were anticipated very much?
I don't know, but it will be useful for sure. We can live without List as soon as we have arrays, but binary trees (and red-black trees) are irreplaceable! Regards, -- Benoît Minisini ------------------------------------------------------------------------------ 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
