Last updated on 2025-10-24 18:49:57 CEST.
| Flavor | Version | Tinstall | Tcheck | Ttotal | Status | Flags |
|---|---|---|---|---|---|---|
| r-devel-linux-x86_64-debian-clang | 0.3.3 | 7.08 | 73.74 | 80.82 | NOTE | |
| r-devel-linux-x86_64-debian-gcc | 0.3.3 | 5.39 | 56.59 | 61.98 | NOTE | |
| r-devel-linux-x86_64-fedora-clang | 0.3.3 | 18.00 | 105.68 | 123.68 | NOTE | |
| r-devel-linux-x86_64-fedora-gcc | 0.3.3 | 14.00 | 114.89 | 128.89 | NOTE | |
| r-devel-windows-x86_64 | 0.3.3 | 8.00 | 162.00 | 170.00 | NOTE | |
| r-patched-linux-x86_64 | 0.3.3 | 6.05 | 70.46 | 76.51 | NOTE | |
| r-release-linux-x86_64 | 0.3.3 | 7.05 | 70.77 | 77.82 | NOTE | |
| r-release-macos-arm64 | 0.3.3 | 4.00 | 63.00 | 67.00 | NOTE | |
| r-release-macos-x86_64 | 0.3.3 | 7.00 | 85.00 | 92.00 | NOTE | |
| r-release-windows-x86_64 | 0.3.3 | 8.00 | 128.00 | 136.00 | NOTE | |
| r-oldrel-macos-arm64 | 0.3.3 | 3.00 | 39.00 | 42.00 | NOTE | |
| r-oldrel-macos-x86_64 | 0.3.3 | 5.00 | 60.00 | 65.00 | NOTE | |
| r-oldrel-windows-x86_64 | 0.3.3 | 11.00 | 122.00 | 133.00 | NOTE |
Version: 0.3.3
Check: Rd files
Result: NOTE
checkRd: (-1) h2o4gpu.gradient_boosting_classifier.Rd:62: Lost braces; missing escapes or markup?
62 | \item{tree_method}{The tree construction algorithm used in XGBoost Distributed and external memory version only support approximate algorithm. Choices: {‘auto’, ‘exact’, ‘approx’, ‘hist’, ‘gpu_exact’, ‘gpu_hist’} ‘auto’: Use heuristic to choose faster one. - For small to medium dataset, exact greedy will be used. - For very large-dataset, approximate algorithm will be chosen. - Because old behavior is always use exact greedy in single machine, - user will get a message when approximate algorithm is chosen to notify this choice. ‘exact’: Exact greedy algorithm. ‘approx’: Approximate greedy algorithm using sketching and histogram. ‘hist’: Fast histogram optimized approximate greedy algorithm. It uses some performance improvements such as bins caching. ‘gpu_exact’: GPU implementation of exact algorithm. ‘gpu_hist’: GPU implementation of hist algorithm.}
| ^
checkRd: (-1) h2o4gpu.gradient_boosting_regressor.Rd:64: Lost braces; missing escapes or markup?
64 | \item{tree_method}{The tree construction algorithm used in XGBoost Distributed and external memory version only support approximate algorithm. Choices: {‘auto’, ‘exact’, ‘approx’, ‘hist’, ‘gpu_exact’, ‘gpu_hist’} ‘auto’: Use heuristic to choose faster one. - For small to medium dataset, exact greedy will be used. - For very large-dataset, approximate algorithm will be chosen. - Because old behavior is always use exact greedy in single machine, - user will get a message when approximate algorithm is chosen to notify this choice. ‘exact’: Exact greedy algorithm. ‘approx’: Approximate greedy algorithm using sketching and histogram. ‘hist’: Fast histogram optimized approximate greedy algorithm. It uses some performance improvements such as bins caching. ‘gpu_exact’: GPU implementation of exact algorithm. ‘gpu_hist’: GPU implementation of hist algorithm.}
| ^
checkRd: (-1) h2o4gpu.random_forest_classifier.Rd:58: Lost braces; missing escapes or markup?
58 | \item{tree_method}{The tree construction algorithm used in XGBoost Distributed and external memory version only support approximate algorithm. Choices: {‘auto’, ‘exact’, ‘approx’, ‘hist’, ‘gpu_exact’, ‘gpu_hist’} ‘auto’: Use heuristic to choose faster one. - For small to medium dataset, exact greedy will be used. - For very large-dataset, approximate algorithm will be chosen. - Because old behavior is always use exact greedy in single machine, - user will get a message when approximate algorithm is chosen to notify this choice. ‘exact’: Exact greedy algorithm. ‘approx’: Approximate greedy algorithm using sketching and histogram. ‘hist’: Fast histogram optimized approximate greedy algorithm. It uses some performance improvements such as bins caching. ‘gpu_exact’: GPU implementation of exact algorithm. ‘gpu_hist’: GPU implementation of hist algorithm.}
| ^
checkRd: (-1) h2o4gpu.random_forest_regressor.Rd:56: Lost braces; missing escapes or markup?
56 | \item{tree_method}{The tree construction algorithm used in XGBoost Distributed and external memory version only support approximate algorithm. Choices: {‘auto’, ‘exact’, ‘approx’, ‘hist’, ‘gpu_exact’, ‘gpu_hist’} ‘auto’: Use heuristic to choose faster one. - For small to medium dataset, exact greedy will be used. - For very large-dataset, approximate algorithm will be chosen. - Because old behavior is always use exact greedy in single machine, - user will get a message when approximate algorithm is chosen to notify this choice. ‘exact’: Exact greedy algorithm. ‘approx’: Approximate greedy algorithm using sketching and histogram. ‘hist’: Fast histogram optimized approximate greedy algorithm. It uses some performance improvements such as bins caching. ‘gpu_exact’: GPU implementation of exact algorithm. ‘gpu_hist’: GPU implementation of hist algorithm.}
| ^
Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc, r-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc, r-devel-windows-x86_64, r-patched-linux-x86_64, r-release-linux-x86_64, r-release-macos-arm64, r-release-macos-x86_64, r-release-windows-x86_64, r-oldrel-macos-arm64, r-oldrel-macos-x86_64, r-oldrel-windows-x86_64