This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
2019-10-28
Channels
- # announcements (2)
- # babashka (16)
- # bangalore-clj (1)
- # beginners (93)
- # boot (11)
- # calva (5)
- # cider (13)
- # clj-kondo (49)
- # cljdoc (14)
- # cljs-dev (1)
- # clojure (99)
- # clojure-dev (3)
- # clojure-europe (1)
- # clojure-india (1)
- # clojure-italy (9)
- # clojure-nl (3)
- # clojure-poland (1)
- # clojure-russia (1)
- # clojure-spec (31)
- # clojure-uk (21)
- # clojured (2)
- # clojurescript (18)
- # core-async (12)
- # cursive (36)
- # data-science (1)
- # datomic (54)
- # duct (3)
- # emacs (33)
- # events (1)
- # fulcro (17)
- # jobs (1)
- # joker (8)
- # keechma (1)
- # leiningen (7)
- # malli (8)
- # nrepl (19)
- # pathom (6)
- # planck (18)
- # re-frame (20)
- # reagent (18)
- # shadow-cljs (3)
- # sql (7)
- # vim (31)
the prior will ignore optimizations, and is good for things like locale change where the props have not changed, but you want UI to completely refresh..also hot code reload
@tony.kay I don't need a full app refresh though. I know that I only changed one ident?
Hi all, I'm having issues running fulcro-inspect locally :
CompilerException: java.lang.RuntimeException: Unable to resolve symbol: read+string in this context, compiling:(shadow/cljs/devtools/server/repl_system/clojure.clj:113:32)
I just want a fulcro electron template to play around, so I thought it was a good idea to fork the inspect electron app
Is it possible to do a recursive union query? I'm probably just tired and missing some obvious syntax. I can do either easily, it's just an issue of trying to combine both on a single set of items in a tree where each node can have children of different types with different data to fetch within the same set of children. I don't control the data but I've thought of plenty of workarounds. Hand-rolling things works, but of course since it's a tree, that doesn't help me much with arbitrary depth and the requirement that I need to load the entire tree at once. Mostly I've thought transforming the data in some other way inside a resolver might be the way to go since I can probably break things down into a much faster fetch this way, but I'm still curious if a recursive union is feasible for future reference.
@twicebaked current implementation: no. Theoretically possible to extend the implementation: not sure…don’t have brain cycles at the moment to even consider how that would work.
Thanks
tbf I expect it would perform awful anyway 😆
I just had one of those moments contemplating whether or not I am missing something and/or brain dead about the problem, so good to know.