Array.hh

Go to the documentation of this file.

#ifndef P_ARRAY_HH
#define P_ARRAY_HH

#include <stdarg.h>
#include <blort/Recognizer3D/PNamespace.hh>
#include <blort/Recognizer3D/Except.hh>

namespace P
{

template <class Elem> class Array
{
private:
  static const unsigned DEFAULT_SIZE = 10;
 
  Elem *array;        
  unsigned size;      
  unsigned capacity;  

  void CheckIndex(unsigned i) const throw(Except);
  void EnsureCapacity(unsigned need_size) throw(Except);

public:
  Array(unsigned s = 0) throw(Except);
  Array(const Array &a);
  ~Array();
  Array& operator=(const Array &a) {DeepCopy(a); return *this;}
  Elem& operator[](unsigned i);
  const Elem& operator[](unsigned i) const;
  bool Empty() {return size == 0;}
  Elem& First() throw(Except);
  const Elem& First() const throw(Except);
  Elem& Last() throw(Except);
  const Elem& Last() const throw(Except);
  void PushFront(const Elem &el);
  void PushBack(const Elem &el);
  void InsertBefore(unsigned i, const Elem &el);
  void InsertAfter(unsigned i, const Elem &el);
  void InsertSorted(const Elem &el, int(*compar)(const void *, const void *));
  unsigned Size() const {return size;}
  void Resize(unsigned new_size);
  void Sort(int(*compar)(const void *, const void *));
  bool Contains(const Elem &el) const;
  bool ContainsBackwards(const Elem &el) const;
  unsigned Find(const Elem &el);
  unsigned Find(unsigned start, const Elem &el);
  unsigned FindBackwards(const Elem &el);
  void Swap(unsigned i, unsigned j);
  void Set(const Elem &el);
  void Clear() {Resize(0);}
  void DeepCopy(const Array &a);
  unsigned CircularNext(unsigned i);
  unsigned CircularPrev(unsigned i);
  void Erase(unsigned i);
  void EraseFirst();
  void EraseLast();
  void Reverse();
  bool Intersect(const Array &a);
  void* Data();
};

}

#include "Array.ic"

#endif