All Downloads are FREE. Search and download functionalities are using the official Maven repository.

clojure.walk$fn__10437.class Maven / Gradle / Ivy

The newest version!
????1dclojure/walk$fn__10437clojure/lang/AFunctionwalk.clj()V
invokeStatic()Ljava/lang/Object;const__2Lclojure/lang/Var;
	clojure/core$deref&(Ljava/lang/Object;)Ljava/lang/Object;

const__3
	clojure/lang/Var
getRawRoot
java/lang/Objectconst__4Lclojure/lang/AFn; 	!clojure/lang/ArraySeq#create,([Ljava/lang/Object;)Lclojure/lang/ArraySeq;%&
$'clojure/core$commute)K(Ljava/lang/Object;Ljava/lang/Object;Lclojure/lang/ISeq;)Ljava/lang/Object;
+
*,invoke

/clojure.core2
*loaded-libs*4clojure/lang/RT6var8(Ljava/lang/String;Ljava/lang/String;)Lclojure/lang/Var;89
7:conj<clojure.walk>clojure/lang/Symbol@intern;(Ljava/lang/String;Ljava/lang/String;)Lclojure/lang/Symbol;BC
ADclojure/lang/IObjFauthorHkeyword<(Ljava/lang/String;Ljava/lang/String;)Lclojure/lang/Keyword;JK
7L
Stuart SierraNdocP?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.Rmap2([Ljava/lang/Object;)Lclojure/lang/IPersistentMap;TU
7Vclojure/lang/IPersistentMapXwithMeta2(Lclojure/lang/IPersistentMap;)Lclojure/lang/IObj;Z[G\clojure/lang/AFn^CodeLineNumberTable
SourceFileSourceDebugExtension1

 `*?	?a	
`5?????Y?"S?(?-?a.`?0?a	1`mU35?;??3=?;????E?G?YI?MSYOSYQ?MSYSS?W?Y?]?_?"?abcQSMAP
walk.java
Clojure
*S Clojure
*F
+ 1 walk.clj
clojure/walk.clj
*L
1#1,33:1
*E




© 2015 - 2025 Weber Informatics LLC | Privacy Policy