Back
vals (clj)
(source)function
(vals map)
Returns a sequence of the map's values, in the same order as (seq map).
Examples
babashka/babashka
(ns babashka.impl.protocols
(:require [babashka.impl.protocols :as protocols]
[clojure.core.protocols :as p]
[clojure.datafy :as d]
;; ensure datafy is loaded, we're going to override its
;; clojure.lang.Namespace implementation for datafy
[clojure.reflect]
[sci.core :as sci :refer [copy-var]]
[sci.impl.types :as types]
[sci.impl.vars]))
;; IKVReduce only added for satisies? check for now. We can implement
;; kv-reduce in the future, but this needs patching some functions like
;; update-vals, etc.
'IKVReduce (sci/new-var 'clojure.core.protocols/IKVReduce {:protocol p/IKVReduce
;; :methods #{'kv-reduce}
:ns protocols-ns}
{:ns protocols-ns})
;; 'kv-reduce (copy-var kv-reduce protocols-ns)
}
)
clojure/core.typed
(ns ^:skip-wiki clojure.core.typed.ann.clojure
"Type annotations for the base Clojure distribution."
(:require [#?(:clj clojure.core.typed
:cljs cljs.core.typed)
:refer [defalias] :as t]))
(defalias
^{:doc "A persistent map with keys k and vals v."
:forms '[(Map t t)]}
t/Map
(t/TFn [[k :variance :covariant]
[v :variance :covariant]]
(clojure.lang.IPersistentMap k v)))
(t/rclass-preds
; clojure.lang.Seqable
; {:pred (fn [this a?]
; (cond
; (string? this) (every? a? this)
; (coll? this) (every? a? this)))}
clojure.lang.IPersistentCollection
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.ISeq
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.IPersistentSet
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.APersistentSet
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.PersistentHashSet
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.PersistentTreeSet
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.Associative
{:args #{2}
:pred (fn [this a? b?]
`(cond
(vector? ~this) (and (every? ~a? (range (count ~this)))
(every? ~b? ~this))
(map? ~this) (and (every? ~a? (keys ~this))
(every? ~b? (vals ~this)))))}
clojure.lang.IPersistentStack
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.IPersistentVector
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.APersistentVector
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.PersistentVector
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.IMapEntry
{:args #{2}
:pred (fn [this a? b?]
`(and (~a? (key ~this)) (~b? (val ~this))))}
clojure.lang.AMapEntry
{:args #{2}
:pred (fn [this a? b?]
`(and (~a? (key ~this)) (~b? (val ~this))))}
clojure.lang.MapEntry
{:args #{2}
:pred (fn [this a? b?]
`(and (~a? (key ~this)) (~b? (val ~this))))}
clojure.lang.IPersistentMap
{:args #{2}
:pred (fn [this a? b?]
`(and (every? ~a? (keys ~this))
(every? ~b? (vals ~this))))}
clojure.lang.ASeq
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.APersistentMap
{:args #{2}
:pred (fn [this a? b?]
`(and (every? ~a? (keys ~this))
(every? ~b? (vals ~this))))}
clojure.lang.PersistentHashMap
{:args #{2}
:pred (fn [this a? b?]
`(and (every? ~a? (keys ~this))
(every? ~b? (vals ~this))))}
clojure.lang.Cons
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.IPersistentList
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.PersistentList
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.LazySeq
{:args #{1}
:pred (fn [this a?]
`(every? ~a? ~this))}
clojure.lang.Reduced
{:args #{1}
:pred (fn [this a?]
`(~a? (deref ~this)))})
clojure/core.typed
;copied from clojure.tools.analyzer.passes.constant-lifter
(ns clojure.core.typed.analyzer.common.passes.constant-lifter
(:require [clojure.core.typed.analyzer.common :as common]
[clojure.core.typed.analyzer.common.utils :refer [const-val]]))
(defmethod constant-lift :map
[{:keys [keys vals form env] :as ast}]
(if (and (every? :literal? keys)
(every? :literal? vals)
(empty? (meta form)))
(let [c (into (empty form)
(zipmap (mapv const-val keys)
(mapv const-val vals)))
c (if (= (class c) (class form))
c
(apply array-map (mapcat identity c)))]
(merge (dissoc ast :keys :vals :children)
{:op :const
::common/op ::common/const
:val c
:type :map
:literal? true}))
ast))
fluree/db
(ns json-ld
(:require [fluree.db.method.ipfs.core :as ipfs]
[fluree.db.db.json-ld :as jld-db]
[fluree.db.json-ld.transact :as jld-tx]
[clojure.core.async :as async]
[fluree.db.flake :as flake]
[fluree.db.json-ld.api :as fluree]
[fluree.db.util.async :refer [<?? go-try channel?]]
[fluree.db.query.range :as query-range]
[fluree.db.constants :as const]
[fluree.db.dbproto :as dbproto]
[fluree.db.did :as did]
[fluree.db.conn.proto :as conn-proto]
[fluree.db.util.json :as json]
[fluree.json-ld :as json-ld]
[fluree.db.indexer.default :as indexer]
[fluree.db.indexer.proto :as idx-proto]
[fluree.db.util.log :as log]))
(->> (fluree/db ledger)
:schema
:pred
vals
set
(filter #(true? (:ref? %)))
(map :id)
sort)
Sophia-Gold/madhava
(ns madhava.parser
(:require [madhava.ast :refer [ast example]]
[clojure.core.async.impl.ioc-macros :refer [parse-to-state-machine]]
[clojure.pprint :refer [pprint]]))
(defmacro ssa [f]
`(-> ~f
ast
second
parse-to-state-machine
second
:blocks
vals
first))