[phobos] [D-Programming-Language/phobos] 721fcb: Fix https://issues.dlang.org/show_bug.cgi?id=15553

[GitHub via phobos]

  Branch: refs/heads/master
  Home:   https://github.com/D-Programming-Language/phobos
  Commit: 721fcb40ed6010cc15c02078427944ebe09e5735
      https://github.com/D-Programming-Language/phobos/commit/721fcb40ed6010cc15c02078427944ebe09e5735
  Author: Andrei Alexandrescu <andrei at erdani.com>
  Date:   2016-01-11 (Mon, 11 Jan 2016)

  Changed paths:
    M std/algorithm/sorting.d

  Log Message:
  -----------
  Fix https://issues.dlang.org/show_bug.cgi?id=15553


  Commit: 9c7f0dabc35fa2a70f61227e7fa078e017cc6cd6
      https://github.com/D-Programming-Language/phobos/commit/9c7f0dabc35fa2a70f61227e7fa078e017cc6cd6
  Author: Andrei Alexandrescu <andrei at erdani.com>
  Date:   2016-01-11 (Mon, 11 Jan 2016)

  Changed paths:
    M std/algorithm/sorting.d

  Log Message:
  -----------
  Actually the pivot must be swapped back, but only upon success


  Commit: 06cb165a472aacab6a075be165abb1712a73db92
      https://github.com/D-Programming-Language/phobos/commit/06cb165a472aacab6a075be165abb1712a73db92
  Author: Andrei Alexandrescu <andrei at erdani.com>
  Date:   2016-01-11 (Mon, 11 Jan 2016)

  Changed paths:
    M std/algorithm/sorting.d

  Log Message:
  -----------
  Improve performance of partition


  Commit: 19288618af061c1b4db1c34db2d1055612a7e6b1
      https://github.com/D-Programming-Language/phobos/commit/19288618af061c1b4db1c34db2d1055612a7e6b1
  Author: Andrei Alexandrescu <andrei at erdani.com>
  Date:   2016-01-11 (Mon, 11 Jan 2016)

  Changed paths:
    M std/algorithm/searching.d
    M std/algorithm/sorting.d

  Log Message:
  -----------
  Bug fix: swap must happen


  Commit: d95d96f05da1b56aaad4b6fe8032bcc890489aa9
      https://github.com/D-Programming-Language/phobos/commit/d95d96f05da1b56aaad4b6fe8032bcc890489aa9
  Author: Andrei Alexandrescu <andrei at erdani.com>
  Date:   2016-01-11 (Mon, 11 Jan 2016)

  Changed paths:
    M std/algorithm/searching.d

  Log Message:
  -----------
  No need to test if range is empty in minPos


  Commit: a505de3b5153d72fb579ee2fab6f78898341a50d
      https://github.com/D-Programming-Language/phobos/commit/a505de3b5153d72fb579ee2fab6f78898341a50d
  Author: Andrei Alexandrescu <andrei at erdani.com>
  Date:   2016-01-11 (Mon, 11 Jan 2016)

  Changed paths:
    M std/algorithm/searching.d

  Log Message:
  -----------
  Always return range.save


  Commit: 10da3381c1d8d92ba8f0ef96e157beb1ada83f49
      https://github.com/D-Programming-Language/phobos/commit/10da3381c1d8d92ba8f0ef96e157beb1ada83f49
  Author: Ilya Yaroshenko <ilyayaroshenko at gmail.com>
  Date:   2016-01-13 (Wed, 13 Jan 2016)

  Changed paths:
    M std/algorithm/searching.d
    M std/algorithm/sorting.d

  Log Message:
  -----------
  Merge pull request #3921 from andralex/15553

Fix Issue 15553 - topN very inefficient [slower than sort, even for topN(0)] but should be O(n)


Compare: https://github.com/D-Programming-Language/phobos/compare/1e74490f44d1...10da3381c1d8