|
You are here |
damienradtke.com | ||
| | | | |
antonz.org
|
|
| | | | | Weak pointers, faster maps, directory-scoped access, and more. | |
| | | | |
hjr265.me
|
|
| | | | | Concurrency is one of the central features of Go. And, to build concurrent programs in Go, you need goroutines. A goroutine is like a thread, but lighter. Much lighter. And, like any other built-in feature of Go, using it is dead simple: 1 2 3 4 5 6 7 package main func main() { go func() { println("Hello World") // Print "Hello World" from a different goroutine. }() } Wait. That didn't print anything. | |
| | | | |
pboyd.io
|
|
| | | | | The flower bed in the front of my house. Yes, it's overgrown. I'm sure an upstanding citizen concerned with suburban respectability, such as yourself, will agree with my wife that I "should really do something about that." I had plenty of time this week, so naturally, I used that time to ignore the flower bed and write a mosaic generator. That way, I can give you this lovely mosaic of my not-so-lovely flower bed: | |
| | | | |
bitshifter.github.io
|
|
| | | [AI summary] The text discusses the development and performance of the Rust linear algebra library 'glam', which leverages SIMD for optimized computations. It compares 'glam' with other libraries like 'cgmath' and 'nalgebra', highlighting its efficiency, especially when using SIMD. The text also covers benchmarking tools like 'mathbench' and 'criterion', and the use of assembly inspection for performance analysis. The author plans to enhance 'glam' over time based on community feedback and explores future optimizations using crates like 'packed_simd'. | ||