code: function sqInit(count) {
    var rcount = bits.nextPow2(count)
    if(RED_SWEEP_QUEUE.length < rcount) {
      pool.free(RED_SWEEP_QUEUE)
      RED_SWEEP_QUEUE = pool.mallocInt32(rcount)
    }
    if(RED_SWEEP_INDEX.length < rcount) {
      pool.free(RED_SWEEP_INDEX)
      RED_SWEEP_INDEX = pool.mallocInt32(rcount)
    }
    if(BLUE_SWEEP_QUEUE.length < rcount) {
      pool.free(BLUE_SWEEP_QUEUE)
      BLUE_SWEEP_QUEUE = pool.mallocInt32(rcount)
    }
    if(BLUE_SWEEP_INDEX.length < rcount) {
      pool.free(BLUE_SWEEP_INDEX)
      BLUE_SWEEP_INDEX = pool.mallocInt32(rcount)
    }
    if(COMMON_SWEEP_QUEUE.length < rcount) {
      pool.free(COMMON_SWEEP_QUEUE)
      COMMON_SWEEP_QUEUE = pool.mallocInt32(rcount)
    }
    if(COMMON_SWEEP_INDEX.length < rcount) {
      pool.free(COMMON_SWEEP_INDEX)
      COMMON_SWEEP_INDEX = pool.mallocInt32(rcount)
    }
    var eventLength = 8 * rcount
    if(SWEEP_EVENTS.length < eventLength) {
      pool.free(SWEEP_EVENTS)
      SWEEP_EVENTS = pool.mallocDouble(eventLength)
    }
  }
docs: Reserves memory for the 1D sweep data structures