Priority Queue implemented in JavaScript. It is a closure, that returns an object, with push, shift, and length. It's first argument is a function that sorts the queue as you add elements to it. It allows successive method calls.

PriorityQueue.js

var PriorityQueue = function (fn) {
	var queue = [];
	return {
		push: function (a) {
			queue.push(a);
			queue.sort(fn);
			return this;
		},
		shift: function () {
			return queue.shift();
		},
		length: function () {
			return queue.length;
		}
	};
};