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 <dmytro.lytovchenko@erlang-solutions.com>

* legoscia/patch-2:
  Remove mention of erlang:fault

* essen/weird-strncmp-len:
  Fix weird strncmp length in erl_interface example

OTP-13081

erlang:fault no longer exists, so don't mention it in the reference manual.

Also fix minor markup issue in following paragraph.

* gomoripeti/bindoc_fix:
  Very minor fixes to binary handling documentation

* entropiae/patch-1:
  Fixed typo in otp design principles

OTP-13017