| #!/usr/bin/env ruby | |
| if RUBY_VERSION < "1.9" | |
| class Symbol | |
| def to_proc | |
| proc { |obj, *args| obj.send self, *args } | |
| end | |
| end | |
| end |
| include $(GOROOT)/src/Make.inc | |
| TARG=aserver\ | |
| aclient | |
| SHARED=arith | |
| all: $(SHARED:%=%.$O) $(TARG) | |
| $(TARG): %: %.$O |
The programs below calculate the rsync weak sum (of block size 4096) of the last block of the data available on stdin.
The data is assumed to be at least block size big; the weak sum is calculated in a direct manner for the first block, and from that on, the sum is adjusted on each incoming byte using the "rollability" of this kind of checksum.
The primary goal was to see the performance of naive implementations; so my metrics was both performance and "how close is the code to
| curl -Ls http://gist.github.com/raw/1117010/quine.sh |
This script spawns you a file server which serves markdown files (of .md extension) by rendering them to html. Might come handy if you are writing up something in markdown and want to check the work you've done.
It needs the github-markdown gem (gem install github-markdown).
| package main | |
| import ( | |
| "fmt" | |
| "io" | |
| "log" | |
| "os" | |
| "unsafe" | |
| ) |
(fordította Henk Csaba)
Filetree Schema Language is a format that's intended to make it easy to specify certain file tree layouts.
The idea is that the performance dataset tool (yet to be written) will be capable of producing actual file trees upon feeding it with a file tree schema.
I tried to addressed a good trade-off between versatility and simplicity.
Syntactically, this manifests in being based on JSON -- that's easy to write by humans while providing the processing utility with properly typed structural data. A lot of abbreviations are added to make writing easy and
expressive (eg. you can specify the empty directory as "DIR" or {},
while the full form would be [ "DIR", {"entries": {} } ]).
