Thread 106396303

while(isLoading) {
loadingBar.percentage = Math.randInt() % 100
sleep(1)
}

>>106396303 (OP)
this is effectively real world code

>>106396303 (OP)
so its a nonlinear loading bar, and ?

>>106396318
I've implemented loading bars in the past by refactoring the entire program to use deterministic algorithms, e.g instead of using quicksort you use mergesort or radixsort and you know the exact number of iterations you're going to use, and invoke a callback to update progress. It's a giant pain in the ass and you should just show a generic loading animation with no progress guarantees if you can

>>106396318
I know, I've seens it.

>loading bar slowly creeps towards 90%
>once it's actually done loading then it zips to 100%

>LOADING 100% COMPLETE
>STARTS DOING SOMETHING ELSE THAT TAKES AN ADDITIONAL 5 SECONDS

>>106396943
They wait for operations, instead of processing chunks: Easier.

For example:
I need to copy 10 files of different sizes.
It speeds up the code significantly if I copy them in the easiest way possible and add 10% for each file copied.

Calculating the total size of the files and copying them partially in chunks of, say, 1MB, and updating the progress every 1MB, will make the progressbar smoother, but the code will be verbose: A bad tradeoff

>>106396303 (OP)
>while(loadingBar.percentage = floor(Math.rand())) {
sleep(1)
}