Computing and visualizing comparative asymptotic timings of different algorithms and code versions. Also includes functionality for comparing empirical timings with expected references such as linear or quadratic, <https://en.wikipedia.org/wiki/Asymptotic_computational_complexity> Also includes functionality for measuring asymptotic memory and other quantities.
Version: 2025.5.24 Imports: data.table, bench, lattice, git2r, utils, stats, grDevices Suggests: directlabels, ggplot2, testthat, knitr, markdown, stringi, re2, binsegRcpp, grates, fastymd, wbs, fpop, changepoint, LOPART, cumstats, PeakSegDisk, callr, readr, dplyr, tidyr, nc, RColorBrewer, tibble, Matrix Published: 2025-05-27 DOI: 10.32614/CRAN.package.atime Author: Toby Hocking [aut, cre] Maintainer: Toby Hocking <toby.hocking at r-project.org> BugReports: https://github.com/tdhock/atime/issues License: GPL-3 URL: https://github.com/tdhock/atime NeedsCompilation: no Materials: NEWS CRAN checks: atime resultsRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4