dawg-set/test_dict.js

Javascript directed acyclic word graph (DAWG)

'use strict';
const fs = require('fs')
const readline = require('readline');
const Dawg = require('./dawg').default;
const assert = require('assert');

const build = (file, k) => {
    const lineReader = readline.createInterface({
        input: fs.createReadStream(file)
    });

    let words = []
    lineReader.on('line', line => {
        words.push(line.toLowerCase());
    })
        .on('close', () => {
            words.sort()
            const dawg = Dawg.from(words);
            words.forEach(x => {
                assert.ok(dawg.has(x), x);
            });
            console.log(dawg.count());
            
            const values = new Set(dawg.values());
            const wordSet = new Set(words);
            for (let x of values) {
                if (!wordSet.has(x))
                    console.log(x)
            }console.log(values);
            k(dawg);
        });
};



var DICTIONARY = "/usr/share/dict/words"

build(DICTIONARY, (data) => {
    console.log(data.has('aa'))
    console.log(data.has('abave'));
});