 (defn psq
   "Returns a new priority search queue containing the contents of coll, which
   must be a collection of map entries or doubleton vectors."
+  {:added "0.0.1"}
   [coll]
   (reduce conj PersistentPrioritySearchQueue/EMPTY coll))
 

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


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

