• Home
  • Script library
  • AltME Archive
  • Mailing list
  • Articles Index
  • Site search
 

World: r4wp

[#Red] Red language group

Andreas
17-Nov-2012
[3873]
And `pick ser 0`, yes.
PeterWood
17-Nov-2012
[3874]
Which I guess is back wehre the discussion started.
Andreas
17-Nov-2012
[3875]
Exactly :)
PeterWood
17-Nov-2012
[3876]
Well at least I understand the issue a little better :-)
Andreas
17-Nov-2012
[3877]
Ada and VHDL/Verilog are two other languages that spring to mind, 
which allow choosing the index range, like Pascal.
PeterWood
17-Nov-2012
[3878]
But I guess they are all absolute addressing rather than addressing 
realtive to a current position? I believe Pascal is.
Andreas
17-Nov-2012
[3879]
One thing I always find interesting about definable range of Pascal, 
is that Wirth later moved on to fixed, 0-based ranges for arrays 
in Oberon.
PeterWood
17-Nov-2012
[3880x3]
Yes I noticed that.
Is it true to say that whilst there is no effective difference (in 
logical terms) between 0-based and 1-based absolute indexing, there 
is a difference when it comes to relative indexing,
The difference being how to handle zero.
Andreas
17-Nov-2012
[3883]
Basically that's fair to say, yes.
PeterWood
17-Nov-2012
[3884x2]
I feel that there is a consitent way to look at 1-based relative 
addressing but only if you consider 0 to be the position immediately 
before the current position.


It is to define the given index as an offset from 1 (the current 
position). (Examples using current position as absolute index 5 [1-based])


index 10 would be calculated as offset 9 positions from the current 
position [absolute 14]

index 1 would be calculated as offset 0 from the current position 
[absolute 5]
index 0 wold be offest -1 from the current position [absolute 4]

index -1 would be offset - 2 from the current position [absolute 
3]


I know that most people will see this as a kludge or don't like it's 
different behaviour to REBOL2.
On the other hand, it can be explained in a consistent manner.
Andreas
17-Nov-2012
[3886]
Yes, that's also R3's behaviour.
PeterWood
17-Nov-2012
[3887]
Back to the start again? :-)
DocKimbel
17-Nov-2012
[3888]
Here is a new proposition for solving the "PICK issue":

1) Forbid <= 0 indexes.


2) Add a PICK-BACK action that will take only positive integers, 
PICK-BACK series 1 would return the first element on the left of 
current series position.


3) As PICK-BACK is not a very nice and concise name (I like actions 
to be named with a single word), an op! alternative would be provided: 
<- (opening angle-bracket followed by a dash aka "ASCII arrow")

Examples:
    >> series: next [A B C]
    >> pick-back series 1
    == A
    >> series <- 1
    == A
    >> series <- 2
    == none			;-- to be consistent with out-of-bound PICK


For path notations options in such scenario, I'm open to propositions. 
So what are the pros/cons of such solution?
PeterWood
17-Nov-2012
[3889x2]
In forbidding indeces < 1 would none be returned or a runtime error 
raised?
Seeing as the use cases for accessing elements before the 'HEAD appears 
to be quite rare, couldn't pick-back be left as a "mezzanine":

pick-back: func [ser index] [pick skip ser negate index 1]
DocKimbel
17-Nov-2012
[3891x2]
A runtime error. Having it as a mezz could be a good option.
Having it as an action would make it much faster when interpreted 
instead of compiled.
PeterWood
17-Nov-2012
[3893]
As for naming wouldn't a refinement be better?

pick/back series pos-int
DocKimbel
17-Nov-2012
[3894x3]
Maybe.
Probably. :-)
That could also work for FIRST/BACK.
Maxim
17-Nov-2012
[3897]
Doc, the above proposition makes sense if you *also* have a contiguous 
PICK function which you can loop on from negative to position without 
gap (like R3).  I'd use a PICKZ  to eliminate the "0" weirdness from 
the discussion, in that case.
Andreas
17-Nov-2012
[3898x2]
Part of the reason why I keep highlighting the ordinals aspect is 
that I think this is part of what many people really like about current 
R2 behaviour, and many fear to lose.


FIRST is convenient and nice, and having path notation for "first-to-right", 
"first-to-left" is nice as well.
With that background, I still think adding an ordinal! type is a 
nice solution. Here's the basic proposition:


1. introduce an ordinal! type, with literals: -3rd, -2nd, -1st, 1st, 
2nd, 3rd


2. extend PICK and POKE (and paths) to accept integer! and ordinal!

3. have SKIP only accept integer!, AT only accept ordinal!

4. define FIRST, SECOND, THIRD, etc as PICK 1st, etc

4a. maybe add dual FIRST-BACK (or use a /BACK refinement)


That in place, you keep all the nice "human-friendly" features of 
current R2, at the only expense of sometimes having to type 2 extra 
characters.
DocKimbel
17-Nov-2012
[3900]
Andreas: how to you read -1st?
Andreas
17-Nov-2012
[3901]
I personally would read it "minus first", but I think there are many 
other reasonable variations, such as "first to left", or "first back".
DocKimbel
17-Nov-2012
[3902]
first to left

: that's how I read `series/-1` in R2...So if it's just a matter 
of making an implicit convention explicit, better just add a statement 
in the documentation than pay the cost of an additional datatype, 
no?
Andreas
17-Nov-2012
[3903x2]
No, because you can't do that with just integers without severely 
messing up the computational aspect.
If you (ab)use integers to stand in for ordinals, you have to decide: 


- either "nice" ordinal behaviour (-1 preceding 1 for indexing), 
compromising on the integer aspect


- or "nice" computational behaviour (0 preceding 1 for indexing), 
compromising on the ordinal aspect
DocKimbel
17-Nov-2012
[3905]
What do you think about the PICK/BACK option with only positive indexes 
(the most natural approach IMHO)?
Andreas
17-Nov-2012
[3906]
Fine with me, but I think you will still want a method that allows 
you to used the full range of integers as computed indices.
DocKimbel
17-Nov-2012
[3907]
That is another debate 1-indexing vs 0-indexing.
Andreas
17-Nov-2012
[3908]
That is a third debate.
DocKimbel
17-Nov-2012
[3909]
:-)
Andreas
17-Nov-2012
[3910x2]
You will still always want a method for computed indexing with the 
full range of integers independently of whether that anchors at 0 
or 1.
Could be another refinement to PICK, such as PICK/FULL. Or a separate 
function. Or if you just PICKZ (or PICK/ZERO), if you want to add 
that
DocKimbel
17-Nov-2012
[3912]
I think that such computation could be decorrelated from how you 
finally access the series element with the result of the computation.
Andreas
17-Nov-2012
[3913]
Note that my proposal with the ordinal! datatype is also completely 
independent of 0-based or 1-based indexing.
DocKimbel
17-Nov-2012
[3914]
FIRST/ZERO wouldn't look nice. ;-)
Andreas
17-Nov-2012
[3915]
You wouldn't need that.
DocKimbel
17-Nov-2012
[3916]
Right.
Andreas
17-Nov-2012
[3917]
For _computed_ indices you only ever need PICK.
DocKimbel
17-Nov-2012
[3918x2]
I still fail to see a real-world use-case where you need both negative 
and positive indexes at the same time (in other words, compute indexes 
*over* current position). Even in such rare case, you can still do 
the computation using INDEX? SKIP values (so switching to absolute 
indexes instead of relative ones).
R3 was optimized AFAIU specifically for this (extremely?) rare use-case 
over the very common cases for what R2 is optimized for (typically 
`series/-1`). So, could we find, at least one! use-case, where you 
need to compute indexes over current position (where R3 convention 
would prove to be better than R2).
Andreas
17-Nov-2012
[3920]
If you disallow negative indices in PICK, it is quite dangerous to 
_allow_ them in paths.
DocKimbel
17-Nov-2012
[3921]
I wouldn't allow negative integers in path in such case. I would 
either come up with an non-ambiguous syntax to handle path notation 
or forbid it too.
Andreas
17-Nov-2012
[3922]
Ok, that's fine.