anselm

// Note that I wrote this in java in Processing - paste this GIST into processing to see it in action.
// It is not the most elegant thing ever but it does deal with end caps and ribbon loops and the like.
// If you port this over to say objective-c / opengl / c etc - you may need to deal with polygon direction
// here is a snapshot of it running : http://www.flickr.com/photos/anselmhook/6507471719/in/photostream

int nvertices = 0;
float[] vertexpool = new float[3000];
float x1,x2,y1,y2;

void intersect(int kind, float x0, float y0, float x1,float y1,float x2,float y2,float x3,float y3,float x4,float y4) {

rygorous

// float->half variants.
// by Fabian "ryg" Giesen.
//
// I hereby place this code in the public domain, as per the terms of the
// CC0 license:
//
//   https://creativecommons.org/publicdomain/zero/1.0/
//
// float_to_half_full: This is basically the ISPC stdlib code, except
// I preserve the sign of NaNs (any good reason not to?)

sebfisch

Delimited Continuations

Delimited continuations manipulate the control flow of programs. Similar to control structures like conditionals or loops they allow to deviate from a sequential flow of control.

We use exception handling as another example for control flow manipulation and later show how to implement it using delimited continuations. Finally, we show that nondeterminism can also be expressed using delimited continuations.

Exception Handling

jboner

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

zziuni

# source : http://code.google.com/p/natvpn/source/browse/trunk/stun_server_list
# A list of available STUN server.

stun.l.google.com:19302
stun1.l.google.com:19302
stun2.l.google.com:19302
stun3.l.google.com:19302
stun4.l.google.com:19302
stun01.sipphone.com
stun.ekiga.net

JakobOvrum

import std.traits;
import std.range;

E[] removeSpan(E)(E[] arr, size_t from, size_t to) @trusted
	if (isMutable!E && !hasElaborateAssign!E)
{
	import core.exception : RangeError;
	import core.stdc.string : memmove;
	import std.exception : enforceEx;

tsiege

ANNOUNCEMENT

I have moved this over to the Tech Interview Cheat Sheet Repo and has been expanded and even has code challenges you can run and practice against!






\

jcdickinson

/*-----------------------------------------------------------.   
/                     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);

Xananax

DeusInMachina (working title)

Template system to create behaviours attached to game objects.

Properties

properties are numbers such as:

• health
• resistance (and affiliates, resistance to poison, resistance to cold...)
• skills (ranged weapons, lockpicking)

digitalshadow

/* OpenSimplex Noise in C#
 * Ported from https://gist.github.com/KdotJPG/b1270127455a94ac5d19
 * and heavily refactored to improve performance. */

using System;
using System.Collections.Generic;
using System.Linq;
using System.Runtime.CompilerServices;

namespace NoiseTest