wrap my head around.

Haha, funny.

For unsigned 1-byte numbers, you can count up to 255, then it wraps back to 0 (i.e., 0 would be the same as 256). If it were signed, though, since the range is only from -128 to 127, it counts to 127, then wraps down to -128. Since it really makes no difference to the calculator anyway (signed and unsigned are just two ways for a human to read), this means that -128 is the same as 128, -127 is the same as 129, -126 is the same as -130, etc.

For 2-byte numbers, it's similar, but instead of wrapping signed numbers at 126, 127, -128, etc., it wraps at 32767 to -32768. Since unsigned numbers would just continue on until 65535 (which would be -1 in signed notation), -5 is the same as 65531.

Basically, if you want to find the signed representation of any 2-byte integer above 32767 (or 1-byte integer above 127), just subtract 65536 (or 256, respectively).

This is only some information regarding signed numbers. Don't really know how to implement it in Axe, but wouldn't you need an ^r for 2-byte numbers with ΔList(?

It depends on how big you want the range of numbers.  If you only need between -128 and 127 then you can just use deltalist(-1,-2,-3,...).  But when you read from the list, just make sure you use the int(data) command instead of {data} to keep the sign intact.

If on the other hand, you need the full range, then you need to store them all as 2 byte numbers using the "r".  Make sure if its 2 bytes per number, that you transverse the list 2 bytes at a time.

but you have to remember what is what, because they aren't all, say, 2-byte aligned.

Quote from: Maxwelldoggums on June 06, 2010, 10:09:12 am

:Δlist( -5 )?

would that be written

:Δlist( 32772 )?

Hi and welcome here!

The result would actually be 65530 if you used 2 bytes integers and 250 if you used 1 byte integers

Haven't really played around with Axe much yet, but after reading the documentation, I was under the impression that Axe used two's complement. Wouldn't it be 65531 and 251?