Hi, I would like to write sort of 'macrobenchmarks' for libgee. I would like to:
- Create collection - Run algorithm on it - Report results For example for queues: - Create queue - Run breath-first traversal on random tree I don't have many ideas for benchmarks. Does anyone how to benchmark: - List: ? - Set: ? - Sorted set: ? - Queue: Breath-first traversal, ? - Priority queue: Dijkstra algorithm, ? Any ideas what can I use? I would be grateful for any ideas. Best regards _______________________________________________ libgee-list mailing list [email protected] http://mail.gnome.org/mailman/listinfo/libgee-list
