nicebyte

#pragma once

#define DYN_ARR_OF(type) struct  { \
  type *data; \
  type *endptr; \
  uint32_t capacity; \
}

#if !defined(__cplusplus)
#define decltype(x) void*

vurtun

Gilbert–Johnson–Keerthi (GJK) 3D distance algorithm

The Gilbert–Johnson–Keerthi (GJK) distance algorithm is a method of determining the minimum distance between two convex sets. The algorithm's stability, speed which operates in near-constant time, and small storage footprint make it popular for realtime collision detection.

Unlike many other distance algorithms, it has no requirments on geometry data to be stored in any specific format, but instead relies solely on a support function to iteratively generate closer simplices to the correct answer using the Minkowski sum (CSO) of two convex shapes.

eashish93

vs Questions

---

1. http://stackoverflow.com/questions/804115 (rebase vs merge).
2. https://www.atlassian.com/git/tutorials/merging-vs-rebasing (rebase vs merge)
3. https://www.atlassian.com/git/tutorials/undoing-changes/ (reset vs checkout vs revert)
4. http://stackoverflow.com/questions/2221658 (HEAD^ vs HEAD~) (See git rev-parse)
5. http://stackoverflow.com/questions/292357 (pull vs fetch)
6. http://stackoverflow.com/questions/39651 (stash vs branch)
7. http://stackoverflow.com/questions/8358035 (reset vs checkout vs revert)

vurtun

/* ===========================================================================
 *
 *                                  LIBRARY
 *
 * =========================================================================== */
/*  Proof of Concept GUI:
 *  - PoC UI implementation in ~2.5kLOC of C89 (ANSI C)
 *      => Core solutions has no external dependencies (removing standard library dependency is trival)
 *      => Does not use or require any special language constructs or macro constructs just pointers and enums
 *  - Combines both "retained" and "immediate mode" UI by providing control over update frequency

djg

Papers I like Pt. 1 Papers I like Pt. 2

Let's start meta:

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

jkoenen

section 'interface' do
	export do
		case get_target_platform
		when :win32
			import 'platform/win32/mssdk'
			add_cpp_define 'CURL_STATICLIB'
			add_cpp_define 'CURL_DISABLE_LDAP'
		else
			raise 'Unupported platform!'
		end

hackcasual

var tab_mem_hand8 = {
    set: function(obj, prop, value) {
        if (prop > (22 << 3) && prop <= (23 << 3)) {
            debugger;
        }
        obj[prop] = value;
    }
};

var tab_mem_hand16 = {

dwilliamson

extern "C" char* dtoa_simple(double value, char* dest, int size)
{
	// NOTE: Very bare bones and inaccurate for very big numbers due to floating point inaccuracies dividing by 10
	// Requires BigInt support to handle correctly!

	char* destret = dest;
	char* destend = dest + size;

	// Negate and add prefix for negative numbers
	if (value < 0)

FelixK15

@echo off
echo Searching for Visual Studio installation...
setlocal enableextensions enabledelayedexpansion

set FOUND_PATH=0
set VS_PATH=
::check whether this is 64bit windows or not
reg Query "HKLM\Hardware\Description\System\CentralProcessor\0" | find /i "x86" > NUL && set OS=32BIT || set OS=64BIT

IF %OS%==64BIT set REG_FOLDER=HKLM\SOFTWARE\WOW6432Node\Microsoft\VisualStudio\SxS\VS7

vurtun

#include <stdio.h>
#include <errno.h>
#include <stdlib.h>
#include <stdint.h>
#include <assert.h>
#include <string.h>
#define streq(a, b) (!strcmp((a), (b)))

#ifndef __USE_GNU
#define __USE_GNU