CS 340 - 2/21/13

typedef revisited

// queue.h
#ifndef QUEUECLASS
#define QUEUECLASS

typedef Complex ElemType;

#include <iostream>

class Queue;

class Node
{
     
  private:
    ElemType elem_;
    Node *   next_;

    Node (const ElemType&);
};
.....

struct dynArrStruct
{
 double value1;
 int value2;
 int value3;
} 
typedef struct dynArrStruct dynArr;
typedef dynArr* dynArrPtr;

void f1 (dynArrPtr* param) // C
{
  .. 


pass-by-reference in C is done using
  pass-by-address  
void f1 (dynArrPtr& param) // C++
{
  ...



///////////////////////////////////

C++ Templated Classes
// file: queueTemplate.h

template <type T>
class Node
{
   friend Queue<T>;

   private:
      T         elem_;
      Node<T>*  next_;

      Node (const T&);
};

template <type T>
Node<T>::Node (const T& el)
  : elem_ (el), next_(NULL)
{
}

template <type T>
class Queue
{
  private:
     Node<T>* front;
     Node<T>* back;

  public:
     Queue();
     Queue(const Queue<T>&);
     ~Queue();

     Queue<T>& operator=(const Queue<T>&);
     bool isEmpty() const;
     void insert(const T&);
     const T& front () const;
     void remove ();
     void clear ();
};

template <type T>
Queue<T>::Queue ()
: front_ (NULL), back_ (NULL)
{
}

// end of queueTemplate.h


===============================
Use the templated class

// file myProject.cpp
#include "queueTemplate.h"

int main ()
{
   Queue<int> q1;
   Queue<double> q2;
   Queue<int> q3;
   Queue<Complex> q4;

   q1.insert(5);
   q2.insert(5.3);
   q2.insert(4);


///  file1.cpp
#include "templateQueue.h"
#inlcude "templateQueue.cpp"

Queue<double>;

/// file2.cpp
#include "templateQueue.h"

int main()
{
  Queue<double>  qDouble;