![]() |
|
|||
File indexing completed on 2025-02-23 09:22:01
0001 // 0002 // ******************************************************************** 0003 // * License and Disclaimer * 0004 // * * 0005 // * The Geant4 software is copyright of the Copyright Holders of * 0006 // * the Geant4 Collaboration. It is provided under the terms and * 0007 // * conditions of the Geant4 Software License, included in the file * 0008 // * LICENSE and available at http://cern.ch/geant4/license . These * 0009 // * include a list of copyright holders. * 0010 // * * 0011 // * Neither the authors of this software system, nor their employing * 0012 // * institutes,nor the agencies providing financial support for this * 0013 // * work make any representation or warranty, express or implied, * 0014 // * regarding this software system or assume any liability for its * 0015 // * use. Please see the license in the file LICENSE and URL above * 0016 // * for the full disclaimer and the limitation of liability. * 0017 // * * 0018 // * This code implementation is the result of the scientific and * 0019 // * technical work of the GEANT4 collaboration. * 0020 // * By using, copying, modifying or distributing the software (or * 0021 // * any work based on the software) you agree to acknowledge its * 0022 // * use in resulting scientific publications, and indicate your * 0023 // * acceptance of all terms of the Geant4 Software license. * 0024 // ******************************************************************** 0025 // 0026 // 0027 // G4Hashing.cc 0028 // Geant4 0029 // 0030 // Created by Mathieu Karamitros 0031 // 0032 // 0033 0034 #include "DNAHashing.hh" 0035 0036 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo...... 0037 0038 namespace G4::hashing 0039 { 0040 namespace crc32 0041 { 0042 uint32_t Hash(const char* str, size_t len) 0043 { 0044 uint32_t remainder = 0xFFFFFFFF; 0045 for (size_t idx = 0; idx < len; ++idx) { 0046 remainder = (remainder >> 8) ^ fCrc_table[(remainder ^ str[idx]) & 0x000000FF]; 0047 } 0048 return remainder ^ 0xFFFFFFFF; 0049 } 0050 0051 uint32_t Hash(const std::string& str) 0052 { 0053 return Hash(str.c_str(), str.size()); 0054 } 0055 } // namespace crc32 0056 0057 namespace fnv 0058 { 0059 size_t Hash(const std::string& str) 0060 { 0061 size_t hash = fnv_offset_basis; 0062 for (size_t i = 0; i < str.length(); i++) { 0063 hash = hash ^ (str[i]); // xor the low 8 bits 0064 hash = hash * fnv_prime; // multiply by the magic number 0065 } 0066 return hash; 0067 } 0068 } // namespace fnv 0069 0070 namespace larson 0071 { 0072 size_t Hash(const char* str, unsigned int seed) 0073 { 0074 size_t hash = seed; 0075 while (*str != 0) { 0076 hash = hash * 101 + *str++; 0077 } 0078 return hash; 0079 } 0080 0081 size_t Hash(std::string str, unsigned int seed) 0082 { 0083 return Hash(str.c_str(), seed); 0084 } 0085 } // namespace larson 0086 } // namespace G4::hashing 0087 0088 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
[ Source navigation ] | [ Diff markup ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.3.7 LXR engine. The LXR team |
![]() ![]() |