[go: up one dir, main page]

Menu

[9a0086]: / man / man3 / Cltn.3  Maximize  Restore  History

Download this file

813 lines (793 with data), 9.6 kB

  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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
.TH "cltn" 3 "Mar 12, 2023"
.SH Cltn
.PP
.B
Inherits from:
Object
.SH Class Description
.PP
This is an abstract superclass for collection classes\&.
.PP
It is useful for implementing functionality, that is inherited by such classes as:
.RS 3
.br
* OrdCltn (Collection)
.br
* Set
.br
* Stack
.br
* SortCltn (Tree)
.RE
.PP
In addition, this class is necessary for compatibility with Stepstone\&'s ICpak101\&.
.SH Method types
.PP
.B
Testing Contents
.RS 3
.br
* includesAllOf:
.br
* includesAnyOf:
.RE
.PP
.B
Adding and Removing Contents
.RS 3
.br
* addAll:
.br
* addContentsOf:
.br
* addContentsTo:
.br
* removeAll:
.br
* removeContentsFrom:
.br
* removeContentsOf:
.RE
.PP
.B
Combining
.RS 3
.br
* intersection:
.br
* union:
.br
* difference:
.RE
.PP
.B
Converting
.RS 3
.br
* asSet
.br
* asOrdCltn
.RE
.PP
.B
Using Blocks
.RS 3
.br
* detect:
.br
* detect:ifNone:
.br
* select:
.br
* reject:
.br
* collect:
.br
* count:
.RE
.PP
.B
Making elements perform
.RS 3
.br
* elementsPerform:
.br
* elementsPerform:with:
.br
* elementsPerform:with:with:
.br
* elementsPerform:with:with:with:
.RE
.PP
.B
Do Blocks
.RS 3
.br
* do:
.br
* do:until:
.RE
.SH Methods
.PP
with:
.RS 1
+
.B
with
:(int)
.I
nArgs,\&.\&.\&.
.RE
.PP
Returns a new object with
.I
nArgs
elements\&. For example,
.RS 3
id aCltn = [OrdCltn with:2,anObject,otherObject];
.br
.RE
.PP
creates a collection and adds
.I
anObject
and
.I
otherObject
to it\&. In a similar way,
.B
Set
or
.B
SortCltn
instances can be created like this\&.
.PP
with:with:
.RS 1
+
.B
with
:
.I
firstObject
.B
with
:
.I
nextObject
.RE
.PP
This method is equivalent to
.B
with:
2,
.I
firstObject
,
.I
nextObject
\&.
.PP
add:
.RS 1
+
.B
add
:
.I
firstObject
.RE
.PP
This method is equivalent to
.B
with:
1,
.I
firstObject
\&.
.PP
This (factory) method has the same name as the instance method
.B
add:
and can be used as follows, in circumstances when the user does not want to allocate a collection unless it is actually used :
.RS 3
aCltn = [ (aCltn)?aCltn:OrdCltn add:myObject ];
.br
.RE
.PP
This shows that creation of the collection is delayed until it is actually needed\&. If the collection already exists, objects are simply added, using the instance method
.B
add:
\&.
.PP
includesAllOf:
.RS 1
- (
BOOL
)
.B
includesAllOf
:
.I
aCltn
.RE
.PP
Answer whether all the elements of
.I
aCltn
are in the receiver, by sending
.B
includes:
for each individual element\&.
.PP
includesAnyOf:
.RS 1
- (
BOOL
)
.B
includesAnyOf
:
.I
aCltn
.RE
.PP
Answer whether any element of
.I
aCltn
is in the receiver, by sending
.B
includes:
for each individual element\&.
.PP
addAll:
.RS 1
-
.B
addAll
:
.I
aCltn
.RE
.PP
Adds each member of
.I
aCltn
to the receiver\&. If
.I
aCltn
is
.B
nil
, no action is taken\&. The argument
.I
aCltn
need not be a collection, so long as it responds to
.B
eachElement
in the same way as collections do\&. Returns the receiver\&.
.PP
.B
Note:
If
.I
aCltn
is the same object as the receiver, a
.B
addYourself
message is sent to the object\&.
.PP
addContentsOf:
.RS 1
-
.B
addContentsOf
:
.I
aCltn
.RE
.PP
This method is equivalent to
.B
addAll:
and is provided for Stepstone ICpak101 compatibility\&.
.PP
addContentsTo:
.RS 1
-
.B
addContentsTo
:
.I
aCltn
.RE
.PP
This method is equivalent to
.B
addAll:
, but with argument and receiver interchanged, and is provided for Stepstone ICpak101 compatibility\&.
.PP
removeAll:
.RS 1
-
.B
removeAll
:
.I
aCltn
.RE
.PP
Removes all of the members of
.I
aCltn
from the receiver\&. The argument
.I
aCltn
need not be a collection, as long as it responds to
.B
eachElement
as collections do\&. Returns the receiver\&.
.PP
.B
Note:
If
.I
aCltn
is the same object as the receiver, it empties itself using
.B
emptyYourself
and returns the receiver\&.
.PP
removeContentsFrom:
.RS 1
-
.B
removeContentsFrom
:
.I
aCltn
.RE
.PP
This method is equivalent to
.B
removeAll:
, and is provided for compatibility with Stepstone ICpak101\&.
.PP
removeContentsOf:
.RS 1
-
.B
removeContentsOf
:
.I
aCltn
.RE
.PP
This method is equivalent to
.B
removeAll:
, and is provided for compatibility with Stepstone ICpak101\&.
.PP
intersection:
.RS 1
-
.B
intersection
:
.I
bag
.RE
.PP
Returns a new Collection which is the intersection of the receiver and
.I
bag
\&. The new Collection contains only those elements that were in both the receiver and
.I
bag
\&. The argument
.I
bag
need not be an actual
.B
Set
or
.B
Bag
instance, as long as it implements
.B
find:
as Sets do\&.
.PP
union:
.RS 1
-
.B
union
:
.I
bag
.RE
.PP
Returns a new Collection which is the union of the receiver and
.I
bag
\&. The new Collection returned has all the elements from both the receiver and
.I
bag
\&. The argument
.I
bag
need not be an actual
.B
Set
or
.B
Bag
instance, as long as it implements
.B
eachElement:
as Sets and Bags do\&.
.PP
difference:
.RS 1
-
.B
difference
:
.I
bag
.RE
.PP
Returns a new Collection which is the difference of the receiver and
.I
bag
\&. The new Collection returned has only those elements in the receiver that are not in
.I
bag
\&.
.PP
asSet
.RS 1
-
.B
asSet
.RE
.PP
Creates a
.B
Set
instance and adds the contents of the object to the set\&.
.PP
asOrdCltn
.RS 1
-
.B
asOrdCltn
.RE
.PP
Creates a
.B
OrdCltn
instance and adds the contents of the object to the set\&.
.PP
detect:
.RS 1
-
.B
detect
:
.I
aBlock
.RE
.PP
This message returns the first element in the receiver for which
.I
aBlock
evaluates to something that is non-nil \&. For example, the following :
.RS 3
[ aCltn detect: { :each | [each isEqual:anObject] } ];
.br
.RE
.PP
Returns
.B
nil
if there\&'s no element for which
.I
aBlock
evaluates to something that non-nil\&.
.PP
detect:ifNone:
.RS 1
-
.B
detect
:
.I
aBlock
.B
ifNone
:
.I
noneBlock
.RE
.PP
This message returns the first element in the receiver for which
.I
aBlock
evaluates to something that is non-nil\&.
.PP
Evaluates
.I
noneBlock
if there\&'s no element for which
.I
aBlock
evaluates to something that is non-nil, and returns the return value of that block\&. For example,
.RS 3
[ aCltn detect: { :e | [e isEqual:anObject]} ifNone: {anObject} ];
.br
.RE
.PP
select:
.RS 1
-
.B
select
:
.I
testBlock
.RE
.PP
This message will return a subset of the receiver containing all elements for which
.I
testBlock
evaluates to an Object that is non-nil\&. For example,
.RS 3
[ aCltn select: { :each | [each isEqual:anObject] } ];
.br
.RE
.PP
Returns a new empty instance of the same class as the receiver, if there\&'s no element for which
.I
testBlock
evaluates to something that is non-nil\&.
.PP
reject:
.RS 1
-
.B
reject
:
.I
testBlock
.RE
.PP
Complement of
.B
select:
.PP
This message will return a subset of the receiver containing all elements for which
.I
testBlock
evaluates to nil\&. For example,
.RS 3
[ aCltn reject: { :each | [each isEqual:anObject] } ];
.br
.RE
.PP
Returns a new empty instance of the same class as the receiver, if there\&'s no element for which
.I
testBlock
evaluates to nil\&.
.PP
collect:
.RS 1
-
.B
collect
:
.I
transformBlock
.RE
.PP
This message creates and returns a new collection of the same size and type as the receiver\&. The elements are the result of performing
.I
transformBlock
on each element in the receiver (elements for which the Block would return
.B
nil
are filtered out)\&.
.PP
count:
.RS 1
- (
unsigned
)
.B
count
:
.I
aBlock
.RE
.PP
Evaluate
.I
aBlock
with each of the receiver\&'s elements as the argument\&. Return the number that answered a non-
.B
nil
value\&.
.PP
elementsPerform:
.RS 1
-
.B
elementsPerform
:(SEL)
.I
aSelector
.RE
.PP
Send
.I
aSelector
to all objects in the collection, starting from the object at offset
.I
0
\&. For Stepstone compatibility\&. Producer uses this\&.
.PP
elementsPerform:with:
.RS 1
-
.B
elementsPerform
:(SEL)
.I
aSelector
.B
with
:
.I
anObject
.RE
.PP
Send
.I
aSelector
to all objects in the collection, starting from the object at offset
.I
0
\&. For Stepstone compatibility\&. Producer uses this\&.
.PP
elementsPerform:with:with:
.RS 1
-
.B
elementsPerform
:(SEL)
.I
aSelector
.B
with
:
.I
anObject
.B
with
:
.I
otherObject
.RE
.PP
Send
.I
aSelector
to all objects in the collection, starting from the object at offset
.I
0
\&. For Stepstone compatibility\&. Producer uses this\&.
.PP
elementsPerform:with:with:with:
.RS 1
-
.B
elementsPerform
:(SEL)
.I
aSelector
.B
with
:
.I
anObject
.B
with
:
.I
otherObject
.B
with
:
.I
thirdObj
.RE
.PP
Send
.I
aSelector
to all objects in the collection, starting from the object at offset
.I
0
\&. For Stepstone compatibility\&. ICpak201 uses this\&.
.PP
do:
.RS 1
-
.B
do
:
.I
aBlock
.RE
.PP
Evaluates
.I
aBlock
for each element in the collection and returns
.B
self
\&.
.I
aBlock
must be a block taking one object (element) as argument; the return value of the block is ignored by this method\&.
.PP
Often, the Block would, as a side-effect, modify a variable, as in:
.RS 3
int count = 0;
.br
[contents do: { :what | if (what == anObject) count++; }];
.br
.RE
.PP
do:until:
.RS 1
-
.B
do
:
.I
aBlock
.B
until
:(BOOL*)
.I
flag
.RE
.PP
Evaluates
.I
aBlock
for each element in the collection, or until the variable pointed to by
.I
flag
becomes true, and returns
.B
self
\&.
.I
aBlock
must be a block taking one object (element) as argument; the return value of the block is ignored by this method\&.
.PP
Typically the Block will modify the variable
.I
flag
when some condition holds:
.RS 3
BOOL found = NO;
.br
[contents do:{ :what | if (what == findObject) found=YES;} until:&found];
.br
if (found) { \&.\&.\&. }
.br
.RE