Chaste Release::3.1
|
00001 /* 00002 00003 Copyright (c) 2005-2012, University of Oxford. 00004 All rights reserved. 00005 00006 University of Oxford means the Chancellor, Masters and Scholars of the 00007 University of Oxford, having an administrative office at Wellington 00008 Square, Oxford OX1 2JD, UK. 00009 00010 This file is part of Chaste. 00011 00012 Redistribution and use in source and binary forms, with or without 00013 modification, are permitted provided that the following conditions are met: 00014 * Redistributions of source code must retain the above copyright notice, 00015 this list of conditions and the following disclaimer. 00016 * Redistributions in binary form must reproduce the above copyright notice, 00017 this list of conditions and the following disclaimer in the documentation 00018 and/or other materials provided with the distribution. 00019 * Neither the name of the University of Oxford nor the names of its 00020 contributors may be used to endorse or promote products derived from this 00021 software without specific prior written permission. 00022 00023 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00024 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00025 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00026 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE 00027 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 00028 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE 00029 GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00030 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00031 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 00032 OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00033 00034 */ 00035 #ifndef BOXCOLLECTION_HPP_ 00036 #define BOXCOLLECTION_HPP_ 00037 00038 #include "Node.hpp" 00039 #include "Element.hpp" 00040 #include <map> 00041 00042 00047 template<unsigned DIM> 00048 class Box 00049 { 00050 private: 00051 00053 c_vector<double, 2*DIM> mMinAndMaxValues; 00054 00056 std::set< Node<DIM>* > mNodesContained; 00057 00059 std::set< Element<DIM,DIM>* > mElementsContained; 00060 00061 public: 00062 00068 Box(c_vector<double, 2*DIM>& rMinAndMaxValues); 00069 00071 c_vector<double, 2*DIM>& rGetMinAndMaxValues(); 00072 00077 void AddNode(Node<DIM>* pNode); 00078 00083 void RemoveNode(Node<DIM>* pNode); 00084 00089 void AddElement(Element<DIM,DIM>* pElement); 00090 00092 std::set< Node<DIM>* >& rGetNodesContained(); 00093 00095 std::set< Element<DIM,DIM>* >& rGetElementsContained(); 00096 }; 00097 00098 00103 template<unsigned DIM> 00104 class BoxCollection 00105 { 00106 private: 00107 friend class TestBoxCollection; 00108 00110 std::vector< Box<DIM> > mBoxes; 00111 00113 c_vector<double, 2*DIM> mDomainSize; 00114 00116 double mBoxWidth; 00117 00119 c_vector<unsigned, DIM> mNumBoxesEachDirection; 00120 00122 std::vector< std::set<unsigned> > mLocalBoxes; 00123 00125 const static double mFudge = 5e-14; 00126 00127 public: 00128 00135 BoxCollection(double boxWidth, c_vector<double, 2*DIM> domainSize); 00136 00141 unsigned CalculateContainingBox(Node<DIM>* pNode); 00142 00147 unsigned CalculateContainingBox(c_vector<double, DIM>& rLocation); 00148 00153 Box<DIM>& rGetBox(unsigned boxIndex); 00154 00156 unsigned GetNumBoxes(); 00157 00162 void SetupLocalBoxesHalfOnly(); 00163 00165 void SetupAllLocalBoxes(); 00166 00171 std::set<unsigned> GetLocalBoxes(unsigned boxIndex); 00172 00183 void CalculateNodePairs(std::vector<Node<DIM>*>& rNodes, std::set<std::pair<Node<DIM>*, Node<DIM>*> >& rNodePairs, std::map<unsigned, std::set<unsigned> >& rNodeNeighbours); 00184 }; 00185 00186 00187 #endif /*BOXCOLLECTION_HPP_*/