rjray

;;; heap.clj
;;;
;;; An implementation of both min-heaps and max-heaps. Each heap is presented
;;; as a vector with the content stored from index 1. Index 0 is used to store
;;; a map that holds the functions to be used in comparing elements for the
;;; "bubble-up" and "heapify" operations.
(ns algorithms.heap)

;; Swap two elements of the given vector, using assoc! on the assumption that
;; the vector is currently transient.

rjray

Keybase proof

I hereby claim:

• I am rjray on github.
• I am rjray (https://keybase.io/rjray) on keybase.
• I have a public key whose fingerprint is 386C 5D8F ABF8 EC90 8A76 072B E7A2 50D8 2FDD 3C62

To claim this, I am signing this object:

rjray

cover -delete
HARNESS_PERL_SWITCHES=-MDevel::Cover=-coverage,statement,branch,condition,path,subroutine,time prove -l
cover

rjray

#!/usr/bin/perl

# Playing around with acme's sample code around Linux::Inotify2.
# See http://acme.vox.com/library/post/what-files-does-your-perl-load.html

use strict;
use warnings;

use Linux::Inotify2;
use File::Find::Rule;

rjray

#!/bin/bash

# I use this to create a gh-pages branch on new repos

if [ ! -d .git ]; then
    echo "Must be in a repository directory!"
    exit
fi

wd_clean=$(git status | grep 'nothing to commit')