--- a/Collection.st	Tue Jun 21 23:15:13 2016 +0200
+++ b/Collection.st	Thu Jun 23 12:49:17 2016 +0200
@@ -1,5 +1,3 @@
-"{ Encoding: utf8 }"
-
 "
  COPYRIGHT (c) 1989 by Claus Gittinger
               All Rights Reserved
@@ -255,7 +253,7 @@
 
     |newCollection|
 
-    newCollection := self new:aCollection size.
+    newCollection := self new.
     newCollection addAll:aCollection.
     ^newCollection
 !
@@ -4333,7 +4331,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 
@@ -5679,7 +5677,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."
 
@@ -5699,7 +5697,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.
@@ -5769,7 +5767,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."