ansible-lint

lint tool for Ansible playbooks

Ansible playbooks express configuration, deployment and orchestration in YAML format. They can describe a policy you want your remote systems to enforce, or a set of steps in a general IT process.

r-cran-marginaleffects

GNU R predictions, comparisons, slopes, marginal means, and hypothesis

Tests Compute and plot predictions, slopes, marginal means, and comparisons (contrasts, risk ratios, odds, etc.) for over 100 classes of statistical and machine learning models in R. Conduct linear and non- linear hypothesis tests, or equivalence tests. Calculate uncertainty estimates using the delta method, bootstrapping, or simulation-based inference.

libeclipse-ui-forms-java

Eclipse UI forms

The Eclipse Platform UI project is responsible for the runtime, user interface and help components of Eclipse. Platform UI provides the basic building blocks to create the Eclipse IDE and other Eclipse based applications called Rich Client Platform (RCP).

libequinox-p2-artifact-processors-java

Equinox p2 Artifact Processing Support

The Equinox p2 project focuses on provisioning technology for OSGi-based applications. Although p2 has specific support for installing Eclipse and Equinox-based applications, it includes a general-purpose provisioning infrastructure that can be used as the basis for provisioning solutions for a wide variety of software applications.

libxbase64-bin

xbase compatible C++ class library (utilities)

Xbase (formerly known as xdb, also formerly known as xBase) is a collection of specifiations, programs, utilities and a C++ class library for manipulating Xbase type datafiles and indices.

r-cran-multicool

GNU R permutations of multisets in Cool-Lex order

A set of tools to permute multisets without loops or hash tables and to generate integer partitions. The permutation functions are based on C code from Aaron Williams. Cool-lex order is similar to colexicographical order. The algorithm is described in Williams, A. Loopless Generation of Multiset Permutations by Prefix Shifts. SODA 2009, Symposium on Discrete Algorithms, New York, United States. The permutation code is distributed without restrictions. The code for stable and efficient computation of multinomial coefficients comes from Dave Barber. The code can be download from <http://tamivox.org/dave/multinomial/index.html> and is distributed without conditions. The package also generates the integer partitions of a positive, non-zero integer n. The C++ code for this is based on Python code from Jerome Kelleher which can be found here <http://jeromekelleher.net/category/combinatorics.html>. The C++ code and Python code are distributed without conditions.