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 🙏

© 2026 – Pkg Stats / Ryan Hefner

sats

v0.0.1

Published

Simple Async Tree Scanner

Readme

SATS - Simple Async Tree Scanner

Not always most optimal, but simple to use asynchronous filesystem tree scanner.

Brief

Non-blocking filesystem tree scanner. Allows to easily find files or directorys accross deep directory structure picking for desired patterns or properties.

Always returns a promise resolving with desired data.

Example:

Searching for ".ini" files case insensitive.

    var Tree = require("sats");
    
    Tree.find("/path/to/dir", "*.ini", "i").then(function(files){

        // FIXME: Parent directory names should now be manually discarded.
        //        This will be fixed in a future version (see TODO below).
        files = files.filter(function(f){return f.match(/.+\.ini$/i);});
        
        // Do something with files full path list.

    });

Methods

scan

Recursively scan given path.

Resolves an array of nodes (files and subdirectorys): with the below structure:

    {
        name: "File name",
        path: "Full path (including file name)",
        stat: { /* File stat data */ },
        contents: { /* Subdirectory contents or null in case of regular file. */ },
    }

Syntax

    scan(path, filter, options)

Where...

#####path

Is the full path to the directory to scan.

####filter

Is an (Optional) filtering function, regular expression or string to allow or reject nodes (and its contents in case of directorys) in the tree.

Valid filter types are:

string: File name pattern (with '*' and '?' wilcards allowed). Files should match. Directorys are discarded only if no matchings inside (recursively).

RegExp: Like string, but using regular expression.

function: Function receiving the full node and returning true (to accept) or false (to discard) each node. This is the most powerful option, but you should manually take care of not discarding directorys if you want to recursively match file names even if parent directory names doesn't match.

####options

Additional options like "i" for case insensitive matching in case of RegExp or string (same as RegExp) filter.

find

Just like scan(), but it resolves to flat array with the full path of all results.

Syntax

    find(path, filter, options)

TODO

Enable distinction of display and recursion in filtering function to allow not returning parent directory nodes in find output.

Contributing

If you are interested in contributing with this project, you can do it in many ways:

  • Creating and/or mantainig documentation.

  • Implementing new features or improving code implementation.

  • Reporting bugs and/or fixing it.

  • Sending me any other feedback.

  • Whatever you like...

Please, contact-me, open issues or send pull-requests thought this project GIT repository