--- a/AATree.st	Thu Oct 13 12:22:38 2016 +0200
+++ b/AATree.st	Thu Oct 13 12:25:21 2016 +0200
@@ -290,9 +290,12 @@
 
 performance
 "
+    warning: the times below are very old, taken on a pentium-class machine.
+    Your times will be much shorter, so only look at the ratios.
+    
     SortedCollection keeps the collection sorted and dense.
-    It is super quick, when adding in 'almost sorted' order, or when only
-    a few elements are to be added later.
+    It is super fast, when adding in 'almost sorted' or almost reverse-sorted order, 
+    or when only a few elements are to be added later.
     To create a big sorted collection, it is better to first collect them all unsorted in
     an orderedCollection, then convert in one operation using asSortedCollection.