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

level-trie

v3.0.0

Published

The TRIE data structure and search algorithm, on top of leveldb.

Downloads

44

Readme

level-trie

The TRIE data structure and search algorithm, on top of leveldb.

build status downloads

Usage

Store some words in a trie, then query them:

var level = require('level');
var Trie = require('level-trie');
var db = level(__dirname + '/db');

var trie = new Trie(db);

trie.add('bar');
trie.add('baz');
trie.add('foo');

trie.createSearchStream('fabulous')
  .on('data', console.log);
  // => foo
  // => bar
  // => baz

API

Trie(db)

Create a new Trie that stores its data in db.

If you don't want to use a whole database for the trie, pass in a database's section using level-sublevel.

Trie#add(string[, fn])

Add string to the trie. This causes a batch operation with as many puts as characters in string + 1.

Trie#remove(string[, fn])

Remove string from the trie.

Trie#createSearchStream(string, options)

Create a readable Stream that emits all the strings stored in the trie, ordered by size of the common prefix. Abort reading with stream#end or use the limit option.

Possible options are:

  • limit: Emit max. x entries.
  • follow: Keep the stream open and emit new data that comes in. When used in conjunction with limit the last emitted historical entry will define the border of what a new entry that's emitted needs to fit in, e.g. it mustn't be further away from the search string.

Installation

With npm do:

$ npm install level-trie

License

Copyright (c) 2013 Julian Gruber <[email protected]>

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.