Loading User Information from Channel 9
Something went wrong getting user information from Channel 9
Loading User Information from MSDN
Something went wrong getting user information from MSDN
Loading Visual Studio Achievements
Something went wrong getting the Visual Studio Achievements
C++ and Beyond 2012: Herb Sutter - You don't know [blank] and [blank]
Jan 02, 2013 at 6:06 AMI think Herb is wrong. Const implies thread-safe, but thread-safe does not imply const, so the two are not equal/equivalent.
Concurrent containers etc will certainly be thread-safe but not all functions will be const.
GoingNative 8: Introducing Casablanca - A Modern C++ API for Connected Computing
May 02, 2012 at 12:03 PMWhat platforms does this API support?
Just Windows?
C++ needs cross-platform libs.
C9 Lectures: Stephan T Lavavej - Advanced STL, 5 of n
Jun 11, 2011 at 10:10 AMThe allocator could allocate a pool and serve requests from that to avoid calling malloc.
C9 Lectures: Stephan T Lavavej - Advanced STL, 5 of n
Jun 11, 2011 at 10:09 AMTrue, just wanted to point out that using const vector<unsigned char>& isn't very generic. And that I miss a ptr pair wrapper in the STL.
I'm not familiar with bimap, but I assume it's not a multi-container.
I like the you don't pay for what you don't use principle in C++, but using vectors for buffers violates that. I'd also prefer not to write my own class for such basic functionality.
C9 Lectures: Stephan T Lavavej - Advanced STL, 4 of n
Jun 08, 2011 at 1:13 PMWhy do other containers not have them?
C9 Lectures: Stephan T Lavavej - Advanced STL, 5 of n
Jun 08, 2011 at 10:28 AM@STL: Are you aware of Step Into Specific? It's a context menu option that allows you to avoid repeatedly stepping into and out of functions until you hit the right one.
hexify's parameter type is const vector<unsigned char>&. boost::iterator_range<unsigned char> might've been better. STL lacks a ptr pair wrapper (for contiguous memory).
> hash_file.right.find(f) != hash_file.right.end()
Can't you use hash_file.right.count(f) here?
> const bimap<string, string>::left_const_iterator j = hash_file.left.find(h);
Can't you just insert and check the return value to avoid a second lookup?
Before you said vector<unsigned char> should be used for buffers. However, it initializes the buffer to 0, which is unnecessary overhead. Isn't there a better solution?
Greetings,
Olaf