leastSquaresBase.H

Go to the documentation of this file.

/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   \\    /   O peration     |
    \\  /    A nd           | www.openfoam.com
     \\/     M anipulation  |
-------------------------------------------------------------------------------
    Copyright (C) 2011-2016 OpenFOAM Foundation
    Copyright (C) 2019 OpenCFD Ltd.
    Copyright (C) 2016-2019 ISP RAS (www.ispras.ru) UniCFD Group (www.unicfd.ru)
-------------------------------------------------------------------------------
License
    This file is part of QGDsolver library, based on 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/>.
Group 
    grpleastSquares
Class
    Foam::fvsc::leastSquares::leastSquaresBase
Description 
    Base methods for calculating weights and finding neighbours
Source file
    leastSquaresBase.C 
\*---------------------------------------------------------------------------*/

#ifndef leastSquaresBase_H
#define leastSquaresBase_H

#include "volFields.H"
#include "surfaceFields.H"
#include "surfaceMesh.H"

#include "fvCFD.H"

namespace Foam
{

namespace fvsc
{

class leastSquaresBase
{

private:

        const fvMesh& cMesh_;

protected:

        template <class T>
        using List2 = List<List<T> >;

        template <class T>
        using List3 = List2<List<T> >;
    
        template <class T>
        using labelHashTable = HashTable<T,label,Hash<label>>;
        
        typedef
        HashSet<label,Hash<label>> labelHashSet;
    
        template <class T>
        using Triple = FixedList<T,3>;

protected:

        //Data for internal field
        
        // List of neighbour cells for each face
        labelListList neighbourCells_;
        
        // Weights
        List2<vector> GdfAll_;
        List2<scalar> wf2All_;
        
        // List of faces with degenerate stencil
        DynamicList<label> internalDegFaces_;
        
        //Data for patches
        /* For faces connecting 2 processors  */
        List<label> procPairs_; // if >= 0, connects processor through patch
        List<label> neigProcs_; // No of neighbouring processor
        labelHashTable<label> idProcPatchPairs_; //hash for processors, connected through the patch
        label nProcPatches_;
        
        /* Least square method weights at processor patches */
        List3<vector> procGdf_;
        List3<scalar> procWf2_;
        
        /* Addressing information */
        List3<label> myProcPatchCells_;
        List2<label> ownEnd_;
        List2<label> neiStart_;
        List2<label> neiEnd_;
        List2<label> corStart_;
        List2<label> corEnd_;
        
        /* Global information about domain decomposition */
        //labelHashTable <List<label> > pointProcs_; //list of processors containing point (global id)
        labelHashTable <List<label> > pointCells_; //list of cells containing cell (global id)
        labelHashTable <label> cellProc_;
        
        /* Addressing information for corner neighbouring processors */
        List2<Triple<label> > corAddr_;
        List2<label> corCellIds_;
        labelHashTable<label> corProcIds_;
        
        List<DynamicList<label> > procDegFaces_;

protected:

        void findNeighbours();

        void calculateWeights();

public:

    leastSquaresBase(const fvMesh& mesh);
    
    ~leastSquaresBase();

};

}

}

#endif

//
//END-OF-FILE
//