On vie, 2003-07-25 at 04:41, Albert Pala wrote: > i want to ask if someone can help me: > in my program at starup i create huge balanced tree ( ~3*10^6 items ) from fixed > file. > it took about 8s on my computer. > how can i rearrange the input file to get shorter time ? ( minimize number of > operation of balancing tree during inserts ) ? > currently input file is sorted by key.
You could try to write the file out as a DBHashTable which can do a balanced tree in a file. See http://dbh.sourceforge.net Edscott > > greetings > albert. > > > _______________________________________________ > gtk-list mailing list > [EMAIL PROTECTED] > http://mail.gnome.org/mailman/listinfo/gtk-list _______________________________________________ gtk-list mailing list [EMAIL PROTECTED] http://mail.gnome.org/mailman/listinfo/gtk-list