Grammalecte  Check-in [2aa4af79ac]

Overview
Comment:[graphspell][js] useless commit: console.log() for debugging
Downloads: Tarball | ZIP archive | SQL archive
Timelines: family | ancestors | descendants | both | trunk | graphspell
Files: files | file ages | folders
SHA3-256: 2aa4af79acb6bd2d13300a6a8d320beb59fcf7e0d7d4edb509fe9f9878acee20
User & Date: olr on 2018-02-09 10:34:21
Original Comment: [fx] lexicon editor: graph debugging
Other Links: manifest | tags
Context
2018-02-09
15:23
[graphspell][py] ibdawg: fix bug in select() check-in: 8142bf4c10 user: olr tags: trunk, graphspell
10:34
[graphspell][js] useless commit: console.log() for debugging check-in: 2aa4af79ac user: olr tags: trunk, graphspell
10:31
[fx] lexicon editor: graph debugging check-in: e7ea319f54 user: olr tags: trunk, fx
Changes

Modified graphspell-js/dawg.js from [38b261de93] to [1d70a20f79].

144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
            }
        }
        this.finish();
        this.countNodes();
        this.countArcs();
        this.sortNodeArcs(dValOccur);
        this.displayInfo();
        //this.writeInfo();
        //this.oRoot.display(0, this.lArcVal, true);
    }

    // BUILD DAWG
    insert (aEntry) {
        if (aEntry < this.aPreviousEntry) {
            throw "Error: Words must be inserted in alphabetical order.";
        }
        
        // find common prefix between word and previous word
        let nCommonPrefix = 0;
        for (let i = 0;  i < Math.min(aEntry.length, this.aPreviousEntry.length);  i++) {
            if (aEntry[i] != this.aPreviousEntry[i]) {
                break;
            }
            nCommonPrefix += 1;







|








|







144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
            }
        }
        this.finish();
        this.countNodes();
        this.countArcs();
        this.sortNodeArcs(dValOccur);
        this.displayInfo();
        this.writeInfo();
        //this.oRoot.display(0, this.lArcVal, true);
    }

    // BUILD DAWG
    insert (aEntry) {
        if (aEntry < this.aPreviousEntry) {
            throw "Error: Words must be inserted in alphabetical order.";
        }
        console.log(aEntry);
        // find common prefix between word and previous word
        let nCommonPrefix = 0;
        for (let i = 0;  i < Math.min(aEntry.length, this.aPreviousEntry.length);  i++) {
            if (aEntry[i] != this.aPreviousEntry[i]) {
                break;
            }
            nCommonPrefix += 1;