Description Usage Arguments Value Examples

Maps numeric items in `x`

into groups with sum
less or equal than `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 `x`

exceeds `capacity`

, an error
is thrown.

1 | ```
binPack(x, capacity)
``` |

`x` |
[ |

`capacity` |
[ |

[`integer`

]. Integer with values “1” to “n.bins”
indicating bin membership.

1 2 3 4 5 |

```
$`1`
[1] 1 10
$`2`
[1] 2 9
$`3`
[1] 3 8
$`4`
[1] 4 7
$`5`
[1] 5 6
1 2 3 4 5
11 11 11 11 11
```

BBmisc documentation built on May 29, 2017, 10:25 p.m.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.