You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi, I have a case where a function that has a mistake takes an exponentially increasing amount of time to return that error.
This is an example showing what happens when looking for a field that exists ('a') and one that does not exist ('c'). In both cases I measure the running time. When successful the function is very fast (including compilation time), but when it fails, the time it takes to return the error is exponentially related to the amount of functions in the chainer object. For those wondering where this chainer object comes from, please look at #3405
Every function that is added to the chain multiplies the wait time by 2!!!
Hi, I have a case where a function that has a mistake takes an exponentially increasing amount of time to return that error.
This is an example showing what happens when looking for a field that exists ('a') and one that does not exist ('c'). In both cases I measure the running time. When successful the function is very fast (including compilation time), but when it fails, the time it takes to return the error is exponentially related to the amount of functions in the chainer object. For those wondering where this chainer object comes from, please look at #3405
Every function that is added to the chain multiplies the wait time by 2!!!
EDIT, forgot to paste the output
The text was updated successfully, but these errors were encountered: