R Under development (unstable) (2024-01-31 r85845 ucrt) -- "Unsuffered Consequences"
Copyright (C) 2024 The R Foundation for Statistical Computing
Platform: x86_64-w64-mingw32/x64

R is free software and comes with ABSOLUTELY NO WARRANTY.
You are welcome to redistribute it under certain conditions.
Type 'license()' or 'licence()' for distribution details.

R is a collaborative project with many contributors.
Type 'contributors()' for more information and
'citation()' on how to cite R or R packages in publications.

Type 'demo()' for some demos, 'help()' for on-line help, or
'help.start()' for an HTML browser interface to help.
Type 'q()' to quit R.

> data.table::setDTthreads(1)
> if(require(testthat))test_check("penaltyLearning")
Loading required package: testthat
Loading required package: penaltyLearning
   problem    lo    hi
     <num> <num> <num>
1:       1     1    -1
2:       2     1    -1
   problem    lo    hi
     <num> <num> <num>
1:       1    -1     0
2:       2     0     1
   problem    lo    hi
     <num> <num> <num>
1:       1     0     0
2:       2     0     0
   problem    lo    hi
     <num> <num> <num>
1:       1    -1     0
2:       2     0     1
3:       3     0     0
   problem    lo    hi
     <num> <num> <num>
1:       1     0     0
2:       2     0     0
   problem pred.log.lambda problems
     <num>           <num>    <int>
1:       2              -1        2
2:       2               0        2
   problem    lo    hi
     <num> <num> <num>
1:       1    -1     0
2:       2     0     2
3:       3    -1     0
   problem    lo    hi
     <num> <num> <num>
1:       1    -1     0
2:       2     0     1
3:       3    -1     0
   problem    lo    hi
     <num> <num> <num>
1:       1    -2     0
2:       2     0     1
3:       3    -1     1
   problem    lo    hi
     <num> <num> <num>
1:       1    -2    -1
2:       2     0     1
3:       3     1     2
   problem    lo    hi
     <num> <num> <num>
1:       1    -3    -2
2:       2     1     1
3:       3     1     2
Key: <problem>
      problem   min   max
       <char> <num> <num>
1: two-thresh     1     2
Key: <problem>
      problem   min   max
       <char> <num> <num>
1: two-thresh     1     2
Key: <problem>
      problem   min   max
       <char> <num> <num>
1: two-thresh     1     2
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf           -500      1     1     0      1
2: two-thresh           -500            500      0     0     0      1
3: two-thresh            500            Inf      1     0     1      1
   possible.fp possible.fn pred.log.lambda next.min
         <num>       <num>           <num>    <num>
1:           1          -1               0     -500
2:           1          -1               0      500
3:           1          -1               0      Inf
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf           -500      1     1     0      1
2: two-thresh           -500            500      0     0     0      1
3: two-thresh            500            Inf      1     0     1      1
   possible.fp possible.fn pred.log.lambda next.min
         <num>       <num>           <num>    <num>
1:          -1           1               0     -500
2:          -1           1               0      500
3:          -1           1               0      Inf
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf           -500      1     1     0     -1
2: two-thresh           -500            500      0     0     0     -1
3: two-thresh            500            Inf      1     0     1     -1
   possible.fp possible.fn pred.log.lambda next.min
         <num>       <num>           <num>    <num>
1:           1           1               0     -500
2:           1           1               0      500
3:           1           1               0      Inf
Key: <problem>
     problem   min   max
      <char> <num> <num>
1: always-tp  -Inf  -600
Key: <problem>
      problem   min   max
       <char> <num> <num>
1: two-thresh  -600   Inf
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf             -6      1     1     0      1
2: two-thresh           -500            500      0     0     0      1
3: two-thresh            500            Inf      1     0     1      1
   possible.fp possible.fn pred.log.lambda next.min n.inconsistent
         <num>       <num>           <num>    <num>          <int>
1:           1           1               0     -500              1
2:           1           1               0      500              1
3:           1           1               0      Inf              1
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf           -500      1     1    -1      1
   possible.fp possible.fn pred.log.lambda next.min
         <num>       <num>           <num>    <num>
1:           1           1               0     -500
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf           -500      1     1     2      1
   possible.fp possible.fn pred.log.lambda next.min
         <num>       <num>           <num>    <num>
1:           1           1               0     -500
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf           -500      1    -1     0      1
   possible.fp possible.fn pred.log.lambda next.min
         <num>       <num>           <num>    <num>
1:           1           1               0     -500
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf           -500      1     2     0      1
   possible.fp possible.fn pred.log.lambda next.min
         <num>       <num>           <num>    <num>
1:           1           1               0     -500
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf           -500     -1     1     0      1
   possible.fp possible.fn pred.log.lambda next.min
         <num>       <num>           <num>    <num>
1:           1           1               0     -500
Key: <problem, min.log.lambda>
      problem min.log.lambda max.log.lambda errors    fp    fn labels
       <char>          <num>          <num>  <num> <num> <num>  <num>
1: two-thresh           -Inf           -500      2     1     0      1
   possible.fp possible.fn pred.log.lambda next.min
         <num>       <num>           <num>    <num>
1:           1           1               0     -500
Key: <problem, min.log.lambda>
      tp    fp possible.tp possible.fp min.log.lambda max.log.lambda problem
   <num> <num>       <num>       <num>          <num>          <num>   <num>
1:     1     1           2           2           -Inf              1       1
2:     2     2           2           2              2            Inf       1
      fn possible.fn errors labels pred.log.lambda next.min
   <num>       <num>  <num>  <num>           <num>    <num>
1:     1           2      2      1             1.5        1
2:     0           2      2      1             1.5      Inf
[ FAIL 0 | WARN 1 | SKIP 0 | PASS 193 ]

[ FAIL 0 | WARN 1 | SKIP 0 | PASS 193 ]
> 
> proc.time()
   user  system elapsed 
  16.26    1.01   17.29