Epetra_Util.h

Go to the documentation of this file.

/*
//@HEADER
// ************************************************************************
//
//               Epetra: Linear Algebra Services Package
//                 Copyright 2011 Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ************************************************************************
//@HEADER
*/
 
#ifndef EPETRA_UTIL_H
#define EPETRA_UTIL_H
 
#include "Epetra_ConfigDefs.h"
#include "Epetra_Object.h"
#include <vector>
class Epetra_Map;
class Epetra_BlockMap;
class Epetra_CrsMatrix;
class Epetra_MultiVector;
class Epetra_Import;
 
 
class EPETRA_LIB_DLL_EXPORT Epetra_Util {
 
  public:
 
  Epetra_Util();
 
 
 
  Epetra_Util(const Epetra_Util& Util);
 
  virtual ~Epetra_Util();
 
 
 
  unsigned int RandomInt();
 
  double RandomDouble();
 
 
  unsigned int Seed() const;
 
 
  int SetSeed(unsigned int Seed_in);
 
 
 
  template<typename T>
  static void Sort(bool SortAscending, int NumKeys, T * Keys,
       int NumDoubleCompanions,double ** DoubleCompanions,
       int NumIntCompanions, int ** IntCompanions,
       int NumLongLongCompanions, long long ** LongLongCompanions);
 
  static void Sort(bool SortAscending, int NumKeys, int * Keys,
       int NumDoubleCompanions,double ** DoubleCompanions,
       int NumIntCompanions, int ** IntCompanions,
       int NumLongLongCompanions, long long ** LongLongCompanions);
 
  static void Sort(bool SortAscending, int NumKeys, long long * Keys,
       int NumDoubleCompanions,double ** DoubleCompanions,
       int NumIntCompanions, int ** IntCompanions,
       int NumLongLongCompanions, long long ** LongLongCompanions);
 
  static void Sort(bool SortAscending, int NumKeys, int * Keys,
       int NumDoubleCompanions,double ** DoubleCompanions,
       int NumIntCompanions, int ** IntCompanions);
 
  static void Sort(bool SortAscending, int NumKeys, double * Keys,
       int NumDoubleCompanions,double ** DoubleCompanions,
       int NumIntCompanions, int ** IntCompanions,
       int NumLongLongCompanions, long long ** LongLongCompanions);
 
 
  static Epetra_Map Create_Root_Map(const Epetra_Map & usermap,
          int root = 0);
 
 
  static Epetra_Map Create_OneToOne_Map(const Epetra_Map& usermap,
          bool high_rank_proc_owns_shared=false);
 
 
  static Epetra_BlockMap Create_OneToOne_BlockMap(const Epetra_BlockMap& usermap,
              bool high_rank_proc_owns_shared=false);
 
 
 
  // For each row, sort column entries from smallest to largest.
  // Use shell sort. Stable sort so it is fast if indices are already sorted.
  static int SortCrsEntries(int NumRows, const int *CRS_rowptr, int *CRS_colind, double *CRS_vals);
 
  // For each row, sort column entries from smallest to largest.
  // Use shell sort. Stable sort so it is fast if indices are already sorted.
  static int SortCrsEntries(int NumRows, const size_t *CRS_rowptr, int *CRS_colind, double *CRS_vals);
 
  // For each row, sort column entries from smallest to largest, merging column ids that are identical by adding values.
  // Use shell sort. Stable sort so it is fast if indices are already sorted.
  static int SortAndMergeCrsEntries(int NumRows, int *CRS_rowptr, int *CRS_colind, double *CRS_vals);
 
  // For each row, sort column entries from smallest to largest, merging column ids that are identical by adding values.
  // Use shell sort. Stable sort so it is fast if indices are already sorted.
  static int SortAndMergeCrsEntries(int NumRows, size_t *CRS_rowptr, int *CRS_colind, double *CRS_vals);
 
 
#ifndef EPETRA_NO_32BIT_GLOBAL_INDICES
  static int GetPidGidPairs(const Epetra_Import & Importer,std::vector< std::pair<int,int> > & gpids, bool use_minus_one_for_local);
#endif
#ifndef EPETRA_NO_64BIT_GLOBAL_INDICES
  static int GetPidGidPairs(const Epetra_Import & Importer,std::vector< std::pair<int,long long> > & gpids, bool use_minus_one_for_local);
#endif
 
 
 
  static int GetPids(const Epetra_Import & Importer, std::vector<int> &pids, bool use_minus_one_for_local);
 
 
  static int GetRemotePIDs(const Epetra_Import & Importer, std::vector<int> &RemotePIDs);
 
 
  static double Chop(const double & Value);
//  {
//    if (std::abs(Value) < chopVal_) return 0;
//    return Value;
//  };
 
  static const double chopVal_;
 
 private:
  unsigned int Seed_;
};
 
 
// Epetra_Util constructor
inline Epetra_Util::Epetra_Util() : Seed_(std::rand()) {}
// Epetra_Util constructor
inline Epetra_Util::Epetra_Util(const Epetra_Util& Util) : Seed_(Util.Seed_) {}
// Epetra_Util destructor
inline Epetra_Util::~Epetra_Util(){}
 
template<typename T>
int Epetra_Util_binary_search(T item,
                              const T* list,
                              int len,
                              int& insertPoint);
 
EPETRA_LIB_DLL_EXPORT int Epetra_Util_binary_search(int item,
                              const int* list,
                              int len,
                              int& insertPoint);
 
EPETRA_LIB_DLL_EXPORT int Epetra_Util_binary_search(long long item,
                              const long long* list,
                              int len,
                              int& insertPoint);
 
template<typename T>
int Epetra_Util_binary_search_aux(T item,
                              const int* list,
                              const T* aux_list,
                              int len,
                              int& insertPoint);
 
EPETRA_LIB_DLL_EXPORT int Epetra_Util_binary_search_aux(int item,
                              const int* list,
                              const int* aux_list,            
                              int len,
                              int& insertPoint);
 
EPETRA_LIB_DLL_EXPORT int Epetra_Util_binary_search_aux(long long item,
                              const int* list,
                              const long long* aux_list,            
                              int len,
                              int& insertPoint);
 
 
 
 
 
template<class T>
int Epetra_Util_insert_empty_positions(T*& array, int& usedLength,
                                       int& allocatedLength,
                                       int insertOffset, int numPositions,
                                       int allocChunkSize=32)
{
  if (insertOffset < 0 || insertOffset > usedLength ||
      usedLength > allocatedLength) {
    return(-1);
  }
 
  if ((usedLength+numPositions) < allocatedLength) {
    for(int i=usedLength-1; i>=insertOffset; --i) {
      array[i+numPositions] = array[i];
    }
    usedLength += numPositions;
    return(0);
  }
 
  allocatedLength += allocChunkSize;
  //what if allocatedLength is still not large enough?
  //loop until it is large enough:
  while(allocatedLength < usedLength+numPositions) {
    allocatedLength += allocChunkSize;
  }
 
  T* newlist = new T[allocatedLength];
 
  for(int i=0; i<insertOffset; ++i) {
    newlist[i] = array[i];
  }
 
  for(int i=insertOffset; i<usedLength; ++i) {
    newlist[i+numPositions] = array[i];
  }
 
  usedLength += numPositions;
  delete [] array;
  array = newlist;
  return(0);
}
 
template<class T>
int Epetra_Util_insert(T item, int offset, T*& list,
                        int& usedLength,
                        int& allocatedLength,
                        int allocChunkSize=32)
{
  int code = Epetra_Util_insert_empty_positions<T>(list, usedLength,
                                                allocatedLength, offset, 1,
                                                allocChunkSize);
  if (code != 0) {
    return(code);
  }
 
  list[offset] = item;
 
  return(0);
}
 
template<class T>
T* Epetra_Util_data_ptr(std::vector<T> &vec)
{
  if (!vec.empty()) {
    return &vec.front();
  }
  return NULL;
}
 
template<class T>
const T* Epetra_Util_data_ptr(const std::vector<T> &vec)
{
  if (!vec.empty()) {
    return &vec.front();
  }
  return NULL;
}
 
 
int Epetra_Util_ExtractHbData(Epetra_CrsMatrix * A, Epetra_MultiVector * LHS,
            Epetra_MultiVector * RHS,
            int & M, int & N, int & nz, int * & ptr,
            int * & ind, double * & val, int & Nrhs,
            double * & rhs, int & ldrhs,
            double * & lhs, int & ldlhs);
 
 
#endif /* EPETRA_UTIL_H */