Author: Andreas Stelzer, Manuela Lautizi, Tim Kacprowski, Research group of computational systems medicine Chair of Experimental Bioinformatics TU Munich

Author: Andreas Stelzer, Manuela Lautizi, Tim Kacprowski, Research group of Computational Systems Medicine, Chair of Experimental Bioinformatics, TU Munich
Description: A very fast Log-Rank-Test implementation that is several orders of magnitude faster than the implementation in the 'survival' package.
Log-Rank-Tests can be computed individually or concurrently using threading.
Suggests: testthat (>= 2.1.0), survival (>= 3.1)

Title: Fast Marching Method for Modelling Evolving Boundaries
Description: Fast Marching Method (FMM) first developed by Sethian (1996) <http://www.pnas.org/content/93/4/1591.short>, and further extended by including a second-order approximation, the first-arrival rule, additive weights, and non-homogeneous domains following Silva and Steele (2012) <doi:10.1142/S0219525911003293> and Silva and Steele (2014) <doi:10.1016/j.jas.2014.04.021>.
Packaged: 2018-01-22 14:22:08 UTC; fabiosilva

Packaged: 2018-03-20 14:59:47 UTC; fabiosilva

Title: Fast Implementation of a Key-Value Store
person("Winston", "Chang", email = "winston@rstudio.com", role = c("aut", "cre")),
person(given = "RStudio", role = c("cph", "fnd")),
person(given = "Tessil", role = "cph", comment = "hopscotch_map library")
Description: Fast implementation of a key-value store. Environments are commonly
used as key-value stores, but every time a new key is used, it is added to
R's global symbol table, causing a small amount of memory leakage. This can
be problematic in cases where many different keys are used. Fastmap avoids
this memory leak issue by implementing the map using data structures in C++.

Description: Fast implementation of data structures, including a key-value
store, stack, and queue. Environments are commonly used as key-value stores
in R, but every time a new key is used, it is added to R's global symbol
table, causing a small amount of memory leakage. This can be problematic in
cases where many different keys are used. Fastmap avoids this memory leak
issue by implementing the map using data structures in C++.