Explore >> Select a destination
|
You are here 
|
james.darpinian.com | ||
| | | | |
hbfs.wordpress.com
|
|
| | | | | Preparing lecture notes (or videos) sometimes brings you to revisit things you've known for a while, but haven't really taken time to formalize properly. One of those things is fixed-point arithmetic. Fixed-point arithmetic joins the advantage of representing fractional values while maintaining a great simplicity in the operations. Contrary to floating point, arithmetic on fixed-points... | |
| | | | |
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 | |
| | | | |
pavpanchekha.com
|
|
| | | | | ||
| | | | |
bryananthonio.com
|
|
| | | Sharing key insights on how computers work, from logic gates and binary arithmetic to assembly languages. | ||
