791 lines
97 KiB
HTML
791 lines
97 KiB
HTML
<!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"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.5"/>
|
|
<title>Faiss: hamming.cpp 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/search.js"></script>
|
|
<script type="text/javascript">
|
|
$(document).ready(function() { searchBox.OnSelectItem(0); });
|
|
</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 style="padding-left: 0.5em;">
|
|
<div id="projectname">Faiss
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.5 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
</script>
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
<li>
|
|
<div id="MSearchBox" class="MSearchBoxInactive">
|
|
<span class="left">
|
|
<img id="MSearchSelect" src="search/mag_sel.png"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
alt=""/>
|
|
<input type="text" id="MSearchField" value="Search" accesskey="S"
|
|
onfocus="searchBox.OnSearchFieldFocus(true)"
|
|
onblur="searchBox.OnSearchFieldFocus(false)"
|
|
onkeyup="searchBox.OnSearchFieldChange(event)"/>
|
|
</span><span class="right">
|
|
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
|
|
</span>
|
|
</div>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="files.html"><span>File List</span></a></li>
|
|
</ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Friends</a></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 class="header">
|
|
<div class="headertitle">
|
|
<div class="title">hamming.cpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment"></span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * Copyright (c) 2015-present, Facebook, Inc.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * All rights reserved.</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * This source code is licensed under the CC-by-NC license found in the</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * LICENSE file in the root directory of this source tree.</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/* Copyright 2004-present Facebook. All Rights Reserved.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * Implementation of Hamming related functions (distances, smallest distance</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * selection with regular heap|radix and probabilistic heap|radix.</span></div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * IMPLEMENTATION NOTES</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * Bitvectors are generally assumed to be multiples of 64 bits.</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * hamdis_t is used for distances because at this time</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * it is not clear how we will need to balance</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * - flexibility in vector size (unclear more than 2^16 or even 2^8 bitvectors)</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * - memory usage</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * - cache-misses when dealing with large volumes of data (lower bits is better)</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> * The hamdis_t should optimally be compatibe with one of the Torch Storage</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * (Byte,Short,Long) and therefore should be signed for 2-bytes and 4-bytes</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">*/</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "hamming.h"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include <stdlib.h></span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include <stdio.h></span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include <math.h></span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <assert.h></span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <limits.h></span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "Heap.h"</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include "FaissAssert.h"</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> BLOCKSIZE_QUERY = 8192;</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">namespace </span>faiss {</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">static</span> <span class="keyword">const</span> uint8_t hamdis_tab_ham_bytes[256] = {</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> };</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment">/* Elementary Hamming distance computation: unoptimized */</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="keyword">template</span> <<span class="keywordtype">size_t</span> nbits, <span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> T hamming (<span class="keyword">const</span> uint8_t *bs1,</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">const</span> uint8_t *bs2)</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> {</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nbytes = nbits / 8;</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordtype">size_t</span> i;</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  T h = 0;</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">for</span> (i = 0; i < nbytes; i++)</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  h += (T) hamdis_tab_ham_bytes[bs1[i]^bs2[i]];</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> h;</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> }</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> </div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment">/* Hamming distances for multiples of 64 bits */</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="keyword">template</span> <<span class="keywordtype">size_t</span> nbits></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> hamdis_t hamming (<span class="keyword">const</span> uint64_t * bs1, <span class="keyword">const</span> uint64_t * bs2)</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> {</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nwords = nbits / 64;</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordtype">size_t</span> i;</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  hamdis_t h = 0;</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">for</span> (i = 0; i < nwords; i++)</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  h += popcount64 (bs1[i] ^ bs2[i]);</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> h;</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment">/* specialized (optimized) functions */</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="keyword">template</span> <></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> hamdis_t hamming<64> (<span class="keyword">const</span> uint64_t * pa, <span class="keyword">const</span> uint64_t * pb)</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">return</span> popcount64 (pa[0] ^ pb[0]);</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> }</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="keyword">template</span> <></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> hamdis_t hamming<128> (<span class="keyword">const</span> uint64_t *pa, <span class="keyword">const</span> uint64_t *pb)</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> {</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">return</span> popcount64 (pa[0] ^ pb[0]) + popcount64(pa[1] ^ pb[1]);</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> }</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">template</span> <></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> hamdis_t hamming<256> (<span class="keyword">const</span> uint64_t * pa, <span class="keyword">const</span> uint64_t * pb)</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">return</span> popcount64 (pa[0] ^ pb[0])</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  + popcount64 (pa[1] ^ pb[1])</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  + popcount64 (pa[2] ^ pb[2])</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  + popcount64 (pa[3] ^ pb[3]);</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> }</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">/* Hamming distances for multiple of 64 bits */</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> hamdis_t hamming (</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">const</span> uint64_t * bs1,</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">const</span> uint64_t * bs2,</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordtype">size_t</span> nwords)</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> {</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordtype">size_t</span> i;</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  hamdis_t h = 0;</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">for</span> (i = 0; i < nwords; i++)</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  h += popcount64 (bs1[i] ^ bs2[i]);</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">return</span> h;</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> }</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="keyword">template</span> <<span class="keywordtype">size_t</span> nbits></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="keywordtype">void</span> hammings (</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">const</span> uint64_t * bs1,</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">const</span> uint64_t * bs2,</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordtype">size_t</span> n1, <span class="keywordtype">size_t</span> n2,</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  hamdis_t * dis)</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> {</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">size_t</span> i, j;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nwords = nbits / 64;</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">for</span> (i = 0; i < n1; i++) {</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> uint64_t * __restrict bs1_ = bs1 + i * nwords;</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  hamdis_t * __restrict dis_ = dis + i * n2;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">for</span> (j = 0; j < n2; j++)</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  dis_[j] = hamming<nbits>(bs1_, bs2 + j * nwords);</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> }</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="keywordtype">void</span> hammings (</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">const</span> uint64_t * bs1,</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">const</span> uint64_t * bs2,</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">size_t</span> n1,</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordtype">size_t</span> n2,</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordtype">size_t</span> nwords,</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  hamdis_t * __restrict dis)</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> {</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordtype">size_t</span> i, j;</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  n1 *= nwords;</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  n2 *= nwords;</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">for</span> (i = 0; i < n1; i+=nwords) {</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">const</span> uint64_t * bs1_ = bs1+i;</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">for</span> (j = 0; j < n2; j+=nwords)</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  dis[j] = hamming (bs1_, bs2+j, nwords);</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> }</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment">/* Count number of matches given a max threshold */</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="keyword">template</span> <<span class="keywordtype">size_t</span> nbits></div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="keywordtype">void</span> hamming_count_thres (</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> uint64_t * bs1,</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keyword">const</span> uint64_t * bs2,</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">size_t</span> n1,</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordtype">size_t</span> n2,</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  hamdis_t ht,</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordtype">size_t</span> * nptr)</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> {</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nwords = nbits / 64;</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">size_t</span> i, j, posm = 0;</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">const</span> uint64_t * bs2_ = bs2;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">for</span> (i = 0; i < n1; i++) {</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  bs2 = bs2_;</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">for</span> (j = 0; j < n2; j++) {</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">/* collect the match only if this satisfies the threshold */</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (hamming <nbits> (bs1, bs2) <= ht)</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  posm++;</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  bs2 += nwords;</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  bs1 += nwords; <span class="comment">/* next signature */</span></div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  *nptr = posm;</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> }</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="keyword">template</span> <<span class="keywordtype">size_t</span> nbits></div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="keywordtype">void</span> crosshamming_count_thres (</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">const</span> uint64_t * dbs,</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordtype">size_t</span> n,</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordtype">int</span> ht,</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordtype">size_t</span> * nptr)</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> {</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nwords = nbits / 64;</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordtype">size_t</span> i, j, posm = 0;</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">const</span> uint64_t * bs1 = dbs;</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">for</span> (i = 0; i < n; i++) {</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">const</span> uint64_t * bs2 = bs1 + 2;</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">for</span> (j = i + 1; j < n; j++) {</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">/* collect the match only if this satisfies the threshold */</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">if</span> (hamming <nbits> (bs1, bs2) <= ht)</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  posm++;</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  bs2 += nwords;</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  bs1 += nwords;</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  *nptr = posm;</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> }</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="keyword">template</span> <<span class="keywordtype">size_t</span> nbits></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="keywordtype">size_t</span> match_hamming_thres (</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">const</span> uint64_t * bs1,</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">const</span> uint64_t * bs2,</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">size_t</span> n1,</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordtype">size_t</span> n2,</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordtype">int</span> ht,</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordtype">long</span> * idx,</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  hamdis_t * hams)</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> {</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nwords = nbits / 64;</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordtype">size_t</span> i, j, posm = 0;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  hamdis_t h;</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">const</span> uint64_t * bs2_ = bs2;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">for</span> (i = 0; i < n1; i++) {</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  bs2 = bs2_;</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">for</span> (j = 0; j < n2; j++) {</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">/* Here perform the real work of computing the distance */</span></div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  h = hamming <nbits> (bs1, bs2);</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">/* collect the match only if this satisfies the threshold */</span></div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">if</span> (h <= ht) {</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">/* Enough space to store another match ? */</span></div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  *idx = i; idx++;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  *idx = j; idx++;</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  *hams = h;</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  hams++;</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  posm++;</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  bs2+=nwords; <span class="comment">/* next signature */</span></div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  bs1+=nwords;</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  }</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">return</span> posm;</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> }</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> </div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment">/* Return closest neighbors w.r.t Hamming distance */</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="keyword">template</span> <<span class="keyword">class</span> HammingComputer></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="keyword">static</span></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="keywordtype">void</span> hammings_knn_hc (</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordtype">int</span> bytes_per_code,</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  int_maxheap_array_t * ha,</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">const</span> uint8_t * bs1,</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">const</span> uint8_t * bs2,</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordtype">size_t</span> n2,</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordtype">bool</span> order = <span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordtype">bool</span> init_heap = <span class="keyword">true</span>)</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span> {</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordtype">size_t</span> k = ha->k;</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (init_heap) ha->heapify ();</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span> </div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">/* The computation here does not involved any blockization, which</span></div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"> is suboptimal for many queries in parallel. */</span></div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < ha->nh; i++) {</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  HammingComputer hc (bs1 + i * bytes_per_code, bytes_per_code);</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> </div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">const</span> uint8_t * bs2_ = bs2;</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  hamdis_t dis;</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  hamdis_t * __restrict bh_val_ = ha->val + i * k;</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordtype">long</span> * __restrict bh_ids_ = ha->ids + i * k;</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordtype">size_t</span> j;</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">for</span> (j = 0; j < n2; j++, bs2_+= bytes_per_code) {</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  dis = hc.hamming (bs2_);</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">if</span> (dis < bh_val_[0]) {</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  faiss::maxheap_pop<hamdis_t> (k, bh_val_, bh_ids_);</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  faiss::maxheap_push<hamdis_t> (k, bh_val_, bh_ids_, dis, j);</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span> (order) ha->reorder ();</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> </div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment">// works faster than the template version</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="keyword">static</span></div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="keywordtype">void</span> hammings_knn_1 (</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  int_maxheap_array_t * ha,</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">const</span> uint64_t * bs1,</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">const</span> uint64_t * bs2,</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordtype">size_t</span> n2,</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordtype">bool</span> order = <span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordtype">bool</span> init_heap = <span class="keyword">true</span>)</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span> {</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nwords = 1;</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordtype">size_t</span> k = ha->k;</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (init_heap) {</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  ha->heapify ();</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  }</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < ha->nh; i++) {</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">const</span> uint64_t bs1_ = bs1 [i];</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">const</span> uint64_t * bs2_ = bs2;</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  hamdis_t dis;</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  hamdis_t * bh_val_ = ha->val + i * k;</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  hamdis_t bh_val_0 = bh_val_[0];</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordtype">long</span> * bh_ids_ = ha->ids + i * k;</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordtype">size_t</span> j;</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">for</span> (j = 0; j < n2; j++, bs2_+= nwords) {</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  dis = popcount64 (bs1_ ^ *bs2_);</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">if</span> (dis < bh_val_0) {</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  faiss::maxheap_pop<hamdis_t> (k, bh_val_, bh_ids_);</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  faiss::maxheap_push<hamdis_t> (k, bh_val_, bh_ids_, dis, j);</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  bh_val_0 = bh_val_[0];</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  }</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  }</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">if</span> (order) {</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  ha->reorder ();</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span> }</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> </div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="comment">/* Functions to maps vectors to bits. Assume proper allocation done beforehand,</span></div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="comment"> meaning that b should be be able to receive as many bits as x may produce. */</span></div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span> </div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> * dimension 0 corresponds to the least significant bit of b[0], or</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"> * equivalently to the lsb of the first byte that is stored.</span></div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="keywordtype">void</span> fvec2bitvec (<span class="keyword">const</span> <span class="keywordtype">float</span> * x, uint8_t * b, <span class="keywordtype">size_t</span> d)</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span> {</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < d; i += 8) {</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  uint8_t w = 0;</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  uint8_t mask = 1;</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordtype">int</span> nj = i + 8 <= d ? 8 : d - i;</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < nj; j++) {</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">if</span> (x[i + j] >= 0)</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  w |= mask;</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  mask <<= 1;</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  *b = w;</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  b++;</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> }</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> </div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span> </div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment">/* Same but for n vectors.</span></div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment"> Ensure that the ouptut b is byte-aligned (pad with 0s). */</span></div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="keywordtype">void</span> fvecs2bitvecs (<span class="keyword">const</span> <span class="keywordtype">float</span> * x, uint8_t * b, <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> n)</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> {</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> ncodes = ((d + 7) / 8);</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++)</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  fvec2bitvec (x + i * d, b + i * ncodes, d);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> }</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span> </div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment">/* Reverse bit (NOT a optimized function, only used for print purpose) */</span></div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="keyword">static</span> uint64_t uint64_reverse_bits (uint64_t b)</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span> {</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordtype">int</span> i;</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  uint64_t revb = 0;</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">for</span> (i = 0; i < 64; i++) {</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  revb <<= 1;</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  revb |= b & 1;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  b >>= 1;</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">return</span> revb;</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span> }</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment">/* print the bit vector */</span></div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="keywordtype">void</span> bitvec_print (<span class="keyword">const</span> uint8_t * b, <span class="keywordtype">size_t</span> d)</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> {</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordtype">size_t</span> i, j;</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">for</span> (i = 0; i < d; ) {</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  uint64_t brev = uint64_reverse_bits (* (uint64_t *) b);</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">for</span> (j = 0; j < 64 && i < d; j++, i++) {</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  printf (<span class="stringliteral">"%d"</span>, (<span class="keywordtype">int</span>) (brev & 1));</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  brev >>= 1;</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  }</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  b += 8;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  printf (<span class="stringliteral">" "</span>);</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span> }</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> </div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> </div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment">/*----------------------------------------*/</span></div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment">/* Hamming distance computation and k-nn */</span></div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="preprocessor">#define C64(x) ((uint64_t *)x)</span></div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="preprocessor"></span></div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment">/* Compute a set of Hamming distances */</span></div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="keywordtype">void</span> hammings (</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keyword">const</span> uint8_t * a,</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keyword">const</span> uint8_t * b,</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordtype">size_t</span> na, <span class="keywordtype">size_t</span> nb,</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordtype">size_t</span> ncodes,</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  hamdis_t * __restrict dis)</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span> {</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  FAISS_ASSERT (ncodes % 8 == 0);</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">switch</span> (ncodes) {</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordflow">case</span> 8:</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  faiss::hammings <64> (C64(a), C64(b), na, nb, dis); <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">case</span> 16:</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  faiss::hammings <128> (C64(a), C64(b), na, nb, dis); <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">case</span> 32:</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  faiss::hammings <256> (C64(a), C64(b), na, nb, dis); <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">case</span> 64:</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  faiss::hammings <512> (C64(a), C64(b), na, nb, dis); <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="namespacefaiss.html#a0832c5ab58f4d1a340b0bde273c5b501">faiss::hammings</a> (C64(a), C64(b), na, nb, ncodes * 8, dis); <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  }</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> }</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span> </div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span> </div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="keywordtype">void</span> hammings_knn_core (</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  int_maxheap_array_t * ha,</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keyword">const</span> uint8_t * a,</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keyword">const</span> uint8_t * b,</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordtype">size_t</span> nb,</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordtype">size_t</span> ncodes)</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span> {</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  FAISS_ASSERT (ncodes % 8 == 0);</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span> </div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">switch</span> (ncodes) {</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  hammings_knn_1 (ha, C64(a), C64(b), nb, <span class="keyword">false</span>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="comment">// hammings_knn_hc<faiss::HammingComputer8></span></div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">// (8, ha, a, b, nb, false, true);</span></div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">case</span> 16:</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  hammings_knn_hc<faiss::HammingComputer16></div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  (16, ha, a, b, nb, <span class="keyword">false</span>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">case</span> 32:</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  hammings_knn_hc<faiss::HammingComputer32></div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  (32, ha, a, b, nb, <span class="keyword">false</span>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  hammings_knn_hc<faiss::HammingComputerM8></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  (ncodes, ha, a, b, nb, <span class="keyword">false</span>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  }</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span> }</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span> </div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"><a class="line" href="namespacefaiss.html#ac0b4dc73a8470d61f510396dc460ca18"> 475</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#ac0b4dc73a8470d61f510396dc460ca18">hammings_knn</a> (</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <a class="code" href="structfaiss_1_1HeapArray.html">int_maxheap_array_t</a> * ha,</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keyword">const</span> uint8_t * a,</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keyword">const</span> uint8_t * b,</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordtype">size_t</span> nb,</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordtype">size_t</span> ncodes,</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordtype">int</span> order)</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span> {</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">switch</span> (ncodes) {</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordflow">case</span> 4:</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  hammings_knn_hc<faiss::HammingComputer4></div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  (4, ha, a, b, nb, order, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">case</span> 8:</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  hammings_knn_1 (ha, C64(a), C64(b), nb, order, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="comment">// hammings_knn_hc<faiss::HammingComputer8></span></div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="comment">// (8, ha, a, b, nb, order, true);</span></div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">case</span> 16:</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  hammings_knn_hc<faiss::HammingComputer16></div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  (16, ha, a, b, nb, order, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">case</span> 32:</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  hammings_knn_hc<faiss::HammingComputer32></div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  (32, ha, a, b, nb, order, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  FAISS_ASSERT (ncodes % 8 == 0);</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  hammings_knn_hc<faiss::HammingComputerM8></div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  (ncodes, ha, a, b, nb, order, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span> </div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span> }</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span> </div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span> </div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span> </div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span> <span class="comment">/* Count number of matches given a max threshold */</span></div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="keywordtype">void</span> hamming_count_thres (</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keyword">const</span> uint8_t * bs1,</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keyword">const</span> uint8_t * bs2,</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordtype">size_t</span> n1,</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordtype">size_t</span> n2,</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  hamdis_t ht,</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordtype">size_t</span> ncodes,</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordtype">size_t</span> * nptr)</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span> {</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">switch</span> (ncodes) {</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">case</span> 8:</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  faiss::hamming_count_thres <64> (C64(bs1), C64(bs2),</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  n1, n2, ht, nptr);</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">case</span> 16:</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  faiss::hamming_count_thres <128> (C64(bs1), C64(bs2),</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  n1, n2, ht, nptr);</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">case</span> 32:</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  faiss::hamming_count_thres <256> (C64(bs1), C64(bs2),</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  n1, n2, ht, nptr);</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordflow">case</span> 64:</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  faiss::hamming_count_thres <512> (C64(bs1), C64(bs2),</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  n1, n2, ht, nptr);</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  FAISS_ASSERT (!<span class="stringliteral">"not-implemented for this number of bits"</span>);</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  }</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span> }</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span> </div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span> <span class="comment">/* Count number of cross-matches given a threshold */</span></div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span> <span class="keywordtype">void</span> crosshamming_count_thres (</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">const</span> uint8_t * dbs,</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordtype">size_t</span> n,</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  hamdis_t ht,</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordtype">size_t</span> ncodes,</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keywordtype">size_t</span> * nptr)</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span> {</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordflow">switch</span> (ncodes) {</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">case</span> 8:</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  faiss::crosshamming_count_thres <64> (C64(dbs), n, ht, nptr);</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">case</span> 16:</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  faiss::crosshamming_count_thres <128> (C64(dbs), n, ht, nptr);</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">case</span> 32:</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  faiss::crosshamming_count_thres <256> (C64(dbs), n, ht, nptr);</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordflow">case</span> 64:</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  faiss::crosshamming_count_thres <512> (C64(dbs), n, ht, nptr);</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  FAISS_ASSERT (!<span class="stringliteral">"not-implemented for this number of bits"</span>);</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  }</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span> }</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span> </div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span> </div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="comment">/* Returns all matches given a threshold */</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="keywordtype">size_t</span> match_hamming_thres (</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">const</span> uint8_t * bs1,</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keyword">const</span> uint8_t * bs2,</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordtype">size_t</span> n1,</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordtype">size_t</span> n2,</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  hamdis_t ht,</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordtype">size_t</span> ncodes,</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordtype">long</span> * idx,</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  hamdis_t * dis)</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span> {</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">switch</span> (ncodes) {</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">case</span> 8:</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">return</span> faiss::match_hamming_thres <64> (C64(bs1), C64(bs2),</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  n1, n2, ht, idx, dis);</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">case</span> 16:</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">return</span> faiss::match_hamming_thres <128> (C64(bs1), C64(bs2),</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  n1, n2, ht, idx, dis);</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">case</span> 32:</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">return</span> faiss::match_hamming_thres <256> (C64(bs1), C64(bs2),</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  n1, n2, ht, idx, dis);</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">case</span> 64:</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">return</span> faiss::match_hamming_thres <512> (C64(bs1), C64(bs2),</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  n1, n2, ht, idx, dis);</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  FAISS_ASSERT (!<span class="stringliteral">"not-implemented for this number of bits"</span>);</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  }</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span> }</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span> </div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="preprocessor">#undef C64</span></div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="preprocessor"></span></div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span> </div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span> </div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment">/*************************************</span></div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> * generalized Hamming distances</span></div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment"> ************************************/</span></div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> </div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> </div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span> <span class="keyword">template</span> <<span class="keyword">class</span> HammingComputer></div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="keyword">static</span> <span class="keywordtype">void</span> hamming_dis_inner_loop (</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keyword">const</span> uint8_t *ca,</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keyword">const</span> uint8_t *cb,</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordtype">size_t</span> nb,</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordtype">size_t</span> code_size,</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordtype">int</span> k,</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  hamdis_t * bh_val_,</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordtype">long</span> * bh_ids_)</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span> {</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span> </div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  HammingComputer hc (ca, code_size);</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span> </div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nb; j++) {</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordtype">int</span> ndiff = hc.hamming (cb);</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  cb += code_size;</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">if</span> (ndiff < bh_val_[0]) {</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  maxheap_pop<hamdis_t> (k, bh_val_, bh_ids_);</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  maxheap_push<hamdis_t> (k, bh_val_, bh_ids_, ndiff, j);</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  }</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  }</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span> }</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span> </div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"><a class="line" href="namespacefaiss.html#ae81da42f6f40356f7525917b3acb54c8"> 635</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#ae81da42f6f40356f7525917b3acb54c8">generalized_hammings_knn</a> (</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <a class="code" href="structfaiss_1_1HeapArray.html">int_maxheap_array_t</a> * ha,</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keyword">const</span> uint8_t * a,</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keyword">const</span> uint8_t * b,</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordtype">size_t</span> nb,</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordtype">size_t</span> code_size,</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordtype">int</span> ordered)</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span> {</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordtype">int</span> na = ha-><a class="code" href="structfaiss_1_1HeapArray.html#aad477a3907c3496159eaf4b375be4432">nh</a>;</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordtype">int</span> k = ha-><a class="code" href="structfaiss_1_1HeapArray.html#a1ee98429c766c77235f78c6d9aa32bb4">k</a>;</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span> </div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keywordflow">if</span> (ordered)</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  ha-><a class="code" href="structfaiss_1_1HeapArray.html#a48afc496c73e982b8e10fde786628292">heapify</a> ();</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span> </div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < na; i++) {</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keyword">const</span> uint8_t *ca = a + i * code_size;</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keyword">const</span> uint8_t *cb = b;</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span> </div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  hamdis_t * bh_val_ = ha-><a class="code" href="structfaiss_1_1HeapArray.html#a4b131abb659e7d0ee315223270deac53">val</a> + i * k;</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordtype">long</span> * bh_ids_ = ha-><a class="code" href="structfaiss_1_1HeapArray.html#a22332dd179ce70e379addeaa47246cc2">ids</a> + i * k;</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span> </div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">switch</span> (code_size) {</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordflow">case</span> 8:</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  hamming_dis_inner_loop<GenHammingComputer8></div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  (ca, cb, nb, 8, k, bh_val_, bh_ids_);</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">case</span> 16:</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  hamming_dis_inner_loop<GenHammingComputer16></div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  (ca, cb, nb, 16, k, bh_val_, bh_ids_);</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keywordflow">case</span> 32:</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  hamming_dis_inner_loop<GenHammingComputer32></div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  (ca, cb, nb, 32, k, bh_val_, bh_ids_);</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  hamming_dis_inner_loop<GenHammingComputerM8></div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  (ca, cb, nb, code_size, k, bh_val_, bh_ids_);</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  }</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  }</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span> </div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keywordflow">if</span> (ordered)</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  ha-><a class="code" href="structfaiss_1_1HeapArray.html#a3c686b3cc0594e6a284fa3a595bebdec">reorder</a> ();</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span> </div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span> }</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span> </div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span> </div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span> </div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span> </div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span> </div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span> } <span class="comment">// namespace faiss</span></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_a1ee98429c766c77235f78c6d9aa32bb4"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#a1ee98429c766c77235f78c6d9aa32bb4">faiss::HeapArray::k</a></div><div class="ttdeci">size_t k</div><div class="ttdoc">allocated size per heap </div><div class="ttdef"><b>Definition:</b> <a href="Heap_8h_source.html#l00356">Heap.h:356</a></div></div>
|
|
<div class="ttc" id="namespacefaiss_html_ae81da42f6f40356f7525917b3acb54c8"><div class="ttname"><a href="namespacefaiss.html#ae81da42f6f40356f7525917b3acb54c8">faiss::generalized_hammings_knn</a></div><div class="ttdeci">void generalized_hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t code_size, int ordered)</div><div class="ttdef"><b>Definition:</b> <a href="hamming_8cpp_source.html#l00635">hamming.cpp:635</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_a3c686b3cc0594e6a284fa3a595bebdec"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#a3c686b3cc0594e6a284fa3a595bebdec">faiss::HeapArray::reorder</a></div><div class="ttdeci">void reorder()</div><div class="ttdoc">reorder all the heaps </div><div class="ttdef"><b>Definition:</b> <a href="Heap_8cpp_source.html#l00035">Heap.cpp:35</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html"><div class="ttname"><a href="structfaiss_1_1HeapArray.html">faiss::HeapArray</a></div><div class="ttdef"><b>Definition:</b> <a href="Heap_8h_source.html#l00351">Heap.h:351</a></div></div>
|
|
<div class="ttc" id="namespacefaiss_html_ac0b4dc73a8470d61f510396dc460ca18"><div class="ttname"><a href="namespacefaiss.html#ac0b4dc73a8470d61f510396dc460ca18">faiss::hammings_knn</a></div><div class="ttdeci">void hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t ncodes, int order)</div><div class="ttdef"><b>Definition:</b> <a href="hamming_8cpp_source.html#l00475">hamming.cpp:475</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_a22332dd179ce70e379addeaa47246cc2"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#a22332dd179ce70e379addeaa47246cc2">faiss::HeapArray::ids</a></div><div class="ttdeci">TI * ids</div><div class="ttdoc">identifiers (size nh * k) </div><div class="ttdef"><b>Definition:</b> <a href="Heap_8h_source.html#l00357">Heap.h:357</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_a48afc496c73e982b8e10fde786628292"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#a48afc496c73e982b8e10fde786628292">faiss::HeapArray::heapify</a></div><div class="ttdeci">void heapify()</div><div class="ttdoc">prepare all the heaps before adding </div><div class="ttdef"><b>Definition:</b> <a href="Heap_8cpp_source.html#l00027">Heap.cpp:27</a></div></div>
|
|
<div class="ttc" id="namespacefaiss_html_a0832c5ab58f4d1a340b0bde273c5b501"><div class="ttname"><a href="namespacefaiss.html#a0832c5ab58f4d1a340b0bde273c5b501">faiss::hammings</a></div><div class="ttdeci">void hammings(const uint8_t *a, const uint8_t *b, size_t na, size_t nb, size_t nbytespercode, hamdis_t *dis)</div></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_a4b131abb659e7d0ee315223270deac53"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#a4b131abb659e7d0ee315223270deac53">faiss::HeapArray::val</a></div><div class="ttdeci">T * val</div><div class="ttdoc">values (distances or similarities), size nh * k </div><div class="ttdef"><b>Definition:</b> <a href="Heap_8h_source.html#l00358">Heap.h:358</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_aad477a3907c3496159eaf4b375be4432"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#aad477a3907c3496159eaf4b375be4432">faiss::HeapArray::nh</a></div><div class="ttdeci">size_t nh</div><div class="ttdoc">number of heaps </div><div class="ttdef"><b>Definition:</b> <a href="Heap_8h_source.html#l00355">Heap.h:355</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated by  <a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/>
|
|
</a> 1.8.5
|
|
</small></address>
|
|
</body>
|
|
</html>
|