Maybe there is good reason for this. I'm not real familiar with this space. It's not so hard to implement something yourself. But I suspect the description of "missing js randomness library" may have some merit.

https://fakerjs.dev/api/helpers.html#arrayelement

I believe is what you're looking for. The issue, as I recall, is that all of Faker is random, so what does it mean to have a `random` module namespace. We moved it out of a hope for improved clarity.

It's nice to see aimless.js support it.

Crazy to me that `Math.random` doesn't accept a seed as an optional param.

Another case are unit tests with random-generated cases. At a minimum you want to know the seed of the last run and have that reported. On CI system you would want it to be deterministic.

Where you want there not to be a seed is in crypto, or possibly a game like poker or even tetris.

I had to make one myself and I never thought it'd be something I'd ever need to do

    const randomPermutation = arr => intSequence(0, arr.length - 1).map(i => arr[i])
    console.log(randomPermutation(['a', 'b', 'c'])

const randomSeq = sequence([1,2,3]) // could return [3,1,2], [2,3,1], etc.

Looking at random-js, the barrier to entry is higher. I've looked at randomness libraries and that's the feeling they gave me: That I would need to learn how randomness works, rather than just calling a function for what I want; a random int, a weighted random. Cmd+F "weighted" doesn't find anything on both of those projects' readmes.

There's a tradeoff for simplicity, but in many cases I'll take it. This is the iPhone of randomness and that's what I needed to feel comfortable using it rather than rolling my own.

This library seems to solve that problem and half a dozen others! Like: Reading code with functions named for their purpose is better than a string of arithmetic operations in most cases. Thank you for sharing this! Will use in my game! [2]

    const weightedDiceRoll =
    weighted(
        [1,2,3,4,5,6],
        [1,1,1,1,1,10]
    )
    // will return 6 much more often than the other options

1: https://news.ycombinator.com/item?id=34742985

2: https://github.com/Suncapped/babs

  const randIntRange = (i, j, engine = defaultEngine) => {
    const min = Math.ceil(i)
    const max = Math.floor(j)

    return Math.floor(engine() * (max - min + 1)) + min
  }

The only correct way to do this is to do rejection sampling: generate a number x with log2(max - min) bits and if x >= max - min retry.

Thumbs up. Carry on.