Basic infrastructure and several algorithms for 1d-4d bin packing
    problem. This package provides a set of c-level classes and solvers for
    1d-4d bin packing problem, and an r-level solver for 4d bin packing problem,
    which is a wrapper over the c-level 4d bin packing problem solver.
    The 4d bin packing problem solver aims to solve bin packing problem, a.k.a
    container loading problem, with an additional constraint on weight.
    Given a set of rectangular-shaped items, and a set of rectangular-shaped bins
    with weight limit, the solver looks for an orthogonal packing solution
    such that minimizes the number of bins and maximize volume utilization.
    Each rectangular-shaped item i = 1, .. , n is characterized by length l_i,
    depth d_i, height h_i, and weight w_i, and each rectangular-shaped bin
    j = 1, .. , m is specified similarly by length l_j, depth d_j, height h_j,
    and weight limit w_j.
    The item can be rotated into any orthogonal direction, and no further
    restrictions implied.

Provides utilities for processing Rd objects and files.
  Extract argument descriptions and other parts of the help pages of
  functions.

Functions for inference of ploidy from (Genotyping-by-sequencing) GBS data, including a function to infer allelic ratios and allelic proportions in a Bayesian framework.

An implementation of hyperparameter optimization for Gradient
    Boosted Trees on binary classification and regression problems. The current
    version provides two optimization methods: Bayesian optimization and random
    search. Instead of giving the single best model, the final output is an 
    ensemble of Gradient Boosted Trees constructed via the method of ensemble 
    selection.

Plot density and distribution functions with automatic selection of
       suitable regions. Numerically invert (compute quantiles) distribution
       functions. Simulate real and complex numbers from distributions of their
       magnitude and arguments. Optionally, the magnitudes and/or arguments may
       be fixed in almost arbitrary ways. Create polynomials from roots given in
       Cartesian or polar form. Small programming utilities: check if an object
       is identical to NA, count positional arguments in a call, set
       intersection of more than two sets, check if an argument is unnamed,
       compute the graph of S4 classes in packages.