about summary refs log tree commit diff stats
path: root/cpp/.traces/return_on_fallthrough
Commit message (Collapse)AuthorAgeFilesLines
* 1184 - finally, concurrencyKartik K. Agaram2015-04-241-0/+1
|
* 1166Kartik K. Agaram2015-04-241-3/+3
| | | | | | | Why did I think STL's map wasn't efficient? It has logarithmic complexity (maintains a tree internally) and is faster than hashing for small containers. It's the more portable solution and should be what I turn to by default.
* 1146 - yet another out-of-bounds accessKartik K. Agaram2015-04-221-0/+40
There's a test in this commit, but it doesn't actually fail, because by some accident the memory at index 2 of recipe 'f' has data at the is_label offset and breaks out of the loop. Graah. How did I ever misplace that "Reading One Instruction" waypoint? I could swear I was concerned about this possibility when I implemented calls. Today has been tough on my confidence. STL helps avoid memory leaks but doesn't help with buffer overflows nearly as much as I thought. Oh brilliant, valgrind caught the problem! And there weren't any others. I feel much better.