Nicholas Nethercote fcdc60441e Something I realised recently: in C, iterators are much better than
higher-order functions for traversing data structures.  The higher-order
approach is too clumsy due to the lack of polymorphism and closures;  you
have to use void* too much and it is more verbose than it should be.

Hence, I replaced all the uses of HT_first_match() and
HT_apply_to_all_nodes() with equivalent uses of the hashtable iterator.
Also replaced higher-order traversal functions for Memcheck's freed-list
and the thread stacks with iterators.  That last change changes the
core/tool interface, so I've increased the version number.







git-svn-id: svn://svn.valgrind.org/valgrind/trunk@4415
2005-08-15 01:52:02 +00:00
..
2005-08-14 04:29:12 +00:00
2005-08-14 17:36:07 +00:00
2005-06-20 15:51:07 +00:00
2005-06-28 00:12:31 +00:00
2005-07-02 01:59:28 +00:00
2005-08-14 23:52:32 +00:00
2005-07-23 11:36:03 +00:00
2005-07-08 18:23:40 +00:00
2005-08-14 22:14:55 +00:00
2005-06-26 11:56:32 +00:00