A bunch of C++ code used in various Glare Technologies Limited products - Indigo Renderer, Chaotica, Substrata and other projects.
Most of this code was written by Nicholas Chapman (Ono-Sendai). Some was also written by Thomas Ludwig (lycium) and Yves Collé (fused).
There's also a bunch of third-party libraries copied into this repo for building convenience.
Our code:
Various computer graphics utility classes, image/texture loading etc.
Various maths utility classes. SSE vector maths, matrix maths etc.
TCP and UDP socket classes, TLS sockets, an HTTP client, a WebSocket class etc.
Wrappers for OpenCL, the best GPU compute API.
A reasonably lightweight but prettty fast OpenGL physically based rendering engine. This is the OpenGL preview for Indigo Renderer, and the rendering engine for Substrata.
Some ray-mesh acceleration structures etc.
Some ray tracing geometry classes etc.
Code for writing out high-definition video files on Windows and Mac, using OS APIs.
Code for running a HTTP server, using the networking classes in networking. Supports HTTP 1.1 and TLS.
Lots of different utility classes. Some highlights:
Best-fit memory allocator. Useful for packing stuff into larger buffers, like vertex buffers.
Circular (ring) buffer. Useful for queues while avoiding memory allocations.
In-memory databased backed by disk. Pretty sweet. No doubt faster than your database.
Fast hash table/map. Much faster than std::unordered_map.
Fast hash table/set. Much faster than std::unordered_set.
Something like a std::unordered_map, but also each inserted item can be 'used' or 'unused'. Unused items are stored in a list that is sorted by the order in which they became unused, so it can be used as a LRU cache. The least recently used item can be removed from the cache with removeLRUUnusedItem().
Provides read-only access to a file through memory mapping. The fastest way (AFAIK) of reading files.
Parsing class. I use it everywhere. Don't use regular expressons, parse stuff properly :)
Some really fast parallel radix sorting code.
Lots of really useful stuff in here. Used almost everywhere in my code.
Nice and simple tasking system for multithreaded code.
The backbone of a lot of multithreaded code.
Uses something like Kahn's algorithm, see See https://en.wikipedia.org/wiki/Topological_sorting Instead of operating on a graph however, we will use maps to sets.
Custom version of std::vector with slightly different (faster) semantics and some extra methods.