diff options
author | elioat <elioat@tilde.institute> | 2022-12-03 13:04:28 -0500 |
---|---|---|
committer | elioat <elioat@tilde.institute> | 2022-12-03 13:04:28 -0500 |
commit | 3e5ce69bce525725f2275ecf368e21d91a0b87f9 (patch) | |
tree | 279129194a8f61b1c7d1158e56fee2db5f91f8e3 /src | |
parent | 50bad18c9623793b4cb958e781af39878fbdc69e (diff) | |
download | december-2022-3e5ce69bce525725f2275ecf368e21d91a0b87f9.tar.gz |
making the inspector more inspector-y...(failing)
Diffstat (limited to 'src')
-rw-r--r-- | src/pokedex.rkt | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/src/pokedex.rkt b/src/pokedex.rkt index 7f03c23..89fd7ea 100644 --- a/src/pokedex.rkt +++ b/src/pokedex.rkt @@ -46,7 +46,8 @@ "display the contents of a hash table for human eyeballs" (hash-map h (lambda (k v) - (display (~a "key: " k ", value: " v "\n")))) ; QUESTION: is there a functional difference between hash-map and hash-for-each here? + (if (hash? v) (inspector v) ;; test if value is a hash table, if so recursively apply inspector (I don't think this is working right) + (display (~a "key: " k ", value: " v "\n"))))) ; QUESTION: is there a functional difference between hash-map and hash-for-each here? h) ; the sketch of how maybe to access these nested hash tables (this has become hillariously difficult to solve) |