--- a/Collection.st Sun Jul 01 10:32:42 2018 +0200
+++ b/Collection.st Sun Jul 01 10:33:19 2018 +0200
@@ -1,5 +1,3 @@
-"{ Encoding: utf8 }"
-
"
COPYRIGHT (c) 1989 by Claus Gittinger
All Rights Reserved
@@ -370,22 +368,6 @@
^ self includesIdentical:anObject.
! !
-!Collection methodsFor:'Compatibility-Dolphin'!
-
-includesAllOf:aCollection
- "same as #includesAll for Squeak/Dolphin compatibility."
-
- ^ self includesAll:aCollection
-
- "
- #(1 2 3 4 5 6 7) includesAllOf:#(1 2 3)
- #('hello' 'there' 'world') includesAllOf:#('hello' 'world')
- #(1 2 3 4 5 6 7) includesAllOf:#(7 8 9)
- #(1 2 3 4 5 6 7) includesAllOf:#(8 9 10)
- "
-
- "Created: / 01-07-2018 / 10:31:57 / Claus Gittinger"
-! !
!Collection methodsFor:'Compatibility-Squeak'!
@@ -4630,7 +4612,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
@@ -5989,7 +5971,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."
@@ -6009,7 +5991,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.
@@ -6086,7 +6068,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."