Class: IdentitySet

• Inheritance
• Description
• Instance protocol
  • Compatibility-Squeak
  • adding & removing
  • private
  • testing

Inheritance:

   Object
   |
   +--Collection
      |
      +--Set
         |
         +--IdentitySet
            |
            +--SemaphoreSet
            |
            +--SignalSet
            |
            +--WeakIdentitySet

Package:

stx:libbasic

Category:

Collections-Unordered

Version:

rev: 1.31 date: 2008/06/09 18:47:23

user: cg

file: IdentitySet.st directory: libbasic

module: stx stc-classLibrary: libbasic

Author:

Claus Gittinger

Description:

same as a Set but compares elements using == 
(i.e. they must be identical - not just equal in structure).
Since compare is on identity (using ==), hashing is also done via
#identityHash instead of #hash.

Instance protocol:

 copyWithout: anElement

return a new collection consisting of a copy of the receiver, with
ALL elements equal to elementToSkip are left out.
No error is reported, if elementToSkip is not in the collection.

 copyWithoutAll: aCollection

 removeIdentical: anObject ifAbsent: exceptionBlock

 find: key ifAbsent: aBlock

Look for the key in the receiver. If it is found, return
the index of the slot containing the key, otherwise
return the value of evaluating aBlock.
Redefined to compare for identity instead of equality

 findKeyOrNil: key

Look for the key in the receiver.
If it is found, return return the index of the first unused slot.
Grow the receiver, if key was not found, and no unused slots were present

 hashFor: aKey

return an initial index given a key.

 identicalContentsAs: aCollection

return true if the receiver and aCollection represent collections
with identical contents (but not caring for order).

 includesIdentical: anObject

for identitySet, the #includes: test already tests for identity