Peter Jakobs pjako

Let's start meta:

Lamport - State the Problem Before Describing the Solution (1978). … 1-page memo. Read it.
Herlihy - Wait-free synchronization (1991) … Truly seminal. Lucid + enough good ideas for 4 papers easily.
Cook - How complex systems fail (1998) … 4 pages that anyone working on/with complex systems should read.

Effective Modern CMake

Getting Started

For a brief user-level introduction to CMake, watch C++ Weekly, Episode 78, Intro to CMake by Jason Turner. LLVM’s CMake Primer provides a good high-level introduction to the CMake syntax. Go read it now.

After that, watch Mathieu Ropert’s CppCon 2017 talk Using Modern CMake Patterns to Enforce a Good Modular Design (slides). It provides a thorough explanation of what modern CMake is and why it is so much better than “old school” CMake. The modular design ideas in this talk are based on the book [Large-Scale C++ Software Design](https://www.amazon.de/Large-Scale-Soft

	// The following code is licensed under the MIT license: https://gist.github.com/TheRealMJP/bc503b0b87b643d3505d41eab8b332ae

	// Samples a texture with Catmull-Rom filtering, using 9 texture fetches instead of 16.
	// See http://vec3.ca/bicubic-filtering-in-fewer-taps/ for more details
	float4 SampleTextureCatmullRom(in Texture2D<float4> tex, in SamplerState linearSampler, in float2 uv, in float2 texSize)
	{
	// We're going to sample a a 4x4 grid of texels surrounding the target UV coordinate. We'll do this by rounding
	// down the sample location to get the exact center of our "starting" texel. The starting texel will be at
	// location [1, 1] in the grid, where [0, 0] is the top left corner.
	float2 samplePos = uv * texSize;

	#pragma once
	#include <stdint.h>

	//fnv1a 32 and 64 bit hash functions
	// key is the data to hash, len is the size of the data (or how much of it to hash against)
	// code license: public domain or equivalent
	// post: https://notes.underscorediscovery.com/constexpr-fnv1a/

	inline const uint32_t hash_32_fnv1a(const void* key, const uint32_t len) {

	/* Lightweight module based templates in standard C
	===================================================
	This is a proof of concept example of lightweight module based templates in C and
	is loosely based on https://gist.github.com/pervognsen/c56d4ddce94fbef3c80e228b39efc028 from Per Vognsen.
	While his approach (at least as far as I understood) is based on a python script to generate
	the .h/.c files for you is this implementation contained in one single header file.

	This is an outline to show how you can use the single header approach
	and bend it to its absolute extrems. I tend to write specialized datastructures
	for most of my problems but sometimes it happens that I have to use a particular

	{
	"version": "0.1.0",
	"command": "cmd",
	"args": [
	"/c"
	],
	"showOutput": "always",
	"echoCommand": true,
	"tasks": [
	{

	//------------------------------------------------------------------------------
	// NetClient.cc
	//------------------------------------------------------------------------------
	#if ORYOL_WINDOWS
	#define _WINSOCK_DEPRECATED_NO_WARNINGS (1)
	#include <WinSock2.h>
	typedef int ssize_t;
	#endif

	#if ORYOL_POSIX

	/* ===============================================================
	* SDEFL
	* ===============================================================
	* public domain - no warranty implied; use at your own risk
	* References:
	https://bitbucket.org/rmitton/tigr/src/be3832bee7fb2f274fe5823e38f8ec7fa94e0ce9/src/tigr_inflate.c?at=default&fileviewer=file-view-default
	https://github.com/github/putty/blob/49fb598b0e78d09d6a2a42679ee0649df482090e/sshzlib.c
	https://www.ietf.org/rfc/rfc1951.txt
	*/
	#include <stdlib.h>