nt_slab.hpp

Go to the documentation of this file.

//                                                         //
// Copyright (c) 2003-2013 by The University of Queensland //
// Earth Systems Science Computational Centre (ESSCC)      //
// http://www.uq.edu.au/esscc                              //
//                                                         //
// Primary Business: Brisbane, Queensland, Australia       //
// Licensed under the Open Software License version 3.0    //
// http://www.opensource.org/licenses/osl-3.0.php          //
//                                                         //

template<typename T>
NTSlab<T>::NTSlab():m_sl(0,0,0,0,0)
{
  m_table=NULL;
}

template<typename T>
NTSlab<T>::NTSlab(NeighborTable<T>* t,DSlice s):m_table(t),m_sl(s)
{
}
  
template<typename T>
unsigned int NTSlab<T>::size()const
{
  unsigned int np=0;

  for(unsigned int i=0;i<m_sl.size();i++){
    np+=m_table->nparts_at_gridpoint(m_sl[i]);
  }

  return np;
}

template<typename T>
typename NTSlab<T>::iterator NTSlab<T>::begin()
{
  // find the first occupied site in the search array
  unsigned int i=0;
  while(
    (i<m_sl.size())
    &&
    (m_table->nparts_at_gridpoint(m_sl[i]) == 0)
  ){
    i++;
  }
  return 
    typename NTSlab<T>::iterator(
      this,
      typename NeighborTable<T>::indextype(i,0)
    );
}

template<typename T>
typename NTSlab<T>::iterator NTSlab<T>::end()
{
  return 
    typename NTSlab<T>::iterator(
      this,
      typename NeighborTable<T>::indextype(m_sl.size(),0)
    );
}

template<typename T>
typename NTSlab<T>::iterator NTSlab<T>::rbegin()
{
  int j;

  // find the last occupied site in the search array
  int i=m_sl.size()-1;
  while((i>-1)&&
        nparts_at_gridpoint(i)==0){
    i--;
  }
  j=nparts_at_gridpoint(i)-1;
  if(i==-1) j=0; // rend

  return
    typename NTSlab<T>::iterator(
      this,
      typename NeighborTable<T>::indextype(i,j)
    ); 
}

template<typename T>
typename NTSlab<T>::iterator NTSlab<T>::rend()
{
  return
    typename NTSlab<T>::iterator(
      this,
      typename NeighborTable<T>::indextype(-1,0)
    );
}

template<typename T>
T* NTSlab<T>::ptr(typename NeighborTable<T>::indextype idx)
{
  typename NeighborTable<T>::indextype a_idx;
  a_idx.first=m_sl[idx.first];
  a_idx.second=idx.second;

  return m_table->ptr(a_idx); 
}

template<typename T>
T& NTSlab<T>::ref(typename NeighborTable<T>::indextype idx)
{ 
  typename NeighborTable<T>::indextype a_idx;
  a_idx.first=m_sl[idx.first];
  a_idx.second=idx.second;

  return m_table->ref(a_idx); 
}


template<typename T>
void NTSlab<T>::insert(typename NTSlab<T>::iterator,const T& data)
{
  m_table->insert(data);
}


template<typename T>
void NTSlab<T>::erase(typename NTSlab<T>::iterator pos)
{
  // check if iter points into this slab ?
  // erase item 
  typename NeighborTable<T>::indextype a_idx;
  a_idx.first=m_sl[pos.index().first];
  a_idx.second=pos.index().second;
  m_table->erase(a_idx);
}

template<typename T>
void NTSlab<T>::erase(typename NTSlab<T>::iterator begin,typename NTSlab<T>::iterator end)
{
  // do it backwards, because erase invalidates all iterators behind
  begin--;
  end--;
  
  for(typename NTSlab<T>::iterator iter=end; 
      iter!=begin;
      iter--){
    
    erase(iter);
  }
}

template <typename T>
bool operator== (const NTSlab<T>& s1,const NTSlab<T>& s2)
{
  return(s1.m_table==s2.m_table && s1.m_sl==s2.m_sl);
}

template <typename T>
bool operator!= (const NTSlab<T>& s1,const NTSlab<T>& s2)
{
  return (s1.m_table!=s2.m_table || s1.m_sl!=s2.m_sl);
}

template<typename T>
ostream& operator<< (ostream& ost,const NTSlab<T>& NTS)
{
  ost << "---NTSlab---" << endl;
  ost << "indices:" << endl;
  for(unsigned int i=0;i<NTS.slab_size();i++){
    ost << NTS.m_sl[i] << " ";
  }
  ost << endl;

  return ost;
}