npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

score-heap

v0.0.1

Published

A heap optimized for frequent updates.

Downloads

18

Readme

ScoreHeap

A heap optimized for frequent updates. Maintains a sorted list with partitions so only items within a modified partition need to be reindexed. Returns the highest score (int32) in the heap, else null if the heap is empty.

Working Example

import ScoreHeap from 'score-heap';

let objs = [];
let scores = [];

// make a million entries with score = array index
for (let i = 0; i < 1000000; ++i) {

	// this is the source array, the entries can be anything
	objs.push({ i });

	// initial scores will be passed into the new ScoreHeap below (a score must always be an int32)
	scores.push([i, i]);
}

// construct a ScoreHeap with objs scores and a max length
let heap = new ScoreHeap(scores, scores.length);

console.time();

// get the next highest scoring index and remove it, then update the next entry with a random score
// 1M next() + remove() + update() each
for (let i; (i = heap.next()) != null;) {

	heap.remove(i, objs[i].i);

	if (i < objs.length - 1) {
		heap.update(i + 1, Math.floor(Math.random() * objs.length));
	}
}

console.timeEnd();

// ScoreHeap does not care about your underlying data structure.
// Its only purpose is to make retrieving, updating, and removing scored array entries as fast as possible.

Methods

constructor(indexScores, maxLength)

Make a new ScoreHeap.

indexScores An array of [index, score] to build the heap from (score must be an int32) maxLength The length of the underlying (unpassed) source array (must never expand beyond this value)

Returns a new ScoreHeap.

next()

Get the highest scoring index.

Returns the index with the highest score in the heap.

update(index, score)

Update an index in the heap (index does not have to be in the heap yet).

index Index to update (or insert) score Score of the index (must be an int32)

remove(index)

Remove an index from the heap.

index Index to remove

Returns the index passed in if successful, else undefined.

Performance

...

TODO

...

Contributing

Feel free to make changes and submit pull requests whenever.

License

ScoreHeap uses the MIT license.