mirror of
https://github.com/RGBCube/serenity
synced 2025-05-18 08:05:07 +00:00
2601441486
If we don't limit the sizes of the intermediate results, they will grow indefinitely, causing each iteration to take longer and longer (in both memcpy time, and algorithm runtime). While calculating the trimmed length is fairly expensive, it's a small cost to pay for uniform iteration times. |
||
|---|---|---|
| .. | ||
| ModularFunctions.cpp | ||
| ModularFunctions.h | ||