[Issue 9976] Needlessly large instantiation depth in std.typetuple algorithms

[d-bugmail at puremagic.com]

http://d.puremagic.com/issues/show_bug.cgi?id=9976



--- Comment #14 from khurshid <khurshid.normuradov at gmail.com> 2013-06-14 11:22:03 PDT ---
(In reply to comment #13)
> (In reply to comment #12)
> > 8. staticIndexOf     which used genericIndexOf
> 
> I've reported about this before:
> http://forum.dlang.org/thread/mailman.1418.1346015010.31962.digitalmars-d@puremagic.com
> 
> http://forum.dlang.org/thread/CAJ85NXA3F5se9hv3iA80hyQbwXBuP-ffon6ay=AXG+E11sicdw@mail.gmail.com
> 
> A speedup would be very welcome.

I've reported also, today :-). 

http://forum.dlang.org/thread/xwzivolcokzulonslkbq@forum.dlang.org

I think that need implement all linear algorithms   with "bisection" principle 
as above , instead of "head/tail" principle.

-- 
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
------- You are receiving this mail because: -------