2 Little Smalltalk, Version 5
4 Copyright (C) 1987-2005 by Timothy A. Budd
5 Copyright (C) 2007 by Charles R. Childers
6 Copyright (C) 2005-2007 by Danny Reinhold
7 Copyright (C) 2010 by Ketmar // Vampire Avalon
9 ============================================================================
10 This license applies to the virtual machine and to the initial image of
11 the Little Smalltalk system and to all files in the Little Smalltalk
12 packages except the files explicitly licensed with another license(s).
13 ============================================================================
14 Permission is hereby granted, free of charge, to any person obtaining a copy
15 of this software and associated documentation files (the 'Software'), to deal
16 in the Software without restriction, including without limitation the rights
17 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
18 copies of the Software, and to permit persons to whom the Software is
19 furnished to do so, subject to the following conditions:
21 The above copyright notice and this permission notice shall be included in
22 all copies or substantial portions of the Software.
24 THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
25 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
26 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
27 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
28 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
29 FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
30 DEALINGS IN THE SOFTWARE.
37 Collection subclass: Set [
43 self in: ret at: 1 put: (Array new: aSize).
44 self in: ret at: 2 put: (aSize < 1 ifTrue: [16] ifFalse: [aSize]).
59 ^with: objA with: objB [
62 ret add: objA. ret add: objB.
66 ^with: objA with: objB with: objC [
69 ret add: objA. ret add: objB. ret add: objC.
74 members := Array new: growth.
80 members do: [:elem | elem ifNotNil: [ tally := tally + 1 ]].
85 "recreate ourselves in place with a new, bigger storage"
88 members := Array new: (old size + growth).
89 "reinsert each existing Set member"
90 old do: [:elem | self add: elem]
99 start := pos := (elem hash % members size) + 1.
100 [ true ] whileTrue: [
101 "return this position if we match, or have reached a nil slot"
102 t := members at: pos.
103 ((t isNil) or: [self compare: t and: elem]) ifTrue: [
106 "advance to next slot, circularly"
108 (pos > members size) ifTrue: [
111 "return nil if we have scanned the whole Set"
112 (pos = start) ifTrue: [ ^nil ]
118 "find the appropriate slot... if none, need to grow the Set"
119 pos := self location: elem.
124 "if the slot is nil, this is a new entry which we put in place now.
125 if it wasn't nil, we still restore it so that if it's an association, the value portion will be updated"
126 members at: pos put: elem.
137 [ true ] whileTrue: [
138 "advance to next slot, ceasing when we reach our start"
140 (pos > members size) ifTrue: [ pos := 1 ].
141 (pos = start) ifTrue: [ ^self ].
142 "if we reach a nil slot, there are no further rehash worries"
143 elem := members at: pos.
144 elem ifNil: [ ^self ].
145 "nil out the slot, and then reinsert the element"
146 members at: pos put: nil.
151 remove: elem ifAbsent: aBlock [
153 "if not found, return error"
154 (members at: ((pos := self location: elem) ifNil: [ ^aBlock value ])) ifNil: [ ^aBlock value ].
155 "remove our element from the Set"
156 members at: pos put: nil.
157 "rehash all that follow"
163 ^self remove: elem ifAbsent: [ self noElement ]
167 members do: [:elem | elem ifNotNil: [ aBlock value: elem ]]
171 ^self indexOf: elem ifAbsent: [ nil ]
174 indexOf: elem ifAbsent: aBlock [
176 (members at: ((pos := self location: elem) ifNil: [ ^aBlock value ])) ifNil: [ ^aBlock value ].
180 at: elem ifAbsent: aBlock [
181 ^(members at: ((self location: elem) ifNil: [ ^aBlock value ])) ifNil: [ ^aBlock value ].
187 Set subclass: IdentitySet [