R Under development (unstable) (2023-08-12 r84939 ucrt) -- "Unsuffered Consequences"
Copyright (C) 2023 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.

> library(testthat)
> library(NAIR)
Welcome to the NAIR package. Get started using `vignette("NAIR", package = "NAIR")` or by visiting https://mlizhangx.github.io/Network-Analysis-for-Repertoire-Sequencing-/
> 
> test_check("NAIR")
Input data contains 200 rows.
Removing sequences with length fewer than 3 characters... Done. 200 rows remaining.
Computing network edges based on a max hamming distance of 1... Done.
Network contains 122 nodes (after removing isolated nodes).
Computing cluster membership within the network... Done.
Computing statistics for the 20 clusters in the network... Done.
Using "stress" as default layout
Computing network edges based on a max levenshtein distance of 0... Done.
Computing network edges based on a max levenshtein distance of 1... Done.
Network contains 4 nodes (after removing isolated nodes).
Computing network edges based on a max levenshtein distance of 2... Done.
Network contains 4 nodes (after removing isolated nodes).
Computing network edges based on a max levenshtein distance of 0... Done.
Computing network edges based on a max levenshtein distance of 1... Done.
Network contains 4 nodes (after removing isolated nodes).
Computing network edges based on a max levenshtein distance of 2... Done.
Network contains 4 nodes (after removing isolated nodes).
Computing network edges based on a max levenshtein distance of 3... Done.
Network contains 5 nodes (after removing isolated nodes).
Computing network edges based on a max levenshtein distance of 4... Done.
Network contains 5 nodes (after removing isolated nodes).
Computing network edges based on a max hamming distance of 0... Done.
Computing network edges based on a max hamming distance of 1... Done.
Network contains 4 nodes (after removing isolated nodes).
Computing network edges based on a max hamming distance of 2... Done.
Network contains 4 nodes (after removing isolated nodes).
Computing network edges based on a max hamming distance of 0... Done.
Computing network edges based on a max hamming distance of 1... Done.
Network contains 4 nodes (after removing isolated nodes).
Computing network edges based on a max hamming distance of 2... Done.
Network contains 4 nodes (after removing isolated nodes).
Computing network edges based on a max hamming distance of 3... Done.
Network contains 5 nodes (after removing isolated nodes).
Computing network edges based on a max hamming distance of 4... Done.
Network contains 5 nodes (after removing isolated nodes).
Computing network edges based on a max hamming distance of 1... Done.
Network contains 4 nodes (after removing isolated nodes).
Computing network edges based on a max hamming distance of 1... Done.
Computing network edges based on a max hamming distance of 2... Done.
Computing network edges based on a max hamming distance of 1... Done.
Network contains 4 nodes.
Computing network edges based on a max levenshtein distance of 2... Done.
Network contains 3 nodes (after removing isolated nodes).
Computing network edges based on a max hamming distance of 3... Done.
Network contains 3 nodes (after removing isolated nodes).
[ FAIL 0 | WARN 0 | SKIP 0 | PASS 569 ]
> 
> proc.time()
   user  system elapsed 
   7.14    0.65    7.75