Geforce File Manager

NAME	SIZE	ACTIONS
📁 handlebars		[ DEL ]
📁 jszip		[ DEL ]
📁 serialize-json		[ DEL ]
📁 sortable		[ DEL ]
📄 blockUI-4-4-1.min.js	627 B	[ EDIT ] \| [ DEL ]
📄 blockUI-4-5-1.min.js	627 B	[ EDIT ] \| [ DEL ]
📄 blockUI.js	1,251 B	[ EDIT ] \| [ DEL ]
📄 cache-4-4-1.min.js	8,147 B	[ EDIT ] \| [ DEL ]
📄 cache-4-5-1.min.js	8,222 B	[ EDIT ] \| [ DEL ]
📄 cache.js	15,654 B	[ EDIT ] \| [ DEL ]
📄 delay-js-4-4-1.min.js	1,188 B	[ EDIT ] \| [ DEL ]
📄 delay-js-4-5-1.min.js	1,188 B	[ EDIT ] \| [ DEL ]
📄 delay-js.js	5,519 B	[ EDIT ] \| [ DEL ]
📄 heartbeat-4-4-1.min.js	2,848 B	[ EDIT ] \| [ DEL ]
📄 heartbeat-4-5-1.min.js	2,848 B	[ EDIT ] \| [ DEL ]
📄 heartbeat.js	7,703 B	[ EDIT ] \| [ DEL ]
📄 loadAsync-4-4-1.min.js	304 B	[ EDIT ] \| [ DEL ]
📄 loadAsync-4-5-1.min.js	304 B	[ EDIT ] \| [ DEL ]
📄 loadAsync.js	670 B	[ EDIT ] \| [ DEL ]
📄 loadCSS-4-4-1.min.js	818 B	[ EDIT ] \| [ DEL ]
📄 loadCSS-4-5-1.min.js	818 B	[ EDIT ] \| [ DEL ]
📄 loadCSS.js	3,119 B	[ EDIT ] \| [ DEL ]
📄 minify-4-4-1.min.js	12,171 B	[ EDIT ] \| [ DEL ]
📄 minify-4-5-1.min.js	12,832 B	[ EDIT ] \| [ DEL ]
📄 minify.js	23,589 B	[ EDIT ] \| [ DEL ]
📄 modal-4-4-1.min.js	1,159 B	[ EDIT ] \| [ DEL ]
📄 modal-4-5-1.min.js	1,159 B	[ EDIT ] \| [ DEL ]
📄 modal.js	2,348 B	[ EDIT ] \| [ DEL ]
📄 queue-4-4-1.min.js	698 B	[ EDIT ] \| [ DEL ]
📄 queue-4-5-1.min.js	698 B	[ EDIT ] \| [ DEL ]
📄 queue.js	3,653 B	[ EDIT ] \| [ DEL ]
📄 send-command-4-4-1.min.js	2,641 B	[ EDIT ] \| [ DEL ]
📄 send-command-4-5-1.min.js	2,641 B	[ EDIT ] \| [ DEL ]
📄 send-command.js	6,019 B	[ EDIT ] \| [ DEL ]
📄 status-4-4-1.min.js	3,702 B	[ EDIT ] \| [ DEL ]
📄 status-4-5-1.min.js	3,702 B	[ EDIT ] \| [ DEL ]
📄 status.js	7,187 B	[ EDIT ] \| [ DEL ]
📄 wpo-images-view-4-4-1.min.js	7,510 B	[ EDIT ] \| [ DEL ]
📄 wpo-images-view-4-5-1.min.js	7,510 B	[ EDIT ] \| [ DEL ]
📄 wpo-images-view.js	15,954 B	[ EDIT ] \| [ DEL ]
📄 wpoadmin-4-4-1.min.js	38,443 B	[ EDIT ] \| [ DEL ]
📄 wpoadmin-4-5-1.min.js	38,699 B	[ EDIT ] \| [ DEL ]
📄 wpoadmin.js	78,242 B	[ EDIT ] \| [ DEL ]
📄 wposmush-4-4-1.min.js	23,605 B	[ EDIT ] \| [ DEL ]
📄 wposmush-4-5-1.min.js	23,638 B	[ EDIT ] \| [ DEL ]
📄 wposmush.js	46,944 B	[ EDIT ] \| [ DEL ]

[ CLOSE ]

EDIT: queue.js

/**
Adapted and extended from the work of Stephen Morley - http://code.stephenmorley.org/javascript/queues/

Queue.js

A function to represent a queue

Created by Stephen Morley - http://code.stephenmorley.org/ - and released under
the terms of the CC0 1.0 Universal legal code:

http://creativecommons.org/publicdomain/zero/1.0/legalcode
 */

/**
 * Creates a new queue. A queue is a first-in-first-out (FIFO) data structure -
 * items are added to the end of the queue and removed from the front.
 *
 * @return {void}
 */
function Updraft_Queue() {

// Initialise the queue and offset.
	var queue  = [];
	var offset = 0;
	var locked = false;

/**
	* Returns the length of the queue.
	*
	* @returns {number} - the length of the queue
	*/
	this.get_length = function () {
		return (queue.length - offset);
	}

/**
	* Query whether the queue is empty or not
	*
	* @returns {boolean} - returns true if the queue is empty, and false otherwise.
	*/
	this.is_empty = function () {
		return (queue.length == 0);
	}

/**
	 * Enqueues the specified item. The parameter is:
	 *
	 * @param {*} item The item to enqueue
	 *
	 * @return {void}
	 */
	this.enqueue = function (item) {
		queue.push(item);
	}
	
	/**
	 * Returns the queue lock status
	 *
	 * @returns {boolean} - whether the queue is locked or not
	 */
	this.is_locked = function () {
		return locked;
	}
	
	/**
	 * Attempt to get the queue lock
	 *
	 * @returns {boolean} - whether the attempt succeeded or not
	 */
	this.get_lock = function () {
		if (locked) { return false; }
		this.lock();
		return true;
	}

/**
	* Dequeues an item and returns it. If the queue is empty, the value
	* 'undefined' is returned.
	*
	* @returns {*} - returns and removes the item at the front of the queue, or undefined if the queue is empty
	*/
	this.dequeue = function () {

// If the queue is empty, return immediately.
		if (queue.length == 0) return undefined;

// Store the item at the front of the queue.
		var item = queue[offset];

// Increment the offset and remove the free space if necessary.
		if ((++offset * 2) >= queue.length) {
			queue  = queue.slice(offset);
			offset = 0;
		}

// Return the dequeued item.
		return item;
	}

/**
	 * Lock the queue
	 *
	 * @returns {void}
	 */
	this.lock = function () {
		locked = true;
	}
	
	/**
	 * Unlock the queue
	 *
	 * @returns {void}
	 */
	this.unlock = function () {
		locked = false;
	}
	
	/**
	* Returns the item at the front of the queue (without dequeuing it). If the
	* queue is empty then undefined is returned.
	*
	* @returns {*} - returns the item at the front of the queue, or undefined if the queue is empty
	*/
	this.peek = function () {
		return (queue.length > 0 ? queue[offset] : undefined);
	}
	
	/**
	 * Replaces the item at the front of the queue (if any)
	 *
	 * @param {*} item       The item to put at the front of the queue.
	 *
	 * @return {boolean}      Whether or not the item was successfully replaced.
	 */
	this.replace_front = function (item) {
		if (queue.length < 1) { return false; }
		queue[offset] = item;
		return true;
	}

/**
	 * Checks if any queue object/element contains the ID
	 *
	 * @param {string} id       The ID to search for.
	 *
	 * @return {boolean}      Whether any queue object/element contains the ID.
	 */
	this.contains_id = function (id) {
		return queue.slice(offset).some(function (ele) {
			return ele && typeof ele === 'object' && ele.optimization_id === id;
		});
	}
	
	/**
	 * Returns a copy of all items currently in the queue.
	 *
	 * @returns {Array} - An array of all current items in the queue.
	 */
	this.get_all_items = function () {
		return queue.slice(offset);
	}

}