hierarchical.H

Go to the documentation of this file.

/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   \\    /   O peration     | Website:  https://openfoam.org
    \\  /    A nd           | Copyright (C) 2011-2024 OpenFOAM Foundation
     \\/     M anipulation  |
-------------------------------------------------------------------------------
License
    This file is part of OpenFOAM.
 
    OpenFOAM is free software: you can redistribute it and/or modify it
    under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.
 
    OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    for more details.
 
    You should have received a copy of the GNU General Public License
    along with OpenFOAM.  If not, see <http://www.gnu.org/licenses/>.
 
Class
    Foam::decompositionMethods::hierarchical
 
Description
    Does hierarchical decomposition of points. Works by first sorting the
    points in x direction into equal sized bins, then in y direction and
    finally in z direction.
 
    Uses single array to hold decomposition which is indexed as if it is a
    3 dimensional array:
 
        finalDecomp[i,j,k] is indexed as
 
        i*n[0]*n[1] + j*n[1] + k
 
    E.g. if we're sorting 'xyz': the first sort (over the x-component)
    determines in which x-domain the point goes. Then for each of the x-domains
    the points are sorted in y direction and each individual x-domain gets
    split into three y-domains. And similar for the z-direction.
 
    Since the domains are of equal size the maximum difference in size is
    n[0]*n[1] (or n[1]*n[2]?) (small anyway)
 
SourceFiles
    hierarchical.C
 
\*---------------------------------------------------------------------------*/
 
#ifndef hierarchical_H
#define hierarchical_H
 
#include "geometric.H"
#include "FixedList.H"
#include "direction.H"
 
namespace Foam
{
namespace decompositionMethods
{
 
/*---------------------------------------------------------------------------*\
                     Class hierarchical Declaration
\*---------------------------------------------------------------------------*/
 
class hierarchical
:
    public geometric
{
    // Private Data
 
        //- Decomposition order in terms of components.
        FixedList<direction, 3> decompOrder_;
 
 
    // Private Member Functions
 
        //- Convert ordering string ("xyz") into list of components.
        void setDecompOrder(const dictionary& methodDict);
 
        //- Evaluates the weighted sizes for each sorted point.
        static void calculateSortedWeightedSizes
        (
            const labelList& current,
            const labelList& indices,
            const scalarField& weights,
            const label globalCurrentSize,
 
            scalarField& sortedWeightedSizes
        );
 
        //- Find index of t in list in between indices left and right
        static label findLower
        (
            const List<scalar>&,
            const scalar t,
            const label left,
            const label right
        );
 
        //- Find midValue (at local index mid) such that the number of
        //  elements between mid and leftIndex are (globally summed) the
        //  wantedSize. Binary search.
        static void findBinary
        (
            const label sizeTol,        // size difference considered acceptable
            const List<scalar>&,
            const label leftIndex,      // index of previous value
            const scalar leftValue,     // value at leftIndex
            const scalar maxValue,      // global max of values
            const scalar wantedSize,    // wanted size
            label& mid,                 // index where size of bin is wantedSize
            scalar& midValue            // value at mid
        );
 
        //- Find midValue (at local index mid) such that the number of
        //  elements between mid and leftIndex are (globally summed) the
        //  wantedSize. Binary search.
        static void findBinary
        (
            const label sizeTol,        // size difference considered acceptable
            const List<scalar>& sortedWeightedSizes,
            const List<scalar>&,
            const label leftIndex,      // index of previous value
            const scalar leftValue,     // value at leftIndex
            const scalar maxValue,      // global max of values
            const scalar wantedSize,    // wanted size
            label& mid,                 // index where size of bin is wantedSize
            scalar& midValue            // value at mid
        );
 
        //- Recursively sort in x,y,z (or rather acc. to decompOrder_)
        void sortComponent
        (
            const label sizeTol,
            const pointField&,
            const labelList& slice,         // slice of points to decompose
            const direction componentIndex, // index in decompOrder_
            const label prevMult,           // multiplication factor
            labelList& finalDecomp          // overall decomposition
        );
 
        //- Recursively sort in x,y,z (or rather acc. to decompOrder_)
        //- Using weighted points.
        void sortComponent
        (
            const label sizeTol,
            const scalarField& weights,
            const pointField&,
            const labelList& slice,         // slice of points to decompose
            const direction componentIndex, // index in decompOrder_
            const label prevMult,           // multiplication factor
            labelList& finalDecomp          // overall decomposition
        );
 
 
public:
 
    //- Runtime type information
    TypeName("hierarchical");
 
 
    // Constructors
 
        //- Construct given the decomposition dictionary
        hierarchical
        (
            const dictionary& decompositionDict,
            const dictionary& methodDict
        );
 
        //- Disallow default bitwise copy construction
        hierarchical(const hierarchical&) = delete;
 
 
    //- Destructor
    virtual ~hierarchical()
    {}
 
 
    // Member Functions
 
        //- Return for every coordinate the wanted processor number.
        virtual labelList decompose
        (
            const pointField&,
            const scalarField& weights
        );
 
        //- Without weights. Code for weighted decomposition is a bit complex
        //  so kept separate for now.
        virtual labelList decompose(const pointField&);
 
 
        //- Return for every coordinate the wanted processor number. Use the
        //  mesh connectivity (if needed)
        virtual labelList decompose
        (
            const polyMesh& mesh,
            const pointField& cellCentres,
            const scalarField& cellWeights
        )
        {
            return decompose(cellCentres, cellWeights);
        }
 
        //- Without weights. Code for weighted decomposition is a bit complex
        //  so kept separate for now.
        virtual labelList decompose
        (
            const polyMesh& mesh,
            const pointField& cellCentres
        )
        {
            return decompose(cellCentres);
        }
 
        //- Return for every coordinate the wanted processor number. Explicitly
        //  provided connectivity - does not use mesh_.
        //  The connectivity is equal to mesh.cellCells() except for
        //  - in parallel the cell numbers are global cell numbers (starting
        //    from 0 at processor0 and then incrementing all through the
        //    processors)
        //  - the connections are across coupled patches
        virtual labelList decompose
        (
            const labelListList& globalCellCells,
            const pointField& cellCentres,
            const scalarField& cellWeights
        )
        {
            return decompose(cellCentres, cellWeights);
        }
 
        virtual labelList decompose
        (
            const labelListList& globalCellCells,
            const pointField& cc
        )
        {
            return decompose(cc);
        }
 
 
    // Member Operators
 
        //- Disallow default bitwise assignment
        void operator=(const hierarchical&) = delete;
};
 
 
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
 
} // End namespace decompositionMethods
} // End namespace Foam
 
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
 
#endif
 
// ************************************************************************* //