Update other.js

.gitignore

@@ -1,6 +1 @@
-/sparecode/
-/AutoTrimps.PEM
-/https.py
-/https2.py
-/server.pem
-/SIMPLEHTTPSERVER.bat
+AutoTrimps2.js

.user.js

@@ -1,22 +1,22 @@
 // ==UserScript==
-// @name         AutoTrimps-genBTC
-// @version      2.1.6.9-genbtc-3-23-2018
-// @namespace    https://genbtc.github.io/AutoTrimps
-// @updateURL    https://genbtc.github.io/AutoTrimps/.user.js
+// @name         AutoTrimps-Zek
+// @version      1.0-Zek
+// @namespace    https://Zorn192.github.io/AutoTrimps
+// @updateURL    https://Zorn192.github.io/AutoTrimps/.user.js
 // @description  Automate all the trimps!
-// @author       zininzinin, spindrjr, Ishkaru, genBTC
+// @author       zininzinin, spindrjr, Ishkaru, genBTC, Zeker0
 // @include      *trimps.github.io*
 // @include      *kongregate.com/games/GreenSatellite/trimps
-// @connect      *genbtc.github.io/AutoTrimps*
+// @connect      *Zorn192.github.io/AutoTrimps*
 // @connect      *trimps.github.io*
 // @connect      self
-// @grant        none
+// @grant        GM_xmlhttpRequest 
 // ==/UserScript==
 
 var script = document.createElement('script');
-script.id = 'AutoTrimps-script';
+script.id = 'AutoTrimps-Zek';
 //This can be edited to point to your own Github Repository URL.
-script.src = 'https://genBTC.github.io/AutoTrimps/AutoTrimps2.js';
+script.src = 'https://Zorn192.github.io/AutoTrimps/AutoTrimps2.js';
 //script.setAttribute('crossorigin',"use-credentials");
 script.setAttribute('crossorigin',"anonymous");
 document.head.appendChild(script);

FastPriorityQueue.js

@@ -1,130 +1,11 @@
-/**
- * FastPriorityQueue.js : a fast heap-based priority queue  in JavaScript.
- * (c) the authors
- * Licensed under the Apache License, Version 2.0.
- *
- * Speed-optimized heap-based priority queue for modern browsers and JavaScript engines.
- *
- * Usage :
-         Installation (in shell, if you use node):
-         $ npm install fastpriorityqueue
-
-         Running test program (in JavaScript):
-
-         // var FastPriorityQueue = require("fastpriorityqueue");// in node
-         var x = new FastPriorityQueue();
-         x.add(1);
-         x.add(0);
-         x.add(5);
-         x.add(4);
-         x.add(3);
-         x.peek(); // should return 0, leaves x unchanged
-         x.size; // should return 5, leaves x unchanged
-         while(!x.isEmpty()) {
-           console.log(x.poll());
-         } // will print 0 1 3 4 5
- */
 'use strict';
-
-var defaultcomparator = function(a, b) {
-    return a < b;
-};
-
-// the provided comparator function should take a, b and return *true* when a < b
-function FastPriorityQueue(comparator) {
-    this.array = [];
-    this.size = 0;
-    this.compare =  comparator || defaultcomparator;
-}
-
-
-// Add an element the the queue
-// runs in O(log n) time
-FastPriorityQueue.prototype.add = function(myval) {
-    var i = this.size;
-    this.array[this.size++] = myval;
-    while ( i > 0) {
-        var p = (i - 1) >> 1;
-        var ap = this.array[p];
-        if(!this.compare(myval, ap )) break;
-        this.array[i] = ap;
-        i = p;
-    }
-    this.array[i] = myval;
-};
-
-// replace the content of the heap by provided array and "heapifies it"
-FastPriorityQueue.prototype.heapify = function(arr) {
-    this.array = arr;
-    this.size = arr.length;
-    for (var i = (this.size >> 1); i >= 0; i--) {
-        this._percolateDown(i);
-    }
-};
-
-// for internal use
-FastPriorityQueue.prototype._percolateUp = function(i) {
-    var myval = this.array[i];
-    while ( i > 0) {
-        var p = (i - 1) >> 1;
-        var ap = this.array[p];
-        if(!this.compare(myval, ap )) break;
-        this.array[i] = ap;
-        i = p;
-    }
-    this.array[i] = myval;
-};
-
-
-// for internal use
-FastPriorityQueue.prototype._percolateDown = function(i) {
-    var size = this.size;
-    var hsize = this.size >>> 1;
-    var ai = this.array[i];
-    while (i < hsize) {
-        var l = (i << 1) + 1;
-        var r = l + 1;
-        var bestc = this.array[l];
-        if (r < size) {
-            if (this.compare(this.array[r], bestc)) {
-                l = r;
-                bestc = this.array[r];
-            }
-        }
-        if (!this.compare(bestc,ai)) {
-          break;
-        }
-        this.array[i] = bestc;
-        i = l;
-    }
-    this.array[i] = ai;
-};
-
-//Look at the top of the queue (a smallest element)
-// executes in constant time
-FastPriorityQueue.prototype.peek = function(t) {
-    return this.array[0];
-};
-
-// remove the element on top of the heap (a smallest element)
-// runs in logarithmic time
-FastPriorityQueue.prototype.poll = function(i) {
-    var ans = this.array[0];
-    if(this.size > 1) {
-        this.array[0] = this.array[--this.size];
-        this._percolateDown(0 | 0);
-    } 
-    else if (this.size == 0) --this.size;
-    return ans;
-};
-
-
-// recover unused memory (for long-running priority queues)
-FastPriorityQueue.prototype.trim = function() {
-    this.array = this.array.slice(0,this.size);
-};
-
-// Check whether the heap is empty
-FastPriorityQueue.prototype.isEmpty = function(i) {
-    return this.size == 0;
-};
+var defaultcomparator=function(a,b){return a<b};
+function FastPriorityQueue(a){this.array=[],this.size=0,this.compare=a||defaultcomparator}
+FastPriorityQueue.prototype.add=function(a){var b=this.size;for(this.array[this.size++]=a;0<b;){var c=b-1>>1,d=this.array[c];if(!this.compare(a,d))break;this.array[b]=d,b=c}this.array[b]=a};
+FastPriorityQueue.prototype.heapify=function(a){this.array=a,this.size=a.length;for(var b=this.size>>1;0<=b;b--)this._percolateDown(b)};
+FastPriorityQueue.prototype._percolateUp=function(a){for(var b=this.array[a];0<a;){var c=a-1>>1,d=this.array[c];if(!this.compare(b,d))break;this.array[a]=d,a=c}this.array[a]=b};
+FastPriorityQueue.prototype._percolateDown=function(a){for(var b=this.size,c=this.size>>>1,d=this.array[a];a<c;){var e=(a<<1)+1,f=e+1,g=this.array[e];if(f<b&&this.compare(this.array[f],g)&&(e=f,g=this.array[f]),!this.compare(g,d))break;this.array[a]=g,a=e}this.array[a]=d};
+FastPriorityQueue.prototype.peek=function(){return this.array[0]};
+FastPriorityQueue.prototype.poll=function(){var b=this.array[0];return 1<this.size?(this.array[0]=this.array[--this.size],this._percolateDown(0)):0==this.size&&--this.size,b};
+FastPriorityQueue.prototype.trim=function(){this.array=this.array.slice(0,this.size)};
+FastPriorityQueue.prototype.isEmpty=function(){return 0==this.size};