SundanceSubsetManager.hpp
Go to the documentation of this file.
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_SUBSETMANAGER_H
00043 #define SUNDANCE_SUBSETMANAGER_H
00044 
00045 #include "SundanceDefs.hpp"
00046 #include "SundanceMap.hpp"
00047 #include "SundanceSet.hpp"
00048 #include "SundanceCellFilter.hpp"
00049 #include "SundanceCellFilterBase.hpp"
00050 
00051 namespace Sundance
00052 {
00053 /** 
00054  * SubsetManager keeps maps from cell filters to their subsets. This is
00055  * a device to avoid circular references between subset and superset.
00056  */
00057 
00058 class SubsetManager
00059 {
00060 public:
00061   /** */
00062   static void registerSubset(const CellFilter& filter, 
00063     const CellFilter& subset)
00064     {
00065       if (!subsetMap().containsKey(filter))
00066         subsetMap().put(filter, Sundance::Set<CellFilter>());
00067       subsetMap().get(filter).put(subset);
00068     }
00069 
00070   /** */
00071   static void registerDisjoint(const CellFilter& filter, 
00072     const CellFilter& subset)
00073     {
00074       if (!disjointMap().containsKey(filter))
00075         disjointMap().put(filter, Sundance::Set<CellFilter>());
00076       disjointMap().get(filter).put(subset);
00077     }
00078 
00079   /** */
00080   static void registerLabeledSubset(const CellFilter& filter, 
00081     const Set<int>& label, const CellFilter& subset)
00082     {
00083       if (!labeledMap().containsKey(filter))
00084         labeledMap().put(filter, Sundance::Map<Set<int>, CellFilter>());
00085       labeledMap().get(filter).put(label, subset);
00086     }
00087 
00088 
00089   /** */
00090   static const Sundance::Set<CellFilter>& getSubsets(const CellFilter& filter)
00091     {
00092       if (!subsetMap().containsKey(filter))
00093         subsetMap().put(filter, Sundance::Set<CellFilter>());
00094       return subsetMap().get(filter);
00095     }
00096 
00097   /** */
00098   static const Sundance::Set<CellFilter>& getDisjoints(const CellFilter& filter)
00099     {
00100       if (!disjointMap().containsKey(filter))
00101         disjointMap().put(filter, Sundance::Set<CellFilter>());
00102       return disjointMap().get(filter);
00103     }
00104 
00105   /** */
00106   static const Sundance::Map<Set<int>, CellFilter>& 
00107   getLabeledSubsets(const CellFilter& filter)
00108     {
00109       if (!labeledMap().containsKey(filter))
00110         labeledMap().put(filter, Sundance::Map<Set<int>, CellFilter>());
00111       return labeledMap().get(filter);
00112     }
00113 
00114 private:
00115   
00116   /** */
00117   static Sundance::Map<CellFilter, Sundance::Set<CellFilter> >& subsetMap()
00118     {
00119       static Sundance::Map<CellFilter, Sundance::Set<CellFilter> > rtn;
00120       return rtn;
00121     }
00122   
00123   /** */
00124   static Sundance::Map<CellFilter, Sundance::Set<CellFilter> >& disjointMap()
00125     {
00126       static Sundance::Map<CellFilter, Sundance::Set<CellFilter> > rtn;
00127       return rtn;
00128     }
00129   
00130   /** */
00131   static Sundance::Map<CellFilter, Sundance::Map<Set<int>, CellFilter> >& labeledMap()
00132     {
00133       static Sundance::Map<CellFilter, Sundance::Map<Set<int>, CellFilter> > rtn;
00134       return rtn;
00135     }
00136 };
00137 
00138 }
00139 
00140 
00141 
00142 #endif

Site Contact