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

dtrie

v1.4.2

Published

Trie implementation based on a minimal automaton.

Downloads

9

Vulnerabilities

Powered byPowered by Snyk
  • 0High
  • 0Medium
  • 0Low

Links

Git

Maintainers

mathieumathieu

Keywords

Readme

Node.js trie implementation based on a Minimal Acyclic Finite-State Automata

Node.js trie implementation based on a Minimal Acyclic Finite-State Automata.

Implementation based on "Incremental Construction of Minimal Acyclic Finite-State Automata" by Jan Daciuk, Stoyan Mihov, Bruce W. Watson and Richard E. Watson.

Installation

npm install dtrie

API

Class Node

new Node([id])

  • id: overwrite the generated id

Construct a new node.

node.id

Node's id, unique to each node.

node.letters

Node's transitions.

node.hasChild(letter)

  • letter: transition label

Return true if this node has a child for the given transition.

node.child(letter)

  • letter: transition label

Return the node child.

node.pathExists(path)

  • path: a word to follow

Check if a path exists from this node to a terminal node.

node.isTerminal()

Return true if the current node is a terminal node.

Class Automata

This class is a subclass of Node.

new Automata()

Construct a new automata.

automata.addAll(words)

  • words: an alphabetically sorted list of lowercase words

Populate the automata from an alphabetically sorted list of lowercase words. This method should only be called once per automata.

automata.contains(word)

  • word: the word to lookup

Return true if the automata recognize the given word.

automata.getNumNodes()

Return the number of nodes in the automata.

License

This code is free to use under the terms of the MIT license.