ternary_search_tree alternatives and similar shards
Based on the "Algorithms and Data structures" category.
Alternatively, view ternary_search_tree alternatives based on common mentions on social networks and blogs.
Do you think we are missing an alternative of ternary_search_tree or a related project?
Ternary Search Tree - (pure crystal-lang)
In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two. Like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search. However, ternary search trees are more space efficient compared to standard prefix trees, at the cost of speed. Common applications for ternary search trees include spell-checking and auto-completion. (wikipedia)
Furthur considerations from Hackthology
Add this to your application's
dependencies: ternary_search: github: johnjansen/ternary_search
require "ternary_search" tst = TernarySearch::Tree.new # add to the TST tst.insert("polygon") # => nil tst.insert("triangle") # => nil # search the TST tst.search("polygon") # => true tst.search("poly") # => false tst.search("triangle") # => true # get the max word length tst.max_word_length # => 8 # get an array of words in the TST # DO NOT USE THIS ON LARGE TST's # i'm looking into a block version of this! tst.words = ["polygon", "triangle"]
- Fork it ( https://github.com/johnjansen/ternary_search/fork )
- Create your feature branch (git checkout -b my-new-feature)
- Commit your changes (git commit -am 'Add some feature')
- Push to the branch (git push origin my-new-feature)
- Create a new Pull Request