Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
joaquintides
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
31.
▲
Mind the cache
(github.com)
3 points
by
joaquintides
11y ago
|
0 comments
32.
▲
SOA container for encapsulated C++ DOD
(bannalia.blogspot.com)
1 points
by
joaquintides
11y ago
|
0 comments
33.
▲
SOA container for encapsulated C++ DOD
(bannalia.blogspot.com)
4 points
by
joaquintides
11y ago
|
0 comments
34.
▲
by
joaquintides
11y ago
Hi Veedrac, some results at https://news.ycombinator.com/item?id=10177262
35.
▲
C++ encapsulation for Data-Oriented Design: performance
(bannalia.blogspot.com)
7 points
by
joaquintides
11y ago
|
0 comments
36.
▲
C++ encapsulation for Data-Oriented Design
(bannalia.blogspot.com)
44 points
by
joaquintides
11y ago
|
18 comments
37.
▲
Design patterns for invariant suspension
(bannalia.blogspot.com)
11 points
by
joaquintides
11y ago
|
1 comments
38.
▲
by
joaquintides
11y ago
Thanks for the link. The inorder_next you refer to is equivalent to my increment (even the structure of the code is the same) with the difference that inorder_next relies on 1-based indices and uses intrinsic ffz. Definitely worth a try.
39.
▲
by
joaquintides
11y ago
Hi, I totally agree with you analyzing the assembly produced can provide lots of insight. For the particular case of understanding cache friendliness, though, I'm not so sure looking at the assembly can help that much, since caching ma
40.
▲
Traversing a linearized tree
(bannalia.blogspot.com)
21 points
by
joaquintides
11y ago
|
5 comments
41.
▲
Cache-friendly binary search
(bannalia.blogspot.com)
81 points
by
joaquintides
11y ago
|
13 comments
42.
▲
by
joaquintides
11y ago
You might also consult the entries given below, which take into account some late improvements in Boost.MultiIndex not present at the beginning of the series: http://bannalia.blogspot.com/2014/01/a-better-hash-tabl
43.
▲
Indiscernible properties
(bannalia.blogspot.com)
1 points
by
joaquintides
12y ago
|
0 comments
44.
▲
by
joaquintides
12y ago
As you correctly point out the problem is entirely symmetrical to that of keeping a hot beverage as hot as possible. If we take the different problem of trying to cool a hot beverage, the optimum, pathological solution would be a glass with
45.
▲
by
joaquintides
12y ago
I've added a small postscript explaining why calculus of variations (in its simplest form at least) is not applicable to this problem.
46.
▲
The perfect shape
(bannalia.blogspot.com)
99 points
by
joaquintides
12y ago
|
21 comments
47.
▲
Fast polymorphic collections with devirtualization
(bannalia.blogspot.com)
1 points
by
joaquintides
12y ago
|
0 comments
48.
▲
Fast polymorphic collections
(bannalia.blogspot.com)
2 points
by
joaquintides
12y ago
|
0 comments
49.
▲
Climbing down the tree: framework and performance
(bannalia.blogspot.com)
1 points
by
joaquintides
13y ago
|
0 comments
50.
▲
Climbing down the tree
(bannalia.blogspot.com)
8 points
by
joaquintides
13y ago
|
1 comments
51.
▲
Complexity of lexicographical comparison: part II
(bannalia.blogspot.com)
2 points
by
joaquintides
13y ago
|
0 comments
52.
▲
Monads and slots
(bannalia.blogspot.com)
2 points
by
joaquintides
13y ago
|
0 comments
53.
▲
A better hash table: Clang
(bannalia.blogspot.com)
1 points
by
joaquintides
13y ago
|
0 comments
54.
▲
A better hash table: GCC
(bannalia.blogspot.com)
1 points
by
joaquintides
13y ago
|
0 comments