This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
2019-05-27
Channels
- # announcements (2)
- # beginners (85)
- # boot (4)
- # calva (4)
- # cider (14)
- # cljdoc (8)
- # cljs-dev (5)
- # cljsrn (10)
- # clojure (101)
- # clojure-europe (1)
- # clojure-italy (6)
- # clojure-nl (12)
- # clojure-spec (4)
- # clojure-uk (71)
- # clojurescript (119)
- # core-async (20)
- # cursive (1)
- # datascript (2)
- # duct (3)
- # emacs (19)
- # fulcro (150)
- # graphql (1)
- # hoplon (2)
- # instaparse (2)
- # jobs (1)
- # jobs-discuss (11)
- # joker (9)
- # luminus (6)
- # lumo (1)
- # off-topic (33)
- # onyx (1)
- # quil (1)
- # re-frame (23)
- # reagent (11)
- # robots (2)
- # rum (6)
- # sql (1)
- # test-check (10)
- # unrepl (1)
Is anyone in NY interested in organizing / participating in a study group for SICP? http://sarabander.github.io/sicp/
Not sure if reposting in #nyc will help. Is this your github? I've done a bit of Nature of Code in Clojure myself. https://github.com/respatialized/nature-of-code
I would be interested in participating. I have a copy of the book but only made it to the first set of exercises.
so I have 50 gigabytes of events in a durable queue (tape library). I want to process these events interactively (if at all possible), do operations such as sort/distinct/filter ... on them. how am i to go about doing this? any pointers appreciated.
sort and distinct sound like horrible ideas if you don't filter heavily at first
i would probably lift the data to a 50+gb ssd at first and then process it from there as needed
filter is doable in a streaming fashion, distinct will require some trickery (you could use a bloom filter for instance) if you want to be efficient, but yeah sorting is the killer here
distinct will work somewhat reasonably if you do them in partitions
will mean that you have to read multiple times to fit into memory constraints
tape as an async interface that you could use for some of it, you can basically consume a tape queue via a core.async chan, so you could apply (a) transducer(s) at that level
well if you want to be as lazy as possible
and if you have to repeat the task at some point ....
for a 1 time effort i would probably do pure clojure though 🙂
Any ideas for giving a user a chronological feed of the posts made by other users they follow?
"Designing Data-Intensive Applications" uses twitter timeline as an example, apparently they had to create a hybrid approach based on the user's popularity (number of followers)
I second what @lady3janepl said; that's a fantastic book
Hi everyone. Please sign up to try out our new application when it comes out. It's called http://nearhe.re/ You can access it at https://nearhe.re/