<!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/hoss/faiss/HNSW.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/hoss/faiss/HNSW.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) Facebook, Inc. and its affiliates.</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * This source code is licensed under the MIT license found in the</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * LICENSE file in the root directory of this source tree.</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// -*- c++ -*-</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include "HNSW.h"</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include "AuxIndexStructures.h"</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="keyword">namespace </span>faiss {</div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="keyword">using</span> idx_t = <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a>;</div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * HNSW structure implementation</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div>
<div class="line"><a name="l00021"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#ad497ea80f352c33242ba7835370c2dba"> 21</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="l00022"></a><span class="lineno"> 22</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</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="l00024"></a><span class="lineno"> 24</span>  <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>[layer_no];</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</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"><a class="line" href="structfaiss_1_1HNSW.html#afdb5a17487296267efaaa94e6a08996d"> 27</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="l00028"></a><span class="lineno"> 28</span> {</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  FAISS_THROW_IF_NOT(<a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.size() == 0);</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</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="l00031"></a><span class="lineno"> 31</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="l00032"></a><span class="lineno"> 32</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="l00033"></a><span class="lineno"> 33</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"><a class="line" href="structfaiss_1_1HNSW.html#a49b512eaaa54ead77b564cad8e3e6ebd"> 36</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="l00037"></a><span class="lineno"> 37</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</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="l00039"></a><span class="lineno"> 39</span> }</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div>
<div class="line"><a name="l00041"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d"> 41</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">HNSW::neighbor_range</a>(<a class="code" href="structfaiss_1_1HNSW.html#a84f912f99bda1a827a74cdf8793af160">idx_t</a> no, <span class="keywordtype">int</span> layer_no,</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</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="l00043"></a><span class="lineno"> 43</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</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="l00045"></a><span class="lineno"> 45</span>  *begin = o + <a class="code" href="structfaiss_1_1HNSW.html#a49b512eaaa54ead77b564cad8e3e6ebd">cum_nb_neighbors</a>(layer_no);</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</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="l00047"></a><span class="lineno"> 47</span> }</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> </div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> </div>
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a1fc852810a2497a8eb2c41635ec05520"> 51</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="l00052"></a><span class="lineno"> 52</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="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a> = -1;</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="structfaiss_1_1HNSW.html#a95547d97c90b361a040bae0fb0d892b4">entry_point</a> = -1;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <a class="code" href="structfaiss_1_1HNSW.html#a6d1cb35c4220bf554af90133c71ae04f">efSearch</a> = 16;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa7309dd7826761def38233c8bbbc0c63">efConstruction</a> = 40;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <a class="code" href="structfaiss_1_1HNSW.html#a857bef0db2dc0000f312cc8a95f857b2">upper_beam</a> = 1;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.push_back(0);</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> }</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div>
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#aa6dfdaed7bc0ad895774315166fcb197"> 62</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="l00063"></a><span class="lineno"> 63</span> {</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</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="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// could be a bit faster with bissection</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</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="l00067"></a><span class="lineno"> 67</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="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">return</span> level;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  f -= <a class="code" href="structfaiss_1_1HNSW.html#a907c94e0eca5200af1dc8d0aea482665">assign_probas</a>[level];</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// happens with exponentially low probability</span></div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</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="l00074"></a><span class="lineno"> 74</span> }</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div>
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#ae7d955690da5d6376c203e81e124ba94"> 76</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="l00077"></a><span class="lineno"> 77</span> {</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordtype">int</span> nn = 0;</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>.push_back (0);</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = 0; ;level++) {</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordtype">float</span> proba = exp(-level / levelMult) * (1 - exp(-1 / levelMult));</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">if</span> (proba < 1e-9) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <a class="code" href="structfaiss_1_1HNSW.html#a907c94e0eca5200af1dc8d0aea482665">assign_probas</a>.push_back(proba);</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  nn += level == 0 ? M * 2 : M;</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <a class="code" href="structfaiss_1_1HNSW.html#a1c258bb88aae9b1a754ab4690d85ed41">cum_nneighbor_per_level</a>.push_back (nn);</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> }</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="keywordtype">void</span> HNSW::clear_neighbor_tables(<span class="keywordtype">int</span> level)</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> {</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <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="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, level, &begin, &end);</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j] = -1;</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> }</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="keywordtype">void</span> HNSW::reset() {</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a> = -1;</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <a class="code" href="structfaiss_1_1HNSW.html#a95547d97c90b361a040bae0fb0d892b4">entry_point</a> = -1;</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.clear();</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.push_back(0);</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.clear();</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>.clear();</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> }</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</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="l00113"></a><span class="lineno"> 113</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</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="l00115"></a><span class="lineno"> 115</span>  printf(<span class="stringliteral">"stats on level %d, max %d neighbors per vertex:\n"</span>,</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  level, <a class="code" href="structfaiss_1_1HNSW.html#ad497ea80f352c33242ba7835370c2dba">nb_neighbors</a>(level));</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</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="l00118"></a><span class="lineno"> 118</span> <span class="preprocessor">#pragma omp parallel for reduction(+: tot_neigh) reduction(+: tot_common) \</span></div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor"> reduction(+: tot_reciprocal) reduction(+: n_node)</span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</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="l00121"></a><span class="lineno"> 121</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="l00122"></a><span class="lineno"> 122</span>  n_node++;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, level, &begin, &end);</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  std::unordered_set<int> neighset;</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</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="l00128"></a><span class="lineno"> 128</span>  neighset.insert(<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j]);</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordtype">int</span> n_neigh = neighset.size();</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordtype">int</span> n_common = 0;</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordtype">int</span> n_reciprocal = 0;</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">storage_idx_t</a> i2 = <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (i2 < 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  FAISS_ASSERT(i2 != i);</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordtype">size_t</span> begin2, end2;</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i2, level, &begin2, &end2);</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j2 = begin2; j2 < end2; j2++) {</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">storage_idx_t</a> i3 = <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j2];</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (i3 < 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">if</span> (i3 == i) {</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  n_reciprocal++;</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">continue</span>;</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> (neighset.count(i3)) {</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  neighset.erase(i3);</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  n_common++;</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  tot_neigh += n_neigh;</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  tot_common += n_common;</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  tot_reciprocal += n_reciprocal;</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</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="keywordtype">float</span> normalizer = n_node;</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  printf(<span class="stringliteral">" nb of nodes at that level %ld\n"</span>, n_node);</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  printf(<span class="stringliteral">" neighbors per node: %.2f (%ld)\n"</span>,</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  tot_neigh / normalizer, tot_neigh);</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  printf(<span class="stringliteral">" nb of reciprocal neighbors: %.2f\n"</span>, tot_reciprocal / normalizer);</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  printf(<span class="stringliteral">" nb of neighbors that are also neighbor-of-neighbors: %.2f (%ld)\n"</span>,</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  tot_common / normalizer, tot_common);</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> }</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div>
<div class="line"><a name="l00170"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a26710980aaca3c1c8729e5e055a42ebe"> 170</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="l00171"></a><span class="lineno"> 171</span> {</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordtype">int</span> <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a> = prepare_level_tab(n);</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <a class="code" href="structfaiss_1_1RandomGenerator.html">RandomGenerator</a> rng2(456);</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>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = max_level - 1; level >= 0; --level) {</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  std::vector<int> elts;</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</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="l00179"></a><span class="lineno"> 179</span>  elts.push_back(i);</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  printf (<span class="stringliteral">"linking %ld elements in level %d\n"</span>,</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  elts.size(), level);</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span> (elts.size() == 1) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = 0; ii < elts.size(); ii++) {</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordtype">int</span> i = elts[ii];</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, 0, &begin, &end);</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordtype">int</span> other = 0;</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  other = elts[rng2.<a class="code" href="structfaiss_1_1RandomGenerator.html#a583f124ecacdbe037ac96e23a44dd420">rand_int</a>(elts.size())];</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  } <span class="keywordflow">while</span>(other == i);</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j] = other;</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> }</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> </div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="keywordtype">int</span> HNSW::prepare_level_tab(<span class="keywordtype">size_t</span> n, <span class="keywordtype">bool</span> preset_levels)</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> {</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordtype">size_t</span> n0 = <a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.size() - 1;</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (preset_levels) {</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  FAISS_ASSERT (n0 + n == <a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.size());</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  FAISS_ASSERT (n0 == <a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.size());</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordtype">int</span> pt_level = <a class="code" href="structfaiss_1_1HNSW.html#aa6dfdaed7bc0ad895774315166fcb197">random_level</a>();</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>.push_back(pt_level + 1);</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordtype">int</span> <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a> = 0;</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordtype">int</span> pt_level = <a class="code" href="structfaiss_1_1HNSW.html#a44847954c98957404829182c7db1b8af">levels</a>[i + n0] - 1;</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (pt_level > max_level) max_level = pt_level;</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.push_back(<a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.back() +</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <a class="code" href="structfaiss_1_1HNSW.html#a49b512eaaa54ead77b564cad8e3e6ebd">cum_nb_neighbors</a>(pt_level + 1));</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>.resize(<a class="code" href="structfaiss_1_1HNSW.html#a0b456c521194903b29ce7c157539d771">offsets</a>.back(), -1);</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> </div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">return</span> <a class="code" href="structfaiss_1_1HNSW.html#afba18a290f5f759a8a7a64ed35b950eb">max_level</a>;</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> }</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> <span class="comment"></span></div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment">/** Enumerate vertices from farthest to nearest from query, keep a</span></div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"> * neighbor only if there is no previous neighbor that is closer to</span></div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"> * that vertex than the query.</span></div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a0cf1870a859783925e95b15bf5e83584"> 235</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#a0cf1870a859783925e95b15bf5e83584">HNSW::shrink_neighbor_list</a>(</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a>& qdis,</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  std::priority_queue<NodeDistFarther>& input,</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  std::vector<NodeDistFarther>& output,</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordtype">int</span> max_size)</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> {</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">while</span> (input.size() > 0) {</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="structfaiss_1_1HNSW_1_1NodeDistFarther.html">NodeDistFarther</a> v1 = input.top();</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  input.pop();</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordtype">float</span> dist_v1_q = v1.d;</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordtype">bool</span> good = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">for</span> (<a class="code" href="structfaiss_1_1HNSW_1_1NodeDistFarther.html">NodeDistFarther</a> v2 : output) {</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordtype">float</span> dist_v1_v2 = qdis.<a class="code" href="structfaiss_1_1DistanceComputer.html#a4b7236a757c788401aac00598ed902c7">symmetric_dis</a>(v2.id, v1.id);</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> </div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (dist_v1_v2 < dist_v1_q) {</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  good = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</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>  <span class="keywordflow">if</span> (good) {</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  output.push_back(v1);</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">if</span> (output.size() >= max_size) {</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> }</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span> </div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> </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> <span class="keyword">using</span> storage_idx_t = <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">HNSW::storage_idx_t</a>;</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="keyword">using</span> <a class="code" href="structfaiss_1_1HNSW_1_1NodeDistCloser.html">NodeDistCloser</a> = <a class="code" href="structfaiss_1_1HNSW_1_1NodeDistCloser.html">HNSW::NodeDistCloser</a>;</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="keyword">using</span> <a class="code" href="structfaiss_1_1HNSW_1_1NodeDistFarther.html">NodeDistFarther</a> = <a class="code" href="structfaiss_1_1HNSW_1_1NodeDistFarther.html">HNSW::NodeDistFarther</a>;</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span> </div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"> * Addition subroutines</span></div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="comment"> **************************************************************/</span></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"></span></div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment">/// remove neighbors from the list to make it smaller than max_size</span></div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"></span><span class="keywordtype">void</span> shrink_neighbor_list(</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a>& qdis,</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  std::priority_queue<NodeDistCloser>& resultSet1,</div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordtype">int</span> max_size)</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> {</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span> (resultSet1.size() < max_size) {</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  std::priority_queue<NodeDistFarther> resultSet;</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  std::vector<NodeDistFarther> returnlist;</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">while</span> (resultSet1.size() > 0) {</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  resultSet.emplace(resultSet1.top().d, resultSet1.top().id);</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  resultSet1.pop();</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</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>  <a class="code" href="structfaiss_1_1HNSW.html#a0cf1870a859783925e95b15bf5e83584">HNSW::shrink_neighbor_list</a>(qdis, resultSet, returnlist, max_size);</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> </div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">for</span> (NodeDistFarther curen2 : returnlist) {</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  resultSet1.emplace(curen2.d, curen2.id);</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  }</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> </div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span> }</div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span> </div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"></span></div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="comment">/// add a link between two elements, possibly shrinking the list</span></div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="comment">/// of links to make room for it.</span></div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"></span><span class="keywordtype">void</span> add_link(HNSW& hnsw,</div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  DistanceComputer& qdis,</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  storage_idx_t src, storage_idx_t dest,</div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordtype">int</span> level)</div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</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(src, level, &begin, &end);</div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">if</span> (hnsw.neighbors[end - 1] == -1) {</div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="comment">// there is enough room, find a slot to add it</span></div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordtype">size_t</span> i = end;</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">while</span>(i > begin) {</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">if</span> (hnsw.neighbors[i - 1] != -1) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  i--;</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  hnsw.neighbors[i] = dest;</div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span> </div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// otherwise we let them fight out which to keep</span></div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> </div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">// copy to resultSet...</span></div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  std::priority_queue<NodeDistCloser> resultSet;</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  resultSet.emplace(qdis.symmetric_dis(src, dest), dest);</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</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="l00331"></a><span class="lineno"> 331</span>  storage_idx_t neigh = hnsw.neighbors[i];</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  resultSet.emplace(qdis.symmetric_dis(src, neigh), neigh);</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> </div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  shrink_neighbor_list(qdis, resultSet, end - begin);</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">// ...and back</span></div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordtype">size_t</span> i = begin;</div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">while</span> (resultSet.size()) {</div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  hnsw.neighbors[i++] = resultSet.top().id;</div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  resultSet.pop();</div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// they may have shrunk more than just by 1 element</span></div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">while</span>(i < end) {</div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  hnsw.neighbors[i++] = -1;</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  }</div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span> }</div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="comment"></span></div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="comment">/// search neighbors on a single level, starting from an entry point</span></div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"></span><span class="keywordtype">void</span> search_neighbors_to_add(</div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  HNSW& hnsw,</div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  DistanceComputer& qdis,</div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  std::priority_queue<NodeDistCloser>& results,</div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordtype">int</span> entry_point,</div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordtype">float</span> d_entry_point,</div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordtype">int</span> level,</div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  VisitedTable &vt)</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>  <span class="comment">// top is nearest candidate</span></div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  std::priority_queue<NodeDistFarther> candidates;</div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span> </div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  NodeDistFarther ev(d_entry_point, entry_point);</div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  candidates.push(ev);</div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  results.emplace(d_entry_point, entry_point);</div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  vt.set(entry_point);</div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">while</span> (!candidates.empty()) {</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="comment">// get nearest</span></div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keyword">const</span> NodeDistFarther &currEv = candidates.top();</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span> </div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">if</span> (currEv.d > results.top().d) {</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">break</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="keywordtype">int</span> currNode = currEv.id;</div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  candidates.pop();</div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> </div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">// loop over neighbors</span></div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  hnsw.neighbor_range(currNode, level, &begin, &end);</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = begin; i < end; i++) {</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  storage_idx_t nodeId = hnsw.neighbors[i];</div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">if</span> (nodeId < 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">if</span> (vt.get(nodeId)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  vt.set(nodeId);</div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span> </div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordtype">float</span> dis = qdis(nodeId);</div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  NodeDistFarther evE1(dis, nodeId);</div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">if</span> (results.size() < hnsw.efConstruction ||</div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  results.top().d > dis) {</div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  results.emplace(dis, nodeId);</div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  candidates.emplace(dis, nodeId);</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">if</span> (results.size() > hnsw.efConstruction) {</div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  results.pop();</div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  }</div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  }</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>  }</div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  vt.advance();</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> <span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> * Searching subroutines</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"></span></div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment">/// greedily update a nearest vector at a given level</span></div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</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="l00410"></a><span class="lineno"> 410</span>  DistanceComputer& qdis,</div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordtype">int</span> level,</div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  storage_idx_t& nearest,</div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordtype">float</span>& d_nearest)</div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> {</div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">for</span>(;;) {</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  storage_idx_t prev_nearest = nearest;</div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  hnsw.neighbor_range(nearest, level, &begin, &end);</div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = begin; i < end; i++) {</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  storage_idx_t v = hnsw.neighbors[i];</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">if</span> (v < 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordtype">float</span> dis = qdis(v);</div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">if</span> (dis < d_nearest) {</div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  nearest = v;</div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  d_nearest = dis;</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>  }</div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordflow">if</span> (nearest == prev_nearest) {</div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  }</div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</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> </div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span> } <span class="comment">// namespace</span></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="comment"></span></div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment">/// Finds neighbors and builds links with them, starting from an entry</span></div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment">/// point. The own neighbor list is assumed to be locked.</span></div>
<div class="line"><a name="l00441"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a41a5d502f7b17a0fca8d1b0c02123a24"> 441</a></span> <span class="comment"></span><span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#a41a5d502f7b17a0fca8d1b0c02123a24">HNSW::add_links_starting_from</a>(<a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a>& ptdis,</div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">storage_idx_t</a> pt_id,</div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">storage_idx_t</a> nearest,</div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordtype">float</span> d_nearest,</div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordtype">int</span> level,</div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  omp_lock_t *locks,</div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> &vt)</div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span> {</div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  std::priority_queue<NodeDistCloser> link_targets;</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>  search_neighbors_to_add(*<span class="keyword">this</span>, ptdis, link_targets, nearest, d_nearest,</div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  level, vt);</div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">// but we can afford only this many neighbors</span></div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordtype">int</span> M = <a class="code" href="structfaiss_1_1HNSW.html#ad497ea80f352c33242ba7835370c2dba">nb_neighbors</a>(level);</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>  ::faiss::shrink_neighbor_list(ptdis, link_targets, M);</div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">while</span> (!link_targets.empty()) {</div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordtype">int</span> other_id = link_targets.top().id;</div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> </div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  omp_set_lock(&locks[other_id]);</div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  add_link(*<span class="keyword">this</span>, ptdis, other_id, pt_id, level);</div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  omp_unset_lock(&locks[other_id]);</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>  add_link(*<span class="keyword">this</span>, ptdis, pt_id, other_id, level);</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>  link_targets.pop();</div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  }</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span> }</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</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> <span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment"> * Building, parallel</span></div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div>
<div class="line"><a name="l00477"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a314b809de6f329662ab09f258b49afb3"> 477</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#a314b809de6f329662ab09f258b49afb3">HNSW::add_with_locks</a>(<a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a>& ptdis, <span class="keywordtype">int</span> pt_level, <span class="keywordtype">int</span> pt_id,</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  std::vector<omp_lock_t>& locks,</div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a>& vt)</div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span> {</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="comment">// greedy search on upper levels</span></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>  <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">storage_idx_t</a> nearest;</div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="preprocessor">#pragma omp critical</span></div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  nearest = <a class="code" href="structfaiss_1_1HNSW.html#a95547d97c90b361a040bae0fb0d892b4">entry_point</a>;</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>  <span class="keywordflow">if</span> (nearest == -1) {</div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  max_level = pt_level;</div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  entry_point = pt_id;</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>  }</div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> </div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">if</span> (nearest < 0) {</div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">return</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"> 497</span> </div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  omp_set_lock(&locks[pt_id]);</div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span> </div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</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="l00501"></a><span class="lineno"> 501</span>  <span class="keywordtype">float</span> d_nearest = ptdis(nearest);</div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span> </div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">for</span>(; level > pt_level; level--) {</div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  greedy_update_nearest(*<span class="keyword">this</span>, ptdis, level, nearest, d_nearest);</div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  }</div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span> </div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">for</span>(; level >= 0; level--) {</div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <a class="code" href="structfaiss_1_1HNSW.html#a41a5d502f7b17a0fca8d1b0c02123a24">add_links_starting_from</a>(ptdis, pt_id, nearest, d_nearest,</div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  level, locks.data(), vt);</div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span> </div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  omp_unset_lock(&locks[pt_id]);</div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span> </div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">if</span> (pt_level > max_level) {</div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  max_level = pt_level;</div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  entry_point = pt_id;</div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  }</div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span> }</div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span> </div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="comment"></span></div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="comment">/** Do a BFS on the candidates list */</span></div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span> </div>
<div class="line"><a name="l00523"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#ad91ac2e25c896dab7fb9d32f94b60a6a"> 523</a></span> <span class="keywordtype">int</span> <a class="code" href="structfaiss_1_1HNSW.html#ad91ac2e25c896dab7fb9d32f94b60a6a">HNSW::search_from_candidates</a>(</div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a>& qdis, <span class="keywordtype">int</span> k,</div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <a class="code" href="structfaiss_1_1HNSW.html#a84f912f99bda1a827a74cdf8793af160">idx_t</a> *I, <span class="keywordtype">float</span> *D,</div>
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <a class="code" href="structfaiss_1_1HNSW_1_1MinimaxHeap.html">MinimaxHeap</a>& candidates,</div>
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a>& vt,</div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordtype">int</span> level, <span class="keywordtype">int</span> nres_in)<span class="keyword"> const</span></div>
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordtype">int</span> nres = nres_in;</div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordtype">int</span> ndis = 0;</div>
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < candidates.size(); i++) {</div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <a class="code" href="structfaiss_1_1HNSW.html#a84f912f99bda1a827a74cdf8793af160">idx_t</a> v1 = candidates.ids[i];</div>
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordtype">float</span> d = candidates.dis[i];</div>
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  FAISS_ASSERT(v1 >= 0);</div>
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordflow">if</span> (nres < k) {</div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  faiss::maxheap_push(++nres, D, I, d, v1);</div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d < D[0]) {</div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  faiss::maxheap_pop(nres--, D, I);</div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  faiss::maxheap_push(++nres, D, I, d, v1);</div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  }</div>
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853">set</a>(v1);</div>
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  }</div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div>
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordtype">bool</span> do_dis_check = <a class="code" href="structfaiss_1_1HNSW.html#adbf81f0b21102b942182c904892e0858">check_relative_distance</a>;</div>
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordtype">int</span> nstep = 0;</div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span> </div>
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">while</span> (candidates.size() > 0) {</div>
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordtype">float</span> d0 = 0;</div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordtype">int</span> v0 = candidates.pop_min(&d0);</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>  <span class="keywordflow">if</span> (do_dis_check) {</div>
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// tricky stopping condition: there are more that ef</span></div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="comment">// distances that are processed already that are smaller</span></div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="comment">// than d0</span></div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span> </div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordtype">int</span> n_dis_below = candidates.count_below(d0);</div>
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">if</span>(n_dis_below >= <a class="code" href="structfaiss_1_1HNSW.html#a6d1cb35c4220bf554af90133c71ae04f">efSearch</a>) {</div>
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  }</div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  }</div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span> </div>
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(v0, level, &begin, &end);</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="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; j++) {</div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordtype">int</span> v1 = <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordflow">if</span> (v1 < 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">if</span> (vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a18a972137362ff04a38943d66fc19dcb">get</a>(v1)) {</div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  }</div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853">set</a>(v1);</div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  ndis++;</div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keywordtype">float</span> d = qdis(v1);</div>
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keywordflow">if</span> (nres < k) {</div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  faiss::maxheap_push(++nres, D, I, d, v1);</div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d < D[0]) {</div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  faiss::maxheap_pop(nres--, D, I);</div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  faiss::maxheap_push(++nres, D, I, d, v1);</div>
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  }</div>
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  candidates.push(v1, d);</div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  }</div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span> </div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  nstep++;</div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">if</span> (!do_dis_check && nstep > <a class="code" href="structfaiss_1_1HNSW.html#a6d1cb35c4220bf554af90133c71ae04f">efSearch</a>) {</div>
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">break</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>  }</div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span> </div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">if</span> (level == 0) {</div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="preprocessor">#pragma omp critical</span></div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  hnsw_stats.n1 ++;</div>
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">if</span> (candidates.size() == 0) {</div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  hnsw_stats.n2 ++;</div>
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  }</div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  hnsw_stats.n3 += ndis;</div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  }</div>
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  }</div>
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span> </div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordflow">return</span> nres;</div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span> }</div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span> </div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span> </div>
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> * Searching</span></div>
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> </div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> std::priority_queue<HNSW::Node> HNSW::search_from_candidate_unbounded(</div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keyword">const</span> Node& node,</div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a>& qdis,</div>
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="keywordtype">int</span> ef,</div>
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> *vt)<span class="keyword"> const</span></div>
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordtype">int</span> ndis = 0;</div>
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  std::priority_queue<Node> top_candidates;</div>
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  std::priority_queue<Node, std::vector<Node>, std::greater<Node>> candidates;</div>
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span> </div>
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  top_candidates.push(node);</div>
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  candidates.push(node);</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>  vt-><a class="code" href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853">set</a>(node.second);</div>
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span> </div>
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">while</span> (!candidates.empty()) {</div>
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordtype">float</span> d0;</div>
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  storage_idx_t v0;</div>
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  std::tie(d0, v0) = candidates.top();</div>
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span> </div>
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">if</span> (d0 > top_candidates.top().first) {</div>
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordflow">break</span>;</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>  candidates.pop();</div>
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span> </div>
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(v0, 0, &begin, &end);</div>
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span> </div>
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j < end; ++j) {</div>
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordtype">int</span> v1 = <a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</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>  <span class="keywordflow">if</span> (v1 < 0) {</div>
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordflow">break</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>  <span class="keywordflow">if</span> (vt-><a class="code" href="structfaiss_1_1VisitedTable.html#a18a972137362ff04a38943d66fc19dcb">get</a>(v1)) {</div>
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  }</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>  vt-><a class="code" href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853">set</a>(v1);</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>  <span class="keywordtype">float</span> d1 = qdis(v1);</div>
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  ++ndis;</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="keywordflow">if</span> (top_candidates.top().first > d1 || top_candidates.size() < ef) {</div>
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  candidates.emplace(d1, v1);</div>
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  top_candidates.emplace(d1, v1);</div>
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span> </div>
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">if</span> (top_candidates.size() > ef) {</div>
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  top_candidates.pop();</div>
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div>
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  }</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>  }</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> <span class="preprocessor">#pragma omp critical</span></div>
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  ++hnsw_stats.n1;</div>
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">if</span> (candidates.size() == 0) {</div>
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  ++hnsw_stats.n2;</div>
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  }</div>
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  hnsw_stats.n3 += ndis;</div>
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  }</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>  <span class="keywordflow">return</span> top_candidates;</div>
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span> }</div>
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span> </div>
<div class="line"><a name="l00676"></a><span class="lineno"><a class="line" href="structfaiss_1_1HNSW.html#a330107a5801680609932849fc9404594"> 676</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HNSW.html#a330107a5801680609932849fc9404594">HNSW::search</a>(<a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a>& qdis, <span class="keywordtype">int</span> k,</div>
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <a class="code" href="structfaiss_1_1HNSW.html#a84f912f99bda1a827a74cdf8793af160">idx_t</a> *I, <span class="keywordtype">float</span> *D,</div>
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a>& vt)<span class="keyword"> const</span></div>
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00680"></a><span class="lineno"> 680</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="l00681"></a><span class="lineno"> 681</span> </div>
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="comment">// greedy search on upper levels</span></div>
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">storage_idx_t</a> nearest = <a class="code" href="structfaiss_1_1HNSW.html#a95547d97c90b361a040bae0fb0d892b4">entry_point</a>;</div>
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keywordtype">float</span> d_nearest = qdis(nearest);</div>
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span> </div>
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> level = max_level; level >= 1; level--) {</div>
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  greedy_update_nearest(*<span class="keyword">this</span>, qdis, level, nearest, d_nearest);</div>
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  }</div>
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span> </div>
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordtype">int</span> ef = std::max(<a class="code" href="structfaiss_1_1HNSW.html#a6d1cb35c4220bf554af90133c71ae04f">efSearch</a>, k);</div>
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1HNSW.html#a683738e8ab8e67fcabd823510c30b074">search_bounded_queue</a>) {</div>
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <a class="code" href="structfaiss_1_1HNSW_1_1MinimaxHeap.html">MinimaxHeap</a> candidates(ef);</div>
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span> </div>
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  candidates.push(nearest, d_nearest);</div>
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span> </div>
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <a class="code" href="structfaiss_1_1HNSW.html#ad91ac2e25c896dab7fb9d32f94b60a6a">search_from_candidates</a>(qdis, k, I, D, candidates, vt, 0);</div>
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  std::priority_queue<Node> top_candidates =</div>
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  search_from_candidate_unbounded(Node(d_nearest, nearest),</div>
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  qdis, ef, &vt);</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>  <span class="keywordflow">while</span> (top_candidates.size() > k) {</div>
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  top_candidates.pop();</div>
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  }</div>
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span> </div>
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordtype">int</span> nres = 0;</div>
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordflow">while</span> (!top_candidates.empty()) {</div>
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordtype">float</span> d;</div>
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">storage_idx_t</a> label;</div>
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  std::tie(d, label) = top_candidates.top();</div>
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  faiss::maxheap_push(++nres, D, I, d, label);</div>
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  top_candidates.pop();</div>
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  }</div>
<div class="line"><a name="l00714"></a><span class="lineno"> 714</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>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a>();</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="keywordflow">else</span> {</div>
<div class="line"><a name="l00719"></a><span class="lineno"> 719</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="l00720"></a><span class="lineno"> 720</span>  <a class="code" href="structfaiss_1_1HNSW_1_1MinimaxHeap.html">MinimaxHeap</a> candidates(candidates_size);</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>  std::vector<idx_t> I_to_next(candidates_size);</div>
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  std::vector<float> D_to_next(candidates_size);</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>  <span class="keywordtype">int</span> nres = 1;</div>
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  I_to_next[0] = <a class="code" href="structfaiss_1_1HNSW.html#a95547d97c90b361a040bae0fb0d892b4">entry_point</a>;</div>
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  D_to_next[0] = qdis(entry_point);</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>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> level = max_level; level >= 0; level--) {</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>  <span class="comment">// copy I, D -> candidates</span></div>
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span> </div>
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  candidates.clear();</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">for</span> (<span class="keywordtype">int</span> i = 0; i < nres; i++) {</div>
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  candidates.push(I_to_next[i], D_to_next[i]);</div>
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  }</div>
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span> </div>
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">if</span> (level == 0) {</div>
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  nres = <a class="code" href="structfaiss_1_1HNSW.html#ad91ac2e25c896dab7fb9d32f94b60a6a">search_from_candidates</a>(qdis, k, I, D, candidates, vt, 0);</div>
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  nres = <a class="code" href="structfaiss_1_1HNSW.html#ad91ac2e25c896dab7fb9d32f94b60a6a">search_from_candidates</a>(</div>
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  qdis, candidates_size,</div>
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  I_to_next.data(), D_to_next.data(),</div>
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  candidates, vt, level</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>  }</div>
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a>();</div>
<div class="line"><a name="l00749"></a><span class="lineno"> 749</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> }</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> </div>
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span> <span class="keywordtype">void</span> HNSW::MinimaxHeap::push(storage_idx_t i, <span class="keywordtype">float</span> v) {</div>
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keywordflow">if</span> (k == n) {</div>
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keywordflow">if</span> (v >= dis[0]) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  faiss::heap_pop<HC> (k--, dis.data(), ids.data());</div>
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  --nvalid;</div>
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  }</div>
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  faiss::heap_push<HC> (++k, dis.data(), ids.data(), v, i);</div>
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  ++nvalid;</div>
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span> }</div>
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span> </div>
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="keywordtype">float</span> HNSW::MinimaxHeap::max()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordflow">return</span> dis[0];</div>
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span> }</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> <span class="keywordtype">int</span> HNSW::MinimaxHeap::size()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="keywordflow">return</span> nvalid;</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="keywordtype">void</span> HNSW::MinimaxHeap::clear() {</div>
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  nvalid = k = 0;</div>
<div class="line"><a name="l00774"></a><span class="lineno"> 774</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="keywordtype">int</span> HNSW::MinimaxHeap::pop_min(<span class="keywordtype">float</span> *vmin_out) {</div>
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  assert(k > 0);</div>
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="comment">// returns min. This is an O(n) operation</span></div>
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keywordtype">int</span> i = k - 1;</div>
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">while</span> (i >= 0) {</div>
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keywordflow">if</span> (ids[i] != -1) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  i--;</div>
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  }</div>
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordflow">if</span> (i == -1) <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordtype">int</span> imin = i;</div>
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordtype">float</span> vmin = dis[i];</div>
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  i--;</div>
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keywordflow">while</span>(i >= 0) {</div>
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">if</span> (ids[i] != -1 && dis[i] < vmin) {</div>
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  vmin = dis[i];</div>
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  imin = i;</div>
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  }</div>
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  i--;</div>
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  }</div>
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordflow">if</span> (vmin_out) *vmin_out = vmin;</div>
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordtype">int</span> ret = ids[imin];</div>
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  ids[imin] = -1;</div>
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  --nvalid;</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> ret;</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">int</span> HNSW::MinimaxHeap::count_below(<span class="keywordtype">float</span> thresh) {</div>
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordtype">int</span> n_below = 0;</div>
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i < k; i++) {</div>
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordflow">if</span> (dis[i] < thresh) {</div>
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  n_below++;</div>
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  }</div>
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  }</div>
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span> </div>
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keywordflow">return</span> n_below;</div>
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span> }</div>
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span> </div>
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span> </div>
<div class="line"><a name="l00815"></a><span class="lineno"> 815</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#l00047">utils.h:47</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="HNSW_8cpp_source.html#l00477">HNSW.cpp:477</a></div></div>
<div class="ttc" id="structfaiss_1_1DistanceComputer_html_a4b7236a757c788401aac00598ed902c7"><div class="ttname"><a href="structfaiss_1_1DistanceComputer.html#a4b7236a757c788401aac00598ed902c7">faiss::DistanceComputer::symmetric_dis</a></div><div class="ttdeci">virtual float symmetric_dis(idx_t i, idx_t j)=0</div><div class="ttdoc">compute distance between two stored vectors </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="HNSW_8cpp_source.html#l00041">HNSW.cpp:41</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="HNSW_8h_source.html#l00236">HNSW.h:236</a></div></div>
<div class="ttc" id="structfaiss_1_1DistanceComputer_html"><div class="ttname"><a href="structfaiss_1_1DistanceComputer.html">faiss::DistanceComputer</a></div><div class="ttdef"><b>Definition:</b> <a href="AuxIndexStructures_8h_source.html#l00231">AuxIndexStructures.h:231</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="HNSW_8cpp_source.html#l00021">HNSW.cpp:21</a></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="HNSW_8h_source.html#l00117">HNSW.h:117</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="HNSW_8cpp_source.html#l00036">HNSW.cpp:36</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html_a84f912f99bda1a827a74cdf8793af160"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a84f912f99bda1a827a74cdf8793af160">faiss::HNSW::idx_t</a></div><div class="ttdeci">Index::idx_t idx_t</div><div class="ttdoc">Faiss results are 64-bit. </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00051">HNSW.h:51</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="HNSW_8h_source.html#l00099">HNSW.h:99</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_1_1NodeDistFarther_html"><div class="ttname"><a href="structfaiss_1_1HNSW_1_1NodeDistFarther.html">faiss::HNSW::NodeDistFarther</a></div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00090">HNSW.h:90</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#l00129">utils.cpp:129</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html_a683738e8ab8e67fcabd823510c30b074"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a683738e8ab8e67fcabd823510c30b074">faiss::HNSW::search_bounded_queue</a></div><div class="ttdeci">bool search_bounded_queue</div><div class="ttdoc">use bounded queue during exploration </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00137">HNSW.h:137</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="HNSW_8h_source.html#l00103">HNSW.h:103</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="HNSW_8h_source.html#l00241">HNSW.h:241</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html_a41a5d502f7b17a0fca8d1b0c02123a24"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a41a5d502f7b17a0fca8d1b0c02123a24">faiss::HNSW::add_links_starting_from</a></div><div class="ttdeci">void add_links_starting_from(DistanceComputer &ptdis, storage_idx_t pt_id, storage_idx_t nearest, float d_nearest, int level, omp_lock_t *locks, VisitedTable &vt)</div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8cpp_source.html#l00441">HNSW.cpp:441</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_ad3f0d3071f987baabbdd3da4500c87ea"><div class="ttname"><a href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">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_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="HNSW_8h_source.html#l00110">HNSW.h:110</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="HNSW_8h_source.html#l00223">HNSW.h:223</a></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 positive integer </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00114">utils.cpp:114</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="HNSW_8h_source.html#l00128">HNSW.h:128</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="HNSW_8h_source.html#l00131">HNSW.h:131</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="HNSW_8cpp_source.html#l00051">HNSW.cpp:51</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_1_1NodeDistCloser_html"><div class="ttname"><a href="structfaiss_1_1HNSW_1_1NodeDistCloser.html">faiss::HNSW::NodeDistCloser</a></div><div class="ttdoc">to sort pairs of (id, distance) from nearest to fathest or the reverse </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00083">HNSW.h:83</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="HNSW_8h_source.html#l00134">HNSW.h:134</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="HNSW_8cpp_source.html#l00027">HNSW.cpp:27</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html_ad91ac2e25c896dab7fb9d32f94b60a6a"><div class="ttname"><a href="structfaiss_1_1HNSW.html#ad91ac2e25c896dab7fb9d32f94b60a6a">faiss::HNSW::search_from_candidates</a></div><div class="ttdeci">int search_from_candidates(DistanceComputer &qdis, int k, idx_t *I, float *D, MinimaxHeap &candidates, VisitedTable &vt, int level, int nres_in=0) const </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8cpp_source.html#l00523">HNSW.cpp:523</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="HNSW_8cpp_source.html#l00062">HNSW.cpp:62</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="HNSW_8cpp_source.html#l00076">HNSW.cpp:76</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="HNSW_8cpp_source.html#l00676">HNSW.cpp:676</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="HNSW_8cpp_source.html#l00170">HNSW.cpp:170</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_1_1MinimaxHeap_html"><div class="ttname"><a href="structfaiss_1_1HNSW_1_1MinimaxHeap.html">faiss::HNSW::MinimaxHeap</a></div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00057">HNSW.h:57</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="HNSW_8h_source.html#l00114">HNSW.h:114</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="HNSW_8h_source.html#l00125">HNSW.h:125</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="HNSW_8h_source.html#l00048">HNSW.h:48</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="HNSW_8h_source.html#l00231">HNSW.h:231</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="HNSW_8h_source.html#l00106">HNSW.h:106</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="HNSW_8h_source.html#l00122">HNSW.h:122</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html_a0cf1870a859783925e95b15bf5e83584"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a0cf1870a859783925e95b15bf5e83584">faiss::HNSW::shrink_neighbor_list</a></div><div class="ttdeci">static void shrink_neighbor_list(DistanceComputer &qdis, std::priority_queue< NodeDistFarther > &input, std::vector< NodeDistFarther > &output, int max_size)</div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8cpp_source.html#l00235">HNSW.cpp:235</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>