Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ryanbrush
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
ryanbrush
12y ago
It seems like a stretch to classify Julia as Object Oriented. It has types and record structures, but these aren't strongly coupled to functions like you'd see in most OO-style approaches. It also doesn't encourage hiding dat
2.
▲
Usable Live Programming
(research.microsoft.com)
82 points
by
ryanbrush
12y ago
|
25 comments
3.
▲
Micro Benchmarks versus Macro Optimizations in Clojure
(toomuchcode.org)
5 points
by
ryanbrush
12y ago
|
0 comments
4.
▲
by
ryanbrush
12y ago
Were any issues logged, or these problems otherwise addressed, in the ten+ months since this was posted? I wasn't able to find anything with some quick searches but hopefully others on this thread are more familiar with these projects.
5.
▲
by
ryanbrush
13y ago
I believe the ability to configure this behavior is being tracked at the link below. It seems like it's a switch between consistency and availability. By default Kafka prefers availability, and the possible inconsistency results in dat
6.
▲
How Dr. Seuss would explain the Halting Problem
(lel.ed.ac.uk)
3 points
by
ryanbrush
13y ago
|
0 comments
7.
▲
by
ryanbrush
13y ago
Whether through Datomic or something else, it seems like some version of "database-as-a-value" (as described by Rich Hickey) is bound to happen. We're keeping immutable version histories of as much as our hardware and systems
8.
▲
by
ryanbrush
13y ago
Yes, these are excellent, and goes into much more depth than the brief article I wrote.
9.
▲
by
ryanbrush
13y ago
Very kind of you to say! I came up with the metaphor when needing to explain this to a semi-technical person as well, so we've had similar needs there.
10.
▲
by
ryanbrush
13y ago
Using that cache is a good idea. The site linked to was used to gather the original content rather than broad consumption. (I wrote two of the chapters in this book, and this was where we revised them.) Lots of good articles in there, thou
11.
▲
by
ryanbrush
13y ago
Sounds great. I'm glad to know something like that's in progress, and many thanks for your efforts on this project!
12.
▲
by
ryanbrush
13y ago
Understanding that core.async is new and evolving, but is there a reference or an idiomatic way to work with blocking operations, beyond the general advice of separate threads as an exercise for the reader? EDIT: I bring this up because thi
13.
▲
by
ryanbrush
13y ago
Ah, I didn't realize that core.typed could deal with rich data structures like that. That's actually pretty amazing.
14.
▲
by
ryanbrush
13y ago
A perhaps naive question: could this sort of thing tap into Clojure's type hints rather than using external annotations? So rather than writing the example in the post: (ann my-inc [Number -> Number]) (defn my-inc [n] (let [intern
15.
▲
by
ryanbrush
13y ago
Not to mention the operational costs of a small navy to recover the rocket and transport it to a launch site.
16.
▲
by
ryanbrush
13y ago
Funny to see this here. That wiki was used to put together the contributions for the book, and the fact it wasn't planned as a high-volume site is pretty obvious right now. There are a number of items worth reading from some pretty good wri
17.
▲
by
ryanbrush
14y ago
The desire for an open source app top-to-bottom or the need to use existing databases or tooling would be a good reason. (However, I do think this question is a bit of a red herring: I don't see any obstacles to pulling in a different datab
18.
▲
by
ryanbrush
14y ago
I wish the post had gone into depth on _why_ Redshift was significantly faster, but I'm betting it uses in-memory joins whereas (hence the size limitations it mentions) whereas Hive joins are just MapReduce jobs that keep only minimal subse
19.
▲
Composable MapReduce with Hadoop and Crunch
(engineering.cerner.com)
2 points
by
ryanbrush
14y ago
|
0 comments