I just ‘know’ there is an easier way than this to traverse down a bunch of nested hash tables using a list of keys but I’m darned if I can think of it, any ideas? (define (descend hsh lst) (cond [(empty? lst) '()] [(empty? (rest lst)) (hash-ref hsh (first lst) '())] [else (descend (hash-ref hsh (first lst)) (rest lst))]))

nested-hash pretty much does the same thing https://github.com/BourgondAries/nested-hash/blob/master/main.rkt

or use a trick from Fear of Macros

(define (hash-refs ks h [def #f])
  (with-handlers ([exn:fail? (const (cond [(procedure? def) (def)]
                                          [else def]))])
    (for/fold ([h h])
              ([k (in-list ks)])
      (hash-ref h k))))

;; example:
;;    (hash-refs '(a b c) (hash 'a (hash 'b (hash 'c 2)))) -> 2
;;    (hash-refs '(a d) (hash 'a 2) 10) -> 10

@d_run Thanks, I wasn’t too far off then. Cheers for the pointers.

If you want super powered ways to slice and dice nested data structures lens (https://docs.racket-lang.org/lens/index.html?q=lens) is very nice

Cool