aboutsummaryrefslogtreecommitdiff
path: root/check.log
diff options
context:
space:
mode:
authorJohannes Ranke <jranke@uni-bremen.de>2019-06-04 15:09:28 +0200
committerJohannes Ranke <jranke@uni-bremen.de>2019-06-04 15:09:28 +0200
commit95178837d3f91e84837628446b5fd468179af2b9 (patch)
tree8b162d5a22b28b59ca9c6bb27bf8f9dfbeaefbae /check.log
parent9a96391589fef9f80f9c6c4881cc48a509cb75f2 (diff)
Additional algorithm "d_c", more tests, docs
The new algorithm tries direct optimization of the likelihood, as well as a three step procedure. In this way, we consistently get the model with the highest likelihood for SFO, DFOP and HS for all 12 new test datasets.
Diffstat (limited to 'check.log')
-rw-r--r--check.log14
1 files changed, 11 insertions, 3 deletions
diff --git a/check.log b/check.log
index 49ba0af6..c31c3b2c 100644
--- a/check.log
+++ b/check.log
@@ -5,7 +5,7 @@
* using options ‘--no-tests --as-cran’
* checking for file ‘mkin/DESCRIPTION’ ... OK
* checking extension type ... Package
-* this is package ‘mkin’ version ‘0.9.49.4’
+* this is package ‘mkin’ version ‘0.9.49.5’
* package encoding: UTF-8
* checking CRAN incoming feasibility ... Note_to_CRAN_maintainers
Maintainer: ‘Johannes Ranke <jranke@uni-bremen.de>’
@@ -56,7 +56,11 @@ Maintainer: ‘Johannes Ranke <jranke@uni-bremen.de>’
* checking data for ASCII and uncompressed saves ... OK
* checking installed files from ‘inst/doc’ ... OK
* checking files in ‘vignettes’ ... OK
-* checking examples ... OK
+* checking examples ... NOTE
+Examples with CPU or elapsed time > 5s
+ user system elapsed
+plot.mkinfit 9.307 0.084 9.396
+mkinerrplot 9.150 0.076 9.229
* checking for unstated dependencies in ‘tests’ ... OK
* checking tests ... SKIPPED
* checking for unstated dependencies in vignettes ... OK
@@ -65,5 +69,9 @@ Maintainer: ‘Johannes Ranke <jranke@uni-bremen.de>’
* checking PDF version of manual ... OK
* DONE
-Status: OK
+Status: 1 NOTE
+See
+ ‘/home/jranke/git/mkin/mkin.Rcheck/00check.log’
+for details.
+

Contact - Imprint