Message from C, C++ talks

June 2019

— But if I do this, only the second while get closed

— No

— You can put the outer loop into a function and return from it. Or use goto (but better don't)

— Not

— 

I'm reading a book and found an interesting search implementation example
http://www.dataorienteddesign.com/dodbook/node7.html#src:binarytimelookup
in Data-oriented Lookup part there are three code examples:
- first one is binary search in sorted array of structs
- second one is the same except for the keys moved to a separate array (so while searching it's more chance of cache hit)
- the third one I can't understand
seems like they do binary search to find a block that should fit cacheline and then do a linear search

— Is it like that? Why not to go further then and divide the array to multiple levels of such blocks?

— Tnx

— C++ is not dead nigga

— That's racism, please chose other words

— I'm sorry😂😂.. I'm black and I usually talk with blacks.. I should have checked the name..

— 😂

— But it's true though u can't find more jobs in c,c++

— Its not true

— There are tons of c++ jobs

— Just because cxx jobs aren’t cheap 😜