/usr/include/trilinos/Ifpack_OverlappingPartitioner.h is in libtrilinos-ifpack-dev 12.4.2-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 | /*@HEADER
// ***********************************************************************
//
// Ifpack: Object-Oriented Algebraic Preconditioner Package
// Copyright (2002) Sandia Corporation
//
// Under 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.
//
// 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 IFPACK_OVERLAPPINGPARTITIONER_H
#define IFPACK_OVERLAPPINGPARTITIONER_H
#include "Ifpack_ConfigDefs.h"
#include "Ifpack_Partitioner.h"
#include "Teuchos_ParameterList.hpp"
class Epetra_Comm;
class Ifpack_Graph;
class Epetra_Map;
class Epetra_BlockMap;
class Epetra_Import;
/* \brief Ifpack_OverlappingPartitioner: A class to create overlapping
partitions of a local graph.
Class Ifpack_OverlappingPartitioner enables the extension of
non-overlapping partitions to an arbitrary value of overlap.
Note that overlap refers to the overlap among \e local parts,
and not the overlap among the processes.
Supported parameters are:
- \c "partitioner: local parts": the required number of parts;
- \c "partitioner: overlap": the required amount of overlap is set in
parameter. Default = 0 (integer).
- \c "partitioner: verbose": if \c true, information are reported on
cout. Nothing is reported otherwise.
This class is a semi-virtual class, that contains the basic utilities
for derived classes Ifpack_LinearPartitioner, Ifpack_GreedyPartitioner,
Ifpack_METISPartitioner, and Ifpack_EquationPartitioner. Graphs in
input to one of these classes are supposed to contain no singletons.
Usually, this means that the graph is derived from an Epetra_RowMatrix,
that has been filtered using Ifpack_SingletonFilter.
\author Marzio Sala, SNL 9214.
\date Last update: Oct-04.
*/
class Ifpack_OverlappingPartitioner : public Ifpack_Partitioner {
public:
//! Constructor.
Ifpack_OverlappingPartitioner(const Ifpack_Graph* Graph);
//! Destructor.
virtual ~Ifpack_OverlappingPartitioner();
//! Returns the number of computed local partitions.
int NumLocalParts() const
{
return(NumLocalParts_);
}
//! Returns the overlapping level.
int OverlappingLevel() const
{
return(OverlappingLevel_);
}
//! Returns the local non-overlapping partition ID of the specified row.
/*! Returns the non-overlapping partition ID of the specified row.
\param
MyRow - (In) local row numbe
\return
Local ID of non-overlapping partition for \t MyRow.
*/
int operator() (int MyRow) const
{
if ((MyRow < 0) || (MyRow > NumMyRows()))
IFPACK_CHK_ERR(-1); // input value not valid
return(Partition_[MyRow]);
}
//! Returns the local overlapping partition ID of the j-th node in partition i.
int operator() (int i, int j) const
{
if ((i < 0) || (i >= NumLocalParts()))
IFPACK_CHK_ERR(-1);
if ((j < 0) || (j > (int)Parts_[i].size()))
IFPACK_CHK_ERR(-2);
return(Parts_[i][j]);
}
//! Returns the number of rows contained in specified partition.
inline int NumRowsInPart(const int Part) const
{
return(Parts_[Part].size());
}
int RowsInPart(const int Part, int* List) const
{
for (int i = 0 ; i < NumRowsInPart(Part) ; ++i)
List[i] = Parts_[Part][i];
return(0);
}
const int* NonOverlappingPartition() const
{
return(&Partition_[0]);
}
//! Sets all the parameters for the partitioner.
/*! The supported parameters are:
* - \c "partitioner: overlap" (int, default = 0).
* - \c "partitioner: local parts" (int, default = 1).
* - \c "partitioner: print level" (int, default = 0).
*/
virtual int SetParameters(Teuchos::ParameterList& List);
//! Sets all the parameters for the partitioner.
/*! This function is used by derived classes to set their own
* parameters. These classes should not derive SetParameters(),
* so that common parameters can be set just once.
*/
virtual int SetPartitionParameters(Teuchos::ParameterList& List) = 0;
//! Computes the partitions. Returns 0 if successful.
virtual int Compute();
//! Computes the partitions. Returns 0 if successful.
virtual int ComputePartitions() = 0;
//! Computes the partitions. Returns 0 if successful.
virtual int ComputeOverlappingPartitions();
//! Returns true if partitions have been computed successfully.
bool IsComputed()
{
return(IsComputed_);
}
//! Prints basic information on iostream. This function is used by operator<<.
virtual std::ostream& Print(std::ostream& os) const;
protected:
//! Returns the number of local rows.
int NumMyRows() const;
//! Returns the number of local nonzero elements.
int NumMyNonzeros() const;
#ifndef EPETRA_NO_32BIT_GLOBAL_INDICES
//! Returns the number of global rows.
int NumGlobalRows() const;
#endif
long long NumGlobalRows64() const;
//! Returns the max number of local entries in a row.
int MaxNumEntries() const;
//! Returns the communicator object of Graph.
const Epetra_Comm& Comm() const;
//! Number of local subgraphs
int NumLocalParts_;
//! Partition_[i] contains the ID of non-overlapping part it belongs to
std::vector<int> Partition_;
//! Parts_[i][j] is the ID of the j-th row contained in the (overlapping)
// partition i
std::vector<std::vector<int> > Parts_;
//! Reference to the graph to be partitioned
const Ifpack_Graph* Graph_;
//! Overlapping level.
int OverlappingLevel_;
//! If \c true, the graph has been successfully partitioned.
bool IsComputed_;
//! If \c true, information are reported on cout.
bool verbose_;
}; // class Ifpack_Partitioner
#endif // IFPACK_OVERLAPPINGPARTITIONER_H
|