Package: testComplexity
Title: Asymptotic Complexity Testing Framework
Version: 0.1.0
Author: Anirban Chetia <bloodraven166@gmail.com> 
Maintainer: Anirban Cheta <bloodraven166@gmail.com>
Description: It classifies the asymptotic time/memory complexity class for an 
             algorithm/function through the complexity classifiers, with data 
             frames returned by the quantifiers. The data frames can be passed 
             onto the plotting functions for obtaining a visual description of
             the benchmarks against data sizes if the user intends to diagnose
             the trend via the traditional method. For testing the algorithm 
             against an expected time complexity class, the user can directly
             use the expect functions. Please check 
             <https://anirban166.github.io/testComplexity/articles/testComplexity> 
             to get started.
License: MIT + file LICENSE
Encoding: UTF-8
LazyData: true
RoxygenNote: 7.1.0
URL: https://github.com/Anirban166/testComplexity
BugReports: https://github.com/Anirban166/testComplexity/issues
VignetteBuilder: knitr
Imports: boot, utils, microbenchmark, bench, ggplot2, stats, testthat
        (>= 2.1.0)
Suggests: covr, knitr, rmarkdown, PeakSegDP, PeakSegOptimal
NeedsCompilation: no
Packaged: 2020-09-14 05:21:00 UTC; HP
Repository: CRAN
Date/Publication: 2020-09-22 08:30:08 UTC
