diff options
| author | Matthew Sackman <matthew@rabbitmq.com> | 2011-08-17 14:56:09 +0100 |
|---|---|---|
| committer | Matthew Sackman <matthew@rabbitmq.com> | 2011-08-17 14:56:09 +0100 |
| commit | 7cf68828f0e8d83d061218436e906ca831e11e26 (patch) | |
| tree | 10da2c9d69a2ce1efdda1d01f0379786bf10984f /docs | |
| parent | 30b3e146747b9b67b90bafb3d6bef2abb31c85c7 (diff) | |
| download | rabbitmq-server-git-7cf68828f0e8d83d061218436e906ca831e11e26.tar.gz | |
Get algorithmic complexity of function right.
Yes, it's 4 more lines, but:
> L = [{X,X} || X <- lists:seq(1,1000000)].
> timer:tc(erlang,apply,[fun () -> mirrored_supervisor:merge_proplists(L, L) end, []]).
{190570,[...]}
whereas with previous implementation, after eight minutes, this still hadn't completed.
Diffstat (limited to 'docs')
0 files changed, 0 insertions, 0 deletions