Thread overview | |||||
---|---|---|---|---|---|
|
June 14, 2013 Needlessly large instantiation depth in std.typetuple algorithms | ||||
---|---|---|---|---|
| ||||
Hi, All. I was create http://d.puremagic.com/issues/show_bug.cgi?id=9976 issue, and thanks for Kenji Hara, and others most of algorithms were changed: 1. Filter 2. anySatisfy 3. allSatisfy 4. staticMap 5. Reverse But, I think that following algorithms can change easily, too: 6. ReplaceAll which used GenericReplaseAll 7. Replace which used GenericReplace 8. NoDuplicates 9. EraseAll which used GenericEraseAll 10. Erase which used GenericErase 11. staticIndexOf which used genericIndexOf My idea was very simple-- replace head/tail principle to bisection principle. What are you think, for this idea? |
June 14, 2013 Re: Needlessly large instantiation depth in std.typetuple algorithms | ||||
---|---|---|---|---|
| ||||
Posted in reply to khurshid | On Friday, 14 June 2013 at 13:06:56 UTC, khurshid wrote:
> But, I think that following algorithms can change easily, too:
> 6. ReplaceAll which used GenericReplaseAll
> 7. Replace which used GenericReplace
> 8. NoDuplicates
> 9. EraseAll which used GenericEraseAll
> 10. Erase which used GenericErase
> 11. staticIndexOf which used genericIndexOf
12. MostDerived
|
June 14, 2013 Re: Needlessly large instantiation depth in std.typetuple algorithms | ||||
---|---|---|---|---|
| ||||
Posted in reply to khurshid | On Friday, 14 June 2013 at 13:09:34 UTC, khurshid wrote:
> But, I think that following algorithms can change easily, too:
Just add them to the bug and someone at some point will get round to fixing them :-)
|
Copyright © 1999-2021 by the D Language Foundation