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