binary_decision_tree
Advanced tools
A binary tree designed to record decisions based on child nodes. This data structure is useful in things like single elimination tournaments. They can be marshalled and unmarshalled to two numbers.
Add this line to your application's Gemfile:
gem 'binary_decision_tree'
And then execute:
$ bundle
Or install it yourself as:
$ gem install binary_decision_tree
This tree assumes a fix depth and fully populated (dense, not sparse.) It provides some nice properties around calulating parent and child node IDs based on the current node ID.
git checkout -b my-new-feature)git commit -am 'Add some feature')git push origin my-new-feature)FAQs
Unknown package
We found that binary_decision_tree demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Research
The Socket Research Team breaks down a malicious wrapper package that uses obfuscation to harvest credentials and exfiltrate sensitive data.
Research
Security News
Attackers used a malicious npm package typosquatting a popular ESLint plugin to steal sensitive data, execute commands, and exploit developer systems.
Security News
The Ultralytics' PyPI Package was compromised four times in one weekend through GitHub Actions cache poisoning and failure to rotate previously compromised API tokens.