<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> <title>libstdc++: hash_fun.h Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <link href="navtree.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="jquery.js"></script> <script type="text/javascript" src="navtree.js"></script> <script type="text/javascript" src="resize.js"></script> <script type="text/javascript"> $(document).ready(initResizable); </script> <link href="doxygen.css" rel="stylesheet" type="text/css"/> </head> <body> <!-- Generated by Doxygen 1.7.4 --> <div id="top"> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td style="padding-left: 0.5em;"> <div id="projectname">libstdc++</div> </td> </tr> </tbody> </table> </div> </div> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> <div id="nav-tree-contents"> </div> </div> <div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle"> </div> </div> <script type="text/javascript"> initNavTree('a00898.html',''); </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">hash_fun.h</div> </div> </div> <div class="contents"> <a href="a00898.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// 'struct hash' from SGI -*- C++ -*-</span> <a name="l00002"></a>00002 <a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2009, 2010</span> <a name="l00004"></a>00004 <span class="comment">// Free Software Foundation, Inc.</span> <a name="l00005"></a>00005 <span class="comment">//</span> <a name="l00006"></a>00006 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span> <a name="l00007"></a>00007 <span class="comment">// software; you can redistribute it and/or modify it under the</span> <a name="l00008"></a>00008 <span class="comment">// terms of the GNU General Public License as published by the</span> <a name="l00009"></a>00009 <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span> <a name="l00010"></a>00010 <span class="comment">// any later version.</span> <a name="l00011"></a>00011 <a name="l00012"></a>00012 <span class="comment">// This library is distributed in the hope that it will be useful,</span> <a name="l00013"></a>00013 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span> <a name="l00014"></a>00014 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span> <a name="l00015"></a>00015 <span class="comment">// GNU General Public License for more details.</span> <a name="l00016"></a>00016 <a name="l00017"></a>00017 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span> <a name="l00018"></a>00018 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span> <a name="l00019"></a>00019 <span class="comment">// 3.1, as published by the Free Software Foundation.</span> <a name="l00020"></a>00020 <a name="l00021"></a>00021 <span class="comment">// You should have received a copy of the GNU General Public License and</span> <a name="l00022"></a>00022 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span> <a name="l00023"></a>00023 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span> <a name="l00024"></a>00024 <span class="comment">// <http://www.gnu.org/licenses/>.</span> <a name="l00025"></a>00025 <a name="l00026"></a>00026 <span class="comment">/*</span> <a name="l00027"></a>00027 <span class="comment"> * Copyright (c) 1996-1998</span> <a name="l00028"></a>00028 <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span> <a name="l00029"></a>00029 <span class="comment"> *</span> <a name="l00030"></a>00030 <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span> <a name="l00031"></a>00031 <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span> <a name="l00032"></a>00032 <span class="comment"> * provided that the above copyright notice appear in all copies and</span> <a name="l00033"></a>00033 <span class="comment"> * that both that copyright notice and this permission notice appear</span> <a name="l00034"></a>00034 <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span> <a name="l00035"></a>00035 <span class="comment"> * representations about the suitability of this software for any</span> <a name="l00036"></a>00036 <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span> <a name="l00037"></a>00037 <span class="comment"> *</span> <a name="l00038"></a>00038 <span class="comment"> *</span> <a name="l00039"></a>00039 <span class="comment"> * Copyright (c) 1994</span> <a name="l00040"></a>00040 <span class="comment"> * Hewlett-Packard Company</span> <a name="l00041"></a>00041 <span class="comment"> *</span> <a name="l00042"></a>00042 <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span> <a name="l00043"></a>00043 <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span> <a name="l00044"></a>00044 <span class="comment"> * provided that the above copyright notice appear in all copies and</span> <a name="l00045"></a>00045 <span class="comment"> * that both that copyright notice and this permission notice appear</span> <a name="l00046"></a>00046 <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span> <a name="l00047"></a>00047 <span class="comment"> * representations about the suitability of this software for any</span> <a name="l00048"></a>00048 <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span> <a name="l00049"></a>00049 <span class="comment"> *</span> <a name="l00050"></a>00050 <span class="comment"> */</span> <a name="l00051"></a>00051 <span class="comment"></span> <a name="l00052"></a>00052 <span class="comment">/** @file backward/hash_fun.h</span> <a name="l00053"></a>00053 <span class="comment"> * This file is a GNU extension to the Standard C++ Library (possibly</span> <a name="l00054"></a>00054 <span class="comment"> * containing extensions from the HP/SGI STL subset).</span> <a name="l00055"></a>00055 <span class="comment"> */</span> <a name="l00056"></a>00056 <a name="l00057"></a>00057 <span class="preprocessor">#ifndef _BACKWARD_HASH_FUN_H</span> <a name="l00058"></a>00058 <span class="preprocessor"></span><span class="preprocessor">#define _BACKWARD_HASH_FUN_H 1</span> <a name="l00059"></a>00059 <span class="preprocessor"></span> <a name="l00060"></a>00060 <span class="preprocessor">#include <<a class="code" href="a00781.html">bits/c++config.h</a>></span> <a name="l00061"></a>00061 <a name="l00062"></a>00062 <span class="keyword">namespace </span>__gnu_cxx _GLIBCXX_VISIBILITY(default) <a name="l00063"></a>00063 { <a name="l00064"></a>00064 _GLIBCXX_BEGIN_NAMESPACE_VERSION <a name="l00065"></a>00065 <a name="l00066"></a>00066 <span class="keyword">using</span> std::size_t; <a name="l00067"></a>00067 <a name="l00068"></a>00068 <span class="keyword">template</span><<span class="keyword">class</span> _Key> <a name="l00069"></a>00069 <span class="keyword">struct </span>hash { }; <a name="l00070"></a>00070 <a name="l00071"></a>00071 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a name="l00072"></a>00072 __stl_hash_string(<span class="keyword">const</span> <span class="keywordtype">char</span>* __s) <a name="l00073"></a>00073 { <a name="l00074"></a>00074 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __h = 0; <a name="l00075"></a>00075 <span class="keywordflow">for</span> ( ; *__s; ++__s) <a name="l00076"></a>00076 __h = 5 * __h + *__s; <a name="l00077"></a>00077 <span class="keywordflow">return</span> size_t(__h); <a name="l00078"></a>00078 } <a name="l00079"></a>00079 <a name="l00080"></a>00080 <span class="keyword">template</span><> <a name="l00081"></a>00081 <span class="keyword">struct </span>hash<char*> <a name="l00082"></a>00082 { <a name="l00083"></a>00083 <span class="keywordtype">size_t</span> <a name="l00084"></a>00084 operator()(<span class="keyword">const</span> <span class="keywordtype">char</span>* __s)<span class="keyword"> const</span> <a name="l00085"></a>00085 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __stl_hash_string(__s); } <a name="l00086"></a>00086 }; <a name="l00087"></a>00087 <a name="l00088"></a>00088 <span class="keyword">template</span><> <a name="l00089"></a>00089 <span class="keyword">struct </span>hash<const char*> <a name="l00090"></a>00090 { <a name="l00091"></a>00091 <span class="keywordtype">size_t</span> <a name="l00092"></a>00092 operator()(<span class="keyword">const</span> <span class="keywordtype">char</span>* __s)<span class="keyword"> const</span> <a name="l00093"></a>00093 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __stl_hash_string(__s); } <a name="l00094"></a>00094 }; <a name="l00095"></a>00095 <a name="l00096"></a>00096 <span class="keyword">template</span><> <a name="l00097"></a>00097 <span class="keyword">struct </span>hash<char> <a name="l00098"></a>00098 { <a name="l00099"></a>00099 <span class="keywordtype">size_t</span> <a name="l00100"></a>00100 operator()(<span class="keywordtype">char</span> __x)<span class="keyword"> const</span> <a name="l00101"></a>00101 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __x; } <a name="l00102"></a>00102 }; <a name="l00103"></a>00103 <a name="l00104"></a>00104 <span class="keyword">template</span><> <a name="l00105"></a>00105 <span class="keyword">struct </span>hash<unsigned char> <a name="l00106"></a>00106 { <a name="l00107"></a>00107 <span class="keywordtype">size_t</span> <a name="l00108"></a>00108 operator()(<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> __x)<span class="keyword"> const</span> <a name="l00109"></a>00109 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __x; } <a name="l00110"></a>00110 }; <a name="l00111"></a>00111 <a name="l00112"></a>00112 <span class="keyword">template</span><> <a name="l00113"></a>00113 <span class="keyword">struct </span>hash<signed char> <a name="l00114"></a>00114 { <a name="l00115"></a>00115 <span class="keywordtype">size_t</span> <a name="l00116"></a>00116 operator()(<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> __x)<span class="keyword"> const</span> <a name="l00117"></a>00117 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __x; } <a name="l00118"></a>00118 }; <a name="l00119"></a>00119 <a name="l00120"></a>00120 <span class="keyword">template</span><> <a name="l00121"></a>00121 <span class="keyword">struct </span>hash<short> <a name="l00122"></a>00122 { <a name="l00123"></a>00123 <span class="keywordtype">size_t</span> <a name="l00124"></a>00124 operator()(<span class="keywordtype">short</span> __x)<span class="keyword"> const</span> <a name="l00125"></a>00125 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __x; } <a name="l00126"></a>00126 }; <a name="l00127"></a>00127 <a name="l00128"></a>00128 <span class="keyword">template</span><> <a name="l00129"></a>00129 <span class="keyword">struct </span>hash<unsigned short> <a name="l00130"></a>00130 { <a name="l00131"></a>00131 <span class="keywordtype">size_t</span> <a name="l00132"></a>00132 operator()(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> __x)<span class="keyword"> const</span> <a name="l00133"></a>00133 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __x; } <a name="l00134"></a>00134 }; <a name="l00135"></a>00135 <a name="l00136"></a>00136 <span class="keyword">template</span><> <a name="l00137"></a>00137 <span class="keyword">struct </span>hash<int> <a name="l00138"></a>00138 { <a name="l00139"></a>00139 <span class="keywordtype">size_t</span> <a name="l00140"></a>00140 operator()(<span class="keywordtype">int</span> __x)<span class="keyword"> const </span> <a name="l00141"></a>00141 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __x; } <a name="l00142"></a>00142 }; <a name="l00143"></a>00143 <a name="l00144"></a>00144 <span class="keyword">template</span><> <a name="l00145"></a>00145 <span class="keyword">struct </span>hash<unsigned int> <a name="l00146"></a>00146 { <a name="l00147"></a>00147 <span class="keywordtype">size_t</span> <a name="l00148"></a>00148 operator()(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __x)<span class="keyword"> const</span> <a name="l00149"></a>00149 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __x; } <a name="l00150"></a>00150 }; <a name="l00151"></a>00151 <a name="l00152"></a>00152 <span class="keyword">template</span><> <a name="l00153"></a>00153 <span class="keyword">struct </span>hash<long> <a name="l00154"></a>00154 { <a name="l00155"></a>00155 <span class="keywordtype">size_t</span> <a name="l00156"></a>00156 operator()(<span class="keywordtype">long</span> __x)<span class="keyword"> const</span> <a name="l00157"></a>00157 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __x; } <a name="l00158"></a>00158 }; <a name="l00159"></a>00159 <a name="l00160"></a>00160 <span class="keyword">template</span><> <a name="l00161"></a>00161 <span class="keyword">struct </span>hash<unsigned long> <a name="l00162"></a>00162 { <a name="l00163"></a>00163 <span class="keywordtype">size_t</span> <a name="l00164"></a>00164 operator()(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __x)<span class="keyword"> const</span> <a name="l00165"></a>00165 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __x; } <a name="l00166"></a>00166 }; <a name="l00167"></a>00167 <a name="l00168"></a>00168 _GLIBCXX_END_NAMESPACE_VERSION <a name="l00169"></a>00169 } <span class="comment">// namespace</span> <a name="l00170"></a>00170 <a name="l00171"></a>00171 <span class="preprocessor">#endif</span> </pre></div></div> </div> <div id="nav-path" class="navpath"> <ul> <li class="navelem"><a class="el" href="a00898.html">hash_fun.h</a> </li> <li class="footer">Generated by  <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </li> </ul> </div> </body> </html>