Skip to content

Instantly share code, notes, and snippets.

{ /n def
1 /i def
&{ { n i gteq } { i i 1 add /i def } while &} apply
} /genlist defun
10 genlist prettyprint
{ This is a comment. Below I implement a map that is equivalent to the hardcoded one. } drop
{ dup mul } /square defun
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//only unsigned longs for both symbols and pointers. pointers point to heap. there is a dictionary which contains pairs of symbols and pointers
//instead of tagging, a type heap in a one-to-one correspondence with the heap
//insertsort into the dict and labels later
//(numbers also added)
//compile with: gcc heap.c -o heap
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
//needs -lm flag to compile, i.e, gcc stack.c -o stack -lm
//hash for switch statement
unsigned long hash(char * s){
unsigned long acc = 0;
@Capaverde
Capaverde / voltapc.user.js
Created August 7, 2015 22:09
De Volta Ao Papo-Cabeça
// ==UserScript==
// @name De Volta Ao Papo-Cabeça
// @namespace http://forum.jogos.uol.com.br/
// @description De Volta Ao Papo-Cabeça
// @version 1
// @grant none
// @run-at document-start
// ==/UserScript==