> Just for the sake of discussion I've attached a performance > graph for various C++ data structures plus the Unrolled LL. > The tests where run on a dell vostro 1400 laptop. As you can > see the graphs show the ULL to be quite efficient for > insert/delete from the front/back of the list. I beleive this > is mainly due to the fact that a new node is not allocated > for the insert for each operation.
Yes, a stack would be a good use for ULL because front/back insert/delete can be highly efficient, and you can afford 0 wasted space. I'd love to see the actual data you tried to attach, but I couldn't because the attachment was blank except for a message footer. John _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
