Is there twos complement boolean representation for signed integers?

printfn / fend

Arbitrary-precision unit-aware calculator

https://printfn.github.io/fend

MIT License

668 stars 52 forks source link

Is there twos complement boolean representation for signed integers? #218

Open krishnakumarg1984 opened 1 year ago

krishnakumarg1984 commented 1 year ago

Consider the binary value 1011 0100. Its decimal conversion would be:

180 if it is an unsigned binary number
-76 if this is a signed binary number using standard two’s complement arithmetic.

Is there a way to instruct fend about this?

printfn commented 1 year ago

This is not currently supported, mostly because fend does not have a notion of fixed-width binary numbers. This is also why bitwise negation is not implemented. It’d definitely be nice for this to eventually be supported though.

krishnakumarg1984 commented 1 year ago

No problems. If this is on your backlog and you might get to it some day in the future, I am happy to leave this issue open.