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++
Search options not deleted
user 217623
C++ is a statically typed, free-form, multi-paradigm, compiled, general-purpose programming language. This tag should be used for any question which requires knowledge or expertise with the C++ programming language. This is a general tag which is used for any of the C++ language standards (C++98, C++11, C++17, etc.). The question should identify the compiler being used, the operating system, and which of the C++ standards is being targeted.
9
votes
1
answer
1k
views
Using smart pointers to construct Binary Search Tree
I have three main questions:
Am I using std::unique_ptr correctly here? Using std::move and get?
Is there any way for me to make my _insert and _delete functions iterative?
I'd like for it to be som …
- 375
4
votes
1
answer
232
views
Extreme use of pointers in adjacency list graph construction?
Playing around with pointers in C++, implemented an adjacency list graph.
Am I going too far/extreme trying to place data onto the heap?
graph.h
#include <memory>
#include <unordered_map>
#include <fo …
- 375