|
1043
|
1 |
"
|
|
|
2 |
COPYRIGHT (c) 2002 by eXept Software AG
|
|
|
3 |
All Rights Reserved
|
|
|
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 |
"
|
|
|
12 |
|
|
|
13 |
"{ Package: 'stx:libbasic2' }"
|
|
|
14 |
|
|
|
15 |
SequenceableCollection subclass:#Cons
|
|
|
16 |
instanceVariableNames:'car cdr'
|
|
|
17 |
classVariableNames:''
|
|
|
18 |
poolDictionaries:''
|
|
|
19 |
category:'Collections-Linked'
|
|
|
20 |
!
|
|
|
21 |
|
|
|
22 |
!Cons class methodsFor:'documentation'!
|
|
|
23 |
|
|
|
24 |
copyright
|
|
|
25 |
"
|
|
|
26 |
COPYRIGHT (c) 2002 by eXept Software AG
|
|
|
27 |
All Rights Reserved
|
|
|
28 |
|
|
|
29 |
This software is furnished under a license and may be used
|
|
|
30 |
only in accordance with the terms of that license and with the
|
|
|
31 |
inclusion of the above copyright notice. This software may not
|
|
|
32 |
be provided or otherwise made available to, or used by, any
|
|
|
33 |
other person. No title to or ownership of the software is
|
|
|
34 |
hereby transferred.
|
|
|
35 |
"
|
|
|
36 |
!
|
|
|
37 |
|
|
|
38 |
documentation
|
|
|
39 |
"
|
|
|
40 |
A pair as in lisp.
|
|
|
41 |
Create with:
|
|
1074
|
42 |
a !! b
|
|
|
43 |
or:
|
|
|
44 |
Cons car:a cdr:b
|
|
|
45 |
|
|
|
46 |
Conses are not heavily used by Smalltalk (actually: not at all).
|
|
|
47 |
Consider this mostly a demo class.
|
|
|
48 |
|
|
1043
|
49 |
|
|
|
50 |
[author:]
|
|
|
51 |
Claus Gittinger
|
|
|
52 |
|
|
|
53 |
[see also:]
|
|
|
54 |
|
|
|
55 |
"
|
|
|
56 |
! !
|
|
|
57 |
|
|
|
58 |
!Cons class methodsFor:'instance creation'!
|
|
|
59 |
|
|
|
60 |
car:carArg cdr:cdrArg
|
|
|
61 |
^ self basicNew car:carArg cdr:cdrArg
|
|
|
62 |
!
|
|
|
63 |
|
|
|
64 |
fromArray:anArray
|
|
|
65 |
|p last first|
|
|
|
66 |
|
|
|
67 |
anArray do:[:el |
|
|
|
68 |
p := self car:el cdr:nil.
|
|
|
69 |
first isNil ifTrue:[
|
|
|
70 |
first := p.
|
|
|
71 |
] ifFalse:[
|
|
|
72 |
last cdr:p.
|
|
|
73 |
].
|
|
|
74 |
last := p.
|
|
|
75 |
].
|
|
|
76 |
^ first.
|
|
|
77 |
|
|
|
78 |
"
|
|
1074
|
79 |
Cons fromArray:#(1 2 3 4)
|
|
|
80 |
Cons fromArray:#()
|
|
|
81 |
Cons fromArray:#(1)
|
|
1043
|
82 |
"
|
|
|
83 |
! !
|
|
|
84 |
|
|
|
85 |
!Cons methodsFor:'accessing'!
|
|
|
86 |
|
|
|
87 |
at:n
|
|
1074
|
88 |
"for collection compatibility:
|
|
|
89 |
a slow indexed accessor"
|
|
|
90 |
|
|
1043
|
91 |
^ (self nth:n) car
|
|
|
92 |
|
|
|
93 |
"
|
|
1074
|
94 |
(Cons fromArray:#(1)) at:1
|
|
|
95 |
(Cons fromArray:#(1 2 3 4)) at:1
|
|
|
96 |
(Cons fromArray:#(1 2 3 4)) at:3
|
|
|
97 |
(Cons fromArray:#(1 2 3 4)) at:4
|
|
|
98 |
(Cons fromArray:#(1 2 3 4)) at:5
|
|
1043
|
99 |
"
|
|
|
100 |
!
|
|
|
101 |
|
|
|
102 |
at:n put:newValue
|
|
1074
|
103 |
"for collection compatibility:
|
|
|
104 |
a slow indexed accessor"
|
|
|
105 |
|
|
1043
|
106 |
(self nth:n) car:newValue.
|
|
|
107 |
^ newValue.
|
|
|
108 |
|
|
|
109 |
"
|
|
|
110 |
|l|
|
|
|
111 |
|
|
1074
|
112 |
l := Cons fromArray:#(1 2 3 4).
|
|
1043
|
113 |
l at:1 put:'one'.
|
|
|
114 |
l at:3 put:'three'.
|
|
|
115 |
l
|
|
|
116 |
"
|
|
|
117 |
!
|
|
|
118 |
|
|
|
119 |
last
|
|
1074
|
120 |
"for lispers:
|
|
|
121 |
return the last element of a list"
|
|
|
122 |
|
|
1043
|
123 |
|p rest|
|
|
|
124 |
|
|
|
125 |
p := self.
|
|
|
126 |
[(rest := p cdr) notNil] whileTrue:[
|
|
|
127 |
p := rest
|
|
|
128 |
].
|
|
|
129 |
^ p
|
|
|
130 |
|
|
|
131 |
"
|
|
1074
|
132 |
(Cons fromArray:#(1)) last
|
|
|
133 |
(Cons fromArray:#(1 2 3 4)) last
|
|
1043
|
134 |
"
|
|
|
135 |
!
|
|
|
136 |
|
|
|
137 |
nth:n
|
|
1074
|
138 |
"for lispers:
|
|
|
139 |
return the nth element of a list"
|
|
|
140 |
|
|
1043
|
141 |
|cnt p|
|
|
|
142 |
|
|
|
143 |
cnt := n.
|
|
|
144 |
p := self.
|
|
|
145 |
[true] whileTrue:[
|
|
|
146 |
cnt := cnt - 1.
|
|
|
147 |
cnt == 0 ifTrue:[^ p].
|
|
|
148 |
p := p cdr.
|
|
|
149 |
p isNil ifTrue:[
|
|
|
150 |
self error:'no such element' mayProceed:true.
|
|
|
151 |
^ nil
|
|
|
152 |
].
|
|
|
153 |
].
|
|
|
154 |
|
|
|
155 |
"
|
|
1074
|
156 |
(Cons fromArray:#(1)) nth:1
|
|
|
157 |
(Cons fromArray:#(1 2 3 4)) nth:1
|
|
|
158 |
(Cons fromArray:#(1 2 3 4)) nth:3
|
|
|
159 |
(Cons fromArray:#(1 2 3 4)) nth:4
|
|
|
160 |
(Cons fromArray:#(1 2 3 4)) nth:5
|
|
1043
|
161 |
"
|
|
|
162 |
! !
|
|
|
163 |
|
|
|
164 |
!Cons methodsFor:'accessing - basic'!
|
|
|
165 |
|
|
|
166 |
car
|
|
1074
|
167 |
"return the head, first or car - whatever you wonna call it"
|
|
1043
|
168 |
|
|
|
169 |
^ car
|
|
|
170 |
!
|
|
|
171 |
|
|
|
172 |
car:something
|
|
1074
|
173 |
"set the head, first or car - whatever you wonna call it"
|
|
1043
|
174 |
|
|
|
175 |
car := something.
|
|
|
176 |
!
|
|
|
177 |
|
|
|
178 |
car:carArg cdr:cdrArg
|
|
1074
|
179 |
"set both car and cdr"
|
|
1043
|
180 |
|
|
|
181 |
car := carArg.
|
|
|
182 |
cdr := cdrArg.
|
|
|
183 |
!
|
|
|
184 |
|
|
|
185 |
cdr
|
|
1074
|
186 |
"return the tail, second or cdr - whatever you wonna call it"
|
|
1043
|
187 |
|
|
|
188 |
^ cdr
|
|
|
189 |
!
|
|
|
190 |
|
|
|
191 |
cdr:something
|
|
1074
|
192 |
"set the tail, second or cdr - whatever you wonna call it"
|
|
1043
|
193 |
|
|
|
194 |
cdr := something.
|
|
|
195 |
! !
|
|
|
196 |
|
|
|
197 |
!Cons methodsFor:'list processing'!
|
|
|
198 |
|
|
|
199 |
append:aCons
|
|
1074
|
200 |
"for lispers:
|
|
|
201 |
append the arg. Return a new list, where the 2nd part is shared"
|
|
|
202 |
|
|
1043
|
203 |
|p rest|
|
|
|
204 |
|
|
|
205 |
p := self.
|
|
|
206 |
[(rest := p cdr) notNil] whileTrue:[
|
|
|
207 |
p := rest
|
|
|
208 |
].
|
|
|
209 |
p cdr:aCons.
|
|
|
210 |
^ self
|
|
|
211 |
|
|
|
212 |
"
|
|
1074
|
213 |
(Cons fromArray:#(1 2 3 4))
|
|
|
214 |
append:(Cons fromArray:#(5 6 7 8))
|
|
|
215 |
"
|
|
|
216 |
|
|
|
217 |
"sharing demonstrated:
|
|
|
218 |
|
|
|
219 |
|a b ab|
|
|
|
220 |
|
|
|
221 |
a := Cons fromArray:#(1 2 3 4).
|
|
|
222 |
b := Cons fromArray:#(5 6 7 8).
|
|
|
223 |
ab := a append:b.
|
|
|
224 |
b car:'five'.
|
|
|
225 |
ab
|
|
1043
|
226 |
"
|
|
|
227 |
! !
|
|
|
228 |
|
|
|
229 |
!Cons methodsFor:'printing'!
|
|
|
230 |
|
|
|
231 |
displayString
|
|
|
232 |
^ self printString
|
|
|
233 |
!
|
|
|
234 |
|
|
|
235 |
printOn:aStream
|
|
|
236 |
(car isLazyValue not and:[ car isCons ]) ifTrue:[
|
|
|
237 |
aStream nextPutAll:'('.
|
|
|
238 |
car printOn:aStream.
|
|
|
239 |
aStream nextPutAll:')'.
|
|
|
240 |
] ifFalse:[
|
|
|
241 |
car printOn:aStream.
|
|
|
242 |
].
|
|
|
243 |
|
|
1073
|
244 |
aStream nextPutAll:'!!'.
|
|
1043
|
245 |
|
|
|
246 |
(cdr isLazyValue not and:[ cdr isCons ]) ifTrue:[
|
|
|
247 |
aStream nextPutAll:'('.
|
|
|
248 |
cdr printOn:aStream.
|
|
|
249 |
aStream nextPutAll:')'.
|
|
|
250 |
] ifFalse:[
|
|
|
251 |
cdr printOn:aStream.
|
|
|
252 |
].
|
|
|
253 |
! !
|
|
|
254 |
|
|
|
255 |
!Cons methodsFor:'queries'!
|
|
|
256 |
|
|
|
257 |
isCons
|
|
|
258 |
^ true
|
|
|
259 |
!
|
|
|
260 |
|
|
|
261 |
size
|
|
1074
|
262 |
"for smalltalkers: the lists length"
|
|
|
263 |
|
|
1043
|
264 |
|l p rest|
|
|
|
265 |
|
|
|
266 |
l := 1.
|
|
|
267 |
p := self.
|
|
|
268 |
[(rest := p cdr) notNil] whileTrue:[
|
|
|
269 |
l := l + 1.
|
|
|
270 |
p := rest
|
|
|
271 |
].
|
|
|
272 |
^ l
|
|
|
273 |
|
|
|
274 |
"
|
|
1074
|
275 |
(Cons fromArray:#( )) size
|
|
|
276 |
(Cons fromArray:#(1)) size
|
|
|
277 |
(Cons fromArray:#(1 2 3 4)) size
|
|
1043
|
278 |
"
|
|
|
279 |
! !
|
|
|
280 |
|
|
|
281 |
!Cons class methodsFor:'documentation'!
|
|
|
282 |
|
|
|
283 |
version
|
|
1074
|
284 |
^ '$Header: /cvs/stx/stx/libbasic2/Cons.st,v 1.3 2002-07-31 19:34:07 cg Exp $'
|
|
1043
|
285 |
! !
|