Nektar++
LocalRegions.hpp
Go to the documentation of this file.
1 ///////////////////////////////////////////////////////////////////////////////
2 //
3 // File LocalRegions.hpp
4 //
5 // For more information, please see: http://www.nektar.info
6 //
7 // The MIT License
8 //
9 // Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),
10 // Department of Aeronautics, Imperial College London (UK), and Scientific
11 // Computing and Imaging Institute, University of Utah (USA).
12 //
13 // License for the specific language governing rights and limitations under
14 // Permission is hereby granted, free of charge, to any person obtaining a
15 // copy of this software and associated documentation files (the "Software"),
16 // to deal in the Software without restriction, including without limitation
17 // the rights to use, copy, modify, merge, publish, distribute, sublicense,
18 // and/or sell copies of the Software, and to permit persons to whom the
19 // Software is furnished to do so, subject to the following conditions:
20 //
21 // The above copyright notice and this permission notice shall be included
22 // in all copies or substantial portions of the Software.
23 //
24 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
25 // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
26 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
27 // THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
28 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
29 // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
30 // DEALINGS IN THE SOFTWARE.
31 //
32 // Description: General header for localregions containing enum and constants
33 //
34 ///////////////////////////////////////////////////////////////////////////////
35 #ifndef LOCALREGIONS_H
36 #define LOCALREGIONS_H
37 
38 #include <string>
39 
40 namespace Nektar
41 {
42  namespace LocalRegions
43  {
44  enum GeomState
45  {
48  };
49 
50  // Defines a "fast find"
51  // Assumes that first/last define the beginning/ending of
52  // a continuous range of classes, and that start is
53  // an iterator between first and last
54 
55  template<class InputIterator, class EqualityComparable>
56  InputIterator find(InputIterator first, InputIterator last,
57  InputIterator startingpoint,
58  const EqualityComparable& value)
59  {
60 
61  InputIterator val;
62 
63  if(startingpoint == first)
64  {
65  val = find(first,last,value);
66  }
67  else
68  {
69  val = find(startingpoint,last,value);
70  if(val == last)
71  {
72  val = find(first,startingpoint,value);
73  if(val == startingpoint)
74  {
75  val = last;
76  }
77  }
78  }
79  return val;
80  }
81 
82  } // end of namespace
83 } // end of namespace
84 
85 #endif //LOCALREGIONS_H
86 
InputIterator find(InputIterator first, InputIterator last, InputIterator startingpoint, const EqualityComparable &value)