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

tril

v0.1.0

Published

A bare-bones in-memory database. **417 bytes gzipped.**

Readme

tril

A bare-bones in-memory database. 417 bytes gzipped.

Usage

An item in the database can have any properties at all, as long as there is a facets property defined and it's an object.

Each facet on the facets object should be an array of values, which can be anything that can be strictly compared e.g. a === b or {} === {}, etc. They could be values that point to entirely separate data structures 🤔

import tril from 'tril'

const db = tril([
  {
    name: 'Item One',
    facets: {
      foo: [
        'one',
        'two'
      ],
      bar: [
        'one',
        'two'
      ],
      baz: [
        'one',
        'two'
      ]
    }
  },
  {
    name: 'Item Two',
    facets: {
      foo: [
        'two',
        'three'
      ],
      bar: [
        'two',
        'three'
      ],
      baz: [
        'two',
        'three'
      ]
    }
  },
  {
    name: 'Item Three',
    facets: {
      foo: [
        'three',
        'four'
      ],
      bar: [
        'three',
        'four'
      ],
      baz: [
        'three',
        'four'
      ]
    }
  }
])

Querying

The facets defined on database entries are used to create methods of the same name. Then, pass a facet value or array of facet values to each method to filter the database.

const query = db.foo('two').bar([ 'two' ])

Then, access the filtered entries:

query.items // => [{ name: 'Item Two' }]

Queries can also be extended:

query.baz('three')

Adjusting Deviation

By default, all declared filters must match the facets defined on the returned items. Optionally, you can adjust this by setting the devation property to a positive integer corresponding to the number of misses allowed by the search operation.

You can set this value on the database itself:

db.deviation = 0
db.foo(['two', 'three']).items // => [{ name: 'Item Two' }]
db.deviation = 1
db.foo(['two', 'three']).items // => [{ name: 'Item Item' }, { name: 'Item Two' }, { name: 'Item Three' }]

Or on an intermediary value:

const query = db.foo('two')
query.deviation = 1
query.baz('three').items // => [{ name: 'Item Item' }, { name: 'Item Two' }, { name: 'Item Three' }]

Benchmarks

Would loooove some help here.

MIT