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

pim

v0.0.0

Published

Fast persistent immutable data structures

Downloads

75

Readme

pim.js

Fast persistent immutable data structures.

Features

HashMap

Bagwellian hash array-mapped trie, with:

  • Persistence via implicit path-copying / reference-sharing, à la Clojure
  • Lazy sequential operations via standard ES6 Iterator protocol
  • Deep value-equality checking via equals
  • Unrestricted key types
  • Near constant time O(log32n) retrieve and accrete operations
  • Familiar higher-order functions, e.g. filter, map, reduce

History

v0.0.0

Preliminary benchmarks indicate performance gains of 2–7X for accrete-based operations (e.g. create, associate) compared to equivalent ClojureScript operations (via mori.js).

Preliminary V8 heap profiling indicates space efficiency gains for HashMap over a range of approximately 0.5–8.0X, depending on collection size and hash distribution, compared to an identical hash map in cljs/mori.

  • HashMap

Compared to cljs/mori, heap allocation efficiency for HashMap may be expected to regress by some factor less than 2X for certain generational cases, namely those yielded over the course of many association/dissociation operations.

  • The regressive effect described is due to the exclusive definition of a single HashMapNode type which bears a pairwise array of maximum length 64, as opposed to the definition of two distinct classes, BitmapIndexedNode for internal nodes, which bears a max-32 array of nodes, and ArrayNode for terminal nodes, which bears a pairwise max-64 array of key-value pairs.

  • From this distinction it follows that replication of any given HashMapNode then redundantly duplicates the bitmap integers associated with any child nodes. As density increases, node replication may thus incur up to twice the memory cost compared to cljs/mori.

  • It is possible that such regression may be mitigated overall, in part or in whole, as a consequence of the generally shorter trie height that results from storing pairs directly within HashMapNode.

  • This regressive effect is expected, but as yet neither confirmed nor tested.

Likely features for next release
  • Removal / dissociate
  • Derivative structures Vector, Set