2406 lines
358 KiB
HTML
2406 lines
358 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: /data/users/matthijs/github_faiss/faiss/IndexHNSW.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">/data/users/matthijs/github_faiss/faiss/IndexHNSW.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"> * Copyright (c) 2015-present, Facebook, Inc.</span></div>
|
||
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * All rights reserved.</span></div>
|
||
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> *</span></div>
|
||
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * This source code is licensed under the BSD+Patents license found in the</span></div>
|
||
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * LICENSE file in the root directory of this source tree.</span></div>
|
||
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> */</span></div>
|
||
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div>
|
||
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include "IndexHNSW.h"</span></div>
|
||
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div>
|
||
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div>
|
||
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include <cstdlib></span></div>
|
||
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include <cassert></span></div>
|
||
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <cstring></span></div>
|
||
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include <cstdio></span></div>
|
||
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <cmath></span></div>
|
||
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <omp.h></span></div>
|
||
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div>
|
||
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <unordered_set></span></div>
|
||
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <queue></span></div>
|
||
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div>
|
||
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <sys/types.h></span></div>
|
||
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <sys/stat.h></span></div>
|
||
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <unistd.h></span></div>
|
||
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <stdint.h></span></div>
|
||
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div>
|
||
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <immintrin.h></span></div>
|
||
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div>
|
||
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "utils.h"</span></div>
|
||
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "Heap.h"</span></div>
|
||
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "FaissAssert.h"</span></div>
|
||
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "IndexFlat.h"</span></div>
|
||
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "IndexIVFPQ.h"</span></div>
|
||
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</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="keyword">extern</span> <span class="stringliteral">"C"</span> {</div>
|
||
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div>
|
||
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">/* declare BLAS functions, see http://www.netlib.org/clapack/cblas/ */</span></div>
|
||
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div>
|
||
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="keywordtype">int</span> sgemm_ (<span class="keyword">const</span> <span class="keywordtype">char</span> *transa, <span class="keyword">const</span> <span class="keywordtype">char</span> *transb, FINTEGER *m, FINTEGER *</div>
|
||
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  n, FINTEGER *k, <span class="keyword">const</span> <span class="keywordtype">float</span> *alpha, <span class="keyword">const</span> <span class="keywordtype">float</span> *a,</div>
|
||
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  FINTEGER *lda, <span class="keyword">const</span> <span class="keywordtype">float</span> *b, FINTEGER *</div>
|
||
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  ldb, <span class="keywordtype">float</span> *beta, <span class="keywordtype">float</span> *c, FINTEGER *ldc);</div>
|
||
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div>
|
||
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> }</div>
|
||
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div>
|
||
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">namespace </span>faiss {</div>
|
||
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div>
|
||
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * Auxiliary structures</span></div>
|
||
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">/// set implementation optimized for fast access.</span></div>
|
||
|
|
<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="structfaiss_1_1VisitedTable.html"> 54</a></span> <span class="comment"></span><span class="keyword">struct </span><a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> {</div>
|
||
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  std::vector<uint8_t> visited;</div>
|
||
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordtype">int</span> visno;</div>
|
||
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div>
|
||
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a>(<span class="keywordtype">int</span> size):</div>
|
||
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  visited(size), visno(1)</div>
|
||
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  {}<span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> /// set flog #no to true</span></div>
|
||
|
|
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853"> 62</a></span> <span class="comment"></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853">set</a>(<span class="keywordtype">int</span> no) {</div>
|
||
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  visited[no] = visno;</div>
|
||
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }<span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> /// get flag #no</span></div>
|
||
|
|
<div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="structfaiss_1_1VisitedTable.html#a18a972137362ff04a38943d66fc19dcb"> 66</a></span> <span class="comment"></span> <span class="keywordtype">bool</span> <span class="keyword">get</span>(<span class="keywordtype">int</span> no) <span class="keyword">const</span> {</div>
|
||
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">return</span> visited[no] == visno;</div>
|
||
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }<span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> /// reset all flags to false</span></div>
|
||
|
|
<div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446"> 70</a></span> <span class="comment"></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a>() {</div>
|
||
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  visno++;</div>
|
||
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">if</span> (visno == 250) {</div>
|
||
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// 250 rather than 255 because sometimes we use visno and visno+1</span></div>
|
||
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  memset (visited.data(), 0, <span class="keyword">sizeof</span>(visited[0]) * visited.size());</div>
|
||
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  visno = 1;</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> };</div>
|
||
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div>
|
||
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div>
|
||
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">namespace </span>{</div>
|
||
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div>
|
||
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">typedef</span> <a class="code" href="structfaiss_1_1HNSW.html#a153fa41ad41a4905aa60683360a3cdf0">HNSW::idx_t</a> idx_t;</div>
|
||
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="keyword">typedef</span> <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">HNSW::storage_idx_t</a> storage_idx_t;</div>
|
||
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="keyword">typedef</span> HNSW::DistanceComputer DistanceComputer;</div>
|
||
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// typedef ::faiss::VisitedTable VisitedTable;</span></div>
|
||
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">/// to sort pairs of (id, distance) from nearest to fathest or the reverse</span></div>
|
||
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"></span><span class="keyword">struct </span>NodeDistCloser {</div>
|
||
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordtype">float</span> d;</div>
|
||
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordtype">int</span> id;</div>
|
||
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  NodeDistCloser(<span class="keywordtype">float</span> d, <span class="keywordtype">int</span> <span class="keywordtype">id</span>): d(d), id(id) {}</div>
|
||
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> NodeDistCloser &obj1)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> d < obj1.d; }</div>
|
||
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> };</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="keyword">struct </span>NodeDistFarther {</div>
|
||
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordtype">float</span> d;</div>
|
||
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordtype">int</span> id;</div>
|
||
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  NodeDistFarther(<span class="keywordtype">float</span> d, <span class="keywordtype">int</span> <span class="keywordtype">id</span>): d(d), id(id) {}</div>
|
||
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> NodeDistFarther &obj1)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> d > obj1.d; }</div>
|
||
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> };</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="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">/** Heap structure that allows fast */</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> <span class="keyword">struct </span>MinimaxHeap {</div>
|
||
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">int</span> n;</div>
|
||
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordtype">int</span> k;</div>
|
||
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordtype">int</span> nvalid;</div>
|
||
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div>
|
||
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::vector<storage_idx_t> ids;</div>
|
||
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  std::vector<float> dis;</div>
|
||
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">typedef</span> <a class="code" href="structfaiss_1_1CMax.html">faiss::CMax<float, storage_idx_t></a> HC;</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>  <span class="keyword">explicit</span> MinimaxHeap(<span class="keywordtype">int</span> n): n(n), k(0), nvalid(0), ids(n), dis(n) {}</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="keywordtype">void</span> push(storage_idx_t i, <span class="keywordtype">float</span> v)</div>
|
||
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  {</div>
|
||
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (k == n) {</div>
|
||
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (v >= dis[0]) <span class="keywordflow">return</span>;</div>
|
||
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  faiss::heap_pop<HC> (k--, dis.data(), ids.data());</div>
|
||
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  nvalid--;</div>
|
||
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</div>
|
||
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  faiss::heap_push<HC> (++k, dis.data(), ids.data(), v, i);</div>
|
||
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  nvalid++;</div>
|
||
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div>
|
||
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div>
|
||
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordtype">float</span> max()<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">return</span> dis[0];</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> </div>
|
||
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordtype">int</span> size()<span class="keyword"> const </span>{<span class="keywordflow">return</span> nvalid;}</div>
|
||
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div>
|
||
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordtype">void</span> clear() {nvalid = k = 0; }</div>
|
||
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div>
|
||
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordtype">int</span> pop_min(<span class="keywordtype">float</span> *vmin_out = <span class="keyword">nullptr</span>)</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>  assert(k > 0);</div>
|
||
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// returns min. This is an O(n) operation</span></div>
|
||
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordtype">int</span> i = k - 1;</div>
|
||
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">while</span> (i >= 0) {</div>
|
||
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">if</span> (ids[i] != -1) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  i--;</div>
|
||
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div>
|
||
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span> (i == -1) <span class="keywordflow">return</span> -1;</div>
|
||
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordtype">int</span> imin = i;</div>
|
||
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordtype">float</span> vmin = dis[i];</div>
|
||
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  i--;</div>
|
||
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">while</span>(i >= 0) {</div>
|
||
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (ids[i] != -1 && dis[i] < vmin) {</div>
|
||
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  vmin = dis[i];</div>
|
||
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  imin = i;</div>
|
||
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
|
||
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  i--;</div>
|
||
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div>
|
||
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (vmin_out) *vmin_out = vmin;</div>
|
||
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordtype">int</span> ret = ids[imin];</div>
|
||
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  ids[imin] = -1;</div>
|
||
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  nvalid --;</div>
|
||
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">return</span> ret;</div>
|
||
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div>
|
||
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div>
|
||
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">int</span> count_below(<span class="keywordtype">float</span> thresh) {</div>
|
||
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordtype">float</span> n_below = 0;</div>
|
||
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i < k; i++) {</div>
|
||
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (dis[i] < thresh)</div>
|
||
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  n_below++;</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>  <span class="keywordflow">return</span> n_below;</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> };</div>
|
||
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div>
|
||
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div>
|
||
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> * Addition subroutines</span></div>
|
||
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment">/** Enumerate vertices from farthest to nearest from query, keep a</span></div>
|
||
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> * neighbor only if there is no previous neighbor that is closer to</span></div>
|
||
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * that vertex than the query.</span></div>
|
||
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> */</span></div>
|
||
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="keywordtype">void</span> shrink_neighbor_list(DistanceComputer & qdis,</div>
|
||
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  std::priority_queue<NodeDistFarther> &input,</div>
|
||
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  std::vector<NodeDistFarther> &output,</div>
|
||
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordtype">int</span> max_size)</div>
|
||
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span> {</div>
|
||
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">while</span> (input.size() > 0) {</div>
|
||
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  NodeDistFarther v1 = input.top();</div>
|
||
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  input.pop();</div>
|
||
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordtype">float</span> dist_v1_q = v1.d;</div>
|
||
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div>
|
||
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordtype">bool</span> good = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">for</span> (NodeDistFarther v2 : output) {</div>
|
||
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordtype">float</span> dist_v1_v2 = qdis.symmetric_dis(v2.id, v1.id);</div>
|
||
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div>
|
||
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (dist_v1_v2 < dist_v1_q) {</div>
|
||
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  good = <span class="keyword">false</span>;</div>
|
||
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div>
|
||
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div>
|
||
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (good) {</div>
|
||
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  output.push_back(v1);</div>
|
||
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">if</span> (output.size() >= max_size)</div>
|
||
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">return</span>;</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>  }</div>
|
||
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> }</div>
|
||
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> </div>
|
||
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div>
|
||
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> </div>
|
||
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment">/// remove neighbors from the list to make it smaller than max_size</span></div>
|
||
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"></span><span class="keywordtype">void</span> shrink_neighbor_list(DistanceComputer & qdis,</div>
|
||
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  std::priority_queue<NodeDistCloser> &resultSet1,</div>
|
||
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordtype">int</span> max_size)</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> </div>
|
||
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">if</span> (resultSet1.size() < max_size) {</div>
|
||
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">return</span>;</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>  std::priority_queue<NodeDistFarther> resultSet;</div>
|
||
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  std::vector<NodeDistFarther> returnlist;</div>
|
||
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div>
|
||
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">while</span> (resultSet1.size() > 0) {</div>
|
||
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  resultSet.emplace(resultSet1.top().d, resultSet1.top().id);</div>
|
||
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  resultSet1.pop();</div>
|
||
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div>
|
||
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div>
|
||
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  shrink_neighbor_list (qdis, resultSet, returnlist, max_size);</div>
|
||
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div>
|
||
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (NodeDistFarther curen2 : returnlist) {</div>
|
||
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  resultSet1.emplace(curen2.d, curen2.id);</div>
|
||
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div>
|
||
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div>
|
||
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> }</div>
|
||
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div>
|
||
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment">/// add a link between two elements, possibly shrinking the list</span></div>
|
||
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment">/// of links to make room for it.</span></div>
|
||
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"></span><span class="keywordtype">void</span> add_link(HNSW & hnsw,</div>
|
||
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  DistanceComputer & qdis,</div>
|
||
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  storage_idx_t src, storage_idx_t dest,</div>
|
||
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordtype">int</span> level)</div>
|
||
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> {</div>
|
||
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  hnsw.neighbor_range(src, level, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">if</span> (hnsw.neighbors[end - 1] == -1) {</div>
|
||
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">// there is enough room, find a slot to add it</span></div>
|
||
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordtype">size_t</span> i = end;</div>
|
||
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">while</span>(i > begin) {</div>
|
||
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">if</span> (hnsw.neighbors[i - 1] != -1) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  i--;</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>  hnsw.neighbors[i] = dest;</div>
|
||
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">return</span>;</div>
|
||
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</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>  <span class="comment">// otherwise we let them fight out which to keep</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">// copy to resultSet...</span></div>
|
||
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  std::priority_queue<NodeDistCloser> resultSet;</div>
|
||
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  resultSet.emplace(qdis.symmetric_dis(src, dest), dest);</div>
|
||
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = begin; i < end; i++) { <span class="comment">// HERE WAS THE BUG</span></div>
|
||
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  storage_idx_t neigh = hnsw.neighbors[i];</div>
|
||
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  resultSet.emplace(qdis.symmetric_dis(src, neigh), neigh);</div>
|
||
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  }</div>
|
||
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div>
|
||
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  shrink_neighbor_list(qdis, resultSet, end - begin);</div>
|
||
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> </div>
|
||
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// ...and back</span></div>
|
||
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordtype">size_t</span> i = begin;</div>
|
||
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">while</span> (resultSet.size()) {</div>
|
||
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  hnsw.neighbors[i++] = resultSet.top().id;</div>
|
||
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  resultSet.pop();</div>
|
||
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div>
|
||
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// they may have shrunk more than just by 1 element</span></div>
|
||
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">while</span>(i < end) {</div>
|
||
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  hnsw.neighbors[i++] = -1;</div>
|
||
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div>
|
||
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> }</div>
|
||
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment">/// search neighbors on a single level, starting from an entry point</span></div>
|
||
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment"></span><span class="keywordtype">void</span> search_neighbors_to_add(HNSW & hnsw,</div>
|
||
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  DistanceComputer &qdis,</div>
|
||
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  std::priority_queue<NodeDistCloser> &results,</div>
|
||
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordtype">int</span> entry_point,</div>
|
||
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordtype">float</span> d_entry_point,</div>
|
||
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordtype">int</span> level,</div>
|
||
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  VisitedTable &vt)</div>
|
||
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> {</div>
|
||
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// top is nearest candidate</span></div>
|
||
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  std::priority_queue<NodeDistFarther> candidates;</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>  NodeDistFarther ev(d_entry_point, entry_point);</div>
|
||
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  candidates.push(ev);</div>
|
||
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  results.emplace(d_entry_point, entry_point);</div>
|
||
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  vt.set(entry_point);</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>  <span class="keywordflow">while</span> (!candidates.empty()) {</div>
|
||
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// get nearest</span></div>
|
||
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">const</span> NodeDistFarther &currEv = candidates.top();</div>
|
||
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div>
|
||
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">if</span> (currEv.d > results.top().d) {</div>
|
||
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div>
|
||
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordtype">int</span> currNode = currEv.id;</div>
|
||
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  candidates.pop();</div>
|
||
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span> </div>
|
||
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// loop over neighbors</span></div>
|
||
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  hnsw.neighbor_range(currNode, level, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = begin; i < end; i++) {</div>
|
||
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  storage_idx_t nodeId = hnsw.neighbors[i];</div>
|
||
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">if</span> (nodeId < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (vt.get(nodeId)) <span class="keywordflow">continue</span>;</div>
|
||
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  vt.set(nodeId);</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>  <span class="keywordtype">float</span> dis = qdis(nodeId);</div>
|
||
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  NodeDistFarther evE1(dis, nodeId);</div>
|
||
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div>
|
||
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">if</span> (results.size() < hnsw.efConstruction ||</div>
|
||
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  results.top().d > dis) {</div>
|
||
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div>
|
||
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  results.emplace(dis, nodeId);</div>
|
||
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  candidates.emplace(dis, nodeId);</div>
|
||
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span> (results.size() > hnsw.efConstruction) {</div>
|
||
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  results.pop();</div>
|
||
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  }</div>
|
||
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  }</div>
|
||
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  }</div>
|
||
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  }</div>
|
||
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  vt.advance();</div>
|
||
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span> }</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> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment">/// Finds neighbors and builds links with them, starting from an entry</span></div>
|
||
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="comment">/// point. The own neighbor list is assumed to be locked.</span></div>
|
||
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"></span><span class="keywordtype">void</span> add_links_starting_from(HNSW & hnsw,</div>
|
||
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  DistanceComputer &ptdis,</div>
|
||
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  storage_idx_t pt_id,</div>
|
||
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  storage_idx_t nearest,</div>
|
||
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordtype">float</span> d_nearest,</div>
|
||
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordtype">int</span> level,</div>
|
||
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  omp_lock_t * locks,</div>
|
||
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  VisitedTable &vt)</div>
|
||
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</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>  std::priority_queue<NodeDistCloser> link_targets;</div>
|
||
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div>
|
||
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  search_neighbors_to_add(</div>
|
||
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  hnsw, ptdis, link_targets, nearest, d_nearest,</div>
|
||
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  level, vt);</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="comment">// but we can afford only this many neighbors</span></div>
|
||
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordtype">int</span> M = hnsw.nb_neighbors(level);</div>
|
||
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div>
|
||
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  shrink_neighbor_list(ptdis, link_targets, M);</div>
|
||
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div>
|
||
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">while</span> (!link_targets.empty()) {</div>
|
||
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordtype">int</span> other_id = link_targets.top().id;</div>
|
||
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span> </div>
|
||
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  omp_set_lock(&locks[other_id]);</div>
|
||
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  add_link(hnsw, ptdis, other_id, pt_id, level);</div>
|
||
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  omp_unset_lock(&locks[other_id]);</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>  add_link(hnsw, ptdis, pt_id, other_id, level);</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>  link_targets.pop();</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> }</div>
|
||
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> </div>
|
||
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment"> * Searching subroutines</span></div>
|
||
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment">/// greedily update a nearest vector at a given level</span></div>
|
||
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment"></span><span class="keywordtype">void</span> greedy_update_nearest(<span class="keyword">const</span> HNSW & hnsw,</div>
|
||
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  DistanceComputer & qdis,</div>
|
||
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordtype">int</span> level,</div>
|
||
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  storage_idx_t & nearest,</div>
|
||
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordtype">float</span> & d_nearest)</div>
|
||
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span> {</div>
|
||
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">for</span>(;;) {</div>
|
||
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  storage_idx_t prev_nearest = nearest;</div>
|
||
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span> </div>
|
||
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  hnsw.neighbor_range(nearest, level, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = begin; i < end; i++) {</div>
|
||
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  storage_idx_t v = hnsw.neighbors[i];</div>
|
||
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">if</span> (v < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordtype">float</span> dis = qdis(v);</div>
|
||
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">if</span> (dis < d_nearest) {</div>
|
||
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  nearest = v;</div>
|
||
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  d_nearest = dis;</div>
|
||
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  }</div>
|
||
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div>
|
||
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">if</span> (nearest == prev_nearest) {</div>
|
||
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">return</span>;</div>
|
||
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div>
|
||
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div>
|
||
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div>
|
||
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span> }</div>
|
||
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div>
|
||
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment">/** Do a BFS on the candidates list */</span></div>
|
||
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span> </div>
|
||
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="keywordtype">int</span> search_from_candidates(<span class="keyword">const</span> HNSW & hnsw,</div>
|
||
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  DistanceComputer & qdis, <span class="keywordtype">int</span> k,</div>
|
||
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  idx_t *I, <span class="keywordtype">float</span> * D,</div>
|
||
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  MinimaxHeap &candidates,</div>
|
||
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  VisitedTable &vt,</div>
|
||
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordtype">int</span> level, <span class="keywordtype">int</span> nres_in = 0)</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="keywordtype">int</span> nres = nres_in;</div>
|
||
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordtype">int</span> ndis = 0;</div>
|
||
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < candidates.size(); i++) {</div>
|
||
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  idx_t v1 = candidates.ids[i];</div>
|
||
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordtype">float</span> d = candidates.dis[i];</div>
|
||
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  FAISS_ASSERT(v1 >= 0);</div>
|
||
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">if</span> (nres < k) {</div>
|
||
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  faiss::maxheap_push (++nres, D, I, d, v1);</div>
|
||
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d < D[0]) {</div>
|
||
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  faiss::maxheap_pop (nres--, D, I);</div>
|
||
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  faiss::maxheap_push (++nres, D, I, d, v1);</div>
|
||
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div>
|
||
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  vt.set(v1);</div>
|
||
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</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>  <span class="keywordtype">bool</span> do_dis_check = hnsw.check_relative_distance;</div>
|
||
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordtype">int</span> nstep = 0;</div>
|
||
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> </div>
|
||
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordflow">while</span> (candidates.size() > 0) {</div>
|
||
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordtype">float</span> d0 = 0;</div>
|
||
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordtype">int</span> v0 = candidates.pop_min(&d0);</div>
|
||
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div>
|
||
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">if</span> (do_dis_check) {</div>
|
||
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="comment">// tricky stopping condition: there are more that ef</span></div>
|
||
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">// distances that are processed already that are smaller</span></div>
|
||
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="comment">// than d0</span></div>
|
||
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span> </div>
|
||
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordtype">int</span> n_dis_below = candidates.count_below(d0);</div>
|
||
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">if</span>(n_dis_below >= hnsw.efSearch) {</div>
|
||
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">break</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>  }</div>
|
||
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  hnsw.neighbor_range(v0, level, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> </div>
|
||
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordtype">int</span> v1 = hnsw.neighbors[j];</div>
|
||
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">if</span> (v1 < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">if</span> (vt.get(v1)) {</div>
|
||
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">continue</span>;</div>
|
||
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div>
|
||
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  vt.set(v1);</div>
|
||
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  ndis++;</div>
|
||
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordtype">float</span> d = qdis(v1);</div>
|
||
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">if</span> (nres < k) {</div>
|
||
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  faiss::maxheap_push (++nres, D, I, d, v1);</div>
|
||
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d < D[0]) {</div>
|
||
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  faiss::maxheap_pop (nres--, D, I);</div>
|
||
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  faiss::maxheap_push (++nres, D, I, d, v1);</div>
|
||
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  }</div>
|
||
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  candidates.push(v1, d);</div>
|
||
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  }</div>
|
||
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> </div>
|
||
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  nstep++;</div>
|
||
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">if</span> (!do_dis_check && nstep > hnsw.efSearch) {</div>
|
||
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">break</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"> 475</span>  <span class="keywordflow">if</span> (level == 0) {</div>
|
||
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="preprocessor">#pragma omp critical</span></div>
|
||
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  hnsw_stats.n1 ++;</div>
|
||
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">if</span> (candidates.size() == 0)</div>
|
||
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  hnsw_stats.n2 ++;</div>
|
||
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  hnsw_stats.n3 += ndis;</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>  }</div>
|
||
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span> </div>
|
||
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keywordflow">return</span> nres;</div>
|
||
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span> }</div>
|
||
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div>
|
||
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span> </div>
|
||
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> } <span class="comment">// anonymous namespace</span></div>
|
||
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span> </div>
|
||
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> </div>
|
||
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment"> * HNSW structure implementation</span></div>
|
||
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> </div>
|
||
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span> </div>
|
||
|
|
<div class="line"><a name="l00497"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#ad497ea80f352c33242ba7835370c2dba"> 497</a></span> <span class="keywordtype">int</span> <a class="code" href="structfaiss_1_1HNSW.html#ad497ea80f352c33242ba7835370c2dba">HNSW::nb_neighbors</a>(<span class="keywordtype">int</span> layer_no)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">return</span> <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>[layer_no + 1] -</div>
|
||
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>[layer_no];</div>
|
||
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span> }</div>
|
||
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span> </div>
|
||
|
|
<div class="line"><a name="l00503"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#afdb5a17487296267efaaa94e6a08996d"> 503</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#afdb5a17487296267efaaa94e6a08996d">HNSW::set_nb_neighbors</a>(<span class="keywordtype">int</span> level_no, <span class="keywordtype">int</span> n)</div>
|
||
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span> {</div>
|
||
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  FAISS_THROW_IF_NOT(<a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.size() == 0);</div>
|
||
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordtype">int</span> cur_n = <a class="code" href="structfaiss_1_1HNSW.html#ad497ea80f352c33242ba7835370c2dba">nb_neighbors</a>(level_no);</div>
|
||
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = level_no + 1; i < <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>.size(); i++) {</div>
|
||
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>[i] += n - cur_n;</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"><a class="line" href="structfaiss_1_1HNSW.html#a49b512eaaa54ead77b564cad8e3e6ebd"> 512</a></span> <span class="keywordtype">int</span> <a class="code" href="structfaiss_1_1HNSW.html#a49b512eaaa54ead77b564cad8e3e6ebd">HNSW::cum_nb_neighbors</a>(<span class="keywordtype">int</span> layer_no)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">return</span> <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>[layer_no];</div>
|
||
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span> }</div>
|
||
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span> </div>
|
||
|
|
<div class="line"><a name="l00517"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d"> 517</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">HNSW::neighbor_range</a>(idx_t no, <span class="keywordtype">int</span> layer_no,</div>
|
||
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordtype">size_t</span> * begin, <span class="keywordtype">size_t</span> * end)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordtype">size_t</span> o = <a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>[no];</div>
|
||
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  *begin = o + <a class="code" href="structfaiss_1_1HNSW.html#a49b512eaaa54ead77b564cad8e3e6ebd">cum_nb_neighbors</a>(layer_no);</div>
|
||
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  *end = o + <a class="code" href="structfaiss_1_1HNSW.html#a49b512eaaa54ead77b564cad8e3e6ebd">cum_nb_neighbors</a>(layer_no + 1);</div>
|
||
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span> }</div>
|
||
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span> </div>
|
||
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span> </div>
|
||
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div>
|
||
|
|
<div class="line"><a name="l00527"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a1fc852810a2497a8eb2c41635ec05520"> 527</a></span> <a class="code" href="structfaiss_1_1HNSW.html#a1fc852810a2497a8eb2c41635ec05520">HNSW::HNSW</a>(<span class="keywordtype">int</span> M): rng(12345) {</div>
|
||
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <a class="code" href="structfaiss_1_1HNSW.html#ae7d955690da5d6376c203e81e124ba94">set_default_probas</a>(M, 1.0 / log(M));</div>
|
||
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a> = -1;</div>
|
||
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  entry_point = -1;</div>
|
||
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <a class="code" href="structfaiss_1_1HNSW.html#a6d1cb35c4220bf554af90133c71ae04f">efSearch</a> = 16;</div>
|
||
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <a class="code" href="structfaiss_1_1HNSW.html#adbf81f0b21102b942182c904892e0858">check_relative_distance</a> = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa7309dd7826761def38233c8bbbc0c63">efConstruction</a> = 40;</div>
|
||
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <a class="code" href="structfaiss_1_1HNSW.html#a857bef0db2dc0000f312cc8a95f857b2">upper_beam</a> = 1;</div>
|
||
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.push_back(0);</div>
|
||
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span> }</div>
|
||
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span> </div>
|
||
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span> </div>
|
||
|
|
<div class="line"><a name="l00539"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#aa6dfdaed7bc0ad895774315166fcb197"> 539</a></span> <span class="keywordtype">int</span> <a class="code" href="structfaiss_1_1HNSW.html#aa6dfdaed7bc0ad895774315166fcb197">HNSW::random_level</a>()</div>
|
||
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span> {</div>
|
||
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keywordtype">double</span> f = rng.<a class="code" href="structfaiss_1_1RandomGenerator.html#ac82a433d7bfa56d750907ba5cf74aed7">rand_float</a>();</div>
|
||
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// could be a bit faster with bissection</span></div>
|
||
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = 0; level < <a class="code" href="structfaiss_1_1HNSW.html#a907c94e0eca5200af1dc8d0aea482665">assign_probas</a>.size(); level++) {</div>
|
||
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">if</span> (f < <a class="code" href="structfaiss_1_1HNSW.html#a907c94e0eca5200af1dc8d0aea482665">assign_probas</a>[level]) {</div>
|
||
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">return</span> level;</div>
|
||
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  }</div>
|
||
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  f -= <a class="code" href="structfaiss_1_1HNSW.html#a907c94e0eca5200af1dc8d0aea482665">assign_probas</a>[level];</div>
|
||
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  }</div>
|
||
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">// happens with exponentially low probability</span></div>
|
||
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">return</span> <a class="code" href="structfaiss_1_1HNSW.html#a907c94e0eca5200af1dc8d0aea482665">assign_probas</a>.size() - 1;</div>
|
||
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span> }</div>
|
||
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div>
|
||
|
|
<div class="line"><a name="l00553"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#ae7d955690da5d6376c203e81e124ba94"> 553</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#ae7d955690da5d6376c203e81e124ba94">HNSW::set_default_probas</a>(<span class="keywordtype">int</span> M, <span class="keywordtype">float</span> levelMult)</div>
|
||
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span> {</div>
|
||
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordtype">int</span> nn = 0;</div>
|
||
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>.push_back (0);</div>
|
||
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = 0; ;level++) {</div>
|
||
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordtype">float</span> proba = exp(-level / levelMult) * (1 - exp(-1 / levelMult));</div>
|
||
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">if</span> (proba < 1e-9) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <a class="code" href="structfaiss_1_1HNSW.html#a907c94e0eca5200af1dc8d0aea482665">assign_probas</a>.push_back(proba);</div>
|
||
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  nn += level == 0 ? M * 2 : M;</div>
|
||
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>.push_back (nn);</div>
|
||
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div>
|
||
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span> }</div>
|
||
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span> </div>
|
||
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="keywordtype">void</span> HNSW::clear_neighbor_tables(<span class="keywordtype">int</span> level)</div>
|
||
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span> {</div>
|
||
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.size(); i++) {</div>
|
||
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, level, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++)</div>
|
||
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j] = -1;</div>
|
||
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  }</div>
|
||
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span> }</div>
|
||
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span> </div>
|
||
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span> </div>
|
||
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="keywordtype">void</span> HNSW::reset() {</div>
|
||
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a> = -1;</div>
|
||
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  entry_point = -1;</div>
|
||
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.clear();</div>
|
||
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.push_back(0);</div>
|
||
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.clear();</div>
|
||
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>.clear();</div>
|
||
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span> }</div>
|
||
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span> </div>
|
||
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span> </div>
|
||
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span> </div>
|
||
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span> <span class="keywordtype">void</span> HNSW::print_neighbor_stats(<span class="keywordtype">int</span> level)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  FAISS_THROW_IF_NOT (level < <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>.size());</div>
|
||
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  printf(<span class="stringliteral">"stats on level %d, max %d neighbors per vertex:\n"</span>,</div>
|
||
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  level, <a class="code" href="structfaiss_1_1HNSW.html#ad497ea80f352c33242ba7835370c2dba">nb_neighbors</a>(level));</div>
|
||
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordtype">size_t</span> tot_neigh = 0, tot_common = 0, tot_reciprocal = 0, n_node = 0;</div>
|
||
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="preprocessor">#pragma omp parallel for reduction(+: tot_neigh) reduction(+: tot_common) \</span></div>
|
||
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="preprocessor"> reduction(+: tot_reciprocal) reduction(+: n_node)</span></div>
|
||
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.size(); i++) {</div>
|
||
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>[i] > level) {</div>
|
||
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  n_node++;</div>
|
||
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, level, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  std::unordered_set<int> neighset;</div>
|
||
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a> [j] < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  neighset.insert(<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j]);</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="keywordtype">int</span> n_neigh = neighset.size();</div>
|
||
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordtype">int</span> n_common = 0;</div>
|
||
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keywordtype">int</span> n_reciprocal = 0;</div>
|
||
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  storage_idx_t i2 = <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
|
||
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">if</span> (i2 < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  FAISS_ASSERT(i2 != i);</div>
|
||
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordtype">size_t</span> begin2, end2;</div>
|
||
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i2, level, &begin2, &end2);</div>
|
||
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j2 = begin2; j2 < end2; j2++) {</div>
|
||
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  storage_idx_t i3 = <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j2];</div>
|
||
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">if</span> (i3 < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">if</span> (i3 == i) {</div>
|
||
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  n_reciprocal++;</div>
|
||
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordflow">continue</span>;</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>  <span class="keywordflow">if</span> (neighset.count(i3)) {</div>
|
||
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  neighset.erase(i3);</div>
|
||
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  n_common++;</div>
|
||
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  }</div>
|
||
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  }</div>
|
||
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  }</div>
|
||
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  tot_neigh += n_neigh;</div>
|
||
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  tot_common += n_common;</div>
|
||
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  tot_reciprocal += n_reciprocal;</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>  <span class="keywordtype">float</span> normalizer = n_node;</div>
|
||
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  printf(<span class="stringliteral">" nb of nodes at that level %ld\n"</span>, n_node);</div>
|
||
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  printf(<span class="stringliteral">" neighbors per node: %.2f (%ld)\n"</span>, tot_neigh / normalizer, tot_neigh);</div>
|
||
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  printf(<span class="stringliteral">" nb of reciprocal neighbors: %.2f\n"</span>, tot_reciprocal / normalizer);</div>
|
||
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  printf(<span class="stringliteral">" nb of neighbors that are also neighbor-of-neighbors: %.2f (%ld)\n"</span>,</div>
|
||
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  tot_common / normalizer, tot_common);</div>
|
||
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span> </div>
|
||
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span> </div>
|
||
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span> </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> </div>
|
||
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span> HNSWStats hnsw_stats;</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="keywordtype">void</span> HNSWStats::reset ()</div>
|
||
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span> {</div>
|
||
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  memset(<span class="keyword">this</span>, 0, <span class="keyword">sizeof</span>(*<span class="keyword">this</span>));</div>
|
||
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span> }</div>
|
||
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span> </div>
|
||
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span> </div>
|
||
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span> </div>
|
||
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span> <span class="comment"> * Building, parallel</span></div>
|
||
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span> </div>
|
||
|
|
<div class="line"><a name="l00657"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a314b809de6f329662ab09f258b49afb3"> 657</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#a314b809de6f329662ab09f258b49afb3">HNSW::add_with_locks</a>(</div>
|
||
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  DistanceComputer & ptdis, <span class="keywordtype">int</span> pt_level, <span class="keywordtype">int</span> pt_id,</div>
|
||
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  std::vector<omp_lock_t> & locks,</div>
|
||
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> &vt)</div>
|
||
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span> {</div>
|
||
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="comment">// greedy search on upper levels</span></div>
|
||
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span> </div>
|
||
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  storage_idx_t nearest;</div>
|
||
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="preprocessor">#pragma omp critical</span></div>
|
||
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  nearest = <a class="code" href="structfaiss_1_1HNSW.html#a95547d97c90b361a040bae0fb0d892b4">entry_point</a>;</div>
|
||
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span> </div>
|
||
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">if</span> (nearest == -1) {</div>
|
||
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a> = pt_level;</div>
|
||
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  entry_point = pt_id;</div>
|
||
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div>
|
||
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</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>  <span class="keywordflow">if</span> (nearest < 0) {</div>
|
||
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">return</span>;</div>
|
||
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  }</div>
|
||
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span> </div>
|
||
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  omp_set_lock(&locks[pt_id]);</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>  <span class="keywordtype">int</span> level = <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a>; <span class="comment">// level at which we start adding neighbors</span></div>
|
||
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordtype">float</span> d_nearest = ptdis(nearest);</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>  <span class="keywordflow">for</span>(; level > pt_level; level--) {</div>
|
||
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  greedy_update_nearest(*<span class="keyword">this</span>, ptdis, level, nearest, d_nearest);</div>
|
||
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  }</div>
|
||
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span> </div>
|
||
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordflow">for</span>(; level >= 0; level--) {</div>
|
||
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  add_links_starting_from(*<span class="keyword">this</span>, ptdis, pt_id, nearest, d_nearest,</div>
|
||
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  level, locks.data(), vt);</div>
|
||
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  }</div>
|
||
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span> </div>
|
||
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  omp_unset_lock(&locks[pt_id]);</div>
|
||
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span> </div>
|
||
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">if</span> (pt_level > <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a>) {</div>
|
||
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a> = pt_level;</div>
|
||
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  entry_point = pt_id;</div>
|
||
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  }</div>
|
||
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span> </div>
|
||
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span> }</div>
|
||
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span> </div>
|
||
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span> </div>
|
||
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span> </div>
|
||
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span> <span class="comment"> * Searching</span></div>
|
||
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span> </div>
|
||
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span> </div>
|
||
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span> </div>
|
||
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span> </div>
|
||
|
|
<div class="line"><a name="l00711"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a330107a5801680609932849fc9404594"> 711</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#a330107a5801680609932849fc9404594">HNSW::search</a>(DistanceComputer & qdis,</div>
|
||
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordtype">int</span> k, idx_t *I, <span class="keywordtype">float</span> * D,</div>
|
||
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> &vt)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span> </div>
|
||
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1HNSW.html#a857bef0db2dc0000f312cc8a95f857b2">upper_beam</a> == 1) {</div>
|
||
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span> </div>
|
||
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="comment">// greedy search on upper levels</span></div>
|
||
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  storage_idx_t nearest = <a class="code" href="structfaiss_1_1HNSW.html#a95547d97c90b361a040bae0fb0d892b4">entry_point</a>;</div>
|
||
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordtype">float</span> d_nearest = qdis(nearest);</div>
|
||
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span> </div>
|
||
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> level = <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a>; level >= 1; level--) {</div>
|
||
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  greedy_update_nearest(*<span class="keyword">this</span>, qdis, level, nearest, d_nearest);</div>
|
||
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  }</div>
|
||
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span> </div>
|
||
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordtype">int</span> candidates_size = std::max(<a class="code" href="structfaiss_1_1HNSW.html#a6d1cb35c4220bf554af90133c71ae04f">efSearch</a>, k);</div>
|
||
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  MinimaxHeap candidates(candidates_size);</div>
|
||
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span> </div>
|
||
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  candidates.push(nearest, d_nearest);</div>
|
||
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span> </div>
|
||
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  search_from_candidates (</div>
|
||
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  *<span class="keyword">this</span>, qdis, k, I, D, candidates, vt, 0);</div>
|
||
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a>();</div>
|
||
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div>
|
||
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  } <span class="keywordflow">else</span> {</div>
|
||
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span> </div>
|
||
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordtype">int</span> candidates_size = <a class="code" href="structfaiss_1_1HNSW.html#a857bef0db2dc0000f312cc8a95f857b2">upper_beam</a>;</div>
|
||
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  MinimaxHeap candidates(candidates_size);</div>
|
||
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span> </div>
|
||
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  std::vector<idx_t> I_to_next(candidates_size);</div>
|
||
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  std::vector<float> D_to_next(candidates_size);</div>
|
||
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span> </div>
|
||
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordtype">int</span> nres = 1;</div>
|
||
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  I_to_next[0] = <a class="code" href="structfaiss_1_1HNSW.html#a95547d97c90b361a040bae0fb0d892b4">entry_point</a>;</div>
|
||
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  D_to_next[0] = qdis(entry_point);</div>
|
||
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span> </div>
|
||
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> level = <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a>; level >= 0; level--) {</div>
|
||
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span> </div>
|
||
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="comment">// copy I, D -> candidates</span></div>
|
||
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span> </div>
|
||
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  candidates.clear();</div>
|
||
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span> </div>
|
||
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nres; i++) {</div>
|
||
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  candidates.push(I_to_next[i], D_to_next[i]);</div>
|
||
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div>
|
||
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span> </div>
|
||
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">if</span> (level == 0) {</div>
|
||
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  nres = search_from_candidates (</div>
|
||
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  *<span class="keyword">this</span>, qdis, k, I, D, candidates, vt, 0);</div>
|
||
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  } <span class="keywordflow">else</span> {</div>
|
||
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  nres = search_from_candidates (</div>
|
||
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  *<span class="keyword">this</span>, qdis, candidates_size,</div>
|
||
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  I_to_next.data(), D_to_next.data(),</div>
|
||
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  candidates, vt, level);</div>
|
||
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  }</div>
|
||
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a>();</div>
|
||
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  }</div>
|
||
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span> </div>
|
||
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  }</div>
|
||
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span> }</div>
|
||
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span> </div>
|
||
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="comment"> * add / search blocks of descriptors</span></div>
|
||
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span> </div>
|
||
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span> <span class="keyword">namespace </span>{</div>
|
||
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span> </div>
|
||
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span> <span class="keywordtype">int</span> prepare_level_tab (<a class="code" href="structfaiss_1_1HNSW.html">HNSW</a> & hnsw, <span class="keywordtype">size_t</span> n, <span class="keywordtype">bool</span> preset_levels = <span class="keyword">false</span>)</div>
|
||
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span> {</div>
|
||
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordtype">size_t</span> n0 = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.size() - 1;</div>
|
||
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span> </div>
|
||
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordflow">if</span> (preset_levels) {</div>
|
||
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  FAISS_ASSERT (n0 + n == hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.size());</div>
|
||
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  } <span class="keywordflow">else</span> {</div>
|
||
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  FAISS_ASSERT (n0 == hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.size());</div>
|
||
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordtype">int</span> pt_level = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#aa6dfdaed7bc0ad895774315166fcb197">random_level</a>();</div>
|
||
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.push_back(pt_level + 1);</div>
|
||
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  }</div>
|
||
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div>
|
||
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span> </div>
|
||
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordtype">int</span> max_level = 0;</div>
|
||
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordtype">int</span> pt_level = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>[i + n0] - 1;</div>
|
||
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordflow">if</span> (pt_level > max_level) max_level = pt_level;</div>
|
||
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.push_back(hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.back() +</div>
|
||
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a49b512eaaa54ead77b564cad8e3e6ebd">cum_nb_neighbors</a>(pt_level + 1));</div>
|
||
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>.resize(hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.back(), -1);</div>
|
||
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  }</div>
|
||
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">return</span> max_level;</div>
|
||
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span> }</div>
|
||
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span> </div>
|
||
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span> <span class="keywordtype">void</span> hnsw_add_vertices(IndexHNSW &index_hnsw,</div>
|
||
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordtype">size_t</span> n0,</div>
|
||
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x,</div>
|
||
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordtype">bool</span> verbose,</div>
|
||
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordtype">bool</span> preset_levels = <span class="keyword">false</span>) {</div>
|
||
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  HNSW & hnsw = index_hnsw.hnsw;</div>
|
||
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keywordtype">size_t</span> ntotal = n0 + n;</div>
|
||
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordtype">double</span> t0 = <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>();</div>
|
||
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keywordflow">if</span> (verbose) {</div>
|
||
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  printf(<span class="stringliteral">"hnsw_add_vertices: adding %ld elements on top of %ld "</span></div>
|
||
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="stringliteral">"(preset_levels=%d)\n"</span>,</div>
|
||
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  n, n0, <span class="keywordtype">int</span>(preset_levels));</div>
|
||
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  }</div>
|
||
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span> </div>
|
||
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordtype">int</span> max_level = prepare_level_tab (index_hnsw.hnsw, n, preset_levels);</div>
|
||
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span> </div>
|
||
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keywordflow">if</span> (verbose) {</div>
|
||
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  printf(<span class="stringliteral">" max_level = %d\n"</span>, max_level);</div>
|
||
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  }</div>
|
||
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span> </div>
|
||
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  std::vector<omp_lock_t> locks(ntotal);</div>
|
||
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i < ntotal; i++)</div>
|
||
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  omp_init_lock(&locks[i]);</div>
|
||
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span> </div>
|
||
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="comment">// add vectors from highest to lowest level</span></div>
|
||
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  std::vector<int> hist;</div>
|
||
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  std::vector<int> order(n);</div>
|
||
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span> </div>
|
||
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  { <span class="comment">// make buckets with vectors of the same level</span></div>
|
||
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span> </div>
|
||
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="comment">// build histogram</span></div>
|
||
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  storage_idx_t pt_id = i + n0;</div>
|
||
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keywordtype">int</span> pt_level = hnsw.levels[pt_id] - 1;</div>
|
||
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordflow">while</span> (pt_level >= hist.size())</div>
|
||
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  hist.push_back(0);</div>
|
||
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  hist[pt_level] ++;</div>
|
||
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  }</div>
|
||
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span> </div>
|
||
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="comment">// accumulate</span></div>
|
||
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  std::vector<int> offsets(hist.size() + 1, 0);</div>
|
||
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < hist.size() - 1; i++) {</div>
|
||
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  offsets[i + 1] = offsets[i] + hist[i];</div>
|
||
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  }</div>
|
||
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span> </div>
|
||
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="comment">// bucket sort</span></div>
|
||
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  storage_idx_t pt_id = i + n0;</div>
|
||
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordtype">int</span> pt_level = hnsw.levels[pt_id] - 1;</div>
|
||
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  order[offsets[pt_level]++] = pt_id;</div>
|
||
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  }</div>
|
||
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  }</div>
|
||
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span> </div>
|
||
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  { <span class="comment">// perform add</span></div>
|
||
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  RandomGenerator rng2(789);</div>
|
||
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span> </div>
|
||
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordtype">int</span> i1 = n;</div>
|
||
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span> </div>
|
||
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pt_level = hist.size() - 1; pt_level >= 0; pt_level--) {</div>
|
||
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keywordtype">int</span> i0 = i1 - hist[pt_level];</div>
|
||
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span> </div>
|
||
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keywordflow">if</span> (verbose) {</div>
|
||
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  printf(<span class="stringliteral">"Adding %d elements at level %d\n"</span>,</div>
|
||
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  i1 - i0, pt_level);</div>
|
||
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  }</div>
|
||
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span> </div>
|
||
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="comment">// random permutation to get rid of dataset order bias</span></div>
|
||
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i0; j < i1; j++)</div>
|
||
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  std::swap(order[j], order[j + rng2.rand_int(i1 - j)]);</div>
|
||
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span> </div>
|
||
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span> <span class="preprocessor">#pragma omp parallel</span></div>
|
||
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  VisitedTable vt (ntotal);</div>
|
||
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span> </div>
|
||
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  DistanceComputer *dis = index_hnsw.get_distance_computer();</div>
|
||
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  ScopeDeleter1<DistanceComputer> del(dis);</div>
|
||
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keywordtype">int</span> prev_display = verbose && omp_get_thread_num() == 0 ? 0 : -1;</div>
|
||
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span> </div>
|
||
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span> <span class="preprocessor">#pragma omp for schedule(dynamic)</span></div>
|
||
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = i0; i < i1; i++) {</div>
|
||
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  storage_idx_t pt_id = order[i];</div>
|
||
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  dis->set_query (x + (pt_id - n0) * dis->d);</div>
|
||
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span> </div>
|
||
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  hnsw.add_with_locks (</div>
|
||
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  *dis, pt_level, pt_id, locks,</div>
|
||
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  vt);</div>
|
||
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span> </div>
|
||
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keywordflow">if</span> (prev_display >= 0 && i - i0 > prev_display + 10000) {</div>
|
||
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  prev_display = i - i0;</div>
|
||
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  printf(<span class="stringliteral">" %d / %d\r"</span>, i - i0, i1 - i0);</div>
|
||
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  fflush(stdout);</div>
|
||
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  }</div>
|
||
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  }</div>
|
||
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  }</div>
|
||
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  i1 = i0;</div>
|
||
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  }</div>
|
||
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  FAISS_ASSERT(i1 == 0);</div>
|
||
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  }</div>
|
||
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keywordflow">if</span> (verbose)</div>
|
||
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  printf(<span class="stringliteral">"Done in %.3f ms\n"</span>, <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>() - t0);</div>
|
||
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span> </div>
|
||
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i < ntotal; i++)</div>
|
||
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  omp_destroy_lock(&locks[i]);</div>
|
||
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span> </div>
|
||
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span> }</div>
|
||
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span> </div>
|
||
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span> </div>
|
||
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span> } <span class="comment">// anonymous namespace</span></div>
|
||
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span> </div>
|
||
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span> </div>
|
||
|
|
<div class="line"><a name="l00913"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a26710980aaca3c1c8729e5e055a42ebe"> 913</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#a26710980aaca3c1c8729e5e055a42ebe">HNSW::fill_with_random_links</a>(<span class="keywordtype">size_t</span> n)</div>
|
||
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span> {</div>
|
||
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordtype">int</span> max_level = prepare_level_tab (*<span class="keyword">this</span>, n);</div>
|
||
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <a class="code" href="structfaiss_1_1RandomGenerator.html">RandomGenerator</a> rng2(456);</div>
|
||
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span> </div>
|
||
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = max_level - 1; level >= 0; level++) {</div>
|
||
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  std::vector<int> elts;</div>
|
||
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>[i] > level) {</div>
|
||
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  elts.push_back(i);</div>
|
||
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  }</div>
|
||
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  }</div>
|
||
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  printf (<span class="stringliteral">"linking %ld elements in level %d\n"</span>,</div>
|
||
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  elts.size(), level);</div>
|
||
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span> </div>
|
||
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="keywordflow">if</span> (elts.size() == 1) <span class="keywordflow">continue</span>;</div>
|
||
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span> </div>
|
||
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = 0; ii < elts.size(); ii++) {</div>
|
||
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keywordtype">int</span> i = elts[ii];</div>
|
||
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, 0, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordtype">int</span> other = 0;</div>
|
||
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keywordflow">do</span> {</div>
|
||
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  other = elts[rng2.<a class="code" href="structfaiss_1_1RandomGenerator.html#a583f124ecacdbe037ac96e23a44dd420">rand_int</a>(elts.size())];</div>
|
||
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  } <span class="keywordflow">while</span>(other == i);</div>
|
||
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span> </div>
|
||
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j] = other;</div>
|
||
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  }</div>
|
||
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span> </div>
|
||
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  }</div>
|
||
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span> </div>
|
||
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  }</div>
|
||
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span> </div>
|
||
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span> }</div>
|
||
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span> </div>
|
||
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span> </div>
|
||
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span> </div>
|
||
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span> </div>
|
||
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span> <span class="comment"> * IndexHNSW implementation</span></div>
|
||
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span> </div>
|
||
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span> IndexHNSW::IndexHNSW(<span class="keywordtype">int</span> d, <span class="keywordtype">int</span> M):</div>
|
||
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <a class="code" href="structfaiss_1_1Index.html">Index</a>(d, METRIC_L2),</div>
|
||
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  hnsw(M),</div>
|
||
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  own_fields(false),</div>
|
||
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  storage(nullptr),</div>
|
||
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  reconstruct_from_neighbors(nullptr)</div>
|
||
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span> {}</div>
|
||
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span> </div>
|
||
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span> IndexHNSW::IndexHNSW(Index *storage, <span class="keywordtype">int</span> M):</div>
|
||
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  Index(storage->d, METRIC_L2),</div>
|
||
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  hnsw(M),</div>
|
||
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  own_fields(false),</div>
|
||
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  storage(storage),</div>
|
||
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  reconstruct_from_neighbors(nullptr)</div>
|
||
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span> {}</div>
|
||
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span> </div>
|
||
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span> IndexHNSW::~IndexHNSW() {</div>
|
||
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="keywordflow">if</span> (own_fields) {</div>
|
||
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <span class="keyword">delete</span> storage;</div>
|
||
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  }</div>
|
||
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span> }</div>
|
||
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span> </div>
|
||
|
|
<div class="line"><a name="l00978"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a40bc6d2c67545f95e322c63d68a47140"> 978</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a40bc6d2c67545f95e322c63d68a47140">IndexHNSW::train</a>(idx_t n, <span class="keyword">const</span> <span class="keywordtype">float</span>* x)</div>
|
||
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span> {</div>
|
||
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="comment">// hnsw structure does not require training</span></div>
|
||
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  storage-><a class="code" href="structfaiss_1_1Index.html#abf601502bdbfa02b9d7bcd7b3671b71d">train</a> (n, x);</div>
|
||
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a> = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span> }</div>
|
||
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span> </div>
|
||
|
|
<div class="line"><a name="l00985"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#ae0ddf6ab4a54239a25d6277e21e8548e"> 985</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#ae0ddf6ab4a54239a25d6277e21e8548e">IndexHNSW::search</a> (idx_t n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x, idx_t k,</div>
|
||
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keywordtype">float</span> *distances, idx_t *labels)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span> <span class="keyword"></span></div>
|
||
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span> </div>
|
||
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span> <span class="preprocessor">#pragma omp parallel</span></div>
|
||
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> vt (ntotal);</div>
|
||
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  DistanceComputer *dis = get_distance_computer();</div>
|
||
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1<DistanceComputer></a> del(dis);</div>
|
||
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="keywordtype">size_t</span> nreorder = 0;</div>
|
||
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span> </div>
|
||
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span> <span class="preprocessor">#pragma omp for</span></div>
|
||
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span> <span class="preprocessor"></span> <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  idx_t * idxi = labels + i * k;</div>
|
||
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordtype">float</span> * simi = distances + i * k;</div>
|
||
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  dis->set_query(x + i * d);</div>
|
||
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> </div>
|
||
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  maxheap_heapify (k, simi, idxi);</div>
|
||
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  hnsw.search (*dis, k, idxi, simi, vt);</div>
|
||
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> </div>
|
||
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  maxheap_reorder (k, simi, idxi);</div>
|
||
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span> </div>
|
||
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordflow">if</span> (reconstruct_from_neighbors &&</div>
|
||
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  reconstruct_from_neighbors->k_reorder != 0) {</div>
|
||
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordtype">int</span> k_reorder = reconstruct_from_neighbors->k_reorder;</div>
|
||
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="keywordflow">if</span> (k_reorder == -1 || k_reorder > k) k_reorder = k;</div>
|
||
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span> </div>
|
||
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  nreorder += reconstruct_from_neighbors->compute_distances(</div>
|
||
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  k_reorder, idxi, x + i * d, simi);</div>
|
||
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span> </div>
|
||
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="comment">// sort top k_reorder</span></div>
|
||
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  maxheap_heapify (k_reorder, simi, idxi, simi, idxi, k_reorder);</div>
|
||
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  maxheap_reorder (k_reorder, simi, idxi);</div>
|
||
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  }</div>
|
||
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  }</div>
|
||
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> <span class="preprocessor">#pragma omp critical</span></div>
|
||
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  hnsw_stats.nreorder += nreorder;</div>
|
||
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  }</div>
|
||
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  }</div>
|
||
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> </div>
|
||
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> </div>
|
||
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> }</div>
|
||
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span> </div>
|
||
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> </div>
|
||
|
|
<div class="line"><a name="l01031"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a04a761ce17d0f9040b3bc8a77bd627d9"> 1031</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a04a761ce17d0f9040b3bc8a77bd627d9">IndexHNSW::add</a>(idx_t n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x)</div>
|
||
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> {</div>
|
||
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  FAISS_THROW_IF_NOT(<a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a>);</div>
|
||
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keywordtype">int</span> n0 = <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>;</div>
|
||
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  storage-><a class="code" href="structfaiss_1_1Index.html#a1b5e9ac70adbce0897dd6c8276ad96f2">add</a>(n, x);</div>
|
||
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  ntotal = storage-><a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>;</div>
|
||
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> </div>
|
||
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  hnsw_add_vertices (*<span class="keyword">this</span>, n0, n, x, verbose,</div>
|
||
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  hnsw.levels.size() == <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>);</div>
|
||
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span> </div>
|
||
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> }</div>
|
||
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> </div>
|
||
|
|
<div class="line"><a name="l01043"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#ad4b9f97d42e2521e01f8b60012985396"> 1043</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#ad4b9f97d42e2521e01f8b60012985396">IndexHNSW::reset</a>()</div>
|
||
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span> {</div>
|
||
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  hnsw.reset();</div>
|
||
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  storage-><a class="code" href="structfaiss_1_1Index.html#a849361f5f0ab0aba8d419c86f2594191">reset</a>();</div>
|
||
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  ntotal = 0;</div>
|
||
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span> }</div>
|
||
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span> </div>
|
||
|
|
<div class="line"><a name="l01050"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a660e5c8de1ba9c71bf3fe1f3bf0c8812"> 1050</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a660e5c8de1ba9c71bf3fe1f3bf0c8812">IndexHNSW::reconstruct</a> (idx_t key, <span class="keywordtype">float</span>* recons)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  storage-><a class="code" href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">reconstruct</a>(key, recons);</div>
|
||
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> }</div>
|
||
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span> </div>
|
||
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> <span class="keywordtype">void</span> IndexHNSW::shrink_level_0_neighbors(<span class="keywordtype">int</span> new_size)</div>
|
||
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> {</div>
|
||
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> <span class="preprocessor">#pragma omp parallel</span></div>
|
||
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  DistanceComputer *dis = get_distance_computer();</div>
|
||
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1<DistanceComputer></a> del(dis);</div>
|
||
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> </div>
|
||
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span> <span class="preprocessor">#pragma omp for</span></div>
|
||
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (idx_t i = 0; i < <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
|
||
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> </div>
|
||
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  hnsw.neighbor_range(i, 0, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> </div>
|
||
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  std::priority_queue<NodeDistFarther> initial_list;</div>
|
||
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> </div>
|
||
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordtype">int</span> v1 = hnsw.neighbors[j];</div>
|
||
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keywordflow">if</span> (v1 < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  initial_list.emplace(dis->symmetric_dis(i, v1), v1);</div>
|
||
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span> </div>
|
||
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="comment">// initial_list.emplace(qdis(v1), v1);</span></div>
|
||
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  }</div>
|
||
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span> </div>
|
||
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  std::vector<NodeDistFarther> shrunk_list;</div>
|
||
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  shrink_neighbor_list (*dis, initial_list, shrunk_list, new_size);</div>
|
||
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span> </div>
|
||
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordflow">if</span> (j - begin < shrunk_list.size())</div>
|
||
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  hnsw.neighbors[j] = shrunk_list[j - begin].id;</div>
|
||
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  <span class="keywordflow">else</span></div>
|
||
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  hnsw.neighbors[j] = -1;</div>
|
||
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  }</div>
|
||
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  }</div>
|
||
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  }</div>
|
||
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> </div>
|
||
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> }</div>
|
||
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> </div>
|
||
|
|
<div class="line"><a name="l01092"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a5b619a41ddd52f0377efb701829c1e43"> 1092</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a5b619a41ddd52f0377efb701829c1e43">IndexHNSW::search_level_0</a>(</div>
|
||
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  idx_t n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x, idx_t k,</div>
|
||
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keyword">const</span> storage_idx_t *nearest, <span class="keyword">const</span> <span class="keywordtype">float</span> *nearest_d,</div>
|
||
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keywordtype">float</span> *distances, idx_t *labels, <span class="keywordtype">int</span> nprobe,</div>
|
||
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keywordtype">int</span> search_type)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span> </div>
|
||
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  storage_idx_t ntotal = hnsw.levels.size();</div>
|
||
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span> <span class="preprocessor">#pragma omp parallel</span></div>
|
||
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  DistanceComputer *qdis = get_distance_computer();</div>
|
||
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1<DistanceComputer></a> del(qdis);</div>
|
||
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> </div>
|
||
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> vt (ntotal);</div>
|
||
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span> </div>
|
||
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> <span class="preprocessor">#pragma omp for</span></div>
|
||
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span> <span class="preprocessor"></span> <span class="keywordflow">for</span>(idx_t i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  idx_t * idxi = labels + i * k;</div>
|
||
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keywordtype">float</span> * simi = distances + i * k;</div>
|
||
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> </div>
|
||
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  qdis->set_query(x + i * d);</div>
|
||
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  maxheap_heapify (k, simi, idxi);</div>
|
||
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> </div>
|
||
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">if</span> (search_type == 1) {</div>
|
||
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span> </div>
|
||
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keywordtype">int</span> nres = 0;</div>
|
||
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span> </div>
|
||
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j < nprobe; j++) {</div>
|
||
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  storage_idx_t cj = nearest[i * nprobe + j];</div>
|
||
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span> </div>
|
||
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="keywordflow">if</span> (cj < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span> </div>
|
||
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="keywordflow">if</span> (vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a18a972137362ff04a38943d66fc19dcb">get</a>(cj)) <span class="keywordflow">continue</span>;</div>
|
||
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> </div>
|
||
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="keywordtype">int</span> candidates_size = std::max(hnsw.efSearch, <span class="keywordtype">int</span>(k));</div>
|
||
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  MinimaxHeap candidates(candidates_size);</div>
|
||
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> </div>
|
||
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  candidates.push(cj, nearest_d[i * nprobe + j]);</div>
|
||
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span> </div>
|
||
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  nres = search_from_candidates (</div>
|
||
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  hnsw, *qdis, k, idxi, simi,</div>
|
||
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  candidates, vt, 0, nres);</div>
|
||
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  }</div>
|
||
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (search_type == 2) {</div>
|
||
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> </div>
|
||
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keywordtype">int</span> candidates_size = std::max(hnsw.efSearch, <span class="keywordtype">int</span>(k));</div>
|
||
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  candidates_size = std::max(candidates_size, nprobe);</div>
|
||
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span> </div>
|
||
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  MinimaxHeap candidates(candidates_size);</div>
|
||
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j < nprobe; j++) {</div>
|
||
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  storage_idx_t cj = nearest[i * nprobe + j];</div>
|
||
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span> </div>
|
||
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keywordflow">if</span> (cj < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  candidates.push(cj, nearest_d[i * nprobe + j]);</div>
|
||
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  }</div>
|
||
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  search_from_candidates (</div>
|
||
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  hnsw, *qdis, k, idxi, simi,</div>
|
||
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  candidates, vt, 0);</div>
|
||
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span> </div>
|
||
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  }</div>
|
||
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a>();</div>
|
||
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> </div>
|
||
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  maxheap_reorder (k, simi, idxi);</div>
|
||
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> </div>
|
||
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  }</div>
|
||
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  }</div>
|
||
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> </div>
|
||
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> </div>
|
||
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> }</div>
|
||
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> </div>
|
||
|
|
<div class="line"><a name="l01162"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a9a86c58212f3f9cf88394f5297cba525"> 1162</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a9a86c58212f3f9cf88394f5297cba525">IndexHNSW::init_level_0_from_knngraph</a>(</div>
|
||
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keywordtype">int</span> k, <span class="keyword">const</span> <span class="keywordtype">float</span> *D, <span class="keyword">const</span> idx_t *I)</div>
|
||
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> {</div>
|
||
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="keywordtype">int</span> dest_size = hnsw.nb_neighbors (0);</div>
|
||
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span> </div>
|
||
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
||
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (idx_t i = 0; i < <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
|
||
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  DistanceComputer *qdis = get_distance_computer();</div>
|
||
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="keywordtype">float</span> vec[<a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>];</div>
|
||
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  storage-><a class="code" href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">reconstruct</a>(i, vec);</div>
|
||
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  qdis->set_query(vec);</div>
|
||
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> </div>
|
||
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  std::priority_queue<NodeDistFarther> initial_list;</div>
|
||
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span> </div>
|
||
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < k; j++) {</div>
|
||
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="keywordtype">int</span> v1 = I[i * k + j];</div>
|
||
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="keywordflow">if</span> (v1 == i) <span class="keywordflow">continue</span>;</div>
|
||
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordflow">if</span> (v1 < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  initial_list.emplace(D[i * k + j], v1);</div>
|
||
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  }</div>
|
||
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span> </div>
|
||
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  std::vector<NodeDistFarther> shrunk_list;</div>
|
||
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  shrink_neighbor_list (*qdis, initial_list, shrunk_list, dest_size);</div>
|
||
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span> </div>
|
||
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  hnsw.neighbor_range(i, 0, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span> </div>
|
||
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="keywordflow">if</span> (j - begin < shrunk_list.size())</div>
|
||
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  hnsw.neighbors[j] = shrunk_list[j - begin].id;</div>
|
||
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="keywordflow">else</span></div>
|
||
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  hnsw.neighbors[j] = -1;</div>
|
||
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  }</div>
|
||
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  }</div>
|
||
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> }</div>
|
||
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span> </div>
|
||
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span> </div>
|
||
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span> </div>
|
||
|
|
<div class="line"><a name="l01200"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#ab9c75063090927f8f65d1896b6949af4"> 1200</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#ab9c75063090927f8f65d1896b6949af4">IndexHNSW::init_level_0_from_entry_points</a>(</div>
|
||
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keywordtype">int</span> n, <span class="keyword">const</span> storage_idx_t *points,</div>
|
||
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keyword">const</span> storage_idx_t *nearests)</div>
|
||
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span> {</div>
|
||
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> </div>
|
||
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  std::vector<omp_lock_t> locks(ntotal);</div>
|
||
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i < <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++)</div>
|
||
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  omp_init_lock(&locks[i]);</div>
|
||
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span> </div>
|
||
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> <span class="preprocessor">#pragma omp parallel</span></div>
|
||
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> vt (ntotal);</div>
|
||
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> </div>
|
||
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  DistanceComputer *dis = get_distance_computer();</div>
|
||
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1<DistanceComputer></a> del(dis);</div>
|
||
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  <span class="keywordtype">float</span> vec[storage-><a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>];</div>
|
||
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> </div>
|
||
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span> <span class="preprocessor">#pragma omp for schedule(dynamic)</span></div>
|
||
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  storage_idx_t pt_id = points[i];</div>
|
||
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  storage_idx_t nearest = nearests[i];</div>
|
||
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  storage-><a class="code" href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">reconstruct</a> (pt_id, vec);</div>
|
||
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  dis->set_query (vec);</div>
|
||
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span> </div>
|
||
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  add_links_starting_from(hnsw, *dis, pt_id, nearest, (*dis)(nearest),</div>
|
||
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  0, locks.data(), vt);</div>
|
||
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> </div>
|
||
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keywordflow">if</span> (verbose && i % 10000 == 0) {</div>
|
||
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  printf(<span class="stringliteral">" %d / %d\r"</span>, i, n);</div>
|
||
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  fflush(stdout);</div>
|
||
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  }</div>
|
||
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  }</div>
|
||
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  }</div>
|
||
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keywordflow">if</span> (verbose) {</div>
|
||
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  printf(<span class="stringliteral">"\n"</span>);</div>
|
||
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  }</div>
|
||
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> </div>
|
||
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i < <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++)</div>
|
||
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  omp_destroy_lock(&locks[i]);</div>
|
||
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span> }</div>
|
||
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span> </div>
|
||
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span> <span class="keywordtype">void</span> IndexHNSW::reorder_links()</div>
|
||
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span> {</div>
|
||
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keywordtype">int</span> M = hnsw.nb_neighbors(0);</div>
|
||
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span> </div>
|
||
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span> <span class="preprocessor">#pragma omp parallel</span></div>
|
||
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  std::vector<float> distances (M);</div>
|
||
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  std::vector<size_t> order (M);</div>
|
||
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  std::vector<storage_idx_t> tmp (M);</div>
|
||
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  DistanceComputer *dis = get_distance_computer();</div>
|
||
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1<DistanceComputer></a> del(dis);</div>
|
||
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> </div>
|
||
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span> <span class="preprocessor">#pragma omp for</span></div>
|
||
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span> <span class="preprocessor"></span> <span class="keywordflow">for</span>(storage_idx_t i = 0; i < <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
|
||
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span> </div>
|
||
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  hnsw.neighbor_range(i, 0, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span> </div>
|
||
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  storage_idx_t nj = hnsw.neighbors[j];</div>
|
||
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keywordflow">if</span> (nj < 0) {</div>
|
||
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  end = j;</div>
|
||
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  }</div>
|
||
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  distances[j - begin] = dis->symmetric_dis(i, nj);</div>
|
||
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  tmp [j - begin] = nj;</div>
|
||
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  }</div>
|
||
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span> </div>
|
||
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  fvec_argsort (end - begin, distances.data(), order.data());</div>
|
||
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  hnsw.neighbors[j] = tmp[order[j - begin]];</div>
|
||
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  }</div>
|
||
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  }</div>
|
||
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span> </div>
|
||
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  }</div>
|
||
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> }</div>
|
||
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> </div>
|
||
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span> </div>
|
||
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> <span class="keywordtype">void</span> IndexHNSW::link_singletons()</div>
|
||
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span> {</div>
|
||
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  printf(<span class="stringliteral">"search for singletons\n"</span>);</div>
|
||
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span> </div>
|
||
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  std::vector<bool> seen(ntotal);</div>
|
||
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span> </div>
|
||
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
|
||
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  hnsw.neighbor_range(i, 0, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  storage_idx_t ni = hnsw.neighbors[j];</div>
|
||
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keywordflow">if</span> (ni >= 0) seen[ni] = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  }</div>
|
||
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  }</div>
|
||
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> </div>
|
||
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="keywordtype">int</span> n_sing = 0, n_sing_l1 = 0;</div>
|
||
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  std::vector<storage_idx_t> singletons;</div>
|
||
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="keywordflow">for</span> (storage_idx_t i = 0; i < <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
|
||
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  <span class="keywordflow">if</span> (!seen[i]) {</div>
|
||
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  singletons.push_back(i);</div>
|
||
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  n_sing++;</div>
|
||
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <span class="keywordflow">if</span> (hnsw.levels[i] > 1)</div>
|
||
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  n_sing_l1++;</div>
|
||
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  }</div>
|
||
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  }</div>
|
||
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span> </div>
|
||
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  printf(<span class="stringliteral">" Found %d / %ld singletons (%d appear in a level above)\n"</span>,</div>
|
||
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  n_sing, ntotal, n_sing_l1);</div>
|
||
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> </div>
|
||
|
|
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  std::vector<float>recons(singletons.size() * <a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>);</div>
|
||
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < singletons.size(); i++) {</div>
|
||
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span> </div>
|
||
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  FAISS_ASSERT(!<span class="stringliteral">"not implemented"</span>);</div>
|
||
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span> </div>
|
||
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  }</div>
|
||
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> </div>
|
||
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span> </div>
|
||
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span> }</div>
|
||
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span> </div>
|
||
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> </div>
|
||
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span> </div>
|
||
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span> </div>
|
||
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span> <span class="comment">// storage that explicitly reconstructs vectors before computing distances</span></div>
|
||
|
|
<div class="line"><a name="l01322"></a><span class="lineno"><a class="line" href="structfaiss_1_1GenericDistanceComputer.html"> 1322</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1GenericDistanceComputer.html">GenericDistanceComputer</a>: <a class="code" href="structfaiss_1_1HNSW_1_1DistanceComputer.html">HNSW::DistanceComputer</a> {</div>
|
||
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span> </div>
|
||
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html">Index</a> & storage;</div>
|
||
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  std::vector<float> buf;</div>
|
||
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *q;</div>
|
||
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> </div>
|
||
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <a class="code" href="structfaiss_1_1GenericDistanceComputer.html">GenericDistanceComputer</a>(<span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html">Index</a> & storage): storage(storage)</div>
|
||
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  {</div>
|
||
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  d = storage.<a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>;</div>
|
||
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  buf.resize(d * 2);</div>
|
||
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  }</div>
|
||
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span> </div>
|
||
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="keywordtype">float</span> operator () (storage_idx_t i)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  storage.<a class="code" href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">reconstruct</a>(i, buf.data());</div>
|
||
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="keywordflow">return</span> <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(q, buf.data(), d);</div>
|
||
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  }</div>
|
||
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span> </div>
|
||
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keywordtype">float</span> symmetric_dis(storage_idx_t i, storage_idx_t j)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  storage.<a class="code" href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">reconstruct</a>(i, buf.data());</div>
|
||
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  storage.<a class="code" href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">reconstruct</a>(j, buf.data() + d);</div>
|
||
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="keywordflow">return</span> <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(buf.data() + d, buf.data(), d);</div>
|
||
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  }</div>
|
||
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span> </div>
|
||
|
|
<div class="line"><a name="l01347"></a><span class="lineno"><a class="line" href="structfaiss_1_1GenericDistanceComputer.html#a07cbd7cd0ed73eae3d0487f2f25b748c"> 1347</a></span>  <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1GenericDistanceComputer.html#a07cbd7cd0ed73eae3d0487f2f25b748c">set_query</a>(<span class="keyword">const</span> <span class="keywordtype">float</span> *x)<span class="keyword"> override </span>{</div>
|
||
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  q = x;</div>
|
||
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  }</div>
|
||
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span> </div>
|
||
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span> </div>
|
||
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span> };</div>
|
||
|
|
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span> </div>
|
||
|
|
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> HNSW::DistanceComputer * IndexHNSW::get_distance_computer ()<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> GenericDistanceComputer (*storage);</div>
|
||
|
|
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span> }</div>
|
||
|
|
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span> </div>
|
||
|
|
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span> </div>
|
||
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span> <span class="comment"> * ReconstructFromNeighbors implementation</span></div>
|
||
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span> </div>
|
||
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span> </div>
|
||
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span> ReconstructFromNeighbors::ReconstructFromNeighbors(</div>
|
||
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <span class="keyword">const</span> IndexHNSW & index, <span class="keywordtype">size_t</span> k, <span class="keywordtype">size_t</span> nsq):</div>
|
||
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  index(index), k(k), nsq(nsq) {</div>
|
||
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  M = index.hnsw.nb_neighbors(0);</div>
|
||
|
|
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  FAISS_ASSERT(k <= 256);</div>
|
||
|
|
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  code_size = k == 1 ? 0 : nsq;</div>
|
||
|
|
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  ntotal = 0;</div>
|
||
|
|
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  d = index.d;</div>
|
||
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  FAISS_ASSERT(d % nsq == 0);</div>
|
||
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  dsub = d / nsq;</div>
|
||
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  k_reorder = -1;</div>
|
||
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span> }</div>
|
||
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span> </div>
|
||
|
|
<div class="line"><a name="l01378"></a><span class="lineno"><a class="line" href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8"> 1378</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8">ReconstructFromNeighbors::reconstruct</a>(storage_idx_t i, <span class="keywordtype">float</span> *x, <span class="keywordtype">float</span> *tmp)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span> </div>
|
||
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span> </div>
|
||
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1HNSW.html">HNSW</a> & hnsw = index.hnsw;</div>
|
||
|
|
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  hnsw.<a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, 0, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span> </div>
|
||
|
|
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  <span class="keywordflow">if</span> (k == 1 || nsq == 1) {</div>
|
||
|
|
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * beta;</div>
|
||
|
|
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="keywordflow">if</span> (k == 1) {</div>
|
||
|
|
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  beta = codebook.data();</div>
|
||
|
|
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  } <span class="keywordflow">else</span> {</div>
|
||
|
|
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  <span class="keywordtype">int</span> idx = codes[i];</div>
|
||
|
|
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  beta = codebook.data() + idx * (M + 1);</div>
|
||
|
|
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  }</div>
|
||
|
|
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span> </div>
|
||
|
|
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  <span class="keywordtype">float</span> w0 = beta[0]; <span class="comment">// weight of image itself</span></div>
|
||
|
|
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  index.storage->reconstruct(i, tmp);</div>
|
||
|
|
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span> </div>
|
||
|
|
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l < d; l++)</div>
|
||
|
|
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  x[l] = w0 * tmp[l];</div>
|
||
|
|
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span> </div>
|
||
|
|
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span> </div>
|
||
|
|
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  storage_idx_t ji = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
|
||
|
|
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  <span class="keywordflow">if</span> (ji < 0) ji = i;</div>
|
||
|
|
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <span class="keywordtype">float</span> w = beta[j - begin + 1];</div>
|
||
|
|
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  index.storage->reconstruct(ji, tmp);</div>
|
||
|
|
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l < d; l++)</div>
|
||
|
|
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  x[l] += w * tmp[l];</div>
|
||
|
|
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  }</div>
|
||
|
|
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nsq == 2) {</div>
|
||
|
|
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  <span class="keywordtype">int</span> idx0 = codes[2 * i];</div>
|
||
|
|
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keywordtype">int</span> idx1 = codes[2 * i + 1];</div>
|
||
|
|
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span> </div>
|
||
|
|
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *beta0 = codebook.data() + idx0 * (M + 1);</div>
|
||
|
|
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *beta1 = codebook.data() + (idx1 + k) * (M + 1);</div>
|
||
|
|
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span> </div>
|
||
|
|
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  index.storage->reconstruct(i, tmp);</div>
|
||
|
|
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span> </div>
|
||
|
|
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keywordtype">float</span> w0;</div>
|
||
|
|
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span> </div>
|
||
|
|
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  w0 = beta0[0];</div>
|
||
|
|
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l < dsub; l++)</div>
|
||
|
|
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  x[l] = w0 * tmp[l];</div>
|
||
|
|
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span> </div>
|
||
|
|
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  w0 = beta1[0];</div>
|
||
|
|
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = dsub; l < d; l++)</div>
|
||
|
|
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  x[l] = w0 * tmp[l];</div>
|
||
|
|
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span> </div>
|
||
|
|
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  storage_idx_t ji = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
|
||
|
|
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="keywordflow">if</span> (ji < 0) ji = i;</div>
|
||
|
|
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  index.storage->reconstruct(ji, tmp);</div>
|
||
|
|
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  <span class="keywordtype">float</span> w;</div>
|
||
|
|
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  w = beta0[j - begin + 1];</div>
|
||
|
|
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l < dsub; l++)</div>
|
||
|
|
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  x[l] += w * tmp[l];</div>
|
||
|
|
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span> </div>
|
||
|
|
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  w = beta1[j - begin + 1];</div>
|
||
|
|
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = dsub; l < d; l++)</div>
|
||
|
|
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  x[l] += w * tmp[l];</div>
|
||
|
|
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  }</div>
|
||
|
|
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  } <span class="keywordflow">else</span> {</div>
|
||
|
|
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *betas[nsq];</div>
|
||
|
|
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  {</div>
|
||
|
|
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *b = codebook.data();</div>
|
||
|
|
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="keyword">const</span> uint8_t *c = &codes[i * code_size];</div>
|
||
|
|
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sq = 0; sq < nsq; sq++) {</div>
|
||
|
|
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  betas[sq] = b + (*c++) * (M + 1);</div>
|
||
|
|
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  b += (M + 1) * k;</div>
|
||
|
|
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  }</div>
|
||
|
|
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  }</div>
|
||
|
|
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span> </div>
|
||
|
|
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  index.storage->reconstruct(i, tmp);</div>
|
||
|
|
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  {</div>
|
||
|
|
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  <span class="keywordtype">int</span> d0 = 0;</div>
|
||
|
|
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sq = 0; sq < nsq; sq++) {</div>
|
||
|
|
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <span class="keywordtype">float</span> w = *(betas[sq]++);</div>
|
||
|
|
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  <span class="keywordtype">int</span> d1 = d0 + dsub;</div>
|
||
|
|
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = d0; l < d1; l++) {</div>
|
||
|
|
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  x[l] = w * tmp[l];</div>
|
||
|
|
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  }</div>
|
||
|
|
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  d0 = d1;</div>
|
||
|
|
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  }</div>
|
||
|
|
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  }</div>
|
||
|
|
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span> </div>
|
||
|
|
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  storage_idx_t ji = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
|
||
|
|
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  <span class="keywordflow">if</span> (ji < 0) ji = i;</div>
|
||
|
|
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span> </div>
|
||
|
|
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  index.storage->reconstruct(ji, tmp);</div>
|
||
|
|
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  <span class="keywordtype">int</span> d0 = 0;</div>
|
||
|
|
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sq = 0; sq < nsq; sq++) {</div>
|
||
|
|
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  <span class="keywordtype">float</span> w = *(betas[sq]++);</div>
|
||
|
|
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  <span class="keywordtype">int</span> d1 = d0 + dsub;</div>
|
||
|
|
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = d0; l < d1; l++) {</div>
|
||
|
|
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  x[l] += w * tmp[l];</div>
|
||
|
|
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  }</div>
|
||
|
|
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  d0 = d1;</div>
|
||
|
|
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  }</div>
|
||
|
|
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  }</div>
|
||
|
|
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  }</div>
|
||
|
|
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span> }</div>
|
||
|
|
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span> </div>
|
||
|
|
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span> <span class="keywordtype">void</span> ReconstructFromNeighbors::reconstruct_n(storage_idx_t n0,</div>
|
||
|
|
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  storage_idx_t ni,</div>
|
||
|
|
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="keywordtype">float</span> *x)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span> <span class="preprocessor">#pragma omp parallel</span></div>
|
||
|
|
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  std::vector<float> tmp(index.d);</div>
|
||
|
|
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span> <span class="preprocessor">#pragma omp for</span></div>
|
||
|
|
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (storage_idx_t i = 0; i < ni; i++) {</div>
|
||
|
|
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8">reconstruct</a>(n0 + i, x + i * index.d, tmp.data());</div>
|
||
|
|
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  }</div>
|
||
|
|
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  }</div>
|
||
|
|
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span> }</div>
|
||
|
|
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span> </div>
|
||
|
|
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> <span class="keywordtype">size_t</span> ReconstructFromNeighbors::compute_distances(<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> idx_t *shortlist,</div>
|
||
|
|
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *query, <span class="keywordtype">float</span> *distances)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  std::vector<float> tmp(2 * index.d);</div>
|
||
|
|
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  <span class="keywordtype">size_t</span> ncomp = 0;</div>
|
||
|
|
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <span class="keywordflow">if</span> (shortlist[i] < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8">reconstruct</a>(shortlist[i], tmp.data(), tmp.data() + index.d);</div>
|
||
|
|
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  distances[i] = <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(query, tmp.data(), index.d);</div>
|
||
|
|
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  ncomp++;</div>
|
||
|
|
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  }</div>
|
||
|
|
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  <span class="keywordflow">return</span> ncomp;</div>
|
||
|
|
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span> }</div>
|
||
|
|
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span> </div>
|
||
|
|
<div class="line"><a name="l01512"></a><span class="lineno"><a class="line" href="structfaiss_1_1ReconstructFromNeighbors.html#aed256bdd9f48dc93cb9e33cfdfd5bde7"> 1512</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#aed256bdd9f48dc93cb9e33cfdfd5bde7">ReconstructFromNeighbors::get_neighbor_table</a>(storage_idx_t i, <span class="keywordtype">float</span> *tmp1)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1HNSW.html">HNSW</a> & hnsw = index.hnsw;</div>
|
||
|
|
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  hnsw.<a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, 0, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  <span class="keywordtype">size_t</span> d = index.d;</div>
|
||
|
|
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span> </div>
|
||
|
|
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  index.storage->reconstruct(i, tmp1);</div>
|
||
|
|
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span> </div>
|
||
|
|
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  storage_idx_t ji = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
|
||
|
|
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  <span class="keywordflow">if</span> (ji < 0) ji = i;</div>
|
||
|
|
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  index.storage->reconstruct(ji, tmp1 + (j - begin + 1) * d);</div>
|
||
|
|
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  }</div>
|
||
|
|
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span> </div>
|
||
|
|
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span> }</div>
|
||
|
|
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span> </div>
|
||
|
|
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span> <span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span> <span class="comment">/// called by add_codes</span></div>
|
||
|
|
<div class="line"><a name="l01531"></a><span class="lineno"><a class="line" href="structfaiss_1_1ReconstructFromNeighbors.html#a88ca99742dccc52ebb3324b507b6c872"> 1531</a></span> <span class="comment"></span><span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a88ca99742dccc52ebb3324b507b6c872">ReconstructFromNeighbors::estimate_code</a>(</div>
|
||
|
|
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *x, storage_idx_t i, uint8_t *code)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span> </div>
|
||
|
|
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  <span class="comment">// fill in tmp table with the neighbor values</span></div>
|
||
|
|
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  <span class="keywordtype">float</span> *tmp1 = <span class="keyword">new</span> <span class="keywordtype">float</span>[d * (M + 1) + (d * k)];</div>
|
||
|
|
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keywordtype">float</span> *tmp2 = tmp1 + d * (M + 1);</div>
|
||
|
|
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  <a class="code" href="structfaiss_1_1ScopeDeleter.html">ScopeDeleter<float></a> del(tmp1);</div>
|
||
|
|
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span> </div>
|
||
|
|
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  <span class="comment">// collect coordinates of base</span></div>
|
||
|
|
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#aed256bdd9f48dc93cb9e33cfdfd5bde7">get_neighbor_table</a> (i, tmp1);</div>
|
||
|
|
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span> </div>
|
||
|
|
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sq = 0; sq < nsq; sq++) {</div>
|
||
|
|
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  <span class="keywordtype">int</span> d0 = sq * dsub;</div>
|
||
|
|
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="keywordtype">int</span> d1 = d0 + dsub;</div>
|
||
|
|
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> </div>
|
||
|
|
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  {</div>
|
||
|
|
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  FINTEGER ki = k, di = d, m1 = M + 1;</div>
|
||
|
|
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  FINTEGER dsubi = dsub;</div>
|
||
|
|
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  <span class="keywordtype">float</span> zero = 0, one = 1;</div>
|
||
|
|
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> </div>
|
||
|
|
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  sgemm_ (<span class="stringliteral">"N"</span>, <span class="stringliteral">"N"</span>, &dsubi, &ki, &m1, &one,</div>
|
||
|
|
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  tmp1 + d0, &di,</div>
|
||
|
|
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  codebook.data() + sq * (m1 * k), &m1,</div>
|
||
|
|
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  &zero, tmp2, &dsubi);</div>
|
||
|
|
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  }</div>
|
||
|
|
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span> </div>
|
||
|
|
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <span class="keywordtype">float</span> min = HUGE_VAL;</div>
|
||
|
|
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  <span class="keywordtype">int</span> argmin = -1;</div>
|
||
|
|
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < k; j++) {</div>
|
||
|
|
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  <span class="keywordtype">float</span> dis = <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(x + d0, tmp2 + j * dsub, dsub);</div>
|
||
|
|
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  <span class="keywordflow">if</span> (dis < min) {</div>
|
||
|
|
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  min = dis;</div>
|
||
|
|
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  argmin = j;</div>
|
||
|
|
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  }</div>
|
||
|
|
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  }</div>
|
||
|
|
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  code[sq] = argmin;</div>
|
||
|
|
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  }</div>
|
||
|
|
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span> </div>
|
||
|
|
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span> }</div>
|
||
|
|
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span> </div>
|
||
|
|
<div class="line"><a name="l01572"></a><span class="lineno"><a class="line" href="structfaiss_1_1ReconstructFromNeighbors.html#a454b7a5f7437a257df7404f5778fc833"> 1572</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a454b7a5f7437a257df7404f5778fc833">ReconstructFromNeighbors::add_codes</a>(<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x)</div>
|
||
|
|
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span> {</div>
|
||
|
|
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  <span class="keywordflow">if</span> (k == 1) { <span class="comment">// nothing to encode</span></div>
|
||
|
|
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  ntotal += n;</div>
|
||
|
|
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  <span class="keywordflow">return</span>;</div>
|
||
|
|
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  }</div>
|
||
|
|
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  codes.resize(codes.size() + code_size * n);</div>
|
||
|
|
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
||
|
|
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a88ca99742dccc52ebb3324b507b6c872">estimate_code</a>(x + i * index.d, ntotal + i,</div>
|
||
|
|
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  codes.data() + (ntotal + i) * code_size);</div>
|
||
|
|
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  }</div>
|
||
|
|
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  ntotal += n;</div>
|
||
|
|
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  FAISS_ASSERT (codes.size() == ntotal * code_size);</div>
|
||
|
|
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span> }</div>
|
||
|
|
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span> </div>
|
||
|
|
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span> </div>
|
||
|
|
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span> <span class="comment"> * IndexHNSWFlat implementation</span></div>
|
||
|
|
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span> </div>
|
||
|
|
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span> </div>
|
||
|
|
<div class="line"><a name="l01594"></a><span class="lineno"><a class="line" href="structfaiss_1_1FlatL2Dis.html"> 1594</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1FlatL2Dis.html">FlatL2Dis</a>: <a class="code" href="structfaiss_1_1HNSW_1_1DistanceComputer.html">HNSW::DistanceComputer</a> {</div>
|
||
|
|
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  <a class="code" href="structfaiss_1_1Index.html#a040c6aed1f224f3ea7bf58eebc0c31a4">Index::idx_t</a> nb;</div>
|
||
|
|
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *q;</div>
|
||
|
|
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *b;</div>
|
||
|
|
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  <span class="keywordtype">size_t</span> ndis;</div>
|
||
|
|
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span> </div>
|
||
|
|
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  <span class="keywordtype">float</span> operator () (storage_idx_t i)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  ndis++;</div>
|
||
|
|
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  <span class="keywordflow">return</span> (<a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(q, b + i * d, d));</div>
|
||
|
|
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  }</div>
|
||
|
|
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span> </div>
|
||
|
|
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  <span class="keywordtype">float</span> symmetric_dis(storage_idx_t i, storage_idx_t j)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  <span class="keywordflow">return</span> (<a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(b + j * d, b + i * d, d));</div>
|
||
|
|
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  }</div>
|
||
|
|
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span> </div>
|
||
|
|
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span> </div>
|
||
|
|
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  <a class="code" href="structfaiss_1_1FlatL2Dis.html">FlatL2Dis</a>(<span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexFlatL2.html">IndexFlatL2</a> & storage, <span class="keyword">const</span> <span class="keywordtype">float</span> *q = <span class="keyword">nullptr</span>):</div>
|
||
|
|
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  q(q)</div>
|
||
|
|
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  {</div>
|
||
|
|
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  nb = storage.<a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>;</div>
|
||
|
|
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  d = storage.<a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>;</div>
|
||
|
|
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  b = storage.<a class="code" href="structfaiss_1_1IndexFlat.html#a9001de47890fe5d2eced9551d3613d47">xb</a>.data();</div>
|
||
|
|
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  ndis = 0;</div>
|
||
|
|
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  }</div>
|
||
|
|
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span> </div>
|
||
|
|
<div class="line"><a name="l01621"></a><span class="lineno"><a class="line" href="structfaiss_1_1FlatL2Dis.html#a9982374debdda67f3db647ffc0d3fc4b"> 1621</a></span>  <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1FlatL2Dis.html#a9982374debdda67f3db647ffc0d3fc4b">set_query</a>(<span class="keyword">const</span> <span class="keywordtype">float</span> *x)<span class="keyword"> override </span>{</div>
|
||
|
|
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  q = x;</div>
|
||
|
|
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  }</div>
|
||
|
|
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span> </div>
|
||
|
|
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  <span class="keyword">virtual</span> ~<a class="code" href="structfaiss_1_1FlatL2Dis.html">FlatL2Dis</a> () {</div>
|
||
|
|
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span> <span class="preprocessor">#pragma omp critical</span></div>
|
||
|
|
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  hnsw_stats.ndis += ndis;</div>
|
||
|
|
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  }</div>
|
||
|
|
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  }</div>
|
||
|
|
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span> };</div>
|
||
|
|
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span> </div>
|
||
|
|
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span> </div>
|
||
|
|
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span> IndexHNSWFlat::IndexHNSWFlat()</div>
|
||
|
|
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span> {</div>
|
||
|
|
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a> = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span> }</div>
|
||
|
|
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span> </div>
|
||
|
|
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span> </div>
|
||
|
|
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span> IndexHNSWFlat::IndexHNSWFlat(<span class="keywordtype">int</span> d, <span class="keywordtype">int</span> M):</div>
|
||
|
|
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  IndexHNSW(new IndexFlatL2(d), M)</div>
|
||
|
|
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span> {</div>
|
||
|
|
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  own_fields = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  is_trained = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span> }</div>
|
||
|
|
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span> </div>
|
||
|
|
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span> </div>
|
||
|
|
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span> HNSW::DistanceComputer * IndexHNSWFlat::get_distance_computer ()<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> FlatL2Dis (*dynamic_cast<IndexFlatL2*> (storage));</div>
|
||
|
|
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span> }</div>
|
||
|
|
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span> </div>
|
||
|
|
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span> </div>
|
||
|
|
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span> </div>
|
||
|
|
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span> </div>
|
||
|
|
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span> <span class="comment"> * IndexHNSWPQ implementation</span></div>
|
||
|
|
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span> </div>
|
||
|
|
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span> </div>
|
||
|
|
<div class="line"><a name="l01661"></a><span class="lineno"><a class="line" href="structfaiss_1_1PQDis.html"> 1661</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1PQDis.html">PQDis</a>: <a class="code" href="structfaiss_1_1HNSW_1_1DistanceComputer.html">HNSW::DistanceComputer</a> {</div>
|
||
|
|
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  <a class="code" href="structfaiss_1_1Index.html#a040c6aed1f224f3ea7bf58eebc0c31a4">Index::idx_t</a> nb;</div>
|
||
|
|
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  <span class="keyword">const</span> uint8_t *codes;</div>
|
||
|
|
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  <span class="keywordtype">size_t</span> code_size;</div>
|
||
|
|
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1ProductQuantizer.html">ProductQuantizer</a> & pq;</div>
|
||
|
|
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *sdc;</div>
|
||
|
|
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  std::vector<float> precomputed_table;</div>
|
||
|
|
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  <span class="keywordtype">size_t</span> ndis;</div>
|
||
|
|
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span> </div>
|
||
|
|
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  <span class="keywordtype">float</span> operator () (storage_idx_t i)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  <span class="keyword">const</span> uint8_t *code = codes + i * code_size;</div>
|
||
|
|
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *dt = precomputed_table.data();</div>
|
||
|
|
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <span class="keywordtype">float</span> accu = 0;</div>
|
||
|
|
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a>; j++) {</div>
|
||
|
|
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  accu += dt[*code++];</div>
|
||
|
|
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  dt += 256;</div>
|
||
|
|
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  }</div>
|
||
|
|
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  ndis++;</div>
|
||
|
|
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  <span class="keywordflow">return</span> accu;</div>
|
||
|
|
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  }</div>
|
||
|
|
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span> </div>
|
||
|
|
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  <span class="keywordtype">float</span> symmetric_dis(storage_idx_t i, storage_idx_t j)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * sdci = sdc;</div>
|
||
|
|
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  <span class="keywordtype">float</span> accu = 0;</div>
|
||
|
|
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  <span class="keyword">const</span> uint8_t *codei = codes + i * code_size;</div>
|
||
|
|
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  <span class="keyword">const</span> uint8_t *codej = codes + j * code_size;</div>
|
||
|
|
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span> </div>
|
||
|
|
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l < pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a>; l++) {</div>
|
||
|
|
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  accu += sdci[(*codei++) + (*codej++) * 256];</div>
|
||
|
|
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  sdci += 256 * 256;</div>
|
||
|
|
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  }</div>
|
||
|
|
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  <span class="keywordflow">return</span> accu;</div>
|
||
|
|
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  }</div>
|
||
|
|
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span> </div>
|
||
|
|
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span> </div>
|
||
|
|
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  <a class="code" href="structfaiss_1_1PQDis.html">PQDis</a>(<span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexPQ.html">IndexPQ</a> & storage, <span class="keyword">const</span> <span class="keywordtype">float</span> *q = <span class="keyword">nullptr</span>):</div>
|
||
|
|
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  pq(storage.<a class="code" href="structfaiss_1_1IndexPQ.html#aa7b7cfe0c8dfd37c8a940fd93d12dc88">pq</a>)</div>
|
||
|
|
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  {</div>
|
||
|
|
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  precomputed_table.resize(pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a> * pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a0feee45e4151547b7a0444c14bad398f">ksub</a>);</div>
|
||
|
|
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  nb = storage.<a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>;</div>
|
||
|
|
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  d = storage.<a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>;</div>
|
||
|
|
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  codes = storage.<a class="code" href="structfaiss_1_1IndexPQ.html#a490b64b12384951ed66548a3a48f91e5">codes</a>.data();</div>
|
||
|
|
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  code_size = pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#aa61330eadb84772b71018b093773a5f9">code_size</a>;</div>
|
||
|
|
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  FAISS_ASSERT(pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a0feee45e4151547b7a0444c14bad398f">ksub</a> == 256);</div>
|
||
|
|
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  FAISS_ASSERT(pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a6bd65fb4407452f73acb7242931d09e4">sdc_table</a>.size() == pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a0feee45e4151547b7a0444c14bad398f">ksub</a> * pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a0feee45e4151547b7a0444c14bad398f">ksub</a> * pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a>);</div>
|
||
|
|
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  sdc = pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a6bd65fb4407452f73acb7242931d09e4">sdc_table</a>.data();</div>
|
||
|
|
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  ndis = 0;</div>
|
||
|
|
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  }</div>
|
||
|
|
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span> </div>
|
||
|
|
<div class="line"><a name="l01712"></a><span class="lineno"><a class="line" href="structfaiss_1_1PQDis.html#a3f19b9d5375526901e16f88a9b310e03"> 1712</a></span>  <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1PQDis.html#a3f19b9d5375526901e16f88a9b310e03">set_query</a>(<span class="keyword">const</span> <span class="keywordtype">float</span> *x)<span class="keyword"> override </span>{</div>
|
||
|
|
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a36361f41bcd2fa698f3c39eb7111ed09">compute_distance_table</a>(x, precomputed_table.data());</div>
|
||
|
|
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  }</div>
|
||
|
|
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span> </div>
|
||
|
|
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  <span class="keyword">virtual</span> ~<a class="code" href="structfaiss_1_1PQDis.html">PQDis</a> () {</div>
|
||
|
|
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span> <span class="preprocessor">#pragma omp critical</span></div>
|
||
|
|
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  hnsw_stats.ndis += ndis;</div>
|
||
|
|
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  }</div>
|
||
|
|
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  }</div>
|
||
|
|
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span> };</div>
|
||
|
|
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span> </div>
|
||
|
|
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span> IndexHNSWPQ::IndexHNSWPQ() {}</div>
|
||
|
|
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span> </div>
|
||
|
|
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span> IndexHNSWPQ::IndexHNSWPQ(<span class="keywordtype">int</span> d, <span class="keywordtype">int</span> pq_m, <span class="keywordtype">int</span> M):</div>
|
||
|
|
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  IndexHNSW(new IndexPQ(d, pq_m, 8), M)</div>
|
||
|
|
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span> {</div>
|
||
|
|
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  own_fields = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  is_trained = <span class="keyword">false</span>;</div>
|
||
|
|
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span> }</div>
|
||
|
|
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span> </div>
|
||
|
|
<div class="line"><a name="l01733"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSWPQ.html#ae99b976eeb25717d10055b1786aa011c"> 1733</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSWPQ.html#ae99b976eeb25717d10055b1786aa011c">IndexHNSWPQ::train</a>(idx_t n, <span class="keyword">const</span> <span class="keywordtype">float</span>* x)</div>
|
||
|
|
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span> {</div>
|
||
|
|
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  <a class="code" href="structfaiss_1_1IndexHNSW.html#a40bc6d2c67545f95e322c63d68a47140">IndexHNSW::train</a> (n, x);</div>
|
||
|
|
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  (<span class="keyword">dynamic_cast<</span><a class="code" href="structfaiss_1_1IndexPQ.html">IndexPQ</a>*<span class="keyword">></span> (storage))->pq.compute_sdc_table();</div>
|
||
|
|
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span> }</div>
|
||
|
|
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span> </div>
|
||
|
|
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span> </div>
|
||
|
|
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span> </div>
|
||
|
|
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span> <a class="code" href="structfaiss_1_1HNSW_1_1DistanceComputer.html">HNSW::DistanceComputer</a> * IndexHNSWPQ::get_distance_computer ()<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="structfaiss_1_1PQDis.html">PQDis</a> (*dynamic_cast<IndexPQ*> (storage));</div>
|
||
|
|
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span> }</div>
|
||
|
|
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span> </div>
|
||
|
|
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span> </div>
|
||
|
|
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span> <span class="comment"> * IndexHNSWSQ implementation</span></div>
|
||
|
|
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span> </div>
|
||
|
|
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span> </div>
|
||
|
|
<div class="line"><a name="l01752"></a><span class="lineno"><a class="line" href="structfaiss_1_1SQDis.html"> 1752</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1SQDis.html">SQDis</a>: <a class="code" href="structfaiss_1_1HNSW_1_1DistanceComputer.html">HNSW::DistanceComputer</a> {</div>
|
||
|
|
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  <a class="code" href="structfaiss_1_1Index.html#a040c6aed1f224f3ea7bf58eebc0c31a4">Index::idx_t</a> nb;</div>
|
||
|
|
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  <span class="keyword">const</span> uint8_t *codes;</div>
|
||
|
|
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  <span class="keywordtype">size_t</span> code_size;</div>
|
||
|
|
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1ScalarQuantizer.html">ScalarQuantizer</a> & sq;</div>
|
||
|
|
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *q;</div>
|
||
|
|
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  <a class="code" href="structfaiss_1_1ScalarQuantizer_1_1DistanceComputer.html">ScalarQuantizer::DistanceComputer</a> * dc;</div>
|
||
|
|
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span> </div>
|
||
|
|
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  <span class="keywordtype">float</span> operator () (storage_idx_t i)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  <span class="keyword">const</span> uint8_t *code = codes + i * code_size;</div>
|
||
|
|
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span> </div>
|
||
|
|
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="keywordflow">return</span> dc-><a class="code" href="structfaiss_1_1ScalarQuantizer_1_1DistanceComputer.html#a6776bc6fc6c48335f132afa4ac38df33">compute_distance</a> (q, code);</div>
|
||
|
|
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  }</div>
|
||
|
|
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span> </div>
|
||
|
|
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  <span class="keywordtype">float</span> symmetric_dis(storage_idx_t i, storage_idx_t j)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  <span class="keyword">const</span> uint8_t *codei = codes + i * code_size;</div>
|
||
|
|
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  <span class="keyword">const</span> uint8_t *codej = codes + j * code_size;</div>
|
||
|
|
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  <span class="keywordflow">return</span> dc-><a class="code" href="structfaiss_1_1ScalarQuantizer_1_1DistanceComputer.html#a96caf21f52fcf6591d7b6b4f3fc8a729">compute_code_distance</a> (codei, codej);</div>
|
||
|
|
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  }</div>
|
||
|
|
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span> </div>
|
||
|
|
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span> </div>
|
||
|
|
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <a class="code" href="structfaiss_1_1SQDis.html">SQDis</a>(<span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexScalarQuantizer.html">IndexScalarQuantizer</a> & storage, <span class="keyword">const</span> <span class="keywordtype">float</span> *q = <span class="keyword">nullptr</span>):</div>
|
||
|
|
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  sq(storage.<a class="code" href="structfaiss_1_1IndexScalarQuantizer.html#a71381f74754d8a54812e80af46a2a83a">sq</a>)</div>
|
||
|
|
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  {</div>
|
||
|
|
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  nb = storage.<a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>;</div>
|
||
|
|
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  d = storage.<a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>;</div>
|
||
|
|
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  codes = storage.<a class="code" href="structfaiss_1_1IndexScalarQuantizer.html#a861fa059f9d4ced9147e08193a2be9be">codes</a>.data();</div>
|
||
|
|
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  code_size = sq.<a class="code" href="structfaiss_1_1ScalarQuantizer.html#a647b8774e4cd8ca5623a194f5c7f8a33">code_size</a>;</div>
|
||
|
|
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  dc = sq.get_distance_computer();</div>
|
||
|
|
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  }</div>
|
||
|
|
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span> </div>
|
||
|
|
<div class="line"><a name="l01785"></a><span class="lineno"><a class="line" href="structfaiss_1_1SQDis.html#a67cd2b8275b5983de5709ec4767feb13"> 1785</a></span>  <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1SQDis.html#a67cd2b8275b5983de5709ec4767feb13">set_query</a>(<span class="keyword">const</span> <span class="keywordtype">float</span> *x)<span class="keyword"> override </span>{</div>
|
||
|
|
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  q = x;</div>
|
||
|
|
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  }</div>
|
||
|
|
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span> </div>
|
||
|
|
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  <span class="keyword">virtual</span> ~<a class="code" href="structfaiss_1_1SQDis.html">SQDis</a> () {</div>
|
||
|
|
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  <span class="keyword">delete</span> dc;</div>
|
||
|
|
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  }</div>
|
||
|
|
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span> };</div>
|
||
|
|
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span> </div>
|
||
|
|
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span> IndexHNSWSQ::IndexHNSWSQ(<span class="keywordtype">int</span> d, <a class="code" href="structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e">ScalarQuantizer::QuantizerType</a> qtype, <span class="keywordtype">int</span> M):</div>
|
||
|
|
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  IndexHNSW (new IndexScalarQuantizer (d, qtype), M)</div>
|
||
|
|
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span> {</div>
|
||
|
|
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  own_fields = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l01798"></a><span class="lineno"> 1798</span> }</div>
|
||
|
|
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span> </div>
|
||
|
|
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span> IndexHNSWSQ::IndexHNSWSQ() {}</div>
|
||
|
|
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span> </div>
|
||
|
|
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span> HNSW::DistanceComputer * IndexHNSWSQ::get_distance_computer ()<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> SQDis (*dynamic_cast<IndexScalarQuantizer*> (storage));</div>
|
||
|
|
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span> }</div>
|
||
|
|
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span> </div>
|
||
|
|
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span> </div>
|
||
|
|
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span> </div>
|
||
|
|
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span> </div>
|
||
|
|
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span> <span class="comment">/**************************************************************</span></div>
|
||
|
|
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span> <span class="comment"> * IndexHNSW2Level implementation</span></div>
|
||
|
|
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span> <span class="comment"> **************************************************************/</span></div>
|
||
|
|
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span> </div>
|
||
|
|
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span> </div>
|
||
|
|
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span> </div>
|
||
|
|
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span> IndexHNSW2Level::IndexHNSW2Level(Index *quantizer, <span class="keywordtype">size_t</span> nlist, <span class="keywordtype">int</span> m_pq, <span class="keywordtype">int</span> M):</div>
|
||
|
|
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  IndexHNSW (new Index2Layer (quantizer, nlist, m_pq), M)</div>
|
||
|
|
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span> {</div>
|
||
|
|
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  own_fields = <span class="keyword">true</span>;</div>
|
||
|
|
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  is_trained = <span class="keyword">false</span>;</div>
|
||
|
|
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span> }</div>
|
||
|
|
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span> </div>
|
||
|
|
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span> IndexHNSW2Level::IndexHNSW2Level() {}</div>
|
||
|
|
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span> </div>
|
||
|
|
<div class="line"><a name="l01825"></a><span class="lineno"><a class="line" href="structfaiss_1_1Distance2Level.html"> 1825</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1Distance2Level.html">Distance2Level</a>: <a class="code" href="structfaiss_1_1HNSW_1_1DistanceComputer.html">HNSW::DistanceComputer</a> {</div>
|
||
|
|
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span> </div>
|
||
|
|
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a> & storage;</div>
|
||
|
|
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  std::vector<float> buf;</div>
|
||
|
|
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *q;</div>
|
||
|
|
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span> </div>
|
||
|
|
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *pq_l1_tab, *pq_l2_tab;</div>
|
||
|
|
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span> </div>
|
||
|
|
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  <a class="code" href="structfaiss_1_1Distance2Level.html">Distance2Level</a>(<span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a> & storage): storage(storage)</div>
|
||
|
|
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  {</div>
|
||
|
|
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  d = storage.<a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>;</div>
|
||
|
|
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  FAISS_ASSERT(storage.<a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a467b451ca203544e42c250e4be65b983">dsub</a> == 4);</div>
|
||
|
|
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  pq_l2_tab = storage.<a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#aab1109a29ba0544358e274d727b23cae">centroids</a>.data();</div>
|
||
|
|
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  buf.resize(2 * d);</div>
|
||
|
|
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  }</div>
|
||
|
|
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span> </div>
|
||
|
|
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  <span class="keywordtype">float</span> symmetric_dis(storage_idx_t i, storage_idx_t j)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  storage.<a class="code" href="structfaiss_1_1Index2Layer.html#af2e505c14e62234eb251fcb37ef012d2">reconstruct</a>(i, buf.data());</div>
|
||
|
|
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  storage.<a class="code" href="structfaiss_1_1Index2Layer.html#af2e505c14e62234eb251fcb37ef012d2">reconstruct</a>(j, buf.data() + d);</div>
|
||
|
|
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  <span class="keywordflow">return</span> <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(buf.data() + d, buf.data(), d);</div>
|
||
|
|
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  }</div>
|
||
|
|
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span> </div>
|
||
|
|
<div class="line"><a name="l01848"></a><span class="lineno"><a class="line" href="structfaiss_1_1Distance2Level.html#aaae1348a619161ba59ff854b941137da"> 1848</a></span>  <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1Distance2Level.html#aaae1348a619161ba59ff854b941137da">set_query</a>(<span class="keyword">const</span> <span class="keywordtype">float</span> *x)<span class="keyword"> override </span>{</div>
|
||
|
|
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  q = x;</div>
|
||
|
|
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  }</div>
|
||
|
|
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span> </div>
|
||
|
|
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span> </div>
|
||
|
|
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span> };</div>
|
||
|
|
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</span> </div>
|
||
|
|
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span> </div>
|
||
|
|
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span> <span class="comment">// well optimized for xNN+PQNN</span></div>
|
||
|
|
<div class="line"><a name="l01857"></a><span class="lineno"><a class="line" href="structfaiss_1_1DistanceXPQ4.html"> 1857</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1DistanceXPQ4.html">DistanceXPQ4</a>: <a class="code" href="structfaiss_1_1Distance2Level.html">Distance2Level</a> {</div>
|
||
|
|
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span> </div>
|
||
|
|
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  <span class="keywordtype">int</span> M, k;</div>
|
||
|
|
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span> </div>
|
||
|
|
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  <a class="code" href="structfaiss_1_1DistanceXPQ4.html">DistanceXPQ4</a>(<span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a> & storage):</div>
|
||
|
|
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  <a class="code" href="structfaiss_1_1Distance2Level.html">Distance2Level</a> (storage)</div>
|
||
|
|
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  {</div>
|
||
|
|
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexFlat.html">IndexFlat</a> *quantizer =</div>
|
||
|
|
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  <span class="keyword">dynamic_cast<</span><a class="code" href="structfaiss_1_1IndexFlat.html">IndexFlat</a>*<span class="keyword">></span> (storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>);</div>
|
||
|
|
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span> </div>
|
||
|
|
<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  FAISS_ASSERT(quantizer);</div>
|
||
|
|
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  M = storage.<a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a>;</div>
|
||
|
|
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  pq_l1_tab = quantizer-><a class="code" href="structfaiss_1_1IndexFlat.html#a9001de47890fe5d2eced9551d3613d47">xb</a>.data();</div>
|
||
|
|
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  }</div>
|
||
|
|
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span> </div>
|
||
|
|
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  <span class="keywordtype">float</span> operator () (storage_idx_t i)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  <span class="keyword">const</span> uint8_t *code = storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a8e6bcfa690ac5ab1636b3d89b144f2d9">codes</a>.data() + i * storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a66403863c8ec987ed83b4d7ef4064fe9">code_size</a>;</div>
|
||
|
|
<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  <span class="keywordtype">long</span> key = 0;</div>
|
||
|
|
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  memcpy (&key, code, storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a735b2b6cc50e4186776a8213d2679837">code_size_1</a>);</div>
|
||
|
|
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  code += storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a735b2b6cc50e4186776a8213d2679837">code_size_1</a>;</div>
|
||
|
|
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span> </div>
|
||
|
|
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  <span class="comment">// walking pointers</span></div>
|
||
|
|
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *qa = q;</div>
|
||
|
|
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  <span class="keyword">const</span> __m128 *l1_t = (<span class="keyword">const</span> __m128 *)(pq_l1_tab + d * key);</div>
|
||
|
|
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  <span class="keyword">const</span> __m128 *pq_l2_t = (<span class="keyword">const</span> __m128 *)pq_l2_tab;</div>
|
||
|
|
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>  __m128 accu = _mm_setzero_ps();</div>
|
||
|
|
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span> </div>
|
||
|
|
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> m = 0; m < M; m++) {</div>
|
||
|
|
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  __m128 qi = _mm_loadu_ps(qa);</div>
|
||
|
|
<div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>  __m128 recons = l1_t[m] + pq_l2_t[*code++];</div>
|
||
|
|
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>  __m128 diff = qi - recons;</div>
|
||
|
|
<div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  accu += diff * diff;</div>
|
||
|
|
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  pq_l2_t += 256;</div>
|
||
|
|
<div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  qa += 4;</div>
|
||
|
|
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  }</div>
|
||
|
|
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span> </div>
|
||
|
|
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  accu = _mm_hadd_ps (accu, accu);</div>
|
||
|
|
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  accu = _mm_hadd_ps (accu, accu);</div>
|
||
|
|
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  <span class="keywordflow">return</span> _mm_cvtss_f32 (accu);</div>
|
||
|
|
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  }</div>
|
||
|
|
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span> </div>
|
||
|
|
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</span> };</div>
|
||
|
|
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span> </div>
|
||
|
|
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span> <span class="comment">// well optimized for 2xNN+PQNN</span></div>
|
||
|
|
<div class="line"><a name="l01902"></a><span class="lineno"><a class="line" href="structfaiss_1_1Distance2xXPQ4.html"> 1902</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1Distance2xXPQ4.html">Distance2xXPQ4</a>: <a class="code" href="structfaiss_1_1Distance2Level.html">Distance2Level</a> {</div>
|
||
|
|
<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span> </div>
|
||
|
|
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  <span class="keywordtype">int</span> M_2, mi_nbits;</div>
|
||
|
|
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span> </div>
|
||
|
|
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  <a class="code" href="structfaiss_1_1Distance2xXPQ4.html">Distance2xXPQ4</a>(<span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a> & storage):</div>
|
||
|
|
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  <a class="code" href="structfaiss_1_1Distance2Level.html">Distance2Level</a> (storage)</div>
|
||
|
|
<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  {</div>
|
||
|
|
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1MultiIndexQuantizer.html">MultiIndexQuantizer</a> *mi =</div>
|
||
|
|
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  <span class="keyword">dynamic_cast<</span><a class="code" href="structfaiss_1_1MultiIndexQuantizer.html">MultiIndexQuantizer</a>*<span class="keyword">></span> (storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>);</div>
|
||
|
|
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span> </div>
|
||
|
|
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  FAISS_ASSERT(mi);</div>
|
||
|
|
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  FAISS_ASSERT(storage.<a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a> % 2 == 0);</div>
|
||
|
|
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  M_2 = storage.<a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a> / 2;</div>
|
||
|
|
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  mi_nbits = mi->pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#ac920fea11f02e8407d12cc99a09f5ea5">nbits</a>;</div>
|
||
|
|
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  pq_l1_tab = mi->pq.<a class="code" href="structfaiss_1_1ProductQuantizer.html#aab1109a29ba0544358e274d727b23cae">centroids</a>.data();</div>
|
||
|
|
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  }</div>
|
||
|
|
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span> </div>
|
||
|
|
<div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  <span class="keywordtype">float</span> operator () (storage_idx_t i)<span class="keyword"> override</span></div>
|
||
|
|
<div class="line"><a name="l01920"></a><span class="lineno"> 1920</span> <span class="keyword"> </span>{</div>
|
||
|
|
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  <span class="keyword">const</span> uint8_t *code = storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a8e6bcfa690ac5ab1636b3d89b144f2d9">codes</a>.data() + i * storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a66403863c8ec987ed83b4d7ef4064fe9">code_size</a>;</div>
|
||
|
|
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  <span class="keywordtype">long</span> key01 = 0;</div>
|
||
|
|
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  memcpy (&key01, code, storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a735b2b6cc50e4186776a8213d2679837">code_size_1</a>);</div>
|
||
|
|
<div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  code += storage.<a class="code" href="structfaiss_1_1Index2Layer.html#a735b2b6cc50e4186776a8213d2679837">code_size_1</a>;</div>
|
||
|
|
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span> </div>
|
||
|
|
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  <span class="comment">// walking pointers</span></div>
|
||
|
|
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *qa = q;</div>
|
||
|
|
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  <span class="keyword">const</span> __m128 *pq_l1_t = (<span class="keyword">const</span> __m128 *)pq_l1_tab;</div>
|
||
|
|
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  <span class="keyword">const</span> __m128 *pq_l2_t = (<span class="keyword">const</span> __m128 *)pq_l2_tab;</div>
|
||
|
|
<div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  __m128 accu = _mm_setzero_ps();</div>
|
||
|
|
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span> </div>
|
||
|
|
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> mi_m = 0; mi_m < 2; mi_m++) {</div>
|
||
|
|
<div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  <span class="keywordtype">long</span> l1_idx = key01 & ((1L << mi_nbits) - 1);</div>
|
||
|
|
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  <span class="keyword">const</span> __m128 * pq_l1 = pq_l1_t + M_2 * l1_idx;</div>
|
||
|
|
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span> </div>
|
||
|
|
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> m = 0; m < M_2; m++) {</div>
|
||
|
|
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  __m128 qi = _mm_loadu_ps(qa);</div>
|
||
|
|
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  __m128 recons = pq_l1[m] + pq_l2_t[*code++];</div>
|
||
|
|
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  __m128 diff = qi - recons;</div>
|
||
|
|
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  accu += diff * diff;</div>
|
||
|
|
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  pq_l2_t += 256;</div>
|
||
|
|
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  qa += 4;</div>
|
||
|
|
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  }</div>
|
||
|
|
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  pq_l1_t += M_2 << mi_nbits;</div>
|
||
|
|
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  key01 >>= mi_nbits;</div>
|
||
|
|
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  }</div>
|
||
|
|
<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  accu = _mm_hadd_ps (accu, accu);</div>
|
||
|
|
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  accu = _mm_hadd_ps (accu, accu);</div>
|
||
|
|
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  <span class="keywordflow">return</span> _mm_cvtss_f32 (accu);</div>
|
||
|
|
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  }</div>
|
||
|
|
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span> </div>
|
||
|
|
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span> };</div>
|
||
|
|
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span> </div>
|
||
|
|
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span> </div>
|
||
|
|
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span> </div>
|
||
|
|
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span> <a class="code" href="structfaiss_1_1HNSW_1_1DistanceComputer.html">HNSW::DistanceComputer</a> * IndexHNSW2Level::get_distance_computer ()<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a> *storage2l =</div>
|
||
|
|
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  <span class="keyword">dynamic_cast<</span><a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a>*<span class="keyword">></span>(storage);</div>
|
||
|
|
<div class="line"><a name="l01960"></a><span class="lineno"> 1960</span> </div>
|
||
|
|
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  <span class="keywordflow">if</span> (storage2l) {</div>
|
||
|
|
<div class="line"><a name="l01962"></a><span class="lineno"> 1962</span> </div>
|
||
|
|
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1MultiIndexQuantizer.html">MultiIndexQuantizer</a> *mi =</div>
|
||
|
|
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  <span class="keyword">dynamic_cast<</span><a class="code" href="structfaiss_1_1MultiIndexQuantizer.html">MultiIndexQuantizer</a>*<span class="keyword">></span> (storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>);</div>
|
||
|
|
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span> </div>
|
||
|
|
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="keywordflow">if</span> (mi && storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a> % 2 == 0 && storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a467b451ca203544e42c250e4be65b983">dsub</a> == 4) {</div>
|
||
|
|
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="structfaiss_1_1Distance2xXPQ4.html">Distance2xXPQ4</a>(*storage2l);</div>
|
||
|
|
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  }</div>
|
||
|
|
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span> </div>
|
||
|
|
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  <span class="keyword">const</span> IndexFlat *fl =</div>
|
||
|
|
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  <span class="keyword">dynamic_cast<</span>IndexFlat*<span class="keyword">></span> (storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>);</div>
|
||
|
|
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span> </div>
|
||
|
|
<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  <span class="keywordflow">if</span> (fl && storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a467b451ca203544e42c250e4be65b983">dsub</a> == 4) {</div>
|
||
|
|
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> DistanceXPQ4(*storage2l);</div>
|
||
|
|
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  }</div>
|
||
|
|
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  }</div>
|
||
|
|
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span> </div>
|
||
|
|
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  <span class="comment">// IVFPQ and cases not handled above</span></div>
|
||
|
|
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> GenericDistanceComputer (*storage);</div>
|
||
|
|
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span> </div>
|
||
|
|
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span> }</div>
|
||
|
|
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span> </div>
|
||
|
|
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span> </div>
|
||
|
|
<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span> <span class="keyword">namespace </span>{</div>
|
||
|
|
<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span> </div>
|
||
|
|
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span> </div>
|
||
|
|
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span> <span class="comment">// same as search_from_candidates but uses v</span></div>
|
||
|
|
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span> <span class="comment">// visno -> is in result list</span></div>
|
||
|
|
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span> <span class="comment">// visno + 1 -> in result list + in candidates</span></div>
|
||
|
|
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span> <span class="keywordtype">int</span> search_from_candidates_2(<span class="keyword">const</span> HNSW & hnsw,</div>
|
||
|
|
<div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  DistanceComputer & qdis, <span class="keywordtype">int</span> k,</div>
|
||
|
|
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  idx_t *I, <span class="keywordtype">float</span> * D,</div>
|
||
|
|
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  MinimaxHeap &candidates,</div>
|
||
|
|
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  VisitedTable &vt,</div>
|
||
|
|
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  <span class="keywordtype">int</span> level, <span class="keywordtype">int</span> nres_in = 0)</div>
|
||
|
|
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span> {</div>
|
||
|
|
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  <span class="keywordtype">int</span> nres = nres_in;</div>
|
||
|
|
<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  <span class="keywordtype">int</span> ndis = 0;</div>
|
||
|
|
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < candidates.size(); i++) {</div>
|
||
|
|
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  idx_t v1 = candidates.ids[i];</div>
|
||
|
|
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  <span class="keywordtype">float</span> d = candidates.dis[i];</div>
|
||
|
|
<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  FAISS_ASSERT(v1 >= 0);</div>
|
||
|
|
<div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  vt.visited[v1] = vt.visno + 1;</div>
|
||
|
|
<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  }</div>
|
||
|
|
<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span> </div>
|
||
|
|
<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  <span class="keywordtype">bool</span> do_dis_check = hnsw.check_relative_distance;</div>
|
||
|
|
<div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  <span class="keywordtype">int</span> nstep = 0;</div>
|
||
|
|
<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span> </div>
|
||
|
|
<div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  <span class="keywordflow">while</span> (candidates.size() > 0) {</div>
|
||
|
|
<div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  <span class="keywordtype">float</span> d0 = 0;</div>
|
||
|
|
<div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  <span class="keywordtype">int</span> v0 = candidates.pop_min(&d0);</div>
|
||
|
|
<div class="line"><a name="l02012"></a><span class="lineno"> 2012</span> </div>
|
||
|
|
<div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  <span class="keywordflow">if</span> (do_dis_check) {</div>
|
||
|
|
<div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  <span class="comment">// tricky stopping condition: there are more that ef</span></div>
|
||
|
|
<div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  <span class="comment">// distances that are processed already that are smaller</span></div>
|
||
|
|
<div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  <span class="comment">// than d0</span></div>
|
||
|
|
<div class="line"><a name="l02017"></a><span class="lineno"> 2017</span> </div>
|
||
|
|
<div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  <span class="keywordtype">int</span> n_dis_below = candidates.count_below(d0);</div>
|
||
|
|
<div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  <span class="keywordflow">if</span>(n_dis_below >= hnsw.efSearch) {</div>
|
||
|
|
<div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  }</div>
|
||
|
|
<div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  }</div>
|
||
|
|
<div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  <span class="keywordtype">size_t</span> begin, end;</div>
|
||
|
|
<div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  hnsw.neighbor_range(v0, level, &begin, &end);</div>
|
||
|
|
<div class="line"><a name="l02025"></a><span class="lineno"> 2025</span> </div>
|
||
|
|
<div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
|
||
|
|
<div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  <span class="keywordtype">int</span> v1 = hnsw.neighbors[j];</div>
|
||
|
|
<div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  <span class="keywordflow">if</span> (v1 < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  <span class="keywordflow">if</span> (vt.visited[v1] == vt.visno + 1) {</div>
|
||
|
|
<div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  <span class="comment">// nothing to do</span></div>
|
||
|
|
<div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  } <span class="keywordflow">else</span> {</div>
|
||
|
|
<div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  ndis++;</div>
|
||
|
|
<div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  <span class="keywordtype">float</span> d = qdis(v1);</div>
|
||
|
|
<div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  candidates.push(v1, d);</div>
|
||
|
|
<div class="line"><a name="l02035"></a><span class="lineno"> 2035</span> </div>
|
||
|
|
<div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  <span class="comment">// never seen before --> add to heap</span></div>
|
||
|
|
<div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  <span class="keywordflow">if</span> (vt.visited[v1] < vt.visno) {</div>
|
||
|
|
<div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  <span class="keywordflow">if</span> (nres < k) {</div>
|
||
|
|
<div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  faiss::maxheap_push (++nres, D, I, d, v1);</div>
|
||
|
|
<div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d < D[0]) {</div>
|
||
|
|
<div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  faiss::maxheap_pop (nres--, D, I);</div>
|
||
|
|
<div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  faiss::maxheap_push (++nres, D, I, d, v1);</div>
|
||
|
|
<div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  }</div>
|
||
|
|
<div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  }</div>
|
||
|
|
<div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  vt.visited[v1] = vt.visno + 1;</div>
|
||
|
|
<div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  }</div>
|
||
|
|
<div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  }</div>
|
||
|
|
<div class="line"><a name="l02048"></a><span class="lineno"> 2048</span> </div>
|
||
|
|
<div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  nstep++;</div>
|
||
|
|
<div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  <span class="keywordflow">if</span> (!do_dis_check && nstep > hnsw.efSearch) {</div>
|
||
|
|
<div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  }</div>
|
||
|
|
<div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  }</div>
|
||
|
|
<div class="line"><a name="l02054"></a><span class="lineno"> 2054</span> </div>
|
||
|
|
<div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  <span class="keywordflow">if</span> (level == 0) {</div>
|
||
|
|
<div class="line"><a name="l02056"></a><span class="lineno"> 2056</span> <span class="preprocessor">#pragma omp critical</span></div>
|
||
|
|
<div class="line"><a name="l02057"></a><span class="lineno"> 2057</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  hnsw_stats.n1 ++;</div>
|
||
|
|
<div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  <span class="keywordflow">if</span> (candidates.size() == 0)</div>
|
||
|
|
<div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  hnsw_stats.n2 ++;</div>
|
||
|
|
<div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  }</div>
|
||
|
|
<div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  }</div>
|
||
|
|
<div class="line"><a name="l02063"></a><span class="lineno"> 2063</span> </div>
|
||
|
|
<div class="line"><a name="l02064"></a><span class="lineno"> 2064</span> </div>
|
||
|
|
<div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  <span class="keywordflow">return</span> nres;</div>
|
||
|
|
<div class="line"><a name="l02066"></a><span class="lineno"> 2066</span> }</div>
|
||
|
|
<div class="line"><a name="l02067"></a><span class="lineno"> 2067</span> </div>
|
||
|
|
<div class="line"><a name="l02068"></a><span class="lineno"> 2068</span> </div>
|
||
|
|
<div class="line"><a name="l02069"></a><span class="lineno"> 2069</span> } <span class="comment">// anonymous namespace</span></div>
|
||
|
|
<div class="line"><a name="l02070"></a><span class="lineno"> 2070</span> </div>
|
||
|
|
<div class="line"><a name="l02071"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW2Level.html#a50a087a17ce5a7a1fbcca0836959b4ec"> 2071</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW2Level.html#a50a087a17ce5a7a1fbcca0836959b4ec">IndexHNSW2Level::search</a> (idx_t n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x, idx_t k,</div>
|
||
|
|
<div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  <span class="keywordtype">float</span> *distances, idx_t *labels)<span class="keyword"> const</span></div>
|
||
|
|
<div class="line"><a name="l02073"></a><span class="lineno"> 2073</span> <span class="keyword"></span>{</div>
|
||
|
|
<div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>  <span class="keywordflow">if</span> (dynamic_cast<const Index2Layer*>(storage)) {</div>
|
||
|
|
<div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  <a class="code" href="structfaiss_1_1IndexHNSW.html#ae0ddf6ab4a54239a25d6277e21e8548e">IndexHNSW::search</a> (n, x, k, distances, labels);</div>
|
||
|
|
<div class="line"><a name="l02076"></a><span class="lineno"> 2076</span> </div>
|
||
|
|
<div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  } <span class="keywordflow">else</span> { <span class="comment">// "mixed" search</span></div>
|
||
|
|
<div class="line"><a name="l02078"></a><span class="lineno"> 2078</span> </div>
|
||
|
|
<div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexIVFPQ.html">IndexIVFPQ</a> *index_ivfpq =</div>
|
||
|
|
<div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  <span class="keyword">dynamic_cast<</span><span class="keyword">const </span><a class="code" href="structfaiss_1_1IndexIVFPQ.html">IndexIVFPQ</a>*<span class="keyword">></span>(storage);</div>
|
||
|
|
<div class="line"><a name="l02081"></a><span class="lineno"> 2081</span> </div>
|
||
|
|
<div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  <span class="keywordtype">int</span> nprobe = index_ivfpq-><a class="code" href="structfaiss_1_1IndexIVF.html#affed235eadf27a13d753ee4d33a1dc58">nprobe</a>;</div>
|
||
|
|
<div class="line"><a name="l02083"></a><span class="lineno"> 2083</span> </div>
|
||
|
|
<div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  <span class="keywordtype">long</span> * coarse_assign = <span class="keyword">new</span> <span class="keywordtype">long</span> [n * nprobe];</div>
|
||
|
|
<div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  <a class="code" href="structfaiss_1_1ScopeDeleter.html">ScopeDeleter<long></a> del (coarse_assign);</div>
|
||
|
|
<div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  <span class="keywordtype">float</span> * coarse_dis = <span class="keyword">new</span> <span class="keywordtype">float</span> [n * nprobe];</div>
|
||
|
|
<div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  <a class="code" href="structfaiss_1_1ScopeDeleter.html">ScopeDeleter<float></a> del2 (coarse_dis);</div>
|
||
|
|
<div class="line"><a name="l02088"></a><span class="lineno"> 2088</span> </div>
|
||
|
|
<div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  index_ivfpq-><a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>-><a class="code" href="structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7">search</a> (n, x, nprobe, coarse_dis, coarse_assign);</div>
|
||
|
|
<div class="line"><a name="l02090"></a><span class="lineno"> 2090</span> </div>
|
||
|
|
<div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  index_ivfpq-><a class="code" href="structfaiss_1_1IndexIVFPQ.html#a150a37cf3e8a7e37cb8dab1d5678bc02">search_preassigned</a> (</div>
|
||
|
|
<div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  n, x, k, coarse_assign, coarse_dis, distances, labels, <span class="keyword">false</span>);</div>
|
||
|
|
<div class="line"><a name="l02093"></a><span class="lineno"> 2093</span> </div>
|
||
|
|
<div class="line"><a name="l02094"></a><span class="lineno"> 2094</span> <span class="preprocessor">#pragma omp parallel</span></div>
|
||
|
|
<div class="line"><a name="l02095"></a><span class="lineno"> 2095</span> <span class="preprocessor"></span> {</div>
|
||
|
|
<div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> vt (ntotal);</div>
|
||
|
|
<div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  DistanceComputer *dis = get_distance_computer();</div>
|
||
|
|
<div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1<DistanceComputer></a> del(dis);</div>
|
||
|
|
<div class="line"><a name="l02099"></a><span class="lineno"> 2099</span> </div>
|
||
|
|
<div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  <span class="keywordtype">int</span> candidates_size = hnsw.upper_beam;</div>
|
||
|
|
<div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  MinimaxHeap candidates(candidates_size);</div>
|
||
|
|
<div class="line"><a name="l02102"></a><span class="lineno"> 2102</span> </div>
|
||
|
|
<div class="line"><a name="l02103"></a><span class="lineno"> 2103</span> <span class="preprocessor">#pragma omp for</span></div>
|
||
|
|
<div class="line"><a name="l02104"></a><span class="lineno"> 2104</span> <span class="preprocessor"></span> <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
|
|
<div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  idx_t * idxi = labels + i * k;</div>
|
||
|
|
<div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  <span class="keywordtype">float</span> * simi = distances + i * k;</div>
|
||
|
|
<div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  dis->set_query(x + i * d);</div>
|
||
|
|
<div class="line"><a name="l02108"></a><span class="lineno"> 2108</span> </div>
|
||
|
|
<div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  <span class="comment">// mark all inverted list elements as visited</span></div>
|
||
|
|
<div class="line"><a name="l02110"></a><span class="lineno"> 2110</span> </div>
|
||
|
|
<div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < nprobe; j++) {</div>
|
||
|
|
<div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  idx_t key = coarse_assign[j + i * nprobe];</div>
|
||
|
|
<div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  <span class="keywordflow">if</span> (key < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  <span class="keyword">const</span> std::vector<idx_t> & ids = index_ivfpq-><a class="code" href="structfaiss_1_1IndexIVF.html#af16d325f5bef22b2e5f90ceea796e80d">ids</a>[key];</div>
|
||
|
|
<div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> jj = 0; jj < ids.size(); jj++) {</div>
|
||
|
|
<div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853">set</a> (ids[jj]);</div>
|
||
|
|
<div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  }</div>
|
||
|
|
<div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>  }</div>
|
||
|
|
<div class="line"><a name="l02119"></a><span class="lineno"> 2119</span> </div>
|
||
|
|
<div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>  candidates.clear();</div>
|
||
|
|
<div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>  <span class="comment">// copy the upper_beam elements to candidates list</span></div>
|
||
|
|
<div class="line"><a name="l02122"></a><span class="lineno"> 2122</span> </div>
|
||
|
|
<div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>  <span class="keywordtype">int</span> search_policy = 2;</div>
|
||
|
|
<div class="line"><a name="l02124"></a><span class="lineno"> 2124</span> </div>
|
||
|
|
<div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  <span class="keywordflow">if</span> (search_policy == 1) {</div>
|
||
|
|
<div class="line"><a name="l02126"></a><span class="lineno"> 2126</span> </div>
|
||
|
|
<div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0 ; j < hnsw.upper_beam && j < k; j++) {</div>
|
||
|
|
<div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  <span class="keywordflow">if</span> (idxi[j] < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  candidates.push (idxi[j], simi[j]);</div>
|
||
|
|
<div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  <span class="comment">// search_from_candidates adds them back</span></div>
|
||
|
|
<div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>  idxi[j] = -1;</div>
|
||
|
|
<div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  simi[j] = HUGE_VAL;</div>
|
||
|
|
<div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>  }</div>
|
||
|
|
<div class="line"><a name="l02134"></a><span class="lineno"> 2134</span> </div>
|
||
|
|
<div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  <span class="comment">// reorder from sorted to heap</span></div>
|
||
|
|
<div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  maxheap_heapify (k, simi, idxi, simi, idxi, k);</div>
|
||
|
|
<div class="line"><a name="l02137"></a><span class="lineno"> 2137</span> </div>
|
||
|
|
<div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  search_from_candidates (</div>
|
||
|
|
<div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  hnsw, *dis, k, idxi, simi,</div>
|
||
|
|
<div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  candidates, vt, 0, k);</div>
|
||
|
|
<div class="line"><a name="l02141"></a><span class="lineno"> 2141</span> </div>
|
||
|
|
<div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a>();</div>
|
||
|
|
<div class="line"><a name="l02143"></a><span class="lineno"> 2143</span> </div>
|
||
|
|
<div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (search_policy == 2) {</div>
|
||
|
|
<div class="line"><a name="l02145"></a><span class="lineno"> 2145</span> </div>
|
||
|
|
<div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0 ; j < hnsw.upper_beam && j < k; j++) {</div>
|
||
|
|
<div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  <span class="keywordflow">if</span> (idxi[j] < 0) <span class="keywordflow">break</span>;</div>
|
||
|
|
<div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>  candidates.push (idxi[j], simi[j]);</div>
|
||
|
|
<div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>  }</div>
|
||
|
|
<div class="line"><a name="l02150"></a><span class="lineno"> 2150</span> </div>
|
||
|
|
<div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>  <span class="comment">// reorder from sorted to heap</span></div>
|
||
|
|
<div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>  maxheap_heapify (k, simi, idxi, simi, idxi, k);</div>
|
||
|
|
<div class="line"><a name="l02153"></a><span class="lineno"> 2153</span> </div>
|
||
|
|
<div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>  search_from_candidates_2 (</div>
|
||
|
|
<div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>  hnsw, *dis, k, idxi, simi,</div>
|
||
|
|
<div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>  candidates, vt, 0, k);</div>
|
||
|
|
<div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a> ();</div>
|
||
|
|
<div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a> ();</div>
|
||
|
|
<div class="line"><a name="l02159"></a><span class="lineno"> 2159</span> </div>
|
||
|
|
<div class="line"><a name="l02160"></a><span class="lineno"> 2160</span>  }</div>
|
||
|
|
<div class="line"><a name="l02161"></a><span class="lineno"> 2161</span> </div>
|
||
|
|
<div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>  maxheap_reorder (k, simi, idxi);</div>
|
||
|
|
<div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>  }</div>
|
||
|
|
<div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>  }</div>
|
||
|
|
<div class="line"><a name="l02165"></a><span class="lineno"> 2165</span>  }</div>
|
||
|
|
<div class="line"><a name="l02166"></a><span class="lineno"> 2166</span> </div>
|
||
|
|
<div class="line"><a name="l02167"></a><span class="lineno"> 2167</span> </div>
|
||
|
|
<div class="line"><a name="l02168"></a><span class="lineno"> 2168</span> }</div>
|
||
|
|
<div class="line"><a name="l02169"></a><span class="lineno"> 2169</span> </div>
|
||
|
|
<div class="line"><a name="l02170"></a><span class="lineno"> 2170</span> </div>
|
||
|
|
<div class="line"><a name="l02171"></a><span class="lineno"> 2171</span> <span class="keywordtype">void</span> IndexHNSW2Level::flip_to_ivf ()</div>
|
||
|
|
<div class="line"><a name="l02172"></a><span class="lineno"> 2172</span> {</div>
|
||
|
|
<div class="line"><a name="l02173"></a><span class="lineno"> 2173</span>  <a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a> *storage2l =</div>
|
||
|
|
<div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>  <span class="keyword">dynamic_cast<</span><a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a>*<span class="keyword">></span>(storage);</div>
|
||
|
|
<div class="line"><a name="l02175"></a><span class="lineno"> 2175</span> </div>
|
||
|
|
<div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>  FAISS_THROW_IF_NOT (storage2l);</div>
|
||
|
|
<div class="line"><a name="l02177"></a><span class="lineno"> 2177</span> </div>
|
||
|
|
<div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>  <a class="code" href="structfaiss_1_1IndexIVFPQ.html">IndexIVFPQ</a> * index_ivfpq =</div>
|
||
|
|
<div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>  <span class="keyword">new</span> <a class="code" href="structfaiss_1_1IndexIVFPQ.html">IndexIVFPQ</a> (storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>,</div>
|
||
|
|
<div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>  d, storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#a1c4fc9d874d9492ee0ea27a5be388fa7">nlist</a>,</div>
|
||
|
|
<div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a>, 8);</div>
|
||
|
|
<div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  index_ivfpq-><a class="code" href="structfaiss_1_1IndexIVFPQ.html#a007303be116c8da65b6d058e3fc77d16">pq</a> = storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>;</div>
|
||
|
|
<div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>  index_ivfpq-><a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a> = storage2l-><a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a>;</div>
|
||
|
|
<div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>  index_ivfpq-><a class="code" href="structfaiss_1_1IndexIVFPQ.html#ad99c215aeaf92e995cb97f4044c4d267">precompute_table</a>();</div>
|
||
|
|
<div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>  index_ivfpq-><a class="code" href="structfaiss_1_1Level1Quantizer.html#ab688c629cd42122d73517078b87f483d">own_fields</a> = storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#ab688c629cd42122d73517078b87f483d">own_fields</a>;</div>
|
||
|
|
<div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  storage2l-><a class="code" href="structfaiss_1_1Index2Layer.html#a8692273ff51ab7f34748c3d5b3295216">transfer_to_IVFPQ</a>(*index_ivfpq);</div>
|
||
|
|
<div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  index_ivfpq-><a class="code" href="structfaiss_1_1IndexIVF.html#a1c11ce77f459e2ab3e5d9a4c2263ad89">make_direct_map</a> (<span class="keyword">true</span>);</div>
|
||
|
|
<div class="line"><a name="l02188"></a><span class="lineno"> 2188</span> </div>
|
||
|
|
<div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  storage = index_ivfpq;</div>
|
||
|
|
<div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  <span class="keyword">delete</span> storage2l;</div>
|
||
|
|
<div class="line"><a name="l02191"></a><span class="lineno"> 2191</span> </div>
|
||
|
|
<div class="line"><a name="l02192"></a><span class="lineno"> 2192</span> }</div>
|
||
|
|
<div class="line"><a name="l02193"></a><span class="lineno"> 2193</span> </div>
|
||
|
|
<div class="line"><a name="l02194"></a><span class="lineno"> 2194</span> </div>
|
||
|
|
<div class="line"><a name="l02195"></a><span class="lineno"> 2195</span> } <span class="comment">// namespace faiss</span></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1RandomGenerator_html"><div class="ttname"><a href="structfaiss_1_1RandomGenerator.html">faiss::RandomGenerator</a></div><div class="ttdoc">random generator that can be used in multithreaded contexts </div><div class="ttdef"><b>Definition:</b> <a href="utils_8h_source.html#l00048">utils.h:48</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexIVFPQ_html_ad99c215aeaf92e995cb97f4044c4d267"><div class="ttname"><a href="structfaiss_1_1IndexIVFPQ.html#ad99c215aeaf92e995cb97f4044c4d267">faiss::IndexIVFPQ::precompute_table</a></div><div class="ttdeci">void precompute_table()</div><div class="ttdoc">build precomputed table </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8cpp_source.html#l00344">IndexIVFPQ.cpp:344</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a314b809de6f329662ab09f258b49afb3"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a314b809de6f329662ab09f258b49afb3">faiss::HNSW::add_with_locks</a></div><div class="ttdeci">void add_with_locks(DistanceComputer &ptdis, int pt_level, int pt_id, std::vector< omp_lock_t > &locks, VisitedTable &vt)</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00657">IndexHNSW.cpp:657</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexPQ_html_a490b64b12384951ed66548a3a48f91e5"><div class="ttname"><a href="structfaiss_1_1IndexPQ.html#a490b64b12384951ed66548a3a48f91e5">faiss::IndexPQ::codes</a></div><div class="ttdeci">std::vector< uint8_t > codes</div><div class="ttdoc">Codes. Size ntotal * pq.code_size. </div><div class="ttdef"><b>Definition:</b> <a href="IndexPQ_8h_source.html#l00034">IndexPQ.h:34</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index2Layer_html_a8692273ff51ab7f34748c3d5b3295216"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#a8692273ff51ab7f34748c3d5b3295216">faiss::Index2Layer::transfer_to_IVFPQ</a></div><div class="ttdeci">void transfer_to_IVFPQ(IndexIVFPQ &other) const </div><div class="ttdoc">transfer the flat codes to an IVFPQ index </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8cpp_source.html#l01416">IndexIVFPQ.cpp:1416</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ScalarQuantizer_html_a647b8774e4cd8ca5623a194f5c7f8a33"><div class="ttname"><a href="structfaiss_1_1ScalarQuantizer.html#a647b8774e4cd8ca5623a194f5c7f8a33">faiss::ScalarQuantizer::code_size</a></div><div class="ttdeci">size_t code_size</div><div class="ttdoc">bytes per vector </div><div class="ttdef"><b>Definition:</b> <a href="IndexScalarQuantizer_8h_source.html#l00060">IndexScalarQuantizer.h:60</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ScalarQuantizer_html_a1201dbd1611fa5c10782ade5d0e4952e"><div class="ttname"><a href="structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e">faiss::ScalarQuantizer::QuantizerType</a></div><div class="ttdeci">QuantizerType</div><div class="ttdef"><b>Definition:</b> <a href="IndexScalarQuantizer_8h_source.html#l00032">IndexScalarQuantizer.h:32</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexFlat_html"><div class="ttname"><a href="structfaiss_1_1IndexFlat.html">faiss::IndexFlat</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexFlat_8h_source.html#l00023">IndexFlat.h:23</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_aa3ae6a80d358e59e3af23f918253f61d"><div class="ttname"><a href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">faiss::HNSW::neighbor_range</a></div><div class="ttdeci">void neighbor_range(idx_t no, int layer_no, size_t *begin, size_t *end) const </div><div class="ttdoc">range of entries in the neighbors table of vertex no at layer_no </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00517">IndexHNSW.cpp:517</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html_ac920fea11f02e8407d12cc99a09f5ea5"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html#ac920fea11f02e8407d12cc99a09f5ea5">faiss::ProductQuantizer::nbits</a></div><div class="ttdeci">size_t nbits</div><div class="ttdoc">number of bits per quantization index </div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8h_source.html#l00029">ProductQuantizer.h:29</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1VisitedTable_html_a18a972137362ff04a38943d66fc19dcb"><div class="ttname"><a href="structfaiss_1_1VisitedTable.html#a18a972137362ff04a38943d66fc19dcb">faiss::VisitedTable::get</a></div><div class="ttdeci">bool get(int no) const </div><div class="ttdoc">get flag #no </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00066">IndexHNSW.cpp:66</a></div></div>
|
||
|
|
<div class="ttc" id="namespacefaiss_html_a7466bd32de31640860393a701eaac5ad"><div class="ttname"><a href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">faiss::fvec_L2sqr</a></div><div class="ttdeci">float fvec_L2sqr(const float *x, const float *y, size_t d)</div><div class="ttdoc">Squared L2 distance between two vectors. </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00574">utils.cpp:574</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1SQDis_html"><div class="ttname"><a href="structfaiss_1_1SQDis.html">faiss::SQDis</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01752">IndexHNSW.cpp:1752</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSWPQ_html_ae99b976eeb25717d10055b1786aa011c"><div class="ttname"><a href="structfaiss_1_1IndexHNSWPQ.html#ae99b976eeb25717d10055b1786aa011c">faiss::IndexHNSWPQ::train</a></div><div class="ttdeci">void train(idx_t n, const float *x) override</div><div class="ttdoc">Trains the storage if needed. </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01733">IndexHNSW.cpp:1733</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1CMax_html"><div class="ttname"><a href="structfaiss_1_1CMax.html">faiss::CMax</a></div><div class="ttdef"><b>Definition:</b> <a href="Heap_8h_source.html#l00048">Heap.h:48</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_ad497ea80f352c33242ba7835370c2dba"><div class="ttname"><a href="structfaiss_1_1HNSW.html#ad497ea80f352c33242ba7835370c2dba">faiss::HNSW::nb_neighbors</a></div><div class="ttdeci">int nb_neighbors(int layer_no) const </div><div class="ttdoc">nb of neighbors for this level </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00497">IndexHNSW.cpp:497</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSW2Level_html_a50a087a17ce5a7a1fbcca0836959b4ec"><div class="ttname"><a href="structfaiss_1_1IndexHNSW2Level.html#a50a087a17ce5a7a1fbcca0836959b4ec">faiss::IndexHNSW2Level::search</a></div><div class="ttdeci">void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override</div><div class="ttdoc">entry point for search </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l02071">IndexHNSW.cpp:2071</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexScalarQuantizer_html"><div class="ttname"><a href="structfaiss_1_1IndexScalarQuantizer.html">faiss::IndexScalarQuantizer</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexScalarQuantizer_8h_source.html#l00099">IndexScalarQuantizer.h:99</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index2Layer_html_a66403863c8ec987ed83b4d7ef4064fe9"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#a66403863c8ec987ed83b4d7ef4064fe9">faiss::Index2Layer::code_size</a></div><div class="ttdeci">size_t code_size</div><div class="ttdoc">code_size_1 + code_size_2 </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00256">IndexIVFPQ.h:256</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html_a849361f5f0ab0aba8d419c86f2594191"><div class="ttname"><a href="structfaiss_1_1Index.html#a849361f5f0ab0aba8d419c86f2594191">faiss::Index::reset</a></div><div class="ttdeci">virtual void reset()=0</div><div class="ttdoc">removes all elements from the database. </div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a95547d97c90b361a040bae0fb0d892b4"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a95547d97c90b361a040bae0fb0d892b4">faiss::HNSW::entry_point</a></div><div class="ttdeci">storage_idx_t entry_point</div><div class="ttdoc">entry point in the search structure (one of the points with maximum level </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00088">IndexHNSW.h:88</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a49b512eaaa54ead77b564cad8e3e6ebd"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a49b512eaaa54ead77b564cad8e3e6ebd">faiss::HNSW::cum_nb_neighbors</a></div><div class="ttdeci">int cum_nb_neighbors(int layer_no) const </div><div class="ttdoc">cumumlative nb up to (and excluding) this level </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00512">IndexHNSW.cpp:512</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1PQDis_html"><div class="ttname"><a href="structfaiss_1_1PQDis.html">faiss::PQDis</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01661">IndexHNSW.cpp:1661</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ScalarQuantizer_1_1DistanceComputer_html_a96caf21f52fcf6591d7b6b4f3fc8a729"><div class="ttname"><a href="structfaiss_1_1ScalarQuantizer_1_1DistanceComputer.html#a96caf21f52fcf6591d7b6b4f3fc8a729">faiss::ScalarQuantizer::DistanceComputer::compute_code_distance</a></div><div class="ttdeci">virtual float compute_code_distance(const uint8_t *code1, const uint8_t *code2)=0</div><div class="ttdoc">code-to-code distance computation </div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexPQ_html"><div class="ttname"><a href="structfaiss_1_1IndexPQ.html">faiss::IndexPQ</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexPQ_8h_source.html#l00028">IndexPQ.h:28</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexIVF_html_affed235eadf27a13d753ee4d33a1dc58"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#affed235eadf27a13d753ee4d33a1dc58">faiss::IndexIVF::nprobe</a></div><div class="ttdeci">size_t nprobe</div><div class="ttdoc">number of probes at query time </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00078">IndexIVF.h:78</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexFlatL2_html"><div class="ttname"><a href="structfaiss_1_1IndexFlatL2.html">faiss::IndexFlatL2</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexFlat_8h_source.html#l00079">IndexFlat.h:79</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a907c94e0eca5200af1dc8d0aea482665"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a907c94e0eca5200af1dc8d0aea482665">faiss::HNSW::assign_probas</a></div><div class="ttdeci">std::vector< double > assign_probas</div><div class="ttdoc">assignment probability to each layer (sum=1) </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00070">IndexHNSW.h:70</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html_a6bd65fb4407452f73acb7242931d09e4"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html#a6bd65fb4407452f73acb7242931d09e4">faiss::ProductQuantizer::sdc_table</a></div><div class="ttdeci">std::vector< float > sdc_table</div><div class="ttdoc">Symmetric Distance Table. </div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8h_source.html#l00155">ProductQuantizer.h:155</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html_abf601502bdbfa02b9d7bcd7b3671b71d"><div class="ttname"><a href="structfaiss_1_1Index.html#abf601502bdbfa02b9d7bcd7b3671b71d">faiss::Index::train</a></div><div class="ttdeci">virtual void train(idx_t n, const float *x)</div><div class="ttdef"><b>Definition:</b> <a href="Index_8cpp_source.html#l00023">Index.cpp:23</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1DistanceXPQ4_html"><div class="ttname"><a href="structfaiss_1_1DistanceXPQ4.html">faiss::DistanceXPQ4</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01857">IndexHNSW.cpp:1857</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1RandomGenerator_html_ac82a433d7bfa56d750907ba5cf74aed7"><div class="ttname"><a href="structfaiss_1_1RandomGenerator.html#ac82a433d7bfa56d750907ba5cf74aed7">faiss::RandomGenerator::rand_float</a></div><div class="ttdeci">float rand_float()</div><div class="ttdoc">between 0 and 1 </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00211">utils.cpp:211</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ScopeDeleter1_html"><div class="ttname"><a href="structfaiss_1_1ScopeDeleter1.html">faiss::ScopeDeleter1</a></div><div class="ttdef"><b>Definition:</b> <a href="FaissException_8h_source.html#l00052">FaissException.h:52</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a1c258bb88aae9b1a754ab4690d85ed41"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">faiss::HNSW::cum_nneighbor_per_level</a></div><div class="ttdeci">std::vector< int > cum_nneighbor_per_level</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00074">IndexHNSW.h:74</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ScopeDeleter_html"><div class="ttname"><a href="structfaiss_1_1ScopeDeleter.html">faiss::ScopeDeleter</a></div><div class="ttdef"><b>Definition:</b> <a href="FaissException_8h_source.html#l00039">FaissException.h:39</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Distance2Level_html"><div class="ttname"><a href="structfaiss_1_1Distance2Level.html">faiss::Distance2Level</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01825">IndexHNSW.cpp:1825</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html_a467b451ca203544e42c250e4be65b983"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html#a467b451ca203544e42c250e4be65b983">faiss::ProductQuantizer::dsub</a></div><div class="ttdeci">size_t dsub</div><div class="ttdoc">dimensionality of each subvector </div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8h_source.html#l00032">ProductQuantizer.h:32</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index2Layer_html_a5f2d70740af90b8c7ac946d58ec947aa"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">faiss::Index2Layer::q1</a></div><div class="ttdeci">Level1Quantizer q1</div><div class="ttdoc">first level quantizer </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00241">IndexIVFPQ.h:241</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index2Layer_html_a8e6bcfa690ac5ab1636b3d89b144f2d9"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#a8e6bcfa690ac5ab1636b3d89b144f2d9">faiss::Index2Layer::codes</a></div><div class="ttdeci">std::vector< uint8_t > codes</div><div class="ttdoc">Codes. Size ntotal * code_size. </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00247">IndexIVFPQ.h:247</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ScalarQuantizer_html"><div class="ttname"><a href="structfaiss_1_1ScalarQuantizer.html">faiss::ScalarQuantizer</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexScalarQuantizer_8h_source.html#l00030">IndexScalarQuantizer.h:30</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1VisitedTable_html_a76223893c8c3a577473092b3bb8a2446"><div class="ttname"><a href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">faiss::VisitedTable::advance</a></div><div class="ttdeci">void advance()</div><div class="ttdoc">reset all flags to false </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00070">IndexHNSW.cpp:70</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index2Layer_html"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html">faiss::Index2Layer</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00239">IndexIVFPQ.h:239</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexIVF_html_af16d325f5bef22b2e5f90ceea796e80d"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#af16d325f5bef22b2e5f90ceea796e80d">faiss::IndexIVF::ids</a></div><div class="ttdeci">std::vector< std::vector< long > > ids</div><div class="ttdoc">Inverted lists for indexes. </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00081">IndexIVF.h:81</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ReconstructFromNeighbors_html_aed256bdd9f48dc93cb9e33cfdfd5bde7"><div class="ttname"><a href="structfaiss_1_1ReconstructFromNeighbors.html#aed256bdd9f48dc93cb9e33cfdfd5bde7">faiss::ReconstructFromNeighbors::get_neighbor_table</a></div><div class="ttdeci">void get_neighbor_table(storage_idx_t i, float *out) const </div><div class="ttdoc">get the M+1 -by-d table for neighbor coordinates for vector i </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01512">IndexHNSW.cpp:1512</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Distance2Level_html_aaae1348a619161ba59ff854b941137da"><div class="ttname"><a href="structfaiss_1_1Distance2Level.html#aaae1348a619161ba59ff854b941137da">faiss::Distance2Level::set_query</a></div><div class="ttdeci">void set_query(const float *x) override</div><div class="ttdoc">called before computing distances </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01848">IndexHNSW.cpp:1848</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a40bc6d2c67545f95e322c63d68a47140"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a40bc6d2c67545f95e322c63d68a47140">faiss::IndexHNSW::train</a></div><div class="ttdeci">void train(idx_t n, const float *x) override</div><div class="ttdoc">Trains the storage if needed. </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00978">IndexHNSW.cpp:978</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html_a2a002388d2c081c2dbab8508dcefe73d"><div class="ttname"><a href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">faiss::Index::d</a></div><div class="ttdeci">int d</div><div class="ttdoc">vector dimension </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00064">Index.h:64</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html_a36361f41bcd2fa698f3c39eb7111ed09"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html#a36361f41bcd2fa698f3c39eb7111ed09">faiss::ProductQuantizer::compute_distance_table</a></div><div class="ttdeci">void compute_distance_table(const float *x, float *dis_table) const </div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8cpp_source.html#l00410">ProductQuantizer.cpp:410</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html_aa61330eadb84772b71018b093773a5f9"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html#aa61330eadb84772b71018b093773a5f9">faiss::ProductQuantizer::code_size</a></div><div class="ttdeci">size_t code_size</div><div class="ttdoc">byte per indexed vector </div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8h_source.html#l00034">ProductQuantizer.h:34</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a0b456c521194903b29ce7c157539d771"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">faiss::HNSW::offsets</a></div><div class="ttdeci">std::vector< size_t > offsets</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00081">IndexHNSW.h:81</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexScalarQuantizer_html_a861fa059f9d4ced9147e08193a2be9be"><div class="ttname"><a href="structfaiss_1_1IndexScalarQuantizer.html#a861fa059f9d4ced9147e08193a2be9be">faiss::IndexScalarQuantizer::codes</a></div><div class="ttdeci">std::vector< uint8_t > codes</div><div class="ttdoc">Codes. Size ntotal * pq.code_size. </div><div class="ttdef"><b>Definition:</b> <a href="IndexScalarQuantizer_8h_source.html#l00104">IndexScalarQuantizer.h:104</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1VisitedTable_html"><div class="ttname"><a href="structfaiss_1_1VisitedTable.html">faiss::VisitedTable</a></div><div class="ttdoc">set implementation optimized for fast access. </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00054">IndexHNSW.cpp:54</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexIVFPQ_html"><div class="ttname"><a href="structfaiss_1_1IndexIVFPQ.html">faiss::IndexIVFPQ</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00029">IndexIVFPQ.h:29</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a04a761ce17d0f9040b3bc8a77bd627d9"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a04a761ce17d0f9040b3bc8a77bd627d9">faiss::IndexHNSW::add</a></div><div class="ttdeci">void add(idx_t n, const float *x) override</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01031">IndexHNSW.cpp:1031</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1SQDis_html_a67cd2b8275b5983de5709ec4767feb13"><div class="ttname"><a href="structfaiss_1_1SQDis.html#a67cd2b8275b5983de5709ec4767feb13">faiss::SQDis::set_query</a></div><div class="ttdeci">void set_query(const float *x) override</div><div class="ttdoc">called before computing distances </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01785">IndexHNSW.cpp:1785</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ScalarQuantizer_1_1DistanceComputer_html"><div class="ttname"><a href="structfaiss_1_1ScalarQuantizer_1_1DistanceComputer.html">faiss::ScalarQuantizer::DistanceComputer</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexScalarQuantizer_8h_source.html#l00081">IndexScalarQuantizer.h:81</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ReconstructFromNeighbors_html_a6cf260c530e273e4d676804ac71128f8"><div class="ttname"><a href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8">faiss::ReconstructFromNeighbors::reconstruct</a></div><div class="ttdeci">void reconstruct(storage_idx_t i, float *x, float *tmp) const </div><div class="ttdoc">called by compute_distances </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01378">IndexHNSW.cpp:1378</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html_a1b5e9ac70adbce0897dd6c8276ad96f2"><div class="ttname"><a href="structfaiss_1_1Index.html#a1b5e9ac70adbce0897dd6c8276ad96f2">faiss::Index::add</a></div><div class="ttdeci">virtual void add(idx_t n, const float *x)=0</div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1RandomGenerator_html_a583f124ecacdbe037ac96e23a44dd420"><div class="ttname"><a href="structfaiss_1_1RandomGenerator.html#a583f124ecacdbe037ac96e23a44dd420">faiss::RandomGenerator::rand_int</a></div><div class="ttdeci">int rand_int()</div><div class="ttdoc">random 31-bit positive integer </div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexScalarQuantizer_html_a71381f74754d8a54812e80af46a2a83a"><div class="ttname"><a href="structfaiss_1_1IndexScalarQuantizer.html#a71381f74754d8a54812e80af46a2a83a">faiss::IndexScalarQuantizer::sq</a></div><div class="ttdeci">ScalarQuantizer sq</div><div class="ttdoc">Used to encode the vectors. </div><div class="ttdef"><b>Definition:</b> <a href="IndexScalarQuantizer_8h_source.html#l00101">IndexScalarQuantizer.h:101</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html_a0feee45e4151547b7a0444c14bad398f"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html#a0feee45e4151547b7a0444c14bad398f">faiss::ProductQuantizer::ksub</a></div><div class="ttdeci">size_t ksub</div><div class="ttdoc">number of centroids for each subquantizer </div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8h_source.html#l00035">ProductQuantizer.h:35</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a6d1cb35c4220bf554af90133c71ae04f"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a6d1cb35c4220bf554af90133c71ae04f">faiss::HNSW::efSearch</a></div><div class="ttdeci">int efSearch</div><div class="ttdoc">expansion factor at search time </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00099">IndexHNSW.h:99</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html_a040c6aed1f224f3ea7bf58eebc0c31a4"><div class="ttname"><a href="structfaiss_1_1Index.html#a040c6aed1f224f3ea7bf58eebc0c31a4">faiss::Index::idx_t</a></div><div class="ttdeci">long idx_t</div><div class="ttdoc">all indices are this type </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00062">Index.h:62</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_adbf81f0b21102b942182c904892e0858"><div class="ttname"><a href="structfaiss_1_1HNSW.html#adbf81f0b21102b942182c904892e0858">faiss::HNSW::check_relative_distance</a></div><div class="ttdeci">bool check_relative_distance</div><div class="ttdoc">during search: do we check whether the next best distance is good enough? </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00102">IndexHNSW.h:102</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a1fc852810a2497a8eb2c41635ec05520"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a1fc852810a2497a8eb2c41635ec05520">faiss::HNSW::HNSW</a></div><div class="ttdeci">HNSW(int M=32)</div><div class="ttdoc">only mandatory parameter: nb of neighbors </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00527">IndexHNSW.cpp:527</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexPQ_html_aa7b7cfe0c8dfd37c8a940fd93d12dc88"><div class="ttname"><a href="structfaiss_1_1IndexPQ.html#aa7b7cfe0c8dfd37c8a940fd93d12dc88">faiss::IndexPQ::pq</a></div><div class="ttdeci">ProductQuantizer pq</div><div class="ttdoc">The product quantizer used to encode the vectors. </div><div class="ttdef"><b>Definition:</b> <a href="IndexPQ_8h_source.html#l00031">IndexPQ.h:31</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html_a6970683faa021b7a6f1a0865c0d4eccd"><div class="ttname"><a href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">faiss::Index::ntotal</a></div><div class="ttdeci">idx_t ntotal</div><div class="ttdoc">total nb of indexed vectors </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00065">Index.h:65</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a857bef0db2dc0000f312cc8a95f857b2"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a857bef0db2dc0000f312cc8a95f857b2">faiss::HNSW::upper_beam</a></div><div class="ttdeci">int upper_beam</div><div class="ttdoc">number of entry points in levels &gt; 0. </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00105">IndexHNSW.h:105</a></div></div>
|
||
|
|
<div class="ttc" id="namespacefaiss_html_af2a71f7d5402ae02ce169a4cc83020eb"><div class="ttname"><a href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">faiss::getmillisecs</a></div><div class="ttdeci">double getmillisecs()</div><div class="ttdoc">ms elapsed since some arbitrary epoch </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00074">utils.cpp:74</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_afdb5a17487296267efaaa94e6a08996d"><div class="ttname"><a href="structfaiss_1_1HNSW.html#afdb5a17487296267efaaa94e6a08996d">faiss::HNSW::set_nb_neighbors</a></div><div class="ttdeci">void set_nb_neighbors(int level_no, int n)</div><div class="ttdoc">set nb of neighbors for this level (before adding anything) </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00503">IndexHNSW.cpp:503</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ReconstructFromNeighbors_html_a88ca99742dccc52ebb3324b507b6c872"><div class="ttname"><a href="structfaiss_1_1ReconstructFromNeighbors.html#a88ca99742dccc52ebb3324b507b6c872">faiss::ReconstructFromNeighbors::estimate_code</a></div><div class="ttdeci">void estimate_code(const float *x, storage_idx_t i, uint8_t *code) const </div><div class="ttdoc">called by add_codes </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01531">IndexHNSW.cpp:1531</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html_aced51b1ebc33c47ab3ae15ea906559a7"><div class="ttname"><a href="structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7">faiss::Index::search</a></div><div class="ttdeci">virtual void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const =0</div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1MultiIndexQuantizer_html"><div class="ttname"><a href="structfaiss_1_1MultiIndexQuantizer.html">faiss::MultiIndexQuantizer</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexPQ_8h_source.html#l00135">IndexPQ.h:135</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html"><div class="ttname"><a href="structfaiss_1_1HNSW.html">faiss::HNSW</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00040">IndexHNSW.h:40</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a153fa41ad41a4905aa60683360a3cdf0"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a153fa41ad41a4905aa60683360a3cdf0">faiss::HNSW::idx_t</a></div><div class="ttdeci">faiss::Index::idx_t idx_t</div><div class="ttdoc">Faiss results are 64-bit. </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00046">IndexHNSW.h:46</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ReconstructFromNeighbors_html_a454b7a5f7437a257df7404f5778fc833"><div class="ttname"><a href="structfaiss_1_1ReconstructFromNeighbors.html#a454b7a5f7437a257df7404f5778fc833">faiss::ReconstructFromNeighbors::add_codes</a></div><div class="ttdeci">void add_codes(size_t n, const float *x)</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01572">IndexHNSW.cpp:1572</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexIVF_html_a1c11ce77f459e2ab3e5d9a4c2263ad89"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#a1c11ce77f459e2ab3e5d9a4c2263ad89">faiss::IndexIVF::make_direct_map</a></div><div class="ttdeci">void make_direct_map(bool new_maintain_direct_map=true)</div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8cpp_source.html#l00139">IndexIVF.cpp:139</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1GenericDistanceComputer_html_a07cbd7cd0ed73eae3d0487f2f25b748c"><div class="ttname"><a href="structfaiss_1_1GenericDistanceComputer.html#a07cbd7cd0ed73eae3d0487f2f25b748c">faiss::GenericDistanceComputer::set_query</a></div><div class="ttdeci">void set_query(const float *x) override</div><div class="ttdoc">called before computing distances </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01347">IndexHNSW.cpp:1347</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_aa6dfdaed7bc0ad895774315166fcb197"><div class="ttname"><a href="structfaiss_1_1HNSW.html#aa6dfdaed7bc0ad895774315166fcb197">faiss::HNSW::random_level</a></div><div class="ttdeci">int random_level()</div><div class="ttdoc">pick a random level for a new point </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00539">IndexHNSW.cpp:539</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_ae7d955690da5d6376c203e81e124ba94"><div class="ttname"><a href="structfaiss_1_1HNSW.html#ae7d955690da5d6376c203e81e124ba94">faiss::HNSW::set_default_probas</a></div><div class="ttdeci">void set_default_probas(int M, float levelMult)</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00553">IndexHNSW.cpp:553</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexIVFPQ_html_a007303be116c8da65b6d058e3fc77d16"><div class="ttname"><a href="structfaiss_1_1IndexIVFPQ.html#a007303be116c8da65b6d058e3fc77d16">faiss::IndexIVFPQ::pq</a></div><div class="ttdeci">ProductQuantizer pq</div><div class="ttdoc">produces the codes </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00032">IndexIVFPQ.h:32</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_ad4b9f97d42e2521e01f8b60012985396"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#ad4b9f97d42e2521e01f8b60012985396">faiss::IndexHNSW::reset</a></div><div class="ttdeci">void reset() override</div><div class="ttdoc">removes all elements from the database. </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01043">IndexHNSW.cpp:1043</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html_a83600e328893ce5f41fe459f5a3acf41"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">faiss::ProductQuantizer::M</a></div><div class="ttdeci">size_t M</div><div class="ttdoc">number of subquantizers </div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8h_source.html#l00028">ProductQuantizer.h:28</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index2Layer_html_a735b2b6cc50e4186776a8213d2679837"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#a735b2b6cc50e4186776a8213d2679837">faiss::Index2Layer::code_size_1</a></div><div class="ttdeci">size_t code_size_1</div><div class="ttdoc">size of the code for the first level (ceil(log8(q1.nlist))) </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00250">IndexIVFPQ.h:250</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a330107a5801680609932849fc9404594"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a330107a5801680609932849fc9404594">faiss::HNSW::search</a></div><div class="ttdeci">void search(DistanceComputer &qdis, int k, idx_t *I, float *D, VisitedTable &vt) const </div><div class="ttdoc">search interface </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00711">IndexHNSW.cpp:711</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html"><div class="ttname"><a href="structfaiss_1_1Index.html">faiss::Index</a></div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00060">Index.h:60</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1GenericDistanceComputer_html"><div class="ttname"><a href="structfaiss_1_1GenericDistanceComputer.html">faiss::GenericDistanceComputer</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01322">IndexHNSW.cpp:1322</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_ab9c75063090927f8f65d1896b6949af4"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#ab9c75063090927f8f65d1896b6949af4">faiss::IndexHNSW::init_level_0_from_entry_points</a></div><div class="ttdeci">void init_level_0_from_entry_points(int npt, const storage_idx_t *points, const storage_idx_t *nearests)</div><div class="ttdoc">alternative graph building </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01200">IndexHNSW.cpp:1200</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1FlatL2Dis_html_a9982374debdda67f3db647ffc0d3fc4b"><div class="ttname"><a href="structfaiss_1_1FlatL2Dis.html#a9982374debdda67f3db647ffc0d3fc4b">faiss::FlatL2Dis::set_query</a></div><div class="ttdeci">void set_query(const float *x) override</div><div class="ttdoc">called before computing distances </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01621">IndexHNSW.cpp:1621</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_ae0ddf6ab4a54239a25d6277e21e8548e"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#ae0ddf6ab4a54239a25d6277e21e8548e">faiss::IndexHNSW::search</a></div><div class="ttdeci">void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override</div><div class="ttdoc">entry point for search </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00985">IndexHNSW.cpp:985</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexIVFPQ_html_a150a37cf3e8a7e37cb8dab1d5678bc02"><div class="ttname"><a href="structfaiss_1_1IndexIVFPQ.html#a150a37cf3e8a7e37cb8dab1d5678bc02">faiss::IndexIVFPQ::search_preassigned</a></div><div class="ttdeci">void search_preassigned(idx_t n, const float *x, idx_t k, const idx_t *assign, const float *centroid_dis, float *distances, idx_t *labels, bool store_pairs) const override</div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8cpp_source.html#l00919">IndexIVFPQ.cpp:919</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Level1Quantizer_html_a3cf99e2ee92b8558a066f821efab95d5"><div class="ttname"><a href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">faiss::Level1Quantizer::quantizer</a></div><div class="ttdeci">Index * quantizer</div><div class="ttdoc">quantizer that maps vectors to inverted lists </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00033">IndexIVF.h:33</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a9a86c58212f3f9cf88394f5297cba525"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a9a86c58212f3f9cf88394f5297cba525">faiss::IndexHNSW::init_level_0_from_knngraph</a></div><div class="ttdeci">void init_level_0_from_knngraph(int k, const float *D, const idx_t *I)</div><div class="ttdoc">alternative graph building </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01162">IndexHNSW.cpp:1162</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html">faiss::ProductQuantizer</a></div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8h_source.html#l00025">ProductQuantizer.h:25</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a5b619a41ddd52f0377efb701829c1e43"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a5b619a41ddd52f0377efb701829c1e43">faiss::IndexHNSW::search_level_0</a></div><div class="ttdeci">void search_level_0(idx_t n, const float *x, idx_t k, const storage_idx_t *nearest, const float *nearest_d, float *distances, idx_t *labels, int nprobe=1, int search_type=1) const </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01092">IndexHNSW.cpp:1092</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a26710980aaca3c1c8729e5e055a42ebe"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a26710980aaca3c1c8729e5e055a42ebe">faiss::HNSW::fill_with_random_links</a></div><div class="ttdeci">void fill_with_random_links(size_t n)</div><div class="ttdoc">add n random levels to table (for debugging...) </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00913">IndexHNSW.cpp:913</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html_a6e92732617c4dbe364e7678dd8773a7f"><div class="ttname"><a href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">faiss::Index::is_trained</a></div><div class="ttdeci">bool is_trained</div><div class="ttdoc">set if the Index does not require training, or if training is done already </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00069">Index.h:69</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a27bd11ef9a651a94bcefa5291336fc58"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">faiss::HNSW::neighbors</a></div><div class="ttdeci">std::vector< storage_idx_t > neighbors</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00085">IndexHNSW.h:85</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a660e5c8de1ba9c71bf3fe1f3bf0c8812"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a660e5c8de1ba9c71bf3fe1f3bf0c8812">faiss::IndexHNSW::reconstruct</a></div><div class="ttdeci">void reconstruct(idx_t key, float *recons) const override</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01050">IndexHNSW.cpp:1050</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1FlatL2Dis_html"><div class="ttname"><a href="structfaiss_1_1FlatL2Dis.html">faiss::FlatL2Dis</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01594">IndexHNSW.cpp:1594</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index_html_aaef6f4132b1f390121ebb11058baf190"><div class="ttname"><a href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">faiss::Index::reconstruct</a></div><div class="ttdeci">virtual void reconstruct(idx_t key, float *recons) const </div><div class="ttdef"><b>Definition:</b> <a href="Index_8cpp_source.html#l00054">Index.cpp:54</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index2Layer_html_ab90d1de73cbc705a347cfc852ded6006"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">faiss::Index2Layer::pq</a></div><div class="ttdeci">ProductQuantizer pq</div><div class="ttdoc">second level quantizer is always a PQ </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00244">IndexIVFPQ.h:244</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_aa7309dd7826761def38233c8bbbc0c63"><div class="ttname"><a href="structfaiss_1_1HNSW.html#aa7309dd7826761def38233c8bbbc0c63">faiss::HNSW::efConstruction</a></div><div class="ttdeci">int efConstruction</div><div class="ttdoc">expansion factor at construction time </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00096">IndexHNSW.h:96</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_ae1342fc2f07c325598a73b733e88ee74"><div class="ttname"><a href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">faiss::HNSW::storage_idx_t</a></div><div class="ttdeci">int storage_idx_t</div><div class="ttdoc">internal storage of vectors (32 bits: this is expensive) </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00043">IndexHNSW.h:43</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_1_1DistanceComputer_html"><div class="ttname"><a href="structfaiss_1_1HNSW_1_1DistanceComputer.html">faiss::HNSW::DistanceComputer</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00052">IndexHNSW.h:52</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1IndexFlat_html_a9001de47890fe5d2eced9551d3613d47"><div class="ttname"><a href="structfaiss_1_1IndexFlat.html#a9001de47890fe5d2eced9551d3613d47">faiss::IndexFlat::xb</a></div><div class="ttdeci">std::vector< float > xb</div><div class="ttdoc">database vectors, size ntotal * d </div><div class="ttdef"><b>Definition:</b> <a href="IndexFlat_8h_source.html#l00025">IndexFlat.h:25</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Level1Quantizer_html_ab688c629cd42122d73517078b87f483d"><div class="ttname"><a href="structfaiss_1_1Level1Quantizer.html#ab688c629cd42122d73517078b87f483d">faiss::Level1Quantizer::own_fields</a></div><div class="ttdeci">bool own_fields</div><div class="ttdoc">whether object owns the quantizer </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00042">IndexIVF.h:42</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1VisitedTable_html_a387b6428f4bfa44495c70a5f1f45f853"><div class="ttname"><a href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853">faiss::VisitedTable::set</a></div><div class="ttdeci">void set(int no)</div><div class="ttdoc">set flog #no to true </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00062">IndexHNSW.cpp:62</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Distance2xXPQ4_html"><div class="ttname"><a href="structfaiss_1_1Distance2xXPQ4.html">faiss::Distance2xXPQ4</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01902">IndexHNSW.cpp:1902</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1PQDis_html_a3f19b9d5375526901e16f88a9b310e03"><div class="ttname"><a href="structfaiss_1_1PQDis.html#a3f19b9d5375526901e16f88a9b310e03">faiss::PQDis::set_query</a></div><div class="ttdeci">void set_query(const float *x) override</div><div class="ttdoc">called before computing distances </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01712">IndexHNSW.cpp:1712</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Index2Layer_html_af2e505c14e62234eb251fcb37ef012d2"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#af2e505c14e62234eb251fcb37ef012d2">faiss::Index2Layer::reconstruct</a></div><div class="ttdeci">void reconstruct(idx_t key, float *recons) const override</div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8cpp_source.html#l01442">IndexIVFPQ.cpp:1442</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_a44847954c98957404829182c7db1b8af"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">faiss::HNSW::levels</a></div><div class="ttdeci">std::vector< int > levels</div><div class="ttdoc">level of each vector (base level = 1), size = ntotal </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00077">IndexHNSW.h:77</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1HNSW_html_afba18a290f5f759a8a7a64ed35b950eb"><div class="ttname"><a href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">faiss::HNSW::max_level</a></div><div class="ttdeci">int max_level</div><div class="ttdoc">maximum level </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8h_source.html#l00093">IndexHNSW.h:93</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1Level1Quantizer_html_a1c4fc9d874d9492ee0ea27a5be388fa7"><div class="ttname"><a href="structfaiss_1_1Level1Quantizer.html#a1c4fc9d874d9492ee0ea27a5be388fa7">faiss::Level1Quantizer::nlist</a></div><div class="ttdeci">size_t nlist</div><div class="ttdoc">number of possible key values </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00034">IndexIVF.h:34</a></div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ScalarQuantizer_1_1DistanceComputer_html_a6776bc6fc6c48335f132afa4ac38df33"><div class="ttname"><a href="structfaiss_1_1ScalarQuantizer_1_1DistanceComputer.html#a6776bc6fc6c48335f132afa4ac38df33">faiss::ScalarQuantizer::DistanceComputer::compute_distance</a></div><div class="ttdeci">virtual float compute_distance(const float *x, const uint8_t *code)=0</div><div class="ttdoc">vector-to-code distance computation </div></div>
|
||
|
|
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html_aab1109a29ba0544358e274d727b23cae"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html#aab1109a29ba0544358e274d727b23cae">faiss::ProductQuantizer::centroids</a></div><div class="ttdeci">std::vector< float > centroids</div><div class="ttdoc">Centroid table, size M * ksub * dsub. </div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8h_source.html#l00052">ProductQuantizer.h:52</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>
|