Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel search send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
This package provides access to Climate Hazards Center (CHC) datasets including CHIRPS v3, CHIRPS v2, CHIRTS-daily and CHIRTS-ERA5, read directly from the CHC server. CHIRPS is a quasi-global (60°S to 60°N for v3) high-resolution (0.05 arc-degrees) rainfall data set, which incorporates satellite imagery and in-situ station data to create gridded rainfall time series for trend analysis and seasonal drought monitoring. CHIRTS is a quasi-global (60°S to 70°N), high-resolution data set of daily maximum and minimum temperatures. Data are returned as rasters or as time series for points and polygons, ready for climate indices with the climatrends package. For more details on CHC datasets please visit their official home page <https://www.chc.ucsb.edu/data>.
This package implements controlled interrupted time series (CITS) analysis for evaluating interventions in comparative time-series data. The package provides tools for preparing panel time-series datasets, fitting models using generalized least squares (GLS) with optional autoregressiveâ moving-average (ARMA) error structures, and computing fitted values and robust standard errors using cluster-robust variance estimators (CR2). Visualization functions enable clear presentation of estimated effects and counterfactual trajectories following interventions. Background on methods for causal inference in interrupted time series can be found in Linden and Adams (2011) <doi:10.1111/j.1365-2753.2010.01504.x> and Lopez Bernal, Cummins, and Gasparrini (2018) <doi:10.1093/ije/dyy135>.
CUR/CX decomposition factorizes a matrix into two factor matrices and Multidimensional CX Decomposition factorizes a tensor into a core tensor and some factor matrices. See the reference section of GitHub README.md <https://github.com/rikenbit/ccTensor>, for details of the methods.
Computes the coverage correlation coefficient introduced in <doi:10.48550/arXiv.2508.06402> , a statistical measure that quantifies dependence between two random vectors by computing the union volume of data-centered hypercubes in a uniform space.
This package provides functions for constructing simultaneous credible bands and identifying subsets via the "credible subsets" (also called "credible subgroups") method. Package documentation includes the vignette included in this package, and the paper by Schnell, Fiecas, and Carlin (2020, <doi:10.18637/jss.v094.i07>).
This R-extension package contains dozens of functions useful for: database style joins [nerge()] & aggregation [bestBy(), groupBy() & regroup()], database migration [dbWriteTable2()], file I/O [write.delim(), read.tab()], text parsing / data mining [m()], data structure conversion [nv(), tab2df()], summarizing & reporting [pct(), fit.1ln.rprt()], character string manipulation [m() & pad()], legend table making [sstable() & leghead()] & plot placement [legend.position()], plot annotation [labsegs() & mvlabs()], data visualization [pies(), spie(), & heatmatrix()], and data exploration [hyperplot(), plot.xy.ab.p()], batch scripting [parseArgString()]. The package's greatest contributions stem from its database style merge, aggregation and interface functions as well as in it's extensive use and propagation of row, column and vector names in most functions. The latest additions are plotting functions [confound.grid() & sparge()] that intake a dataframe & formulas to visually resolve variable confounding (Simpson, 1951).
To calculate the AQI (Air Quality Index) from pollutant concentration data. O3, PM2.5, PM10, CO, SO2, and NO2 are available currently. The method can be referenced at Environmental Protection Agency, United States as follows: EPA (2016) <https://www3.epa.gov/airnow/aqi-technical-assistance-document-may2016.pdf>.
Allows Brownian motion, fractional Brownian motion, and integrated Ornstein-Uhlenbeck process components to be added to linear and non-linear mixed effects models using the structures and methods of the nlme package.
Wraps the CIRCE (<https://github.com/ohdsi/circe-be>) Java library allowing cohort definition expressions to be edited and converted to Markdown or SQL'.
Calculate the likelihood ratio test p-value and likelihood confidence intervals for misspecified Cox models, as described in Shao and Guo (2025) <doi:10.48550/arXiv.2508.11851>.
Creation and selection of (Advanced) Coupled Matrix and Tensor Factorization (ACMTF) and ACMTF-Regression (ACMTF-R) models. Selection of the optimal number of components can be done using ACMTF_modelSelection() and ACMTFR_modelSelection()'. The CMTF and ACMTF methods were originally described by Acar et al., 2011 <doi:10.48550/arXiv.1105.3422> and Acar et al., 2014 <doi:10.1186/1471-2105-15-239>, respectively.
Data stored in text file can be processed chunkwise using dplyr commands. These are recorded and executed per data chunk, so large files can be processed with limited memory using the LaF package.
This package provides functions for loading large (10M+ lines) CSV and other delimited files, similar to read.csv, but typically faster and using less memory than the standard R loader. While not entirely general, it covers many common use cases when the types of columns in the CSV file are known in advance. In addition, the package provides a class int64', which represents 64-bit integers exactly when reading from a file. The latter is useful when working with 64-bit integer identifiers exported from databases. The CSV file loader supports common column types including integer', double', string', and int64', leaving further type transformations to the user.
Quantify and visualise various measures of chemical diversity and dissimilarity, for phytochemical compounds and other sets of chemical composition data. Importantly, these measures can incorporate biosynthetic and/or structural properties of the chemical compounds, resulting in a more comprehensive quantification of diversity and dissimilarity. For details, see Petrén, Köllner and Junker (2023) <doi:10.1111/nph.18685>.
To help French students from scientific preparatory classes for the Grandes Ecoles (CPGE) in their choice of field of study and career options, this package provides an interactive tool and data visualization of a graph clustered by different competitive exams and sectors of activity for French selective engineering schools and selective higher education institutions like Ecoles Normales Superieures (ENS) or specialized university programs (magisteres). Besides, there are two drop-down menus to select on the graph many fields or more than 200 engineering schools or ENS or magisteres. It gives the opportunity to expand, collapse clusters of selective exams interactively too. For more information, see the demonstration video: <https://valerierobert-maths.re/index.php/maths-en-cpge/>. The data was collected via the official French website: <https://www.scei-concours.fr/statistiques.html>.
This package provides a wrapper for the Clockify API <https://docs.clockify.me/>, making it possible to query, insert and update time keeping data.
Perform state and parameter inference, and forecasting, in stochastic state-space systems using the ctsmTMB R6 class. This class provides a user-friendly interface for working with stochastic state space models. Inference is based on maximum likelihood estimation, with derivatives efficiently computed through automatic differentiation enabled by the TMB'/'RTMB packages (Kristensen et al., 2016) <doi:10.18637/jss.v070.i05>. The available inference methods include Kalman filters, in addition to a Laplace approximation-based smoothing method. For further details of these methods refer to the documentation of the CTSMR package <https://ctsm.info/ctsmr-reference.pdf> and Thygesen (2025) <doi:10.48550/arXiv.2503.21358>. Forecasting capabilities include moment predictions and stochastic path simulations implemented in C++ using Rcpp (Eddelbuettel et al., 2018) <doi:10.1080/00031305.2017.1375990> for computational efficiency.
P-values and no/lowest observed (adverse) effect concentration values derived from the closure principle computational approach test (Lehmann, R. et al. (2015) <doi:10.1007/s00477-015-1079-4>) are provided. The package contains functions to generate intersection hypotheses according to the closure principle (Bretz, F., Hothorn, T., Westfall, P. (2010) <doi:10.1201/9781420010909>), an implementation of the computational approach test (Ching-Hui, C., Nabendu, P., Jyh-Jiuan, L. (2010) <doi:10.1080/03610918.2010.508860>) and the combination of both, that is, the closure principle computational approach test.
Draws circular "correlation wheel" plots in R, straight from a data frame of one row per observation. Variables are arranged around a circle, grouped and colour-tiled by category, and connected by curved links whose colour maps to the correlation coefficient, computed via a thin wrapper around corr.test() from the psych package. Non-significant, weak, and within-category correlations can be masked. Categories, colours, and labels are all user-configurable.
This package provides functions for visualizing, animating, solving and analyzing the Rubik's cube. Includes data structures for solvable and unsolvable cubes, random moves and random state scrambles and cubes, 3D displays and animations using OpenGL', patterned cube generation, and lightweight solvers. See Rokicki, T. (2008) <arXiv:0803.3435> for the Kociemba solver.
Shiny Web Application for the Multichannel Attribution Problem. It is a user-friendly graphical interface for package ChannelAttribution'.
Sampling from the Cholesky factorization of a Wishart random variable, sampling from the inverse Wishart distribution, sampling from the Cholesky factorization of an inverse Wishart random variable, sampling from the pseudo Wishart distribution, sampling from the generalized inverse Wishart distribution, computing densities for the Wishart and inverse Wishart distributions, and computing the multivariate gamma and digamma functions. Provides a header file so the C functions can be called directly from other programs.
This package provides functions to create contour-enhanced forest plots for meta-analysis, supporting binary outcomes (e.g., odds ratios, risk ratios), continuous outcomes (e.g., correlations), and prevalence estimates. Includes options for prediction intervals, customized colors, study labeling, and contour shading to highlight regions of statistical significance. Based on metafor and ggplot2'.
Solves discrete location objectives on a distance matrix or Euclidean coordinate set. The Max-Min Diversity (MMDP / p-dispersion) objective, which maximizes the minimum pairwise distance within a selection of k items, is solved by farthest-first selection (Gonzalez 1985) <doi:10.1016/0304-3975(85)90224-5>; the DropAdd tabu-search heuristic (Porumbel, Hao & Glover 2011) <doi:10.1007/s10479-011-0898-z>, GRASP with path-relinking (Resende, Marti, Gallego & Duarte 2010) <doi:10.1016/j.cor.2008.05.011>, and an exact node-packing integer program (Sayyady & Fathi 2016) <doi:10.1016/j.ejor.2016.02.026>. The Max-Mean Dispersion objective, which selects a subset of unrestricted size maximising the sum of its pairwise distances divided by the number of selected elements, is solved by reinforcement-learning-guided tabu search (Nijimbere et al. 2020) <doi:10.3934/jimo.2020115>. The discrete k-centre (min-max covering / facility location) objective, which chooses k centres to minimise the largest distance from any point to its nearest centre, is solved via the CDSh heuristic (Garcia-Diaz et al. 2017 <doi:10.1007/s10732-017-9345-x>, 2019 <doi:10.1109/ACCESS.2019.2933875>), and an exact minimum-cover integer program. The maximum-entropy (maxdet) objective, which maximises the log-determinant of a similarity kernel built from the distances (Shewry & Wynn 1987 <doi:10.1080/02664768700000020>; the mode of a determinantal point process, Kulesza & Taskar 2012 <doi:10.1561/2200000044>), is solved by greedy pivoted-Cholesky selection and, for small instances, exact enumeration.