For example:
for i in range(0, 10):
print(i/0.0)
But:
for i in range(-10, 10):
print(i/0.0)
And:
for i in range(-10, 10):
print(i/i)
https://www.gnu.org/software/libc/manual/html_node/Infinity-...
Are there any common string operations with similar behavior?
Unicode’s � is basically a symbol for not-a-char.
Itanium had a bit for "not a thing" for integers (and perhaps some older hardware from around the time floats started being a thing had similar things), so the idea of hardware support for not-a-* isn't exclusive to floats, but evidently this hasn't caught on; generally it's messy because it needs a bit pattern to yoink, but many types already use all possible ones (whereas floats already needed to chop out some for infinities).
arr = new Float64Array([0]);
arr[0] = new Float64Array(new BigUint64Array([-123n]).buffer)[0];
[...new Uint8Array(arr.buffer)] // [133, 255, 255, 255, 255, 255, 255, 255] f = new Float64Array(1)
dv = new DataView(f.buffer)
dv.setBigInt64(0, -123n)
console.log([...new Uint8Array(f.buffer)])
f = new Float64Array(1)
new BigUint64Array(f.buffer)[0] = -123n
console.log([...new Uint8Array(f.buffer)])
f = new Float64Array(1)
f[0] = new Float64Array(new BigUint64Array([-123n]).buffer)[0]
console.log([...new Uint8Array(f.buffer)])
f = new Float64Array([NaN])
console.log([...new Uint8Array(f.buffer)])
[255, 255, 255, 255, 255, 255, 255, 133]
[133, 255, 255, 255, 255, 255, 255, 255]
[133, 255, 255, 255, 255, 255, 255, 255]
[0, 0, 0, 0, 0, 0, 248, 127]
[ 255, 255, 255, 255, 255, 255, 255, 133 ]
[ 133, 255, 255, 255, 255, 255, 255, 255 ]
[ 0, 0, 0, 0, 0, 0, 248, 127 ]
[ 0, 0, 0, 0, 0, 0, 248, 127 ]
Taking, say, the 3 smallest subnormal numbers, or the three largest numbers, or whatever, would be extremely bad for allowing optimizations/algorithms/correctness checkers to reason about operations in the abstract.
The API for `getpayload`/`setpayload`/`setpayloadsig` looks a little funny but it's easy enough to wrap (just consider the edge cases; in particular remember that whether 0 is valid for quiet or signaling NaNs is platform-dependent).
Finally we have a reliable `roundeven`, and the convenience of directly calling `nextup`/`nextdown` (but note that you'll still only visit one of the zeros).
The new `fmaximum` family is confusing, but I think I have it clear:
without 'imum' (legacy): prefer non-NaN
with 'imum': zeros distinguished (-0 < +0)
with '_num': prefer a non-NaN, also signal if applicable
with '_mag': compare as if fabs first
`rootn` and `compoundn` are surprisingly tricky to implement yourself. I still have one testcase I'm not sure why I have to hand-patch, and I'm not sure which implementation choice keeps the best precision (to say nothing of correct rounding mode).
Out of curiosity, isn't this what you'd pretty much universally want? Or maybe I misunderstand the intent here?
That said, quite often you need to handle signed zero specially already, and if you don't the property you're testing might sufficiently differ in the interesting way for the smallest-magnitude subnormals.
In the "before" use-cases, the programmer has accidentally written a bug and gets back a single NaN from a logical operation they performed as a result.
In the "after" cases, the programmer already has some data and explicitly decides to convert it to a NaN encoding. But instead of actually getting back a NaN that is secretly carrying their data, they actually get a whole array of NaN's, which duck type differently, and thus are likely to disappear into another NaN or an undefined if they are propagated through an API.
Like.. I get that the whole thing is supposed to be humorously absurd but... It just doesn't land unless there's something technical I'm missing to connect up the pieces.
axblount•9mo ago
https://piotrduperas.com/posts/nan-boxing
addoo•9mo ago
The original post seems really weird to me. I would have dismissed it as someone's hobby project, but... that doesn't seem like what it's trying to be.
wging•9mo ago
Tuna-Fish•9mo ago
NaNboxing lets you use less memory on certain use cases. Because memory access is slow and caches are fixed size, this is usually a performance win, even if you have to do a few extra ops on every access.
thehappypm•9mo ago
jasonthorsness•9mo ago
purplesyringa•9mo ago
userbinator•9mo ago
pwdisswordfishz•9mo ago
tetris11•9mo ago
If I encode data into the exponent of these NaN values, propagate them around the internet, and decode them elsewhere.... is that a security risk? Or this just falls into the category of "weird encryption"
rcxdude•9mo ago
ufo•9mo ago
yencabulator•9mo ago