Am Samstag, 8. Dezember 2007 schrieb Julian Seward: > > On Saturday 08 December 2007 12:10, Christoph Bartoschek wrote: > > > > In my opinion the problem is, that you have lost transitivity. Assume > > Word > > If transitivity is lost, then it means fast_cmp is broken.
Yes. The relation established by the comparison function has to be transitive. This is not the case here. Therefore the function should not be used. I've shown how this affects the AVL tree in theory and implementation. This also fits one fact that Tom gives: There have to be additional additions and deletions to the tree till the values are not found. Christoph ------------------------------------------------------------------------- SF.Net email is sponsored by: Check out the new SourceForge.net Marketplace. It's the best place to buy or sell services for just about anything Open Source. http://sourceforge.net/services/buy/index.php _______________________________________________ Valgrind-developers mailing list Valgrind-developers@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/valgrind-developers
