Benjamin Saunders
Benjamin Saunders
Interpolating random points on a regular grid using e.g. a quintic polynomial, as documented in e.g. https://iquilezles.org/articles/morenoise/. Could perhaps also use a simplex grid with some sort of barycentric interpolation...
e.g. Perlin noise is gradient noise on a square grid. Might be faster than a simplex grid for low dimensions?
Could be implemented directly by adapting 2D noise using e.g. [Cube-to-sphere projections for procedural texturing and beyond](https://www.jcgt.org/published/0007/02/01/)
A common operation for a cache is to search for an element and insert it if it's missing before returning a reference to the element. This shouldn't require hashing the...
The current implementation boxes every key/value pair to obtain a stable address with which to construct an intrusive linked list. While investigating new designs following #70, I realized that this...
When running on windows with LLVM 3.2 built under 32-bit mingw, all examples fail with the message `Segmentation fault/access violation in generated code`
This occurs because the Haskell Platform links using the gcc (and MinGW) it ships with, causing the Haskell Platform libstdc++ to be linked, which is unlikely to be binary-compatible with...
Draft until I've tested this end-to-end, but believed to be complete. I considered making the version a field in the `Protocol::Quic` enum variant, but that was substantially more disruptive. See...
## Feature Request ### Motivation Foreign libraries often (e.g. Vulkan, OpenGL, libpng) expose callbacks to report diagnostics. Piping these into `tracing` events provides pleasant user experience, but when severity is...
Modern high-performance I/O APIs (e.g. io_uring and I/O completion ports) are completion-oriented, unlike the traditional readiness-oriented `epoll` paradigm. Advantages include fewer syscalls and no copying. On Windows in particular, readiness-oriented...