 (defn rank
   "Returns the index of the given key in the given PSQ in key order, or -1 if
   not present."
+  {:added "0.0.1"}
   [psq key]
   (.rank ^PersistentPrioritySearchQueue psq key))
 

  equal, they are handled as if by repeated uses of assoc. NB. this function
  takes a seqable of keys and priorities; see psqueue for a variant taking
  varargs."
  [keypriorities]
  (PersistentPrioritySearchQueue/create (seq keypriorities)))


  "Like subseq, 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 subseq and filter."
  {:added "0.0.1"}
  ([psq ubound test limit]
   (seq<= (subrange psq test limit) ubound))
  ([psq ubound start-test start end-test end]
