I'm a little curious if doing an equality comparison with self is the best way to determine something is NaN? I'm assuming that is as fast as any specific isNa

I'm a little curious if doing an equality comparison with self is the best way to determine something is NaN? I'm assuming that is as fast as any specific isNaN function available? I'm also assuming a nice thing about the bitmap approach is that it works for non float values? I recall hearing that Pascal had some good primitives for managing parallel arrays that were used like this. I can't remember the details, that well. Definitely feels related to the array of structures versus structure of arrays idea.