[erlang-questions] Erlang list equality check question

Oliver Korpilla Oliver.Korpilla@REDACTED
Sun Mar 25 14:49:50 CEST 2018


I'm trying to understand this topic as well.

I was under the impression that if you generated two lists independently from each but with identical elements they would not share memory, but let's say you took part of an existing list or append to an existing list they do. If this assumption is true, list comparison could only short circuit for lists indeed sharing memory.

And it seems it does (latest OTP 20.3 used on arm):

8> List1 = lists:seq(1,10000).
9> List2 = lists:seq(1,10000).
10> timer:tc(fun() -> List1 =:= List2 end). 
11> timer:tc(fun() -> List1 =:= List1 end).
12> List3 = [ 0 | List1 ].
13> timer:tc(fun() -> List1 =:= List3 end).
14> [ _ | List4 ] = List3.
15> timer:tc(fun() -> List1 =:= List4 end).

10> compares two independently generated lists and does a full walk, it seems.
11> compares the same con cell and performs much better.
13> up to 15> compares two lists that share con cells and performs much better

It seems that BEAM already short circuits list walks if it finds a shared con cell.

I'm a bit confused about the example mko_io gives though as te definition of X1 is not given? Also, what system were you testing on with what OTP version? Your numbers seem much worse than even on my Raspberry Pi 3.


Gesendet: Sonntag, 25. März 2018 um 14:04 Uhr
Von: "Pierre Fenoll" <pierrefenoll@REDACTED>
An: mko_io <me@REDACTED>
Cc: erlang-questions@REDACTED
Betreff: Re: [erlang-questions] Erlang list equality check question

This sounds like a it could be compiler optimization. 
However I think it would be better to have a lint tool suggesting to rewrite that equality comparison by extracting the head and comparing only that. Maybe code from Dialyzer could be reused to find such cases and others, providing performance tips as well as style and maybe even architectural suggestions. 
I think Erlang needs a linter. Do you guys know any such tool? Kostis has one that rewrites calls to lists:map/2 into list comprehensions but I can’t find it right now. 

On Sat 24 Mar 2018 at 23:47, mko_io <me@REDACTED[mailto:me@REDACTED]> wrote:Dear erlang community,

I’ve been reading the beam book recently, just learned the memory representation of a list is just a con cell which occupy a machine word which 2 bit tag. So It’s make sense that appending a new element on a big list is a small operation. timer:tc/1 shows X = lists:seq(1, 10000) takes 1184us and X2 = [0 | X] only takes 2 us.

But X =:= X1 takes 600us, which shows it walks the whole list to do the equality check, my question is why not just do a cheap con cell immediate comparison since erlang variables don’t vary and tl(X2) points to X1. Is there any method to do the cons equality comparison?

erlang-questions mailing list

Pierre Fenoll
 _______________________________________________ erlang-questions mailing list erlang-questions@REDACTED http://erlang.org/mailman/listinfo/erlang-questions[http://erlang.org/mailman/listinfo/erlang-questions]

More information about the erlang-questions mailing list