* @brief Traverse the top levels of the tree for the entire block_size. * * In the array layout, it is organized to guarantee that if a node at

* @brief Record a page with size of n_bytes. */

* @brief Receive data, without error then all data should be received. */

! \brief same as add, reduce is used in All Reduce */

Reduce following bins (begin, end] for nid-node in dst across threads

* @brief Reset the builder, should be called before growing a new tree. * * @param total_bins Total number of bins across all features

! * \brief Reset storage binding and clear logical size. */

Return the index of a cut point that is strictly greater than the input value, or the last available index if none exists

* @brief Send data, without error then all data should be sent. */

set the offset used in compression, cut_ptrs is the CSC indptr in HistogramCuts

! * \brief set the left child * \param nid node id to right child */

! * \brief set the right child * \param nid node id to right child */

! * \brief set split condition of current node * \param split_index feature index to split * \param split_cond split condition *

* \brief Setting up the selector state prior to looping through features. * * \param ctx The booster context. * \param model The model.

The number of pages in the cache.

! * \brief Compute Subtraction: dst = src1 - src2 in range [begin, end) */

alternatively: `nvidia-smi -q | grep Addressing`