Whats the smallest way of writing bits? (I don't care if it's Axe or Asm(HEX) type of thing)

So far the only thing I've come up with is {Pointer}±e^(7-Bit#)→{Pointer}Use + for writing 1 to the bit, or - for writing 0 to the bit. The only problem is that writing 0 or 1 to a bit that already contains 0 or 1 respectively, will mess everything up.

Does anyone have any ideas?

{Pointer} xor %0000 0100

will write the third bit to one. just replace the 1 with whichever bit you're trying to write, and convert the binary into a decmal number. remember, if you're writing a bit to a two-byte area, you need to use the plot-style token instead of xor.

Actually, xor will flip the 3rd bit back and forth.  If the 3rd bit equals zero, xor will make the 3rd bit equal to 1.  If it's 1, xor will make the 3rd bit equal to zero.

Try using {Pointer} and %11111011 to make the 3rd bit equal to zero, for example.  Try using {Pointer} or %00000100 to make the 3rd bit equal to one.

Quote from: nemo on November 08, 2010, 03:35:56 pm

{Pointer} xor %0000 0100

will write the third bit to one. just replace the 1 with whichever bit you're trying to write, and convert the binary into a decmal number. remember, if you're writing a bit to a two-byte area, you need to use the plot-style token instead of xor.

Actually, xor will flip the 3rd bit back and forth.  If the 3rd bit equals zero, xor will make the 3rd bit equal to 1.  If it's 1, xor will make the 3rd bit equal to zero.

Try using {Pointer} and %11111011 to make the 3rd bit equal to zero, for example.  Try using {Pointer} or %00000100 to make the 3rd bit equal to one.

oops. i forgot about that. of course, or will work too.

General form: {Pointer}Asm(CBXX)→{Pointer}, where XX is a byte from the following table. In this table, I call bit 0 the least significant bit and bit 7 the most significant bit.

	RESET	SET
BIT 0	85	C5
BIT 1	8D	CD
BIT 2	95	D5
BIT 3	9D	DD
BIT 4	A5	E5
BIT 5	AD	ED
BIT 6	B5	F5
BIT 7	BD	FD

Here's the most optimized way, using standard subroutine calls, to either set or reset a bit of a pointed to byte, with bit 0 being the most significant bit. Input would be in the form of sub(SET/RES,bit,pointer).

Lbl SET
{} or sub(BIT)
Lbl SR2
→{r₂}
Return
Lbl RES
{} and (sub(BIT) xor ᴇFF)
Goto SR2
Lbl BIT
e^(7-r₁)
Return

Oh cool, thanks. So I'm guessing that the lack of an argument inside the {} is because it is taking HL as its argument, which is 'pointer' because when you store pointer to r2 it is stored to HL....like ans....kk i'm learning

Does every Axe operation leave stuff in HL?

Every loading or mathematical operation will put the result in hl. As I mentioned to someone a while ago in a different thread, the hl register is like the "Ans of Axe." All loading operations put the value into hl, and all mathematical operations put the operands into hl and de, calculate, and put the result back into hl. The nice thing about this method is that complex strings of operations can be handled easily. If parentheses or curly brackets are reached, the current value of hl can just be pushed onto the stack for later, and any operations in the parentheses or curly brackets can then be handled using hl. Every time the "depth" of the operation is increased, hl just needs to be pushed, and every time the "depth" decreases, hl can be popped right back.

Note: Just in case anyone reading this doesn't know what pushing and popping are, they are methods of saving and restoring data (respectively). Pushing loads a value onto the top of a stack of values, like a stack of physical objects. Popping takes the top value on the stack and retrieves that. Using this method, you can push multiple values onto the stack and retrieve them in the opposite order that you put them there, allowing things like parentheses to be handled very well. It's explained quite well here.

Wait!? DJ, you don't know ASM!?!? I've only been at it 2 weeks and I have almost completely remade Hexpipc (again, but this time it's only 500 bytes). Seriously though, I thought you (being the founder of this forum) would know ASM.

Wait!? DJ, you don't know ASM!?!? I've only been at it 2 weeks and I have almost completely remade Hexpipc (again, but this time it's only 500 bytes). Seriously though, I thought you (being the founder of this forum) would know ASM.

Let's see, the Admins experience in calc languages (from what I've noticed):
Builderboy: Basic - Excellent   Axe - Excellent   Asm - Beginner
DJ Omnimaga: Basic - Excellent   Axe - Medium   Asm - Beginner
Eeems: Basic - Medium   Axe - Medium   Asm - Medium
Hot_Dog: Basic - Medium   Axe - Beginner   Asm - Excellent
ztrumpet: Basic - Excellent   Axe - Excellent   Asm - Beginner

As you can see, not all of the admins know all the languages.