Using linked list templates

I am sorry about this but this really confuses me for some reason. I am just trying to do statement coverage for a header file that I am including in my cpp file. This header file contains various functions used to do different things to the linked list. I am really stuck on this and I'm sure it's a simple thing. Here is the header file that contains all the functions I need to use for my statement coverage:

Code:

---

template <typename Data>
struct LListNode
{
  Data data;
  LListNode<Data>* next;

  LListNode() {next = 0;}
  LListNode (const Data& d, LListNode<Data>* nxt = 0)
    : data(d), next(nxt)
  {}
};


template <typename Data>
struct LListHeader {

  LListNode<Data>* first;

  LListHeader();

  void addToFront (const Data& value);
  void addToEnd (const Data& value);

  // Add value after the indicated position
  void addAfter (LListNode<Data>* afterThis, const Data& value);
 
  // Add value before the indicated position
  void addBefore (LListNode<Data>* beforeThis, const Data& value);

  // Add value in sorted order.
  //Pre: all existing values are already ordered
  void addInOrder (const Data& value);

  // Remove value at the indicated position
  void remove (LListNode<Data>* here);
 
  // Add value after the indicated position
  void removeAfter (LListNode<Data>* afterThis);


  // Search for a value. Returns null if not found
  LListNode<Data>* find (const Data& value) const;

  // Search an ordered list for a value. Returns null if not found
  LListNode<Data>* findOrdered (const Data& value) const;


  // Empty the list
  void clear();

  // Append another list onto the end of this one
  void append (const LListHeader<Data>& list);
};

---

Also, here is my attempt at making a cpp file run all the functions:

Code:

---

#include <iostream>
#include <string>
#include <sstream>
#include <fstream>
#include <cstdlib>

#include "sflistUtils.h"

using namespace std;



// Unit test driver for Singly Linked Lists





int main(int argc, char** argv)
{

  string line;
  getline(cin, line);
  while(cin)
  {
      istringstream in (line);
      cout << line << endl;
      string toSearchFor;
      in >> toSearchFor;
      string LListNode(line);
      addToFront(toSearchFor);
      getline(cin, line);
  }

  return 0;
}

---

I know I just attempted at addToFront but I can't get it to work!
Thanks for the help guys!

Code:

---

string LListNode(line);

---

I think perhaps you wanted

Code:

---

LListNode<string> node(line);

---

That's the syntax for declaring an instance of a templated class.

You'll also need to create an LListHeader object in much the same way so that you can call the addToFront() method of this class.

Remember, if you want to call a method of a class:

Code:

---

Class object;
object.method();

---

Dont you need to declare a LListHeader class?
Initialize it and call the addToFront?

I'm sorry but I just don't get it. I can't seem to call ANY function because I apparently have no idea what I'm doing. I don't know why this is so confusing for me when I can easily build a linked list without templates. If anyone could just do ONE example for me or just explain it a little clearer I would greatly appreciate it.

All the function bodies for the different things done to the linked list are in the header file. I don't need to write the function bodies. I just need to use these functions! This is very frustrating!

Your code how you create class instances and how you call member functions is all wrong. The usage is not really different from non-templated classes (except the instance declaration takes the template arguments in <>).

What is different is that templated code must be implemented in the header file as the implementations need to be available to the compiler while it is compiling any file that includes the header (your main function). You can't separate template classes between a .h and .cpp file.

How does this look:

Code:

---

int main(int argc, char** argv)
{
    ifstream in;
    int num1, num2, num3, num4;
    in.open("sfltest.dat");

    LListNode<int> next;
    LListHeader<int> list;

    if(!in)
    {
        cerr << "Please put sfltest.dat in directory of executable" << endl;
    }

    in >> num1 >> num2 >> num3 >> num4;
    while(in)
    {
    list.addToFront(num1);
    list.addToEnd(num2);
    in >> num1 >> num2 >> num3 >> num4;
    }



  return 0;
}

---