cntr_distributed_array_decl.hpp

Go to the documentation of this file.

#ifndef CNTR_DISTRIBUTED_ARRAY_DECL_H
#define CNTR_DISTRIBUTED_ARRAY_DECL_H

#include "cntr_herm_matrix_timestep_view_decl.hpp"


namespace cntr{

template <typename T> 
class distributed_array{
public:
  /* construction, destruction */
  distributed_array();
  ~distributed_array();
  distributed_array(const distributed_array &g);
  distributed_array &operator=(const distributed_array &g);
  // #if __cplusplus >= 201103L
  // distributed_array(distributed_array &&g) noexcept;
  // distributed_array &operator=(distributed_array &&g) noexcept;
  // #endif
  distributed_array(int n,int maxlen,bool mpi);
  T* block(int j);
  void clear(void);
  void reset_blocksize(int blocksize);
  T* data(void) const {return data_;}
  int n(void) const {return n_;}
  int numblock_rank(void);
  int firstblock_rank(void);
  int blocksize(void) const {return blocksize_;}
  int maxlen(void) const {return maxlen_;}
  std::vector<int> tid_map(void) const {return tid_map_;}
  int tid(void) const {return tid_;}
  int ntasks(void) const {return ntasks_;}
  bool rank_owns(int k) const {return tid_map()[k] == tid();}
  
  // MPI UTILS
  // all MPI routines are given "trivial" no MPI versions, which basically assume ntasks=1 and do nothing
#if CNTR_USE_MPI==0
  void mpi_bcast_block(int j);
  void mpi_bcast_all(void);
  void mpi_gather(void);
#else  // CNTR_USE_MPI==1
  void mpi_send_block(int j,int dest);
  void mpi_gather(int dest);
  void mpi_bcast_block(int j);
  void mpi_bcast_all(void);
#endif  // CNTR_USE_MPI
private:
  T *data_;                  
  int n_;                    
  int blocksize_;            
  int maxlen_;               
  std::vector<int> tid_map_; 
  int tid_;                  
  int ntasks_;               
};

} //namespace cntr
#endif