Skip to content

Instantly share code, notes, and snippets.

View lifthrasiir's full-sized avatar

Kang Seonghoon lifthrasiir

357 followers · 2 following
View GitHub Profile
@lifthrasiir
lifthrasiir / wrap_exceptional.py
Created February 17, 2012 01:11
Exception handling wrapper for Flask + Exceptional
from werkzeug.debug.tbtools import Traceback
from phomp.api.errors import PhompException
def wrap_exceptional(f):
config = 'default_settings'
def wrap(f):
def wrapper(*args, **kwargs):
try:
return f(*args, **kwargs)
except Exception:
@lifthrasiir
lifthrasiir / redis-min.py
Created March 7, 2012 04:26
Minimalistic Redis client in Python (~50LoC)
import socket
class Redis(object):
def __init__(self, host, port):
self.conn = socket.socket()
self.conn.connect((host, port))
def _send_request(self, args):
self.conn.send('*%d\r\n' % len(args))
for arg in args:
@lifthrasiir
lifthrasiir / dcpu16.c
Created April 5, 2012 07:11
DCPU-16 emulator in C. Horribly inefficient.
/*
DCPU-16 emulator in C. Horribly inefficient.
Written by Kang Seonghoon (http://mearie.org/, @senokay). Public Domain.
*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
@lifthrasiir
lifthrasiir / compress.py
Created April 15, 2012 17:30
quick and dirty text compressor for DCPU-16
import heapq, sys
p = open(sys.argv[1],'rb').read()
p += '\0'
freq = {}
for i in p: freq[i] = freq.get(i,0) + 1
l = [(v, [('', k)]) for k, v in freq.items()]
heapq.heapify(l)
while len(l) > 1:
@lifthrasiir
lifthrasiir / DcpuAsmAdapter.ml
Created April 22, 2012 13:33
reynir/asm-parser adapter to DcpuAsm
module A = Ast
module W = Weedingast
module D = DcpuAsm
module DExpr = D.AsmExpr__
module DStmt = D.Asm__
let convert_reg {A.reg=reg} =
match reg with
| A.A -> D.A
| A.B -> D.B
@lifthrasiir
lifthrasiir / UserScript.html
Created July 22, 2012 13:47
UserScript: a forgotten programming language from the hell (2003)
<html>
<head>
<title>UserScript version 0.2.3</title>
<link rel="stylesheet" href="common.css" type="text/css" />
</head>
<body>
<h1>UserScript 레퍼런스 <small>UserScript Reference</small></h1>
@lifthrasiir
lifthrasiir / magicalmd5.py
Created August 20, 2012 08:37
마법의 MD5 스펙 생성기
# coding=utf-8
def score(s, encoding=None):
if encoding: s = s.encode(encoding)
import hashlib; a = hashlib.md5(s).digest()
return (int(round(10+ord(a[0])/255.*90)), # 공격
int(round(10+ord(a[5])/255.*90)), # 민첩
int(round(10+ord(a[1])/255.*90)), # 방어
int(round(10+ord(a[2])/255.*90)), # 명중
int(round(10+ord(a[3])/255.*90)), # 운
int(round(100+ord(a[4])/255.*200))) # 체력
@lifthrasiir
lifthrasiir / .gitignore
Last active October 11, 2015 14:38
히마와리: 초절정 뻘소리 제조 IRC 봇 (최신 버전은 https://github.com/lifthrasiir/himawari를 참고하세요)
*.pyc
db
run.sh
@lifthrasiir
lifthrasiir / number-hist.c
Created October 18, 2012 01:19
The making of IOCCC entry (2012/kang)
#if 0
gcc $0 && (
for i in \
zero \
one two three four five six seven eight nine ten \
eleven twelve thirteen fourteen fifteen sixteen seventeen eighteen nineteen \
twenty thirty forty fifty sixty seventy eighty ninety \
"one hundred" "one thousand" "one million" "one billion" "one trillion";
do echo $i | ./a.out; echo
done
@lifthrasiir
lifthrasiir / cheat.cpp
Created October 22, 2012 01:56
SK Planet Code Sprint 2012 Round 1 Submission
// Compile: CPPFLAGS='-W -Wall -O3' make shortest.cpp
//
// Okay, what the heck is this? This is a way to exploit the possible integer overflow
// in the submission system. It tries to generate the paths with their maximum length
// very slightly exceeding 2^32. The input graph has several heavy (read: of a great length)
// 2-cycles, so it is possible to construct compact path by repeating 2-cycles.
#include <cstdio>
#include <cstdlib>
#include <stdint.h>