themattchan

Git

Global Settings

Related Setup: https://gist.github.com/hofmannsven/6814278
Related Pro Tips: https://ochronus.com/git-tips-from-the-trenches/
Interactive Beginners Tutorial: http://try.github.io/
Git Cheatsheet by GitHub: https://services.github.com/on-demand/downloads/github-git-cheat-sheet/

Reminder

Press minus + shift + s and return to chop/fold long lines!

Tinder API documentation

Note: this was written in April/May 2014 and the API may has definitely changed since. I have nothing to do with Tinder, nor its API, and I do not offer any support for anything you may build on top of this. Proceed with caution

I've sniffed most of the Tinder API to see how it works. You can use this to create bots (etc) very trivially. Some example python bot code is here -> https://gist.github.com/rtt/5a2e0cfa638c938cca59 (horribly quick and dirty, you've been warned!)

To remove a submodule you need to:

Delete the relevant section from the .gitmodules file.
Stage the .gitmodules changes git add .gitmodules
Delete the relevant section from .git/config.
Run git rm --cached path_to_submodule (no trailing slash).
Run rm -rf .git/modules/path_to_submodule (no trailing slash).
Commit git commit -m "Removed submodule "
Delete the now untracked submodule files rm -rf path_to_submodule

	{-
	Andrew Miller

	Authenticated Data Structures, Generically:
	Merkle-ized Lambda Calculator
	-}

	{-# LANGUAGE GADTs,
	FlexibleInstances, FlexibleContexts, UndecidableInstances,
	StandaloneDeriving, TypeOperators, Rank2Types,

	Require Import Coq.Lists.List.

	Open Scope bool_scope.

	(* This is a direct definition of CGTs, using just one inductive type
	instead of a pair of mutually-inductive types *)

	Inductive game := Game {
	left_moves : list game;
	right_moves : list game

	import Control.Monad
	import Control.Monad.ST
	import Data.Array.MArray
	import Data.Array.ST
	import Data.STRef

	import Prelude hiding (id)

	data UnionFind s = UnionFind {
	ids:: STUArray s Int Int

	#include <iostream>
	#include <sstream>
	#include <cstdint>
	#include <cstddef>
	#include <string>
	#include <memory>
	#include <vector>
	#include <tuple>
	#include <utility>
	#include <type_traits>

	{-# LANGUAGE TemplateHaskell #-}
	{-# LANGUAGE QuasiQuotes #-}

	import qualified Data.Graph.Inductive as Graph
	import Data.Graph.Inductive (Gr, match, matchAny)
	import Data.String.Interpolation (str)

	complex :: Gr () ()
	complex = Graph.mkGraph nodes edges
	where nodes = [(x, ()) \| x <- [1..10]]

	#!/usr/bin/env python


	def curry(func):
	"""
	Decorator to curry a function, typical usage:

	>>> @curry
	... def foo(a, b, c):
	... return a + b + c

	# encoding: utf8 1,1 Top# encoding: utf8
	import argparse
	from datetime import datetime
	import json
	from random import randint
	import requests
	import sys
	from time import sleep