Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)That's it!
| (def safe-requires | |
| "List of namespaces to require and refer when inside user ns at load time. | |
| Can be given an initialization body to execute after having been required. | |
| To do so, wrap the lib spec in a vector, and all elements after the lib | |
| spec vector will be evaled after the lib spec has been required." | |
| '[[clojure.repl :as repl :refer (source apropos dir pst doc find-doc)] | |
| [clojure.java.javadoc :as javadoc :refer (javadoc)] | |
| [clojure.pprint :as pprint :refer (pp pprint)] | |
| [clojure.stacktrace :as stacktrace :refer (e)] |
| { | |
| "objects": [ | |
| { | |
| "labels": [ | |
| "source--eiq-fusion" | |
| ], | |
| "name": "EclecticIQ Fusion Center", | |
| "external_references": [ | |
| { | |
| "source_name": "external-url", |
Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)That's it!