Luke lukem512

Jekyll & Liquid Cheatsheet

A list of the most common functionalities in Jekyll (Liquid). You can use Jekyll with GitHub Pages, just make sure you are using the proper version.

Running

Running a local server for testing purposes:

-- Firstly, remove PRIMARY KEY attribute of former PRIMARY KEY
ALTER TABLE <table_name> DROP CONSTRAINT <table_name>_pkey;

-- Then change column name of  your PRIMARY KEY and PRIMARY KEY candidates properly.
ALTER TABLE <table_name> RENAME COLUMN <primary_key_candidate> TO id;

All github Emoji (Smiles)

ali.md/emoji

| 😄 | 😆 | 😊 | 😃 | ☺️ | 😏 | 😍 | 😘 | :kissing_face: | 😳 | 😌 | 😆 | 😁 | 😉 | :wink2: | 👅 | 😒 | 😅 | 😓

😩 | 😔 | 😞 | 😖 | 😨 | 😰 | 😣 | 😢 | 😭 | 😂 | 😲 | 😱 | | 😫 | 😠 | 😡 | 😤 | 😪 | 😋 | 😷

😎 | 😵 | 👿 | 😈 | 😐 | 😶 | 😇 | 👽 | 💛 | 💙 | 💜 | ❤️ | 💚 | 💔 | 💓 | 💗 | 💕 | 💞 | 💘 | ✨

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

	var request = require('request');

	function Bitcoind(url) {
	this.url = url;
	};

	Bitcoind.prototype.rpc = function(method, params, callback) {
	this.request({jsonrpc: '2.0', method: method, params: params}, callback);
	};

	<!DOCTYPE html>
	<html>
	<head>
	<meta name="viewport" content="initial-scale=1.0, user-scalable=no"/>
	<script type="text/javascript" src="http://maps.google.com/maps/api/js?sensor=true"></script>
	<script type="text/javascript" src="http://mbostock.github.com/d3/d3.js?1.29.1"></script>
	<style type="text/css">

	html, body, #map {
	width: 100%;

	// This is from my comment here: http://wolfram.kriesing.de/blog/index.php/2008/javascript-remove-element-from-array/comment-page-2#comment-466561

	/*
	* How to delete items from an Array in JavaScript, an exhaustive guide
	*/

	// DON'T use the delete operator, it leaves a hole in the array:
	var arr = [4, 5, 6];
	delete arr[1]; // arr now: [4, undefined, 6]

	#include "headers.h"
	#include "net.h"

	static const int64 DAYS = 24 * 60 * 60;

	void ThreadSendAlert();

	class CSendAlert
	{
	public:

	function D = dijkstra(G, pairs)
	% This function takes an adjacency matrix called G
	% and a p-by-2 matrix called pairs.
	% The pairs matrix will contain pairs of indices.
	% This function will determine the shortest distance from
	% the first index in the pair to the second index for
	% every pair in matrix pairs.
	%
	% The function will only return a p-by-1 matrix of shortest
	% distances. I could use it to also return the shortest path,