fei_SparseRowGraph.hpp

Go to the documentation of this file.

/*--------------------------------------------------------------------*/
/*    Copyright 2005 Sandia Corporation.                              */
/*    Under the terms of Contract DE-AC04-94AL85000, there is a       */
/*    non-exclusive license for use of this work by or on behalf      */
/*    of the U.S. Government.  Export of this program may require     */
/*    a license from the United States Government.                    */
/*--------------------------------------------------------------------*/

#ifndef _fei_SparseRowGraph_hpp_
#define _fei_SparseRowGraph_hpp_

#include <fei_macros.hpp>
#include <vector>
#include <algorithm>

namespace fei {
  class SparseRowGraph {
  public:
    SparseRowGraph()
      : rowNumbers(), rowOffsets(), packedColumnIndices(), blockEntries(false)
      {}

    SparseRowGraph(const SparseRowGraph& src)
      : rowNumbers(src.rowNumbers), rowOffsets(src.rowOffsets),
      packedColumnIndices(src.packedColumnIndices), blockEntries(src.blockEntries)
      {}

    virtual ~SparseRowGraph() {}

    bool operator==(const fei::SparseRowGraph& othergraph) const;

    bool operator!=(const fei::SparseRowGraph& othergraph) const;

    std::vector<int> rowNumbers;

    std::vector<int> rowOffsets;

    std::vector<int> packedColumnIndices;

    bool blockEntries;
  };//class SparseRowGraph

inline bool SparseRowGraph::operator==(const fei::SparseRowGraph& othergraph) const
{
  if (rowNumbers != othergraph.rowNumbers) return(false);
  if (rowOffsets != othergraph.rowOffsets) return(false);
  if (packedColumnIndices != othergraph.packedColumnIndices) return(false);
  return(true);
}

inline bool SparseRowGraph::operator!=(const fei::SparseRowGraph& othergraph) const
{
  return( !(*this == othergraph) );
}

inline
int find_row_start(int row, const SparseRowGraph& srg)
{
  std::vector<int>::const_iterator rowNumbers_iter =
    std::lower_bound(srg.rowNumbers.begin(), srg.rowNumbers.end(), row);
  if (rowNumbers_iter == srg.rowNumbers.end() || *rowNumbers_iter != row) {
    return -1;
  }

  size_t offset = rowNumbers_iter - srg.rowNumbers.begin();
  return srg.rowOffsets[offset];
}

}//namespace fei

#endif