   "Like rseq, but only returns entries with priorities <= than the given
   ubound in the ordering determined by psq's priority comparator. This is more
   efficient than using rseq and filter."
+  {:added "0.0.1"}
   [psq ubound]
   (reverse-at-most psq ubound))
 


  (subrange psq >= start <= end) is equivalent to, but more efficient
  than, (into (empty psq) (subseq coll >= start <= end))."
  ([psq test limit]
   (cond
     (zero? (count psq))

  "keypriority => key priority
  Returns a new priority search queue with supplied mappings. If any keys are
  equal, they are handled as if by repeated uses of assoc."
  {:added "0.0.1"}
  [& keypriorities]
  (psqueue* keypriorities))

