Search:

Thank you for the help.

I think I have fixed it. I have found in the beej manual that if select returns 1 and recv returns 0 then the connection on the other side has been closed.

What was...

I am trying to learn socket programming but I am having trouble with partial recv-ing.

I want to get all the text in yahoo.com/index.html.



TCPClient client("www.yahoo.com",80);

...

There are some scripting languages such as lua and python that will work with C++. I am not sure fully what you mean though.

Thank you Dark_Phoenix for the information as well as everyone else for their suggestions.

As for the psu, I have found some 400-550 watt ones on newegg for as low as $20. The motherboard manual...

I know the basics of how to do this because I have built one before; I am not asking how to do this from scratch.

Someone was about to throw away a motherboard and videocard thinking that they...

Most C/C++ IDEs like devcpp or codeblocks can do this for you.

For the original question I suggest you look for tutorials on operator overloading. Most of them use a vector class to teach you the concept. With this you can specify how the class is manipulated...

void BinaryTree::insertNode(Node*& n, int v)


the *& was what the problem was. I am still unsure of what it exactly means.

Also I am not sure if I am deleting all the nodes correctly. Would I...

If you read tutorial 1 again it shows you how to fix it, you left out some of the resizing code in that tutorial. His tutorials are cumulative.

google code search. Search for games and just look and see how they implement their classes and divide up their files.

This is something I had saved in my hardrive cpp reference code directory, I forgot where it came from. No windows code even needed.



#include <iostream>
#include <dirent.h>


int main()
{

I don't think displaying is the probem, inserting is.

When root is passed in "insertNode(Node* n, int v);" as insertNode(root, i) the new keyword works only for the prototype "Node* n" but root...

I am having trouble with this. I believe I have found where the problem is with the random couts in the functions. When a node is added it keeps getting added to root node. It won't become a new...