Trie. A fast word-lookup tool that organizes dictionaries for quick searches.

github.com/jeresig/trie-js

Problem

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Audience

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Market

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Pricing

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Vaya's read on this project

Problem, audience, market, and the verdict — sign in to see it.

Updates

May 2016

Merge pull request #8 from benox3/master May 10
Sort `words` before building trie May 10

May 2014

Merge pull request #7 from joybro/master May 11
Fix finding repeated word bug May 11

March 2011

Change the ORD() function to an object for faster lookups, based upon… Mar 23
Add a simple test for checking the lookup time of a Succinctly-stored… Mar 22
Add in tests for succinct trie and binary search string. Mar 22
Update to Benchmark.js 0.1.348. Mar 18
Mention the blog post on JavaScript Trie Performance Analysis in the … Mar 18
Rewrite tests to use Benchmark.js. Add the while(true){} loops back i… Mar 18
Use Benchmark.js for performance testing. Mar 17
Fix rogue endline that snuck through the build process. Mar 17
Make sure that JavaScript reserved words are quoted and add a test fo… Mar 17
Pulling in the initial work and tests. Mar 16