#include <iostream>
#include <cstdlib>
#include <string>
 
 
using namespace std;
 
struct str_pair
{
	char ip [50];
	char uri [50];
	str_pair *next;
	int counter;
};
str_pair *str_ptr;// pointer to an order struct, 
str_pair *list_head;// points to nothing initially.
 
const int list_size=; [COLOR="Red"]i need to know the list size!![/COLOR]
int main(int argc, char *argv[])
{
  if (argc == 1)
    { cout << "my name"<<endl;
      return(0);
    }
//--- initialize link list to empty.
list_head = NULL;// can test for NULL to see if anything is there.
//str_ptr = new str_pair;  //--- Create data at run time on the heap.
for (int i=0; i<list_size; i++)
{
str_ptr = list_head; // save old head of list.
list_head = new str_pair; // create new item.
list_head->next= str_ptr; // get next item to point to previous head.
list_head->counter =i;
}
strcpy(
str_ptr=list_head;
while(str_ptr != NULL)
{if(strcmp
return(0);
}

#include <string>
#include <vector>
using std::string;
using std::vector;
// other using statements here
 
class str_pair
{
public:
     str_pair() { counter = 0; }
 
     str_pair(string ip, string uri)
     {
             this->uri = uri;
             this->ip = ip;
             counter = 0;
     }
     void setPair(string ip, string url)
     {
             this->uri = uri;
             this->ip = ip;
             counter = 0;
 
     }
public:
    string ip;
    string uri;
    int counter;
};
 
vector<str_pair> list_head;
 
int main(int argc, char* argv[])
{
    string_pair node;    
    node.setPair(argv[1],argv[2]);
    // add string_pair to the vector
    list_head.push_back(node);    
}