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

chunky-trees

v1.2.3

Published

Implementation of [peer-to-peer b-trees](https://0fps.net/2020/12/19/peer-to-peer-ordered-search-indexes/) which are [prolly trees](https://www.dolthub.com/blog/2020-04-01-how-dolt-stores-table-data/) as used in dolt and noms.

Downloads

8

Readme

Chunky Trees

Implementation of peer-to-peer b-trees which are prolly trees as used in dolt and noms.

While this library has 100% test coverage and is relatively stable, it's not recommended for broad use. The implementation internals are all very exposed and have not been properly documented. Without thorough documentation there's a lot of mistakes consumers will make regarding caching and block storage.

Some time in the near future I will fully document the library.

Notes

ranges

Range queries match >= the start key and < the end key.

In other words, ranges do not include matches against the end key but do match against the start key. This is so that more advanced range queries can be built with only appending to keys rather than needing to do more advanced key modifications to reduce the closing match.