author | Claus Gittinger <cg@exept.de> |
Sat, 31 Aug 2013 15:15:26 +0200 | |
changeset 15731 | bb22629fc445 |
parent 15686 | 2efc686ef383 |
child 15732 | e57fb13f5af2 |
permissions | -rw-r--r-- |
1 | 1 |
" |
5 | 2 |
COPYRIGHT (c) 1991 by Claus Gittinger |
345 | 3 |
All Rights Reserved |
1 | 4 |
|
5 |
This software is furnished under a license and may be used |
|
6 |
only in accordance with the terms of that license and with the |
|
7 |
inclusion of the above copyright notice. This software may not |
|
8 |
be provided or otherwise made available to, or used by, any |
|
9 |
other person. No title to or ownership of the software is |
|
10 |
hereby transferred. |
|
11 |
" |
|
5375 | 12 |
"{ Package: 'stx:libbasic' }" |
13 |
||
1 | 14 |
Collection subclass:#Bag |
1057 | 15 |
instanceVariableNames:'contents' |
16 |
classVariableNames:'' |
|
17 |
poolDictionaries:'' |
|
18 |
category:'Collections-Unordered' |
|
1 | 19 |
! |
20 |
||
54 | 21 |
!Bag class methodsFor:'documentation'! |
22 |
||
88 | 23 |
copyright |
24 |
" |
|
25 |
COPYRIGHT (c) 1991 by Claus Gittinger |
|
345 | 26 |
All Rights Reserved |
88 | 27 |
|
28 |
This software is furnished under a license and may be used |
|
29 |
only in accordance with the terms of that license and with the |
|
30 |
inclusion of the above copyright notice. This software may not |
|
31 |
be provided or otherwise made available to, or used by, any |
|
32 |
other person. No title to or ownership of the software is |
|
33 |
hereby transferred. |
|
34 |
" |
|
35 |
! |
|
36 |
||
54 | 37 |
documentation |
38 |
" |
|
88 | 39 |
Bag implements collections whose elements are unordered and have no |
154 | 40 |
external key. Elements may occur more than once in a bag. There is no defined |
8873 | 41 |
order within a bag. |
42 |
The default implementation uses a dictionary to store each objects occurrence |
|
43 |
count, using the object itself as key (i.e. using = and hash for inclusion |
|
345 | 44 |
tests). |
399 | 45 |
|
345 | 46 |
There is also an instance creation variant (#identityNew:) creating a |
47 |
bag which compares using #== and hashes using #identityHash. |
|
8873 | 48 |
(I'd say that an IdentityBag was a better thing to implement ... |
399 | 49 |
... but for compatibility ... we do it here as well) |
1 | 50 |
|
1283 | 51 |
[Instance variables:] |
52 |
||
8873 | 53 |
contents <Dictionary> for each element, the number of occurrences |
1283 | 54 |
|
1 | 55 |
|
1290 | 56 |
[author:] |
8873 | 57 |
Claus Gittinger |
1290 | 58 |
|
1283 | 59 |
[See also:] |
8873 | 60 |
Set IdentitySet |
61 |
Dictionary IdentityDictionary |
|
62 |
OrderedCollection Array |
|
54 | 63 |
" |
64 |
! ! |
|
1 | 65 |
|
66 |
!Bag class methodsFor:'instance creation'! |
|
67 |
||
14956 | 68 |
contentsClass |
69 |
"the default class to use for the underlying contents array, |
|
70 |
used when instantiated with new/new:" |
|
71 |
||
72 |
^ Dictionary |
|
73 |
! |
|
74 |
||
75 |
equalityNew |
|
76 |
"return a new empty Bag. |
|
77 |
Elements will be compared using equality compare (i.e. #= not #== identity)." |
|
78 |
||
79 |
^ self basicNew initContentsForEquality |
|
80 |
! |
|
81 |
||
345 | 82 |
equalityNew:size |
83 |
"return a new empty Bag with initial space for size elements. |
|
84 |
Elements will be compared using equality compare (i.e. #= not #== identity)." |
|
1 | 85 |
|
14956 | 86 |
^ self basicNew initContentsForEquality:size |
345 | 87 |
! |
88 |
||
5375 | 89 |
identityNew |
14956 | 90 |
"return a new empty Identity-Bag. |
5375 | 91 |
Elements will be compared using identity compare (i.e. #== not #= equality)." |
92 |
||
14956 | 93 |
^ self basicNew initContentsForIdentity |
5375 | 94 |
! |
95 |
||
345 | 96 |
identityNew:size |
97 |
"return a new empty Bag with initial space for size elements. |
|
98 |
Elements will be compared using identity compare (i.e. #== not #= equality)." |
|
99 |
||
5558 | 100 |
^ self basicNew initContentsForIdentity:size |
1 | 101 |
! |
102 |
||
609 | 103 |
new |
104 |
"return a new empty Bag which compares for equality (i.e. not identity)" |
|
1 | 105 |
|
5558 | 106 |
^ self basicNew initContents |
345 | 107 |
! |
108 |
||
609 | 109 |
new:size |
110 |
"return a new empty Bag with initial space for size elements. |
|
111 |
Elements will be compared using equality compare (i.e. #= not #== identity)." |
|
345 | 112 |
|
609 | 113 |
^ self equalityNew:size |
1 | 114 |
! ! |
115 |
||
7261 | 116 |
!Bag methodsFor:'Compatibility-Dolphin'! |
6411 | 117 |
|
118 |
asAssociations |
|
11935 | 119 |
"return the dictionary which associates occurrence-counts |
120 |
to the bags elements. |
|
121 |
Same as #contents for dolphin compatibility." |
|
122 |
||
14685 | 123 |
^ self contents |
6411 | 124 |
! ! |
125 |
||
1 | 126 |
!Bag methodsFor:'accessing'! |
127 |
||
128 |
at:index |
|
129 |
"report an error: at: is not allowed for Bags" |
|
130 |
||
131 |
^ self errorNotKeyed |
|
132 |
! |
|
133 |
||
134 |
at:index put:anObject |
|
135 |
"report an error: at:put: is not allowed for Bags" |
|
136 |
||
137 |
^ self errorNotKeyed |
|
345 | 138 |
! |
139 |
||
140 |
contents |
|
141 |
"return the dictionary which associates occurrence-counts |
|
142 |
to the bags elements." |
|
143 |
||
144 |
^ contents |
|
15686 | 145 |
! |
146 |
||
147 |
sortedCounts |
|
148 |
"Answer with a collection of counts with elements, sorted by decreasing count." |
|
149 |
"Suggested by l. Uzonyi" |
|
150 |
||
151 |
^ (Array new:contents size |
|
152 |
streamContents:[:stream | |
|
153 |
contents associationsDo:[:each | stream nextPut:each value -> each key ] |
|
154 |
]) |
|
155 |
sort:[:x :y | x >= y ]; |
|
156 |
yourself |
|
15731 | 157 |
|
158 |
" |
|
159 |
Bag new |
|
160 |
add:'abc'; |
|
161 |
add:'def'; |
|
162 |
add:'ghi'; |
|
163 |
add:'abc'; |
|
164 |
add:'def'; |
|
165 |
add:'abc'; |
|
166 |
add:'abc'; |
|
167 |
sortedCounts |
|
168 |
" |
|
1 | 169 |
! ! |
170 |
||
171 |
!Bag methodsFor:'adding & removing'! |
|
172 |
||
54 | 173 |
add:newObject |
345 | 174 |
"add the argument, anObject to the receiver. |
14896 | 175 |
Returns the object (sigh). |
1057 | 176 |
|
177 |
WARNING: do not add/remove elements while iterating over the receiver. |
|
14896 | 178 |
Iterate over a copy to do this." |
1 | 179 |
|
54 | 180 |
|n| |
181 |
||
1145
a094d90e11bf
dont use [0] blocks - use 0 constant instead
Claus Gittinger <cg@exept.de>
parents:
1110
diff
changeset
|
182 |
n := contents at:newObject ifAbsent:0. |
54 | 183 |
contents at:newObject put:(n + 1). |
184 |
^ newObject |
|
1057 | 185 |
|
186 |
"Modified: 1.3.1996 / 21:43:06 / cg" |
|
1 | 187 |
! |
188 |
||
1372
d7bd1b463a65
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1290
diff
changeset
|
189 |
add:newObject withOccurrences:anInteger |
345 | 190 |
"add the argument, anObject anInteger times to the receiver. |
1057 | 191 |
Returns the object. |
192 |
||
193 |
WARNING: do not add/remove elements while iterating over the receiver. |
|
8873 | 194 |
Iterate over a copy to do this." |
1 | 195 |
|
54 | 196 |
|n| |
197 |
||
1145
a094d90e11bf
dont use [0] blocks - use 0 constant instead
Claus Gittinger <cg@exept.de>
parents:
1110
diff
changeset
|
198 |
n := contents at:newObject ifAbsent:0. |
54 | 199 |
contents at:newObject put:(n + anInteger). |
1 | 200 |
^ newObject |
1057 | 201 |
|
202 |
"Modified: 1.3.1996 / 21:43:12 / cg" |
|
1372
d7bd1b463a65
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1290
diff
changeset
|
203 |
"Created: 11.5.1996 / 12:13:43 / cg" |
1 | 204 |
! |
205 |
||
206 |
remove:oldObject ifAbsent:anExceptionBlock |
|
345 | 207 |
"Remove oldObject from the collection. |
208 |
If it was not present, return the value of the exceptionBlock; |
|
1057 | 209 |
otherwise return the removed object. |
210 |
||
211 |
WARNING: do not add/remove elements while iterating over the receiver. |
|
8873 | 212 |
Iterate over a copy to do this." |
1 | 213 |
|
214 |
|count| |
|
215 |
||
1145
a094d90e11bf
dont use [0] blocks - use 0 constant instead
Claus Gittinger <cg@exept.de>
parents:
1110
diff
changeset
|
216 |
count := contents at:oldObject ifAbsent:0. |
1 | 217 |
(count == 0) ifTrue:[^ anExceptionBlock value]. |
218 |
(count == 1) ifTrue:[ |
|
8873 | 219 |
contents removeKey:oldObject |
220 |
] ifFalse:[ |
|
221 |
contents at:oldObject put:(count - 1) |
|
1 | 222 |
]. |
223 |
^ oldObject |
|
1057 | 224 |
|
225 |
"Modified: 1.3.1996 / 21:43:18 / cg" |
|
345 | 226 |
! |
227 |
||
1110 | 228 |
removeAll |
1164 | 229 |
"remove all objects from the receiver collection (i.e. make it empty). |
230 |
Returns the receiver." |
|
1110 | 231 |
|
232 |
contents := contents species new. |
|
233 |
||
234 |
" |
|
235 |
|b| |
|
236 |
||
237 |
b := Bag new. |
|
238 |
b add:1; add:2; add:3; add:2; add:1. |
|
1422 | 239 |
Transcript showCR:b. |
1110 | 240 |
|
241 |
b removeAll. |
|
242 |
||
1422 | 243 |
Transcript showCR:b |
1110 | 244 |
" |
245 |
||
1164 | 246 |
"Modified: 12.4.1996 / 13:34:34 / cg" |
1110 | 247 |
! |
248 |
||
345 | 249 |
removeAllOccurrencesOf:oldObject ifAbsent:anExceptionBlock |
250 |
"Remove all occurrences of oldObject from the collection. |
|
251 |
If it was not present, return the value of the exceptionBlock; |
|
1057 | 252 |
otherwise return the number of removes. |
253 |
||
254 |
WARNING: do not add/remove elements while iterating over the receiver. |
|
8873 | 255 |
Iterate over a copy to do this." |
345 | 256 |
|
257 |
|count| |
|
258 |
||
1145
a094d90e11bf
dont use [0] blocks - use 0 constant instead
Claus Gittinger <cg@exept.de>
parents:
1110
diff
changeset
|
259 |
count := contents at:oldObject ifAbsent:0. |
345 | 260 |
(count == 0) ifTrue:[^ anExceptionBlock value]. |
261 |
contents removeKey:oldObject. |
|
262 |
^ oldObject |
|
1057 | 263 |
|
264 |
"Modified: 1.3.1996 / 21:43:26 / cg" |
|
1 | 265 |
! ! |
266 |
||
8860 | 267 |
!Bag methodsFor:'bulk operations'! |
268 |
||
269 |
sum |
|
11522 | 270 |
"sum up all elements; return 0 for an empty collection. |
271 |
can be done easier, using bags knowledge." |
|
8860 | 272 |
|
273 |
|accu| |
|
274 |
||
11522 | 275 |
self isEmpty ifTrue:[ ^ 0 ]. |
11474 | 276 |
|
277 |
accu := nil. |
|
278 |
self |
|
279 |
valuesAndCountsDo:[:n :count | |
|
280 |
|thisAmount| |
|
281 |
||
282 |
thisAmount := count * n. |
|
283 |
accu := (accu isNil ifTrue:[thisAmount] ifFalse:[accu + thisAmount]) ]. |
|
8860 | 284 |
^ accu |
285 |
||
286 |
" |
|
11474 | 287 |
TestCase assert:((Bag new add:1; add:2; add:3; add:1; add:2; add:1; yourself) sum = 10). |
8860 | 288 |
" |
289 |
! ! |
|
290 |
||
6735
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
291 |
!Bag methodsFor:'comparing'! |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
292 |
|
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
293 |
= aBag |
11935 | 294 |
"Compare the receiver with the argument and return true if the |
295 |
receiver is equal to the argument (i.e. has the same size and elements). |
|
296 |
Otherwise return false." |
|
297 |
||
6735
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
298 |
aBag species == self species ifFalse:[^ false]. |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
299 |
self size == aBag size ifFalse:[^ false]. |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
300 |
self valuesAndCountsDo:[:val :cnt | |
11935 | 301 |
(aBag occurrencesOf:val) == cnt ifFalse:[^ false] |
6735
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
302 |
]. |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
303 |
^ true |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
304 |
! |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
305 |
|
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
306 |
hash |
11935 | 307 |
"return an integer useful for hashing on the receiver; |
308 |
redefined since = is redefined here." |
|
309 |
||
6735
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
310 |
|h| |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
311 |
|
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
312 |
h := self size. |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
313 |
self valuesAndCountsDo:[:val :cnt | |
11935 | 314 |
h := h + cnt hash. |
6735
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
315 |
]. |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
316 |
^ h |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
317 |
! ! |
fad09454a025
added #= and #hash (to put bags into Sets/Dictionaries)
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
318 |
|
609 | 319 |
!Bag methodsFor:'converting'! |
320 |
||
321 |
asBag |
|
322 |
"return the receiver as a bag" |
|
323 |
||
324 |
"could be an instance of a subclass..." |
|
325 |
self class == Bag ifTrue:[ |
|
326 |
^ self |
|
327 |
]. |
|
328 |
^ super asBag |
|
7161 | 329 |
! |
330 |
||
331 |
asSet |
|
332 |
"return the receiver as a set" |
|
333 |
||
334 |
^ contents keys copy |
|
335 |
||
336 |
" |
|
337 |
|b| |
|
338 |
||
339 |
b := Bag new. |
|
340 |
b add:1; add:2; add:3; add:1; add:1. |
|
341 |
b asSet. |
|
342 |
" |
|
609 | 343 |
! ! |
344 |
||
345 |
!Bag methodsFor:'copying'! |
|
346 |
||
347 |
postCopy |
|
348 |
"must copy the contents as well" |
|
349 |
||
350 |
contents := contents copy |
|
351 |
! ! |
|
352 |
||
1 | 353 |
!Bag methodsFor:'enumerating'! |
354 |
||
355 |
do:aBlock |
|
1057 | 356 |
"evaluate the block for all elements in the collection. |
357 |
||
358 |
WARNING: do not add/remove elements while iterating over the receiver. |
|
8873 | 359 |
Iterate over a copy to do this." |
1 | 360 |
|
54 | 361 |
contents keysAndValuesDo:[:key :value| |
8873 | 362 |
value timesRepeat:[ |
363 |
aBlock value:key |
|
364 |
] |
|
1 | 365 |
] |
1057 | 366 |
|
367 |
"Modified: 1.3.1996 / 21:42:39 / cg" |
|
345 | 368 |
! |
369 |
||
10835 | 370 |
valuesAndCounts |
11481 | 371 |
"return an orderedCollection containing value->count associations" |
10835 | 372 |
|
373 |
|coll| |
|
374 |
||
375 |
coll := OrderedCollection new. |
|
376 |
self valuesAndCountsDo:[:value :count | coll add:(value->count)]. |
|
377 |
^ coll |
|
378 |
||
379 |
"Modified: 1.3.1996 / 21:42:44 / cg" |
|
380 |
! |
|
381 |
||
345 | 382 |
valuesAndCountsDo:aTwoArgBlock |
383 |
"evaluate the block for all distinct elements in the collection, |
|
8873 | 384 |
passing both the element and the occurrence count as arguments. |
1057 | 385 |
|
386 |
WARNING: do not add/remove elements while iterating over the receiver. |
|
8873 | 387 |
Iterate over a copy to do this." |
345 | 388 |
|
389 |
^ contents keysAndValuesDo:aTwoArgBlock |
|
1057 | 390 |
|
391 |
"Modified: 1.3.1996 / 21:42:44 / cg" |
|
1 | 392 |
! ! |
609 | 393 |
|
12823 | 394 |
!Bag methodsFor:'printing & storing'! |
395 |
||
396 |
printElementsDo:aBlock |
|
14685 | 397 |
self valuesAndCountsDo:[:value :count| |
398 |
aBlock value:('%1(*%2)' bindWith:value with:count). |
|
12823 | 399 |
] |
400 |
! ! |
|
401 |
||
609 | 402 |
!Bag methodsFor:'private'! |
403 |
||
404 |
initContents |
|
14956 | 405 |
"set the contents to be an empty Dictionary. |
406 |
This is the default method for initialization, which can be redefined in subclasses." |
|
407 |
||
408 |
contents := self class contentsClass new |
|
409 |
! |
|
410 |
||
411 |
initContents:size |
|
412 |
"set the contents to be an empty Dictionary with initial size. |
|
413 |
This is the default method for initialization, which can be redefined in subclasses." |
|
414 |
||
415 |
contents := self class contentsClass new: size |
|
416 |
! |
|
417 |
||
418 |
initContentsForEquality |
|
609 | 419 |
"set the contents to be an empty Dictionary" |
420 |
||
421 |
contents := Dictionary new |
|
422 |
! |
|
423 |
||
14956 | 424 |
initContentsForEquality:size |
609 | 425 |
"set the contents to be an empty Dictionary with initial size" |
426 |
||
427 |
contents := Dictionary new:size |
|
428 |
! |
|
429 |
||
5375 | 430 |
initContentsForIdentity |
431 |
"set the contents to be an empty IdentityDictionary" |
|
432 |
||
433 |
contents := IdentityDictionary new |
|
434 |
! |
|
435 |
||
609 | 436 |
initContentsForIdentity:size |
437 |
"set the contents to be an empty IdentityDictionary with initial size" |
|
438 |
||
439 |
contents := IdentityDictionary new:size |
|
440 |
! ! |
|
441 |
||
5557 | 442 |
!Bag methodsFor:'queries'! |
443 |
||
444 |
size |
|
445 |
"return the number of bag elements" |
|
446 |
||
447 |
|count| |
|
448 |
||
449 |
count := 0. |
|
450 |
contents do:[:element | count := count + element]. |
|
451 |
^ count |
|
452 |
! ! |
|
453 |
||
15457 | 454 |
!Bag methodsFor:'statistical functions'! |
455 |
||
456 |
variance |
|
457 |
"compute the variance over a complete data set (and not of a sample)" |
|
458 |
||
459 |
|m sz sumDeltaSquares| |
|
460 |
||
461 |
m := self arithmeticMean. |
|
462 |
sumDeltaSquares := 0. |
|
463 |
sz := 0. |
|
464 |
self |
|
465 |
valuesAndCountsDo:[:val :count | |
|
466 |
sumDeltaSquares := sumDeltaSquares + ((val - m) squared). |
|
467 |
sz := sz + 1. |
|
468 |
]. |
|
469 |
||
470 |
^ sumDeltaSquares / sz |
|
471 |
||
472 |
" |
|
473 |
TestCase assert:( #(1 1 1 2 2 2 1 1 1 2 2 2) asBag variance = #(1 1 1 2 2 2 1 1 1 2 2 2) variance). |
|
474 |
TestCase assert:( #(1 1 1 1 1 0 0 0 0 0) asBag variance = #(1 1 1 1 1 0 0 0 0 0) variance). |
|
475 |
" |
|
476 |
! ! |
|
477 |
||
609 | 478 |
!Bag methodsFor:'testing'! |
479 |
||
480 |
includes:anObject |
|
481 |
"return true, if anObject is in the receiver" |
|
482 |
||
14685 | 483 |
^ (self occurrencesOf:anObject) > 0 |
609 | 484 |
! |
485 |
||
15429 | 486 |
isFixedSize |
487 |
"return true if the receiver cannot grow" |
|
488 |
||
489 |
^ false |
|
490 |
! |
|
491 |
||
609 | 492 |
occurrencesOf:anObject |
493 |
"return how many times anObject is in the receiver" |
|
494 |
||
1145
a094d90e11bf
dont use [0] blocks - use 0 constant instead
Claus Gittinger <cg@exept.de>
parents:
1110
diff
changeset
|
495 |
^ contents at:anObject ifAbsent:0 |
609 | 496 |
! ! |
497 |
||
633 | 498 |
!Bag class methodsFor:'documentation'! |
499 |
||
500 |
version |
|
15731 | 501 |
^ '$Header: /cvs/stx/stx/libbasic/Bag.st,v 1.48 2013-08-31 13:15:26 cg Exp $' |
12823 | 502 |
! |
503 |
||
504 |
version_CVS |
|
15731 | 505 |
^ '$Header: /cvs/stx/stx/libbasic/Bag.st,v 1.48 2013-08-31 13:15:26 cg Exp $' |
633 | 506 |
! ! |
14685 | 507 |