| SOURCES = $(wildcard *.cxx) | |
| HEADERS = $(wildcard *.hxx) | |
| OBJECTS = $(SOURCES:%.cxx=%.o) | |
| PROGRAM = $(shell basename `pwd`) | |
| CC := $(shell which clang || which gcc) | |
| CFLAGS = -Wall -W -O -fno-exceptions -fno-rtti | |
| LIBS = stdc++ m | |
| LDFLAGS = $(LIBS:%=-l%) |
| Unicode table - List of most common Unicode characters * | |
| * This summary list contains about 2000 characters for most common ocidental/latin languages and most printable symbols but not chinese, japanese, arab, archaic and some unprintable. | |
| Contains character codes in HEX (hexadecimal), decimal number, name/description and corresponding printable symbol. | |
| What is Unicode? | |
| Unicode is a standard created to define letters of all languages and characters such as punctuation and technical symbols. Today, UNICODE (UTF-8) is the most used character set encoding (used by almost 70% of websites, in 2013). The second most used character set is ISO-8859-1 (about 20% of websites), but this old encoding format is being replaced by Unicode. | |
| How to identify the Unicode number for a character? | |
| Type or paste a character: |
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
float rand(float n){return fract(sin(n) * 43758.5453123);}
float noise(float p){
float fl = floor(p);
float fc = fract(p);
| /*-----------------------------------------------------------. | |
| / ColorBlind correction / | |
| '-----------------------------------------------------------*/ | |
| // Daltonize (source http://www.daltonize.org/search/label/Daltonize) | |
| // Modified to simulate color blindness. | |
| float4 Daltonize( float4 input, float2 tex ) | |
| { | |
| // RGB to LMS matrix conversion | |
| float3 L = (17.8824f * input.r) + (43.5161f * input.g) + (4.11935f * input.b); | |
| float3 M = (3.45565f * input.r) + (27.1554f * input.g) + (3.86714f * input.b); |
| /** | |
| * K.jpg's OpenSimplex 2, smooth variant ("SuperSimplex") | |
| * | |
| * More language ports, as well as legacy 2014 OpenSimplex, can be found here: | |
| * https://github.com/KdotJPG/OpenSimplex2 | |
| */ | |
| public class OpenSimplex2S { | |
| private static final long PRIME_X = 0x5205402B9270C86FL; |
| CFLAGS = -std=c99 -Wall | |
| main : main.o | |
| .PHONY : test clean | |
| test : main | |
| ./$^ "*regex*" "*vtable*" < main.c | |
| clean : |
| /* | |
| olc.cpp: The implementation for the google open location code | |
| Copyright (C) Steven Braeger 2014 | |
| Permission is hereby granted, free of charge, to any person obtaining | |
| a copy of this software and associated documentation files (the | |
| "Software"), to deal in the Software without restriction, including | |
| without limitation the rights to use, copy, modify, merge, publish, | |
| distribute, sublicense, and/or sell copies of the Software, and to |
| // List comprehension in C++11 in form of SQL-like syntax | |
| // Example code from http://vitiy.info/cpp11-writing-list-comprehension-in-form-of-sql/ | |
| // Written by Victor Laskin ([email protected]) | |
| #include <iostream> | |
| #include <functional> | |
| #include <vector> | |
| #include <future> | |
| #include <algorithm> | |
| using namespace std; |
| /* | |
| Delta Compression by Glenn Fiedler. | |
| This source code is placed in the public domain. | |
| http://gafferongames.com/2015/03/14/the-networked-physics-data-compression-challenge/ | |
| */ | |
| #include <stdint.h> | |
| #include <stdio.h> | |
| #include <assert.h> | |
| #include <string.h> |
| /* | |
| * Random-Number Utilities (randutil) | |
| * Addresses common issues with C++11 random number generation. | |
| * Makes good seeding easier, and makes using RNGs easy while retaining | |
| * all the power. | |
| * | |
| * The MIT License (MIT) | |
| * | |
| * Copyright (c) 2015-2022 Melissa E. O'Neill | |
| * |
