Maciej Halber mhalber

Please consider using http://lygia.xyz instead of copy/pasting this functions. It expand suport for voronoi, voronoise, fbm, noise, worley, noise, derivatives and much more, through simple file dependencies. Take a look to https://github.com/patriciogonzalezvivo/lygia/tree/main/generative

Generic 1,2,3 Noise

float rand(float n){return fract(sin(n) * 43758.5453123);}

float noise(float p){
	float fl = floor(p);
  float fc = fract(p);

What is the Strict Aliasing Rule and Why do we care?

(OR Type Punning, Undefined Behavior and Alignment, Oh My!)

What is strict aliasing? First we will describe what is aliasing and then we can learn what being strict about it means.

In C and C++ aliasing has to do with what expression types we are allowed to access stored values through. In both C and C++ the standard specifies which expression types are allowed to alias which types. The compiler and optimizer are allowed to assume we follow the aliasing rules strictly, hence the term strict aliasing rule. If we attempt to access a value using a type not allowed it is classified as undefined behavior(UB). Once we have undefined behavior all bets are off, the results of our program are no longer reliable.

Unfortunately with strict aliasing violations, we will often obtain the results we expect, leaving the possibility the a future version of a compiler with a new optimization will break code we th

	/* Read this comment first: https://gist.github.com/tonious/1377667#gistcomment-2277101
	* 2017-12-05
	*
	* -- T.
	*/

	#define _XOPEN_SOURCE 500 /* Enable certain library functions (strdup) on linux. See feature_test_macros(7) */

	#include <stdlib.h>
	#include <stdio.h>

	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD

	/**
	* This are a collection of examples for C 201.
	* These combine concepts you may or may not be
	* familiar with and are especially useful for
	* students new to C. There is a lot of really
	* cool stuff you can do in C without any cool
	* languages.
	*
	* This is file in particular is an introduction
	* to fun function usage in C.

	<?xml version="1.0" encoding="UTF-8"?>
	<opml version="1.0">
	<head>
	<title>Graphics, Games, Programming, and Physics Blogs</title>
	</head>
	<body>
	<outline text="Tech News" title="Tech News">
	<outline type="rss" text="Ars Technica" title="Ars Technica" xmlUrl="http://feeds.arstechnica.com/arstechnica/index/" htmlUrl="https://arstechnica.com"/>
	<outline type="rss" text="Polygon - Full" title="Polygon - Full" xmlUrl="http://www.polygon.com/rss/index.xml" htmlUrl="https://www.polygon.com/"/>
	<outline type="rss" text="Road to VR" title="Road to VR" xmlUrl="http://www.roadtovr.com/feed" htmlUrl="https://www.roadtovr.com"/>

	static void
	Quat_FromEulerXYZ(float *euler_quat, float x, float y, float z)
	{
	float sx = (float)sin((double)(x * 0.5f));
	float sy = (float)sin((double)(y * 0.5f));
	float sz = (float)sin((double)(z * 0.5f));
	float cx = (float)cos((double)(x * 0.5f));
	float cy = (float)cos((double)(y * 0.5f));
	float cz = (float)cos((double)(z * 0.5f));

	// @CasualEffects & @pervognsen
	var shift = ((border !== TRANSPARENT) && (border !== fill)) ? 0.5 : 0;

	// For each non-horizontal edge, store:
	//
	// [startX, startY, dx/dy slope, vertical height].
	//
	// These are the values needed for the edge-intersection test. Add edges so that the
	// start Y coordinate is less than the end one.
	var edgeArray = [];


	//
	// TinyCRT, revamp and TinyWin support by Don Williamson, 2011
	// Based on http://www.codeproject.com/KB/library/tlibc.aspx and LIBCTINY by Matt Pietrek
	//

	#pragma once


	#ifdef USE_DEFAULT_CRT