{:group-id "dev.weavejester", :artifact-id "medley", :version "1.8.0", :analysis {"clj" ({:name medley.core, :publics ({:name abs, :file "medley/core.cljc", :line 587, :arglists ([x]), :doc "Returns the absolute value of a number.\n", :type :var} {:name assoc-some, :file "medley/core.cljc", :line 43, :arglists ([m k v] [m k v & kvs]), :doc "Associates a key k, with a value v in a map m, if and only if v is not nil.\n", :type :var} {:name boolean?, :file "medley/core.cljc", :line 191, :arglists ([x]), :doc "Returns true if x is a boolean.\n", :type :var} {:name collate-by, :file "medley/core.cljc", :line 293, :arglists ([keyf collatef coll] [keyf collatef initf coll]), :added "1.8.0", :doc "Similar to `clojure.core/group-by`, this groups values in a collection,\ncoll, based on the return value of a function, keyf applied to each element.\n\nUnlike `group-by`, the values of the map are constructed via an initf and\ncollatef function. The initf function is applied to the first element\nmatched by keyf, and defaults to the identity function. The collatef function\ntakes the result of initf and the next keyed element, and produces a new\nvalue.\n\nTo put this in context, the `group-by` function can be defined as:\n\n (defn group-by [f coll]\n (collate-by f conj vector coll))\n\nWhile the `medley.core/index-by` function can be (and is) defined as:\n\n (defn index-by [f coll]\n (collate-by f (fn [_ x] x) coll))", :type :var} {:name dedupe-by, :file "medley/core.cljc", :line 386, :arglists ([f] [f coll]), :doc "Returns a lazy sequence of the elements of coll, removing any **consecutive**\nelements that return duplicate values when passed to a function f. Returns a\nstateful transducer when no collection is provided.", :type :var} {:name deep-merge, :file "medley/core.cljc", :line 261, :arglists ([& maps]), :added "1.1.0", :doc "Recursively merges maps together. If all the maps supplied have nested maps\nunder the same keys, these nested maps are merged. Otherwise the value is\noverwritten, as in `clojure.core/merge`.", :type :var} {:name deref-reset!, :file "medley/core.cljc", :line 609, :arglists ([atom newval]), :doc "Sets the value of the atom without regard for the current value, then returns\nthe original value of the atom. See also: [[deref-swap!]].", :type :var} {:name deref-swap!, :file "medley/core.cljc", :line 592, :arglists ([atom f & args]), :doc "Atomically swaps the value of the atom to be `(apply f x args)`, where x is\nthe current value of the atom, then returns the original value of the atom.\nThis function therefore acts like an atomic `deref` then `swap!`.", :type :var} {:name dissoc-in, :file "medley/core.cljc", :line 22, :arglists ([m ks] [m ks & kss]), :doc "Dissociate a value in a nested associative structure, identified by a sequence\nof keys. Any collections left empty by the operation will be dissociated from\ntheir containing structures.", :type :var} {:name distinct-by, :file "medley/core.cljc", :line 358, :arglists ([f] [f coll]), :doc "Returns a lazy sequence of the elements of coll, removing any elements that\nreturn duplicate values when passed to a function f. Returns a stateful\ntransducer when no collection is provided.", :type :var} {:name drop-upto, :file "medley/core.cljc", :line 426, :arglists ([pred] [pred coll]), :doc "Returns a lazy sequence of the items in coll starting *after* the first item\nfor which `(pred item)` returns true. Returns a stateful transducer when no\ncollection is provided.", :type :var} {:name ex-cause, :file "medley/core.cljc", :line 623, :arglists ([ex]), :doc "Returns the cause attached to the given ExceptionInfo/Throwable object. For\nall other types returns nil. Same as `cljs.core/ex-cause` except it works for\nClojure as well as ClojureScript.", :type :var} {:name ex-message, :file "medley/core.cljc", :line 615, :arglists ([ex]), :doc "Returns the message attached to the given Error/Throwable object. For all\nother types returns nil. Same as `cljs.core/ex-message` except it works for\nClojure as well as ClojureScript.", :type :var} {:name filter-keys, :file "medley/core.cljc", :line 149, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (key item))` returns true.", :type :var} {:name filter-kv, :file "medley/core.cljc", :line 143, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (key item) (val item))` returns true.", :type :var} {:name filter-vals, :file "medley/core.cljc", :line 155, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (val item))` returns true.", :type :var} {:name find-first, :file "medley/core.cljc", :line 7, :arglists ([pred] [pred coll]), :doc "Finds the first item in a collection that matches a predicate. Returns a\ntransducer when no collection is provided.", :type :var} {:name greatest, :file "medley/core.cljc", :line 225, :arglists ([& xs]), :doc "Find the greatest argument (as defined by the compare function) in O(n) time.\n", :type :var} {:name greatest-by, :file "medley/core.cljc", :line 233, :arglists ([keyfn & xs]), :added "1.6.0", :doc "Return the argument for which (keyfn x) is greatest. Determined by the compare\nfunction in O(n) time. Prefer `clojure.core/max-key` if keyfn returns numbers.", :type :var} {:name index-by, :file "medley/core.cljc", :line 328, :arglists ([f coll]), :added "1.2.0", :doc "Returns a map of the elements of coll keyed by the result of f on each\nelement. The value at each key will be the last element in coll associated\nwith that key. This function is similar to `clojure.core/group-by`, except\nthat elements with the same key are overwritten, rather than added to a\nvector of values.", :type :var} {:name indexed, :file "medley/core.cljc", :line 503, :arglists ([] [coll]), :doc "Returns an ordered, lazy sequence of vectors `[index item]`, where item is a\nvalue in coll, and index its position starting from zero. Returns a stateful\ntransducer when no collection is provided.", :type :var} {:name insert-nth, :file "medley/core.cljc", :line 518, :arglists ([index item] [index item coll]), :added "1.2.0", :doc "Returns a lazy sequence of the items in coll, with a new item inserted at\nthe supplied index, followed by all subsequent items of the collection. Runs\nin O(n) time. Returns a stateful transducer when no collection is provided.", :type :var} {:name interleave-all, :file "medley/core.cljc", :line 339, :arglists ([& colls]), :doc "Returns a lazy seq of the first item in each coll, then the second, etc.\nUnlike `clojure.core/interleave`, the returned seq contains all items in the\nsupplied collections, even if the collections are different sizes.", :type :var} {:name join, :file "medley/core.cljc", :line 253, :arglists ([colls]), :added "1.1.0", :doc "Lazily concatenates a collection of collections into a flat sequence.\n", :type :var} {:name least, :file "medley/core.cljc", :line 197, :arglists ([& xs]), :doc "Return the least argument (as defined by the compare function) in O(n) time.\n", :type :var} {:name least-by, :file "medley/core.cljc", :line 205, :arglists ([keyfn & xs]), :added "1.6.0", :doc "Return the argument for which (keyfn x) is least. Determined by the compare\nfunction in O(n) time. Prefer `clojure.core/min-key` if keyfn returns numbers.", :type :var} {:name map-entry, :file "medley/core.cljc", :line 96, :arglists ([k v]), :doc "Create a map entry for a key and value pair.\n", :type :var} {:name map-keys, :file "medley/core.cljc", :line 109, :arglists ([f coll]), :doc "Maps a function over the keys of an associative collection.\n", :type :var} {:name map-kv, :file "medley/core.cljc", :line 102, :arglists ([f coll]), :doc "Maps a function over the key/value pairs of an associative collection. Expects\na function that takes two arguments, the key and value, and returns the new\nkey and value as a collection of two elements.", :type :var} {:name map-kv-keys, :file "medley/core.cljc", :line 129, :arglists ([f coll]), :added "1.2.0", :doc "Maps a function over the key/value pairs of an associative collection, using\nthe return of the function as the new key.", :type :var} {:name map-kv-vals, :file "medley/core.cljc", :line 136, :arglists ([f coll]), :added "1.2.0", :doc "Maps a function over the key/value pairs of an associative collection, using\nthe return of the function as the new value.", :type :var} {:name map-vals, :file "medley/core.cljc", :line 114, :arglists ([f coll] [f c1 & colls]), :doc "Maps a function over the values of one or more associative collections.\nThe function should accept number-of-colls arguments. Any keys which are not\nshared among all collections are ignored.", :type :var} {:name mapply, :file "medley/core.cljc", :line 284, :arglists ([f & args]), :doc "Applies a function f to the argument list formed by concatenating\neverything but the last element of args with the last element of\nargs. This is useful for applying a function that accepts keyword\narguments to a map.", :type :var} {:name partition-after, :file "medley/core.cljc", :line 485, :arglists ([pred] [pred coll]), :added "1.5.0", :doc "Returns a lazy sequence of partitions, splitting after `(pred item)` returns\ntrue. Returns a stateful transducer when no collection is provided.", :type :var} {:name partition-before, :file "medley/core.cljc", :line 494, :arglists ([pred] [pred coll]), :added "1.5.0", :doc "Returns a lazy sequence of partitions, splitting before `(pred item)` returns\ntrue. Returns a stateful transducer when no collection is provided.", :type :var} {:name partition-between, :file "medley/core.cljc", :line 443, :arglists ([pred] [pred coll]), :added "1.7.0", :doc "Applies pred to successive values in coll, splitting it each time `(pred\nprev-item item)` returns logical true. Returns a lazy seq of partitions.\nReturns a stateful transducer when no collection is provided.", :type :var} {:name queue, :file "medley/core.cljc", :line 179, :arglists ([] [coll]), :doc "Creates an empty persistent queue, or one populated with a collection.\n", :type :var} {:name queue?, :file "medley/core.cljc", :line 185, :arglists ([x]), :doc "Returns true if x implements clojure.lang.PersistentQueue.\n", :type :var} {:name random-uuid, :file "medley/core.cljc", :line 643, :arglists ([]), :doc "Generates a new random UUID. Same as `cljs.core/random-uuid` except it works\nfor Clojure as well as ClojureScript.", :type :var} {:name regexp?, :file "medley/core.cljc", :line 650, :arglists ([x]), :added "1.4.0", :doc "Returns true if the value is a regular expression.\n", :type :var} {:name remove-keys, :file "medley/core.cljc", :line 167, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (key item))` returns false.", :type :var} {:name remove-kv, :file "medley/core.cljc", :line 161, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (key item) (val item))` returns false.", :type :var} {:name remove-nth, :file "medley/core.cljc", :line 543, :arglists ([index] [index coll]), :added "1.2.0", :doc "Returns a lazy sequence of the items in coll, except for the item at the\nsupplied index. Runs in O(n) time. Returns a stateful transducer when no\ncollection is provided.", :type :var} {:name remove-vals, :file "medley/core.cljc", :line 173, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (val item))` returns false.", :type :var} {:name replace-nth, :file "medley/core.cljc", :line 565, :arglists ([index item] [index item coll]), :added "1.2.0", :doc "Returns a lazy sequence of the items in coll, with a new item replacing the\nitem at the supplied index. Runs in O(n) time. Returns a stateful transducer\nwhen no collection is provided.", :type :var} {:name take-upto, :file "medley/core.cljc", :line 406, :arglists ([pred] [pred coll]), :doc "Returns a lazy sequence of successive items from coll up to and including\nthe first item for which `(pred item)` returns true. Returns a transducer\nwhen no collection is provided.", :type :var} {:name update-existing, :file "medley/core.cljc", :line 56, :arglists ([m k f & args]), :added "1.1.0", :doc "Updates a value in a map given a key and a function, if and only if the key\nexists in the map. See: `clojure.core/update`.", :type :var} {:name update-existing-in, :file "medley/core.cljc", :line 72, :arglists ([m ks f & args]), :added "1.3.0", :doc "Updates a value in a nested associative structure, if and only if the key\npath exists. See: `clojure.core/update-in`.", :type :var} {:name uuid, :file "medley/core.cljc", :line 636, :arglists ([s]), :doc "Returns a UUID generated from the supplied string. Same as `cljs.core/uuid`\nin ClojureScript, while in Clojure it returns a `java.util.UUID` object.", :type :var} {:name uuid?, :file "medley/core.cljc", :line 631, :arglists ([x]), :doc "Returns true if the value is a UUID.\n", :type :var}), :doc "A small collection of useful, mostly pure functions that might not look out\nof place in the clojure.core namespace."}), "cljs" ({:name medley.core, :doc "A small collection of useful, mostly pure functions that might not look out\nof place in the clojure.core namespace.", :publics ({:name abs, :file "medley/core.cljc", :line 587, :arglists ([x]), :doc "Returns the absolute value of a number.\n", :type :var} {:name assoc-some, :file "medley/core.cljc", :line 43, :arglists ([m k v] [m k v & kvs]), :doc "Associates a key k, with a value v in a map m, if and only if v is not nil.\n", :type :var} {:name boolean?, :file "medley/core.cljc", :line 191, :arglists ([x]), :doc "Returns true if x is a boolean.\n", :type :var} {:name collate-by, :file "medley/core.cljc", :line 293, :arglists ([keyf collatef coll] [keyf collatef initf coll]), :added "1.8.0", :doc "Similar to `clojure.core/group-by`, this groups values in a collection,\ncoll, based on the return value of a function, keyf applied to each element.\n\nUnlike `group-by`, the values of the map are constructed via an initf and\ncollatef function. The initf function is applied to the first element\nmatched by keyf, and defaults to the identity function. The collatef function\ntakes the result of initf and the next keyed element, and produces a new\nvalue.\n\nTo put this in context, the `group-by` function can be defined as:\n\n (defn group-by [f coll]\n (collate-by f conj vector coll))\n\nWhile the `medley.core/index-by` function can be (and is) defined as:\n\n (defn index-by [f coll]\n (collate-by f (fn [_ x] x) coll))", :type :var} {:name dedupe-by, :file "medley/core.cljc", :line 386, :arglists ([f] [f coll]), :doc "Returns a lazy sequence of the elements of coll, removing any **consecutive**\nelements that return duplicate values when passed to a function f. Returns a\nstateful transducer when no collection is provided.", :type :var} {:name deep-merge, :file "medley/core.cljc", :line 261, :arglists ([& maps]), :added "1.1.0", :doc "Recursively merges maps together. If all the maps supplied have nested maps\nunder the same keys, these nested maps are merged. Otherwise the value is\noverwritten, as in `clojure.core/merge`.", :type :var} {:name deref-reset!, :file "medley/core.cljc", :line 609, :arglists ([atom newval]), :doc "Sets the value of the atom without regard for the current value, then returns\nthe original value of the atom. See also: [[deref-swap!]].", :type :var} {:name deref-swap!, :file "medley/core.cljc", :line 592, :arglists ([atom f & args]), :doc "Atomically swaps the value of the atom to be `(apply f x args)`, where x is\nthe current value of the atom, then returns the original value of the atom.\nThis function therefore acts like an atomic `deref` then `swap!`.", :type :var} {:name dissoc-in, :file "medley/core.cljc", :line 22, :arglists ([m ks] [m ks & kss]), :doc "Dissociate a value in a nested associative structure, identified by a sequence\nof keys. Any collections left empty by the operation will be dissociated from\ntheir containing structures.", :type :var} {:name distinct-by, :file "medley/core.cljc", :line 358, :arglists ([f] [f coll]), :doc "Returns a lazy sequence of the elements of coll, removing any elements that\nreturn duplicate values when passed to a function f. Returns a stateful\ntransducer when no collection is provided.", :type :var} {:name drop-upto, :file "medley/core.cljc", :line 426, :arglists ([pred] [pred coll]), :doc "Returns a lazy sequence of the items in coll starting *after* the first item\nfor which `(pred item)` returns true. Returns a stateful transducer when no\ncollection is provided.", :type :var} {:name ex-cause, :file "medley/core.cljc", :line 623, :arglists ([ex]), :doc "Returns the cause attached to the given ExceptionInfo/Throwable object. For\nall other types returns nil. Same as `cljs.core/ex-cause` except it works for\nClojure as well as ClojureScript.", :type :var} {:name ex-message, :file "medley/core.cljc", :line 615, :arglists ([ex]), :doc "Returns the message attached to the given Error/Throwable object. For all\nother types returns nil. Same as `cljs.core/ex-message` except it works for\nClojure as well as ClojureScript.", :type :var} {:name filter-keys, :file "medley/core.cljc", :line 149, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (key item))` returns true.", :type :var} {:name filter-kv, :file "medley/core.cljc", :line 143, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (key item) (val item))` returns true.", :type :var} {:name filter-vals, :file "medley/core.cljc", :line 155, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (val item))` returns true.", :type :var} {:name find-first, :file "medley/core.cljc", :line 7, :arglists ([pred] [pred coll]), :doc "Finds the first item in a collection that matches a predicate. Returns a\ntransducer when no collection is provided.", :type :var} {:name greatest, :file "medley/core.cljc", :line 225, :arglists ([& xs]), :doc "Find the greatest argument (as defined by the compare function) in O(n) time.\n", :type :var} {:name greatest-by, :file "medley/core.cljc", :line 233, :arglists ([keyfn & xs]), :added "1.6.0", :doc "Return the argument for which (keyfn x) is greatest. Determined by the compare\nfunction in O(n) time. Prefer `clojure.core/max-key` if keyfn returns numbers.", :type :var} {:name index-by, :file "medley/core.cljc", :line 328, :arglists ([f coll]), :added "1.2.0", :doc "Returns a map of the elements of coll keyed by the result of f on each\nelement. The value at each key will be the last element in coll associated\nwith that key. This function is similar to `clojure.core/group-by`, except\nthat elements with the same key are overwritten, rather than added to a\nvector of values.", :type :var} {:name indexed, :file "medley/core.cljc", :line 503, :arglists ([] [coll]), :doc "Returns an ordered, lazy sequence of vectors `[index item]`, where item is a\nvalue in coll, and index its position starting from zero. Returns a stateful\ntransducer when no collection is provided.", :type :var} {:name insert-nth, :file "medley/core.cljc", :line 518, :arglists ([index item] [index item coll]), :added "1.2.0", :doc "Returns a lazy sequence of the items in coll, with a new item inserted at\nthe supplied index, followed by all subsequent items of the collection. Runs\nin O(n) time. Returns a stateful transducer when no collection is provided.", :type :var} {:name interleave-all, :file "medley/core.cljc", :line 339, :arglists ([& colls]), :doc "Returns a lazy seq of the first item in each coll, then the second, etc.\nUnlike `clojure.core/interleave`, the returned seq contains all items in the\nsupplied collections, even if the collections are different sizes.", :type :var} {:name join, :file "medley/core.cljc", :line 253, :arglists ([colls]), :added "1.1.0", :doc "Lazily concatenates a collection of collections into a flat sequence.\n", :type :var} {:name least, :file "medley/core.cljc", :line 197, :arglists ([& xs]), :doc "Return the least argument (as defined by the compare function) in O(n) time.\n", :type :var} {:name least-by, :file "medley/core.cljc", :line 205, :arglists ([keyfn & xs]), :added "1.6.0", :doc "Return the argument for which (keyfn x) is least. Determined by the compare\nfunction in O(n) time. Prefer `clojure.core/min-key` if keyfn returns numbers.", :type :var} {:name map-entry, :file "medley/core.cljc", :line 96, :arglists ([k v]), :doc "Create a map entry for a key and value pair.\n", :type :var} {:name map-keys, :file "medley/core.cljc", :line 109, :arglists ([f coll]), :doc "Maps a function over the keys of an associative collection.\n", :type :var} {:name map-kv, :file "medley/core.cljc", :line 102, :arglists ([f coll]), :doc "Maps a function over the key/value pairs of an associative collection. Expects\na function that takes two arguments, the key and value, and returns the new\nkey and value as a collection of two elements.", :type :var} {:name map-kv-keys, :file "medley/core.cljc", :line 129, :arglists ([f coll]), :added "1.2.0", :doc "Maps a function over the key/value pairs of an associative collection, using\nthe return of the function as the new key.", :type :var} {:name map-kv-vals, :file "medley/core.cljc", :line 136, :arglists ([f coll]), :added "1.2.0", :doc "Maps a function over the key/value pairs of an associative collection, using\nthe return of the function as the new value.", :type :var} {:name map-vals, :file "medley/core.cljc", :line 114, :arglists ([f coll] [f c1 & colls]), :doc "Maps a function over the values of one or more associative collections.\nThe function should accept number-of-colls arguments. Any keys which are not\nshared among all collections are ignored.", :type :var} {:name mapply, :file "medley/core.cljc", :line 284, :arglists ([f & args]), :doc "Applies a function f to the argument list formed by concatenating\neverything but the last element of args with the last element of\nargs. This is useful for applying a function that accepts keyword\narguments to a map.", :type :var} {:name partition-after, :file "medley/core.cljc", :line 485, :arglists ([pred] [pred coll]), :added "1.5.0", :doc "Returns a lazy sequence of partitions, splitting after `(pred item)` returns\ntrue. Returns a stateful transducer when no collection is provided.", :type :var} {:name partition-before, :file "medley/core.cljc", :line 494, :arglists ([pred] [pred coll]), :added "1.5.0", :doc "Returns a lazy sequence of partitions, splitting before `(pred item)` returns\ntrue. Returns a stateful transducer when no collection is provided.", :type :var} {:name partition-between, :file "medley/core.cljc", :line 443, :arglists ([pred] [pred coll]), :added "1.7.0", :doc "Applies pred to successive values in coll, splitting it each time `(pred\nprev-item item)` returns logical true. Returns a lazy seq of partitions.\nReturns a stateful transducer when no collection is provided.", :type :var} {:name queue, :file "medley/core.cljc", :line 179, :arglists ([] [coll]), :doc "Creates an empty persistent queue, or one populated with a collection.\n", :type :var} {:name queue?, :file "medley/core.cljc", :line 185, :arglists ([x]), :doc "Returns true if x implements clojure.lang.PersistentQueue.\n", :type :var} {:name random-uuid, :file "medley/core.cljc", :line 643, :arglists ([]), :doc "Generates a new random UUID. Same as `cljs.core/random-uuid` except it works\nfor Clojure as well as ClojureScript.", :type :var} {:name regexp?, :file "medley/core.cljc", :line 650, :arglists ([x]), :added "1.4.0", :doc "Returns true if the value is a regular expression.\n", :type :var} {:name remove-keys, :file "medley/core.cljc", :line 167, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (key item))` returns false.", :type :var} {:name remove-kv, :file "medley/core.cljc", :line 161, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (key item) (val item))` returns false.", :type :var} {:name remove-nth, :file "medley/core.cljc", :line 543, :arglists ([index] [index coll]), :added "1.2.0", :doc "Returns a lazy sequence of the items in coll, except for the item at the\nsupplied index. Runs in O(n) time. Returns a stateful transducer when no\ncollection is provided.", :type :var} {:name remove-vals, :file "medley/core.cljc", :line 173, :arglists ([pred coll]), :doc "Returns a new associative collection of the items in coll for which\n`(pred (val item))` returns false.", :type :var} {:name replace-nth, :file "medley/core.cljc", :line 565, :arglists ([index item] [index item coll]), :added "1.2.0", :doc "Returns a lazy sequence of the items in coll, with a new item replacing the\nitem at the supplied index. Runs in O(n) time. Returns a stateful transducer\nwhen no collection is provided.", :type :var} {:name take-upto, :file "medley/core.cljc", :line 406, :arglists ([pred] [pred coll]), :doc "Returns a lazy sequence of successive items from coll up to and including\nthe first item for which `(pred item)` returns true. Returns a transducer\nwhen no collection is provided.", :type :var} {:name update-existing, :file "medley/core.cljc", :line 56, :arglists ([m k f & args]), :added "1.1.0", :doc "Updates a value in a map given a key and a function, if and only if the key\nexists in the map. See: `clojure.core/update`.", :type :var} {:name update-existing-in, :file "medley/core.cljc", :line 72, :arglists ([m ks f & args]), :added "1.3.0", :doc "Updates a value in a nested associative structure, if and only if the key\npath exists. See: `clojure.core/update-in`.", :type :var} {:name uuid, :file "medley/core.cljc", :line 636, :arglists ([s]), :doc "Returns a UUID generated from the supplied string. Same as `cljs.core/uuid`\nin ClojureScript, while in Clojure it returns a `java.util.UUID` object.", :type :var} {:name uuid?, :file "medley/core.cljc", :line 631, :arglists ([x]), :doc "Returns true if the value is a UUID.\n", :type :var})})}, :pom-str "\n\n 4.0.0\n dev.weavejester\n medley\n jar\n 1.8.0\n medley\n A lightweight library of useful, mostly pure functions\n https://github.com/weavejester/medley\n \n \n Eclipse Public License\n http://www.eclipse.org/legal/epl-v10.html\n \n \n \n https://github.com/weavejester/medley\n scm:git:git://github.com/weavejester/medley.git\n scm:git:ssh://git@github.com/weavejester/medley.git\n 30e3f855a1854171846dfcc14c39245fd253a971\n \n \n src\n test\n \n \n resources\n \n \n \n \n resources\n \n \n target\n target/classes\n \n \n \n \n central\n https://repo1.maven.org/maven2/\n \n false\n \n \n true\n \n \n \n clojars\n https://repo.clojars.org/\n \n true\n \n \n true\n \n \n \n \n \n \n \n \n org.clojure\n clojure\n 1.9.0\n \n \n org.clojure\n clojurescript\n 1.10.439\n provided\n \n \n criterium\n criterium\n 0.4.6\n test\n \n \n org.mozilla\n rhino\n 1.7.14\n test\n \n \n\n\n\n"}