--- a/Collection.st	Fri Mar 17 11:46:55 2017 +0100
+++ b/Collection.st	Fri Mar 17 11:58:32 2017 +0100
@@ -1,3 +1,5 @@
+"{ Encoding: utf8 }"
+
 "
  COPYRIGHT (c) 1989 by Claus Gittinger
               All Rights Reserved
@@ -4419,7 +4421,7 @@
     aStream nextPut:$)
 
     "
-     #(1 2 3 'hello' $a $ü) printOn:Transcript
+     #(1 2 3 'hello' $a $ü) printOn:Transcript
      (Array new:100000) printOn:Transcript
      (Array new:100000) printOn:Stdout
      (Array new:100000) printString size
@@ -5724,10 +5726,11 @@
     "return the number of elements, that the receiver is prepared to take. 
      For most collections, this is the actual size. 
      However, some have more space preallocated to allow
-     for faster adding of elements (i.e. there are logical vs. physical sizes).
-     Not used by the system; added for ST-80 compatibility."
+     for faster adding of elements (i.e. there are logical vs. physical sizes)."
 
     ^ self size
+
+    "Modified (comment): / 17-03-2017 / 11:50:34 / stefan"
 !
 
 identicalValuesComputedBy:aBlock
@@ -5776,7 +5779,7 @@
 includesAll:aCollection
     "return true if the receiver includes all elements of
      the argument, aCollection; false if any is missing.
-     Notice: this method has O² runtime behavior and may be
+     Notice: this method has O² runtime behavior and may be
              slow for big receivers/args.
              Think about using a Set, or Dictionary."
 
@@ -5796,7 +5799,7 @@
      Return false if it includes none.
      Uses #= (value compare)
      Notice:
-        this method has O² runtime behavior for some subclasses and may be slow for big receivers/args.
+        this method has O² runtime behavior for some subclasses and may be slow for big receivers/args.
         Think about using a Set or Dictionary.
         Some speedup is also possible, by arranging highly
         probable elements towards the beginning of aCollection, to avoid useless searches.
@@ -5873,7 +5876,7 @@
      Return false if it includes none.
      Use identity compare for comparing.
      Notice:
-        this method has O² runtime behavior for some subclasses and may be slow for big receivers/args.
+        this method has O² runtime behavior for some subclasses and may be slow for big receivers/args.
         Think about using a Set or Dictionary.
         Some speedup is also possible, by arranging highly
         probable elements towards the beginning of aCollection, to avoid useless searches."