| Clojure 1.3.0 | |
| user=> {:foo :bar, :baz :qux} | |
| {:foo :bar, :baz :qux} |
| # -*- mode: Makefile; fill-column: 80; comment-column: 75; -*- | |
| ERL = $(shell which erl) | |
| ERLFLAGS= -pa $(CURDIR)/.eunit -pa $(CURDIR)/ebin -pa $(CURDIR)/*/ebin | |
| REBAR=$(shell which rebar) | |
| ifeq ($(REBAR),) | |
| $(error "Rebar not available on this system") |
| # Copyright 2012 Erlware, LLC. All Rights Reserved. | |
| # | |
| # This file is provided to you under the Apache License, | |
| # Version 2.0 (the "License"); you may not use this file | |
| # except in compliance with the License. You may obtain | |
| # a copy of the License at | |
| # | |
| # http://www.apache.org/licenses/LICENSE-2.0 | |
| # | |
| # Unless required by applicable law or agreed to in writing, |
| #!/bin/bash | |
| # | |
| # If run inside a git repository will return a valid semver based on | |
| # the semver formatted tags. For example if the current HEAD is tagged | |
| # at 0.0.1, then the version echoed will simply be 0.0.1. However, if | |
| # the tag is say, 3 patches behind, the tag will be in the form | |
| # `0.0.1+build.3.0ace960`. This is basically, the current tag a | |
| # monotonically increasing commit (the number of commits since the | |
| # tag, and then a git short ref to identify the commit. | |
| # |
i'm doing a bittorrent client in erlang
task: parse a lump of raw binary data from a socket into a list of bittorrent messages
my original implementation worked but was messy; the logic for parsing individual bittorrent messages was tangled with the logic for accumulating them into a list [should show this, ought to be somewhere in github.com/happy4crazy/ebc]
| # you can make a text file of request times (in ms, one number per line) and import it here, or you can use a probability distribution to simulate request times (see below where setting req_durations_in_ms) | |
| # rq = read.table("~/Downloads/request_times.txt", header=FALSE)$V1 | |
| # argument notes: | |
| # parallel_router_count is only relevant if router_mode is set to "intelligent" | |
| # choice_of_two, power_of_two, and unicorn_workers_per_dyno are only relevant if router_mode is set to "naive" | |
| # you can only select one of choice_of_two, power_of_two, and unicorn_workers_per_dyno | |
| run_simulation = function(router_mode = "naive", | |
| reqs_per_minute = 9000, |
| run_simulation = function(router_mode = "naive", | |
| reqs_per_minute = 9000, | |
| simulation_length_in_minutes = 5, | |
| dyno_count = 100, | |
| choice_of_two = FALSE, | |
| power_of_two = FALSE, | |
| unicorn_workers_per_dyno = 0, | |
| track_dyno_queues = FALSE) { | |
| if(!(router_mode %in% c("naive", "intelligent"))) { |
| type z | |
| type 'a s | |
| (* Sadly enough, without kind restrictions, this still allows nonsense types like *) | |
| type nonsense = int s | |
| (* GHC 7.6 supports this (lifting types to kinds & kind constraints) ;-) *) | |
| type (_, _) llist = | |
| | Nil : (z, 'a) llist | |
| | Cons : ('a * ('l, 'a) llist) -> ('l s, 'a) llist |
| #!/usr/bin/env python | |
| import math, os.path, re, json, hyperclient | |
| from os import urandom | |
| from base64 import b32encode | |
| from hashlib import md5 | |
| from pprint import pprint | |
| __all__ = 'HyperBayes' |
| -module(or_or_or). | |
| -compile(export_all). | |
| f1(X) -> | |
| if | |
| length(X) =:= 1; size(X) =:= 1 -> | |
| okay; | |
| true -> | |
| nope |
