Max Countryman maxcountryman

## loop-vars.clj
(defmacro loop-vars
  "Like loop, but will automatically populate recur points where the special
  var recur-> is found.

  Mostly useful in mutable contexts, where some external factor causes the
  recur bindings to change.
  "
  [bindings & body]
  {:pre [(and (vector? bindings)
              (even? (count bindings)))]}

## merge-sort.clj
(defn half
  [s]
  (bit-shift-right (count s) 1))  ;; faster division by 2

(defn left-right
  [v]
  (let [v (if-not (vector? v) (vec v) v)
        h (half v)]
    [(subvec v 0 h) (subvec v h)]))

## base-62.clj
(def ^{:const true :private true}
  base-62-alphabet
  "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz")

(defn encode
  "Encodes v in a new base of ks."
  [ks v]
  (let [base (count ks)]
    (apply str
           (reduce

## README.md

      
              2 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                maxcountryman
                / README.md
            
            
              Last active
              August 29, 2015 14:27
            
          
    Flask-Login Demo

Setup

$ pip install flask
$ pip install flask-login
Run


## www.voxinfinitus.net.vcl
backend primary {
    .host = "127.0.0.1";
    .port = "8080";
}

acl purge {
    "127.0.0.1";
}

sub vcl_recv {

## queue.py
#!/usr/bin/env python2

import sys
import pickle

class QueueError(Exception):
    pass

class Queue:
    def __init__(self, *args):

## Japanese style
⨀_⨀
⨂_⨂
(/◔ ◡ ◔)/
°ﺑ°
(¬_¬)
(´・ω・｀)
(ʘ_ʘ)
(ʘ‿ʘ)
(๏̯͡๏ )
(◕_◕)

## brainfuck_converter.py
def string_process(s):

    cs = map(ord, '{0}'.format(s))

    clist = ''.join(['>' + c for c in
        ['+' * n for n in
            [(i-i%10)/10 for i in cs]]])

    cell_zero = ''.join(['<' * n for n in [len(cs)]]) + '-'


## tabula.py
import string, random

print '    '+' '.join(string.ascii_uppercase) + '\n'+'  +'+''.join(['-' for x in range(52)])+'\n'+''.join([chr(x)+' | '+' '.join([chr(random.randrange(33,127)) for x in range(26)])+'\n' for x in xrange(65,91)])

## weasel.py
import random, string, time

TEST = False

def timeit(func, *args):
    '''Simple timeit wrapper for functions.'''

    start = time.time()
    func(*args)
    elapsed = time.time() - start
	(defmacro loop-vars
	"Like loop, but will automatically populate recur points where the special
	var recur-> is found.

	Mostly useful in mutable contexts, where some external factor causes the
	recur bindings to change.
	"
	[bindings & body]
	{:pre [(and (vector? bindings)
	(even? (count bindings)))]}
	(defn half
	[s]
	(bit-shift-right (count s) 1)) ;; faster division by 2

	(defn left-right
	[v]
	(let [v (if-not (vector? v) (vec v) v)
	h (half v)]
	[(subvec v 0 h) (subvec v h)]))
	(def ^{:const true :private true}
	base-62-alphabet
	"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz")

	(defn encode
	"Encodes v in a new base of ks."
	[ks v]
	(let [base (count ks)]
	(apply str
	(reduce
	backend primary {
	.host = "127.0.0.1";
	.port = "8080";
	}

	acl purge {
	"127.0.0.1";
	}

	sub vcl_recv {
	#!/usr/bin/env python2

	import sys
	import pickle

	class QueueError(Exception):
	pass

	class Queue:
	def __init__(self, *args):
	⨀_⨀
	⨂_⨂
	(/◔ ◡ ◔)/
	°ﺑ°
	(¬_¬)
	(´・ω・｀)
	(ʘ_ʘ)
	(ʘ‿ʘ)
	(๏̯͡๏ )
	(◕_◕)
	def string_process(s):

	cs = map(ord, '{0}'.format(s))

	clist = ''.join(['>' + c for c in
	['+' * n for n in
	[(i-i%10)/10 for i in cs]]])

	cell_zero = ''.join(['<' * n for n in [len(cs)]]) + '-'
	import string, random

	print ' '+' '.join(string.ascii_uppercase) + '\n'+' +'+''.join(['-' for x in range(52)])+'\n'+''.join([chr(x)+' \| '+' '.join([chr(random.randrange(33,127)) for x in range(26)])+'\n' for x in xrange(65,91)])
	import random, string, time

	TEST = False

	def timeit(func, *args):
	'''Simple timeit wrapper for functions.'''

	start = time.time()
	func(*args)
	elapsed = time.time() - start