Explore >> Select a destination
|
You are here 
|
mcyoung.xyz | ||
| | | | |
bitshifter.github.io
|
|
| | | | | ||
| | | | |
mazzo.li
|
|
| | | | | `atan2f` is an important but slow trigonometric function. In this article we'll explain how to approximate it, and implement a version 50x faster than `glibc` on batches of inputs. | |
| | | | |
www.bazhenov.me
|
|
| | | | | Introduction Link to heading Suppose we need to write a function that computes the next set of numbers in a range and stores them in a slice, as shown below: let pl = RangePl::new(1..12); let mut buffer = [0u64; 4]; pl.next_batch(0, &mut buffer); // returns 4, buffer[..] = [1, 2, 3, 4] pl.next_batch(0, &mut buffer); // returns 4, buffer[..] = [5, 6, 7, 8] pl.next_batch(10, &mut buffer); // returns 2, buffer[0..2] = [10, 11] pl.next_batch(10, &mut buffer); // returns 0, buffer not updated Key factors: | |
| | | | |
blog.jak-linux.org
|
|
| | | (What follows is an excerpt from my master's thesis, almost all of section 2.1, quickly introducing Go to people familiar with CS) Go is an imperative programming language for concurrent programming created at and mainly developed by Google, initially mostly by Robert Griesemer, Rob Pike, and Ken Thompson. Design of the language started in 2007, and an initial version was released in 2009; with the first stable version, 1.0 released in 2012 1. | ||
