Last updated on 2024-05-20 17:57:31 CEST.

Flavor | Version | T_{install} | T_{check} | T_{total} | Status | Flags |
---|---|---|---|---|---|---|

r-devel-linux-x86_64-debian-clang | 0.3.3 | 6.76 | 89.80 | 96.56 | NOTE | |

r-devel-linux-x86_64-debian-gcc | 0.3.3 | 6.58 | 68.02 | 74.60 | NOTE | |

r-devel-linux-x86_64-fedora-clang | 0.3.3 | 123.30 | NOTE | |||

r-devel-linux-x86_64-fedora-gcc | 0.3.3 | 130.98 | NOTE | |||

r-devel-windows-x86_64 | 0.3.3 | 7.00 | 124.00 | 131.00 | NOTE | |

r-patched-linux-x86_64 | 0.3.3 | 8.22 | 87.55 | 95.77 | NOTE | |

r-release-linux-x86_64 | 0.3.3 | 6.47 | 87.52 | 93.99 | NOTE | |

r-release-macos-arm64 | 0.3.3 | 42.00 | NOTE | |||

r-release-windows-x86_64 | 0.3.3 | 8.00 | 124.00 | 132.00 | NOTE | |

r-oldrel-macos-arm64 | 0.3.3 | 43.00 | OK | |||

r-oldrel-macos-x86_64 | 0.3.3 | 68.00 | OK | |||

r-oldrel-windows-x86_64 | 0.3.3 | 10.00 | 119.00 | 129.00 | OK |

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-windows-x86_64