Skip to content

Instantly share code, notes, and snippets.

nbogie /
Created Jun 17, 2011
script to syntax-check puppet .pp and .erb files
#Script to test puppet files have valid syntax.
#Intended for use with hudson/jenkins.
set -e
set -u
#TODO: Run these in parallel - we have 4 cores.
#TODO: Control the environment (through the config dir?).
nbogie / whereami-readable.txt
Created Jul 1, 2011
presentation of for attempted readability
View whereami-readable.txt
echo -n
#quote-escaping removed from the following json
{"version": "1.1.0","host": "","request_address": true,"address_language": "en_GB", "wifi_towers":
`iwlist scan 2> /dev/null |
tr -d '\n' |
sed -e 's/Cell [0-9]* - Address: \([0-9A-Z:]*\)[^C]*Channel:\([0-9]*\)[^S]*Signal level=\([0-9-]*\) dBm[^E]*E[^E]*ESSID:"\([^"]*\)"/\{"mac_address": "\1","signal_strength": \3,"age": 0,"channel": \2,"ssid": "\4"}/g'
-e 's/[^{]*{/{/'
-e 's/}[^{]*{/},{/g'
nbogie / P99.scala
Created Aug 17, 2011
scala 99 solns poor
View P99.scala
object P1 {
def sampleList() = List(1, 10, 100, 2, 20, 200, 5)
def last[A](xs: List[A]): A =
xs match {
case Nil => sys.error("last on empty list")
case x :: Nil => x
case x :: rest => last(rest)
nbogie / p28.hs
Created Sep 7, 2011
poor soln h99 problems p28
View p28.hs
import Data.List (elemIndex, sortBy, group, sort)
import Data.Ord (comparing)
import Data.Maybe (fromJust)
main = print demo
demo = lsort ["", "ab3","r3","fg3","d3","ijk1","mn","1", "abcdef1"]
lsort :: (Ord a) => [[a]] -> [[a]]
lsort xs = sortBy (comparing lfreq) xs
nbogie / p56.hs
Created Sep 13, 2011
poor soln h99 problemss: p56 - symmetrical binary trees
View p56.hs
main = print $ demo
demo = isSym tree1
-- test data
tree1 = (Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty Empty))
tree2 = (Branch 'x' (Branch 'x' Empty Empty) Empty)
data Tree = Branch Char Tree Tree | Empty
isSym :: Tree -> Bool
View badfnparser.hs
-- Naive attempt at functional parsing
-- (so there is lots of plumbing in each combinator)
-- NOTE: This is NOT a good example of haskell to learn from.
import qualified Data.Map as M
import Prelude hiding ( (>>=), (>>), return)
main = interact $ unlines . map runTest . tail . lines
nbogie / typeclass_question.hs
Created Nov 2, 2011
Question on typeclasses: Can we make all instances of Enum and Bool instances of Generator?
View typeclass_question.hs
class Generator a where
generate :: [a]
data Media = Book | Video deriving (Enum, Bounded, Show)
data Category = Fiction | NonFiction deriving (Enum, Bounded, Show)
data Item = Item Media Category deriving (Show)
instance Generator Media where
generate = [minBound..maxBound]
nbogie /
Last active Aug 29, 2015
Hoodlums problem - D&D Damage Dice

Here's a simple problem which I found quite fun to implement.

Suggested hoodlums problem (beginner level):

Dungeons and Dragons Damage Dice


In the game of dungeons and dragons, an example damage expression might be:

nbogie / festival_of_code_journal_topics.markdown
Last active Jul 26, 2019
A rough list of topics for our Festival of Code dev journals (and presentations)
View festival_of_code_journal_topics.markdown

Topics for Dev Journal and Presentation

  • Team name
  • Project Name
  • The Idea
    • What problem are we solving?
    • Who is it for?
    • Where and When would they use it?
  • Problems we had...
    • ...and how we solved them
  • What technology was used?
nbogie / trim.js
Last active Jun 21, 2016
trim as regex in js
View trim.js
function trim(str){
return str.replace(/^\s*((?:.|\n)*?)\s*$/, "$1");
var testCases = [
[" a" , "a"],
["A " , "A"],
[" a " , "a"],
["a b! " , "a b!"],