% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/binPack.R
\name{binPack}
\alias{binPack}
\title{Simple bin packing.}
\usage{
binPack(x, capacity)
}
\arguments{
\item{x}{[\code{numeric}]\cr
Numeric vector of elements to group.}

\item{capacity}{[\code{numeric(1)}]\cr
Maximum capacity of each bin, i.e., elements will be grouped
so their sum does not exceed this limit.}
}
\value{
[\code{integer}]. Integer with values \dQuote{1} to \dQuote{n.bins}
  indicating bin membership.
}
\description{
Maps numeric items in \code{x} into groups with sum
less or equal than \code{capacity}.
A very simple greedy algorithm is used, which is not really optimized
for speed. This is a convenience function for smaller vectors, not
a competetive solver for the real binbacking problem.
If an element of \code{x} exceeds \code{capacity}, an error
is thrown.
}
\examples{
x = 1:10
bp = binPack(x, 11)
xs = split(x, bp)
print(xs)
print(sapply(xs, sum))
}
