flebron

16 ms·

31.
by flebron 12y ago
Where 'large' is about 80.
32.
by flebron 12y ago
The computational model will define what you can and cannot compare in constant time. It is perfectly fine to say that comparing elements of arbitrary size is a constant time operation - that's precisely what a computational model is:
33.
by flebron 12y ago
Well, what you wrote is "The main reason I did it was to see what Haskell is capable of compared to other languages such as Python." The problem is that what you coded isn't what Haskell is capable of :)
34.
by flebron 12y ago
The dice aren't loaded, you're just seeing a binomial distribution[1][2] :) [1] http://en.wikipedia.org/wiki/Binomial_distribution [2] http://hyperphysics.phy-astr.gsu.edu/hbase/math&#x2F
35.
by flebron 12y ago
You may be speaking of a particular implementation or engine. JS, the language, has no such concept of a "thread". The standard describes execution of a valid program as linear. Libraries may add functions such as event listeners
36.
by flebron 12y ago
I also spent more time with CLRS, I've had my copy for close to a decade now :) I found ADM to be much less useful. It was mostly a small bit of code per concept, with little explanation or proofs or information about why it worked. If
37.
by flebron 12y ago
Unfortunately, it's just a background fact that Google employs a lot of well-known computer science figures. So this was bound to happen unless they explicitly forbade them from signing this, which I also don't think is good.
38.
by flebron 12y ago
Per object vtable pointer, yes.
39.
by flebron 12y ago
Having any virtual member functions, unless the compiler can devirtualize it, will hurt both space usage (since you now need a per-object vtable) and cache performance (since destruction now has to go through an indirection every time, inst
40.
by flebron 12y ago
It's 2014. How are people still rolling their own, terrible, encryption schemes?
41.
by flebron 12y ago
>Please note that O matters. Even if both algorithms belong to O(n log n) class, algorithm for which O=1 is 100 times faster then algorithm for which O=100. Wait, what? O = 100? That's just... not how it works.
42.
by flebron 12y ago
Maybe I'm doing something wrong, but I just tested it in ZSH (5.0.5, Linux) and the same vulnerable behavior seems to show up.
43.
by flebron 12y ago
Underscores are already being used for user defined literals.
44.
by flebron 12y ago
It's going to be untyped in the same sense that the following Haskell code is untyped: foo = [1, 2, 3] x = foo We didn't give a type to x, but the compiler will infer it anyway. If foo changes, x will change too. This
45.
by flebron 12y ago
That last "click" should be "next", clearly :)
46.
by flebron 12y ago
Perhaps an easier example is to do this in GHCi: let x = id id id id id id id id id id id id id id id id id id id id id id id id See how long that takes (add ids if your machine can take it). To deduce a type for x, ghci will use 2
47.
by flebron 12y ago
For anyone who's interested in type theory and programming language foundations and modern development, I've found the talks of these summer schools really interesting and useful. The videos and material are at https://
48.
by flebron 12y ago
He already searched, on google. He shouldn't have to search twice for the same thing.
49.
by flebron 12y ago
I'm guessing he doesn't mean branching on a result, he means just comparing two things via cmp.
50.
by flebron 13y ago
Well this is embarrassing.
51.
by flebron 13y ago
So how do you handle any sort of software development planning? Do you just tell the client "It'll be done eventually. I'll let you know when.", or would you accept that reply from your employees?
52.
by flebron 13y ago
foo = undefined And all its brothers :)
53.
by flebron 13y ago
I may be alone in this camp, but I'd actually recommend people read the ES5 spec if they want to be confident in their JS. It's one of the most readable and understandable specifications I've read, and (compared to behemoths
54.
by flebron 13y ago
I will do that as soon as you explain how treating female coders as if they were freaks, segregating them in their own class, decreases the problem of integration of more female coders in tech. Perhaps the issue of "feeling alien to th
55.
by flebron 13y ago
Because passing around tuples and pattern matching against them becomes tiring. So you wrap that code repetition pattern around in a State. The State monad is implemented in terms of the language itself, it's not adding anything to the
56.
by flebron 13y ago
It seems you think all Monads are Maybe, or List?
57.
by flebron 13y ago
I really liked this talk. PHP was my first language when I was starting out professionally, and before I went into university and learned "proper programming". Back in 2007-2008, I remember the mess it was, with the internals list
58.
by flebron 13y ago
"I design and develop websites at MasterMade or write at Newly Ancient." From your website.
59.
by flebron 13y ago
This is a similar argument to sqrt(2) being "not a number", back in the BC's, because it was not rational. And yet, you can construct it in a straightforward manner by making a right angled triangle with catheti of length 1,
60.
by flebron 13y ago
It just lends more credibility to the "this is just a mgrunin sockpuppet" hypothesis elsewhere in this thread. No way in an 8 person company, you "don't have the ability" to talk to one of them.

More ›