Oh, I completely forgot about Balltrix @_@ I may have actually made updates, but I'll have to check later.

Writeback Worries:
-The code for doing this with the high scores is actually smaller and faster than using an external save file, not to mention that it doesn't add clutter to the VAT.
-If I did use an external save file and the user kept it archived, I would have to unarchive it, modify, then rearchive it anyway, so there would still be lag.
-If the program is in RAM, I'm directly modifying the source program, not the copy of it at $9D95. If it is archived, I'm only modifying the copy, so it won't be permanently saved.


As to the comment about the 48-byte thing being unnecessary or possibly more difficult than just using a graphics buffer, it is actually (again), smaller and faster. Like, way faster and way smaller. It takes no extra time to render than a graphics buffer, but scrolling it down and collision testing is a lot faster and the code is smaller.


At work yesterday, I started a routine for converting a keypress (0~56) to a letter character as shown above the button. It worked fairly snazztacularly, but now I have to implement it.

At the moment, I am not working on the 80-bit versions. However, I am not finished working with them. Life is busy again, so it will probably be a while yet before I work on floating point routines again.

My spouse is the one who watches anime, but sometimes I watch too! I have yet to see one series or movie that I disliked, but I can never remember their names :|

Yesterday we watched Patema Inverted and it is exactly the type of movie I like! Fair warning, it made me question my orientation a few times
I've wanted to see Paprika for a while now, and we might be seeing that today!

And for anybody who like humor, I have been a fan of the abridged version of Dragonball Z for the past like 6 years. Very funny, gets the original plot across, and episodes are still being made.

Bugs fixed:
New and Updated Routines
New Bugs:

The TI-OS strings uses tokens, not ASCII. Meanwhile, Axe strings use ASCII. The lowercase tokens are 2-byte tokens starting with $BB, and the second byte starts with 'a' = $B0, but $BB is skipped. In ASCII, 'a'=61h. Putting this confusing mess together, we need to convert $BBB0 -> $61, and so on. I think the following code will work, but only for uppercase and lowercase letters:
;;Assume S points to the OS String data, C is the size of the string

0→I→J
While C
{S}→A
If A=187
{S+1→S}-$4F→A
If A>106
A-1→A
End
End
Text(J,I,°A)
I+1 and 16→I
If I=0
J+1 and 8→J
End
S+1→S
C-1→C
End


I haven't update the public download, but I finished:
log₁₀(x)
ln(x)
log_y(x)
2^x
e^x
y^x

And I'm working on making a much more general and better (asymptotically faster, less RAM used) routine for converting floats to base 10 strings (and TI floats).

Short Term Plan:
After the better float->string, I plan to implement a string->single and tifloat->single. These should be fairly easy to implement (I have done it several times before with success).
After that, a very simple math parser and I/O. This will be difficult-ish (6 on a scale of 1 to 10).

Longterm Schedule:
Update the exponential and log routine with a complex algorithm. Medium difficulty using the existing framework. This will supply most of the trig routines, too.
Add complex support to the math parser.
Extend these routines to the 80-bit floats.
Go nuts because now I can pump out tons of routines since I have the building blocks for most of math.

I originally made the Python program to experiment with the GPIO board on my raspberry pi. I eventually managed to create working link routines between calcs and played with those, but I never did anything substantial. The routines, however, were significantly faster than other routines I have seen, and I think I posted them somewhere.