Nope, just that.  But you have to make sure to add the Fix 8 to the end of the program.  It makes the calc draw bitmaps directly to screen, like normal.

Question: At which point does the calc ever actually use the bitmap command I wonder? O.o

I think he meant I would also like to be able. Didn't Axe already support bit reading/writing, though?

Quote from: Michael_Lee on February 14, 2011, 02:59:51 pm

Nope, just that.  But you have to make sure to add the Fix 8 to the end of the program.  It makes the calc draw bitmaps directly to screen, like normal.

Question: At which point does the calc ever actually use the bitmap command I wonder? O.o

I believe the cross-like graphscreen cursor is a bitmap.

Bit flipping sounds like a useful feature too. Might be slow, though.

What do you mean by bit flipping? If I understand correctly, couldn't that be done with a simple
A xor b(bits to be flipped) -> A

For example,
A xor 15 -> A
would flip bits 0-4.

Whoops, I just noticed I replied to ralphdspam on a different page...

I actually had Huffman Coding in mind when I requested this feature.  It would save a lot of space in my code if I could just work with individual bits instead of having to test the entire byte for the individual bits.  (if that made any sense  )

Could you give axioms the ability to define their own Fix statements? As far as I can tell, the parser handles Fix statements as special cases anyways, merging two one-byte tokens into one command. I believe it would be invaluable for Axiom programmers to be able to provide settings for their commands with their own Fix statements, whether they are expanded to allow arguments greater than 2 digits like Fix 10, or at least allow any second token to be appended, like Fix A, or even something like Fix  or .


EDIT: Also, any chance of support for Axioms followed by a store token? Like: Pt-On(X,Y,PIC)→BUFF


EDIT 2: Oh yeah, and is the limit of 32 entries per Axiom listed in the documentation a technical limitation? Because if not, any chances that limit could be lifted? I forsee something I'm working on passing 32 entries. A lot of them are just custom variable defines and slightly varying calls (number of arguments, r modifiers) for a few actual routines, but the total number is bound to surpass 32.

Something like the multi-digit Fix things would be cool in a normal program as well (something like Fix 0,6,8).

or Fix 068 could work.  I believe that was asked before somewhere.  I like the idea.  Would it be smaller compiled code?, or the same?

Quote from: ralphdspam on February 15, 2011, 01:39:56 am

It would also [like to] be able to read/write to bits instead of just bytes and nibbles. 

You can, with bit-masking. (Use and, or, and xor to mask bytes, then store them back.)

Bit flipping sounds like a useful feature too. Might be slow, though.

Yeah, but I would have to do something like this:
Say I want to test 10110011
179->A
For(B,0,1)
If nib{A*2+B} and 8
Sub(D)
End
If nib{A*2+B} and 4
Sub(D)
End
If nib{A*2+B} and 2
Sub(D)
End
If nib{A*2+B} and 1
Sub(D)
End
End
Lbl D
.Do Stuff
Return
If there were to be command specifically for bits, I would be able to do this:
179->A
For(B,0,7)
If bit{A*8+B}
.Do Stuff
End
End