wednesday march 20 2013 introducing pedestal
play

Wednesday, March 20, 2013 Introducing Pedestal Who: Relevance - PowerPoint PPT Presentation

Wednesday, March 20, 2013 Introducing Pedestal Who: Relevance What: alpha release, open source libs Where: Clojure/West When: Now Why, How... 2 Wednesday, March 20, 2013 Goal Use clojure end-to-end to build rich


  1. Wednesday, March 20, 2013

  2. Introducing Pedestal • Who: Relevance • What: alpha release, open source libs • Where: Clojure/West • When: Now • Why, How... 2 Wednesday, March 20, 2013

  3. Goal • Use clojure end-to-end to build rich interactive collaborative Web applications and services that scale 3 Wednesday, March 20, 2013

  4. Archetype Datomic App Service Storage Service Datomic App Service Transactor 4 Wednesday, March 20, 2013

  5. Problems • Services notifying apps • Building complex UIs in browser 5 Wednesday, March 20, 2013

  6. Service Plumbing • Interceptor mechanism • Long polling, server-sent events • Routing, url generation 6 Wednesday, March 20, 2013

  7. Ring Middlewares • Chained fns bound to thread’s stack A B C 7 Wednesday, March 20, 2013

  8. Interceptors • Maps of fns not bound to thread’s stack enter enter enter A B C leave leave leave 8 Wednesday, March 20, 2013

  9. Pause/Resume • Can pause/resume across threads • Supports bindings and error propagation pause enter enter enter A B C leave leave leave resume 9 Wednesday, March 20, 2013

  10. Ring Compatibility • As compatible as possible • Same request/response maps • Core middlewares refactored and accepted • Interceptor versions provided • Easy to port existing code 10 Wednesday, March 20, 2013

  11. Notifications • Thread management enables long polling • Park request as needed • Also, server-sent-events • Built on low-level streaming API 11 Wednesday, March 20, 2013

  12. Routes and URLs ring handler fn native edn serialization (defn hello-world [req] (ring/response (map inc [1 2 3])) routes as data (defroutes routes [[[“/hello-world” {:get hello-world}]]]) (def url-for (routes/url-for-routes routes)) (url-for ::hello-world) ;;=> “/hello-world” make urls from routes 12 Wednesday, March 20, 2013

  13. Problems • Services notifying apps • Building complex UIs in browser 13 Wednesday, March 20, 2013

  14. 3 Simple Steps • Event handler affects state • Figure out what changed • Update DOM 14 Wednesday, March 20, 2013

  15. What to compare? • JS: event, old OR new state, DOM • CLJS: event, old AND new state, DOM • Can remove DOM from equation! 15 Wednesday, March 20, 2013

  16. App vs. View View App Messages • App: behavior DOM • View: presentation Changes Browser Process 16 Wednesday, March 20, 2013

  17. App Model • Encapsulate behavior and state • Input: messages • Output: app tree deltas • Implemented as pure functions • Fns wired up declaratively 17 Wednesday, March 20, 2013

  18. Messages • Map with topic and type • Other keys as needed {msg/topic :count-transform • Used for input to app msg/type :inc :key :a} • Used to control aspects of engine 18 Wednesday, March 20, 2013

  19. App Tree Deltas op path args [:node-create [:a :b :c] :map] [:node-destroy [:a :b :c]] [:value [:a :b :c] {:count 2}] [:attr [:a :b :c] :active true] [:transform-enable [:a :b :c] :send-info [{msg/topic :some-model msg/type :send-name (msg/param :name) {}}]] [:transform-disable [:a :b :c] :send-info] 19 Wednesday, March 20, 2013

  20. App Tree is Logical • Consumer may or may not realize (portions of) tree as real structure :a :b :c { :transforms {:change [{:node :e}] } :value 42 :d :e :attributes {:disabled true} 20 Wednesday, March 20, 2013

  21. Transform • Fn that modifies state Input Queue App • Message, state input State Transform • Last output state kept • Only changes flow App Model Queue 21 Wednesday, March 20, 2013

  22. Transform (put-message (:input-queue app) {msg/topic :count-transform msg/type :inc} Input Queue App (defn count-transform [t-state message] State (condp = (msg/type message) count- msg/init (:value message) transform :inc (inc (or t-state 0)) t-state)) App Model Queue ([:value [:io.pedestal.app/view-count-transform] 10 11]) 22 Wednesday, March 20, 2013

  23. Transform output ;; message input... {msg/topic :count-transform msg/type :inc} ;; deltas output... ([:value [:io.pedestal.app/view-count-transform] 10 11]) ;; message input... {msg/topic :count-transform msg/type :inc} ;; deltas output... ([:value [:io.pedestal.app/view-count-transform] 11 12]) ... 23 Wednesday, March 20, 2013

  24. More State (put-message (:input-queue app) {msg/topic :count-transform msg/type :inc :key :a} Input Queue (defn count-transform [t-state message] App (condp = (msg/type message) State msg/init (:value message) count- :inc (update-in (or t-state {}) transform (:key message) inc) App Model Queue t-state)) ([:value [:io.pedestal.app/view-count-transform] {:a 10 :b 9} {:a 11 :b 9}]) 24 Wednesday, March 20, 2013

  25. Affecting Parts of State ;; put a message in... {msg/topic :count-transform msg/type :inc :key :a} ;; get deltas out... ([:value [:io.pedestal.app/view-count-transform] {:a 10 :b 9} {:a 11 :b 9} ]) ;; put a message in... {msg/topic :count-transform msg/type :inc :key :b} ;; get deltas out... ([:value [:io.pedestal.app/view-count-transform] {:a 11 :b 9} {:a 11 :b 10} ]) ... 25 Wednesday, March 20, 2013

  26. Combine • Fn that merges or splits Input Queue state(s) App • Transform and/or Transform combine state(s) input Combine • Engine keeps last output Combine • Only changes flow App Model Queue 26 Wednesday, March 20, 2013

  27. Combine {msg/topic :count-transform msg/type :inc :key :a} Input Queue App (defn a-combine [c-state t-name t-old-val t-new-val] count- transform (:a t-new-val)) (defn b-combine [c-state t-name a- b- t-old-val t-new-val] combine combine (:b t-new-val)) App Model Queue ([:value [:a-combine] 10 11]) 27 Wednesday, March 20, 2013

  28. Combine {msg/topic :count-transform msg/type :inc :key :b} Input Queue App (defn a-combine [c-state t-name t-old-val t-new-val] count- transform (:a t-new-val)) (defn b-combine [c-state t-name a- b- t-old-val t-new-val] combine combine (:b t-new-val)) App Model Queue ([:value [:b-combine] 9 10]) 28 Wednesday, March 20, 2013

  29. Combine {msg/topic :count-transform msg/type :inc :key :b} Input Queue App (defn a-combine [c-state t-name t-old-val t-new-val] count- transform (:a t-new-val)) (defn b-combine [c-state t-name a- b- t-old-val t-new-val] combine combine (:b t-new-val)) total- (defn total-combine [c-state inputs] combine (apply + (map :new (vals inputs)))) App Model Queue ([:value [:b-combine] 10 11] [:value [:total-combine] 21 22]) 29 Wednesday, March 20, 2013

  30. Emit Input Queue App • Fn that converts state(s) Transform to tree deltas Combine Combine • Overrides default tree mapping Emit App Model Queue 30 Wednesday, March 20, 2013

  31. Emit {msg/topic :count-transform msg/type :inc :key :b} Input Queue App (defn counter-emit ([inputs] [{:counter {:a {:value 0} count- :b {:value 0}}}]) transform ([inputs changed-inputs] (concat [] a- b- (when (changed-inputs :a-combine) combine combine [[:value [:counter :a] (-> inputs :a-view :new)]]) (when (changed-inputs :b-combine) counter- emit [[:value [:counter :b] (-> inputs :b-view :new)]])))) App Model Queue ([:value [:counter :b] 11 12]) 31 Wednesday, March 20, 2013

  32. Messages in a flow • Effect fn • Continue fn • transform or • combine state input combine state input • msgs for transforms • msgs for services output output • sent during flow • queued after flow 32 Wednesday, March 20, 2013

  33. All the pieces... Services Effect Continue Message Transform Combine Emit View Source 33 Wednesday, March 20, 2013

  34. ...put together services services Input Queue Output Queue App trans- trans- effect form 1 form 2 continue combine combine combine combine combine emit emit emit App Model Queue View 34 Wednesday, March 20, 2013

  35. Focus • Focus filters deltas App • by name Emit Emit • by path Focus • Set by consumer App Model Queue :a • defaults to all :b :f :g • Helpful “navigtion” :e :c :d :h :i :j 35 Wednesday, March 20, 2013

  36. Benefits of data flow • Write small pure fns • No big comparator • Let engine track state changes • Only the necessary fns get called • Projects all the way out to consumer 36 Wednesday, March 20, 2013

  37. Making an App (def counter-dataflow {:transform {:count-transform {:init {:a 0 :b 0} :fn transform-count}} :combine {:a-combine {:fn a-combine :inputs #{:count-transform}} :b-combine {:fn b-combine :inputs #{:count-transform}}} :emit {:counter-emit {:fn counter-emit :inputs #{:a-combine :b-combine}}}}) Input Queue App (def app (app/build counter-dataflow)) count- transform 37 a- b- Wednesday, March 20, 2013

  38. Consuming App Output • App produces logical tree deltas • Provide a fn to consume them (defn console-renderer [out] (fn [deltas input-queue] (binding [*out* out] (doseq [d deltas] (println d))))) (def app-model (render/consume-app-model app (console-renderer *out*))) (app/begin app) 38 Wednesday, March 20, 2013

  39. View Model • Encapsulate presentation logic and state • Input: deltas from logical app tree • Output: messages • Implemented as fn(s) that • update UI • handle events 39 Wednesday, March 20, 2013

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend