diff options
| author | Johannes Schickel | 2010-07-30 23:24:22 +0000 |
|---|---|---|
| committer | Johannes Schickel | 2010-07-30 23:24:22 +0000 |
| commit | 8e8023d7cc24991f5ccf86734a8f95da6ac92f50 (patch) | |
| tree | a180069fe8bc4c9cca698e3ef1ef86ed55537300 | |
| parent | e29d6e681a2eccbfbedaf584f4cc530311ce1eb0 (diff) | |
| download | scummvm-rg350-8e8023d7cc24991f5ccf86734a8f95da6ac92f50.tar.gz scummvm-rg350-8e8023d7cc24991f5ccf86734a8f95da6ac92f50.tar.bz2 scummvm-rg350-8e8023d7cc24991f5ccf86734a8f95da6ac92f50.zip | |
JANITORIAL: Add comment about the stability of Common::sort.
svn-id: r51522
| -rw-r--r-- | common/algorithm.h | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/common/algorithm.h b/common/algorithm.h index d3f518b225..12c15f9b5d 100644 --- a/common/algorithm.h +++ b/common/algorithm.h @@ -197,6 +197,10 @@ T sortPartition(T first, T last, T pivot, StrictWeakOrdering &comp) { /** * Simple sort function, modeled after std::sort. * It compares data with the given comparator object comp. + * + * Like std::sort this is not guaranteed to be stable. + * Actually as the time of writing our implementation + * is unstable. */ template<typename T, class StrictWeakOrdering> void sort(T first, T last, StrictWeakOrdering comp) { |