SundanceMap.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_MAP_H
00043 #define SUNDANCE_MAP_H
00044 
00045 #include "SundanceDefs.hpp"
00046 #include <map>
00047 
00048 #ifndef DOXYGEN_DEVELOPER_ONLY
00049 
00050 namespace Sundance
00051 {
00052   using namespace Teuchos;
00053 
00054   /**
00055    * Extension of STL map, adding some nicer put/get/contains syntax 
00056    * and an iostream insertion operator.
00057    */
00058   template<class Key, class Value, class Compare = std::less<Key> >
00059     class Map : public std::map<Key, Value, Compare>
00060     {
00061     public:
00062       /** */
00063       Map() : std::map<Key,Value,Compare>() {;}
00064 
00065       /** Test whether the specified key is present in the map */
00066       inline bool containsKey(const Key& key) const {return this->find(key) != this->end();}
00067 
00068       /** Put a new (key, value) entry in the map */
00069       inline void put(const Key& key, const Value& value)
00070         {this->operator[](key) = value;}
00071 
00072       /** Look up value and return a read-only reference */
00073       inline const Value& get(const Key& key) const
00074         {return (*(this->find)(key)).second;}
00075 
00076       /** Look up value and return a modifiable reference */
00077       inline Value& get(const Key& key) 
00078         {return (*(this->find)(key)).second;}
00079     };
00080 
00081 }
00082 
00083 namespace std
00084 {
00085    /** \relates Sundance::Map 
00086     * Write to a stream
00087     */
00088   template<class Key, class Value, class Compare> inline
00089     std::ostream& operator<<(std::ostream& os, const Sundance::Map<Key, Value, Compare>& m)
00090     {
00091       typename Sundance::Map<Key, Value, Compare>::const_iterator iter;
00092 
00093       os << "Map[";
00094       int k = 0 ;
00095       for (iter=m.begin(); iter != m.end(); iter++, k++)
00096         {
00097           os << "{" << (*iter).first << ", " << (*iter).second << "}";
00098           if (k < (int) m.size()-1) os << ", ";
00099         }
00100       os << "]";
00101       return os;
00102     }
00103 }
00104 
00105 #endif /* DOXYGEN_DEVELOPER_ONLY */
00106 #endif

Site Contact