"

 COPYRIGHT (c) 1994 by Claus Gittinger

	      All Rights Reserved

 This software is furnished under a license and may be used

 only in accordance with the terms of that license and with the

 inclusion of the above copyright notice.   This software may not

 be provided or otherwise made available to, or used by, any

 other person.  No title to or ownership of the software is

 hereby transferred.

"

IdentitySet subclass:#WeakIdentitySet

       instanceVariableNames:''

       classVariableNames:''

       poolDictionaries:''

       category:'Collections-Unordered'

!

WeakIdentitySet comment:'

COPYRIGHT (c) 1994 by Claus Gittinger

	      All Rights Reserved

'!

!WeakIdentitySet class methodsFor:'documentation'!

copyright

"

 COPYRIGHT (c) 1994 by Claus Gittinger

	      All Rights Reserved

 This software is furnished under a license and may be used

 only in accordance with the terms of that license and with the

 inclusion of the above copyright notice.   This software may not

 be provided or otherwise made available to, or used by, any

 other person.  No title to or ownership of the software is

 hereby transferred.

"

!

version

"

"

!

documentation

"

    this is a special class to support dependencies which do not

    prevent objects from dying.

"

! !

!WeakIdentitySet class methodsFor:'instance creation'!

new

    "return a new empty Set"

    ^ self new:1

! !

    "return a good array size for the given argument.

     Since WeakIdentitySets are mostly used for dependency management, we typically

     have only one element in the set. Therefore use exact size for small sets

     (instead of rounding up to the prime 11)."

    arg <= 10 ifTrue:[

	arg < 1 ifTrue:[^ 1].

	^ arg.

    ].

keyContainerOfSize:n

    "return a container for keys and values of size n.

     use WeakArrays here."

    |w|

    w := WeakArray new:n.

    w watcher:self.

    ^ w

! !

!WeakIdentitySet methodsFor:'enumerating'!

do:aBlock

    "perform the block for all members in the collection.

     This method has been rewritten to be more robust about

     changed contents while enumerating elements (which might

     happen during change&update processing, if dependents

     are added or removed within the update."

    |index "{ Class: SmallInteger }"

     element|

    index := 1.

    [index <= keyArray size] whileTrue:[

	element := keyArray at:index.

	(element notNil and:[element ~~ DeletedEntry]) ifTrue:[

	    aBlock value:element

	].

	index := index + 1

    ]

! !

!WeakIdentitySet methodsFor:'element disposal'!

informDispose

    "an element died - must rehash"

    self rehash

! !