# Function max_for_subrange

## Synopsis

```
#include "breeze/random/max_for_subrange.hpp"
long max_for_subrange(long x, long m)
```

## Description

- Returns
- The maximum value that can be kept (before taking the remainder of the division by
`x + 1`

) for getting a random (or pseudo-random) integer in the range`[0, x]`

from a source that spans`[0, m]`

,`x <= m`

.

`[0, 5]`

(dice) from `[0, RAND_MAX]`

; if e.g. `RAND_MAX == 32767`

then `max_for_subrange(5, RAND_MAX)`

returns ```
<tt>32765</tt>
```

This allows discarding only a tiny fraction of the values in the whole range of the source (only the last two, in fact), rather than discarding anything greater than or equal to six.

Why that value? The idea, of course, is that there are `32766 `

numbers in `[0, 32765]`

, and that is a multiple of six (the number of values in `[0, 5]`

). So, the remainders `0`

, `1`

, `2`

, `3`

, `4 `

and `5`

all appear with the same probability (if the source is not biased). If we took the whole range then, of course, `0`

and `1`

would be more frequent than the others.

With respect to just discarding anything greater than `x `

:

- For pseudo-random numbers this basically saves execution time.
- For true random numbers it avoids needlessly discarding numbers and thus consuming precious entropy.

- Precondition
- 0 <= x <= m (i.e. destination range not wider than source one)

## Source

Line 62 in breeze/random/max_for_subrange.hpp.