This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
2019-01-31
Channels
- # aws (1)
- # beginners (70)
- # boot (12)
- # calva (45)
- # cider (45)
- # clara (1)
- # cljdoc (10)
- # cljs-dev (133)
- # clojure (315)
- # clojure-dev (2)
- # clojure-europe (2)
- # clojure-italy (16)
- # clojure-nl (1)
- # clojure-spec (23)
- # clojure-uk (19)
- # clojurescript (48)
- # cursive (11)
- # data-science (5)
- # datomic (18)
- # figwheel-main (3)
- # fulcro (18)
- # graphql (14)
- # jackdaw (1)
- # juxt (1)
- # kaocha (1)
- # off-topic (10)
- # other-languages (3)
- # pathom (2)
- # pedestal (7)
- # re-frame (23)
- # reagent (1)
- # reitit (4)
- # ring-swagger (12)
- # rum (4)
- # shadow-cljs (26)
- # specter (6)
- # speculative (12)
- # tools-deps (44)
- # vim (8)
- # yada (2)
Opening I find Pathom to be quite fascinating; thanks for creating it and making it freely available! I’ve been writing resolvers for some internal services at work and am quite pleased with the results. Questions I’m have some questions regarding recursive pull queries: are they supported? eg.
; v
(d/pull db '[:node/id :node/mass {:node/neighbors 2}] ent-id)
It seems like Pathom provides all the tools to handle a query like the one above. Is that accurate? If I wanted to support bounded recursion, what must I do as the author of a resolver? Or should I be writing a custom reader?
Distilled Example
Context
App domain is inherently graph-like. We prototyped in Datascript. Pull + bounded recursion provided a natural way to explore limited regions of this graph. To learn Pathom, I’m trying to recreate this graph API experience on the production system (where we aren’t using datascript / datomic).
Closing
Thanks for reading; thanks for Pathom.