Conversation
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## main #228 +/- ##
=========================================
Coverage 100.00% 100.00%
=========================================
Files 15 15
Lines 1758 1784 +26
=========================================
+ Hits 1758 1784 +26 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Benchmark Results
|
gdalle
left a comment
There was a problem hiding this comment.
I think we can use this opportunity to remove one more big alloc
|
|
||
| # reverse_bfs_orders contains the reverse breadth first (BFS) traversal order for each tree in the forest | ||
| for k in 1:nt | ||
| tree = trees[k] |
There was a problem hiding this comment.
This is the only place where trees is actually used. Right now it is one dictionary per tree, which is still rather wasteful and probably accounts for a large percentage of our allocs. Can we figure out a way to get rid of this too?
There was a problem hiding this comment.
On second thought, let's do it in a separate PR, since this one works
There was a problem hiding this comment.
I started to work on it and it is not a simple task.
No description provided.