Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with c++11
Search options not deleted
user 84900
Code that is written to the 2011 version of the C++ standard, sometimes known by its pre-publication name of "C++0x". Use in conjunction with the 'c++' tag.
3
votes
Accepted
Lock-free MultiConsumer/MultiProducer queue
Hello and welcome to Code Review.
Code comments
Consider writing what you expect each function to do at its most important steps. Short concise comments are preferred (I am guilty of not doing this, …
- 565
2
votes
0
answers
429
views
Implementation of a lock-free fixed-sized allocator - follow-up - with commented code
The following implementation of a lock-free fixed-size allocator is a follow-up of:
Implementation of a lock-free fixed-sized allocator
§1 - Introduction
The purpose is self-learning of atomic ty …
- 565
12
votes
2
answers
2k
views
Implementation of a lock-free fixed-sized allocator
This question now has a follow-up:
Implementation of a lock-free fixed-sized allocator - follow-up - with commented code
I've tried implementing a lock-free fixed-size allocator while trying to le …
- 565
3
votes
Accepted
MPMC lock-free queue
Welcome to Code Review. This queue implementation is not truly concurrent-ready.
Arbitrary initial capacity
template <typename Type, std::size_t Capacity = 100>
Why have you decided that the defaul …
- 565