# doublearray

> JavaScript implementation of Double-Array trie

Latest version **0.0.2** (published 2014-09-24) · MIT license · 0 weekly downloads

## Install

```sh
npm install doublearray
pnpm add doublearray
yarn add doublearray
bun add doublearray
```

## Health

**Score 18/100 (F)** — status: abandoned.

Positive: has types package; no vulnerabilities.

Warnings: low downloads; no esm support; pre 1.0.

Negative: abandoned; low maintenance score.

## Facts

| | |
|---|---|
| Version | 0.0.2 |
| Published | 2014-09-24 |
| First published | 2014-06-07 |
| Weekly downloads | 0 |
| License | MIT |
| TypeScript types | separate (@types/doublearray) |
| Module format | CommonJS |
| Dependencies | 0 |
| Known vulnerabilities | 0 |
| Install scripts | no |
| GitHub stars | 23 |
| Author | takuyaa |
| Maintainers | takuyaa |
| Keywords | trie |

## Links

- npm: https://www.npmjs.com/package/doublearray
- Repository: https://github.com/takuyaa/doublearray
- Issues: https://github.com/takuyaa/doublearray/issues
- npm.io page: https://npm.io/package/doublearray

## Recent versions

- 0.0.2 (latest) — 2014-09-24
- 0.0.1 — 2014-06-07

## README

Double-Array
============

JavaScript implementation of Double-Array trie.


Usage
-----

### Build

Node.js example

    var doublearray = require('./doublearray.js');

    var words = [
        { k: 'a', v: 1 },
        { k: 'abc', v: 2 },
        { k: '奈良', v: 3 },
        { k: '奈良先端', v: 4 },
        { k: '奈良先端科学技術大学院大学', v: 5 }
    ];

    var trie = doublearray.builder().build(words);

Browser example

    var words = [
        { k: 'a', v: 1 },
        { k: 'abc', v: 2 },
        { k: '奈良', v: 3 },
        { k: '奈良先端', v: 4 },
        { k: '奈良先端科学技術大学院大学', v: 5 }
    ];

    var trie = doublearray.builder().build(words);


Method chaining

    var trie = doublearray
           .builder()
           .append('a', 1)
           .append('abc', 2)
           .append('奈良', 3)
           .append('奈良先端', 4)
           .append('奈良先端科学技術大学院大学', 5)
           .build();


### Search

    trie.contain('a');  // -> true

    trie.lookup('abc');  // -> 2

    trie.commonPrefixSearch('奈良先端科学技術大学院大学');
    // -> [ { v: 3, k: '奈良' },
    //      { v: 4, k: '奈良先端' },
    //      { v: 5, k: '奈良先端科学技術大学院大学' } ]


### Load

Get BASE or CHECK buffer as Int32Array of typed array

    var base_buffer = trie.bc.getBaseBuffer();
    var check_buffer = trie.bc.getCheckBuffer();

Load and create a new DoubleArray object from original buffers

    var loaded_trie = doublearray.load(base_buffer, check_buffer);


Copyright and license
---------------------

Copyright (c) 2014 Takuya Asano All Rights Reserved.

This software is released under the MIT License.
See LICENSE.txt

---
_Source: https://npm.io/package/doublearray · Machine-readable twin of the npm.io package page. Health data is recomputed on every publish._