On Wednesday, 14 May 2014 at 17:57:30 UTC, monarch_dodra wrote:
BTW, this is a more "general" issue: Given a generic algorithm
"std.foo", how can I write my own (better optimized)
"object.foo", and make sure *that* is called instead?
I initially filed the issue for "retro", while indeed
mentioning that "find" was also open to the improvement:
https://issues.dlang.org/show_bug.cgi?id=12583
This spawned the thread:
http://forum.dlang.org/thread/op.xeuot6g2eav7ka@stevens-macbook-pro-2.local
Unfortunately, nothing came of it.
It's an interesting problem to solve.
Would having a specialized container range, which has search,
removal, etc primitives work better?
