mini-program-cljs/.shadow-cljs/jar-manifest/1589003956000-persistent-sorted-set-0.1.2.jar.manifest

["^ ","~:foreign-libs",[],"~:externs",[],"~:resources",[["^ ","~:cache-key",[1589003956000],"~:ns-info",["^ ","~:rename-macros",null,"~:renames",["^ "],"~:meta",["^ ","~:file","me/tonsky/persistent_sorted_set/arrays.cljc","~:line",1,"~:column",14,"~:end-line",1,"~:end-column",52,"~:no-doc",true],"~:use-macros",null,"~:excludes",["~#set",["~$aget","~$aclone","~$alength","~$amap","~$array","~$aset","~$array?","~$make-array","~$into-array"]],"~:name","~$me.tonsky.persistent-sorted-set.arrays","~:imports",null,"~:requires",["^ ","~$clojure.string","^N","~$str","^N","~$cljs.core","^P","~$goog","^Q"],"~:seen",["^@",["~:require","~:require-macros"]],"~:uses",null,"^T",["^ ","^K","^K","^P","^P"],"~:cljc",true,"~:flags",["^ ","^S",["^@",[]],"^T",["^@",[]]],"~:js-deps",["^ "],"~:deps",["^Q","^P","^N"]],"~:ns","^K","~:output-name","me.tonsky.persistent_sorted_set.arrays.js","~:resource-id",["~:shadow.build.classpath/resource","me/tonsky/persistent_sorted_set/arrays.cljc"],"~:resource-name","me/tonsky/persistent_sorted_set/arrays.cljc","~:type","~:cljs","~:last-modified",1589003956000,"^M",["^@",["^P","^Q","^N"]],"~:pom-info",["^ ","~:group-id","~$persistent-sorted-set","~:artifact-id","^18","~:version","0.1.2","^J","persistent-sorted-set","~:description","Fast B-tree based persistent sorted set for Clojure/Script","~:url","https://github.com/tonsky/persistent-sorted-set","~:id","^18","~:coordinate",["^18","0.1.2"]],"~:macro-requires",["^@",["^P","^K"]],"^1<",["~#url","jar:file:/Users/clojure/.m2/repository/persistent-sorted-set/persistent-sorted-set/0.1.2/persistent-sorted-set-0.1.2.jar!/me/tonsky/persistent_sorted_set/arrays.cljc"],"~:provides",["^@",["^K"]],"~:from-jar",true,"^Y",["^Q","^P","^N"]],["^ ","^3",[1589003956000],"^4",["^ ","^5",null,"^6",["^ "],"^7",["^ ","^8","me/tonsky/persistent_sorted_set.cljs","^9",4,"^:",3,"^;",4,"^<",34,"~:doc","A B-tree based persistent sorted set. Supports transients, custom comparators, fast iteration, efficient slices (iterator over a part of the set) and reverse slices. Almost a drop-in replacement for [[clojure.core/sorted-set]], the only difference being this one can’t store nil.","~:author","Nikita Prokopov"],"^>",null,"^?",["^@",["~$iter","~$disj","~$conj","~$sorted-set","~$sorted-set-by"]],"^J","~$me.tonsky.persistent-sorted-set","^L",null,"^M",["^ ","^K","^K","~$arrays","^K","^P","^P","^Q","^Q"],"^R",["^@",["^S","^T"]],"^U",null,"^T",["^ ","^K","^K","^1K","^K","^P","^P"],"^V",false,"^W",["^ ","^S",["^@",[]],"^T",["^@",[]]],"^X",["^ "],"^Y",["^Q","^P","^K"]],"^Z","^1J","^[","me.tonsky.persistent_sorted_set.js","^10",["^11","me/tonsky/persistent_sorted_set.cljs"],"^12","me/tonsky/persistent_sorted_set.cljs","^13","^14","^15",1589003956000,"^M",["^@",["^P","^Q","^K"]],"^16",["^ ","^17","^18","^19","^18","^1:","0.1.2","^J","persistent-sorted-set","^1;","Fast B-tree based persistent sorted set for Clojure/Script","^1<","https://github.com/tonsky/persistent-sorted-set","^1=","^18","^1>",["^18","0.1.2"]],"^1?",["^@",["^P","^K"]],"^1<",["^1@","jar:file:/Users/clojure/.m2/repository/persistent-sorted-set/persistent-sorted-set/0.1.2/persistent-sorted-set-0.1.2.jar!/me/tonsky/persistent_sorted_set.cljs"],"^1A",["^@",["^1J"]],"^1B",true,"^Y",["^Q","^P","^K"]]],"~:data-readers",null,"~:shadow.build.classpath/CACHE-TIMESTAMP",1585692398000]