mirror of
https://github.com/SamEyeBam/animate.git
synced 2026-11-18 10:07:46 +00:00
larry babby and threejs for glsl
This commit is contained in:
1 parent
87d5dc634d
commit
907ebae4c0
6474 files changed
+1279596
-8
No files matched your search
+815
@@ -0,0 +1,815 @@
|
||||
/****
|
||||
* The MIT License
|
||||
*
|
||||
* Copyright (c) 2015 Marco Ziccardi
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
* of this software and associated documentation files (the "Software"), to deal
|
||||
* in the Software without restriction, including without limitation the rights
|
||||
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
* copies of the Software, and to permit persons to whom the Software is
|
||||
* furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in
|
||||
* all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
||||
* THE SOFTWARE.
|
||||
*
|
||||
****/
|
||||
(function (global, factory) {
|
||||
if (typeof define === 'function' && define.amd) {
|
||||
define('timsort', ['exports'], factory);
|
||||
} else if (typeof exports !== 'undefined') {
|
||||
factory(exports);
|
||||
} else {
|
||||
var mod = {
|
||||
exports: {}
|
||||
};
|
||||
factory(mod.exports);
|
||||
global.timsort = mod.exports;
|
||||
}
|
||||
})(this, function (exports) {
|
||||
'use strict';
|
||||
|
||||
exports.__esModule = true;
|
||||
exports.sort = sort;
|
||||
|
||||
function _classCallCheck(instance, Constructor) {
|
||||
if (!(instance instanceof Constructor)) {
|
||||
throw new TypeError('Cannot call a class as a function');
|
||||
}
|
||||
}
|
||||
|
||||
var DEFAULT_MIN_MERGE = 32;
|
||||
|
||||
var DEFAULT_MIN_GALLOPING = 7;
|
||||
|
||||
var DEFAULT_TMP_STORAGE_LENGTH = 256;
|
||||
|
||||
var POWERS_OF_TEN = [1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9];
|
||||
|
||||
function log10(x) {
|
||||
if (x < 1e5) {
|
||||
if (x < 1e2) {
|
||||
return x < 1e1 ? 0 : 1;
|
||||
}
|
||||
|
||||
if (x < 1e4) {
|
||||
return x < 1e3 ? 2 : 3;
|
||||
}
|
||||
|
||||
return 4;
|
||||
}
|
||||
|
||||
if (x < 1e7) {
|
||||
return x < 1e6 ? 5 : 6;
|
||||
}
|
||||
|
||||
if (x < 1e9) {
|
||||
return x < 1e8 ? 7 : 8;
|
||||
}
|
||||
|
||||
return 9;
|
||||
}
|
||||
|
||||
function alphabeticalCompare(a, b) {
|
||||
if (a === b) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (~ ~a === a && ~ ~b === b) {
|
||||
if (a === 0 || b === 0) {
|
||||
return a < b ? -1 : 1;
|
||||
}
|
||||
|
||||
if (a < 0 || b < 0) {
|
||||
if (b >= 0) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (a >= 0) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
a = -a;
|
||||
b = -b;
|
||||
}
|
||||
|
||||
var al = log10(a);
|
||||
var bl = log10(b);
|
||||
|
||||
var t = 0;
|
||||
|
||||
if (al < bl) {
|
||||
a *= POWERS_OF_TEN[bl - al - 1];
|
||||
b /= 10;
|
||||
t = -1;
|
||||
} else if (al > bl) {
|
||||
b *= POWERS_OF_TEN[al - bl - 1];
|
||||
a /= 10;
|
||||
t = 1;
|
||||
}
|
||||
|
||||
if (a === b) {
|
||||
return t;
|
||||
}
|
||||
|
||||
return a < b ? -1 : 1;
|
||||
}
|
||||
|
||||
var aStr = String(a);
|
||||
var bStr = String(b);
|
||||
|
||||
if (aStr === bStr) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
return aStr < bStr ? -1 : 1;
|
||||
}
|
||||
|
||||
function minRunLength(n) {
|
||||
var r = 0;
|
||||
|
||||
while (n >= DEFAULT_MIN_MERGE) {
|
||||
r |= n & 1;
|
||||
n >>= 1;
|
||||
}
|
||||
|
||||
return n + r;
|
||||
}
|
||||
|
||||
function makeAscendingRun(array, lo, hi, compare) {
|
||||
var runHi = lo + 1;
|
||||
|
||||
if (runHi === hi) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
if (compare(array[runHi++], array[lo]) < 0) {
|
||||
while (runHi < hi && compare(array[runHi], array[runHi - 1]) < 0) {
|
||||
runHi++;
|
||||
}
|
||||
|
||||
reverseRun(array, lo, runHi);
|
||||
} else {
|
||||
while (runHi < hi && compare(array[runHi], array[runHi - 1]) >= 0) {
|
||||
runHi++;
|
||||
}
|
||||
}
|
||||
|
||||
return runHi - lo;
|
||||
}
|
||||
|
||||
function reverseRun(array, lo, hi) {
|
||||
hi--;
|
||||
|
||||
while (lo < hi) {
|
||||
var t = array[lo];
|
||||
array[lo++] = array[hi];
|
||||
array[hi--] = t;
|
||||
}
|
||||
}
|
||||
|
||||
function binaryInsertionSort(array, lo, hi, start, compare) {
|
||||
if (start === lo) {
|
||||
start++;
|
||||
}
|
||||
|
||||
for (; start < hi; start++) {
|
||||
var pivot = array[start];
|
||||
|
||||
var left = lo;
|
||||
var right = start;
|
||||
|
||||
while (left < right) {
|
||||
var mid = left + right >>> 1;
|
||||
|
||||
if (compare(pivot, array[mid]) < 0) {
|
||||
right = mid;
|
||||
} else {
|
||||
left = mid + 1;
|
||||
}
|
||||
}
|
||||
|
||||
var n = start - left;
|
||||
|
||||
switch (n) {
|
||||
case 3:
|
||||
array[left + 3] = array[left + 2];
|
||||
|
||||
case 2:
|
||||
array[left + 2] = array[left + 1];
|
||||
|
||||
case 1:
|
||||
array[left + 1] = array[left];
|
||||
break;
|
||||
default:
|
||||
while (n > 0) {
|
||||
array[left + n] = array[left + n - 1];
|
||||
n--;
|
||||
}
|
||||
}
|
||||
|
||||
array[left] = pivot;
|
||||
}
|
||||
}
|
||||
|
||||
function gallopLeft(value, array, start, length, hint, compare) {
|
||||
var lastOffset = 0;
|
||||
var maxOffset = 0;
|
||||
var offset = 1;
|
||||
|
||||
if (compare(value, array[start + hint]) > 0) {
|
||||
maxOffset = length - hint;
|
||||
|
||||
while (offset < maxOffset && compare(value, array[start + hint + offset]) > 0) {
|
||||
lastOffset = offset;
|
||||
offset = (offset << 1) + 1;
|
||||
|
||||
if (offset <= 0) {
|
||||
offset = maxOffset;
|
||||
}
|
||||
}
|
||||
|
||||
if (offset > maxOffset) {
|
||||
offset = maxOffset;
|
||||
}
|
||||
|
||||
lastOffset += hint;
|
||||
offset += hint;
|
||||
} else {
|
||||
maxOffset = hint + 1;
|
||||
while (offset < maxOffset && compare(value, array[start + hint - offset]) <= 0) {
|
||||
lastOffset = offset;
|
||||
offset = (offset << 1) + 1;
|
||||
|
||||
if (offset <= 0) {
|
||||
offset = maxOffset;
|
||||
}
|
||||
}
|
||||
if (offset > maxOffset) {
|
||||
offset = maxOffset;
|
||||
}
|
||||
|
||||
var tmp = lastOffset;
|
||||
lastOffset = hint - offset;
|
||||
offset = hint - tmp;
|
||||
}
|
||||
|
||||
lastOffset++;
|
||||
while (lastOffset < offset) {
|
||||
var m = lastOffset + (offset - lastOffset >>> 1);
|
||||
|
||||
if (compare(value, array[start + m]) > 0) {
|
||||
lastOffset = m + 1;
|
||||
} else {
|
||||
offset = m;
|
||||
}
|
||||
}
|
||||
return offset;
|
||||
}
|
||||
|
||||
function gallopRight(value, array, start, length, hint, compare) {
|
||||
var lastOffset = 0;
|
||||
var maxOffset = 0;
|
||||
var offset = 1;
|
||||
|
||||
if (compare(value, array[start + hint]) < 0) {
|
||||
maxOffset = hint + 1;
|
||||
|
||||
while (offset < maxOffset && compare(value, array[start + hint - offset]) < 0) {
|
||||
lastOffset = offset;
|
||||
offset = (offset << 1) + 1;
|
||||
|
||||
if (offset <= 0) {
|
||||
offset = maxOffset;
|
||||
}
|
||||
}
|
||||
|
||||
if (offset > maxOffset) {
|
||||
offset = maxOffset;
|
||||
}
|
||||
|
||||
var tmp = lastOffset;
|
||||
lastOffset = hint - offset;
|
||||
offset = hint - tmp;
|
||||
} else {
|
||||
maxOffset = length - hint;
|
||||
|
||||
while (offset < maxOffset && compare(value, array[start + hint + offset]) >= 0) {
|
||||
lastOffset = offset;
|
||||
offset = (offset << 1) + 1;
|
||||
|
||||
if (offset <= 0) {
|
||||
offset = maxOffset;
|
||||
}
|
||||
}
|
||||
|
||||
if (offset > maxOffset) {
|
||||
offset = maxOffset;
|
||||
}
|
||||
|
||||
lastOffset += hint;
|
||||
offset += hint;
|
||||
}
|
||||
|
||||
lastOffset++;
|
||||
|
||||
while (lastOffset < offset) {
|
||||
var m = lastOffset + (offset - lastOffset >>> 1);
|
||||
|
||||
if (compare(value, array[start + m]) < 0) {
|
||||
offset = m;
|
||||
} else {
|
||||
lastOffset = m + 1;
|
||||
}
|
||||
}
|
||||
|
||||
return offset;
|
||||
}
|
||||
|
||||
var TimSort = (function () {
|
||||
function TimSort(array, compare) {
|
||||
_classCallCheck(this, TimSort);
|
||||
|
||||
this.array = null;
|
||||
this.compare = null;
|
||||
this.minGallop = DEFAULT_MIN_GALLOPING;
|
||||
this.length = 0;
|
||||
this.tmpStorageLength = DEFAULT_TMP_STORAGE_LENGTH;
|
||||
this.stackLength = 0;
|
||||
this.runStart = null;
|
||||
this.runLength = null;
|
||||
this.stackSize = 0;
|
||||
|
||||
this.array = array;
|
||||
this.compare = compare;
|
||||
|
||||
this.length = array.length;
|
||||
|
||||
if (this.length < 2 * DEFAULT_TMP_STORAGE_LENGTH) {
|
||||
this.tmpStorageLength = this.length >>> 1;
|
||||
}
|
||||
|
||||
this.tmp = new Array(this.tmpStorageLength);
|
||||
|
||||
this.stackLength = this.length < 120 ? 5 : this.length < 1542 ? 10 : this.length < 119151 ? 19 : 40;
|
||||
|
||||
this.runStart = new Array(this.stackLength);
|
||||
this.runLength = new Array(this.stackLength);
|
||||
}
|
||||
|
||||
TimSort.prototype.pushRun = function pushRun(runStart, runLength) {
|
||||
this.runStart[this.stackSize] = runStart;
|
||||
this.runLength[this.stackSize] = runLength;
|
||||
this.stackSize += 1;
|
||||
};
|
||||
|
||||
TimSort.prototype.mergeRuns = function mergeRuns() {
|
||||
while (this.stackSize > 1) {
|
||||
var n = this.stackSize - 2;
|
||||
|
||||
if (n >= 1 && this.runLength[n - 1] <= this.runLength[n] + this.runLength[n + 1] || n >= 2 && this.runLength[n - 2] <= this.runLength[n] + this.runLength[n - 1]) {
|
||||
|
||||
if (this.runLength[n - 1] < this.runLength[n + 1]) {
|
||||
n--;
|
||||
}
|
||||
} else if (this.runLength[n] > this.runLength[n + 1]) {
|
||||
break;
|
||||
}
|
||||
this.mergeAt(n);
|
||||
}
|
||||
};
|
||||
|
||||
TimSort.prototype.forceMergeRuns = function forceMergeRuns() {
|
||||
while (this.stackSize > 1) {
|
||||
var n = this.stackSize - 2;
|
||||
|
||||
if (n > 0 && this.runLength[n - 1] < this.runLength[n + 1]) {
|
||||
n--;
|
||||
}
|
||||
|
||||
this.mergeAt(n);
|
||||
}
|
||||
};
|
||||
|
||||
TimSort.prototype.mergeAt = function mergeAt(i) {
|
||||
var compare = this.compare;
|
||||
var array = this.array;
|
||||
|
||||
var start1 = this.runStart[i];
|
||||
var length1 = this.runLength[i];
|
||||
var start2 = this.runStart[i + 1];
|
||||
var length2 = this.runLength[i + 1];
|
||||
|
||||
this.runLength[i] = length1 + length2;
|
||||
|
||||
if (i === this.stackSize - 3) {
|
||||
this.runStart[i + 1] = this.runStart[i + 2];
|
||||
this.runLength[i + 1] = this.runLength[i + 2];
|
||||
}
|
||||
|
||||
this.stackSize--;
|
||||
|
||||
var k = gallopRight(array[start2], array, start1, length1, 0, compare);
|
||||
start1 += k;
|
||||
length1 -= k;
|
||||
|
||||
if (length1 === 0) {
|
||||
return;
|
||||
}
|
||||
|
||||
length2 = gallopLeft(array[start1 + length1 - 1], array, start2, length2, length2 - 1, compare);
|
||||
|
||||
if (length2 === 0) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (length1 <= length2) {
|
||||
this.mergeLow(start1, length1, start2, length2);
|
||||
} else {
|
||||
this.mergeHigh(start1, length1, start2, length2);
|
||||
}
|
||||
};
|
||||
|
||||
TimSort.prototype.mergeLow = function mergeLow(start1, length1, start2, length2) {
|
||||
|
||||
var compare = this.compare;
|
||||
var array = this.array;
|
||||
var tmp = this.tmp;
|
||||
var i = 0;
|
||||
|
||||
for (i = 0; i < length1; i++) {
|
||||
tmp[i] = array[start1 + i];
|
||||
}
|
||||
|
||||
var cursor1 = 0;
|
||||
var cursor2 = start2;
|
||||
var dest = start1;
|
||||
|
||||
array[dest++] = array[cursor2++];
|
||||
|
||||
if (--length2 === 0) {
|
||||
for (i = 0; i < length1; i++) {
|
||||
array[dest + i] = tmp[cursor1 + i];
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
if (length1 === 1) {
|
||||
for (i = 0; i < length2; i++) {
|
||||
array[dest + i] = array[cursor2 + i];
|
||||
}
|
||||
array[dest + length2] = tmp[cursor1];
|
||||
return;
|
||||
}
|
||||
|
||||
var minGallop = this.minGallop;
|
||||
|
||||
while (true) {
|
||||
var count1 = 0;
|
||||
var count2 = 0;
|
||||
var exit = false;
|
||||
|
||||
do {
|
||||
if (compare(array[cursor2], tmp[cursor1]) < 0) {
|
||||
array[dest++] = array[cursor2++];
|
||||
count2++;
|
||||
count1 = 0;
|
||||
|
||||
if (--length2 === 0) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
} else {
|
||||
array[dest++] = tmp[cursor1++];
|
||||
count1++;
|
||||
count2 = 0;
|
||||
if (--length1 === 1) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
} while ((count1 | count2) < minGallop);
|
||||
|
||||
if (exit) {
|
||||
break;
|
||||
}
|
||||
|
||||
do {
|
||||
count1 = gallopRight(array[cursor2], tmp, cursor1, length1, 0, compare);
|
||||
|
||||
if (count1 !== 0) {
|
||||
for (i = 0; i < count1; i++) {
|
||||
array[dest + i] = tmp[cursor1 + i];
|
||||
}
|
||||
|
||||
dest += count1;
|
||||
cursor1 += count1;
|
||||
length1 -= count1;
|
||||
if (length1 <= 1) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
array[dest++] = array[cursor2++];
|
||||
|
||||
if (--length2 === 0) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
|
||||
count2 = gallopLeft(tmp[cursor1], array, cursor2, length2, 0, compare);
|
||||
|
||||
if (count2 !== 0) {
|
||||
for (i = 0; i < count2; i++) {
|
||||
array[dest + i] = array[cursor2 + i];
|
||||
}
|
||||
|
||||
dest += count2;
|
||||
cursor2 += count2;
|
||||
length2 -= count2;
|
||||
|
||||
if (length2 === 0) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
array[dest++] = tmp[cursor1++];
|
||||
|
||||
if (--length1 === 1) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
|
||||
minGallop--;
|
||||
} while (count1 >= DEFAULT_MIN_GALLOPING || count2 >= DEFAULT_MIN_GALLOPING);
|
||||
|
||||
if (exit) {
|
||||
break;
|
||||
}
|
||||
|
||||
if (minGallop < 0) {
|
||||
minGallop = 0;
|
||||
}
|
||||
|
||||
minGallop += 2;
|
||||
}
|
||||
|
||||
this.minGallop = minGallop;
|
||||
|
||||
if (minGallop < 1) {
|
||||
this.minGallop = 1;
|
||||
}
|
||||
|
||||
if (length1 === 1) {
|
||||
for (i = 0; i < length2; i++) {
|
||||
array[dest + i] = array[cursor2 + i];
|
||||
}
|
||||
array[dest + length2] = tmp[cursor1];
|
||||
} else if (length1 === 0) {
|
||||
throw new Error('mergeLow preconditions were not respected');
|
||||
} else {
|
||||
for (i = 0; i < length1; i++) {
|
||||
array[dest + i] = tmp[cursor1 + i];
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
TimSort.prototype.mergeHigh = function mergeHigh(start1, length1, start2, length2) {
|
||||
var compare = this.compare;
|
||||
var array = this.array;
|
||||
var tmp = this.tmp;
|
||||
var i = 0;
|
||||
|
||||
for (i = 0; i < length2; i++) {
|
||||
tmp[i] = array[start2 + i];
|
||||
}
|
||||
|
||||
var cursor1 = start1 + length1 - 1;
|
||||
var cursor2 = length2 - 1;
|
||||
var dest = start2 + length2 - 1;
|
||||
var customCursor = 0;
|
||||
var customDest = 0;
|
||||
|
||||
array[dest--] = array[cursor1--];
|
||||
|
||||
if (--length1 === 0) {
|
||||
customCursor = dest - (length2 - 1);
|
||||
|
||||
for (i = 0; i < length2; i++) {
|
||||
array[customCursor + i] = tmp[i];
|
||||
}
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
if (length2 === 1) {
|
||||
dest -= length1;
|
||||
cursor1 -= length1;
|
||||
customDest = dest + 1;
|
||||
customCursor = cursor1 + 1;
|
||||
|
||||
for (i = length1 - 1; i >= 0; i--) {
|
||||
array[customDest + i] = array[customCursor + i];
|
||||
}
|
||||
|
||||
array[dest] = tmp[cursor2];
|
||||
return;
|
||||
}
|
||||
|
||||
var minGallop = this.minGallop;
|
||||
|
||||
while (true) {
|
||||
var count1 = 0;
|
||||
var count2 = 0;
|
||||
var exit = false;
|
||||
|
||||
do {
|
||||
if (compare(tmp[cursor2], array[cursor1]) < 0) {
|
||||
array[dest--] = array[cursor1--];
|
||||
count1++;
|
||||
count2 = 0;
|
||||
if (--length1 === 0) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
} else {
|
||||
array[dest--] = tmp[cursor2--];
|
||||
count2++;
|
||||
count1 = 0;
|
||||
if (--length2 === 1) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
} while ((count1 | count2) < minGallop);
|
||||
|
||||
if (exit) {
|
||||
break;
|
||||
}
|
||||
|
||||
do {
|
||||
count1 = length1 - gallopRight(tmp[cursor2], array, start1, length1, length1 - 1, compare);
|
||||
|
||||
if (count1 !== 0) {
|
||||
dest -= count1;
|
||||
cursor1 -= count1;
|
||||
length1 -= count1;
|
||||
customDest = dest + 1;
|
||||
customCursor = cursor1 + 1;
|
||||
|
||||
for (i = count1 - 1; i >= 0; i--) {
|
||||
array[customDest + i] = array[customCursor + i];
|
||||
}
|
||||
|
||||
if (length1 === 0) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
array[dest--] = tmp[cursor2--];
|
||||
|
||||
if (--length2 === 1) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
|
||||
count2 = length2 - gallopLeft(array[cursor1], tmp, 0, length2, length2 - 1, compare);
|
||||
|
||||
if (count2 !== 0) {
|
||||
dest -= count2;
|
||||
cursor2 -= count2;
|
||||
length2 -= count2;
|
||||
customDest = dest + 1;
|
||||
customCursor = cursor2 + 1;
|
||||
|
||||
for (i = 0; i < count2; i++) {
|
||||
array[customDest + i] = tmp[customCursor + i];
|
||||
}
|
||||
|
||||
if (length2 <= 1) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
array[dest--] = array[cursor1--];
|
||||
|
||||
if (--length1 === 0) {
|
||||
exit = true;
|
||||
break;
|
||||
}
|
||||
|
||||
minGallop--;
|
||||
} while (count1 >= DEFAULT_MIN_GALLOPING || count2 >= DEFAULT_MIN_GALLOPING);
|
||||
|
||||
if (exit) {
|
||||
break;
|
||||
}
|
||||
|
||||
if (minGallop < 0) {
|
||||
minGallop = 0;
|
||||
}
|
||||
|
||||
minGallop += 2;
|
||||
}
|
||||
|
||||
this.minGallop = minGallop;
|
||||
|
||||
if (minGallop < 1) {
|
||||
this.minGallop = 1;
|
||||
}
|
||||
|
||||
if (length2 === 1) {
|
||||
dest -= length1;
|
||||
cursor1 -= length1;
|
||||
customDest = dest + 1;
|
||||
customCursor = cursor1 + 1;
|
||||
|
||||
for (i = length1 - 1; i >= 0; i--) {
|
||||
array[customDest + i] = array[customCursor + i];
|
||||
}
|
||||
|
||||
array[dest] = tmp[cursor2];
|
||||
} else if (length2 === 0) {
|
||||
throw new Error('mergeHigh preconditions were not respected');
|
||||
} else {
|
||||
customCursor = dest - (length2 - 1);
|
||||
for (i = 0; i < length2; i++) {
|
||||
array[customCursor + i] = tmp[i];
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
return TimSort;
|
||||
})();
|
||||
|
||||
function sort(array, compare, lo, hi) {
|
||||
if (!Array.isArray(array)) {
|
||||
throw new TypeError('Can only sort arrays');
|
||||
}
|
||||
|
||||
if (!compare) {
|
||||
compare = alphabeticalCompare;
|
||||
} else if (typeof compare !== 'function') {
|
||||
hi = lo;
|
||||
lo = compare;
|
||||
compare = alphabeticalCompare;
|
||||
}
|
||||
|
||||
if (!lo) {
|
||||
lo = 0;
|
||||
}
|
||||
if (!hi) {
|
||||
hi = array.length;
|
||||
}
|
||||
|
||||
var remaining = hi - lo;
|
||||
|
||||
if (remaining < 2) {
|
||||
return;
|
||||
}
|
||||
|
||||
var runLength = 0;
|
||||
|
||||
if (remaining < DEFAULT_MIN_MERGE) {
|
||||
runLength = makeAscendingRun(array, lo, hi, compare);
|
||||
binaryInsertionSort(array, lo, hi, lo + runLength, compare);
|
||||
return;
|
||||
}
|
||||
|
||||
var ts = new TimSort(array, compare);
|
||||
|
||||
var minRun = minRunLength(remaining);
|
||||
|
||||
do {
|
||||
runLength = makeAscendingRun(array, lo, hi, compare);
|
||||
if (runLength < minRun) {
|
||||
var force = remaining;
|
||||
if (force > minRun) {
|
||||
force = minRun;
|
||||
}
|
||||
|
||||
binaryInsertionSort(array, lo, lo + force, lo + runLength, compare);
|
||||
runLength = force;
|
||||
}
|
||||
|
||||
ts.pushRun(lo, runLength);
|
||||
ts.mergeRuns();
|
||||
|
||||
remaining -= runLength;
|
||||
lo += runLength;
|
||||
} while (remaining !== 0);
|
||||
|
||||
ts.forceMergeRuns();
|
||||
}
|
||||
});
|
||||
+1
@@ -0,0 +1 @@
|
||||
!function(a,b){if("function"==typeof define&&define.amd)define("timsort",["exports"],b);else if("undefined"!=typeof exports)b(exports);else{var c={exports:{}};b(c.exports),a.timsort=c.exports}}(this,function(a){"use strict";function b(a,b){if(!(a instanceof b))throw new TypeError("Cannot call a class as a function")}function c(a){return a<1e5?a<100?a<10?0:1:a<1e4?a<1e3?2:3:4:a<1e7?a<1e6?5:6:a<1e9?a<1e8?7:8:9}function d(a,b){if(a===b)return 0;if(~~a===a&&~~b===b){if(0===a||0===b)return a<b?-1:1;if(a<0||b<0){if(b>=0)return-1;if(a>=0)return 1;a=-a,b=-b}var d=c(a),e=c(b),f=0;return d<e?(a*=o[e-d-1],b/=10,f=-1):d>e&&(b*=o[d-e-1],a/=10,f=1),a===b?f:a<b?-1:1}var g=String(a),h=String(b);return g===h?0:g<h?-1:1}function e(a){for(var b=0;a>=l;)b|=1&a,a>>=1;return a+b}function f(a,b,c,d){var e=b+1;if(e===c)return 1;if(d(a[e++],a[b])<0){for(;e<c&&d(a[e],a[e-1])<0;)e++;g(a,b,e)}else for(;e<c&&d(a[e],a[e-1])>=0;)e++;return e-b}function g(a,b,c){for(c--;b<c;){var d=a[b];a[b++]=a[c],a[c--]=d}}function h(a,b,c,d,e){for(d===b&&d++;d<c;d++){for(var f=a[d],g=b,h=d;g<h;){var i=g+h>>>1;e(f,a[i])<0?h=i:g=i+1}var j=d-g;switch(j){case 3:a[g+3]=a[g+2];case 2:a[g+2]=a[g+1];case 1:a[g+1]=a[g];break;default:for(;j>0;)a[g+j]=a[g+j-1],j--}a[g]=f}}function i(a,b,c,d,e,f){var g=0,h=0,i=1;if(f(a,b[c+e])>0){for(h=d-e;i<h&&f(a,b[c+e+i])>0;)g=i,i=(i<<1)+1,i<=0&&(i=h);i>h&&(i=h),g+=e,i+=e}else{for(h=e+1;i<h&&f(a,b[c+e-i])<=0;)g=i,i=(i<<1)+1,i<=0&&(i=h);i>h&&(i=h);var j=g;g=e-i,i=e-j}for(g++;g<i;){var k=g+(i-g>>>1);f(a,b[c+k])>0?g=k+1:i=k}return i}function j(a,b,c,d,e,f){var g=0,h=0,i=1;if(f(a,b[c+e])<0){for(h=e+1;i<h&&f(a,b[c+e-i])<0;)g=i,i=(i<<1)+1,i<=0&&(i=h);i>h&&(i=h);var j=g;g=e-i,i=e-j}else{for(h=d-e;i<h&&f(a,b[c+e+i])>=0;)g=i,i=(i<<1)+1,i<=0&&(i=h);i>h&&(i=h),g+=e,i+=e}for(g++;g<i;){var k=g+(i-g>>>1);f(a,b[c+k])<0?i=k:g=k+1}return i}function k(a,b,c,g){if(!Array.isArray(a))throw new TypeError("Can only sort arrays");b?"function"!=typeof b&&(g=c,c=b,b=d):b=d,c||(c=0),g||(g=a.length);var i=g-c;if(!(i<2)){var j=0;if(i<l)return j=f(a,c,g,b),void h(a,c,g,c+j,b);var k=new p(a,b),m=e(i);do{if(j=f(a,c,g,b),j<m){var n=i;n>m&&(n=m),h(a,c,c+n,c+j,b),j=n}k.pushRun(c,j),k.mergeRuns(),i-=j,c+=j}while(0!==i);k.forceMergeRuns()}}a.__esModule=!0,a.sort=k;var l=32,m=7,n=256,o=[1,10,100,1e3,1e4,1e5,1e6,1e7,1e8,1e9],p=function(){function a(c,d){b(this,a),this.array=null,this.compare=null,this.minGallop=m,this.length=0,this.tmpStorageLength=n,this.stackLength=0,this.runStart=null,this.runLength=null,this.stackSize=0,this.array=c,this.compare=d,this.length=c.length,this.length<2*n&&(this.tmpStorageLength=this.length>>>1),this.tmp=new Array(this.tmpStorageLength),this.stackLength=this.length<120?5:this.length<1542?10:this.length<119151?19:40,this.runStart=new Array(this.stackLength),this.runLength=new Array(this.stackLength)}return a.prototype.pushRun=function(a,b){this.runStart[this.stackSize]=a,this.runLength[this.stackSize]=b,this.stackSize+=1},a.prototype.mergeRuns=function(){for(;this.stackSize>1;){var a=this.stackSize-2;if(a>=1&&this.runLength[a-1]<=this.runLength[a]+this.runLength[a+1]||a>=2&&this.runLength[a-2]<=this.runLength[a]+this.runLength[a-1])this.runLength[a-1]<this.runLength[a+1]&&a--;else if(this.runLength[a]>this.runLength[a+1])break;this.mergeAt(a)}},a.prototype.forceMergeRuns=function(){for(;this.stackSize>1;){var a=this.stackSize-2;a>0&&this.runLength[a-1]<this.runLength[a+1]&&a--,this.mergeAt(a)}},a.prototype.mergeAt=function(a){var b=this.compare,c=this.array,d=this.runStart[a],e=this.runLength[a],f=this.runStart[a+1],g=this.runLength[a+1];this.runLength[a]=e+g,a===this.stackSize-3&&(this.runStart[a+1]=this.runStart[a+2],this.runLength[a+1]=this.runLength[a+2]),this.stackSize--;var h=j(c[f],c,d,e,0,b);d+=h,e-=h,0!==e&&(g=i(c[d+e-1],c,f,g,g-1,b),0!==g&&(e<=g?this.mergeLow(d,e,f,g):this.mergeHigh(d,e,f,g)))},a.prototype.mergeLow=function(a,b,c,d){var e=this.compare,f=this.array,g=this.tmp,h=0;for(h=0;h<b;h++)g[h]=f[a+h];var k=0,l=c,n=a;if(f[n++]=f[l++],0!==--d){if(1===b){for(h=0;h<d;h++)f[n+h]=f[l+h];return void(f[n+d]=g[k])}for(var o=this.minGallop;;){var p=0,q=0,r=!1;do if(e(f[l],g[k])<0){if(f[n++]=f[l++],q++,p=0,0===--d){r=!0;break}}else if(f[n++]=g[k++],p++,q=0,1===--b){r=!0;break}while((p|q)<o);if(r)break;do{if(p=j(f[l],g,k,b,0,e),0!==p){for(h=0;h<p;h++)f[n+h]=g[k+h];if(n+=p,k+=p,b-=p,b<=1){r=!0;break}}if(f[n++]=f[l++],0===--d){r=!0;break}if(q=i(g[k],f,l,d,0,e),0!==q){for(h=0;h<q;h++)f[n+h]=f[l+h];if(n+=q,l+=q,d-=q,0===d){r=!0;break}}if(f[n++]=g[k++],1===--b){r=!0;break}o--}while(p>=m||q>=m);if(r)break;o<0&&(o=0),o+=2}if(this.minGallop=o,o<1&&(this.minGallop=1),1===b){for(h=0;h<d;h++)f[n+h]=f[l+h];f[n+d]=g[k]}else{if(0===b)throw new Error("mergeLow preconditions were not respected");for(h=0;h<b;h++)f[n+h]=g[k+h]}}else for(h=0;h<b;h++)f[n+h]=g[k+h]},a.prototype.mergeHigh=function(a,b,c,d){var e=this.compare,f=this.array,g=this.tmp,h=0;for(h=0;h<d;h++)g[h]=f[c+h];var k=a+b-1,l=d-1,n=c+d-1,o=0,p=0;if(f[n--]=f[k--],0!==--b){if(1===d){foLine truncated
|
||||
Reference in new issue
Block a user