-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathDESCRIPTION
35 lines (35 loc) · 1.31 KB
/
DESCRIPTION
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
Package: testComplexity
Title: Asymptotic Complexity Testing Framework
Version: 0.1.1
Author: Anirban Chetia <[email protected]>
Maintainer: Anirban <[email protected]>
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