aboutsummaryrefslogtreecommitdiffstats
path: root/lib/public_key
diff options
context:
space:
mode:
authorJohn Högberg <[email protected]>2018-10-15 18:17:12 +0200
committerJohn Högberg <[email protected]>2018-10-29 08:10:55 +0100
commiteb9ee88f4cc640065f4902e270d834bfb596d5fc (patch)
treea7ca57899b6d52417900eedd12995183f54f3bd5 /lib/public_key
parent1056d2d1fd49f669a2001f03890e13c9cba76c1e (diff)
downloadotp-eb9ee88f4cc640065f4902e270d834bfb596d5fc.tar.gz
otp-eb9ee88f4cc640065f4902e270d834bfb596d5fc.tar.bz2
otp-eb9ee88f4cc640065f4902e270d834bfb596d5fc.zip
Optimize operator '--' and yield on large inputs
The removal set now uses a red-black tree instead of an array on large inputs, decreasing runtime complexity from `n*n` to `n*log(n)`. It will also exit early when there are no more items left in the removal set, drastically improving performance and memory use when the items to be removed are present near the head of the list. This got a lot more complicated than before as the overhead of always using a red-black tree was unacceptable when either of the inputs were small, but this compromise has okay-to-decent performance regardless of input size. Co-authored-by: Dmytro Lytovchenko <[email protected]>
Diffstat (limited to 'lib/public_key')
0 files changed, 0 insertions, 0 deletions