Maybe HugeList ought to be a Btree - large insert operations will have a faster asymptotic running time. (But then it wouldn't make a good test case for the rest of the library.) OTOH, I conjecture that the current HugeList with a splay tree underneath should be competitive with a Btree. Would be nice to implement one along side and measure.
Maybe HugeList ought to be a Btree - large insert operations will have a faster asymptotic running time. (But then it wouldn't make a good test case for the rest of the library.) OTOH, I conjecture that the current HugeList with a splay tree underneath should be competitive with a Btree. Would be nice to implement one along side and measure.