[Issue 10403] memchr optimization for std.algorithm.find

[d-bugmail at puremagic.com]

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


monarchdodra at gmail.com changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
         AssignedTo|monarchdodra at gmail.com      |nobody at puremagic.com


--- Comment #5 from monarchdodra at gmail.com 2013-06-20 00:11:35 PDT ---
Actually, I thought about it some more(In reply to comment #4)
> (In reply to comment #3)
> > (In reply to comment #2)
> > > And checking for (Elem.min <= needle && needle <= Elem.max) is needed only when
> > > it's possible that it might be true, [..]
> > 
> > I mean... checking for (Elem.min <= needle && needle <= Elem.max) is needed
> > only when it's possible that it might be false
> 
> Oh...
> 
> OK. Makes sense, hadn't thought of that :/ Will deal with it.

Hum... dealing with this optimization is making the code much more complicated
then I care for right now...

So I'm just leaving it out. Sorry. I did put quite a few other in though...

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