Running ‘testthat.R’ [77s/107s]
Running the tests in ‘tests/testthat.R’ failed.
Complete output:
  > library(testthat)
  > library(diceR)
  > 
  > test_check("diceR")
  Selecting k and imputing non-clustered cases
  Computing consensus functions
  Evaluating output with consensus function results
  Diverse Cluster Ensemble Completed
  Selecting k and imputing non-clustered cases
  Computing consensus functions
  Evaluating output with consensus function results
  Diverse Cluster Ensemble Completed
  Selecting k and imputing non-clustered cases
  Computing consensus functions
  Evaluating output with consensus function results
  Diverse Cluster Ensemble Completed
  Selecting k and imputing non-clustered cases
  Computing consensus functions
  Diverse Cluster Ensemble Completed
  Selecting k and imputing non-clustered cases
  Computing consensus functions
  Diverse Cluster Ensemble Completed
  Selecting k and imputing non-clustered cases
  Computing consensus functions
  Diverse Cluster Ensemble Completed
  Selecting k and imputing non-clustered cases
  Computing consensus functions
  ══ Warnings ════════════════════════════════════════════════════════════════════
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:24:3): evaluation works with reference class and can plot ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_length(...) test-consensus_combine.R:24:2
   14. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   15. diceR:::.f(.x[[i]], ...)
   16. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:30:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:30:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:30:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:30:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:30:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:30:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:30:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:30:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:30:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:30:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:30:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:30:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:31:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:31:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:31:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:31:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:31:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:31:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:31:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:31:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:31:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:31:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:31:3): there are different ways to choose k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-consensus_combine.R:31:2
   16. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   17. diceR:::.f(.x[[i]], ...)
   18. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:41:3): trimming (potentially) removes algorithms ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:41:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:41:3): trimming (potentially) removes algorithms ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:41:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:41:3): trimming (potentially) removes algorithms ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:41:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:41:3): trimming (potentially) removes algorithms ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:41:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:41:3): trimming (potentially) removes algorithms ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:41:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:41:3): trimming (potentially) removes algorithms ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:41:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:48:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:48:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:48:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:48:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:48:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:48:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:48:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:48:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:48:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:48:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:48:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:48:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:51:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:51:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:51:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:51:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:51:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:51:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:51:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:51:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:51:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:51:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:51:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:51:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:51:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:51:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:51:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:51:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-consensus_combine.R:51:3): reweighing (potentially) replicates each slice of algorithm ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::consensus_evaluate(...) test-consensus_combine.R:51:2
   11. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   12. diceR:::.f(.x[[i]], ...)
   13. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:11:3): dice works with one algorithm, one consensus funs ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(hgsc, nk = 4, algorithms = "hc", cons.funs = "kmodes") test-dice.R:11:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:11:3): dice works with one algorithm, one consensus funs ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(hgsc, nk = 4, algorithms = "hc", cons.funs = "kmodes") test-dice.R:11:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:11:3): dice works with one algorithm, one consensus funs ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(hgsc, nk = 4, algorithms = "hc", cons.funs = "kmodes") test-dice.R:11:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:18:3): dice works with multiple algorithms, consensus funs, trimming, and
            reference class ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:18:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:18:3): dice works with multiple algorithms, consensus funs, trimming, and
            reference class ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:18:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:18:3): dice works with multiple algorithms, consensus funs, trimming, and
            reference class ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:18:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:18:3): dice works with multiple algorithms, consensus funs, trimming, and
            reference class ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:18:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:18:3): dice works with multiple algorithms, consensus funs, trimming, and
            reference class ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:18:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:18:3): dice works with multiple algorithms, consensus funs, trimming, and
            reference class ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:18:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:27:3): single algorithm and single consensus return same results ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:27:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:27:3): single algorithm and single consensus return same results ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:27:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:27:3): single algorithm and single consensus return same results ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:27:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:34:3): indices slot returns NULL if evaluate specified as FALSE ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:34:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:40:3): relabelling uses 1st col if more than 1 cons.funs and no ref.cl ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:40:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:46:3): cluster size prepended when multiple k requested ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:46:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:46:3): cluster size prepended when multiple k requested ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:46:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:52:3): algorithm vs internal index heatmap works ───────
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:52:2
   12. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   13. diceR:::.f(.x[[i]], ...)
   14. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:52:3): algorithm vs internal index heatmap works ───────
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:52:2
   10. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   11. diceR:::.f(.x[[i]], ...)
   12. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:52:3): algorithm vs internal index heatmap works ───────
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:52:2
   10. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   11. diceR:::.f(.x[[i]], ...)
   12. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-dice.R:52:3): algorithm vs internal index heatmap works ───────
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. diceR::dice(...) test-dice.R:52:2
   10. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   11. diceR:::.f(.x[[i]], ...)
   12. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   17. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   18. diceR:::.f(.x[[i]], ...)
   19. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   15. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   16. diceR:::.f(.x[[i]], ...)
   17. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   15. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   16. diceR:::.f(.x[[i]], ...)
   17. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   15. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   16. diceR:::.f(.x[[i]], ...)
   17. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   15. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   16. diceR:::.f(.x[[i]], ...)
   17. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   15. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   16. diceR:::.f(.x[[i]], ...)
   17. clValid::connectivity(Data = ndata, clusters = .)
  ── Warning (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  the condition has length > 1 and only the first element will be used
  Backtrace:
    1. testthat::expect_error(...) test-graphs.R:46:2
   15. purrr::map_dbl(., ~clValid::connectivity(Data = ndata, clusters = .))
   16. diceR:::.f(.x[[i]], ...)
   17. clValid::connectivity(Data = ndata, clusters = .)
  
  ══ Failed tests ════════════════════════════════════════════════════════════════
  ── Error (test-dice.R:52:3): algorithm vs internal index heatmap works ─────────
  Error: `.data` must be a data frame without row names.
  Backtrace:
      █
   1. ├─diceR::dice(...) test-dice.R:52:2
   2. │ └─diceR:::algii_heatmap(data, k, E, clusters, ref.cl)
   3. │   └─`%>%`(...)
   4. └─tibble::column_to_rownames(., "Algorithms")
  ── Failure (test-graphs.R:46:3): algii_heatmap works when there is more than one k ──
  `dice(...)` threw an error.
  Message: `.data` must be a data frame without row names.
  Class:   tibble_error_already_has_rownames/tibble_error/rlang_error/error/condition
  Backtrace:
      █
   1. ├─testthat::expect_error(...) test-graphs.R:46:2
   2. │ └─testthat:::quasi_capture(...)
   3. │   ├─testthat:::.capture(...)
   4. │   │ └─base::withCallingHandlers(...)
   5. │   └─rlang::eval_bare(quo_get_expr(.quo), quo_get_env(.quo))
   6. ├─diceR::dice(...)
   7. │ └─diceR:::algii_heatmap(data, k, E, clusters, ref.cl)
   8. │   └─`%>%`(...)
   9. └─tibble::column_to_rownames(., "Algorithms")
  
  [ FAIL 2 | WARN 89 | SKIP 0 | PASS 110 ]
  Error: Test failures
  Execution halted