❤
npm
Sign UpSign In

datjs

0.0.1 • Public • Published

DAT.js

This library implements a Double Array Trie (DAT) System in JavaScript. A Double-Array Trie is a structure designed to make the size compact while maintaining fast access with algorithms for retrieval. Read more about it here.

Designed as a library to support my DAT-AC algorithm, this library naturally provides support for the aho-corasick algorithm, but keeps the more traditionally linked list trie when building the double array trie.

Instructions

Node.js

var doublearray = require('datjs');
 
var data = new doublearray(
{
    'redundant': 1,
    'rambunctious': 2,
    'pies': 3,
    'puncture': 4,
    'whistle': 5
 });

Bower.js

var data = new doublearray(
{
    'redundant': 1,
    'rambunctious': 2,
    'pies': 3,
    'puncture': 4,
    'whistle': 5
 });

With Source

var doublearray = require('./dat.js');
var data = new doublearray(
{
    'redundant': 1,
    'rambunctious': 2,
    'pies': 3,
    'puncture': 4,
    'whistle': 5
 });

Usage

Insert Data

data.insert('apples');
data.insert('dudes');

Query Data

trie.contains('redundant);
trie.contains('eggs');

Delete Data

trie.delete('rambunctious);
trie.delete('pies');

Readme

Keywords

Package Sidebar

Install

npm i datjs

Repository

github.com/koreandaniel/DAT.js

Homepage

github.com/koreandaniel/DAT.js#readme

Weekly Downloads

3

Version

0.0.1

License

MIT

Last publish

Collaborators

  • danielkim
Try on RunKit
Report malware