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

trie-mapping

v4.0.0

Published

A compact trie for mapping keys to values

Downloads

203

Readme

trie-mapping

A compact trie for mapping keys to values

Installing

npm install trie-mapping

API

The API is map-like, that is, it mimics the native Map, with the following differences:

  • It exports a factory function (trieMapping()) instead of a constructor, which may be initialized from a trie node object
  • It exposes the root trie node through the root getter, so that it can be traversed directly (for example, for prefix-based searches) or serialized
  • The keys of the trie must be strings
  • Iteration is done in alphabetical order instead of in insertion order

trieMapping(iterable)

Creates a new Trie object.

import trieMapping from "trie-mapping";

// Create an empty trie
trieMapping();

// Initialize from an array
trieMapping([
  ["hey", 0],
  ["hi", 1],
]);

// Initialize from a trie node object
trieMapping({
  h: {
    ey: { "": 0 },
    i: { "": 1 },
  },
});

root

The root TrieNode object of the Trie object.

import trieMapping from "trie-mapping";

trieMapping([
  ["he", 1],
  ["hey", 5],
  ["hells", 4],
  ["hello", 3],
  ["hell", 2],
  ["bye", 0],
]).root;
// =>
// {
//   he: {
//     "": 1,
//     y: { "": 5 },
//     ll: {
//       s: { "": 4 },
//       o: { "": 3 },
//       "": 2
//     }
//   },
//   bye: { "": 0 }
// }

size

Returns the number of key-value pairs in the Trie object.

clear()

Removes all key-value pairs from the Trie object.

delete(key)

Returns true if an element in the Trie object existed and has been removed, or false if the element does not exist. trie.has(key) will return false afterwards.

entries()

Returns a new Iterator object that contains a two-member array of [key, value] for each element in the Trie object in alphabetical order.

forEach(callbackfn, thisArg)

Calls callbackFn once for each key-value pair present in the Trie object, in alphabetical order. If a thisArg parameter is provided to forEach, it will be used as the this value for each callback.

get(key)

Returns the value associated to the passed key, or undefined if there is none.

has(key)

Returns a boolean indicating whether a value has been associated with the passed key in the Trie object or not.

keys()

Returns a new Iterator object that contains the keys for each element in the Trie object in alphabetical order.

set(key, value)

Sets the value for the passed key in the Trie object. Returns the Trie object.

values()

Returns a new Iterator object that contains the values for each element in the Trie object in alphabetical order.

[Symbol.iterator]()

Returns a new Iterator object that contains a two-member array of [key, value] for each element in the Trie object in alphabetical order.