   "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))
 

  "Like rsubseq, 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 rsubseq and filter."
  ([psq ubound test limit]
   (let [sub (subrange psq test limit)]
     (reverse-at-most sub ubound)))


  entry is the entry at the split key if present in the given PSQ, otherwise
  nil."
  {:added "0.0.1"}
  [psq key]
  (.split ^PersistentPrioritySearchQueue psq key))

