Full namespace name:
clojure.set OverviewSet operations such as union/intersection.
Usage: (difference s1) (difference s1 s2) (difference s1 s2 & sets)
Return a set that is the first set without elements of the remaining setsAdded in Clojure version 1.0
Usage: (index xrel ks)
Returns a map of the distinct values of ks in the xrel mapped to a set of the maps in xrel with the corresponding values of ks.Added in Clojure version 1.0
Usage: (intersection s1) (intersection s1 s2) (intersection s1 s2 & sets)
Return a set that is the intersection of the input setsAdded in Clojure version 1.0
Usage: (join xrel yrel) (join xrel yrel km)
When passed 2 rels, returns the rel corresponding to the natural join. When passed an additional keymap, joins on the corresponding keys.Added in Clojure version 1.0
Usage: (map-invert m)
Returns the map with the vals mapped to the keys.Added in Clojure version 1.0
Usage: (project xrel ks)
Returns a rel of the elements of xrel with only the keys in ksAdded in Clojure version 1.0
Usage: (rename xrel kmap)
Returns a rel of the maps in xrel with the keys in kmap renamed to the vals in kmapAdded in Clojure version 1.0
Usage: (rename-keys map kmap)
Returns the map with the keys in kmap renamed to the vals in kmapAdded in Clojure version 1.0
Usage: (select pred xset)
Returns a set of the elements for which pred is trueAdded in Clojure version 1.0
Usage: (subset? set1 set2)
Is set1 a subset of set2?Added in Clojure version 1.2
Usage: (superset? set1 set2)
Is set1 a superset of set2?Added in Clojure version 1.2
Usage: (union) (union s1) (union s1 s2) (union s1 s2 & sets)
Return a set that is the union of the input setsAdded in Clojure version 1.0
Logo & site design by
Tom Hickey.
Clojure auto-documentation system by Tom Faulhaber.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4