Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
jlouis
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
56 ms
·
541.
▲
by
jlouis
16y ago
Can you represent each channel as a double? Or will that take up too much memory in the long run?
542.
▲
by
jlouis
16y ago
I'll only take some of these: * Error messages: The current format has two distinct advantages to the experienced programmer: They are Erlang terms and can thus be manipulated easily as such. And they are succinct. I definitely give you tha
543.
▲
by
jlouis
16y ago
Too add: BitTorrent is heavily "multi-user" in the sense that you communicate with numerous peers (200+ is not uncommon). Each peer gets turned into a small set of processes inside etorrent (4 per peer), so it quite heavily makes use of the
544.
▲
by
jlouis
16y ago
Yes, the main point is that strings in many cases is the hammer in the toolbox: it always works, even when you needed the saw or the screwdriver. And many webservices can be manipulated from strings alone.
545.
▲
by
jlouis
16y ago
Right, the OTP upgrade system is best when you have few but very controlled upgrades of your application. If you alter the production system once every week, it is better to do something with lighter weight.
546.
▲
by
jlouis
16y ago
The article is wrong on " The fastest supercomputer has, since 1994, resided in the United States at the Oak Ridge National Laboratory, where it is used for scientific computing, among other purposes." I present to the thee, the Japanese Ea
547.
▲
by
jlouis
16y ago
The CPUs are just a commodity. The interconnect is where it is at.
548.
▲
by
jlouis
16y ago
Here is Googles battle plan: We can't do an all-out attack on the carriers since they will fortify their positions and we need the carriers to move data for us. So we will take them by stealth and guerilla warfare, a little bit at a time, f
549.
▲
by
jlouis
16y ago
Prolog was dynamically typed and in the 80'es that usually meant slow execution (sans Orbit/T I am told). What made C damn popular was the sheer speed in the produced code. When you have 7-20 Mhz computers a slow language hurts.
550.
▲
by
jlouis
16y ago
I think Gmail has much more than 5% of the market. It may be that Outlook is installed on 35-45% of all computers, but nobody currently has numbers for the use of the application. If I can get away with it, I prefer forwarding mails so I do
551.
▲
by
jlouis
16y ago
You still need to hope the fusion optimization kicks in there. It can be done faster with one filter over the list and then checking all three predicates at each element in some cases. I think the following will do the right thing: filt
552.
▲
by
jlouis
16y ago
Precisely my thought. People take a specific literal quote and use it as an attempt to refute his main argument - but you have to refute the statistics instead. One argument was that the adventurous sailor would be subsumed by the cobbler o
553.
▲
by
jlouis
16y ago
In addition to the other comments, I will add that this is only viable in languages that are much slower than C. If you take Haskell, Ocaml, Go, Java, C#, Common Lisp, Factor and so forth, the speed increase is much lower since these langua
554.
▲
by
jlouis
16y ago
Yes, the idea is to look at the structure of the problem and use the structure to prune the solution pool aggressively. The usual method is Branch-and-bound algorithms, but the wikipedia article does not seem to convey the idea especially w
555.
▲
by
jlouis
16y ago
That would be fun, but alas, I don't have time. One can simply submit Pisingers "decomp" codes from the page I linked above, but if you do that, you are not the author of the work...
556.
▲
by
jlouis
16y ago
For all NP-problems, there are trivial instances. As an example the given instance might have structure which effectively makes it a P-problem. What makes NP-problems interesting is that there are also hard instances where the search breaks
557.
▲
by
jlouis
16y ago
It is funny that the author chose the SUBSET-SUM problem. You may be amazed but this is a special-case of the KNAPSACK problem for which we have: Fully polynomial approximation schemes. Pseudo-polynomial time algorithms. In other words, you
558.
▲
by
jlouis
16y ago
And Go, presumably.
559.
▲
by
jlouis
17y ago
It is a legislative defensive move by Apple. I hardly doubt they would go after a highly successful and well-written Ruby application. Rather they want a way to pull everything flash at a whims notice with reference to the agreement. In oth
560.
▲
by
jlouis
17y ago
This is one of Zeds weaker rants. He wants to piss of the Ruby community, yet it is far too obviously filled with bait. Time will show if the fish bites, however. What is really going on is a war fought by proxy on the iPhone. The combatant
561.
▲
by
jlouis
17y ago
All good code has the property of clear specification. The place where BDD really shines is that it forces you to use your own abstraction in practice, which often uncovers where it is unwieldy to use. Another way to get lean code is to use
562.
▲
by
jlouis
17y ago
I used Dvorak for about 7 years but I am now back to QWERTY. I learned to type with 10 fingers back in 1994 or so when in school. The reason I am back to Qwerty are: Many programs choose their shortcuts based on QWERTY. Espcially editors li
563.
▲
by
jlouis
17y ago
I think the problem is that you sold an idea that can easily be copied rather than a product. Perhaps an NDA might be the legislative path to take - but sometimes there is another approach: There is a story, which may be an urban legend, bu
564.
▲
by
jlouis
17y ago
Interestingly however, much of the Linux kernel is based on the idea of pulling something off and then substituting it completely. For what it is worth, it seems to work for them.
565.
▲
by
jlouis
17y ago
In Eiffel you do not fight the compiler. The idea is that you define a set of assertions that must be true before writing the code. This process strengthens the program as you get a more well-defined knowledge of who-does-what in the progra
566.
▲
by
jlouis
17y ago
Please read up on your type theory. A tuple is easily typed as a product type. Most functional languages have these, so the impedance mismatch is greatest when you consider a language which has no product types, as in e.g. Java. Ocaml has P
567.
▲
by
jlouis
17y ago
Where is Ocaml on that list? or ML in general. You can't leave out my favorite language!
568.
▲
by
jlouis
17y ago
The circularity-argument for type systems is actually correct, but that is an aside. Type systems on programming languages are proof systems, so they can be used as tools for building better type systems. There is a big lack of TDD in hig
569.
▲
by
jlouis
17y ago
I read "An Initial Investigation of Test Driven Development in Industry" by Boby George and Laurie Williams, and "Realizing quality improvement through test driven development: results and experiences of four industrial teams" by Naggapan e
570.
▲
by
jlouis
17y ago
No, unit tests will not help with parts of this. Take today for me as an example: I need to update some python code which calls the database through SQLAlchemy. I can't remember half of SQLAlchemy in my head, so I begin digging for what I w
More ›