Gecko [ gandhischool.edu.np ]

Name	Size	Permission
DoublyLinkedList.js	2.23 KB	-rw-rw-rw-
Heap.js	2.44 KB	-rw-rw-rw-
applyEach.js	783 B	-rw-rw-rw-
asyncEachOfLimit.js	1.93 KB	-rw-rw-rw-
awaitify.js	816 B	-rw-rw-rw-
breakLoop.js	254 B	-rw-rw-rw-
consoleFunc.js	919 B	-rw-rw-rw-
createTester.js	1.2 KB	-rw-rw-rw-
eachOfLimit.js	2.58 KB	-rw-rw-rw-
filter.js	1.58 KB	-rw-rw-rw-
getIterator.js	217 B	-rw-rw-rw-
initialParams.js	289 B	-rw-rw-rw-
isArrayLike.js	279 B	-rw-rw-rw-
iterator.js	1.43 KB	-rw-rw-rw-
map.js	761 B	-rw-rw-rw-
once.js	362 B	-rw-rw-rw-
onlyOnce.js	360 B	-rw-rw-rw-
parallel.js	962 B	-rw-rw-rw-
promiseCallback.js	532 B	-rw-rw-rw-
queue.js	8.32 KB	-rw-rw-rw-
range.js	270 B	-rw-rw-rw-
reject.js	695 B	-rw-rw-rw-
setImmediate.js	857 B	-rw-rw-rw-
withoutIndex.js	251 B	-rw-rw-rw-
wrapAsync.js	955 B	-rw-rw-rw-

Code Editor : DoublyLinkedList.js

"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;

${this.title}

Code Editor : DoublyLinkedList.js