Top all-time · #2958
Baptiste Wicht
Personal blog · baptiste-wicht.comprogramming
Baptiste Wicht's personal blog at baptiste-wicht.com covers programming. Since 2010, 26 different Hacker News readers have linked it 49 times, most often “Zapcc C++ compilation speed against gcc 5.4 and clang 3.9”. It is still writing: the last post was on 2026-09-27, and you can follow it by feed.
Too few sampled comments (11) to say how often HN recommends it.?
Why HN links it
HN readers cite Baptiste Wicht's C++ posts, especially the 2012 vector-vs-list benchmark, as evidence that cache behaviour matters more than big-O for data structures. Other links cover Mutt email setup and Java 7.
Summarised by Claude from a sample of 11 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Tutorials and short posts about programming, C++, Java, Assembly, Operating Systems Development, Compilers, ...
Most-linked posts?
- Zapcc C++ compilation speed against gcc 5.4 and clang 3.93 people · 3 mentions · first linked 2016-12-06
- /posts/2012/12/cpp-benchmark-vector-list-deque.html3 people · 3 mentions · first linked 2018-09-11
- /posts/2012/12/cpp-benchmark-vector-list-deque.html2 people · 2 mentions · first linked 2014-04-02
- Java 7 : Add “public defender methods” to Java interfaces2 people · 2 mentions · first linked 2010-05-31
What Hacker News says?
> using std::list ever is laughable https://baptiste-wicht.com/posts/2012/11/cpp-benchmark-vecto... > some of us have been around the block a few times though, and now need to make sure those spaces are delineated for others in a way that won't force them into a performance corner. This, just like the rest of your comment, is just patronizing and condescendant. > I don't mean to brag, but I guess I'm a lot better at…
Comment linking /posts/2012/11/cpp-benchmark-vector-vs-list.html
on “Generics can make your Go code slower”Submitted Zapcc – A faster C++ compiler as a story · 88 points
HN discussionI wasn't even aware of that proposal, just found these examples[1] and love the idea. Sort of in the same vein as static imports (as far as usability) but has a really nice added side effect of exporting a default impl from an interface that can be overridden. Thanks! [1] http://www.baptiste-wicht.com/2010/05/java-7-add-public-defe...
Comment linking /2010/05/java-7-add-public-defender-methods-to-java-interfaces/
on “Java 7 is now available”Submitted Java 7: Oracle pushes a first version of closures as a story · 85 points
HN discussionProbably isn't too bad. chunks probably fill a cache line. Then it is just a question of whether or not beam inserts prefetches for the next chunk, and or the CPU prefetch realizes we are chasing this set of pointers. Note: I am more familiar with C++, so C++ digression here. C++ has std::deque that is a similar non-contiguous chunked container, comparing it to std::vector(the contiguous container) it is really clos…
Comment linking /posts/2012/12/cpp-benchmark-vector-list-deque.html
on “Why I program in Erlang (2012)”Submitted Java 7 is adding dynamics as a story · 51 points
HN discussionhttps://baptiste-wicht.com/posts/2012/12/cpp-benchmark-vecto... From 2012. std::deque does very well. Suspect the difference is fairly anaemic. Usually if you're choosing data structures, you pick a "good enough choice," (any of the three). Or, if it matters, you pull out your profiler and pick the "exact" right one.
Comment linking /posts/2012/12/cpp-benchmark-vector-list-deque.html
on “The true cost of linked lists”Submitted Java 7 : More concurrency as a story · 47 points
HN discussionAnother fun way to solve this is using Logic programming, e.g. http://baptiste-wicht.com/posts/2010/09/solve-einsteins-ridd...
Comment linking /posts/2010/09/solve-einsteins-riddle-using-prolog.html
on “Using Simulated Annealing to Solve Logic Puzzles”Submitted Java 7 : The new java.util.Objects class as a story · 38 points
HN discussionWhen I set up my personal gmail with Mutt, I used the following guides, if you're interested. None of them are perfect, so I did what most people do and took bits and bobs from all of them: 1. [ https://smalldata.tech/blog/2016/09/10/gmail-with-mutt ] 2. [ http://stevelosh.com/blog/2012/10/the-homely-mutt/ ] 3. [ https://baptiste-wicht.com/posts/2014/07/a-mutt-journey-my-m... ]
Comment linking /posts/2014/07/a-mutt-journey-my-mutt-configuration.html
on “Can you use the terminal for everything? [video]”Submitted Java 7 I/O: Asynch operations, multicasting, random access with JSR 203 (NIO.2) as a story · 29 points
HN discussionMutt + notmuch (search) gives you all that archival, excellent filtering, keyboard-driven navigation, and the advantage of cutting Google off your own personal journal datastream. https://baptiste-wicht.com/posts/2014/08/a-mutt-journey-sear...
Comment linking /posts/2014/08/a-mutt-journey-search-mails-with-notmuch.html
on “Ask HN: Why Blog at All?”Submitted Deep Learning Library 1.0 – Fast Neural Network Library as a story · 17 points
HN discussion> linked-lists are unnecessary, performance killers, and generally evil. that's true on any CPU with more than 16kb of cache. linked lists were a good idea at the time of 486, not so much at the time of modern CPUs with 8+ megabytes of L3. See https://baptiste-wicht.com/posts/2012/12/cpp-benchmark-vecto...
Comment linking /posts/2012/12/cpp-benchmark-vector-list-deque.html
on “Why Rust closures are somewhat hard”Submitted Java 7 : The new try-with-resources statement as a story · 17 points
HN discussionInterestingly, a red-black tree can be viewed as a BTree [0]. Another case where caching plays a huge role in determining the most efficient data structure (See vector vs list [1]). [0]: http://en.wikipedia.org/wiki/Red%E2%80%93black_tree#Analogy_... [1]: http://baptiste-wicht.com/posts/2012/12/cpp-benchmark-vector...
Comment linking /posts/2012/12/cpp-benchmark-vector-list-deque.html
on “Btrees are the new black”Submitted Java Concurrency : Part 2 – Manipulate Threads as a story · 13 points
HN discussionYes, Templite and Templar: https://baptiste-wicht.com/posts/2016/02/use-templight-and-t...
Comment linking /posts/2016/02/use-templight-and-templar-to-debug-cpp-templates.html
on “The Grand C++ Error Explosion Competition”Submitted The new Path API in Java 7 as a story · 11 points
HN discussionThe point I was trying to make though is that even with 100mil datapoints you are looking at probably less than 50 reallocs. In userland, the story is even nicer because that actual reserve space in the vector is mostly going to be deferred until you actually write to it. I don't get the point about additional independent properties. Size of the struct changes the memory you need to grab, but not the number of reall…
Comment linking /posts/2012/12/cpp-benchmark-vector-list-deque.html
on “Ask HN: Is C/C++ really faster than Python?”Submitted Java Concurrency – Part 4 : Semaphores as a story · 10 points
HN discussionSubmitted C++17 Fold Expressions as a story · 4 points
HN discussionSubmitted Java Synchronization (Mutual Exclusion) Benchmark as a story · 4 points
HN discussionSubmitted Java 7 : Translucency and shaped windows as a story · 4 points
HN discussionSubmitted Zapcc C++ compilation speed against gcc 5.4 and clang 3.9 as a story · 3 points
HN discussionSubmitted Simulate static_if with C++11/C++14 as a story · 3 points
HN discussionSubmitted Vivaldi and Vimium = Finally No More Firefox! as a story · 2 points
HN discussionSubmitted C++11 Concurrency Tutorials as a story · 2 points
HN discussionSubmitted PVS-Studio on C++ Library Review as a story · 2 points
HN discussion
