Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
jbapple
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
12 ms
·
1.
▲
by
jbapple
6y ago
The benefits are visible if you search for the word "TSX". It says: "Replacing the insert and update functions of our specialized growing hash table with Intel TSX variants increases the throughput of our hash table by up to
2.
▲
by
jbapple
6y ago
Maybe it depends on what activities the ICC engages in within the US. Le Monde doesn’t have “jurisdiction” in the US (or anywhere) to arrest anyone, but they still do investigations, which are presumably still legal for foreign journalists
3.
▲
by
jbapple
7y ago
When I benchmarked that a few years ago, I found the overhead of a syscall made mmap much slower (assuming the C or C++ memory allocator had already received some memory from the OS it could dole out).
4.
▲
by
jbapple
7y ago
Does this apply to integer keys in the computational models that can do operations other than simple comparisons? In the transdichotomous model, I thought the best known sorting algorithms were O(n lg lg n) worst case, while the best known
5.
▲
by
jbapple
7y ago
See also https://web.archive.org/web/20190927163255/http://cantorsatt...
6.
▲
by
jbapple
7y ago
> why would I care about people coming from other countries? I mean, what do I get in return? This is a pretty stunning question. Most people care about people other than ourselves. Most people sometimes do things to benefit others, even
7.
▲
by
jbapple
7y ago
Got it; thanks for explaining. I suppose in a microecon 101 model, there’s some elasticity that causes the cost of the fees to be borne partially by the merchants?
8.
▲
by
jbapple
7y ago
Can you explain more?
9.
▲
by
jbapple
7y ago
> Has anyone explored regexp minimization? There has been significant work on https://en.wikipedia.org/wiki/DFA_minimization
10.
▲
by
jbapple
7y ago
It's a deterministic attack vector, so significant offline computation prep work is not unusual. https://en.wikipedia.org/wiki/Algorithmic_complexity_attack https://www.freecodecamp.org/news/h
11.
▲
by
jbapple
7y ago
Assuming you ignore the constant. And if you're willing to ignore the constant, you can get O(c) access, O(N^(1/c)) insert and delete at arbitrary indices, and O(c) insert at head and tail, for any constant c. The trick is to make
12.
▲
by
jbapple
7y ago
Where can I read more about the decision to develop Lean 4 in private, and what is the status of https://github.com/leanprover/lean4 , in your view?
13.
▲
by
jbapple
7y ago
The instruction and instruction set referenced in the comment you're referring to (PCMPxSTRy and SSE) are not AVX512; they were introduced long before AVX512 chips were manufactured.
14.
▲
by
jbapple
7y ago
> Weight is a weaker condition, since you can construct a polynomial weight sequence that results in linear height. I'd like to hear more. The varieties of weight-balanced trees I'm aware of all have logarithmic height. > In
15.
▲
by
jbapple
7y ago
These trees nearly identical to Scapegoat Trees, which were a rediscovery of the idea by different authors. https://cglab.ca/~morin/teaching/5408/refs/a99.pdf has the history: "A preliminary version
16.
▲
by
jbapple
7y ago
But logit-weight trees have logarithmic height, yes?
17.
▲
by
jbapple
7y ago
Are you familiar with hybrid logical time systems like " HybridTime - Accessible Global Consistency with High Clock Uncertainty" ( http://users.ece.utexas.edu/~garg/pdslab/david/hybrid-time-t... ) or
18.
▲
by
jbapple
7y ago
The title should be corrected to "SPARK", not "Spark". It's used all caps each time it's mentioned on the page. That's also how I've seen this tool referred to elsewhere in the programming language li
19.
▲
by
jbapple
8y ago
> portfolio theory means that serious due diligence isn't worth the effort. Could you expand on this?
20.
▲
by
jbapple
8y ago
What do you mean by "Zig is optimal"?
21.
▲
by
jbapple
8y ago
The indexes themselves might underperform an index+VC strategy though if they don't have access to high-growth companies that are staying private. Even if investors shouldn't pick stocks, it might be wise for them to invest in an
22.
▲
by
jbapple
8y ago
Over a 40-year career, assuming 4% real capital growth after inflation and a 3% safe withdrawal rate in retirement, a worker has to invest 25% of their gross income every year to have the same net income in retirement (assuming identical ta
23.
▲
by
jbapple
8y ago
Second Google hit when searching for the paper title: https://www.cs.vu.nl/~herbertb/papers/osreview2008-2.pdf
24.
▲
by
jbapple
8y ago
> Hmm I’m seeing the opposite. The last graph shows Google’s hash table outperforming in all but a few places, including at 400k. You're exactly right, General Pizza. I was trying to say that the Google table was faster, even though
25.
▲
by
jbapple
8y ago
This post has some overconfident and under-researched claims: > This came about because last year I wrote the fastest hash table (I still make that claim) I'm extremely dubious of claims of the "fastest $DATA_STRUCTURE" wi
26.
▲
by
jbapple
9y ago
That's the same as Tableau's HyPer. From the page you linked to: "The commercial license for HyPer, a spin-off of TUM, has been acquired by Tableau Software"
27.
▲
by
jbapple
9y ago
FWIW, Impala compiles more than just predicates. See, for instance, https://github.com/apache/impala/blob/e98d2f1c0af270930cd8a5...
28.
▲
by
jbapple
9y ago
Are either of these specifically adaptive packed-memory arrays? The former cites it, but only has one type of PMA implemented, it seems.
29.
▲
by
jbapple
9y ago
> I'm not sure I understand your question. I'm asking for a citation.
30.
▲
by
jbapple
9y ago
> 95% of any increases in FICA taxes are paid for by employees (via adjustments to wages and salaries) What evidence indicates it's 95% and not 20% or 80% or 99%?
More ›