25 Sep
2020
25 Sep
'20
1:47 p.m.
On Fri, 2020-09-25 at 13:41 +0200, Roman Haefeli wrote:
On Fri, 2020-09-25 at 12:18 +0200, IOhannes m zmölnig wrote:
doing quick benchmarks gives the following results:
implemtation | time (length=100000) | ------------------|----------------------| 1 (repack/array) | 1.8ms | 2 (repack/tab) | 9.9ms | 3 (list/array) | 8.6ms | 4 (list/tab) | 9.8ms | 5 (list-drip/tab)| 29.8ms |
all implementations show linear complexity.
Am surprise to see that even list-drop takes linear time, but you are right. What an amazing job Mathieu did back then.
Using [list store] appears to be still roughly twice as fast compared to current [list-drip].
Roman