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 🙏

© 2025 – Pkg Stats / Ryan Hefner

maplesyrup

v0.0.4

Published

path matching algorithm

Readme

maplesyrup

Requirements

NodeJS v4.3.0

Installation

npm install -g maplesyrup

Usage

maplesyrup < input_file > output_file

Task:

Given a list of patterns and a list paths, for each path find a pattern from the list of patterns that best describes the path.

Solution:

To help us think about the problem, let's give a definition to few things:

  1. Number of paths is N
  2. Number of patterns is M
  3. A path delimiter is one of: forward slash, beginning of line, end of line
  4. A pattern delimiter is one of: comma, beginning of line, end of line
  5. A path segment is a single piece of path that is contained between two path delimiters
  6. A pattern segment is a single piece of pattern that is contained between two path delimiters
  7. A length of pattern or a path is the number of segments they have
  8. Index of a segment is its position from left to right
  9. Avarage length of a path is K
  10. Average length of a pattern is P

Let's also assume that in order for a pattern to match a path:

  1. They must have the same length
  2. Each segment of a path must match a segment of a pattern of the same index

The obvious way

We have to check each path against each pattern which gives us O(N * M) or more precisely O(N * K * M).

Using a tree

Using a tree allows us to minimize number of possible matches for each consecutive segment.

  1. Construct a pattern tree in O(M * log(M * P)).
  2. Traverse the tree once for each path in O(N * K * log(M))

Further optimizations

It might be possible to further optimize the algorithm by comparing the size of N and M. For example, for a really large M and small N it would be faster to skip the tree construction.

Notes

  • Referencing children using a hashmap inside the pattern tree plays a big role in performance gains. It allows us to not enumerate through all the patterns and instead only look at the ones with matching segments.

  • To learn about a specific term, open the corresponding file in lib. For example, a path is defined in ./lib/path.js

  • Next step for this project is to create automated unit tests.