- 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
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
ffmpeg -i in.mov -s 600x400 -pix_fmt rgb24 -r 10 -f gif - > out.gif |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var MAX_PHOTOS = 40; | |
var MIN_NUM_LIKES = 40; | |
var currIndex = 1; | |
var numDownloaded = 0; | |
var previewOpened = function (imgIndex) { | |
return !!($('._tf9x3').text() && $('img._icyx7').get(imgIndex-1)) | |
} |
[ Languages: English, Español, 日本語, 한국어, Português, Русский, Slovenščina, Українська, 中文 ]
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* @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"; | |
// |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import json | |
import time | |
import ujson | |
NUM_OBJ_KEYS = 1000 | |
NUM_RUNS = 1000000 | |
obj = {} | |
for i in range(NUM_OBJ_KEYS): | |
obj[i] = 'foo' |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
curl -XPOST 'http://localhost:9200/fuzzytest/' -d ' | |
{ | |
settings: { | |
index: { | |
analysis: { | |
analyzer: { | |
default: { | |
type: "custom", | |
tokenizer: "uax_url_email", | |
filter: [ "lowercase" ] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
%{ | |
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) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
%{ | |
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) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
%{ | |
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 |
NewerOlder