FM / internal

/var/www/qr4y.gr/server/delivery/node_modules/async/internal/

/var/www/qr4y.gr/server/delivery/node_modules/async/internal

Name	Size	Mode	Actions
applyEach.js	786	0644	edit dl rm
asyncEachOfLimit.js	1979	0644	edit dl rm
awaitify.js	796	0644	edit dl rm
breakLoop.js	255	0644	edit dl rm
consoleFunc.js	922	0644	edit dl rm
createTester.js	1231	0644	edit dl rm
DoublyLinkedList.js	2285	0644	edit dl rm
eachOfLimit.js	2641	0644	edit dl rm
filter.js	1623	0644	edit dl rm
getIterator.js	220	0644	edit dl rm
Heap.js	2500	0644	edit dl rm
initialParams.js	292	0644	edit dl rm
isArrayLike.js	282	0644	edit dl rm
iterator.js	1463	0644	edit dl rm
map.js	764	0644	edit dl rm
once.js	365	0644	edit dl rm
onlyOnce.js	363	0644	edit dl rm
parallel.js	965	0644	edit dl rm
promiseCallback.js	532	0644	edit dl rm
queue.js	8525	0644	edit dl rm
range.js	273	0644	edit dl rm
reject.js	698	0644	edit dl rm
setImmediate.js	857	0644	edit dl rm
withoutIndex.js	254	0644	edit dl rm
wrapAsync.js	955	0644	edit dl rm

Edit: /var/www/qr4y.gr/server/delivery/node_modules/async/internal/DoublyLinkedList.js (2285B)

"use strict";

Object.defineProperty(exports, "__esModule", {
    value: true
});
// Simple doubly linked list (https://en.wikipedia.org/wiki/Doubly_linked_list) implementation
// used for queues. This implementation assumes that the node provided by the user can be modified
// to adjust the next and last properties. We implement only the minimal functionality
// for queue support.
class DLL {
    constructor() {
        this.head = this.tail = null;
        this.length = 0;
    }

removeLink(node) {
        if (node.prev) node.prev.next = node.next;else this.head = node.next;
        if (node.next) node.next.prev = node.prev;else this.tail = node.prev;

node.prev = node.next = null;
        this.length -= 1;
        return node;
    }

empty() {
        while (this.head) this.shift();
        return this;
    }

insertAfter(node, newNode) {
        newNode.prev = node;
        newNode.next = node.next;
        if (node.next) node.next.prev = newNode;else this.tail = newNode;
        node.next = newNode;
        this.length += 1;
    }

insertBefore(node, newNode) {
        newNode.prev = node.prev;
        newNode.next = node;
        if (node.prev) node.prev.next = newNode;else this.head = newNode;
        node.prev = newNode;
        this.length += 1;
    }

unshift(node) {
        if (this.head) this.insertBefore(this.head, node);else setInitial(this, node);
    }

push(node) {
        if (this.tail) this.insertAfter(this.tail, node);else setInitial(this, node);
    }

shift() {
        return this.head && this.removeLink(this.head);
    }

pop() {
        return this.tail && this.removeLink(this.tail);
    }

toArray() {
        return [...this];
    }

*[Symbol.iterator]() {
        var cur = this.head;
        while (cur) {
            yield cur.data;
            cur = cur.next;
        }
    }

remove(testFn) {
        var curr = this.head;
        while (curr) {
            var { next } = curr;
            if (testFn(curr)) {
                this.removeLink(curr);
            }
            curr = next;
        }
        return this;
    }
}

exports.default = DLL;
function setInitial(dll, node) {
    dll.length = 1;
    dll.head = dll.tail = node;
}
module.exports = exports["default"];

"use strict"; Object.defineProperty(exports, "__esModule", { value: true }); // Simple doubly linked list (https://en.wikipedia.org/wiki/Doubly_linked_list) implementation // used for queues. This implementation assumes that the node provided by the user can be modified // to adjust the next and last properties. We implement only the minimal functionality // for queue support. class DLL { constructor() { this.head = this.tail = null; this.length = 0; } removeLink(node) { if (node.prev) node.prev.next = node.next;else this.head = node.next; if (node.next) node.next.prev = node.prev;else this.tail = node.prev; node.prev = node.next = null; this.length -= 1; return node; } empty() { while (this.head) this.shift(); return this; } insertAfter(node, newNode) { newNode.prev = node; newNode.next = node.next; if (node.next) node.next.prev = newNode;else this.tail = newNode; node.next = newNode; this.length += 1; } insertBefore(node, newNode) { newNode.prev = node.prev; newNode.next = node; if (node.prev) node.prev.next = newNode;else this.head = newNode; node.prev = newNode; this.length += 1; } unshift(node) { if (this.head) this.insertBefore(this.head, node);else setInitial(this, node); } push(node) { if (this.tail) this.insertAfter(this.tail, node);else setInitial(this, node); } shift() { return this.head && this.removeLink(this.head); } pop() { return this.tail && this.removeLink(this.tail); } toArray() { return [...this]; } *[Symbol.iterator]() { var cur = this.head; while (cur) { yield cur.data; cur = cur.next; } } remove(testFn) { var curr = this.head; while (curr) { var { next } = curr; if (testFn(curr)) { this.removeLink(curr); } curr = next; } return this; } } exports.default = DLL; function setInitial(dll, node) { dll.length = 1; dll.head = dll.tail = node; } module.exports = exports["default"];