LocalRegions.hpp

Go to the documentation of this file.

///////////////////////////////////////////////////////////////////////////////
//
// File: LocalRegions.hpp
//
// For more information, please see: http://www.nektar.info
//
// The MIT License
//
// Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),
// Department of Aeronautics, Imperial College London (UK), and Scientific
// Computing and Imaging Institute, University of Utah (USA).
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the "Software"),
// to deal in the Software without restriction, including without limitation
// the rights to use, copy, modify, merge, publish, distribute, sublicense,
// and/or sell copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
// DEALINGS IN THE SOFTWARE.
//
// Description: General header for localregions containing enum and constants
//
///////////////////////////////////////////////////////////////////////////////
#ifndef LOCALREGIONS_H
#define LOCALREGIONS_H
 
#include <string>
 
namespace Nektar
{
namespace LocalRegions
{
enum GeomState
{
    eNotFilled,
    ePtsFilled,
};
 
// Defines a "fast find"
// Assumes that first/last define the beginning/ending of
// a continuous range of classes, and that start is
// an iterator between first and last
 
template <class InputIterator, class EqualityComparable>
InputIterator find(InputIterator first, InputIterator last,
                   InputIterator startingpoint, const EqualityComparable &value)
{
 
    InputIterator val;
 
    if (startingpoint == first)
    {
        val = find(first, last, value);
    }
    else
    {
        val = find(startingpoint, last, value);
        if (val == last)
        {
            val = find(first, startingpoint, value);
            if (val == startingpoint)
            {
                val = last;
            }
        }
    }
    return val;
}
 
enum IndexMapType
{
    eEdgeToElement,
    eFaceToElement,
    eEdgeInterior,
    eFaceInterior,
    eBoundary,
    eVertex
};
 
const char *const IndexMapTypeMap[] = {"EdgeToElement", "FaceToElement",
                                       "EdgeInterior",  "FaceInterior",
                                       "Boundary",      "Vertex"};
 
} // namespace LocalRegions
} // namespace Nektar
 
#endif // LOCALREGIONS_H