digitalmars.D.bugs - [Issue 3402] New: Please bring back canFind in std.algorithm
- d-bugmail puremagic.com (22/22) Oct 14 2009 http://d.puremagic.com/issues/show_bug.cgi?id=3402
- d-bugmail puremagic.com (10/10) Oct 14 2009 http://d.puremagic.com/issues/show_bug.cgi?id=3402
- d-bugmail puremagic.com (12/12) Oct 14 2009 http://d.puremagic.com/issues/show_bug.cgi?id=3402
- d-bugmail puremagic.com (13/13) Oct 15 2009 http://d.puremagic.com/issues/show_bug.cgi?id=3402
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 puremagic.com
ReportedBy: dsimcha yahoo.com
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: -------
Oct 14 2009
http://d.puremagic.com/issues/show_bug.cgi?id=3402
Andrei Alexandrescu <andrei metalanguage.com> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |andrei metalanguage.com
18:48:33 PDT ---
I was hoping that find(...).empty is brief enough. Isn't it?
--
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
Oct 14 2009
http://d.puremagic.com/issues/show_bug.cgi?id=3402
Max Samukha <samukha voliacable.com> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |samukha voliacable.com
PDT ---
It is. But a note in the docs would be nice. An example would be enough:
// Checking if the element can be found in the range
assert(find(a, 5).empty);
--
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
Oct 14 2009
http://d.puremagic.com/issues/show_bug.cgi?id=3402
David Simcha <dsimcha yahoo.com> changed:
What |Removed |Added
----------------------------------------------------------------------------
Status|NEW |RESOLVED
Resolution| |WONTFIX
Sounds good. I just never realized it was this easy. I'll close this bug
report. Just please keep canFindSorted because find(assumeSorted(...)).empty
is just too much typing when using an array as a space-efficient finite set.
--
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
Oct 15 2009









d-bugmail puremagic.com 