All Questions
12
questions
16
votes
1
answer
1k
views
value_ptr<T> - a C++11 header-only, deep-copying smart pointer that preserves value semantics for polymorphic and undefined types
==
UPDATED: next revision HERE
==
My previous two iterations were here and here. I've since finalized the concept as described in the title, and would appreciate any feedback on the new solution ...
- 417
5
votes
1
answer
248
views
deep_ptr<T>; a header-only, deep copying, value semantic smart pointer for optionally defined types
Edit: final revision here
A couple days ago I posted a similar question here. Since then, I have refined the implementation a bit further, as the solution I had previously posited was a bit off ...
- 417
2
votes
1
answer
111
views
17
votes
2
answers
3k
views
boost::any replacement with std::unique_ptr support
I needed a boost.any look-a-like, that could handle a std::unique_ptr. I came up with this. Please provide some C++11 criticism.
...
- 1,434
11
votes
3
answers
17k
views
DeepPtr: a deep-copying unique_ptr wrapper in C++
When using the pimple idiom it is necessary to represent your "impl" as a forward declared pointer in the header file. This necessitates a lot of boilerplate code to implement the rule of five.
...
8
votes
2
answers
490
views
Smart pointer or how not to leak a pointer
Wrote a couple of blog articles about smart pointers.
Unique Pointer
Shared Pointer
Constructors for Smart Pointers
So I suppose it time to get the result reviewed.
This is not supposed to be a ...
- 95.4k
4
votes
2
answers
102
views
Pointer handle - follow-up
This is a followup to:
Pointer class/handle
Please review this pointer class.
...
- 2,718
4
votes
1
answer
500
views
Yet another shared pointer
What might be wrong with this shared pointer? One good point of it might be, that it should handle array types correctly by default (e.g. ...
- 1,434
4
votes
1
answer
293
views
value_ptr<T> - a C++11 header-only, deep-copying smart pointer that preserves value semantics for polymorphic and undefined types (updated)
My previous iteration was here. I've since finalized the concept as described in the title, and would appreciate any feedback
GitHub Link
Introduction:
...
- 417
3
votes
3
answers
150
views
Linked List Interview Code methods, runtime, and edge cases refactored
In my previous post I had a number of steps given to me from the accepted answer on how I can write more production ready code. In this post I want this code to be reviewed as near production code I'd ...
- 1,017
2
votes
3
answers
124
views
Queue Interview Code basic methods made from struct Node
Thanks for all the feedback, I optimized the code here.
Here I'm Writing a very simple Queue of struct Nodes with only these methods get_front(), ...
- 1,017
2
votes
1
answer
56
views
Queue Interview Code basic methods made from struct Node optimized
Using feedback from my previous implementation I'm writing a very simple Queue of struct Nodes with only these methods get_front(), get_back(), pop_front(), push_back(), and a ostream friend method. I ...
- 1,017