{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/bktrees","name":"bktrees","description":"Burkhard-Keller trees provide an implementation of sets\nwhich apart from the ordinary operations also has an\napproximate member search, allowing you to search for\nelements that are of a certain distance from the element\nyou are searching for.","version":"0.3.1","softwareVersion":"0.3.1","license":"https://spdx.org/licenses/BSD-3-Clause","keywords":["bsd3","data-structures","library","Propose Tags"],"maintainer":[{"@type":"Person","name":"JosefSvenningsson"}],"author":[{"@type":"Person","name":"JosefSvenningsson"}],"copyrightHolder":[{"@type":"Person","name":"JosefSvenningsson"}],"dateCreated":"2007-10-22","dateModified":"2010-11-22","datePublished":"2010-11-22","copyrightYear":2007,"downloadUrl":"https://hackage.haskell.org/package/bktrees-0.3.1/bktrees-0.3.1.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","sameAs":["https://hackage.haskell.org/package/bktrees"]}