|
You are here |
marcospereira.me | ||
| | | | |
orlp.net
|
|
| | | | | [AI summary] A deep dive into the complexities and pitfalls of comparing different numeric types (integers and floating-point) across various programming languages and the CPU architecture | |
| | | | |
blog.reverberate.org
|
|
| | | | | Author's note: this article used to be called "What Every ComputerProgrammer Should Know About Floating Point, part 1". Some peoplenoted that this was perh... | |
| | | | |
arnorhs.dev
|
|
| | | | | I read somewhere that a bitwise left shift was a faster method of removing a fraction of a floating point number in Javascript than using parseInt or Math.floor(). I wasn't surprised that parseInt was slow, since I think it parses the number as a string, but the left shift being faster than Math.floor() was a bit more puzzling to me. So I decided to make a JSPerf test to compare those three methods. Read on for the full results | |
| | | | |
imapenguin.com
|
|
| | | I was recently on a video call with a friend, throwing around some ideas for a new product. I mentioned adding large signed numbers in assembly and using two's complement. He asked me what two's complement was. I was a little surprised that he didn't know. He's been a Java programmer for more than 30 years. Java and Python programmers (and others like gasp Commodore / MicroSoft BASIC) don't have a native unsigned integer type. The language takes care of the details for you. | ||