Explore >> Select a destination
|
You are here 
|
james.darpinian.com | ||
| | | | |
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 | |
| | | | |
www.trevorlasn.com
|
|
| | | | | Understanding the new 16-bit floating point array in JavaScript | |
| | | | |
pavpanchekha.com
|
|
| | | | | [AI summary] The article discusses the limitations of arbitrary precision arithmetic in avoiding floating point rounding errors and advocates for expression rearrangement as a more effective solution. | |
| | | | |
gpfault.net
|
|
| | | [AI summary] The text provides an in-depth exploration of various x86-64 instruction set architectures, focusing on arithmetic operations (ADD, SUB, MUL, SMUL, DIV, SDIV), logical operations (AND, OR, XOR, NOT), and control flow instructions. It details the implementation of these instructions in the QBX virtual machine, emphasizing how they emulate real x86-64 instructions while managing the flags register and handling different operand sizes (8-bit and 16-bit). The text also discusses the nuances of flag handling, register operations, and macro-based code generation to streamline instruction implementation. | ||
