> On 15 Mar 2025, at 11:36, Rony G. Flatscher <rony.flatsc...@wu.ac.at> wrote:
>
> Any comments from others reading this group?
>
Maybe 2 comments.
1)
I find the term “sparse” misleading.
when the target is an ordered collection, the target is never sparse: no hole
in the indexes thanks to ~appendAll or ~append
when the target is a stem, the target can be sparse
dumping a Stem:
# 1: index=[0] val: [5]
# 2: index=[3] val: [hi (3)]
# 3: index=[1] val: [hi (1)]
On the source side, it seems that “sparse” means "only include tail values that
are defined”
But see 2), it’s not the case when no default value.
2)
when not parse ("-- pass 2 -- supplying a second argument …")
If I put in comment the assignment of default value, then I get
dumping a XRRAY:
# 1: index=[1] val: [hi (1)]
# 2: index=[2] val: [S.2]
# 3: index=[3] val: [hi (3)]
# 4: index=[4] val: [S.4]
# 5: index=[5] val: [S.5]
dumping a Stem:
# 1: index=[0] val: [5]
# 2: index=[2] val: [S.2]
# 3: index=[1] val: [hi (1)]
# 4: index=[5] val: [S.5]
# 5: index=[4] val: [S.4]
# 6: index=[3] val: [hi (3)]
I would expect
dumping a XRRAY:
# 1: index=[1] val: [hi (1)]
# 2: index=[2] val: [hi (3)]
dumping a Stem:
# 1: index=[0] val: [5]
# 2: index=[3] val: [hi (3)]
# 3: index=[1] val: [hi (1)]
because S.2, S.4 and S.5 denote undefined values.
But that would be the mode “sparse”…
An attempt to summarize the cases:
case target source
1 ordered collection ordered collection
2 ordered collection stem
3 stem ordered collection
4 stem stem
case sparse parameter
1 no effect
2 true: only include tail values that are defined
false: include all possible tail values
3 no effect
4 true: the new stem will be sparse if the stem is sparse
false: the new stem won't be sparse even if the stem is sparse
_______________________________________________
Oorexx-devel mailing list
Oorexx-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/oorexx-devel
