Just to let yβall know I am on my way, looks like Iβll be there just about 6, though may a few minutes after.
Thanks for coming to the talk tonight. My slides are available here: https://docs.google.com/presentation/d/1Z774le3MvqBzZJ907heKJ6Nle26uqzr_ywK19ORVwsY/edit?usp=sharing
the accompanying clojure file I used when developing the talk is here: https://github.com/kyleburton/talks/blob/master/2019.macros/scratchpad/src/scratchpad/macros.clj
The tricks I mentioned were:
juxt
instead of a hash function. E.g. (juxt count identity)
instead of #(list (count %) %)
(doto println)
(or (doto tap>)
) for temporarily logging the value of an expression, this is especially useful with the thread first macro:
(-> it ... (doto println) ...)
(This is Ed)
It was great to meet everyone, I need to come down more often
Yes, it was great to meet you too.
And for anyone interested in the podcast I'm one half of, head to https://clojuredesign.club (or look in your local podcast directory)
We have a channel on here too: #clojuredesign-podcast
@fiddlerwoaroof (Missed the meeting, no sitter last night, hi Iβm Jacob π ) Iβm curious about the hash function! How did hash functions come up? I use these to avoid duplicate work on the edges of my system. I recently found a thorough one here https://github.com/replikativ/hasch
@bocaj by hash function I meant the #(...)
syntax for lambdas
This "thread last" example was in the slides (sorts a list of strings by its length):
(->>
["sort" "this" "by" "length"]
(map #(list (count %) %))
(sort-by first)
(mapv second))
Ed pointed out that the #(list (count %) %)
could be written using juxt
:
(->>
["sort" "this" "by" "length"]
(map (juxt count identity))
(sort-by first)
(mapv second)