Maps numeric items in
x into groups with sum
less or equal than
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
capacity, an error
integer]. Integer with values “1” to “n.bins”
indicating bin membership.
1 2 3 4 5