lib/intersect.js
function iterInit(d, count) {
  var levels = (8 * bits.log2(count+1) * (d+1))|0
  var maxInts = bits.nextPow2(IFRAME_SIZE*levels)
  if(BOX_ISTACK.length < maxInts) {
    pool.free(BOX_ISTACK)
    BOX_ISTACK = pool.mallocInt32(maxInts)
  }
  var maxDoubles = bits.nextPow2(DFRAME_SIZE*levels)
  if(BOX_DSTACK.length < maxDoubles) {
    pool.free(BOX_DSTACK)
    BOX_DSTACK = pool.mallocDouble(maxDoubles)
  }
}
function iterInit(d, count) {
  var levels = (8 * bits.log2(count+1) * (d+1))|0
  var maxInts = bits.nextPow2(IFRAME_SIZE*levels)
  if(BOX_ISTACK.length < maxInts) {
    pool.free(BOX_ISTACK)
    BOX_ISTACK = pool.mallocInt32(maxInts)
  }
  var maxDoubles = bits.nextPow2(DFRAME_SIZE*levels)
  if(BOX_DSTACK.length < maxDoubles) {
    pool.free(BOX_DSTACK)
    BOX_DSTACK = pool.mallocDouble(maxDoubles)
  }
}
function iterInit ( d , count ) { var levels = ( 8 * bits . log2 ( count + 1 ) * ( d + 1 ) ) | 0 var maxInts = bits . nextPow2 ( IFRAME_SIZE * levels ) if ( BOX_ISTACK . length < maxInts ) { pool . free ( BOX_ISTACK ) BOX_ISTACK = pool . mallocInt32 ( maxInts ) } var maxDoubles = bits . nextPow2 ( DFRAME_SIZE * levels ) if ( BOX_DSTACK . length < maxDoubles ) { pool . free ( BOX_DSTACK ) BOX_DSTACK = pool . mallocDouble ( maxDoubles ) } }
Initialize iterative loop queue
Initialize iterative loop queue