JeanPierre

6 ms·

1.
Swearjure is Turing Complete(hypirion.com)
3 points by JeanPierre 12y ago|0 comments
2.
by JeanPierre 12y ago
Agreed on the benchmarks – that's the next (and last) part on the list I'm going to do with this series. And yes, of course, at some point, constant factors break into applications. Would it be better if add in a short comment on
3.
by JeanPierre 12y ago
I understand your concern, but I don't really think the problem is within Clojure people: When I started out explaining the structure to other people and that most operations have O(log n) runtime, people dismissed Clojure as being too
4.
Riak 2.0 released(lists.basho.com)
15 points by JeanPierre 12y ago|1 comments
5.
by JeanPierre 12y ago
That's a red herring: You're asking why the majority of software is written in imperative languages instead of functional ones, which is a very complex question with very many factors. It is not an argument which invalidates nor
6.
by JeanPierre 12y ago
Mori doesn't implement RRB-trees, thus doesn't support logarithmic concatenation.
7.
by JeanPierre 12y ago
Constant time in practise is a notable difference from saying constant time. I can always sort a 32-bit int array in worst case linear time using counting sort, which in theory is better than the worst case runtime of quicksort, O(n²). Is
8.
by JeanPierre 12y ago
I've managed to do the opposite: Scala didn't stick, Clojure did. I guess there's some subjective reason why or why not Clojure/Scala would stick with someone. However, it's false that Clojure doesn't have a co
9.
by JeanPierre 13y ago
And if you ask me, its just so good that we haven't needed a revision in 20 years. What about threading and/or concurrency? CLTL doesn't mention it, yet it is something which is now considered a requirement for real
10.
by JeanPierre 13y ago
Could you elaborate on how generics makes code less safe? In my experience, the lack of generics is much more type unsafe, as you often have to do casts at runtime (and handle them) when you have to implement your own data structures. In co
11.
by JeanPierre 13y ago
Just for reference, a single goroutine has a 8 kb stack size. Having one million of these things in memory at once would require 8 Gb of memory. Obviously, the scheduler kicks in, but 8 kb chunks of memory still has to be assigned and freed
12.
Russ Olsen - To the Moon!(youtube.com)
4 points by JeanPierre 13y ago|0 comments
13.
by JeanPierre 13y ago
Using val King = 13; val Queen = 12; in Scala is not equivalent with using Clojure keywords, as their printed variant will be 13 and 12, not :king and :queen. Reading debugging output or logs would force you to manually convert those valu
14.
by JeanPierre 13y ago
I do agree that the structure is influenced by the paper, so I've added that in. I don't agree that they are "virtually identical" however, because there are significant differences leading to a lot of performance improv
15.
by JeanPierre 13y ago
Author here: I think you talk about the persistent hashmaps, not the persistent vectors. I've been looking for papers explaining Clojure's persistent collections, and Bagwell seems to cover the hash maps and hash sets quite well.
16.
Read RFC Documents in Their HTML Versions(hypirion.com)
2 points by JeanPierre 13y ago|0 comments
17.
by JeanPierre 13y ago
To get an even better explanation on what the word "simple" means and what it derives from, I would recommend "Simplicity Ain't Easy" by Stuart Halloway[1]. While it is very similar to "Simple made Easy",
18.
by JeanPierre 13y ago
sort-by takes an optional comparator, so doing (comp - val) is a bit unneeded. Just add in > as an argument to sort-by: (->> (string/split s #"\s+") frequencies (sort-by val >) (take 10))
19.
by JeanPierre 13y ago
I would like to add on to this: Generics may not be the correct solution, but I would really like a way to make collections which are general enough to be used by any datatype. As of now, I cannot do that without doing the typical `interfac
20.
by JeanPierre 13y ago
Well, there are some comments just about that in the "coming soon" part, and it seems that the selling point is about making multiplayer easier for you compared to Minecraft. Whereas you have to host a Minecraft server yourself (or host a w
21.
by JeanPierre 13y ago
Curiously, NTNU/NTH got a similar tradition which officially started in 1914, 8-11 years earlier[1, 2]. I wonder if these rings or the "identity crises" (the NTH-ring was designed to give former NTH (now engineering) students an identity, w
22.
by JeanPierre 13y ago
I partially disagree, partially agree. In these competitions, it's about implementing a solution as fast as possible, while still get it working under the time limit (5/8 minutes). It's mostly about having the right idea and implement it. I
23.
by JeanPierre 14y ago
This is currently not possible with lein (bug/enhancement), but will be with 2.1.0. See #966[1] for details. As a workaround, any project dependent of Clojure 1.5.0 will utilize that for the repl. So when in a project using 1.5.0, the repl
24.
by JeanPierre 14y ago
There's a lot of new small improvements in this update which are great for Clojure users, but the fundamental difference between 1.4 and 1.5 is the reducer library which was implemented. It's added mostly for performance reasons: By using t
25.
How to Cancel a Blocking Read in Java(hypirion.com)
2 points by JeanPierre 14y ago|0 comments
26.
by JeanPierre 14y ago
I consider "n < 2" to be an expression evaluating to either true (1) or false (0). You can do basic if-else branching by considering true/false statements as conditions to if/elseif/else branching, but true/false cannot be used to evalu
27.
by JeanPierre 14y ago
Certainly, there's no practical difference between pointers+arrays, polymorphism and conditional statements. That's the whole point: We're "simulating" or "creating" if-statements/polymorphism using other language constructs. My goal was to
28.
A Language Without Conditionals(hypirion.com)
67 points by JeanPierre 14y ago|43 comments
29.
Solving the Facebook Hacker Cup in Clojure(hypirion.com)
4 points by JeanPierre 14y ago|0 comments
30.
by JeanPierre 14y ago
Fast startup time can be achieved through Drip[1], which is rather easy to setup for Leiningen use. [1]: https://github.com/flatland/drip/wiki/Clojure

More ›