We can perform the lookup and then do the contains check by checking the end iterator. The benefit of this is that if we *do* find an entry, then we aren't hashing into the map again to find it. We can also get rid of an unused std::vector temporary while we're at it. |
||
---|---|---|
.. | ||
kernel | ||
service | ||
ipc_helpers.h | ||
ipc.h | ||
lock.cpp | ||
lock.h | ||
result.h |