Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://clojure.github.io/clojure/branch-1.1.x/clojure.walk-api.html below:

clojure.walk - Clojure v1.1 API documentation

Full namespace name:

This file defines a generic tree walker for Clojure data
structures.  It takes any data structure (list, vector, map, set,
seq), calls a function on every element, and uses the return value
of the function in place of the original.  This makes it fairly
easy to write recursive search-and-replace functions, as shown in
the examples.

Note: "walk" supports all Clojure data structures EXCEPT maps
created with sorted-map-by.  There is no (obvious) way to retrieve
the sorting function.

Usage: (keywordize-keys m)

Recursively transforms all map keys from strings to keywords.

Usage: (macroexpand-all form)

Recursively performs all possible macroexpansions in form.

Usage: (postwalk f form)

Performs a depth-first, post-order traversal of form.  Calls f on
each sub-form, uses f's return value in place of the original.
Recognizes all Clojure data structures except sorted-map-by.
Consumes seqs as with doall.

Usage: (postwalk-demo form)

Demonstrates the behavior of postwalk by printing each form as it is
walked.  Returns form.

Usage: (postwalk-replace smap form)

Recursively transforms form by replacing keys in smap with their
values.  Like clojure/replace but works on any data structure.  Does
replacement at the leaves of the tree first.

Usage: (prewalk f form)

Like postwalk, but does pre-order traversal.

Usage: (prewalk-demo form)

Demonstrates the behavior of prewalk by printing each form as it is
walked.  Returns form.

Usage: (prewalk-replace smap form)

Recursively transforms form by replacing keys in smap with their
values.  Like clojure/replace but works on any data structure.  Does
replacement at the root of the tree first.

Usage: (stringify-keys m)

Recursively transforms all map keys from keywords to strings.

Usage: (walk inner outer form)

Traverses form, an arbitrary data structure.  inner and outer are
functions.  Applies inner to each element of form, building up a
data structure of the same type, then applies outer to the result.
Recognizes all Clojure data structures except sorted-map-by.
Consumes seqs as with doall.

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