Chaste  Release::2017.1
ObsoleteBoxCollection.hpp
1 /*
2 
3 Copyright (c) 2005-2017, University of Oxford.
4 All rights reserved.
5 
6 University of Oxford means the Chancellor, Masters and Scholars of the
7 University of Oxford, having an administrative office at Wellington
8 Square, Oxford OX1 2JD, UK.
9 
10 This file is part of Chaste.
11 
12 Redistribution and use in source and binary forms, with or without
13 modification, are permitted provided that the following conditions are met:
14  * Redistributions of source code must retain the above copyright notice,
15  this list of conditions and the following disclaimer.
16  * Redistributions in binary form must reproduce the above copyright notice,
17  this list of conditions and the following disclaimer in the documentation
18  and/or other materials provided with the distribution.
19  * Neither the name of the University of Oxford nor the names of its
20  contributors may be used to endorse or promote products derived from this
21  software without specific prior written permission.
22 
23 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
24 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
27 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
28 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
29 GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
32 OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 
34 */
35 #ifndef OBSOLETEBOXCOLLECTION_HPP_
36 #define OBSOLETEBOXCOLLECTION_HPP_
37 
38 #include "Node.hpp"
39 #include "Element.hpp"
40 #include "Box.hpp"
41 #include <map>
42 #include <vector>
43 
44 
51 template<unsigned DIM>
53 {
54 private:
55  friend class TestObsoleteBoxCollection;
56 
58  std::vector< Box<DIM> > mBoxes;
59 
61  c_vector<double, 2*DIM> mDomainSize;
62 
64  double mBoxWidth;
65 
67  c_vector<unsigned, DIM> mNumBoxesEachDirection;
68 
70  std::vector< std::set<unsigned> > mLocalBoxes;
71 
73  c_vector<bool, DIM> mIsDomainPeriodic;
74 
76  static const double msFudge;
77 
82  unsigned GetLinearIndex(c_vector<int, DIM> gridIndices);
83 
88  c_vector<unsigned, DIM> GetGridIndices(unsigned linearIndex);
89 
94  bool IsBoxInDomain(c_vector<unsigned, DIM> gridIndices);
95 
104  c_vector<bool,DIM> IsIndexPenultimate(c_vector<unsigned, DIM> gridIndices);
105 
115  void SetupLocalBoxes(const std::vector<c_vector<int, DIM> >& rNeighbours);
116 
117 public:
118 
128  ObsoleteBoxCollection(double boxWidth,
129  c_vector<double, 2*DIM> domainSize,
130  bool isPeriodicInX = false,
131  bool isPeriodicInY = false,
132  bool isPeriodicInZ = false);
133 
137  void EmptyBoxes();
138 
143  unsigned CalculateContainingBox(Node<DIM>* pNode);
144 
149  unsigned CalculateContainingBox(c_vector<double, DIM>& rLocation);
150 
155  Box<DIM>& rGetBox(unsigned boxIndex);
156 
160  unsigned GetNumBoxes();
161 
168 
173  void SetupAllLocalBoxes();
174 
181  std::set<unsigned>& rGetLocalBoxes(unsigned boxIndex);
182 
188  const c_vector<double, 2*DIM>& rGetDomainSize() const;
189 
199  void CalculateNodePairs(std::vector<Node<DIM>*>& rNodes,
200  std::vector<std::pair<Node<DIM>*, Node<DIM>*> >& rNodePairs);
201 
211  bool IsOwned(Node<DIM>* pNode)
212  {
213  return true;
214  }
215 
224  bool IsBoxOwned(unsigned globalIndex)
225  {
226  return true;
227  }
228 };
229 
230 #endif /*OBSOLETEBOXCOLLECTION_HPP_*/
bool IsBoxOwned(unsigned globalIndex)
Definition: Node.hpp:58
std::set< unsigned > & rGetLocalBoxes(unsigned boxIndex)
c_vector< double, 2 *DIM > mDomainSize
std::vector< Box< DIM > > mBoxes
static const double msFudge
c_vector< bool, DIM > mIsDomainPeriodic
bool IsOwned(Node< DIM > *pNode)
ObsoleteBoxCollection(double boxWidth, c_vector< double, 2 *DIM > domainSize, bool isPeriodicInX=false, bool isPeriodicInY=false, bool isPeriodicInZ=false)
bool IsBoxInDomain(c_vector< unsigned, DIM > gridIndices)
unsigned CalculateContainingBox(Node< DIM > *pNode)
c_vector< bool, DIM > IsIndexPenultimate(c_vector< unsigned, DIM > gridIndices)
std::vector< std::set< unsigned > > mLocalBoxes
Definition: Box.hpp:50
void CalculateNodePairs(std::vector< Node< DIM > * > &rNodes, std::vector< std::pair< Node< DIM > *, Node< DIM > * > > &rNodePairs)
c_vector< unsigned, DIM > GetGridIndices(unsigned linearIndex)
Box< DIM > & rGetBox(unsigned boxIndex)
unsigned GetLinearIndex(c_vector< int, DIM > gridIndices)
const c_vector< double, 2 *DIM > & rGetDomainSize() const
void SetupLocalBoxes(const std::vector< c_vector< int, DIM > > &rNeighbours)
c_vector< unsigned, DIM > mNumBoxesEachDirection