sort overloads
Declared in <bslstl_list.h>
Sort this list in non-decreasing order according to the order provided by operator<. operator< must provide a strict weak ordering over value_type (see []and Strict Weak Ordering)). The sort is stable, meaning that if !(a < b) && !(b < a), then the ordering of elements a and b in the sequence is preserved.
void
sort();Sort this list in non-decreasing order according to the order provided by the specified comparator predicate. comparator must define a strict weak ordering over value_type (see []and Strict Weak Ordering)). The sort is stable, meaning that if !comparator(a, b) && !comparator(b, a), then the ordering of elements a and b in the sequence is preserved.
template<class COMPARE>
void
sort(COMPARE comparator);