James Abney jabney

## font-awesome.json
{"cc": "&#xf20a;", "bookmark": "&#xf02e;", "venus-mars": "&#xf228;", "arrow-circle-o-down": "&#xf01a;", "comment-o": "&#xf0e5;", "long-arrow-left": "&#xf177;", "arrow-right": "&#xf061;", "delicious": "&#xf1a5;", "chevron-circle-left": "&#xf137;", "bullhorn": "&#xf0a1;", "outdent": "&#xf03b;", "jpy": "&#xf157;", "drupal": "&#xf1a9;", "hdd-o": "&#xf0a0;", "hand-o-left": "&#xf0a5;", "pinterest": "&#xf0d2;", "plane": "&#xf072;", "question": "&#xf128;", "child": "&#xf1ae;", "circle-o": "&#xf10c;", "italic": "&#xf033;", "meanpath": "&#xf20c;", "subway": "&#xf239;", "google-plus": "&#xf0d5;", "angle-up": "&#xf106;", "star": "&#xf005;", "star-half-empty": "&#xf123;", "facebook-official": "&#xf230;", "youtube-square": "&#xf166;", "rss": "&#xf09e;", "toggle-off": "&#xf204;", "list-ol": "&#xf0cb;", "dot-circle-o": "&#xf192;", "copyright": "&#xf1f9;", "user": "&#xf007;", "key": "&#xf084;", "minus-square-o": "&#xf147;", "mobile": "&#xf10b;", "table": "&#xf0ce;", "columns": "&#xf0db;", "bolt": "&#xf0e7;", "fighter-jet": "&

## case_loader.py
import os
import re
import gzip
import base64
import json
from glob import glob
from argparse import ArgumentParser

from KnoDB.crawler.scc import case_parser
from KnoDB.crawler import bcca

## binary-search.js
// The default comparator is for any values that can be
// compared with '==', '<', '<=', '>', '>='.
function defaultComparator(candidate, target) {
  if (target < candidate) {
    return -1
  } else if (target > candidate) {
    return 1
  } else {
    return 0
  }

## keyframeInterpolateBinary.js
function keyframeInterpolate(keyframes, time, timing, lib) {
  const first = 0
  const last = keyframes.length - 1

  // Clamp time to [0, 1]
  time = Math.max(Math.min(time, 1), 0)

  if (!Array.isArray(keyframes) || !keyframes.length) {
    return lib.zero()
  }

## PriorityQueue.js
// PriorityQueue.js MIT License © 2014 James Abney http://github.com/jabney
(function(ex) {
'use strict';

// ---------------------------------------------------------------
// PriorityQueue Constructor
// A heap-based priority queue.
// ---------------------------------------------------------------
ex.PriorityQueue = function PriorityQueue(compare) {
  var compare = compare || function(a, b) { return a < b; },

## micro-reselect.js
/**
 * Implement a simplified createSelector function mimicking the reselect module.
 *
 * Memoizes the result of a function called with a state object as its argument.
 * The given function is only called when state values change.
 */

/**
 * A resolver returns a value from a state object (key/value pairs).
 *

## micro-react-redux.js
/**
 * Minimal implementation of react-redux style provider and connect function.
 */
import React, { useState, useEffect, useContext } from 'react'

const StoreContext = React.createContext(null)

/**
 * Wraps root component for providing store context, e.g.,
 *

## multithreaded-pi.cpp
#include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <thread>
#include <vector>

using namespace std;

## array-view.ts
/**
 * An experimental view that can iterate over a subset of an array.
 * - Not unit tested, there are undoubtedly bugs.
 */
"use strict";

const clamp = (min: number, max: number, value: number) => {
    return Math.min(max, Math.max(min, value));
};

## timer-cache.ts
interface IValueCache<T> {
    get: () => T;
    invalidate: () => void;
}

/**
 * A simple cache that invalidates based on a timer. Every access of
 * the value will refresh the timer.
 *
 * Even this simple class can be broken up into useful pieces and then
	import os
	import re
	import gzip
	import base64
	import json
	from glob import glob
	from argparse import ArgumentParser

	from KnoDB.crawler.scc import case_parser
	from KnoDB.crawler import bcca
	// The default comparator is for any values that can be
	// compared with '==', '<', '<=', '>', '>='.
	function defaultComparator(candidate, target) {
	if (target < candidate) {
	return -1
	} else if (target > candidate) {
	return 1
	} else {
	return 0
	}
	function keyframeInterpolate(keyframes, time, timing, lib) {
	const first = 0
	const last = keyframes.length - 1

	// Clamp time to [0, 1]
	time = Math.max(Math.min(time, 1), 0)

	if (!Array.isArray(keyframes) \|\| !keyframes.length) {
	return lib.zero()
	}
	// PriorityQueue.js MIT License © 2014 James Abney http://github.com/jabney
	(function(ex) {
	'use strict';

	// ---------------------------------------------------------------
	// PriorityQueue Constructor
	// A heap-based priority queue.
	// ---------------------------------------------------------------
	ex.PriorityQueue = function PriorityQueue(compare) {
	var compare = compare \|\| function(a, b) { return a < b; },
	/**
	* Implement a simplified createSelector function mimicking the reselect module.
	*
	* Memoizes the result of a function called with a state object as its argument.
	* The given function is only called when state values change.
	*/

	/**
	* A resolver returns a value from a state object (key/value pairs).
	*
	/**
	* Minimal implementation of react-redux style provider and connect function.
	*/
	import React, { useState, useEffect, useContext } from 'react'

	const StoreContext = React.createContext(null)

	/**
	* Wraps root component for providing store context, e.g.,
	*
	#include <algorithm>
	#include <chrono>
	#include <iomanip>
	#include <iostream>
	#include <numeric>
	#include <thread>
	#include <vector>

	using namespace std;
	/**
	* An experimental view that can iterate over a subset of an array.
	* - Not unit tested, there are undoubtedly bugs.
	*/
	"use strict";

	const clamp = (min: number, max: number, value: number) => {
	return Math.min(max, Math.max(min, value));
	};
	interface IValueCache<T> {
	get: () => T;
	invalidate: () => void;
	}

	/**
	* A simple cache that invalidates based on a timer. Every access of
	* the value will refresh the timer.
	*
	* Even this simple class can be broken up into useful pieces and then