| Age | Commit message (Collapse) | Author |
|---|
|
A multitude of broken links were found when a bug was fixed
in the link checker.
|
|
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]>
|
|
|
|
|
|
|
|
|
|
Language cleaned up by the technical writers xsipewe and tmanevik
from Combitech. Proofreading and corrections by Björn Gustavsson.
|
|
|
|
|
|
|
|
* bg/efficiency-guide:
Efficiency Guide: Recommend external funs over tuple funs
Efficiency Guide: The maximum number of atoms can be configured
Efficiency Guide: Fix typos
OTP-8515 bg/efficiency-guide
|
|
|
|
|
