697 lines
96 KiB
HTML
697 lines
96 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.5"/>
|
|
<title>Faiss: /tmp/faiss/tests/test_lowlevel_ivf.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>
|
|
<!-- 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 id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_1df44a9b705f43f2ce1efa42430a4914.html">tests</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">test_lowlevel_ivf.cpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 2015-present, Facebook, Inc.</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * All rights reserved.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * This source code is licensed under the BSD+Patents license found in the</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * LICENSE file in the root directory of this source tree.</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include <cstdio></span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include <cstdlib></span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <thread></span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <gtest/gtest.h></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <faiss/IndexIVF.h></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <faiss/IndexBinaryIVF.h></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <faiss/AutoTune.h></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <faiss/index_io.h></span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <faiss/IVFlib.h></span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <faiss/VectorTransform.h></span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="keyword">using namespace </span>faiss;</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">typedef</span> <a class="code" href="structfaiss_1_1Index.html#a040c6aed1f224f3ea7bf58eebc0c31a4">Index::idx_t</a> idx_t;</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// dimension of the vectors to index</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keywordtype">int</span> d = 32;</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> <span class="comment">// nb of training vectors</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keywordtype">size_t</span> nt = 5000;</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// size of the database points per window step</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="keywordtype">size_t</span> nb = 1000;</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// nb of queries</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keywordtype">size_t</span> nq = 200;</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keywordtype">int</span> k = 10;</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> std::vector<float> make_data(<span class="keywordtype">size_t</span> n)</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>  std::vector <float> database (n * d);</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n * d; i++) {</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  database[i] = drand48();</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  }</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">return</span> database;</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> }</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> std::unique_ptr<Index> make_trained_index(<span class="keyword">const</span> <span class="keywordtype">char</span> *index_type,</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <a class="code" href="namespacefaiss.html#afd12191c638da74760ff397cf319752c">MetricType</a> metric_type)</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> {</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">auto</span> index = std::unique_ptr<Index>(<a class="code" href="namespacefaiss.html#a0c95ec47726f2ce3fb668dcb1f9a3317">index_factory</a>(</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  d, index_type, metric_type));</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">auto</span> xt = make_data(nt);</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  index-><a class="code" href="structfaiss_1_1IndexShards.html#a36fbcc85eed9bf2ea15587f04be9ae0b">train</a>(nt, xt.data());</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <a class="code" href="structfaiss_1_1ParameterSpace.html">ParameterSpace</a>().<a class="code" href="structfaiss_1_1ParameterSpace.html#ac630c153ffd12f9994452c92fe57dc17">set_index_parameter</a> (index.get(), <span class="stringliteral">"nprobe"</span>, 4);</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">return</span> index;</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> }</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> std::vector<idx_t> search_index(<a class="code" href="structfaiss_1_1Index.html">Index</a> *index, <span class="keyword">const</span> <span class="keywordtype">float</span> *xq) {</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  std::vector<idx_t> I(k * nq);</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  std::vector<float> D(k * nq);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  index-><a class="code" href="structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7">search</a> (nq, xq, k, D.data(), I.data());</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">return</span> I;</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> }</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </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"> 76</span> </div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">/*************************************************************</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * Test functions for a given index type</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> *************************************************************/</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="keywordtype">void</span> test_lowlevel_access (<span class="keyword">const</span> <span class="keywordtype">char</span> *index_key, <a class="code" href="namespacefaiss.html#afd12191c638da74760ff397cf319752c">MetricType</a> metric) {</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  std::unique_ptr<Index> index = make_trained_index(index_key, metric);</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">auto</span> xb = make_data (nb);</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  index->add(nb, xb.data());</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"></span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> /** handle the case if we have a preprocessor */</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexPreTransform.html">IndexPreTransform</a> *index_pt =</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">dynamic_cast<</span><span class="keyword">const </span><a class="code" href="structfaiss_1_1IndexPreTransform.html">IndexPreTransform</a>*<span class="keyword">></span> (index.get());</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordtype">int</span> dt = index-><a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>;</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * xbt = xb.data();</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  std::unique_ptr<float []> del_xbt;</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>  <span class="keywordflow">if</span> (index_pt) {</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  dt = index_pt-><a class="code" href="structfaiss_1_1IndexPreTransform.html#aee3cbbe7915ec9ed13d59ca9276bdefc">index</a>-><a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>;</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  xbt = index_pt-><a class="code" href="structfaiss_1_1IndexPreTransform.html#aa773a5763ebdd1561152b34453fda96d">apply_chain</a> (nb, xb.data());</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> (xbt != xb.data()) {</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  del_xbt.reset((<span class="keywordtype">float</span>*)xbt);</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <a class="code" href="structfaiss_1_1IndexIVF.html">IndexIVF</a> * index_ivf = ivflib::extract_index_ivf (index.get());</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"></span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> /** Test independent encoding</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> * Makes it possible to do additions on a custom inverted list</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> * implementation. From a set of vectors, computes the inverted</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> * list ids + the codes corresponding to each vector.</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  std::vector<idx_t> list_nos (nb);</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  std::vector<uint8_t> codes (index_ivf-><a class="code" href="structfaiss_1_1IndexIVF.html#a46d1aeddb60643c5b3f096147c3e028f">code_size</a> * nb);</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  index_ivf-><a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>-><a class="code" href="structfaiss_1_1Index.html#a8bc5d8d1cd0dd7b34b3c98a9f76b4a9c">assign</a>(nb, xbt, list_nos.data());</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  index_ivf-><a class="code" href="structfaiss_1_1IndexIVF.html#a2f16f939a418d8e58ff43f4ee0dc17cc">encode_vectors</a> (nb, xbt, list_nos.data(), codes.data());</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// compare with normal IVF addition</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il = index_ivf-><a class="code" href="structfaiss_1_1IndexIVF.html#aa0e8fc5e04cbd8e0dde61f98bc7dd0bc">invlists</a>;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> list_no = 0; list_no < index_ivf-><a class="code" href="structfaiss_1_1Level1Quantizer.html#a1c4fc9d874d9492ee0ea27a5be388fa7">nlist</a>; list_no++) {</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">InvertedLists::ScopedCodes</a> ivf_codes (il, list_no);</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">InvertedLists::ScopedIds</a> ivf_ids (il, list_no);</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordtype">size_t</span> list_size = il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < list_size; i++) {</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">const</span> uint8_t *ref_code = ivf_codes.get() + i * il-><a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>;</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">const</span> uint8_t *new_code =</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  codes.data() + ivf_ids[i] * il-><a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>;</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  EXPECT_EQ (memcmp(ref_code, new_code, il-><a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>), 0);</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"></span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> /** Test independent search</span></div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> * Manually scans through inverted lists, computing distances and</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> * ordering results organized in a heap.</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">// sample some example queries and get reference search results.</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">auto</span> xq = make_data (nq);</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">auto</span> ref_I = search_index (index.get(), xq.data());</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="comment">// handle preprocessing</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * xqt = xq.data();</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  std::unique_ptr<float []> del_xqt;</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>  <span class="keywordflow">if</span> (index_pt) {</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  xqt = index_pt-><a class="code" href="structfaiss_1_1IndexPreTransform.html#aa773a5763ebdd1561152b34453fda96d">apply_chain</a> (nq, xq.data());</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">if</span> (xqt != xq.data()) {</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  del_xqt.reset((<span class="keywordtype">float</span>*)xqt);</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</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="comment">// quantize the queries to get the inverted list ids to visit.</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordtype">int</span> nprobe = index_ivf-><a class="code" href="structfaiss_1_1IndexIVF.html#affed235eadf27a13d753ee4d33a1dc58">nprobe</a>;</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  std::vector<idx_t> q_lists (nq * nprobe);</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  std::vector<float> q_dis (nq * nprobe);</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  index_ivf-><a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>-><a class="code" href="structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7">search</a> (nq, xqt, nprobe,</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  q_dis.data(), q_lists.data());</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>  <span class="comment">// object that does the scanning and distance computations.</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  std::unique_ptr<InvertedListScanner> scanner (</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  index_ivf-><a class="code" href="structfaiss_1_1IndexIVF.html#a3fc6ef4f20616dd86323ec1f89e51217">get_InvertedListScanner</a>());</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nq; i++) {</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  std::vector<idx_t> I (k, -1);</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordtype">float</span> default_dis = metric == METRIC_L2 ? HUGE_VAL : -HUGE_VAL;</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  std::vector<float> D (k, default_dis);</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>  scanner->set_query (xqt + i * dt);</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < nprobe; j++) {</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">int</span> list_no = q_lists[i * nprobe + j];</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">if</span> (list_no < 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  scanner->set_list (list_no, q_dis[i * nprobe + j]);</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>  <span class="comment">// here we get the inverted lists from the InvertedLists</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// object but they could come from anywhere</span></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>  scanner->scan_codes (</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no),</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">InvertedLists::ScopedCodes</a>(il, list_no).get(),</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">InvertedLists::ScopedIds</a>(il, list_no).get(),</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  D.data(), I.data(), k);</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (j == 0) {</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// all results so far come from list_no, so let's check if</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// the distance function works</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> jj = 0; jj < k; jj++) {</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordtype">int</span> vno = I[jj];</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">if</span> (vno < 0) <span class="keywordflow">break</span>; <span class="comment">// heap is not full yet</span></div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// we have the codes from the addition test</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordtype">float</span> computed_D = scanner->distance_to_code (</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  codes.data() + vno * il-><a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>);</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>  EXPECT_EQ (computed_D, D[jj]);</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>  }</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> </div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// re-order heap</span></div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (metric == METRIC_L2) {</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  maxheap_reorder (k, D.data(), I.data());</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>  minheap_reorder (k, D.data(), I.data());</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// check that we have the same results as the reference search</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < k; j++) {</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  EXPECT_EQ (I[j], ref_I[i * k + j]);</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>  }</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> }</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> } <span class="comment">// anonymous namespace</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </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="comment">/*************************************************************</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> * Test entry points</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"> *************************************************************/</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> TEST(TestLowLevelIVF, IVFFlatL2) {</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  test_lowlevel_access (<span class="stringliteral">"IVF32,Flat"</span>, METRIC_L2);</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> TEST(TestLowLevelIVF, PCAIVFFlatL2) {</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  test_lowlevel_access (<span class="stringliteral">"PCAR16,IVF32,Flat"</span>, METRIC_L2);</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> }</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> TEST(TestLowLevelIVF, IVFFlatIP) {</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  test_lowlevel_access (<span class="stringliteral">"IVF32,Flat"</span>, METRIC_INNER_PRODUCT);</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> }</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> TEST(TestLowLevelIVF, IVFSQL2) {</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  test_lowlevel_access (<span class="stringliteral">"IVF32,SQ8"</span>, METRIC_L2);</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> </div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> TEST(TestLowLevelIVF, IVFSQIP) {</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  test_lowlevel_access (<span class="stringliteral">"IVF32,SQ8"</span>, METRIC_INNER_PRODUCT);</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> </div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> </div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> TEST(TestLowLevelIVF, IVFPQL2) {</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  test_lowlevel_access (<span class="stringliteral">"IVF32,PQ4np"</span>, METRIC_L2);</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> TEST(TestLowLevelIVF, IVFPQIP) {</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  test_lowlevel_access (<span class="stringliteral">"IVF32,PQ4np"</span>, METRIC_INNER_PRODUCT);</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> }</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment">/*************************************************************</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> * Same for binary (a bit simpler)</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> *************************************************************/</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> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="keywordtype">int</span> nbit = 256;</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="comment">// here d is used the number of ints -> d=32 means 128 bits</span></div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> std::vector<uint8_t> make_data_binary(<span class="keywordtype">size_t</span> n)</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>  std::vector <uint8_t> database (n * nbit / 8);</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n * d; i++) {</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  database[i] = lrand48();</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="keywordflow">return</span> database;</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> }</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> std::unique_ptr<IndexBinary> make_trained_index_binary(<span class="keyword">const</span> <span class="keywordtype">char</span> *index_type)</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> {</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keyword">auto</span> index = std::unique_ptr<IndexBinary>(index_binary_factory(</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  nbit, index_type));</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">auto</span> xt = make_data_binary (nt);</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  index->train(nt, xt.data());</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">return</span> index;</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> }</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span> </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="keywordtype">void</span> test_lowlevel_access_binary (<span class="keyword">const</span> <span class="keywordtype">char</span> *index_key) {</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  std::unique_ptr<IndexBinary> index =</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  make_trained_index_binary (index_key);</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>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html">IndexBinaryIVF</a> * index_ivf = <span class="keyword">dynamic_cast<</span><a class="code" href="structfaiss_1_1IndexBinaryIVF.html">IndexBinaryIVF</a>*<span class="keyword">></span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  (index.get());</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  assert (index_ivf);</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span> </div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  index_ivf-><a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae9890e0946f3aba99ccad6b637df0c8b">nprobe</a> = 4;</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">auto</span> xb = make_data_binary (nb);</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  index->add(nb, xb.data());</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>  std::vector<idx_t> list_nos (nb);</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  index_ivf-><a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#a27c32414471c57138b248583fc0c5f8c">assign</a>(nb, xb.data(), list_nos.data());</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span> </div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">/* For binary there is no test for encoding because binary vectors</span></div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"> * are copied verbatim to the inverted lists */</span></div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il = index_ivf-><a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>;</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"></span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> /** Test independent search</span></div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> * Manually scans through inverted lists, computing distances and</span></div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> * ordering results organized in a heap.</span></div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span> </div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// sample some example queries and get reference search results.</span></div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">auto</span> xq = make_data_binary (nq);</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>  std::vector<idx_t> I_ref(k * nq);</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  std::vector<int32_t> D_ref(k * nq);</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  index->search (nq, xq.data(), k, D_ref.data(), I_ref.data());</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">// quantize the queries to get the inverted list ids to visit.</span></div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordtype">int</span> nprobe = index_ivf-><a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae9890e0946f3aba99ccad6b637df0c8b">nprobe</a>;</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span> </div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  std::vector<idx_t> q_lists (nq * nprobe);</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  std::vector<int32_t> q_dis (nq * nprobe);</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> </div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// quantize queries</span></div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  index_ivf-><a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#a48cdd06037d1fb8ce827e7522ba05fb8">search</a> (nq, xq.data(), nprobe,</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  q_dis.data(), q_lists.data());</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>  <span class="comment">// object that does the scanning and distance computations.</span></div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  std::unique_ptr<BinaryInvertedListScanner> scanner (</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  index_ivf->get_InvertedListScanner());</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nq; i++) {</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  std::vector<idx_t> I (k, -1);</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  uint32_t default_dis = 1 << 30;</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  std::vector<int32_t> D (k, default_dis);</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> </div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  scanner->set_query (xq.data() + i * index_ivf-><a class="code" href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">code_size</a>);</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < nprobe; j++) {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordtype">int</span> list_no = q_lists[i * nprobe + j];</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">if</span> (list_no < 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  scanner->set_list (list_no, q_dis[i * nprobe + j]);</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span> </div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// here we get the inverted lists from the InvertedLists</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="comment">// object but they could come from anywhere</span></div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span> </div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  scanner->scan_codes (</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no),</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">InvertedLists::ScopedCodes</a>(il, list_no).get(),</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">InvertedLists::ScopedIds</a>(il, list_no).get(),</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  D.data(), I.data(), k);</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span> </div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">if</span> (j == 0) {</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">// all results so far come from list_no, so let's check if</span></div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="comment">// the distance function works</span></div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> jj = 0; jj < k; jj++) {</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordtype">int</span> vno = I[jj];</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">if</span> (vno < 0) <span class="keywordflow">break</span>; <span class="comment">// heap is not full yet</span></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="comment">// we have the codes from the addition test</span></div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordtype">float</span> computed_D = scanner->distance_to_code (</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  xb.data() + vno * il-><a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>);</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>  EXPECT_EQ (computed_D, D[jj]);</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  printf(<span class="stringliteral">"new before reroder: ["</span>);</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < k; j++)</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  printf(<span class="stringliteral">"%ld,%d "</span>, I[j], D[j]);</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  printf(<span class="stringliteral">"]\n"</span>);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> </div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">// re-order heap</span></div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  heap_reorder<CMax<int32_t, int64_t> > (k, D.data(), I.data());</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  printf(<span class="stringliteral">"ref: ["</span>);</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < k; j++)</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  printf(<span class="stringliteral">"%ld,%d "</span>, I_ref[j], D_ref[j]);</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  printf(<span class="stringliteral">"]\nnew: ["</span>);</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < k; j++)</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  printf(<span class="stringliteral">"%ld,%d "</span>, I[j], D[j]);</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  printf(<span class="stringliteral">"]\n"</span>);</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>  <span class="comment">// check that we have the same results as the reference search</span></div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < k; j++) {</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="comment">// here the order is not guaranteed to be the same</span></div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// so we scan through ref results</span></div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">// EXPECT_EQ (I[j], I_ref[i * k + j]);</span></div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  EXPECT_LE (D[j], D_ref[i * k + k - 1]);</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">if</span> (D[j] < D_ref[i * k + k - 1]) {</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordtype">int</span> j2 = 0;</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">while</span> (j2 < k) {</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">if</span> (I[j] == I_ref[i * k + j2]) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  j2++;</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>  EXPECT_LT(j2, k); <span class="comment">// it was found</span></div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">if</span> (j2 < k) {</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  EXPECT_EQ(D[j], D_ref[i * k + j2]);</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  }</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> </div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> </div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> </div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span> }</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span> </div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> } <span class="comment">// anonymous namespace</span></div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> TEST(TestLowLevelIVF, IVFBinary) {</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  test_lowlevel_access_binary (<span class="stringliteral">"BIVF32"</span>);</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> }</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> </div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span> </div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="keywordtype">void</span> test_threaded_search (<span class="keyword">const</span> <span class="keywordtype">char</span> *index_key, <a class="code" href="namespacefaiss.html#afd12191c638da74760ff397cf319752c">MetricType</a> metric) {</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  std::unique_ptr<Index> index = make_trained_index(index_key, metric);</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> </div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keyword">auto</span> xb = make_data (nb);</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  index->add(nb, xb.data());</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"></span></div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"> /** handle the case if we have a preprocessor */</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>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexPreTransform.html">IndexPreTransform</a> *index_pt =</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keyword">dynamic_cast<</span><span class="keyword">const </span><a class="code" href="structfaiss_1_1IndexPreTransform.html">IndexPreTransform</a>*<span class="keyword">></span> (index.get());</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="keywordtype">int</span> dt = index-><a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>;</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * xbt = xb.data();</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  std::unique_ptr<float []> del_xbt;</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span> </div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordflow">if</span> (index_pt) {</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  dt = index_pt-><a class="code" href="structfaiss_1_1IndexPreTransform.html#aee3cbbe7915ec9ed13d59ca9276bdefc">index</a>-><a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>;</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  xbt = index_pt-><a class="code" href="structfaiss_1_1IndexPreTransform.html#aa773a5763ebdd1561152b34453fda96d">apply_chain</a> (nb, xb.data());</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">if</span> (xbt != xb.data()) {</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  del_xbt.reset((<span class="keywordtype">float</span>*)xbt);</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  }</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  }</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <a class="code" href="structfaiss_1_1IndexIVF.html">IndexIVF</a> * index_ivf = ivflib::extract_index_ivf (index.get());</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"></span></div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment"> /** Test independent search</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment"> * Manually scans through inverted lists, computing distances and</span></div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment"> * ordering results organized in a heap.</span></div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> </div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="comment">// sample some example queries and get reference search results.</span></div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keyword">auto</span> xq = make_data (nq);</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">auto</span> ref_I = search_index (index.get(), xq.data());</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>  <span class="comment">// handle preprocessing</span></div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * xqt = xq.data();</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  std::unique_ptr<float []> del_xqt;</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>  <span class="keywordflow">if</span> (index_pt) {</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  xqt = index_pt-><a class="code" href="structfaiss_1_1IndexPreTransform.html#aa773a5763ebdd1561152b34453fda96d">apply_chain</a> (nq, xq.data());</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordflow">if</span> (xqt != xq.data()) {</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  del_xqt.reset((<span class="keywordtype">float</span>*)xqt);</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">// quantize the queries to get the inverted list ids to visit.</span></div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordtype">int</span> nprobe = index_ivf-><a class="code" href="structfaiss_1_1IndexIVF.html#affed235eadf27a13d753ee4d33a1dc58">nprobe</a>;</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span> </div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  std::vector<idx_t> q_lists (nq * nprobe);</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  std::vector<float> q_dis (nq * nprobe);</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span> </div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  index_ivf-><a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>-><a class="code" href="structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7">search</a> (nq, xqt, nprobe,</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  q_dis.data(), q_lists.data());</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span> </div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">// now run search in this many threads</span></div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordtype">int</span> nproc = 3;</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span> </div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span> </div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nq; i++) {</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="comment">// one result table per thread</span></div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  std::vector<idx_t> I (k * nproc, -1);</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordtype">float</span> default_dis = metric == METRIC_L2 ? HUGE_VAL : -HUGE_VAL;</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  std::vector<float> D (k * nproc, default_dis);</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>  <span class="keyword">auto</span> search_function = [index_ivf, &I, &D, dt, i, nproc,</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  xqt, nprobe, &q_dis, &q_lists]</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  (<span class="keywordtype">int</span> rank) {</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il = index_ivf-><a class="code" href="structfaiss_1_1IndexIVF.html#aa0e8fc5e04cbd8e0dde61f98bc7dd0bc">invlists</a>;</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>  <span class="comment">// object that does the scanning and distance computations.</span></div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  std::unique_ptr<InvertedListScanner> scanner (</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  index_ivf-><a class="code" href="structfaiss_1_1IndexIVF.html#a3fc6ef4f20616dd86323ec1f89e51217">get_InvertedListScanner</a>());</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span> </div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  idx_t *local_I = I.data() + rank * k;</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordtype">float</span> *local_D = D.data() + rank * k;</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span> </div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  scanner->set_query (xqt + i * dt);</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> (<span class="keywordtype">int</span> j = rank; j < nprobe; j += nproc) {</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordtype">int</span> list_no = q_lists[i * nprobe + j];</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">if</span> (list_no < 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  scanner->set_list (list_no, q_dis[i * nprobe + j]);</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>  scanner->scan_codes (</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no),</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">InvertedLists::ScopedCodes</a>(il, list_no).get(),</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">InvertedLists::ScopedIds</a>(il, list_no).get(),</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  local_D, local_I, k);</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">// start the threads. Threads are numbered rank=0..nproc-1 (a la MPI)</span></div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="comment">// thread rank takes care of inverted lists</span></div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="comment">// rank, rank+nproc, rank+2*nproc,...</span></div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  std::vector<std::thread> threads;</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> rank = 0; rank < nproc; rank++) {</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  threads.emplace_back(search_function, rank);</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  }</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span> </div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// join threads, merge heaps</span></div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> rank = 0; rank < nproc; rank++) {</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  threads[rank].join();</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">if</span> (rank == 0) <span class="keywordflow">continue</span>; <span class="comment">// nothing to merge</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="comment">// merge into first result</span></div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">if</span> (metric == METRIC_L2) {</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  maxheap_addn (k, D.data(), I.data(),</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  D.data() + rank * k,</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  I.data() + rank * k, k);</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  minheap_addn (k, D.data(), I.data(),</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  D.data() + rank * k,</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  I.data() + rank * k, k);</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  }</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  }</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span> </div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="comment">// re-order heap</span></div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">if</span> (metric == METRIC_L2) {</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  maxheap_reorder (k, D.data(), I.data());</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  minheap_reorder (k, D.data(), I.data());</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span> </div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="comment">// check that we have the same results as the reference search</span></div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < k; j++) {</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  EXPECT_EQ (I[j], ref_I[i * k + j]);</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  }</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> </div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span> }</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span> </div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span> } <span class="comment">// anonymous namepace</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> TEST(TestLowLevelIVF, ThreadedSearch) {</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  test_threaded_search (<span class="stringliteral">"IVF32,Flat"</span>, METRIC_L2);</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span> }</div>
|
|
<div class="ttc" id="structfaiss_1_1IndexIVF_html_a2f16f939a418d8e58ff43f4ee0dc17cc"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#a2f16f939a418d8e58ff43f4ee0dc17cc">faiss::IndexIVF::encode_vectors</a></div><div class="ttdeci">virtual void encode_vectors(idx_t n, const float *x, const idx_t *list_nos, uint8_t *codes) const =0</div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexShards_html_a36fbcc85eed9bf2ea15587f04be9ae0b"><div class="ttname"><a href="structfaiss_1_1IndexShards.html#a36fbcc85eed9bf2ea15587f04be9ae0b">faiss::IndexShards::train</a></div><div class="ttdeci">void train(idx_t n, const float *x) override</div><div class="ttdef"><b>Definition:</b> <a href="MetaIndexes_8cpp_source.html#l00399">MetaIndexes.cpp:399</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexIVF_html"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html">faiss::IndexIVF</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00091">IndexIVF.h:91</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html_a48cdd06037d1fb8ce827e7522ba05fb8"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#a48cdd06037d1fb8ce827e7522ba05fb8">faiss::IndexBinary::search</a></div><div class="ttdeci">virtual void search(idx_t n, const uint8_t *x, idx_t k, int32_t *distances, idx_t *labels) const =0</div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_ae9890e0946f3aba99ccad6b637df0c8b"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#ae9890e0946f3aba99ccad6b637df0c8b">faiss::IndexBinaryIVF::nprobe</a></div><div class="ttdeci">size_t nprobe</div><div class="ttdoc">number of probes at query time </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8h_source.html#l00041">IndexBinaryIVF.h:41</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexPreTransform_html_aee3cbbe7915ec9ed13d59ca9276bdefc"><div class="ttname"><a href="structfaiss_1_1IndexPreTransform.html#aee3cbbe7915ec9ed13d59ca9276bdefc">faiss::IndexPreTransform::index</a></div><div class="ttdeci">Index * index</div><div class="ttdoc">! chain of tranforms </div><div class="ttdef"><b>Definition:</b> <a href="VectorTransform_8h_source.html#l00256">VectorTransform.h:256</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html">faiss::IndexBinaryIVF</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8h_source.html#l00036">IndexBinaryIVF.h:36</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexIVF_html_affed235eadf27a13d753ee4d33a1dc58"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#affed235eadf27a13d753ee4d33a1dc58">faiss::IndexIVF::nprobe</a></div><div class="ttdeci">size_t nprobe</div><div class="ttdoc">number of probes at query time </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00098">IndexIVF.h:98</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Index_html_a8bc5d8d1cd0dd7b34b3c98a9f76b4a9c"><div class="ttname"><a href="structfaiss_1_1Index.html#a8bc5d8d1cd0dd7b34b3c98a9f76b4a9c">faiss::Index::assign</a></div><div class="ttdeci">void assign(idx_t n, const float *x, idx_t *labels, idx_t k=1)</div><div class="ttdef"><b>Definition:</b> <a href="Index_8cpp_source.html#l00035">Index.cpp:35</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a9bd256053ee360473842105460fe285f"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">faiss::InvertedLists::list_size</a></div><div class="ttdeci">virtual size_t list_size(size_t list_no) const =0</div><div class="ttdoc">get the size of a list </div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexPreTransform_html"><div class="ttname"><a href="structfaiss_1_1IndexPreTransform.html">faiss::IndexPreTransform</a></div><div class="ttdef"><b>Definition:</b> <a href="VectorTransform_8h_source.html#l00253">VectorTransform.h:253</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a5c08ac8e6c1444e61b9f357cfba34e2e"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">faiss::IndexBinaryIVF::quantizer</a></div><div class="ttdeci">IndexBinary * quantizer</div><div class="ttdoc">quantizer that maps vectors to inverted lists </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8h_source.html#l00053">IndexBinaryIVF.h:53</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html_a277c2645b8def11c5d982384098c5380"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">faiss::IndexBinary::code_size</a></div><div class="ttdeci">int code_size</div><div class="ttdoc">number of bytes per vector ( = d / 8 ) </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinary_8h_source.html#l00041">IndexBinary.h:41</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html">faiss::InvertedLists</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00032">InvertedLists.h:32</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexPreTransform_html_aa773a5763ebdd1561152b34453fda96d"><div class="ttname"><a href="structfaiss_1_1IndexPreTransform.html#aa773a5763ebdd1561152b34453fda96d">faiss::IndexPreTransform::apply_chain</a></div><div class="ttdeci">const float * apply_chain(idx_t n, const float *x) const </div><div class="ttdef"><b>Definition:</b> <a href="VectorTransform_8cpp_source.html#l00899">VectorTransform.cpp:899</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Index_html_a2a002388d2c081c2dbab8508dcefe73d"><div class="ttname"><a href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">faiss::Index::d</a></div><div class="ttdeci">int d</div><div class="ttdoc">vector dimension </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00066">Index.h:66</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_ae06049e4259edb47d443ef87bdedc744"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">faiss::InvertedLists::code_size</a></div><div class="ttdeci">size_t code_size</div><div class="ttdoc">code size per vector in bytes </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00036">InvertedLists.h:36</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html_a27c32414471c57138b248583fc0c5f8c"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#a27c32414471c57138b248583fc0c5f8c">faiss::IndexBinary::assign</a></div><div class="ttdeci">void assign(idx_t n, const uint8_t *x, idx_t *labels, idx_t k=1)</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinary_8cpp_source.html#l00029">IndexBinary.cpp:29</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Index_html_a040c6aed1f224f3ea7bf58eebc0c31a4"><div class="ttname"><a href="structfaiss_1_1Index.html#a040c6aed1f224f3ea7bf58eebc0c31a4">faiss::Index::idx_t</a></div><div class="ttdeci">long idx_t</div><div class="ttdoc">all indices are this type </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00064">Index.h:64</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Index_html_aced51b1ebc33c47ab3ae15ea906559a7"><div class="ttname"><a href="structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7">faiss::Index::search</a></div><div class="ttdeci">virtual void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const =0</div></div>
|
|
<div class="ttc" id="structfaiss_1_1ParameterSpace_html_ac630c153ffd12f9994452c92fe57dc17"><div class="ttname"><a href="structfaiss_1_1ParameterSpace.html#ac630c153ffd12f9994452c92fe57dc17">faiss::ParameterSpace::set_index_parameter</a></div><div class="ttdeci">virtual void set_index_parameter(Index *index, const std::string &name, double val) const </div><div class="ttdoc">set one of the parameters </div><div class="ttdef"><b>Definition:</b> <a href="AutoTune_8cpp_source.html#l00452">AutoTune.cpp:452</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexIVF_html_aa0e8fc5e04cbd8e0dde61f98bc7dd0bc"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#aa0e8fc5e04cbd8e0dde61f98bc7dd0bc">faiss::IndexIVF::invlists</a></div><div class="ttdeci">InvertedLists * invlists</div><div class="ttdoc">Acess to the actual data. </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00093">IndexIVF.h:93</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1ParameterSpace_html"><div class="ttname"><a href="structfaiss_1_1ParameterSpace.html">faiss::ParameterSpace</a></div><div class="ttdef"><b>Definition:</b> <a href="AutoTune_8h_source.html#l00132">AutoTune.h:132</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Index_html"><div class="ttname"><a href="structfaiss_1_1Index.html">faiss::Index</a></div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00062">Index.h:62</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Level1Quantizer_html_a3cf99e2ee92b8558a066f821efab95d5"><div class="ttname"><a href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">faiss::Level1Quantizer::quantizer</a></div><div class="ttdeci">Index * quantizer</div><div class="ttdoc">quantizer that maps vectors to inverted lists </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00033">IndexIVF.h:33</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_1_1ScopedIds_html"><div class="ttname"><a href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">faiss::InvertedLists::ScopedIds</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00125">InvertedLists.h:125</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexIVF_html_a3fc6ef4f20616dd86323ec1f89e51217"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#a3fc6ef4f20616dd86323ec1f89e51217">faiss::IndexIVF::get_InvertedListScanner</a></div><div class="ttdeci">virtual InvertedListScanner * get_InvertedListScanner(bool store_pairs=false) const </div><div class="ttdoc">get a scanner for this index (store_pairs means ignore labels) </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00167">IndexIVF.h:167</a></div></div>
|
|
<div class="ttc" id="namespacefaiss_html_a0c95ec47726f2ce3fb668dcb1f9a3317"><div class="ttname"><a href="namespacefaiss.html#a0c95ec47726f2ce3fb668dcb1f9a3317">faiss::index_factory</a></div><div class="ttdeci">Index * index_factory(int d, const char *description_in, MetricType metric)</div><div class="ttdef"><b>Definition:</b> <a href="AutoTune_8cpp_source.html#l00722">AutoTune.cpp:722</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_1_1ScopedCodes_html"><div class="ttname"><a href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">faiss::InvertedLists::ScopedCodes</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00144">InvertedLists.h:144</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Level1Quantizer_html_a1c4fc9d874d9492ee0ea27a5be388fa7"><div class="ttname"><a href="structfaiss_1_1Level1Quantizer.html#a1c4fc9d874d9492ee0ea27a5be388fa7">faiss::Level1Quantizer::nlist</a></div><div class="ttdeci">size_t nlist</div><div class="ttdoc">number of possible key values </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00034">IndexIVF.h:34</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexIVF_html_a46d1aeddb60643c5b3f096147c3e028f"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#a46d1aeddb60643c5b3f096147c3e028f">faiss::IndexIVF::code_size</a></div><div class="ttdeci">size_t code_size</div><div class="ttdoc">code size per vector in bytes </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00096">IndexIVF.h:96</a></div></div>
|
|
<div class="ttc" id="namespacefaiss_html_afd12191c638da74760ff397cf319752c"><div class="ttname"><a href="namespacefaiss.html#afd12191c638da74760ff397cf319752c">faiss::MetricType</a></div><div class="ttdeci">MetricType</div><div class="ttdoc">Some algorithms support both an inner product version and a L2 search version. </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00045">Index.h:45</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a094ef9572645ff86a76ff4df967bf65a"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">faiss::IndexBinaryIVF::invlists</a></div><div class="ttdeci">InvertedLists * invlists</div><div class="ttdoc">Acess to the actual data. </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8h_source.html#l00038">IndexBinaryIVF.h:38</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>
|