Mostly, but the type system can still be used to simplify and eliminate bugs at the call site. This could be expanded to handle all relevant types, but here's an example to simplify the call site with your use case of PoDs and const char*s:

It depends on access patterns and/or cost of equality comparisons in the case of searching. Here's search of Object structs with a string key and string value. The comparisons add up:

I thought it meant sellotape too, but apparently not: youtu.be/QYezHvMv4VI?si=SZ25…

Ha, nice! :) Since the 'converges to' operator can confuse people, I've simplified the loop using the 'tractor beam' operator:

That misrepresents the study. It needs to be larger with the shelves placed more consistently because they actually missed the single opportunity they had for the items on the shelves to form part of the results:

Indeed it is, indeed it is....

Water is safe to use for subduing Li battery fires. There's also a big difference between 1000s of densely packed cells in an EV battery and sparsely distributed single cells in a vape shop. youtube.com/watch?v=4xjDdmv8…

All-in-one machines (minus compactor) can do permanent 'dynamic' pothole repair in 30 minutes these days; stronger than trad. repair and make council cold fixes pointless. Where are the fleets? youtube.com/watch?v=rUBJsP4U… sciencedirect.com/org/scienc… machineseeker.co.uk/ticab-as…

Nice, thanks. I've found that the C standard it allows is very flexible:

There's only 64/128 bytes of initial pre-fetch without warmup and it's surely more likely to be iterating over collections to get a warm up than randomly (enum 'named'?) accessing? Here's a benchmark, the known array position lookup is faster, but the hash map is overall winner: