Search:

Corrections are in red.



int main(){
//i can do it like this
int** p;
p = new int*[10];
for(int i=0;i<10;i++)
p[i] = new int[10];

Yes, passing is the right choice of word, not converting.

Because it first creates a temporary of abc by calling constructor abc(char*), and then that temporary is passed by value to operator=(abc). Maybe you can run a debugger to see what's happening.

...

I don't understand what you mean by "without checking its type", but here is what I think is happening.



anotherObject = "i Know why this works now!!!"; //
anotherObject = 8; ...

Is std::vector<XButton*> the type of "buttons" in the following code ?



std::for_each(
buttons.begin(),
buttons.end(),
std::bind2nd(std::mem_fun_ref(&XButton::Update), event_));

solution[i] = new_y;


You are assigning new_y, which is of type double*, to solution[i], which is of type double.

Strictly speaking, this will not give the same result as the for-loop version when there is more than one element equal to "observer". The erase/remove idiom erases all of them, but the for-loop...

You might want to take a look at boost graph library.

http://www.boost.org/libs/graph/doc/table_of_contents.html

You can use one of the shortest path algorithms on your problem and compare the...

Make dashReplace return char*.

Alternatively, make dashReplace return nothing (return void). Since it is passing a pointer to line[12] as an argument, after dashReplace (line) is called, line[12]...

1. In input.h, add "extern" to declare variables. Without "extern", it means you are defining variables, and since header files are most likely included multiple times, the compiler will complain the...

Use bind2nd. In your example, mem_fun_ref returns a functor that takes 2 arguments, and bind2nd binds the second one to 0.



std::for_each (tests.begin (),
tests.end (),...

Does it work if you change the order of the edges in the dataset?
For example, if you swap the 1st and the 6th edge, does it give the same results?
It seems to me that your code will print the 2...

Your code is already simple enough (just 2 lines, if you get rid of the braces) so there is no need to make it more elegant. Also, I think your code might be better than the one using operator[], in...

After comparing the weights, call a function that swaps the source and target if source > target (note that the original Edge is constant).



Edge order(const Edge& e) {
Edge tmp(e);

if...

I agree. The original code is much easier to read, especially for those who don't use boost or STL often.

If you are wiling to use boost::bind, the following code should accomplish what you want to do.



transform(objVec.begin(), objVec.end(), inserter(objMap, objMap.begin()),
...

Assuming you have a member of type B*,


class A {
public:
B* getInstB() {
return b;
}
private:
B* b;

If you are looking for an array you can resize, you might want to look into STL containers, such as vector or deque.

http://www.cplusplus.com/reference/stl/

Use string or an array of size 2 to record the two characters previously read.



char ch;
string pre(" ");

while (TheFile.get(ch)) {
if (pre == ". ")
TheCopy.put(toupper(ch));

You can write a template class as follows.



template<typename T>
struct ToConstRef {
typedef const T& _Type;
};

template<typename T>

I cannot be sure since I don't understand how you are approaching the problem, but the following line looks like a mistake to me.


while...

If the set contains pointers, use "mem_fun" instead. The following link gives an example.

http://www.sgi.com/tech/stl/mem_fun_t.html

The approach using remove_copy_if, as well as the one using...

No, it doesn't.

http://www.sgi.com/tech/stl/set.html

You can use mem_fun_ref when the predicate is a member function of the object stored in set.



#include <iostream>
#include <algorithm>
#include <iterator>
#include <set>

using namespace...

You don't need to make it a template. Just make it a plain old function.



class C {
public:
int f(char) {}
};

template <class Cl, typename R, typename P1>