Simulating 15C RAN # on 35s

[Tugdual]

(02-15-2015 11:37 AM)Thomas Klemm Wrote:  As long as you're not concerned with performance I don't see a reason for not using it. But then it may become a nightmare to edit the equation.
There's an older thread dealing with the RAN# function of the HP-15C that might interest you as well.

Best regards
Thomas

It seems indeed natural to expect RPN to be faster but providing that literals are the same as EQN and the whole code is made of token I wonder how exactly faster RPN would be. I also wonder what the mechanic behind EQN is; it doesn't seem to rely on stack at all otherwise X would be altered during calculation in a totally unpredictable way. When you press MODE, ALG comes before RPN. Should we conclude that ALG is the preferred method and RPN would be somehow emulated? That could make sense since the processor is a generic 8502 and not a Saturn.

Thanks for the link on HP15C RAN#, interesting reading.

Note: regarding the question on performance I have redone the test http://www.thimet.de/CalcCollection/Calc...mance.html with a modified 35s code

Code:

A001 LBL A
A002 10
A003 STO A
A004 (REGX+1-4.567E-4+70-69)*7/11
A005 RCL A
A006 1
A007 -
A008 STO A
A009 x≠0?
A010 GTO A004
A011 R↓
A012 SQRT(SQRT(SIN(LOG(REGX))))
A013 RTN

I found 40s vs 36s.
Slightly less performant... almost hard to conclude.