newRPL: all results mode?

[Nigel (UK)]

(01-25-2016 02:31 PM)Claudio L. Wrote:  I think your idea would work just fine, except for one thing:

\\ 0.5 \\ ASIN \\0.5\\ ASIN +

would evaluate to:
\\ '30+360*n1' '150+360*n2' \\ \\ '30+360*n1' '150+360*n2' \\ +
In both cases, the solution paths contain identical pseudo integer variables that would collide when the + operation is done.
How would the + operator know which variables were automatically created and which ones were not to avoid that collision?

\\ 'n1' \\ ASIN \\0.5\\ ASIN +

This would evaluate to:
\\ 'ASIN(n1)' '180-ASIN(n1)' \\ \\ '30+360*n1' '150+360*n2' \\ +

And then? How would you distinguish between the n1 in the first group and on the other group?

In the first case, the calculator would have to keep track of which 'n' variables have already been used and use the next in a sequence. If this sequence is reasonably long - n00 to n99, for example - wrapping around wouldn't be a major issue.

The second case could be got around by making the 'n' variables unusual in some way - put an unusual character in their name and make sure that users know that such variables are reserved for this purpose.

I understand that implementing this idea has to wait until a rudimentary CAS is in place. I think that the multiple execution path \\...\\ scheme would be excellent for the most common cases of square roots and inverse trig functions between 0 and 360 degrees and is well worth running with for now.

Nigel (UK)