if true , a new batch of parallel random numbers is automatically precomputed in background as soon as one starts to consume numbers from the current batch this gives faster random numbers , at the risk of computing more values than needed concode_field_sep int intSignMask concode_elem_sep CLBuffer<Integer> seeds concode_elem_sep int consumedInts concode_elem_sep boolean isDataFresh concode_elem_sep double doubleDivid concode_elem_sep int doubleMask concode_elem_sep boolean preload concode_elem_sep double floatDivid concode_elem_sep int[] globalWorkSizes concode_elem_sep XORShiftRandom randomProgram concode_elem_sep CLBuffer<Integer> output concode_elem_sep int floatMask concode_elem_sep CLContext context concode_elem_sep Pointer<Integer> lastData concode_elem_sep int parallelSize concode_elem_sep CLQueue queue concode_elem_sep CLEvent preloadEvent concode_field_sep float nextFloat concode_elem_sep void next concode_elem_sep Pointer<Integer> next concode_elem_sep void initSeeds concode_elem_sep void readLastOutputData concode_elem_sep boolean isPreload concode_elem_sep int nextInt concode_elem_sep int nextInt concode_elem_sep long nextLong concode_elem_sep CLEvent preload concode_elem_sep CLBuffer<Integer> getSeeds concode_elem_sep double nextDouble concode_elem_sep CLQueue getQueue concode_elem_sep int getParallelSize concode_elem_sep CLEvent doNext concode_elem_sep void waitForData
void function ( boolean arg0 ) { this . preload = arg0 ; if ( arg0 && preloadEvent == null ) { if ( lastData == null ) { preloadEvent = randomProgram . gen_numbers ( queue , seeds , output , globalWorkSizes , null ) ; } else if ( consumedInts > 0 ) { arg0 ( ) ; } } }