steve-jansen

#!/bin/bash

stash() {
  # check if we have uncommited changes to stash
  git status --porcelain | grep "^." >/dev/null;

  if [ $? -eq 0 ]
  then
    if git stash save -u "git-update on `date`";
    then

timcowlishaw

# Inspired by https://www.fpcomplete.com/user/dpiponi/the-mother-of-all-monads, A ruby port of Haskell's continuation monad, using fibers for lazily-evaluated giggles:
#
# For reference, The continuation monad instance definition from haskell:
# instance Monad (Cont r) where
#   return a = Cont ($ a)
#   m >>= k  = Cont $ \c -> runCont m $ \a -> runCont (k a) c

#HI THERE, I AM THE CONTINUATION MONAD
class Cont
  def self.unit(x)

dleavitt

desc "Outputs a change log based on git tags"
task :changelog do
  tags = Dir['.git/refs/tags/*'].each.with_object({}) do |path, hsh|
    hsh[File.basename(path)] = File.read(path).chomp
  end

  tag_outputs = []
  tags.reduce(nil) do |(_, commit1), (name, commit2)|
    tag_date = `git log -1 --format="%ci" #{commit2}`.chomp
    lines = [ "## #{name} - #{tag_date}\n" ]

cstorey

require_relative 'mpsc'

class LoggerProxy
  def initialize target
    @target = target
    @queue = MpscQueue.new
  end

  def start!
    @reader, @writer = IO.pipe

htr

{-# LANGUAGE OverloadedStrings #-}

import DBus
import DBus.Client


spotifyCtrl :: Client -> MemberName -> X ()
spotifyCtrl client command = liftIO $ do
  call_ client
    (methodCall "/org/mpris/MediaPlayer2" "org.mpris.MediaPlayer2.Player" command) {

itsderek23

# docker build -t="rails" .

FROM ubuntu:12.04

RUN apt-get update

## MYSQL
RUN apt-get install -y -q mysql-client libmysqlclient-dev

## RUBY

barrysteyn

OpenSSL Base64 Encoding: Binary Safe and Portable

Herewith is an example of encoding to and from base64 using OpenSSL's C library. Code presented here is both binary safe, and portable (i.e. it should work on any Posix compliant system e.g. FreeBSD and Linux).

License

The MIT License (MIT)

Copyright (c) 2013 Barry Steyn

bnyeggen

package main

import (
	"fmt"
	"runtime"
	"sync"
)

type UpgradableLock struct {
	uglMutex sync.RWMutex

joyrexus

My implementation of the Gale/Shapley algorithm in Python. This algorithm is designed to address the Stable Marriage Problem.

Compare this recursive variant with the implementations on Rosetta Code.

Problem description

Given an equal number of men and women to be paired for marriage, each man ranks all the women in order of his preference and each women ranks all the men in order of her preference.

A stable set of engagements for marriage is one where no man prefers a women over the one he is engaged to, where that other woman also prefers that man over the one she is engaged to. I.e. with consulting marriages, there would be no reason for the engagements between the people to change.

gorsuch

package main

import (
	"fmt"
	"strconv"
	"time"

	"github.com/hashicorp/serf/client"
)