Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
pdhborges
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
17 ms
·
151.
▲
by
pdhborges
14y ago
No. There are plenty of random variables without non-uniform distributions. Plus an event in probability theory is not what you think it is. An event can be any subset of the sample space.
152.
▲
by
pdhborges
15y ago
Another site with a fixed header taking a large chunk of the screen. Seriously, what's wrong with you designers!!??
153.
▲
by
pdhborges
15y ago
I built GCC 4.6.3 with GCC 4.2 using the LLVM backend without any problem.
154.
▲
by
pdhborges
15y ago
You got 1/10th of the I/O performance, so you traded disk seeks for network latency?
155.
▲
by
pdhborges
15y ago
That kind of auto completion is very easy to do. The problem is when you have references whose creation site you can't trace statically.
156.
▲
by
pdhborges
15y ago
You must have missed this part: "Compared to JRuby on Java 6, JRuby on Java 7 without invokedynamic is around 25% faster, and JRuby with invokedynamic is nearly 3 times faster."
157.
▲
by
pdhborges
15y ago
Here at hacker news there seems to exist an obsession on how to hire the 10x programmers and how to build great teams. I'm submitting this link because I'm really tired to read blog posts filled with anecdotes and making claims because some
158.
▲
by
pdhborges
15y ago
It would be nice if the author profiled the code instead of just measuring the test templates time.
159.
▲
by
pdhborges
15y ago
You don't need ;; to terminate an expression (except when using the REPL).
160.
▲
by
pdhborges
15y ago
Hi, what book would you recommend in alternative to e Applied Cryptography?
161.
▲
by
pdhborges
15y ago
The contents of this article are (almost) a bunch of quotes from a bunch of different authors.
162.
▲
by
pdhborges
15y ago
Here is the Java version: public boolean domainExists(String domain) { return Option.of((Domain) HibernateUtil.getSession().getNamedQuery("domain.findByName").setParameter("name", domain.trim().toLowerCase()).uniqueResult()).getOrEl
163.
▲
by
pdhborges
15y ago
Will the student realize that standing against the wall continually would wield the same limit?
164.
▲
by
pdhborges
15y ago
type Ctrl-F2 and then "hi". Problem solved.
165.
▲
by
pdhborges
15y ago
Looks like Golomb ruler to me.
166.
▲
by
pdhborges
15y ago
for loops are also syntactic sugar and the case class matching thing case class Lol (a: Int, b: Int) Lol(2, 3) match { case x Lol y => x }
167.
▲
by
pdhborges
15y ago
Is http://www.commendo.at/references/files/kdd08.pdf (this) the paper you are talking about?
168.
▲
by
pdhborges
15y ago
The sum is guaranteed to fit into 128 bits
169.
▲
by
pdhborges
15y ago
Yes, but if the object fall into the default autorelease pool you have no way to control when the memory is going to be released (at least without risking a segfault).
170.
▲
by
pdhborges
15y ago
The runtime system might not free the memory immediately.
171.
▲
by
pdhborges
15y ago
Imagine I have a JSONfiable protocol and I have a generic function to traverse a structure that uses the protocol to make a JSON document. It would be nice if the caller had a way to change the format.
172.
▲
by
pdhborges
15y ago
Is it possible to implement the same protocol for a particular type in multiple ways?
173.
▲
by
pdhborges
16y ago
C++ quicksort :| #include <algorithm> #include <iterator> #include <functional> using namespace std; template <typename T> void sort(T begin, T end) { if (begin != end) {
174.
▲
by
pdhborges
16y ago
Type classes or module implicits, that would be great.
175.
▲
by
pdhborges
16y ago
Just a little not so readers don't get the wrong impression: - imap returns an iterator, any is used to "force" the iterator run through all elements. - the loop runs on C because of any. Instead of a for loop where jump and body are repeat
176.
▲
by
pdhborges
16y ago
Look at the source code of the C program. It uses glib and the TCL libraries and it even includes locking for the multicore benchmark.