UNPKG

@datastructures-js/trie

Version:

trie implementation in javascript

github.com/datastructures-js/trie

datastructures-js/trie

79 lines (54 loc) • 1.6 kB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
# Changelog All notable changes to this project will be documented in this file. The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/), and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html). ## [Unreleased] ## [4.2.2] - 2022-08-15 ### Fixed - add types to package.json ## [4.2.1] - 2022-06-06 ### Fixed - readme. ## [4.2.0] - 2021-12-01 ### Added - `isLeaf()` to TrieNode: leaf is a node that has no children. ## [4.2.0] - 2021-12-01 ### Added - `isLeaf()` to TrieNode: leaf is a node that has no children. ### Fixed - `remove(word)` two edge cases that were not covered: 1. the case when removing a word that does not exist, count should not change. 2. the case when another word overlaps with the word being deleted, it was removing all the word chars regardless if one char is an end of another word. **Credit:** 王悠悠 https://github.com/anson09 ## [4.1.1] - 2021-06-20 ### Fixed - index.d.ts ## [4.1.0] - 2021-06-20 ### Added - typescript. ## [4.0.1] - 2021-02-25 ### Fixed - README ## [4.0.0] - 2021-02-23 ### Changed - `.insert` can be chained. - `.remove` now returns the removed word. - better handling for null & undefined. ### Added - `.fromArray` static function to convert a list into a trie. ### Fixed - jsdoc - README ## [3.0.1] - 2020-04-18 ### Fixed - jsdoc - README ## [3.0.0] - 2020-04-09 ### Changed - renamed `.getWordsCount()` & `.getNodesCount()` to `.wordsCount()` & `.nodesCount()`. ### Fixed - README - jsdoc ## [2.0.0] - 2020-03-24 ### Changed - new implementation and interface