Bug 7992 – std.algorithm.find breaks in certain circumstances
Status
RESOLVED
Resolution
FIXED
Severity
normal
Priority
P2
Component
phobos
Product
D
Version
D2
Platform
All
OS
All
Creation time
2012-04-26T14:57:00Z
Last change time
2012-10-13T14:42:24Z
Assigned to
nobody
Creator
nyphbl8d
Comments
Comment #0 by nyphbl8d — 2012-04-26T14:57:31Z
When std.algorithm.find is used with a type that forces it to use simpleMindedFind and the type in question supports the length attribute, simpleMindedFind will throw an assert if the string to be searched does not contain the search string.
For example:
struct omgstring {
string data;
// Start hasLength functions
@property {
size_t length() const {return data.length;}
void length(size_t len) {data.length = len;}
}
// End hasLength functions
// Start InputRange functions
bool empty() const {return data.empty();}
dchar front() const {return data.front();}
void popFront() {data.popFront();}
// End InputRange functions
// Start ForwardRange functions (implies InputRange)
mycustring save() {return this;}
// End ForwardRange functions
}
// succeeds
simpleMindedFind!"a == b"("a","b");
// throws assert when it pops past the last element
simpleMindedFind!"a == b"(to!omgstring("a"),to!omgstring("b"));
Note that I'm not actually calling simpleMindedFind directly, but that is the function the code ends up in when throwing the assert. The code executes correctly if the length property is removed.
OK, something is very broken in simpleMindedFind(). When both haystack and needle have the length property, estimateNeedleLength is set to false, and estimatedNeedleLength is set to 0. Therefore, haystackTooShort() is always false.
So in the searching loop, the if(haystackTooShort()) is skipped, and it falls straight through to the for(auto h=haystack.save;...) loop. But here, if h.empty is true, then because estimateNeedleLength is false, this goes straight to "continue searching", which calls popFront() on an empty range.