--- a/Collection.st Sun Feb 19 13:22:11 2017 +0100
+++ b/Collection.st Sun Feb 19 18:30:21 2017 +0100
@@ -1,5 +1,3 @@
-"{ Encoding: utf8 }"
-
"
COPYRIGHT (c) 1989 by Claus Gittinger
All Rights Reserved
@@ -345,7 +343,6 @@
^ self
! !
-
!Collection methodsFor:'Compatibility-ANSI'!
identityIncludes:anObject
@@ -3869,7 +3866,10 @@
(1 to:3) with:#(1 2 3 4) conform:[:a :b | a = b] --- raises an error
(1 to:3) with:#(1 22 3) conform:[:a :b | a = b]
(1 to:3) with:#(1 2 3) conform:[:a :b | a = b]
- "
+ (1 to:3) with:#('1' '2' '3') conform:[:a :b | a asString = b asString]
+ "
+
+ "Modified (comment): / 19-02-2017 / 18:30:08 / cg"
!
with:aCollection contains:aTwoArgBlock
@@ -4371,7 +4371,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
@@ -5728,7 +5728,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."
@@ -5748,7 +5748,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.
@@ -5825,7 +5825,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."