paniq

#include <stdio.h>
#include <stdint.h>
#include <assert.h>

typedef int16_t int16;
typedef int32_t int32;

int16 deg2i(int16 d) {
    return (int32)d*8192 / 45;

alexpw

(defn group-by-with
  "A group-by factory that accepts a combiner-fn to control how the values
  of the grouping fn are collected."
  [combiner-fn]
  (fn [f coll]
    (persistent!
     (reduce
      (fn [ret x]
        (let [k (f x)]
          (assoc! ret k (combiner-fn (get ret k) x))))

bnyeggen

(defmacro hinttype
  [type-name & hint-symbols]
  `(deftype ~type-name
     [~@(for [s hint-symbols] 
          (with-meta (gensym "a") 
            {:tag (case s 
                    :int 'int
                    :long 'long
                    :float 'float
                    :double 'double

ray1729

# cms - simple CMS
#
# The simple-cms server is a Compojure application serving content for cms.1729.org.uk

description     "CMS server"

start on filesystem or runlevel [2345]
stop on runlevel [!2345]

respawn

jackrusher

Functions, how do they work?

A good friend asked me how functions work under the covers, so I wrote up this quick explanation. Corners are cut for brevity, but I hope it will convey the general idea.

The three assembly language programs below implement the following (super simple) recursive function:

tetsu-koba

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

int mix(char *inbuf1, char *inbuf2, char *outbuf, int len, float vol1, float vol2)
{
	int16_t *inp1, *inp2;
	int16_t *outp;
	int cnt = len / sizeof(int16_t);
	

darach

Instructions

The following instructions assume a debian jessie based distribution

0. Prerequisites

Install dependent tools and libraries

$ sudo apt-get update

jackrusher

(defn grow [pos rot points len]
  (let [[x y z] (last rot) ;; :( no M33 and no (g/rotate-xyz _ (vec3 x y z))
        corners (map #(-> % (g/rotate-x x) (g/rotate-y y) (g/rotate-z z) (g/+ (last pos)))
                     [(vec3  0  0 0) (vec3 -1  0 0) (vec3  0 -1 0) (vec3  0  1 0)
                      (vec3 -1  0 len) (vec3  0 -1 len) (vec3  0  1 len) (vec3  0  0 len)])]
    [(conj (pop pos) (last corners))
     rot
     (conj points (map gu/tessellate-3 (g/faces (apply cub/cuboid corners))))]))

(defn build-lsystem [l-system angle len]

H2CO3

//
// SpnMap: Sparkling's hash table, in C++
// Created by Arpad Goretity on 13/01/2015
//

#include <vector>
#include <utility>
#include <cstdint>
#include <climits>
#include <cassert>

pachacamac

require 'matrix'

class Matrix
  def []=(i, j, x); @rows[i][j] = x; end
  def size; [self.row_size, self.column_size]; end
end

class Vector
  def []=(i, x); @elements[i] = x; end
  def length; @elements.length; end