...
Providing an invalid ordering predicate for an associative container, or as a comparison criterion with the sorting algorithms, can result in erratic behavior or infinite loops [Meyers 01]. When an ordering predicate is required for an associative container or a generic STL standard template library algorithm, the predicate must meet the requirements for inducing a strict weak ordering.
...
In this noncompliant code example, the std::set object is created with a comparator that does not adhere to the strict weak ordering requirement. Specifically, it fails to return false for equivalent values. As a result, the behavior of iterating over the results from std::set::equal_range results in unspecified behavior:
| Code Block | ||||
|---|---|---|---|---|
| ||||
#include <functional>
#include <iostream>
#include <set>
void f() {
std::set<int, std::less_equal<int>> S{5, 10, 20};
for (auto R = S.equal_range(10); R.first != R.second; ++R.first) {
std::cout << *R.first << std::endl;
}
}
|
...
Related Vulnerabilities
Search for vulnerabilities resulting from the violation of this rule on the CERT website.
Related Guidelines
| SEI CERT Oracle Coding Standard for Java | MET10-J. Follow the general contract when implementing the compareTo() method |
...