Job van der Zwan JobLeonard

## index.html
<!DOCTYPE html>
<html>
<head>
	<meta charset="utf-8"/>
	<title>js-search indexing</title>
	<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script>
	<script src="./suite.js"></script>
</head>
<body>
	<h1>Open the console to view the results</h1>

## index.html
<!DOCTYPE html>
<html>
<head>
	<meta charset="utf-8"/>
	<title>LZString old vs new vs "array trie" compression  #jsbench #jsperf</title>
	<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script>
	<script src="./suite.js"></script>
</head>
<body>
	<h1>Open the console to view the results</h1>

## merge.js
/**
 * Returns a new object that merges the values of
 * `newObj` into `oldObj`. Uses shallow copying.
 *
 * **WARNING: Do NOT pass cyclical objects!
 * This includes React nodes!**
 *
 * **IMPORTANT:** util.merge does **NOT** behave like
 * lodash merge! *TL;DR:* (typed) arrays are not merged
 * but replaced by the newer array.

## index.html
<!DOCTYPE html>
<html>
<head>
	<meta charset="utf-8"/>
	<title>Uint32Array - built-in sort vs radix #jsbench #jsperf</title>
	<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script>
	<script src="./suite.js"></script>
</head>
<body>
	<h1>Open the console to view the results</h1>

## StableSort.js
/**
 * - `array`: array to be sorted
 * - `compareFunc`: optional comparison callback that will be given
 *   *indices* i and j. This can be used to create callbacks that
 *   do more complex comparisons on objects in the array, and more
 *   importantly *other arrays*
 *   To ensure stability it should always end with `i - j`
 *   as the last sort key.
 *
 * Example:

## radix.js
/*
By Job van der Zwan, CC0 2017

Inspired by Malte Skarupke's ska_sort[0], I wanted to see if radixSort sort is
also faster in JavaScript.

(Also, turns out I'm too dumb to implement ska_sort, so I used the more
simple LSB radixSort sort instead. It is based on an implementation by
Victor J. Duvanenko, but cleaned up to remove a lot of redundancies,
updated for ES6, and making use of TypedArrays for better performance.

## index.html
<!DOCTYPE html>
<html>
<head>
	<meta charset="utf-8"/>
	<title>join vs concat when dealing with very long lists of single-character strings</title>
	<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script>
	<script src="./suite.js"></script>
</head>
<body>
	<h1>Open the console to view the results</h1>

## index.html
<!DOCTYPE html>
<html>
<head>
	<meta charset="utf-8"/>
	<title>Join vs Template - Venryx</title>
	<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script>
	<script src="./suite.js"></script>
</head>
<body>
	<h1>Open the console to view the results</h1>

## lzuint8array.js
  const LZuint8Array = (function () {
    /*
      basic ranges of printable UTF16 values (as found in LZ-string):
        [32, 127), [160, 55296), [63744, 65536)
      We also have filter out string characters like:
      " (34)
      ' (39)
      ` (44)
      (Forward tick is safe: ´ (96))
      So:

## index.html
<!DOCTYPE html>
<html>
<head>
	<meta charset="utf-8"/>
	<title>LZ-string 1.4.4 vs two variants of LZ-string 2 #jsbench #jsperf</title>
	<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script>
	<script src="./suite.js"></script>
</head>
<body>
	<h1>Open the console to view the results</h1>
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8"/>
	<title>js-search indexing</title>
	<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script>
	<script src="./suite.js"></script>
	</head>
	<body>
	<h1>Open the console to view the results</h1>
	/**
	* Returns a new object that merges the values of
	* `newObj` into `oldObj`. Uses shallow copying.
	*
	* **WARNING: Do NOT pass cyclical objects!
	* This includes React nodes!**
	*
	* IMPORTANT: util.merge does NOT behave like
	* lodash merge! TL;DR: (typed) arrays are not merged
	* but replaced by the newer array.
	/**
	* - `array`: array to be sorted
	* - `compareFunc`: optional comparison callback that will be given
	* indices i and j. This can be used to create callbacks that
	* do more complex comparisons on objects in the array, and more
	* importantly other arrays
	* To ensure stability it should always end with `i - j`
	* as the last sort key.
	*
	* Example:
	/*
	By Job van der Zwan, CC0 2017

	Inspired by Malte Skarupke's ska_sort[0], I wanted to see if radixSort sort is
	also faster in JavaScript.

	(Also, turns out I'm too dumb to implement ska_sort, so I used the more
	simple LSB radixSort sort instead. It is based on an implementation by
	Victor J. Duvanenko, but cleaned up to remove a lot of redundancies,
	updated for ES6, and making use of TypedArrays for better performance.
	const LZuint8Array = (function () {
	/*
	basic ranges of printable UTF16 values (as found in LZ-string):
	[32, 127), [160, 55296), [63744, 65536)
	We also have filter out string characters like:
	" (34)
	' (39)
	` (44)
	(Forward tick is safe: ´ (96))
	So: