Search Results

Although there's room for argument that it might be an abuse, one way you could do the adjacent sums part of this would be to use std::adjacent_difference, but pass it a function that adds instead of …

While it's somewhat uncertain whether you'll like it (some compilers warn about doing so) it's entirely permissible to #undef a value that wasn't defined to start with, so you can consolidate these do …

I think Martin R's suggestion is a good one, but I won't repeat it. I'll start by considering your questions directly: As far as the iterator-based gcd goes, my immediate reaction is to wonder whet …

There's a reason the algorithms in the standard library use iterators instead of dealing with containers directly. One is that it makes code like this quite a bit simpler. For example, using iterators …

Bjarne gives a pretty succinct description of why this (and many similar) features aren't in the standard. He points out that virtually everybody who talks to him about C++ has essentially the same th …

Streams already have a mode in which they detect the base of a number from the prefix, exactly as desired here. To get to it, you set the base for the stream to 0. So, a mildly simplified version of …

I should start with the fact that I don't entirely agree with the widespread belief that "explicit is better than implicit". I think in this case, it's probably at least as good to have a class that j …

I can't help thinking that this seems somewhat...over-engineered. I think I'd consider something on this order as a starting point: #include <string> #include <algorithm> #include <sstream> #include …

Just a few comments: std::vector<Vector2f> make_bezier(const std::vector<Vector2f>& anchors, double accuracy=10000.0) You're using float for all your other floating point variables. Unless there's …

First, a general observation: you have a fair number of typos in your comments. Although the compiler doesn't check such things, I prefer to think of the comments as an integral part of the code, so e …

There are at least a few things I think I'd do differently, at any rate. const int MAX_RECV_LEN = 8096; const int MAX_MSG_LEN= 1024; const int PORT_NUM = 1200; The ALL_CAPS convention was original …

I'd start by making the code more generic: template <class T> class LinkedList { Then I'd probably separate the user's data (what you're storing) from "your" data (the links used by the list itself …

To reduce redundancy, I'd probably move the check for the inputs being the same size into a function template by itself, and just invoke that from the other three: template <typename T> void check_si …

My immediate reaction would be to accept a collection of ranges of some sort (e.g., Boost Range, or even just a pair of iterators). Since the range (or iterator) types would be template parameters, t …

At least as it stands right now, quite a bit of your code accomplishes nothing. template<typename T, typename H> class tree; template<typename T, typename H> class tree : public std::unordered_map<T …