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 5942
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.
1
vote
QuickSort C++ Implmentation using Iterators #2
If you're really going to limit your code to vectors of ints, then the using statement in
using std::swap;
swap(*(i+1),*right);
is not accomplishing anything. You could just write
std::swap(*(i+1 …
- 131
0
votes
Functor to compare two floats with tolerance
As barak manos points out, your operator() body could be
return f1 < f2 && std::abs(f2 - f1) >= m_tolerance;
but, f1 < f2 is the same as 0 < f2 - f1, or f2 - f1 > 0. If that is true, then std::abs( …
- 131
2
votes
1
answer
267
views
Which is the better way to return a new instance of a boost intrusive_ptr
Unlike most(?) smart pointers, boost::intrusive_ptr has a non-explicit constructor. Given that, one could write
typedef boost::intrusive_ptr<Foo> FooPtr;
FooPtr MyFactory()
{
return new Foo(a, b …
- 131