[Issue 3402] New: Please bring back canFind in std.algorithm

[d-bugmail at puremagic.com]

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

           Summary: Please bring back canFind in std.algorithm
           Product: D
           Version: 2.034
          Platform: Other
        OS/Version: Windows
            Status: NEW
          Severity: enhancement
          Priority: P2
         Component: Phobos
        AssignedTo: nobody at puremagic.com
        ReportedBy: dsimcha at yahoo.com


--- Comment #0 from David Simcha <dsimcha at yahoo.com> 2009-10-14 13:54:53 PDT ---
Sometimes in non-performance-critical code, it's nice to be able to see whether
a value is in a range in one line of code, in a straightforward way.  There is
no *clean, straightforward* way to do this with std.algorithm.find.  The old
std.algorithm had a canFind() function.  The canFindSorted() function was
retained and I find it extremely useful for building space-efficient finite
sets from arrays.  Please bring back canFind().

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