GPArray.h

#ifndef UTIL_G_P_ARRAY_H
#define UTIL_G_P_ARRAY_H
 
/*
* Util Package - C++ Utilities for Scientific Computation
*
* Copyright 2010 - 2017, The Regents of the University of Minnesota
* Distributed under the terms of the GNU General Public License.
*/
 
#include <util/containers/PArray.h>
#include <util/global.h>
 
namespace Util
{
 
   template <typename Data>
   class GPArray : public PArray<Data>
   {
 
   public:
 
      GPArray();
 
      GPArray(GPArray<Data> const & other);
   
      GPArray<Data>& operator=(GPArray<Data> const & other);
 
      virtual ~GPArray();
 
      void append(Data& data);
 
      void reserve(int capacity);
 
      void deallocate();
 
      void clear();
 
      bool isAllocated() const;
 
   protected:
 
      using PArray<Data>::ptrs_;
      using PArray<Data>::capacity_;
      using PArray<Data>::size_;
 
   };
 
   /*
   * Default constructor.
   */
   template <typename Data>
   inline GPArray<Data>::GPArray()
    : PArray<Data>()
   {}
 
   /*
   * Copy constructor, copy pointers.
   *
   * Allocates a new Data* array and copies all pointer values.
   */
   template <typename Data>
   GPArray<Data>::GPArray(GPArray<Data> const & other) 
    : PArray<Data>()
   {
      assert(other.capacity_ >= other.size_);
      if (other.ptrs_ == 0) {
         assert(other.capacity_ == 0);
         assert(other.size_ == 0);
         ptrs_ = 0;
         capacity_ = 0;
         size_ = 0;
      } else { 
         assert(other.capacity_ > 0);
         // Allocate array of Data* pointers
         Memory::allocate<Data*>(ptrs_, other.capacity_);
         capacity_ = other.capacity_;
         size_ = other.size_;
         // Copy pointers
         if (size_ > 0) {
            for (int i = 0; i < size_; ++i) {
               ptrs_[i] = other.ptrs_[i];
            }
         }
         // Nullify unused elements of ptrs_ array
         if (capacity_ > size_) {
            for (int i = size_; i < capacity_; ++i) {
               ptrs_[i] = 0;
            }
         }
      }
   }
 
   /*
   * Assignment, element by element.
   */
   template <typename Data>
   GPArray<Data>& GPArray<Data>::operator=(GPArray<Data> const & other) 
   {
      // Check for self assignment
      if (this == &other) return *this;
 
      clear();
      for (int i = 0; i < other.size_; ++i) {
         append(other[i]);
      }
      return *this;
   }
 
   /*
   * Destructor.
   */
   template <typename Data>
   GPArray<Data>::~GPArray()
   {
      size_ = 0; 
      if (isAllocated()) {
         Memory::deallocate(ptrs_, capacity_);
         capacity_ = 0; 
      }
   }
 
   /*
   * Reserve space for the underlying array of Data* pointers.
   */
   template <typename Data>
   void GPArray<Data>::reserve(int capacity) 
   {
      if (capacity <= 0) {
         UTIL_THROW("Cannot reserve with capacity <=0");
      }
      if (ptrs_ == 0) {
         assert(capacity_ == 0);
         assert(size_ == 0);
         Memory::allocate<Data*>(ptrs_, capacity);
         capacity_ = capacity;
         size_ = 0;
      } else if (capacity > capacity_) {
         assert(capacity_ > 0);
         assert(capacity_ >= size_);
         assert(size_ >= 0);
         Data** newPtr = 0;
         Memory::allocate<Data*>(newPtr, capacity);
         if (size_ > 0) {
            for (int i = 0; i < size_; ++i) {
               newPtr[i] = ptrs_[i];
            }
         }
         Memory::deallocate<Data*>(ptrs_, capacity_);
         ptrs_ = newPtr;
         capacity_ = capacity;
      }
   }
 
   /*
   * Deallocate associated memory.
   */
   template <typename Data>
   void GPArray<Data>::deallocate() 
   {  
      size_ = 0; 
      if (isAllocated()) {
         assert(capacity_ > 0);
         Memory::deallocate<Data*>(ptrs_, capacity_);
         capacity_ = 0; 
      } 
   }
 
   /*
   * Append an element to the end of the PArray.
   */
   template <typename Data>
   void GPArray<Data>::append(Data& data) 
   {
      if (!isAllocated()) {
         assert(capacity_ == 0);
         Memory::allocate<Data*>(ptrs_, 64);
         capacity_ = 64;
         size_ = 0;
      } else if (size_ == capacity_) {
         assert(capacity_ > 0);
         assert(capacity_ >= size_);
         assert(size_ >= 0);
         Data** newPtr = 0;
         Memory::allocate<Data*>(newPtr, 2*capacity_);
         if (size_ > 0) {
            for (int i = 0; i < size_; ++i) {
               newPtr[i] = ptrs_[i];
            }
         }
         Memory::deallocate<Data*>(ptrs_, capacity_);
         ptrs_ = newPtr;
         capacity_ = 2*capacity_;
         // size_ is unchanged
      }
      // Append new element
      ptrs_[size_] = &data;
      ++size_;
      assert(size_ <= capacity_);
   }
 
   /*
   * Reset to empty state, without deallocating.
   */
   template <typename Data>
   inline void GPArray<Data>::clear()
   {  size_ = 0; }
 
   /*
   * Is this GPArray allocated?
   */
   template <class Data>
   inline bool GPArray<Data>::isAllocated() const
   {  return (bool)ptrs_; }
 
} 
#endif