-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathstdlib_hash_32bit_fnv.fypp.html
338 lines (297 loc) · 35.9 KB
/
stdlib_hash_32bit_fnv.fypp.html
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
<!-- -*- mode: jinja2 -*- -->
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta name="description" content="A community driven standard library for (modern) Fortran">
<meta name="author" content="fortran-lang/stdlib contributors" >
<link rel="icon" href="../favicon.png">
<title>stdlib_hash_32bit_fnv.fypp – Fortran-lang/stdlib</title>
<link href="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/css/bootstrap.min.css" rel="stylesheet"
integrity="sha384-1BmE4kWBq78iYhFldvKuhfTAU6auU8tT94WrHftjDbrCEXSU1oBoqyl2QvZ6jIW3" crossorigin="anonymous">
<link href="../css/pygments.css" rel="stylesheet">
<link href="../css/font-awesome.min.css" rel="stylesheet">
<link href="../css/local.css" rel="stylesheet">
<link href="../tipuesearch/tipuesearch.css" rel="stylesheet">
<script src="https://code.jquery.com/jquery-3.7.1.min.js" integrity="sha256-/JqT3SQfawRcv/BIHPThkBvs0OEvtFFmqPF/lYI/Cxo=" crossorigin="anonymous"></script>
<script src="../js/svg-pan-zoom.min.js"></script>
</head>
<body>
<!-- Fixed navbar -->
<div class="container-fluid mb-sm-4 mb-xl-2">
<nav class="navbar navbar-expand-lg navbar-dark bg-dark fixed-top">
<div class="container">
<a class="navbar-brand" href="../index.html">Fortran-lang/stdlib </a>
<button type="button" class="navbar-toggler" data-bs-toggle="collapse" data-bs-target="#navbar"
aria-expanded="false" aria-controls="navbar" aria-label="Toggle navigation">
<span class="navbar-toggler-icon">
</button>
<div id="navbar" class="navbar-collapse collapse">
<ul class="navbar-nav">
<li class="nav-item"><a class="nav-link" href="../page/index.html">Contributing and specs</a></li>
<li class="nav-item">
<a class="nav-link" href="../lists/files.html">Source Files</a>
</li>
<li class="nav-item">
<a class="nav-link" href="../lists/modules.html">Modules</a>
</li>
<li class="nav-item">
<a class="nav-link" href="../lists/procedures.html">Procedures</a>
</li>
<li class="nav-item">
<a class="nav-link" href="../lists/absint.html">Abstract Interfaces</a>
</li>
<li class="nav-item">
<a class="nav-link" href="../lists/types.html">Derived Types</a>
</li>
</ul>
<div class="d-flex align-items-end flex-grow-1">
<form action="../search.html" role="search" class="ms-auto">
<input type="text" class="form-control" aria-label="Search" placeholder="Search" name="q" id="tipue_search_input" autocomplete="off" required>
</form>
</div>
</div><!--/.nav-collapse -->
</div>
</nav>
</div>
<div class="container">
<div class="row">
<h1>stdlib_hash_32bit_fnv.fypp
<small>Source File</small>
</h1>
<div class="container p-2 mb-4 bg-light border rounded-3">
<div class="row align-items-center justify-content-between" id="info-bar">
<div class="col">
<ul class="list-inline" style="margin-bottom:0px;display:inline">
<li class="list-inline-item" id="meta-license"><i class="fa fa-legal"></i> <a rel="license" href="http://creativecommons.org/licenses/by-sa/4.0/"><img alt="Creative Commons License" style="border-width:0" src="https://i.creativecommons.org/l/by-sa/4.0/80x15.png" /></a></li>
<li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
<a data-bs-toggle="tooltip"
data-bs-placement="bottom" data-html="true"
title=" 0.0% of total for source files.">73 statements</a>
</li>
<li class="list-inline-item" id="source-file">
<i class="fa fa-code"></i>
<a href="../src/stdlib_hash_32bit_fnv.fypp"> Source File</a>
</li>
</ul>
</div>
<div class="col">
<nav aria-label="breadcrumb">
<ol class="breadcrumb justify-content-end mb-0">
<li class="breadcrumb-item active" aria-current="page">stdlib_hash_32bit_fnv.fypp</li>
</ol>
</nav>
</div>
</div>
</div>
<script>
$(function () {
$('[data-bs-toggle="tooltip"]').tooltip()
})
</script>
</div>
<div class="row">
<div class="col-md-3 hidden-xs hidden-sm visible-md visible-lg">
<div id="sidebar">
<h3>Contents</h3>
<div class="card mb-4">
<a data-bs-toggle="collapse" href="#submods-0"
aria-expanded="false" aria-controls="submods-0">
<h4 class="card-header bg-primary text-white">Submodules</h4>
</a>
<div id="submods-0" class="collapse">
<div class="list-group list-group-flush">
<a class="list-group-item" href="../module/stdlib_hash_32bit_fnv.html">stdlib_hash_32bit_fnv</a>
</div>
</div>
</div>
<div class="card card-primary">
<div class="card-header text-left"><h3 class="card-title">Source Code</h3></div>
<div class="list-group">
<a class="list-group-item" href="../sourcefile/stdlib_hash_32bit_fnv.fypp.html#src">stdlib_hash_32bit_fnv.fypp</a>
</div>
</div>
</div>
</div>
<div class="col-md-9" id='text'>
<p><code>FNV_1_HASH</code> and <code>FNV_1A_Hash</code> are translations to Fortran 2008 of the
<code>FNV-1</code> and <code>FNV-1a</code> hash functions of Glenn Fowler, Landon Curt Noll,
and Phong Vo, that has been released into the public domain. Permission
has been granted, by Landon Curt Noll, for the use of these algorithms
in the Fortran Standard Library. A description of these functions is
available at https://en.wikipedia.org/wiki/Fowler–Noll–Vo_hash_function.</p>
<hr>
<br>
<br>
<section>
<h2><span class="anchor" id="src"></span>Source Code</h2>
<div class="hl codehilite"><pre><span></span><a id="ln-1" name="ln-1" href="#ln-1"></a><span class="c">!!------------------------------------------------------------------------------</span>
<a id="ln-2" name="ln-2" href="#ln-2"></a><span class="c">!! `FNV_1_HASH` and `FNV_1A_Hash` are translations to Fortran 2008 of the</span>
<a id="ln-3" name="ln-3" href="#ln-3"></a><span class="c">!! `FNV-1` and `FNV-1a` hash functions of Glenn Fowler, Landon Curt Noll,</span>
<a id="ln-4" name="ln-4" href="#ln-4"></a><span class="c">!! and Phong Vo, that has been released into the public domain. Permission</span>
<a id="ln-5" name="ln-5" href="#ln-5"></a><span class="c">!! has been granted, by Landon Curt Noll, for the use of these algorithms</span>
<a id="ln-6" name="ln-6" href="#ln-6"></a><span class="c">!! in the Fortran Standard Library. A description of these functions is</span>
<a id="ln-7" name="ln-7" href="#ln-7"></a><span class="c">!! available at https://en.wikipedia.org/wiki/Fowler–Noll–Vo_hash_function.</span>
<a id="ln-8" name="ln-8" href="#ln-8"></a><span class="c">!!------------------------------------------------------------------------------</span>
<a id="ln-9" name="ln-9" href="#ln-9"></a>
<a id="ln-10" name="ln-10" href="#ln-10"></a><span class="c">!#! Integer kinds to be considered during templating</span>
<a id="ln-11" name="ln-11" href="#ln-11"></a><span class="cp">#:set INT_KINDS = ["int16", "int32", "int64"]</span>
<a id="ln-12" name="ln-12" href="#ln-12"></a>
<a id="ln-13" name="ln-13" href="#ln-13"></a><span class="k">submodule</span><span class="p">(</span><span class="n">stdlib_hash_32bit</span><span class="p">)</span><span class="w"> </span><span class="n">stdlib_hash_32bit_fnv</span>
<a id="ln-14" name="ln-14" href="#ln-14"></a><span class="c">!! An implementation of the FNV hashes 1 and 1a of Glenn Fowler, Landon Curt</span>
<a id="ln-15" name="ln-15" href="#ln-15"></a><span class="c">!! Noll, and Kiem-Phong-Vo,</span>
<a id="ln-16" name="ln-16" href="#ln-16"></a><span class="c">!! https://en.wikipedia.org/wiki/Fowler–Noll–Vo_hash_function</span>
<a id="ln-17" name="ln-17" href="#ln-17"></a><span class="w"> </span><span class="k">implicit none</span>
<a id="ln-18" name="ln-18" href="#ln-18"></a>
<a id="ln-19" name="ln-19" href="#ln-19"></a><span class="k"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int_hash</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="p">&</span>
<a id="ln-20" name="ln-20" href="#ln-20"></a><span class="w"> </span><span class="n">offset_basis</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">int</span><span class="p">(</span><span class="w"> </span><span class="n">z</span><span class="s1">'811C9DC5'</span><span class="p">,</span><span class="w"> </span><span class="n">int_hash</span><span class="w"> </span><span class="p">),</span><span class="w"> </span><span class="p">&</span>
<a id="ln-21" name="ln-21" href="#ln-21"></a><span class="w"> </span><span class="n">prime</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">int</span><span class="p">(</span><span class="w"> </span><span class="n">z</span><span class="s1">'01000193'</span><span class="p">,</span><span class="w"> </span><span class="n">int_hash</span><span class="w"> </span><span class="p">)</span>
<a id="ln-22" name="ln-22" href="#ln-22"></a>
<a id="ln-23" name="ln-23" href="#ln-23"></a><span class="k">contains</span>
<a id="ln-24" name="ln-24" href="#ln-24"></a>
<a id="ln-25" name="ln-25" href="#ln-25"></a><span class="k"> pure module function </span><span class="n">int8_fnv_1</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">hash_code</span><span class="p">)</span>
<a id="ln-26" name="ln-26" href="#ln-26"></a><span class="c">!! The original FNV-1 8-bit key algorithm.</span>
<a id="ln-27" name="ln-27" href="#ln-27"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int8</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">key</span><span class="p">(:)</span>
<a id="ln-28" name="ln-28" href="#ln-28"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int_hash</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">hash_code</span>
<a id="ln-29" name="ln-29" href="#ln-29"></a>
<a id="ln-30" name="ln-30" href="#ln-30"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span>
<a id="ln-31" name="ln-31" href="#ln-31"></a>
<a id="ln-32" name="ln-32" href="#ln-32"></a><span class="w"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">offset_basis</span>
<a id="ln-33" name="ln-33" href="#ln-33"></a><span class="w"> </span><span class="k">do </span><span class="n">i</span><span class="o">=</span><span class="mi">1_int64</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="nb">kind</span><span class="o">=</span><span class="n">int64</span><span class="p">)</span>
<a id="ln-34" name="ln-34" href="#ln-34"></a><span class="w"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">prime</span>
<a id="ln-35" name="ln-35" href="#ln-35"></a><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="w"> </span><span class="n">little_endian</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
<a id="ln-36" name="ln-36" href="#ln-36"></a><span class="k"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">ieor</span><span class="p">(</span><span class="w"> </span><span class="n">hash_code</span><span class="p">,</span><span class="w"> </span><span class="p">&</span>
<a id="ln-37" name="ln-37" href="#ln-37"></a><span class="w"> </span><span class="nb">transfer</span><span class="p">(</span><span class="w"> </span><span class="p">[</span><span class="n">key</span><span class="p">(</span><span class="n">i</span><span class="p">),</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">],</span><span class="w"> </span><span class="p">&</span>
<a id="ln-38" name="ln-38" href="#ln-38"></a><span class="w"> </span><span class="mi">0_int_hash</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="p">)</span>
<a id="ln-39" name="ln-39" href="#ln-39"></a><span class="w"> </span><span class="k">else</span>
<a id="ln-40" name="ln-40" href="#ln-40"></a><span class="k"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">ieor</span><span class="p">(</span><span class="w"> </span><span class="n">hash_code</span><span class="p">,</span><span class="w"> </span><span class="p">&</span>
<a id="ln-41" name="ln-41" href="#ln-41"></a><span class="w"> </span><span class="nb">transfer</span><span class="p">(</span><span class="w"> </span><span class="p">[</span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="n">key</span><span class="p">(</span><span class="n">i</span><span class="p">)],</span><span class="w"> </span><span class="p">&</span>
<a id="ln-42" name="ln-42" href="#ln-42"></a><span class="w"> </span><span class="mi">0_int_hash</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="p">)</span>
<a id="ln-43" name="ln-43" href="#ln-43"></a><span class="w"> </span><span class="k">end if</span>
<a id="ln-44" name="ln-44" href="#ln-44"></a><span class="k"> end do</span>
<a id="ln-45" name="ln-45" href="#ln-45"></a>
<a id="ln-46" name="ln-46" href="#ln-46"></a><span class="k"> end function </span><span class="n">int8_fnv_1</span>
<a id="ln-47" name="ln-47" href="#ln-47"></a>
<a id="ln-48" name="ln-48" href="#ln-48"></a>
<a id="ln-49" name="ln-49" href="#ln-49"></a><span class="cp">#:for k1 in INT_KINDS</span>
<a id="ln-50" name="ln-50" href="#ln-50"></a><span class="w"> </span><span class="k">pure module function</span><span class="w"> </span><span class="err">${</span><span class="n">k1</span><span class="err">}$_</span><span class="n">fnv_1</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">hash_code</span><span class="p">)</span>
<a id="ln-51" name="ln-51" href="#ln-51"></a><span class="c">! A ${k1}$ array key wrapper for the FNV-1 algorithm.</span>
<a id="ln-52" name="ln-52" href="#ln-52"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="err">${</span><span class="n">k1</span><span class="err">}$</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">key</span><span class="p">(:)</span>
<a id="ln-53" name="ln-53" href="#ln-53"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int_hash</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">hash_code</span>
<a id="ln-54" name="ln-54" href="#ln-54"></a>
<a id="ln-55" name="ln-55" href="#ln-55"></a><span class="w"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">int8_fnv_1</span><span class="p">(</span><span class="w"> </span><span class="nb">transfer</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="p">&</span>
<a id="ln-56" name="ln-56" href="#ln-56"></a><span class="w"> </span><span class="n">bytes_$</span><span class="err">{</span><span class="n">k1</span><span class="err">}$</span><span class="o">*</span><span class="w"> </span><span class="p">&</span>
<a id="ln-57" name="ln-57" href="#ln-57"></a><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="nb">kind</span><span class="o">=</span><span class="n">int64</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="p">)</span>
<a id="ln-58" name="ln-58" href="#ln-58"></a>
<a id="ln-59" name="ln-59" href="#ln-59"></a><span class="w"> </span><span class="k">end function</span><span class="w"> </span><span class="err">${</span><span class="n">k1</span><span class="err">}$_</span><span class="n">fnv_1</span>
<a id="ln-60" name="ln-60" href="#ln-60"></a>
<a id="ln-61" name="ln-61" href="#ln-61"></a><span class="cp">#:endfor</span>
<a id="ln-62" name="ln-62" href="#ln-62"></a>
<a id="ln-63" name="ln-63" href="#ln-63"></a>
<a id="ln-64" name="ln-64" href="#ln-64"></a><span class="w"> </span><span class="k">elemental module function </span><span class="n">character_fnv_1</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">hash_code</span><span class="p">)</span>
<a id="ln-65" name="ln-65" href="#ln-65"></a><span class="c">! A default character key wrapper for the FNV-1 algorithm.</span>
<a id="ln-66" name="ln-66" href="#ln-66"></a><span class="w"> </span><span class="kt">character</span><span class="p">(</span><span class="o">*</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">key</span>
<a id="ln-67" name="ln-67" href="#ln-67"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int_hash</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">hash_code</span>
<a id="ln-68" name="ln-68" href="#ln-68"></a>
<a id="ln-69" name="ln-69" href="#ln-69"></a><span class="w"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">int8_fnv_1</span><span class="p">(</span><span class="w"> </span><span class="nb">transfer</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="p">&</span>
<a id="ln-70" name="ln-70" href="#ln-70"></a><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="p">&</span>
<a id="ln-71" name="ln-71" href="#ln-71"></a><span class="w"> </span><span class="n">bytes_char</span><span class="o">*</span><span class="w"> </span><span class="p">&</span>
<a id="ln-72" name="ln-72" href="#ln-72"></a><span class="w"> </span><span class="nb">len</span><span class="p">(</span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="nb">kind</span><span class="o">=</span><span class="n">int64</span><span class="p">)</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="p">)</span>
<a id="ln-73" name="ln-73" href="#ln-73"></a>
<a id="ln-74" name="ln-74" href="#ln-74"></a><span class="w"> </span><span class="k">end function </span><span class="n">character_fnv_1</span>
<a id="ln-75" name="ln-75" href="#ln-75"></a>
<a id="ln-76" name="ln-76" href="#ln-76"></a>
<a id="ln-77" name="ln-77" href="#ln-77"></a><span class="w"> </span><span class="k">pure module function </span><span class="n">int8_fnv_1a</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">hash_code</span><span class="p">)</span>
<a id="ln-78" name="ln-78" href="#ln-78"></a><span class="c">!! The original FNV-1a 8-bit key algorithm.</span>
<a id="ln-79" name="ln-79" href="#ln-79"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int8</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">key</span><span class="p">(:)</span>
<a id="ln-80" name="ln-80" href="#ln-80"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int_hash</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">hash_code</span>
<a id="ln-81" name="ln-81" href="#ln-81"></a>
<a id="ln-82" name="ln-82" href="#ln-82"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span>
<a id="ln-83" name="ln-83" href="#ln-83"></a>
<a id="ln-84" name="ln-84" href="#ln-84"></a><span class="w"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">offset_basis</span>
<a id="ln-85" name="ln-85" href="#ln-85"></a><span class="w"> </span><span class="k">do </span><span class="n">i</span><span class="o">=</span><span class="mi">1_int64</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="nb">kind</span><span class="o">=</span><span class="n">int64</span><span class="p">)</span>
<a id="ln-86" name="ln-86" href="#ln-86"></a><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="w"> </span><span class="n">little_endian</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
<a id="ln-87" name="ln-87" href="#ln-87"></a><span class="k"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">ieor</span><span class="p">(</span><span class="w"> </span><span class="n">hash_code</span><span class="p">,</span><span class="w"> </span><span class="p">&</span>
<a id="ln-88" name="ln-88" href="#ln-88"></a><span class="w"> </span><span class="nb">transfer</span><span class="p">(</span><span class="w"> </span><span class="p">[</span><span class="n">key</span><span class="p">(</span><span class="n">i</span><span class="p">),</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">],</span><span class="w"> </span><span class="p">&</span>
<a id="ln-89" name="ln-89" href="#ln-89"></a><span class="w"> </span><span class="mi">0_int_hash</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="p">)</span>
<a id="ln-90" name="ln-90" href="#ln-90"></a><span class="w"> </span><span class="k">else</span>
<a id="ln-91" name="ln-91" href="#ln-91"></a><span class="k"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">ieor</span><span class="p">(</span><span class="w"> </span><span class="n">hash_code</span><span class="p">,</span><span class="w"> </span><span class="p">&</span>
<a id="ln-92" name="ln-92" href="#ln-92"></a><span class="w"> </span><span class="nb">transfer</span><span class="p">(</span><span class="w"> </span><span class="p">[</span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="n">key</span><span class="p">(</span><span class="n">i</span><span class="p">)],</span><span class="w"> </span><span class="p">&</span>
<a id="ln-93" name="ln-93" href="#ln-93"></a><span class="w"> </span><span class="mi">0_int_hash</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="p">)</span>
<a id="ln-94" name="ln-94" href="#ln-94"></a><span class="w"> </span><span class="k">end if</span>
<a id="ln-95" name="ln-95" href="#ln-95"></a><span class="k"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">prime</span>
<a id="ln-96" name="ln-96" href="#ln-96"></a><span class="w"> </span><span class="k">end do</span>
<a id="ln-97" name="ln-97" href="#ln-97"></a>
<a id="ln-98" name="ln-98" href="#ln-98"></a><span class="k"> end function </span><span class="n">int8_fnv_1a</span>
<a id="ln-99" name="ln-99" href="#ln-99"></a>
<a id="ln-100" name="ln-100" href="#ln-100"></a>
<a id="ln-101" name="ln-101" href="#ln-101"></a><span class="cp">#:for k1 in INT_KINDS</span>
<a id="ln-102" name="ln-102" href="#ln-102"></a><span class="w"> </span><span class="k">pure module function</span><span class="w"> </span><span class="err">${</span><span class="n">k1</span><span class="err">}$_</span><span class="n">fnv_1a</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">hash_code</span><span class="p">)</span>
<a id="ln-103" name="ln-103" href="#ln-103"></a><span class="c">! A ${k1}$ array key wrapper for the FNV-1a algorithm.</span>
<a id="ln-104" name="ln-104" href="#ln-104"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="err">${</span><span class="n">k1</span><span class="err">}$</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">key</span><span class="p">(:)</span>
<a id="ln-105" name="ln-105" href="#ln-105"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int_hash</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">hash_code</span>
<a id="ln-106" name="ln-106" href="#ln-106"></a>
<a id="ln-107" name="ln-107" href="#ln-107"></a><span class="w"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">int8_fnv_1a</span><span class="p">(</span><span class="w"> </span><span class="nb">transfer</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="p">&</span>
<a id="ln-108" name="ln-108" href="#ln-108"></a><span class="w"> </span><span class="n">bytes_$</span><span class="err">{</span><span class="n">k1</span><span class="err">}$</span><span class="o">*</span><span class="w"> </span><span class="p">&</span>
<a id="ln-109" name="ln-109" href="#ln-109"></a><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="nb">kind</span><span class="o">=</span><span class="n">int64</span><span class="p">))</span><span class="w"> </span><span class="p">)</span>
<a id="ln-110" name="ln-110" href="#ln-110"></a>
<a id="ln-111" name="ln-111" href="#ln-111"></a><span class="w"> </span><span class="k">end function</span><span class="w"> </span><span class="err">${</span><span class="n">k1</span><span class="err">}$_</span><span class="n">fnv_1a</span>
<a id="ln-112" name="ln-112" href="#ln-112"></a>
<a id="ln-113" name="ln-113" href="#ln-113"></a><span class="cp">#:endfor</span>
<a id="ln-114" name="ln-114" href="#ln-114"></a>
<a id="ln-115" name="ln-115" href="#ln-115"></a><span class="w"> </span><span class="k">elemental module function </span><span class="n">character_fnv_1a</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">hash_code</span><span class="p">)</span>
<a id="ln-116" name="ln-116" href="#ln-116"></a><span class="c">! A default character key wrapper for the FNV-1 algorithm.</span>
<a id="ln-117" name="ln-117" href="#ln-117"></a><span class="w"> </span><span class="kt">character</span><span class="p">(</span><span class="o">*</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">key</span>
<a id="ln-118" name="ln-118" href="#ln-118"></a><span class="w"> </span><span class="kt">integer</span><span class="p">(</span><span class="n">int_hash</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">hash_code</span>
<a id="ln-119" name="ln-119" href="#ln-119"></a>
<a id="ln-120" name="ln-120" href="#ln-120"></a><span class="w"> </span><span class="n">hash_code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">int8_fnv_1a</span><span class="p">(</span><span class="w"> </span><span class="nb">transfer</span><span class="p">(</span><span class="w"> </span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="mi">0_int8</span><span class="p">,</span><span class="w"> </span><span class="p">&</span>
<a id="ln-121" name="ln-121" href="#ln-121"></a><span class="w"> </span><span class="p">(</span><span class="n">bits_char</span><span class="o">/</span><span class="n">bits_int8</span><span class="p">)</span><span class="o">*</span><span class="w"> </span><span class="p">&</span>
<a id="ln-122" name="ln-122" href="#ln-122"></a><span class="w"> </span><span class="nb">len</span><span class="p">(</span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="nb">kind</span><span class="o">=</span><span class="n">int64</span><span class="p">)</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="p">)</span>
<a id="ln-123" name="ln-123" href="#ln-123"></a>
<a id="ln-124" name="ln-124" href="#ln-124"></a><span class="w"> </span><span class="k">end function </span><span class="n">character_fnv_1a</span>
<a id="ln-125" name="ln-125" href="#ln-125"></a>
<a id="ln-126" name="ln-126" href="#ln-126"></a><span class="k">end submodule </span><span class="n">stdlib_hash_32bit_fnv</span>
</pre></div>
</section>
</div>
</div>
<hr>
</div> <!-- /container -->
<footer>
<div class="container">
<div class="row justify-content-between">
<div class="col"><p>Fortran-lang/stdlib was developed by fortran-lang/stdlib contributors<br>© 2025 <a rel="license" href="http://creativecommons.org/licenses/by-sa/4.0/"><img alt="Creative Commons License" style="border-width:0" src="https://i.creativecommons.org/l/by-sa/4.0/80x15.png" /></a>
<br /><small>def840da</small></p>
</div>
<div class="col">
<p class="text-end">
Documentation generated by
<a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
on 2025-04-03 06:18 </p>
</div>
</div>
<br>
</div> <!-- /container -->
</footer>
<!-- Bootstrap core JavaScript -->
<!-- Placed at the end of the document so the pages load faster -->
<script src="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/js/bootstrap.bundle.min.js"
integrity="sha384-ka7Sk0Gln4gmtz2MlQnikT1wXgYsOg+OMhuP+IlRH9sENBO0LRn5q+8nbTov4+1p" crossorigin="anonymous"></script>
<!-- MathJax JavaScript
================================================== -->
<!-- Placed at the end of the document so the pages load faster -->
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } },
jax: ['input/TeX','input/MathML','output/HTML-CSS'],
extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']
});
</script>
<script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
<script src="../tipuesearch/tipuesearch_content.js"></script>
<script src="../tipuesearch/tipuesearch_set.js"></script>
<script src="../tipuesearch/tipuesearch.js"></script>
</body>
</html>