A MySQL implementation that uses various weird backends to store the actual data (so anything except actual databases).
Basically a system where one writes an interface between MySQL queries, and some arbitrary (non-database) place to store and retrieve data.
Some ideas for initial interfaces:
I hereby claim:
To claim this, I am signing this object:
| # Encrypted password in sec.conf | |
| /secure passphrase <pass> | |
| /secure set bncpass <pass> | |
| # Default setting for all network | |
| mergeWords = zipWith (\x -> (++) x . (++) " ") | |
| fizzs = tail . repeat $ "Fizz" : replicate 4 "" | |
| buzzs = tail . repeat $ "Buzz" : replicate 2 "" | |
| fizzBuzzs = tail . repeat $ "FizzBuzz" : replicate 14 "" | |
| numbers = map ((:[]) . show) [0..] | |
| main = mapM_ putStrLn $ tail $ | |
| map (last . words) . foldl1 mergeWords $ |
| #!/usr/bin/python | |
| """CSVsToWorksheets.py: takes a folder of CSVs and puts them into a single Excel workbook, one worksheet per file.""" | |
| __author__ = "Zach Fogg" | |
| __email__ = "zach@wearableintelligence.com" | |
| import xlwt, csv, os |
| using System; | |
| using System.Collections.Generic; | |
| namespace Bounce | |
| { | |
| public class UnitCircle | |
| { | |
| public UnitCircle() | |
| { | |
| pi = Math.PI; |
| for (int i = 0; i < PhysicalSprites.Count; i++) | |
| { | |
| if (PhysicalSprites[i].IsAlive) | |
| PhysicalSprites[i].Update(gameTime); | |
| else | |
| { | |
| PhysicalSprites[i].Body.Dispose(); | |
| PhysicalSprites.RemoveAt(i); | |
| i--; | |
| } |
| public static List<Body> CreateFraming(World world, int width) | |
| { | |
| List<Body> bodyList = new List<Body>(); | |
| float x = WindowSize.X; | |
| float y = WindowSize.Y; | |
| for (float i = 0f; i <= x; i += x) | |
| { | |
| for (float j = 0f; j <= y; j += y) | |
| { |
| import Data.List | |
| import System.Environment | |
| isPythTriplet :: (Integer, Integer, Integer) -> Bool | |
| isPythTriplet (a, b, c) = (a^2) + (b^2) == (c^2) | |
| -- All possible representations of three elements from xs, | |
| -- where let xs[x] = indexof x in xs[a] < xs[b] < xs[c]. | |
| triplets :: [Integer] -> [(Integer, Integer, Integer)] | |
| triplets xs = [ (a, b, c) | a:as <- tails xs, |
| def membersOfType(o, *types): | |
| return dict( | |
| [(m, a) | |
| for m, a in map(lambda x: (x, getattr(o, x)), dir(o)) | |
| if any([isinstance(a, t) for t in types])]) |
