Hello. I'm the same MicroPro on casiocalc.org, don't visit here often (if not never) and just saw this topic from the link 42 gave on the shoutbox there.

Happy to see your first impressions, Kerm. You should really move this topic in your TI sub-forum ! and you forgot to mention support for Laplace and Fourier transforms in CP.

And you know you can overclock ClassPad, yeah?

And that for most programs the experienced use CPLua (ClassPad's on-calc Lua IDE).

...

Actually you reminded me memories... For writing QBasic (http://community.casiocalc.org/topic/5024-project-cp-qbasic, http://community.casiocalc.org/topic/5083-qbasic-version-020-released) about 2 years ago, I had to reverse engineer the entire program format. QBasic was basically ClassPad's CAS and local variable framework + my own lexer and command implementation. Anyway I consider it dead now.

You made me go look back in my source code and I saw that I had implemented "For" loops so tested your code:

- For the "For 1 -> i to 9999" thing I got 7:44 (446 seconds) in QBasic (high time because my Locate implementation was inefficient)

- For the "sqrt(sin(ln(1+Abs(cos I))))" repeating 999 times, QBasic makes it in 27 seconds.

Happy to see your first impressions, Kerm. You should really move this topic in your TI sub-forum ! and you forgot to mention support for Laplace and Fourier transforms in CP.

**KermMartian wrote:**

I suspect that the ClassPad 330 takes longer because it doesn't tokenize at all; commands are characters instead of tokens. From a math point of view, it certainly doesn't skimp on power.

ClassPad does translate the commands to two byte opcodes like other models. But somehow its parser sucks.
And you know you can overclock ClassPad, yeah?

And that for most programs the experienced use CPLua (ClassPad's on-calc Lua IDE).

...

Actually you reminded me memories... For writing QBasic (http://community.casiocalc.org/topic/5024-project-cp-qbasic, http://community.casiocalc.org/topic/5083-qbasic-version-020-released) about 2 years ago, I had to reverse engineer the entire program format. QBasic was basically ClassPad's CAS and local variable framework + my own lexer and command implementation. Anyway I consider it dead now.

You made me go look back in my source code and I saw that I had implemented "For" loops so tested your code:

- For the "For 1 -> i to 9999" thing I got 7:44 (446 seconds) in QBasic (high time because my Locate implementation was inefficient)

- For the "sqrt(sin(ln(1+Abs(cos I))))" repeating 999 times, QBasic makes it in 27 seconds.