List_Class.h

#ifndef QNANO_NEW_LIST_CLASS_DEFINED_H_
#define QNANO_NEW_LIST_CLASS_DEFINED_H_

#include <vector>
#include <iostream>
#include <cstdlib>

template <class T> class List_Class{
public:
  std::vector<T> list; 
  T & operator[](size_t i){ return list[i];}
  const T & operator[](size_t i) const{ return list[i];}
//  T operator[](size_t i) const{ return list[i];}
  size_t size() const{return list.size();}
  virtual void resize(size_t i){list.resize(i);}
  virtual void reserve(size_t i){list.reserve(i);}
  virtual void push_back(const T &value) { list.push_back(value);}
  virtual void clear(){list.clear();}
//  operator T() const{return list;}
  List_Class<T>& operator= (const std::vector<T> & Tvec){ list=Tvec; return *this;}
  int find(T element) const;
  int find_check(T element) const;
  void add_if_new(T element);
  void add_if_new_check(T element);
};

template <class T> class List_Class_NoFind{
public:
  std::vector<T> list; 
  T & operator[](size_t i){ return list[i];}
  const T & operator[](size_t i) const{ return list[i];}
//  T operator[](size_t i) const{ return list[i];}
  size_t size() const{return list.size();}
  virtual void resize(size_t i){list.resize(i);}
  virtual void reserve(size_t i){list.reserve(i);}
  virtual void push_back(const T &value) { list.push_back(value);}
  virtual void clear(){list.clear();}
//  operator T() const{return list;}
  List_Class_NoFind<T>& operator= (const std::vector<T> & Tvec){ list=Tvec; return *this;}
  void add_if_new(T element);
  void add_if_new_check(T element);
};


#endif