--- a/Collection.st Wed Sep 07 13:50:10 2016 +0100
+++ b/Collection.st Thu Sep 08 06:45:58 2016 +0200
@@ -1,5 +1,3 @@
-"{ Encoding: utf8 }"
-
"
COPYRIGHT (c) 1989 by Claus Gittinger
All Rights Reserved
@@ -4335,7 +4333,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
@@ -5634,10 +5632,10 @@
!
capacity
- "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.
+ "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."
^ self size
@@ -5689,7 +5687,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."
@@ -5709,7 +5707,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.
@@ -5779,7 +5777,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."