/usr/share/gnu-smalltalk/kernel/Set.st is in gnu-smalltalk-common 3.2.4-2.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 | "======================================================================
|
| Set Method Definitions
|
|
======================================================================"
"======================================================================
|
| Copyright 1988,92,94,95,99,2000,2001
| Free Software Foundation, Inc.
| Written by Steve Byrne and Paolo Bonzini.
|
| This file is part of the GNU Smalltalk class library.
|
| The GNU Smalltalk class library is free software; you can redistribute it
| and/or modify it under the terms of the GNU Lesser General Public License
| as published by the Free Software Foundation; either version 2.1, or (at
| your option) any later version.
|
| The GNU Smalltalk class library is distributed in the hope that it will be
| useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser
| General Public License for more details.
|
| You should have received a copy of the GNU Lesser General Public License
| along with the GNU Smalltalk class library; see the file COPYING.LIB.
| If not, write to the Free Software Foundation, 59 Temple Place - Suite
| 330, Boston, MA 02110-1301, USA.
|
======================================================================"
HashedCollection subclass: Set [
<shape: #pointer>
<category: 'Collections-Unordered'>
<comment: 'I am the typical set object; I also known how to do arithmetic
on my instances.'>
& aSet [
"Compute the set intersection of the receiver and aSet."
<category: 'arithmetic'>
| intersectionSet |
intersectionSet := self copyEmpty: self size.
self size < aSet size
ifTrue:
[self
do: [:elem | (aSet includes: elem) ifTrue: [intersectionSet add: elem]]]
ifFalse:
[aSet
do: [:elem | (self includes: elem) ifTrue: [intersectionSet add: elem]]].
^intersectionSet
]
+ aSet [
"Compute the set union of the receiver and aSet."
<category: 'arithmetic'>
| unionSet |
unionSet := self copy.
unionSet addAll: aSet.
^unionSet
]
- aSet [
"Compute the set difference of the receiver and aSet."
<category: 'arithmetic'>
| differenceSet |
differenceSet := self copyEmpty: self size.
self
do: [:elem | (aSet includes: elem) ifFalse: [differenceSet add: elem]].
^differenceSet
]
< aSet [
"Answer whether the receiver is a strict subset of aSet"
<category: 'comparing'>
self size < aSet size
ifFalse: [^false]
ifTrue: [self do: [:elem | (aSet includes: elem) ifFalse: [^false]]].
^true
]
<= aSet [
"Answer whether the receiver is a subset of aSet"
<category: 'comparing'>
self size <= aSet size
ifFalse: [^false]
ifTrue: [self do: [:elem | (aSet includes: elem) ifFalse: [^false]]].
^true
]
> aSet [
"Answer whether the receiver is a strict superset of aSet"
<category: 'comparing'>
^aSet < self
]
>= aSet [
"Answer whether the receiver is a superset of aSet"
<category: 'comparing'>
^aSet <= self
]
hashFor: anObject [
"Return an hash value for the item, anObject"
<category: 'private methods'>
^anObject hash
]
findIndex: anObject [
"Tries to see if anObject exists as an indexed variable. As soon as nil
or anObject is found, the index of that slot is answered"
<category: 'private methods'>
| index size element |
self beConsistent.
"Sorry for the lack of readability, but I want speed... :-)"
index := (anObject hash scramble bitAnd: (size := self primSize) - 1) + 1.
[((element := self primAt: index) isNil or: [element = anObject])
ifTrue: [^index].
index == size ifTrue: [index := 1] ifFalse: [index := index + 1]]
repeat
]
findObjectIndex: object [
"Tries to see if anObject exists as an indexed variable. As soon as nil
or anObject is found, the index of that slot is answered"
<category: 'awful ST-80 compatibility hacks'>
^self findIndex: object
]
]
|