Cells.h

Go to the documentation of this file.

/* 
   Packing of hard spheres via molecular dynamics
   Developed by Monica Skoge, 2006, Princeton University
   Contact: Aleksandar Donev (adonev@math.princeton.edu) with questions
   This code may be used, modified and distributed freely.
   Please cite:
   
   "Packing Hyperspheres in High-Dimensional Euclidean Spaces"
        M. Skoge, A. Donev, F. H. Stillinger and S. Torquato, 2006
        
   if you use these codes.      
*/


#ifndef LS2_Cells_H
#define LS2_Cells_H

#include "tarch/la/Vector.h"
#include "GlobalValue.h"
namespace algorithms{
namespace ls2{
template<int D, class T>
class Cells {
 
 public:
  Cells();
  Cells(const tarch::la::Vector<D, int>&);
  ~Cells();
  T& get(const tarch::la::Vector<D, int>&);
  tarch::la::Vector<D, int> get_size() const;
  void set_size(const tarch::la::Vector<D, int>&);
  void set_size(const int);
  void initialize(const int i);



 private:
  int elements;
  T* f;
  tarch::la::Vector<D, int> size;           // number of grid points for each dimension
  tarch::la::Vector<D, int> offset;
};


// Cells
// ~~~~~~~~~~~~
template<int D, class T>
Cells<D, T>::Cells()
  :  elements(0),f(0)
{
}


// Cells
// ~~~~~~~~~~~~
template<int D, class T>
Cells<D, T>::Cells(const tarch::la::Vector<D, int>& s)
  : f(0)
{
  set_size(s);
}


// ~Cells
// ~~~~~~~~~~~~~
template <int D, class T>
Cells<D, T>::~Cells()
{
  if(f != 0)
    delete[] f;
}


// get_size
// ~~~~~~~~
template<int D, class T>
inline tarch::la::Vector<D, int> Cells<D, T>::get_size() const
{
  return size;
}


// set_size
// ~~~~~~~~
template<int D, class T>
void Cells<D, T>::set_size(const tarch::la::Vector<D, int>& s)
{
  if(f != 0)
    delete[] f;

  size = s;

  elements = 1;
  for(int i=0; i<D; i++) {
    offset[i] = elements;
    elements *= size[i];
  }

  f = new T[elements];
}


// set_size
// ~~~~~~~~
template<int D, class T>
void Cells<D, T>::set_size(const int s)
{
  tarch::la::Vector<D, int> square;

  for(int k=0; k<D; k++)
    square[k] = s;

  set_size(square);
}


// get
// ~~~
template<int D, class T>
inline T& Cells<D, T>::get(const tarch::la::Vector<D, int>& pos)
{
  int p=0;
  for(int i=0; i<D; i++)
    p += pos[i]*offset[i];

  return f[p];
}


// initialize
// ~~~
template<int D, class T>
void Cells<D, T>::initialize(const int value)
{
  for(int i=0; i<elements; i++)
    f[i] = value;
}

}/* close namespace ls2 */
}/* close namespace algorithms */

#endif