1. 11 May, 2014 1 kayıt (commit)
    • Raymond Hettinger's avatar
      Issue #21424: Optimize heaqp.nlargest() to make fewer tuple comparisons. · 277842ef
      Raymond Hettinger yazdı
      Consolidates the logic for nlargest() into a single function so that
      decoration tuples (elem,order) or (key, order, elem) only need to
      be formed when a new element is added to the heap.  Formerly, a tuple
      was created for every element regardless of whether it was added to
      the heap.
      
      The change reduces the number of tuples created, the number of ordering
      integers created, and total number of tuple comparisons.
      277842ef
  2. 10 May, 2014 10 kayıt (commit)
  3. 09 May, 2014 13 kayıt (commit)
  4. 08 May, 2014 11 kayıt (commit)
  5. 07 May, 2014 5 kayıt (commit)