"

 COPYRIGHT (c) 1992 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.

"

"{ Package: 'stx:libbasic' }"

"{ NameSpace: Smalltalk }"

Dictionary subclass:#WeakValueDictionary

	instanceVariableNames:''

	classVariableNames:''

	poolDictionaries:''

	category:'Collections-Weak'

!

!WeakValueDictionary class methodsFor:'documentation'!

copyright

"

 COPYRIGHT (c) 1992 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.

"

!

documentation

"

    WeakValueDictionaries behave like Dictionaries, 

    as long as the values are still referenced by some 

    other (non-weak) object.

    However, once the last non-weak reference ceases to exist,

    the Dictionary will return nil for the value at position key.

    (with some delay: it will be removed after the next garbage collect).

    [Warning:]

      If you use this, be very careful since the collections size changes

      'magically' - for example, testing for being nonEmpty and then

      removing the first element may fail, since the element may vanish inbetween.

      In general, never trust the value as returned by the size/isEmpty messages.

    [author:]

        Stefan Vogel

    [See also:]

        WeakArray WeakIdentityDictionary WeakIdentitySet

"

! !

!WeakValueDictionary methodsFor:'adding & removing'!

at:key ifAbsent:somethingRespondingToValue

    "

     Redefined to block interrupts, to avoid trouble when dependencies

     are added within interrupting high prio processes.

    "

    |ret|

    [

        ret := super at:key ifAbsent:[^ somethingRespondingToValue value].

        ret = 0 ifTrue:[

            ret := somethingRespondingToValue value

        ].

    ] valueUninterruptably.

    ^ ret

!

at:key ifAbsentPut:anObject

    "return the element indexed by aKey if present,

     if not present, store the result of evaluating valueBlock

     under aKey and return it.

     Redefined to block interrupts, to avoid trouble when dependencies

     are added within interrupting high prio processes.

     WARNING: do not add elements while iterating over the receiver.

              Iterate over a copy to do this."

    |ret|

    [

        ret := super at:key ifAbsentPut:anObject.

    ] valueUninterruptably.

    ^ ret

!

at:key put:anObject

    "add the argument anObject under key, aKey to the receiver.

     Return anObject (sigh).

     Redefined to block interrupts, to avoid trouble when dependencies

     are added within interrupting high prio processes."

    |ret|

    [

        ret := super at:key put:anObject.

    ] valueUninterruptably.

    ^ ret

    "Modified: 6.5.1996 / 12:22:26 / stefan"

    "Created: 6.5.1996 / 14:47:37 / stefan"

    "Modified: 20.10.1996 / 14:05:04 / cg"

!

removeKey:aKey ifAbsent:aBlock

    "remove the association under aKey from the collection,

     return the value previously stored there.

     If it was not in the collection return the result 

     from evaluating aBlock.

    Redefined to avoid synchronization problems, in case

    of interrupts (otherwise, there could be some other operation 

    on the receiver done by another process, which garbles my contents)."

    |ret|

    [

        ret := super removeKey:aKey ifAbsent:aBlock

    ] valueUninterruptably.

    ^ ret

    "Modified: 6.5.1996 / 12:44:07 / stefan"

    "Created: 6.5.1996 / 14:47:37 / stefan"

!

removeValue:aKey ifAbsent:aBlock

    "remove the association under aValue from the collection,

     return the key previously stored there.

     If it was not in the collection return the result 

     from evaluating aBlock.

    Redefined to avoid synchronization problems, in case

    of interrupts (otherwise, there could be some other operation 

    on the receiver done by another process, which garbles my contents)."

    |ret|

    [

        ret := super removeValue:aKey ifAbsent:aBlock

    ] valueUninterruptably.

    ^ ret.

    "Created: 6.5.1996 / 14:47:37 / stefan"

    "Modified: 8.5.1996 / 14:54:09 / stefan"

! !

!WeakValueDictionary methodsFor:'element disposal'!

update:something with:aParameter from:changedObject

    "an element (either key or value) died - clear out slots for

     disposed keys."

    |wasBlocked|

    something == #ElementExpired ifTrue:[

        self clearDeadSlots.

    ]

    "Created: 7.1.1997 / 16:59:30 / stefan"

! !

!WeakValueDictionary methodsFor:'private'!

clearDeadSlots

    |wasBlocked|

    "

     have to block here - dispose may be done at a low priority

     from the background finalizer. If new items are added by a 

     higher prio process, the dictionary might get corrupted otherwise

    "

    wasBlocked := OperatingSystem blockInterrupts.

    valueArray 

        forAllDeadIndicesDo:[:idx | keyArray at:idx put:DeletedEntry.

                                    tally := tally - 1.

                            ]

        replacingCorpsesWith:nil.

    wasBlocked ifFalse:[

        OperatingSystem unblockInterrupts.

    ].

    "Modified: / 13.12.2001 / 14:18:56 / martin"

!

possiblyShrink

    "check if the receiver has become too empty (after a remove)

     and shrink if it makes sense.

     Definition of 'too empty' is: 'filled less than 12.5% (i.e. 1/8th)'"

    self clearDeadSlots.

    super possiblyShrink

!

slotIsEmpty:probe

    ^ probe isNil or:[probe == 0 "collected"]

!

valueContainerOfSize:n

    "return a container for values of size n.

     use WeakArrays here."

    |a|

    a := WeakArray new:n.

    a addDependent:self.

    ^ a

    "Created: 6.5.1996 / 14:47:37 / stefan"

! !

!WeakValueDictionary methodsFor:'testing'!

includes:anObject

    "redefined to block interrupts 

     (avoid change of the dictionary while accessing)"

    |val|

    [

        val := super includes:anObject.

    ] valueUninterruptably.

    ^ val

    "Modified: 6.5.1996 / 12:22:26 / stefan"

    "Modified: 1.7.1997 / 10:45:52 / cg"

    "Created: 1.7.1997 / 15:41:14 / cg"

!

includesKey:key

    "redefined to block interrupts 

     (avoid change of the dictionary while accessing)"

    |val|

    [

        val := super includesKey:key.

    ] valueUninterruptably.

    ^ val

    "Modified: 6.5.1996 / 12:22:26 / stefan"

    "Modified: 1.7.1997 / 10:45:52 / cg"

    "Created: 1.7.1997 / 15:41:32 / cg"

!

isWeakCollection

    "return true, if the receiver has weak references to its elements."

    ^ true

! !

!WeakValueDictionary class methodsFor:'documentation'!

version

    ^ '$Header: /cvs/stx/stx/libbasic/WeakValueDictionary.st,v 1.20 2014-12-30 12:35:34 cg Exp $'

! !