Skip to content

Instantly share code, notes, and snippets.

Avatar

Morgan numinit

View GitHub Profile
View xkcd_unique_random.user.js
// ==UserScript==
// @name XKCDUniqueRandom
// @namespace http://numin.it/
// @version 0.1
// @license MIT
// @description uniquely samples XKCDs when you press Random
// @author numinit
// @match http://xkcd.com/*
// @match https://xkcd.com/*
// @grant none
View xm.md

Ingress XM Changes (03/12)

Level New Old
1 3000 3000
2 4000 4000
3 5000 5000
4 6000 6000
5 7000 7000
6 8000 8000
View keybase.md

Keybase proof

I hereby claim:

  • I am numinit on github.
  • I am numinit (https://keybase.io/numinit) on keybase.
  • I have a public key whose fingerprint is 190B DA97 F616 DE35 6899 ED17 F819 F1AF 2FC1 C1FF

To claim this, I am signing this object:

View jpeg.c
/* gcc -Os -o jpeg jpeg.c
* ./jpeg in_file.jpg
*/
#include <stdio.h>
#include <stdint.h>
#include <string.h>
typedef struct chunk {
uint16_t marker;
View architeuthis.md

Project Architeuthis ARG

In AD 2014, ARG was beginning.

WARNING: Contains spoilers for the final solution. Click here to jump to it.

April 28

In AD 2014, ARG was beginning.

View levels.md

Ingress: Upcoming AP changes

Ingress has 36 levels, called "client levels." Gameplay levels (1 to 8) can be given by the expression floor(clientLevel/5) + 1.

Some new changes are coming up that will probably help newer players. Here they are.

Level AP Threshold (new) AP Threshold (old) Delta
1 0 0 0
1 500 2000 -1500
View lc3.c
#include "lc3.h"
static lc3 *global_ctx = NULL;
static struct termios oldt, newt;
void lc3_printf(const char *format, ...) {
va_list args;
const char *ptr;
FILE *stream;
View ichat.rb
puts "*** Loading Objective-C dependencies, this will take a moment"
require 'rubygems'
require 'htmlentities'
require 'json'
framework 'Foundation'
framework 'AppKit'
class Person
View ruby_loader.c
#if defined(MACOS)
#define HAVE_STRUCT_TIMESPEC 1
#include <mach-o/dyld.h>
#include <libgen.h>
#elif defined(LINUX)
#elif defined(WINDOWS)
#endif
#include <stdio.h>
#include <locale.h>
View anagram.rb
a = ->(s, t) {s.length == t.length && (u = ->(v){v.bytes.reduce(1){|w, x| w * [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103][(x & 0x1f) - 1]}}).call(s) == u.call(t)}