17 Library introduction [library]

17.6 Library-wide requirements [requirements]

17.6.5 Conforming implementations [conforming]

17.6.5.7 Requirements for stable algorithms [algorithm.stable]

1

When the requirements for an algorithm state that it is “stable” without further elaboration, it means:

  • (1.1)

    For the sort algorithms the relative order of equivalent elements is preserved.

  • (1.2)

    For the remove algorithms the relative order of the elements that are not removed is preserved.

  • (1.3)

    For the merge algorithms, for equivalent elements in the original two ranges, the elements from the first range precede the elements from the second range.