Instantly share code, notes, and snippets.

View gist:3c992f8e7fecf30f2fdb2829d8316e5a
ffmpeg -i in.mov -s 600x400 -pix_fmt rgb24 -r 10 -f gif - > out.gif
View download_popular_insta_photos.js
View Generate an instagram access token from your client_id.md
  • Login to instagram developers site and add http://localhost as a redirect API in your API client's settings
  • Navigate to https://www.instagram.com/oauth/authorize/?client_id=<CLIENT_ID>&redirect_uri=http://localhost&response_type=token
  • Get token from URL after redirect occurs back to http://localhost
View jsfeat_with_console_logs.js
/**
* @author Eugene Zatepyakin / http://inspirit.ru/
*
* this code is a rewrite from https://github.com/mtschirs/js-objectdetect implementation
* @author Martin Tschirsich / http://www.tu-darmstadt.de/~m_t
*/
(function(global) {
"use strict";
//
View json_vs_ujson_bench.py
import json
import time
import ujson
NUM_OBJ_KEYS = 1000
NUM_RUNS = 1000000
obj = {}
for i in range(NUM_OBJ_KEYS):
obj[i] = 'foo'
View gist:6143316
curl -XPOST 'http://localhost:9200/fuzzytest/' -d '
{
settings: {
index: {
analysis: {
analyzer: {
default: {
type: "custom",
tokenizer: "uax_url_email",
filter: [ "lowercase" ]
View extended_euclid.m
%{
Problem 7 (ii) - Extended Euclid
Input: positive integers a,b with a >= b >= 0
Output: integer array [ x,y,d ] such that
d = gcd(a,b) and ax + by = d
%}
function result = extended_Euclid (a, b)
if (b == 0)
View gcd-euclid.m
%{
Problem 7 (ii) - extended-euclid function
Given two integers a and b, it finds the largest integer that
divides both of them - known as their greatest common divisor (gcd).
Input: integers a and b where a >= b >= 0
Output : gcd(a, b)
%}
function result = euclid (a, b)
View modexp.m
%{
Problem 7 (i): modexp function
Returns x ^ y mod n for x, y, and n > 1.
%}
function result = modexp (x, y, n)
%anything raised to 0th power = 1 so return 1
if (y == 0)
result = 1;
return;
end