author | Claus Gittinger <cg@exept.de> |
Thu, 14 Dec 1995 16:56:13 +0100 | |
changeset 750 | f4ed622893ce |
parent 701 | a309e3ef7faf |
child 829 | fc386319f41c |
permissions | -rw-r--r-- |
1 | 1 |
" |
5 | 2 |
COPYRIGHT (c) 1988 by Claus Gittinger |
202 | 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 |
" |
|
12 |
||
13 |
PositionableStream subclass:#ReadStream |
|
611 | 14 |
instanceVariableNames:'' |
15 |
classVariableNames:'' |
|
16 |
poolDictionaries:'' |
|
17 |
category:'Streams' |
|
1 | 18 |
! |
19 |
||
88 | 20 |
!ReadStream class methodsFor:'documentation'! |
21 |
||
22 |
copyright |
|
23 |
" |
|
24 |
COPYRIGHT (c) 1988 by Claus Gittinger |
|
202 | 25 |
All Rights Reserved |
1 | 26 |
|
88 | 27 |
This software is furnished under a license and may be used |
28 |
only in accordance with the terms of that license and with the |
|
29 |
inclusion of the above copyright notice. This software may not |
|
30 |
be provided or otherwise made available to, or used by, any |
|
31 |
other person. No title to or ownership of the software is |
|
32 |
hereby transferred. |
|
33 |
" |
|
34 |
! |
|
1 | 35 |
|
88 | 36 |
documentation |
37 |
" |
|
38 |
ReadStream defines protocol for reading streamwise over collections. |
|
39 |
" |
|
40 |
! ! |
|
1 | 41 |
|
202 | 42 |
!ReadStream methodsFor:'converting'! |
43 |
||
44 |
readStream |
|
45 |
"return a readStream from the receiver. Since this is already |
|
46 |
a readStream, return self." |
|
47 |
||
48 |
^ self |
|
49 |
! ! |
|
50 |
||
345 | 51 |
!ReadStream methodsFor:'queries'! |
52 |
||
53 |
isReadable |
|
54 |
^ true |
|
55 |
! ! |
|
56 |
||
59 | 57 |
!ReadStream methodsFor:'reading'! |
1 | 58 |
|
59 |
next |
|
60 |
"return the next element; advance read pointer. |
|
2 | 61 |
return nil, if there is no next element. |
345 | 62 |
- tuned for a bit more speed on String/ByteArray/Array-Streams" |
1 | 63 |
|
64 |
|ret| |
|
65 |
||
66 |
%{ /* NOCONTEXT */ |
|
67 |
||
68 |
REGISTER int pos; |
|
69 |
unsigned ch; |
|
252 | 70 |
OBJ coll, p, l; |
1 | 71 |
|
2 | 72 |
coll = _INST(collection); |
252 | 73 |
p = _INST(position); |
74 |
l = _INST(readLimit); |
|
1 | 75 |
|
252 | 76 |
if (__isNonNilObject(coll) && __bothSmallInteger(p, l)) { |
77 |
||
78 |
pos = _intVal(p); |
|
79 |
if (pos > _intVal(l)) { |
|
202 | 80 |
RETURN ( nil ); |
81 |
} |
|
82 |
if (pos > 0) { |
|
83 |
OBJ cls; |
|
59 | 84 |
|
329 | 85 |
cls = __qClass(coll); |
202 | 86 |
if (cls == String) { |
87 |
if (pos <= _stringSize(coll)) { |
|
88 |
_INST(position) = _MKSMALLINT(pos + 1); |
|
89 |
ch = _stringVal(coll)[pos-1]; |
|
90 |
RETURN ( _MKCHARACTER(ch) ); |
|
91 |
} |
|
92 |
} else if (cls == ByteArray) { |
|
93 |
if (pos <= _byteArraySize(coll)) { |
|
94 |
_INST(position) = _MKSMALLINT(pos + 1); |
|
95 |
ch = _ByteArrayInstPtr(coll)->ba_element[pos-1]; |
|
96 |
RETURN ( _MKSMALLINT(ch) ); |
|
97 |
} |
|
98 |
} else if (cls == Array) { |
|
99 |
if (pos <= _arraySize(coll)) { |
|
100 |
_INST(position) = _MKSMALLINT(pos + 1); |
|
101 |
RETURN ( _ArrayInstPtr(coll)->a_element[pos-1]); |
|
102 |
} |
|
103 |
} |
|
104 |
} |
|
1 | 105 |
} |
106 |
%} |
|
107 |
. |
|
108 |
(position > readLimit) ifTrue:[^ nil]. |
|
109 |
ret := collection at:position. |
|
110 |
position := position + 1. |
|
111 |
^ ret |
|
112 |
! |
|
113 |
||
252 | 114 |
nextAlphaNumericWord |
1 | 115 |
"read the next word (i.e. up to non letter-or-digit). |
116 |
return a string containing those characters. |
|
59 | 117 |
- tuned for speed on String-Streams for faster scanning" |
1 | 118 |
%{ |
119 |
/* speedup, if collection is a string */ |
|
120 |
||
121 |
int pos, limit, sz; |
|
122 |
int len; |
|
13 | 123 |
char buffer[256]; |
124 |
REGISTER unsigned char *cp; |
|
125 |
REGISTER unsigned ch; |
|
252 | 126 |
OBJ coll, p, l; |
521
70533ec40482
use new MKSTRING_L if length is known (avoids a useless strlen)
Claus Gittinger <cg@exept.de>
parents:
384
diff
changeset
|
127 |
OBJ __MKSTRING_L(); |
1 | 128 |
|
252 | 129 |
coll = _INST(collection); |
130 |
p = _INST(position); |
|
131 |
l = _INST(readLimit); |
|
132 |
||
133 |
if (__isString(coll) && __bothSmallInteger(p, l)) { |
|
134 |
||
135 |
pos = _intVal(p); |
|
136 |
limit = _intVal(l); |
|
329 | 137 |
sz = __qSize(coll) - OHDR_SIZE; |
202 | 138 |
if (sz < limit) |
139 |
limit = sz; |
|
252 | 140 |
cp = _stringVal(coll) + pos - 1; |
1 | 141 |
|
202 | 142 |
for (;;) { |
143 |
if (pos > limit) break; |
|
144 |
ch = *cp; |
|
1 | 145 |
|
202 | 146 |
if (ch > ' ') break; |
147 |
if ((ch != ' ') && (ch != '\t') && (ch != '\r') |
|
148 |
&& (ch != '\n') && (ch != 0x0b)) break; |
|
149 |
cp++; |
|
150 |
pos++; |
|
151 |
} |
|
1 | 152 |
|
202 | 153 |
len = 0; |
154 |
for (;;) { |
|
155 |
if (pos > limit) break; |
|
156 |
ch = *cp & 0xFF; |
|
1 | 157 |
|
202 | 158 |
if (! (((ch >= 'a') && (ch <= 'z')) || |
159 |
((ch >= 'A') && (ch <= 'Z')) || |
|
160 |
((ch >= '0') && (ch <= '9')))) |
|
161 |
break; |
|
162 |
buffer[len++] = ch; |
|
163 |
if (len >= (sizeof(buffer)-1)) { |
|
164 |
/* emergency */ |
|
165 |
break; |
|
166 |
} |
|
167 |
pos++; |
|
168 |
cp++; |
|
169 |
} |
|
1 | 170 |
|
202 | 171 |
_INST(position) = _MKSMALLINT(pos); |
172 |
buffer[len] = '\0'; |
|
521
70533ec40482
use new MKSTRING_L if length is known (avoids a useless strlen)
Claus Gittinger <cg@exept.de>
parents:
384
diff
changeset
|
173 |
RETURN ( (len != 0) ? __MKSTRING_L(buffer, len COMMA_CON) : nil ); |
1 | 174 |
} |
175 |
%} |
|
176 |
. |
|
252 | 177 |
^ super nextAlphaNumericWord |
1 | 178 |
! |
179 |
||
611 | 180 |
nextDecimalInteger |
181 |
"read the next integer in radix 10. dont skip whitespace. |
|
182 |
- tuned for speed on String-Streams for faster scanning" |
|
183 |
||
184 |
|value nextOne| |
|
185 |
%{ |
|
186 |
int pos, limit, sz; |
|
187 |
REGISTER unsigned char *cp; |
|
188 |
REGISTER unsigned ch; |
|
189 |
int val = 0; |
|
190 |
OBJ coll, p, l; |
|
191 |
||
192 |
coll = _INST(collection); |
|
193 |
p = _INST(position); |
|
194 |
l = _INST(readLimit); |
|
195 |
||
196 |
if (__isString(coll) && __bothSmallInteger(p, l)) { |
|
197 |
||
198 |
pos = _intVal(p); |
|
199 |
limit = _intVal(l); |
|
200 |
sz = __qSize(coll) - OHDR_SIZE; |
|
201 |
if (sz < limit) |
|
202 |
limit = sz; |
|
203 |
cp = _stringVal(coll) + pos - 1; |
|
204 |
||
205 |
for (;;) { |
|
206 |
if (pos > limit) break; |
|
207 |
ch = *cp; |
|
208 |
||
209 |
if ((ch < '0') || (ch > '9')) break; |
|
210 |
val = val * 10 + (ch - '0'); |
|
211 |
pos++; |
|
212 |
if (val > (_MAX_INT / 10)) goto oops; |
|
213 |
cp++; |
|
214 |
} |
|
215 |
_INST(position) = _MKSMALLINT(pos); |
|
216 |
return _MKSMALLINT(val); |
|
217 |
} |
|
218 |
oops: |
|
219 |
value = _MKSMALLINT(val); |
|
220 |
%} |
|
221 |
. |
|
222 |
"fall-back for non-string streams - we have to continue where |
|
223 |
above primitive left off, in case of a large integer ... |
|
224 |
(instead of doing a super nextDecimalInteger)" |
|
225 |
||
226 |
nextOne := self peek. |
|
227 |
[nextOne notNil and:[nextOne isDigitRadix:10]] whileTrue:[ |
|
228 |
value = (value * 10) + nextOne digitValue. |
|
229 |
nextOne := self nextPeek |
|
230 |
]. |
|
231 |
^ value |
|
232 |
! |
|
233 |
||
234 |
nextPeek |
|
235 |
"advance read pointer return the peek element. |
|
236 |
this is equivalent to (self next; peek). |
|
237 |
- tuned for speed on String-Streams for faster scanning" |
|
238 |
||
239 |
%{ /* NOCONTEXT */ |
|
240 |
OBJ coll, l, p; |
|
241 |
||
242 |
coll = _INST(collection); |
|
243 |
p = _INST(position); |
|
244 |
l = _INST(readLimit); |
|
245 |
||
246 |
if (__isString(coll) && __bothSmallInteger(p, l)) { |
|
247 |
REGISTER int pos; |
|
248 |
unsigned ch; |
|
249 |
||
250 |
pos = _intVal(p); |
|
251 |
if (pos > _intVal(l)) { |
|
252 |
RETURN ( nil ); |
|
253 |
} |
|
254 |
if ((pos > 0) && (pos <= _stringSize(coll))) { |
|
255 |
_INST(position) = _MKSMALLINT(pos + 1); |
|
256 |
pos = pos + 1; |
|
257 |
if (pos > _intVal(l)) { |
|
258 |
RETURN ( nil ); |
|
259 |
} |
|
260 |
if (pos <= _stringSize(coll)) { |
|
261 |
ch = _stringVal(coll)[pos-1]; |
|
262 |
RETURN ( _MKCHARACTER(ch) ); |
|
263 |
} |
|
264 |
RETURN ( nil ); |
|
265 |
} |
|
266 |
} |
|
267 |
%} |
|
268 |
. |
|
269 |
(position > readLimit) ifTrue:[^ nil]. |
|
270 |
position := position + 1. |
|
271 |
(position > readLimit) ifTrue:[^ nil]. |
|
272 |
^ collection at:position |
|
273 |
! |
|
274 |
||
1 | 275 |
nextSymbol |
276 |
"read the next selector-symbol (i.e. up to non letter-or-digit). |
|
277 |
return a string containing those characters. |
|
59 | 278 |
- tuned for speed on String-Streams for faster scanning" |
1 | 279 |
%{ |
280 |
int pos, limit, sz; |
|
281 |
int len; |
|
13 | 282 |
char buffer[256]; |
283 |
REGISTER unsigned char *cp; |
|
284 |
REGISTER unsigned ch; |
|
252 | 285 |
OBJ coll, p, l; |
521
70533ec40482
use new MKSTRING_L if length is known (avoids a useless strlen)
Claus Gittinger <cg@exept.de>
parents:
384
diff
changeset
|
286 |
OBJ __MKSTRING_L(); |
1 | 287 |
|
252 | 288 |
coll = _INST(collection); |
289 |
p = _INST(position); |
|
290 |
l = _INST(readLimit); |
|
291 |
||
292 |
if (__isString(coll) && __bothSmallInteger(p, l)) { |
|
293 |
||
294 |
pos = _intVal(p); |
|
295 |
limit = _intVal(l); |
|
329 | 296 |
sz = __qSize(coll) - OHDR_SIZE; |
202 | 297 |
if (sz < limit) |
298 |
limit = sz; |
|
252 | 299 |
cp = _stringVal(coll) + pos - 1; |
1 | 300 |
|
202 | 301 |
len = 0; |
302 |
for (;;) { |
|
303 |
if (pos > limit) break; |
|
304 |
ch = *cp; |
|
1 | 305 |
|
202 | 306 |
if (! (((ch >= 'a') && (ch <= 'z')) || |
307 |
((ch >= 'A') && (ch <= 'Z')) || |
|
308 |
((ch >= '0') && (ch <= '9')) || |
|
309 |
(ch == ':'))) |
|
310 |
break; |
|
311 |
buffer[len++] = ch; |
|
312 |
if (len >= (sizeof(buffer)-1)) { |
|
313 |
/* emergency */ |
|
314 |
break; |
|
315 |
} |
|
316 |
pos++; |
|
317 |
cp++; |
|
318 |
} |
|
1 | 319 |
|
202 | 320 |
_INST(position) = _MKSMALLINT(pos); |
321 |
buffer[len] = '\0'; |
|
521
70533ec40482
use new MKSTRING_L if length is known (avoids a useless strlen)
Claus Gittinger <cg@exept.de>
parents:
384
diff
changeset
|
322 |
RETURN ( (len != 0) ? __MKSTRING_L(buffer, len COMMA_CON) : nil ); |
1 | 323 |
} |
324 |
%} |
|
325 |
. |
|
326 |
^ super nextSymbol |
|
327 |
! |
|
328 |
||
611 | 329 |
peek |
330 |
"return the next element; do NOT advance read pointer. |
|
331 |
return nil, if there is no next element. |
|
332 |
- tuned for a bit more speed on String/ByteArray/Array-Streams" |
|
1 | 333 |
|
334 |
%{ /* NOCONTEXT */ |
|
611 | 335 |
|
336 |
REGISTER int pos; |
|
337 |
unsigned ch; |
|
338 |
OBJ coll; |
|
339 |
OBJ cls, p, l; |
|
340 |
extern OBJ ByteArray; |
|
1 | 341 |
|
59 | 342 |
coll = _INST(collection); |
252 | 343 |
p = _INST(position); |
344 |
l = _INST(readLimit); |
|
345 |
||
611 | 346 |
if (__isNonNilObject(coll) && __bothSmallInteger(p, l)) { |
1 | 347 |
|
252 | 348 |
pos = _intVal(p); |
611 | 349 |
if (pos > _intVal(l)) { |
202 | 350 |
RETURN ( nil ); |
351 |
} |
|
1 | 352 |
|
611 | 353 |
if (pos > 0) { |
354 |
cls = __qClass(coll); |
|
355 |
if (cls == String) { |
|
356 |
if (pos <= _stringSize(coll)) { |
|
357 |
ch = _stringVal(coll)[pos-1]; |
|
358 |
RETURN ( _MKCHARACTER(ch) ); |
|
359 |
} |
|
360 |
} else if (cls == ByteArray) { |
|
361 |
if (pos <= _byteArraySize(coll)) { |
|
362 |
ch = _ByteArrayInstPtr(coll)->ba_element[pos-1]; |
|
363 |
RETURN ( _MKSMALLINT(ch) ); |
|
364 |
} |
|
365 |
} else if (cls == Array) { |
|
366 |
if (pos <= _arraySize(coll)) { |
|
367 |
RETURN ( _ArrayInstPtr(coll)->a_element[pos-1]); |
|
368 |
} |
|
202 | 369 |
} |
370 |
} |
|
1 | 371 |
} |
372 |
%} |
|
373 |
. |
|
611 | 374 |
(position > readLimit) ifTrue:[^ nil]. |
375 |
^ collection at:position |
|
1 | 376 |
! |
377 |
||
378 |
skipSeparators |
|
379 |
"skip all whitespace; next will return next non-white-space element. |
|
59 | 380 |
Return the peeked character or nil, if the end-of-stream was reached. |
2 | 381 |
- reimplemented for speed on String-Streams for faster scanning" |
1 | 382 |
|
383 |
%{ /* NOCONTEXT */ |
|
252 | 384 |
OBJ coll, p, l; |
1 | 385 |
|
252 | 386 |
coll = _INST(collection); |
387 |
p = _INST(position); |
|
388 |
l = _INST(readLimit); |
|
389 |
||
390 |
if (__isString(coll) && __bothSmallInteger(p, l)) { |
|
202 | 391 |
REGISTER unsigned char *chars; |
392 |
REGISTER unsigned ch; |
|
393 |
REGISTER int pos; |
|
394 |
int limit; |
|
1 | 395 |
|
252 | 396 |
pos = _intVal(p); |
202 | 397 |
if (pos <= 0) { |
398 |
RETURN ( nil ); |
|
399 |
} |
|
1 | 400 |
|
252 | 401 |
limit = _intVal(l); |
329 | 402 |
if (limit > (__qSize(coll) - OHDR_SIZE)) |
403 |
limit = __qSize(coll) - OHDR_SIZE; |
|
1 | 404 |
|
252 | 405 |
chars = (unsigned char *)(_stringVal(coll) + pos - 1); |
202 | 406 |
while (pos <= limit) { |
407 |
ch = *chars++; |
|
408 |
if ((ch != ' ') && (ch != '\t') && (ch != '\r') |
|
409 |
&& (ch != '\n') && (ch != 0x0B)) { |
|
410 |
_INST(position) = _MKSMALLINT(pos); |
|
411 |
RETURN ( _MKCHARACTER(ch) ); |
|
412 |
} |
|
413 |
pos++; |
|
414 |
} |
|
415 |
_INST(position) = _MKSMALLINT(pos); |
|
416 |
RETURN ( nil ); |
|
1 | 417 |
} |
418 |
%} |
|
419 |
. |
|
420 |
^ super skipSeparators |
|
421 |
! |
|
422 |
||
13 | 423 |
skipSeparatorsExceptCR |
424 |
"skip all whitespace except newlines; |
|
202 | 425 |
next will return next non-white-space element. |
426 |
- reimplemented for speed on String-Streams for faster scanning" |
|
427 |
||
13 | 428 |
%{ /* NOCONTEXT */ |
429 |
||
252 | 430 |
OBJ coll, p, l; |
431 |
||
432 |
coll = _INST(collection); |
|
433 |
p = _INST(position); |
|
434 |
l = _INST(readLimit); |
|
435 |
||
436 |
if (__isString(coll) && __bothSmallInteger(p, l)) { |
|
202 | 437 |
REGISTER unsigned char *chars; |
438 |
REGISTER unsigned ch; |
|
439 |
REGISTER int pos; |
|
440 |
int limit; |
|
13 | 441 |
|
252 | 442 |
pos = _intVal(p); |
202 | 443 |
if (pos <= 0) { |
444 |
RETURN ( nil ); |
|
445 |
} |
|
13 | 446 |
|
252 | 447 |
limit = _intVal(l); |
329 | 448 |
if (limit > (__qSize(coll) - OHDR_SIZE)) |
449 |
limit = __qSize(coll) - OHDR_SIZE; |
|
13 | 450 |
|
252 | 451 |
chars = (unsigned char *)(_stringVal(coll) + pos - 1); |
202 | 452 |
while (pos <= limit) { |
453 |
ch = *chars++; |
|
454 |
if ((ch != ' ') && (ch != '\t') && (ch != '\r') && (ch != 0x0B)) { |
|
455 |
_INST(position) = _MKSMALLINT(pos); |
|
456 |
RETURN ( _MKCHARACTER(ch) ); |
|
457 |
} |
|
458 |
pos++; |
|
459 |
} |
|
460 |
_INST(position) = _MKSMALLINT(pos); |
|
461 |
RETURN ( nil ); |
|
13 | 462 |
} |
463 |
%} |
|
464 |
. |
|
465 |
^ super skipSeparatorsExceptCR |
|
466 |
! |
|
467 |
||
611 | 468 |
skipThrough:anObject |
469 |
"skip all objects up-to and including anObject, return anObject on success, |
|
470 |
nil if end-of-stream is reached before. |
|
471 |
On success, the next read operation will return the element after anObject. |
|
472 |
- reimplemented for speed on String-Streams for faster scanning" |
|
473 |
||
474 |
%{ /* NOCONTEXT */ |
|
475 |
OBJ coll, p, l; |
|
476 |
||
477 |
coll = _INST(collection); |
|
478 |
p = _INST(position); |
|
479 |
l = _INST(readLimit); |
|
480 |
||
481 |
if (__isString(coll) |
|
482 |
&& __isCharacter(anObject) |
|
483 |
&& __bothSmallInteger(p, l)) { |
|
484 |
REGISTER unsigned char *chars; |
|
485 |
REGISTER int pos, limit; |
|
486 |
unsigned ch; |
|
487 |
int sz; |
|
488 |
||
489 |
pos = _intVal(p); |
|
490 |
if (pos <= 0) { |
|
491 |
RETURN ( nil ); |
|
492 |
} |
|
493 |
||
494 |
limit = _intVal(l); |
|
495 |
sz = _stringSize(coll); |
|
496 |
if (limit > sz) limit = sz; |
|
497 |
||
498 |
chars = (unsigned char *)(_stringVal(coll) + pos - 1); |
|
499 |
ch = _intVal(_characterVal(anObject)) & 0xFF; |
|
500 |
while (pos < limit) { |
|
501 |
if (*chars == ch) { |
|
502 |
ch = *++chars; |
|
503 |
pos++; |
|
504 |
_INST(position) = _MKSMALLINT(pos); |
|
505 |
RETURN ( anObject ); |
|
506 |
} |
|
507 |
chars++; |
|
508 |
pos++; |
|
509 |
} |
|
510 |
RETURN ( nil ); |
|
511 |
} |
|
512 |
%} |
|
513 |
. |
|
514 |
^ super skipThrough:anObject |
|
515 |
! |
|
516 |
||
1 | 517 |
skipToAll:aCollection |
518 |
"skip for the sequence given by the argument, aCollection; |
|
519 |
return nil if not found, self otherwise. On a successful match, next read |
|
520 |
will return elements of aCollection." |
|
521 |
||
522 |
|oldPos buffer l first idx| |
|
523 |
||
524 |
oldPos := self position. |
|
525 |
l := aCollection size. |
|
526 |
first := aCollection at:1. |
|
527 |
[self atEnd] whileFalse:[ |
|
202 | 528 |
buffer := self next:l. |
529 |
buffer = aCollection ifTrue:[ |
|
530 |
self position:(self position - l). |
|
531 |
^ self |
|
532 |
]. |
|
533 |
idx := buffer indexOf:first startingAt:2. |
|
534 |
idx == 0 ifFalse:[ |
|
535 |
self position:(self position - l + idx - 1) |
|
536 |
] |
|
1 | 537 |
]. |
538 |
self position:oldPos. |
|
539 |
^ nil |
|
540 |
||
59 | 541 |
" |
542 |
|s| |
|
1 | 543 |
s := ReadStream on:'12345678901234567890'. |
544 |
s skipToAll:'901'. |
|
59 | 545 |
s next:4 |
546 |
" |
|
1 | 547 |
! ! |
548 |
||
59 | 549 |
!ReadStream methodsFor:'writing'! |
1 | 550 |
|
551 |
nextPut:anElement |
|
10 | 552 |
"catch write access to readstreams - report an error" |
553 |
||
554 |
self shouldNotImplement |
|
1 | 555 |
! ! |
611 | 556 |
|
701 | 557 |
!ReadStream class methodsFor:'documentation'! |
558 |
||
559 |
version |
|
560 |
^ '$Header: /cvs/stx/stx/libbasic/ReadStream.st,v 1.21 1995-12-07 21:38:02 cg Exp $' |
|
561 |
! ! |