Skip to content

Instantly share code, notes, and snippets.

Arbotunity Report Apr 21, 5:15:31 PM

Commissions:

  • polo: 0.25%
  • kraken: 0.10%
  • btrx: 0.25%
  • gdax: 0.00%

Arbo | Asset | Buy On | Buy @ | Qty | Sell On | Sell @ | Fee | Profit

Arbotunity Report Apr 21, 5:17:28 PM

Commissions:

  • btrx: 0.25%
  • polo: 0.25%
  • gdax: 0.00%
  • kraken: 0.10%

Arbo | Asset | Buy On | Buy @ | Qty | Sell On | Sell @ | Fee | Profit

Arbotunity Report Apr 21, 5:23:13 PM

Commissions:

  • polo: 0.25%
  • kraken: 0.10%
  • gdax: 0.00%
  • btrx: 0.25%

Arbo | Asset | Buy On | Buy @ | Qty | Sell On | Sell @ | Fee | Profit

Arbotunity Report Apr 21, 5:33:33 PM

Commissions:

  • polo: 0.25%
  • kraken: 0.10%
  • gdax: 0.00%
  • btrx: 0.25%

Arbo | Asset | Buy On | Buy @ | Qty | Sell On | Sell @ | Fee | Profit

Arbotunity Report Apr 21, 5:45:07 PM

Commissions:

  • gdax: 0.00%
  • polo: 0.25%
  • kraken: 0.10%
  • btrx: 0.25%

Arbo | Asset | Buy On | Buy @ | Qty | Sell On | Sell @ | Fee | Profit

@dustMason
dustMason / op-1-keys.js
Created June 1, 2017 20:46
Interactive OP-1 keys
(function(document, window) {
var fullWidth = 1111.0;
var img = document.querySelector("#op1-keys:not([data-ready])");
if (img) {
var keys = [
[[210, 58], [270, 173]], // F
[[211, 0], [298, 57]], // F#
[[269, 58], [327, 174]],
@dustMason
dustMason / midi.js
Created June 1, 2017 20:50
Simple web midi implementation
var OP1MidiInterface = function(midi) {
var data, cmd, channel, type, note, velocity;
midi.inputs.forEach(function(input) {
if (input.name.indexOf('OP-1') > -1) {
document.dispatchEvent(new Event('midi-connected'));
input.onmidimessage = onMIDIMessage;
}
});
midi.onstatechange = onStateChange;
@dustMason
dustMason / deps.sh
Last active January 11, 2022 15:51 — forked from prashantmaurice/install-ffmpeg-amazon-linux.sh
How to compile ffmpeg on Amazon Linux (EC2) for use on AWS Lambda
#!/bin/bash
# Author : Hemanth.HM
# Email : hemanth[dot]hm[at]gmail[dot]com
# License : GNU GPLv3
#
function useage()
{
cat << EOU
Useage: bash $0 <path to the binary> <path to copy the dependencies>
class Solution
# @param a : array of integers
# @return an integer
def solve(a)
found = -1
sorted = a.select { |n| n >= 0 }.sort
s = sorted.size
sorted.each_with_index do |n, i|
if n >= 0 && n == s - 1 - i && sorted[i+1] != n
<table>
<tr>
<th>
Column 1
</th>
<th>
Column 2
</th>
<th>