12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849
//
const number = function ({ seeded }, { max = 1e6, min = 0, precision = 0 } = {}) {  const multiplier = Math.pow(10, precision)  return Math.floor(((seeded.random() * (1 + max - min)) + min) * multiplier) / multiplier}
//const chooser = (position, arr, weights) => {  const calculatedWeights = arr.reduce((memo, value, index) => {    memo.push((memo[index - 1] || 0) + (typeof weights[index] === 'number' ? weights[index] : 1))    return memo  }, [])
  const target = position * calculatedWeights[calculatedWeights.length - 1]
  // TODO: Binary Tree akin to: https://github.com/plantain-00/weighted-picker/blob/3cdd2c37856bc39c2304d7a597b237cecc845f7e/src/index.ts#L34  let index
  calculatedWeights.every((weight, i) => {    if (target > weight) {      return true    } else {      index = i      return false    }  })
  return index}
const oneOf = function ({ seeded }, arr, { weights = [] } = {}) {  return arr[chooser(seeded.random(), arr, weights)]}
const choose = function ({ seeded }, qty, arr, { weights = [] } = {}) {  const myArr = arr.slice(0)  const myWeightings = weights.slice(0)  return Array(qty || 0).fill(null).map((v, i) => {    const index = chooser(seeded.random(), myArr, myWeightings)    const result = myArr[index]    myArr[index] = myArr[0]    myArr.shift()    return result  })}
module.exports = { number, oneOf, choose }