Basic Queue in TypeScript

/**

* @class

* Class representing an Item in a Queue

*/

class Item {

constructor(v) {

this.v = v;

this.n = null;

}

val() {

return this.v;

}

setNext(i) {

this.n = i;

}

next() {

return this.n;

}

}

/**

* @class

* Class representing a Queue

*

* This is a basic linked list impelementation for a FIFO queue.

*/

class Queue {

constructor(item) {

if (undefined == item) {

this.items = 0;

this.start = null;

this.end = null;

this.item = null;

return;

}

this.items = 1;

this.item = item;

this.start = item;

this.end = item;

}

add(item) {

if (this.items == 0) {

this.items = 1;

this.item = item;

this.start = item;

this.end = item;

} else {

this.items++;

let tail = this.end;

tail.setNext(item);

this.end = item;

}

}

pop() {

let item = this.start;

if (null != item.next()) {

this.start = item.next();

}

this.items--;

return item;

}

}

Min Priority Queue in TypeScript

/**

* @class

* Class representing a min/max PriorityQueue

*

* The default is a minPriorityQueue if no value is used in the constructor.

* If you want a maxPriorityQueue, pass true in the constructor e.g.

*

* let maxPQ = new PriorityQueue(true);

* let minPQ = new PriorityQueue();

*

* AppsScripts won't let you define private methods, so here are the public methds

*

* add(v {int}) // adds a new value into the queue

* contains(v {int}) // returns true if the queue contains the value

* isEmpty() {bool} // returns true if there are no ints in the queue

* pop() {int} // returns the min/max value in the queue

*

*/

class PriorityQueue {

constructor(isMax) {

if (undefined == isMax || null == isMax || false == isMax) {

this.isMax = false;

} else {

this.isMax = true;

}

this.heap = [];

this.index = new Map();

this.size = this.heap.length;

}

contains(v) {

return this.index.has(v);

}

exch(i, j) {

let t = this.heap[i];

this.heap[i] = this.heap[j];

this.index.set(t, j);

this.index.set(this.heap[j], i);

this.heap[j] = t;

}

add(v) {

if (this.contains(v)) return;

this.size++;

this.heap[this.size] = v;

this.swim(this.size);

this.index.set(v, this.size);

}

isEmpty() {

return this.size == 0;

}

length() {

return this.size;

}

less(i, j) {

if (this.isMax) {

return this.heap[i] < this.heap[j];

}

return this.heap[i] > this.heap[j];

}

pop() {

let max = this.heap[1];

this.exch(1, this.size--);

this.heap.pop();

this.sink(1);

return max;

}

sink(n) {

while (n*2 <= this.size) {

let j = n*2;

if (j < this.size && this.less(j, j+1)) j++;

if (!this.less(n, j)) break;

this.exch(n, j);

n = j;

}

}

swim(n) {

while (n > 1 && this.less(Math.floor(n/2), n)) {

this.exch(Math.floor(n/2), n);

n = Math.floor(n/2);

}

}

}

function testArray() {

console.log("Testing a min PQ.");

let t = new PriorityQueue(false);

console.log("Inserting 7, 5, 9, 3, 10, 1");

t.add(7);

t.add(5);

t.add(9);

t.add(7);

t.add(3);

t.add(10);

t.add(1);

console.log(`Does the queue contain 5? : ${t.contains(5)}`);

console.log(`Does the queue contain 3? : ${t.contains(3)}`);

let incr = 0;

let output = "";

while (!t.isEmpty() && incr++ < 10)

output += `${t.pop()} `;

console.log(`Output: ${output}`);

console.log("Testing a max PQ.");

console.log("Inserting 7, 5, 9, 3, 10, 1");

output = "";

t = new PriorityQueue(true);

t.add(7);

t.add(5);

t.add(9);

t.add(3);

t.add(10);

t.add(1);

console.log(`Does the queue contain 5? : ${t.contains(5)}`);

console.log(`Does the queue contain 3? : ${t.contains(3)}`);

incr = 0;

while (!t.isEmpty() && incr++ < 10)

output += `${t.pop()} `;

console.log(`Output: ${output}`);

}

Updating your expired GPG keys

 If you ever need to update your expired gpg keys, it's not terrible. First thing to do is to figure out which key you're working with, use

$> gpg --list-keys

Which should show you something like this

-----------------------------

pub   rsa3072 2020-12-29 [SC] [expired: 2024-12-31]

      09CF4ABCD7487EF21E9AFC859B4CE836EAAF3E31

uid   [ expired] Russell Simpkins <russellsimpkins@gmail.com>

Then you can edit the key using the ID

$> gpg --edit-key 09CF4ABCD7487EF21E9AFC859B4CE836EAAF3E31

gpg (GnuPG) 2.2.19; Copyright (C) 2019 Free Software Foundation, Inc.

This is free software: you are free to change and redistribute it.

There is NO WARRANTY, to the extent permitted by law.

Secret key is available.

sec  rsa3072/9B4CE836EAAF3E31

     created: 2020-12-29  expires: 2026-01-02  usage: SC

     trust: ultimate      validity: ultimate

ssb  rsa3072/CC533814855BD92B

     created: 2020-12-29  expired: 2024-12-31  usage: E

[ultimate] (1). Russell Simpkins <russellsimpkins@gmail.com>

To change or update the expiration time, type the following

$> expire

It will prompt you to choose, I like to update mine yearly but you can pick whatever option you want. If you have a sub key like I do, then you will want to update that as well. Just pick the key using the following command

$> key 1

gpg> key 1

sec  rsa3072/9B4CE836EAAF3E31

     created: 2020-12-29  expires: 2026-01-02  usage: SC

     trust: ultimate      validity: ultimate

ssb* rsa3072/CC533814855BD92B

     created: 2020-12-29  expired: 2024-12-31  usage: E

[ultimate] (1). Russell Simpkins <russellsimpkins@gmail.com>

Notice that ssb has an asterisks next to it, that's how you know you're editing the sub key. Follow the same and type "expire" to set it's expiration date. That's it. Type "quit" to exit.