-
Hi! I was thinking about contributing to this package. I'm interested in B-trees. I saw they were also mentioned in previous issues and topics on julia-dev. Please let me know if you would like to hav…
-
Dendropy provides a means for writing trees to, e.g., nexus. It would be good for us to be able to use this to write trees with:
1. Ancestral taxon labels
2. Any data associated with those taxa (pro…
-
Currently, when we keep keys in parent pages of B-Tree we always keep full keys. But in reality, we do not need it.
Let suppose that we filled a page of B-Tree and need to split it. So we will cho…
-
### Required prerequisites
- [X] I have searched the [Issue Tracker](https://github.com/metaopt/optree/issues) that this hasn't already been reported. (comment there if it has.)
### Motivation
…
-
Currently the `Node` class used for `ImmutableList` includes 40 bytes of overhead per list element on X64, and 24 bytes of overhead on X86. This means the memory cost of using this data structure for …
-
## Description
I need to use the init_score to provide a prior model but I'm seeing some behaviour I don't understand.
**Setup**
- build a cv model with 20 trees
- build a second cv model with 80 …
-
### Bug description
We have a collection called "resources" and in the blueprints directory, under collections > resources, we have 3 .yaml files in here.
For example:
`resource_a.yaml`
`resourc…
-
1. Each database as two btrees, not one, the by_id and the by_seq
2. It does not preserve most of the properties of btrees, in particular lower and upper bounds on branching are not maintained. This i…
-
Counted b-trees means that we keep a count for every page, but the user will have to pay for the count, it will be calculated.
When we open a b-tree, we visit all of the leaf pages. All of them. Howe…
-
### Proposal
A Tree Chart is basically how we visualize trees as a data structure, where we have a root node and we have multiple children expanding from the top.
### Use Cases
Create Trees exa…