Skip to content

Commit

Permalink
Deploying to gh-pages from @ f0313cf 🚀
Browse files Browse the repository at this point in the history
  • Loading branch information
maawad committed Jan 24, 2024
1 parent de3efdc commit d9aca1f
Show file tree
Hide file tree
Showing 55 changed files with 24,519 additions and 268 deletions.
2 changes: 1 addition & 1 deletion annotated.html
Original file line number Diff line number Diff line change
Expand Up @@ -71,7 +71,7 @@
<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>bght</b></td><td class="desc"></td></tr>
<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d16/structbght_1_1bcht.html" target="_self">bcht</a></td><td class="desc">BCHT BCHT (bucketed cuckoo hash table) is an associative static GPU hash table that contains key-value pairs with unique keys. The hash table is an open addressing hash table based on the cuckoo hashing probing scheme (bucketed and using three hash functions) </td></tr>
<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dad/structbght_1_1cht.html" target="_self">cht</a></td><td class="desc">CHT CHT (cuckoo hash table) is an associative static GPU hash table that contains key-value pairs with unique keys. The hash table is an open addressing hash table based on the cuckoo hashing probing scheme (bucket size of one and using four hash functions) </td></tr>
<tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d24/structbght_1_1iht.html" target="_self">iht</a></td><td class="desc">IHT IHT (iceberg hash table) is an associative static GPU hash table that contains key-value pairs with unique keys. The hash table is an open addressing hash table based on the cuckoo hashing probing scheme (bucketed and using a primary hash function and two secondary hash functions) </td></tr>
<tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d24/structbght_1_1iht.html" target="_self">iht</a></td><td class="desc">IHT IHT (iceberg hash table) is an associative static GPU hash table that contains key-value pairs with unique keys. The hash table is an open addressing hash table based on the double hashing probing scheme (bucketed and using a primary hash function followed by double hashing) </td></tr>
<tr id="row_0_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dcc/structbght_1_1p2bht.html" target="_self">p2bht</a></td><td class="desc">P2BHT P2BHT (power-of-two bucketed hash table) is an associative static GPU hash table that contains key-value pairs with unique keys. The hash table is an open addressing hash table based on the power-of-two hashing to balance loads between buckets (bucketed and using two hash functions) </td></tr>
</table>
</div><!-- directory -->
Expand Down
270 changes: 141 additions & 129 deletions d1/db6/iht_8hpp_source.html

Large diffs are not rendered by default.

124 changes: 124 additions & 0 deletions d2/dc1/universal__hash_8hpp_source.html
Original file line number Diff line number Diff line change
@@ -0,0 +1,124 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>BGHT: include/detail/universal_hash.hpp Source File</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">BGHT
</div>
<div id="projectbrief">High-performance static GPU hash tables.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="../../dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="../../dir_1ce12a969299dbe29f3c2a77345014ad.html">detail</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">universal_hash.hpp</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment"> * Copyright 2021 The Regents of the University of California, Davis</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment"> * Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="comment"> * you may not use this file except in compliance with the License.</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="comment"> * You may obtain a copy of the License at</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="comment"> * Unless required by applicable law or agreed to in writing, software</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="comment"> * distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160;<span class="comment"> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;<span class="comment"> * See the License for the specific language governing permissions and</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="comment"> * limitations under the License.</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160; </div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="preprocessor">#pragma once</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="keyword">namespace </span>bght {</div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> Key&gt;</div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="keyword">struct </span>universal_hash {</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160; <span class="keyword">using</span> key_type = Key;</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160; <span class="keyword">using</span> result_type = Key;</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; </div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; __host__ __device__ constexpr universal_hash() : hash_x_(1), hash_y_(2) {}</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; </div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; __host__ __device__ constexpr universal_hash(uint32_t hash_x, uint32_t hash_y)</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; : hash_x_(hash_x), hash_y_(hash_y) {}</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; </div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; constexpr result_type __host__ __device__ operator()(<span class="keyword">const</span> key_type&amp; key)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; <span class="keywordflow">return</span> (((hash_x_ ^ key) + hash_y_) % prime_divisor);</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; }</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; </div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; universal_hash(<span class="keyword">const</span> universal_hash&amp;) = <span class="keywordflow">default</span>;</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; universal_hash(universal_hash&amp;&amp;) = <span class="keywordflow">default</span>;</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; universal_hash&amp; operator=(universal_hash <span class="keyword">const</span>&amp;) = <span class="keywordflow">default</span>;</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; universal_hash&amp; operator=(universal_hash&amp;&amp;) = <span class="keywordflow">default</span>;</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; ~universal_hash() = <span class="keywordflow">default</span>;</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; </div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <span class="keyword">static</span> constexpr uint32_t prime_divisor = 4294967291u;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; </div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="keyword">private</span>:</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; uint32_t hash_x_;</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; uint32_t hash_y_;</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160;};</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160;} <span class="comment">// namespace bght</span></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1
</small></address>
</body>
</html>
16 changes: 8 additions & 8 deletions d3/d16/structbght_1_1bcht.html
Original file line number Diff line number Diff line change
Expand Up @@ -176,7 +176,7 @@
<tr class="separator:adab32be4f06400b48898b2ee2e0bc54a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><h3>template&lt;class Key, class T, class Hash = bght::universal_hash&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt;<br />
<div class="textblock"><h3>template&lt;class Key, class T, class Hash = bght::MurmurHash3_32&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt;<br />
struct bght::bcht&lt; Key, T, Hash, KeyEqual, Scope, Allocator, B &gt;</h3>

<p>BCHT BCHT (bucketed cuckoo hash table) is an associative static GPU hash table that contains key-value pairs with unique keys. The hash table is an open addressing hash table based on the cuckoo hashing probing scheme (bucketed and using three hash functions). </p>
Expand All @@ -198,7 +198,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ab77ebf40b39673ff2943fbe9
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class T , class Hash = bght::universal_hash&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
template&lt;class Key , class T , class Hash = bght::MurmurHash3_32&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d3/d16/structbght_1_1bcht.html">bght::bcht</a>&lt; Key, T, Hash, KeyEqual, Scope, Allocator, B &gt;::<a class="el" href="../../d3/d16/structbght_1_1bcht.html">bcht</a> </td>
Expand Down Expand Up @@ -252,7 +252,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#aa00dd13fd68144e59cfdd1bd
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class T , class Hash = bght::universal_hash&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
template&lt;class Key , class T , class Hash = bght::MurmurHash3_32&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
<div class="memtemplate">
template&lt;typename InputIt , typename OutputIt &gt; </div>
<table class="memname">
Expand Down Expand Up @@ -314,7 +314,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#adbbadf9704bd5752b55fe0e7
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class T , class Hash = bght::universal_hash&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
template&lt;class Key , class T , class Hash = bght::MurmurHash3_32&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
<div class="memtemplate">
template&lt;typename tile_type &gt; </div>
<table class="memname">
Expand Down Expand Up @@ -362,7 +362,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a2e8e21183a7978f2908a801f
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class T , class Hash = bght::universal_hash&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
template&lt;class Key , class T , class Hash = bght::MurmurHash3_32&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
<div class="memtemplate">
template&lt;typename InputIt &gt; </div>
<table class="memname">
Expand Down Expand Up @@ -417,7 +417,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a8ca06cef309ce158a21ba686
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class T , class Hash = bght::universal_hash&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
template&lt;class Key , class T , class Hash = bght::MurmurHash3_32&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
<div class="memtemplate">
template&lt;typename tile_type &gt; </div>
<table class="memname">
Expand Down Expand Up @@ -465,7 +465,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#afceb31cd69d17b0051edd595
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class T , class Hash = bght::universal_hash&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
template&lt;class Key , class T , class Hash = bght::MurmurHash3_32&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
<div class="memtemplate">
template&lt;typename RNG &gt; </div>
<table class="memname">
Expand Down Expand Up @@ -501,7 +501,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a4fc21878958c178a66d68603
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class T , class Hash = bght::universal_hash&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
template&lt;class Key , class T , class Hash = bght::MurmurHash3_32&lt;Key&gt;, class KeyEqual = bght::equal_to&lt;Key&gt;, cuda::thread_scope Scope = cuda::thread_scope_device, class Allocator = bght::cuda_allocator&lt;char&gt;, int B = 16&gt; </div>
<table class="memname">
<tr>
<td class="memname">size_type <a class="el" href="../../d3/d16/structbght_1_1bcht.html">bght::bcht</a>&lt; Key, T, Hash, KeyEqual, Scope, Allocator, B &gt;::size </td>
Expand Down
Loading

0 comments on commit d9aca1f

Please sign in to comment.