CharlieWL
CharlieWL
Thanks for participating in the XGBoost community! We use https://discuss.xgboost.ai for any general usage questions and discussions. The issue tracker is used for actionable items such as feature proposals discussion,...
https://online-cv.webjeda.com/ shows no details under education even though the code has?
I enjoy parlay so much that I want to integrate it with my own linear memory allocator. For that to work, I need a function like `tbb::this_task_arena::current_thread_index()` that returns the...
It seems in the documentation for `histogram_by_index()`, "Every element in r must be at most `m`" should be "Every element in r must be at most `m - 1`" where...
Hi parlay maintainers, there seems to be an evasive bug in the integration of parlay and TBB that took me a painful amount of time to catch. The following is...
This could be a C++ skill issue. In order to skip default initialization, I added the following member function inside `struct allocator` in `alloc.h`: ``` template void construct(U* ptr, Args&&......
`parlay::sequence` constructor much slower than reserve + fill, and both slower than `std::vector`
The following code measures 1. Time for creating `parlay::sequence` via reserve + fill and the number of distinct buffers allocated in 100000 iterations of a parallel for loop. 2. Time...
Is there a way to reduce the compile time when using Parlay? I know it's a template-heavy library, and there's no simple solution, but I'm curious if there's anything I...
log2_up
This is not an issue but more of a remark. The `` library in C++20 contains `std::bit_width()`, which by my testing is at least 1.6x faster than `log2_up` in `utilities.h`....