This file is indexed.

/usr/include/trilinos/Teuchos_HashUtils.hpp is in libtrilinos-teuchos-dev 12.12.1-5.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
// @HEADER
// ***********************************************************************
//
//                    Teuchos: Common Tools Package
//                 Copyright (2004) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ***********************************************************************
// @HEADER

#ifndef TEUCHOS_HASHUTILS_H
#define TEUCHOS_HASHUTILS_H

/*! \file Teuchos_HashUtils.hpp
    \brief Utilities for generating hashcodes
*/

#include "Teuchos_ConfigDefs.hpp"

namespace Teuchos
{
  using std::string;

  /**
   * \ingroup Containers
   * \brief Utilities for generating hashcodes.
   * This is not a true hash ! For all ints and types less than ints
   * it returns the i/p typecasted as an int. For every type more than the
   * size of int it is only slightly more smarter where it adds the bits
   * into int size chunks and calls that an hash. Used with a capacity
   * limited array this will lead to one of the simplest hashes.
   * Ideally this should be deprecated and not used at all.
   */

  class TEUCHOSCORE_LIB_DLL_EXPORT HashUtils
    {
    public:
      /* Get the next prime in a sequence of hashtable sizes */
      static int nextPrime(int newCapacity);
      static int getHashCode(const unsigned char *a, size_t len);

    private:

      // sequence of primes generated via mathematica:
      // Table[Prime[Round[1.5^x]], {x, 8, 36}]
      static const int primeCount_;
      static const int primes_[];
      /*={101, 163, 271, 443, 733, 1187, 1907, 3061,
        4919, 7759, 12379, 19543, 30841, 48487, 75989,
        119089, 185971, 290347, 452027, 703657, 1093237,
        1695781, 2627993, 4067599, 6290467, 9718019,
        15000607, 23133937, 35650091};*/
    };


  /** \relates HashUtils
      \brief Standard interface for getting the hash code of an object
  */
  template <class T> int hashCode(const T& x);

  /** \relates HashUtils
      \brief Get the hash code of an int
  */
  template <> inline int hashCode(const int& x)
    {
      return x;
    }

  /** \relates HashUtils
      \brief Get the hash code of an unsigned
  */
  template <> inline int hashCode(const unsigned& x)
    {
      return HashUtils::getHashCode(
        reinterpret_cast<const unsigned char *>(&x), sizeof(unsigned));
    }

  /** \relates HashUtils
      \brief Get the hash code of a double
  */
  template <> inline int hashCode(const double& x)
    {
      return HashUtils::getHashCode(
        reinterpret_cast<const unsigned char *>(&x), sizeof(double));
    }

  /** \relates HashUtils
      \brief Get the hash code of a bool
  */
  template <> inline int hashCode(const bool& x)
    {
      return (int) x;
    }

  /** \relates HashUtils
      \brief Get the hash code of a long long
  */
  template <> inline int hashCode(const long long& x)
    {
      return HashUtils::getHashCode(
        reinterpret_cast<const unsigned char *>(&x), sizeof(long long));
    }

  /** \relates HashUtils
      \brief Get the hash code of a long
  */
  template <> inline int hashCode(const long& x)
    {
      return HashUtils::getHashCode(
        reinterpret_cast<const unsigned char *>(&x), sizeof(long));
    }

  /** \relates HashUtils
      \brief Get the hash code of a std::string
  */
  template <> inline int hashCode(const std::string& x)
    {
      /* This specialization could use the HashUtils::getHashCode as well,
       * but they are both true hashes anyway, so leaving it !
       * */
      const char* str = x.c_str();
      int len = x.length();
      int step = len/4 + 1;
      int base = 1;
      int rtn = 0;

      for (int i=0; i<len/2; i+=step)
        {
          rtn += base*(int) str[i];
          base *= 128;
          rtn += base*(int) str[len-i-1];
          base *= 128;
        }

      if (rtn < 0)
      {
          /* Convert the largest -ve int to zero and -1 to
           * std::numeric_limits<int>::max()
           * */
          size_t maxIntBeforeWrap = std::numeric_limits<int>::max();
          maxIntBeforeWrap ++;
          rtn += maxIntBeforeWrap;
      }
      return rtn;
    }

}
#endif // TEUCHOS_HASHUTILS_H