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 | |
| | | | |
projectf.io
|
|
| | | | | Integer multiply and divide instructions form the optional M extension. Making multiplication and division optional keeps the base instruction set simple and reduces the size of the smallest RISC-V core. This post includes a brief overview of common RISC-V extensions. | |
| | | | |
pavpanchekha.com
|
|
| | | | | ||
| | | | |
albocoder.github.io
|
|
| | | [AI summary] This blog post details the process of using static analysis with LLVM bitcode to identify the slab cache for kernel objects in the Linux kernel. | ||
