Teuchos_HashUtils.cpp

00001 // @HEADER
00002 // ***********************************************************************
00003 // 
00004 //                    Teuchos: Common Tools Package
00005 //                 Copyright (2004) Sandia Corporation
00006 // 
00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
00008 // license for use of this work by or on behalf of the U.S. Government.
00009 // 
00010 // This library is free software; you can redistribute it and/or modify
00011 // it under the terms of the GNU Lesser General Public License as
00012 // published by the Free Software Foundation; either version 2.1 of the
00013 // License, or (at your option) any later version.
00014 //  
00015 // This library is distributed in the hope that it will be useful, but
00016 // WITHOUT ANY WARRANTY; without even the implied warranty of
00017 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00018 // Lesser General Public License for more details.
00019 //  
00020 // You should have received a copy of the GNU Lesser General Public
00021 // License along with this library; if not, write to the Free Software
00022 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
00023 // USA
00024 // Questions? Contact Michael A. Heroux (maherou@sandia.gov) 
00025 // 
00026 // ***********************************************************************
00027 // @HEADER
00028 
00029 #include "Teuchos_HashUtils.hpp"
00030 #include "Teuchos_TestForException.hpp"
00031 
00032 using namespace Teuchos;
00033 
00034 
00035 const int HashUtils::primeCount_ = 33;
00036 const int HashUtils::primes_[] 
00037 = {11, 19, 37, 59, 101, 163, 271, 443, 733, 1187, 1907, 3061, 
00038    4919, 7759, 12379, 19543, 30841, 48487, 75989, 
00039    119089, 185971, 290347, 452027, 703657, 1093237,
00040    1695781, 2627993, 4067599, 6290467, 9718019, 
00041    15000607, 23133937, 35650091};
00042 
00043 
00044 int HashUtils::nextPrime(int newCapacity) 
00045 {
00046   TEST_FOR_EXCEPTION(newCapacity > primes_[primeCount_-1],
00047                      length_error,
00048                      "HashUtils::nextPrime() overflow");
00049 
00050   for (int i=0; i<primeCount_; i++)
00051     {
00052       if (newCapacity <= primes_[i])
00053         {
00054           return primes_[i];
00055         }
00056     }
00057 
00058   TEST_FOR_EXCEPTION(true,
00059                      logic_error,
00060                      "unexpected case in HashUtils::nextPrime()");
00061   return 0;
00062 }

Generated on Thu Sep 18 12:30:29 2008 for Teuchos - Trilinos Tools Package by doxygen 1.3.9.1