I hereby claim:
- I am adam000 on github.
- I am adam_0 (https://keybase.io/adam_0) on keybase.
- I have a public key whose fingerprint is 9C68 2F61 E3FE 7EF4 C179 9FA3 7C78 905F 5897 D6C9
To claim this, I am signing this object:
(repository at: github.com/adam000/xsera) | |
I want to split a repository by: | |
Apollo, the engine | |
Xsera, which uses Apollo | |
Files are prefixed by: | |
(b) -> file belongs to both / either | |
(a) -> file belongs to apollo, the soon-to-be subrepository | |
(x) -> file belongs to xsera, the soon-to-be super-repository (?) |
#!/bin/bash | |
function move_sequential { | |
if [[ $# != 4 ]]; then | |
echo Usage: move_sequential <prefix> <first number to move, inclusive> <last number to move, inclusive> <suffix> | |
return 1 | |
fi | |
PREFIX=$1 | |
FIRST=$2 |
#!/bin/bash | |
# vim: set ts=2 sw=2: | |
# or for Makefile: | |
# vim: set ts=5 sw=5 noet nolist: |
#!/bin/bash | |
echo "Please enter a file to be read as an array:" | |
read fileName | |
a=( $(cat fileName) ) |
It seems to be following some permutation-like math: | |
trees[2] = trees[0]*trees[1] + trees[1]*trees[0] | |
trees[3] = trees[0]*trees[2] + trees[1]*trees[1] + trees[2]*trees[0] | |
trees[4] = trees[0]*trees[3] + trees[1]*trees[2] + trees[2]*trees[1] + trees[3]*trees[0] | |
etc. | |
I would love to know why it is doing this, but alas, I cannot remember. |
-- Metatable implementation of primes | |
primes = { 2, 3, 5, 7, 11, 13 } | |
__mt = { | |
__index = function(table, index) | |
local val = table[index - 1] | |
repeat | |
val = val + 2 | |
local isPrime = true |
alias +secondary "slot2" | |
alias -secondary "slot1" | |
bind shift "+secondary" |
#!/usr/bin/env lua | |
-- Get the cache singleton | |
function getCache() | |
-- TODO | |
end | |
-- Metatable function that returns a function to add to the cache |
#!/bin/bash | |
while true; do | |
DIR=/tmp/`printf %05d $RANDOM` | |
if [[ ! -e $DIR ]]; then | |
break | |
fi | |
done | |
echo Making $DIR |
I hereby claim:
To claim this, I am signing this object: