static-search-trees: remark on two blue lines

posts/static-search-tree/static-search-tree.org

@@ -162,7 +162,7 @@ In the end, Eytzinger search is around 4 times faster, which nicely corresponds
 to being able to prefetch 4 iterations of cache lines from memory at a time.
 
 #+attr_html: :class inset large
-#+caption: Query throughput of binary search and Eytzinger layout as the size of the input increases. At =1GB= input, binary search needs around =1150ns/query=, while Eytzinger is 6x faster at =200ns/query=.
+#+caption: Query throughput of binary search and Eytzinger layout as the size of the input increases. At =1GB= input, binary search needs around =1150ns/query=, while Eytzinger is 6x faster at =200ns/query=. (I'm sorry for the two blue lines here. The top one is binary search and the bottom one Eytzinger. Getting all the plots to work took long enough, and customizing all the colours is annoying, so I'm just using cycling through the default colours. Unfortunately that ended up with two equal colours here. At least colours *will* be consistent from one plot to the next.)
 [[file:plots/1-binary-search.svg][file:plots/1-binary-search.svg]]
 
 ** Hugepages