Merge: lib/trees: introduce BKTree
authorJean Privat <jean@pryen.org>
Wed, 20 Jun 2018 18:59:11 +0000 (14:59 -0400)
committerJean Privat <jean@pryen.org>
Wed, 20 Jun 2018 18:59:11 +0000 (14:59 -0400)
This PR introduces a new kind of tree: the BKTree.

This data structure can be used to speed-up the comparison of a string and a collection of strings with Levenshtein distance.

See https://dl.acm.org/citation.cfm?id=362003.362025 for more details.

Pull-Request: #2718


Trivial merge