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
|
CLASS::Pair
summary::LISP-like two element cells
categories:: Collections>Ordered
DESCRIPTION::
note::
Implementation incomplete. See link::Guides/J-concepts-in-SC:: for similar functionality.
::
Most methods are inherited from the superclasses.
CLASSMETHODS::
method::new
Return new instance.
method::newFrom
Convert collection (e.g. arrays of arrays) to pairs.
INSTANCEMETHODS::
private::storeOn, printOn, storeArgs
method::size
Return the size when linking across.
method::depth
Return the size when linking down.
method::do
Iterate over the two elements.
Traverse
Same like: link::#-depthFirstPreOrderTraversal::
method::depthFirstPreOrderTraversal
Traverse the data structure first link down, then across (see link::#examples::).
method::depthFirstPostOrderTraversal
Traverse the data structure from bottom up (see link::#examples::).
EXAMPLES::
code::
a = Pair(Pair(Pair(1, 2), 4), Pair(5, 6));
a.size;
a.depth;
a.do { |x| x.postln };
a.traverse { |x| x.postln };
a.depthFirstPreOrderTraversal { |x| x.postln };
a.depthFirstPostOrderTraversal { |x| x.postln };
// alternative instantiations:
Pair.newFrom([1, [2, [[4, 5], 6]]]);
[1, [2, [[4, 5], 6]]].as(Pair); // equivalent.
::
|
