[WIP] A Big O notation and algebra for D

[Timothee Cour via Digitalmars-d]

https://en.wikipedia.org/wiki/Lattice_(order)

On Sun, Dec 18, 2016 at 10:46 AM, John Colvin via Digitalmars-d <
digitalmars-d at puremagic.com> wrote:

> On Sunday, 18 December 2016 at 18:26:27 UTC, Andrei Alexandrescu wrote:
>
>> Article: http://erdani.com/d/bigo.html (do not publish; should do it
>> with Mike)
>>
>> Code (preliminary): https://github.com/dlang/phobos/pull/4965
>>
>>
>> Andrei
>>
>
> static assert(
>>   complexity!(insertFrontMany!MyC) <= O("n2") * log(O("n1")),
>>   "Too high complexity for insertFrontMany.");
>>
>
> You defined insertFrontMany as taking 2 template arguments, but here you
> only give it 1.
>
> as the top of the lattice defined by the partial order ≤.
>>
>
> reads weird to me. s/lattice/ladder ?
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.puremagic.com/pipermail/digitalmars-d/attachments/20161218/cffc4eb6/attachment.html>