[Numpy-svn] [numpy/numpy] 072014: BUG: handle introsort depth limit properly

[GitHub]

  Branch: refs/heads/master
  Home:   https://github.com/numpy/numpy
  Commit: 07201420338f87d0a19ec6b5d756f40350e1f21b
      https://github.com/numpy/numpy/commit/07201420338f87d0a19ec6b5d756f40350e1f21b
  Author: Julian Taylor <jtaylor.debian at googlemail.com>
  Date:   2016-07-29 (Fri, 29 Jul 2016)

  Changed paths:
    M numpy/core/src/npysort/quicksort.c.src

  Log Message:
  -----------
  BUG: handle introsort depth limit properly

the larger partition needs its own depth limit else it grows faster than
logarithmic.
Also increase the stack size to hold up to 64 instead of 50 pointer
pairs else it might overflow on arrays larger than than 2^50 elements.


  Commit: afc4f2419a66ee659e0f71f2891573ef612ddd30
      https://github.com/numpy/numpy/commit/afc4f2419a66ee659e0f71f2891573ef612ddd30
  Author: Julian Taylor <jtaylor.debian at googlemail.com>
  Date:   2016-07-29 (Fri, 29 Jul 2016)

  Changed paths:
    M benchmarks/benchmarks/bench_function_base.py

  Log Message:
  -----------
  BENCH: add more sort benchmarks

benchmark for random, all equal elements, many equal elements and median
of 3 worst case


  Commit: 9506037beb64217f62a205edf066b4c4ecb1ff0e
      https://github.com/numpy/numpy/commit/9506037beb64217f62a205edf066b4c4ecb1ff0e
  Author: Charles Harris <charlesr.harris at gmail.com>
  Date:   2016-07-29 (Fri, 29 Jul 2016)

  Changed paths:
    M benchmarks/benchmarks/bench_function_base.py
    M numpy/core/src/npysort/quicksort.c.src

  Log Message:
  -----------
  Merge pull request #7871 from juliantaylor/introsort2

BUG: handle introsort depth limit properly


Compare: https://github.com/numpy/numpy/compare/bc744c52bb36...9506037beb64