|
Zoltan2
|
00001 // @HEADER 00002 // 00003 // *********************************************************************** 00004 // 00005 // Zoltan2: A package of combinatorial algorithms for scientific computing 00006 // Copyright 2012 Sandia Corporation 00007 // 00008 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, 00009 // the U.S. Government retains certain rights in this software. 00010 // 00011 // Redistribution and use in source and binary forms, with or without 00012 // modification, are permitted provided that the following conditions are 00013 // met: 00014 // 00015 // 1. Redistributions of source code must retain the above copyright 00016 // notice, this list of conditions and the following disclaimer. 00017 // 00018 // 2. Redistributions in binary form must reproduce the above copyright 00019 // notice, this list of conditions and the following disclaimer in the 00020 // documentation and/or other materials provided with the distribution. 00021 // 00022 // 3. Neither the name of the Corporation nor the names of the 00023 // contributors may be used to endorse or promote products derived from 00024 // this software without specific prior written permission. 00025 // 00026 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00027 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00028 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00029 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00030 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00031 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00032 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00033 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00034 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00035 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00036 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00037 // 00038 // Questions? Contact Karen Devine (kddevin@sandia.gov) 00039 // Erik Boman (egboman@sandia.gov) 00040 // Siva Rajamanickam (srajama@sandia.gov) 00041 // 00042 // *********************************************************************** 00043 // 00044 // @HEADER 00045 00050 #include <Zoltan2_Standards.hpp> 00051 #include <Zoltan2_AlltoAll.hpp> 00052 #include <Zoltan2_IdentifierTraits.hpp> 00053 00054 #include <Teuchos_SerializationTraits.hpp> 00055 #include <Teuchos_HashUtils.hpp> 00056 #include <Teuchos_ReductionOp.hpp> 00057 00058 #include <utility> 00059 #include <iostream> 00060 #include <sstream> 00061 #include <string> 00062 #include <limits> 00063 #include <cstdlib> 00064 00065 00066 namespace Zoltan2 00067 { 00068 00073 int getHashCode(const unsigned char *a, size_t len) 00074 { 00075 int total=0; 00076 unsigned char *to = reinterpret_cast<unsigned char *>(&total); 00077 int c=0; 00078 for (size_t i=0; i < len; i++){ 00079 to[c++] += a[i]; 00080 if (c == sizeof(int)) 00081 c = 0; 00082 } 00083 if (total < 0) 00084 { 00085 /* Convert the largest -ve int to zero and -1 to 00086 * std::numeric_limits<int>::max() 00087 * */ 00088 size_t maxIntBeforeWrap = std::numeric_limits<int>::max(); 00089 maxIntBeforeWrap ++; 00090 total += maxIntBeforeWrap; 00091 } 00092 return total; 00093 } 00094 00095 } // namespace Z2 00096
1.7.6.1