Could this library support customized function as comparator for priority property?

Hey, when I use this in leetcode, the use case is when I want a complicated comparator rather than simply compare by one value:

const biddersQueue = new MaxPriorityQueue({ priority: (bid) => bid.value });
// something i want:
const biddersQueue = new MaxPriorityQueue({ priority: (a,b) =>{  // comparator function} } );

maybe can this library support a comparator function in constructor?

[emreozdincer]

Hi @eyas-ranjous, I feel the same need as @jialihan.

One example is this question. Here, we are required to sort words by frequency, but if the word frequencies of two words are the same, then we need to sort them alphabetically.

For example, this is the initialization in Java:

PriorityQueue<Map.Entry<String, Integer>> pq = new PriorityQueue<>(
                 (a,b) -> a.getValue()==b.getValue() ? b.getKey().compareTo(a.getKey()) : a.getValue()-b.getValue()
        );

Here is a mocked-up implementation of the expected functionality in JS.

Basically, priority number of a single item isn’t enough to decide the result of the comparison - we need to be able to write a custom comparator.

Cheers

[eyas-ranjous]

feature released.

usage: https://github.com/datastructures-js/priority-queue#with-comparator