Aadarsh Indurkhya wyaadarsh

Git cheatsheet

git grep "text to look for" $(git rev-list --all)

Let i=0, so, (1<<i) = 00001 01010 | 00001 = 01011

Let i=1, so,

git rm --cached mylogfile.log # Single file git rm --cached -r mydirectory # From Directory

My Elasticsearch cheatsheet with example usage via rest api (still a work-in-progress)

	# How this works is: if we want n1 to go first in the sorted order, we return -1 and we want n2 to go first, we return a +1

	def compare(n1, n2):
	if n1+n2 > n2+n1:
	return -1
	else:
	return 1

	nums = sorted(nums, key=cmp_to_key(compare))
	# cmp_to_key is important

	import heapq


	class MyHeap(object):
	def __init__(self, initial=None, key=lambda x: x):
	# Max Heap: key: lambda x: -x
	# Min Head: default key would work
	self.key = key
	self.index = 0
	if initial:

	#!/usr/bin/env python
	# -- coding: utf-8 --

	# Note: To use the 'upload' functionality of this file, you must:
	# $ pipenv install twine --dev

	import io
	import os
	import sys
	from shutil import rmtree