00001 /* @HEADER@ */ 00002 // ************************************************************************ 00003 // 00004 // Sundance 00005 // Copyright 2011 Sandia Corporation 00006 // 00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, 00008 // the U.S. Government retains certain rights in this software. 00009 // 00010 // Redistribution and use in source and binary forms, with or without 00011 // modification, are permitted provided that the following conditions are 00012 // met: 00013 // 00014 // 1. Redistributions of source code must retain the above copyright 00015 // notice, this list of conditions and the following disclaimer. 00016 // 00017 // 2. Redistributions in binary form must reproduce the above copyright 00018 // notice, this list of conditions and the following disclaimer in the 00019 // documentation and/or other materials provided with the distribution. 00020 // 00021 // 3. Neither the name of the Corporation nor the names of the 00022 // contributors may be used to endorse or promote products derived from 00023 // this software without specific prior written permission. 00024 // 00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00036 // 00037 // Questions? Contact Kevin Long (kevin.long@ttu.edu) 00038 // 00039 00040 /* @HEADER@ */ 00041 00042 #ifndef SUNDANCE_BASICVERTEXVIEW_H 00043 #define SUNDANCE_BASICVERTEXVIEW_H 00044 00045 #include "SundanceDefs.hpp" 00046 #include "Teuchos_Array.hpp" 00047 00048 namespace Sundance 00049 { 00050 using namespace Teuchos; 00051 00052 /** 00053 * VertexView is a read-only "view" of a cell's vertices, where the 00054 * vertices are stored contiguously in a large master array. By working 00055 * with views, we can greatly reduce the number of temporary arrays 00056 * created during hashtable searches for existing vertex arrays. 00057 */ 00058 class VertexView 00059 { 00060 public: 00061 /** empty ctor, needed for storing VertexViews in Teuchos hashtables */ 00062 VertexView() : base_(0), offset_(0), length_(0) {;} 00063 /** Construct a view into an array 00064 * \param bese pointer to the start of the master data array. By 00065 * using double indirection, the master array can be resized or 00066 * relocated and VertexViews can remain valid. 00067 * \param offset the index of the vertex subarray being viewed. 00068 * \param length the number of vertices included in this view. 00069 */ 00070 VertexView(int** base, int offset, int length) 00071 : base_(base), offset_(offset), length_(length) {;} 00072 00073 /** 00074 * Return a hash code for the vertex set. 00075 */ 00076 int hashCode() const ; 00077 00078 /** 00079 * Test equality between two vertex sets. 00080 * Two vertex sets are equal when their vertices are identical. 00081 */ 00082 bool operator==(const VertexView& other) const ; 00083 00084 /** 00085 * Write to a std::string 00086 */ 00087 std::string toString() const ; 00088 00089 00090 private: 00091 int** base_; 00092 int offset_; 00093 int length_; 00094 }; 00095 00096 /* 00097 * Two vertex sets are equal when their vertices are identical. 00098 * 00099 */ 00100 inline bool VertexView::operator==(const VertexView& other) const 00101 { 00102 /* For efficiency's sake, skip the test for equal lengths because we 00103 * can assume the caller is only comparing equal length vertex views */ 00104 int* p = *base_ + offset_*length_; 00105 int* op = *(other.base_) + other.offset_*length_; 00106 00107 for (int i=0; i<length_; i++) 00108 { 00109 if (p[i] != op[i]) return false; 00110 } 00111 return true; 00112 } 00113 00114 00115 } 00116 00117 namespace Teuchos 00118 { 00119 /** \relates VertexView */ 00120 inline int hashCode(const Sundance::VertexView& v) 00121 {return v.hashCode();} 00122 00123 /** \relates VertexView */ 00124 inline std::string toString(const Sundance::VertexView& v) 00125 {return v.toString();} 00126 } 00127 00128 #endif