//  Source File:  Tarray.C

#include <stdlib.h>
#include <iostream.h>
#include "Tarray.H"

template <class T>
Array<T> :: Array (int sz, int bs) : size (sz), base (bs)
{
    cout << "In constructor\n";
    ptr = new T [size + base];
    if (ptr == NULL) {
        cout << "Memory allocation failure in Array()" << endl;
        exit (-1);
    }
}

template <class T>
Array<T> :: ~Array ()
{
    cout << "In destructor\n";
    delete [] ptr;
}

template <class T>
T& Array<T> :: operator [] (int n)
{
    return *(ptr + n + base);
}

template <class T>
int Array<T> :: Search (T& key)
{
    int i;

    for (i = 0; i < size; ++i) {
        if ( (* (ptr + i + base)) == key) {
            return i;
        }
    }
    return -1; 
}

template <class T>
ostream& operator << (ostream& os, Array<T>& a)
{
    int i;

    for (i = 0; i < a.size; ++i) {
        os << (i + a.base) << ":  " << *(a.ptr + i + a.base) << endl;
    }
    return os;
}

template <class T>
istream& operator >> (istream& is, Array<T>& a)
{
    int i;

    for (i = 0; i < a.size; ++i) {
        is >> *(a.ptr + i + a.base);
    }
    return is;
}