Apologies in advance if this topic has been covered. We have
found that stable sort blows up when called with a single
element (i.e. RandomAccessIte rator beg = RandomAccessIte rator end).
Is this commonly known and we're just behind the curve? Is
there any kind of fix available other than checking for list
size = 1 before every call (it's a large project)? Any
ideas/suggestions are appreciated.
J. Speer
found that stable sort blows up when called with a single
element (i.e. RandomAccessIte rator beg = RandomAccessIte rator end).
Is this commonly known and we're just behind the curve? Is
there any kind of fix available other than checking for list
size = 1 before every call (it's a large project)? Any
ideas/suggestions are appreciated.
J. Speer