SundanceIntHashSet.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_INTHASHSET_H
00043 #define SUNDANCE_INTHASHSET_H
00044 
00045 #include "SundanceDefs.hpp"
00046 #include "SundanceSet.hpp"
00047 #include "Teuchos_Array.hpp"
00048 #include <list>
00049 
00050 
00051 namespace Sundance
00052 {
00053   using namespace Teuchos;
00054 
00055   /** 
00056    *
00057    */
00058   class IntHashSet
00059   {
00060   public:
00061     /** */
00062     IntHashSet();
00063 
00064     /** */
00065     void setCapacity(int capacity);
00066 
00067     /** */
00068     inline void put(int x) 
00069     {
00070       
00071       std::list<int>& d = data_[hashFunc(x)];
00072       for (std::list<int>::const_iterator i=d.begin(); i != d.end(); i++)
00073         {
00074           if (x == *i) return;
00075         }
00076       d.push_back(x);
00077       size_++;
00078     }
00079 
00080     /** */
00081     bool contains(int x) const ;
00082 
00083     /** */
00084     int size() const {return size_;}
00085 
00086     /** */
00087     void fillArray(int* a) const ;
00088 
00089   private:
00090 
00091     inline int hashFunc( const int key ) const { return (seed() ^ key)%capacity_; }
00092 
00093     static unsigned int seed() {static int rtn = (2654435761U); return rtn;}
00094     unsigned int capacity_;
00095     Array<std::list<int> > data_;
00096     int size_;
00097   };
00098 
00099 }
00100 
00101 
00102 #endif

Site Contact