826 lines
136 KiB
HTML
826 lines
136 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.5"/>
|
|
<title>Faiss: /data/users/hoss/faiss/IndexBinaryIVF.cpp Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<script type="text/javascript">
|
|
$(document).ready(function() { searchBox.OnSelectItem(0); });
|
|
</script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td style="padding-left: 0.5em;">
|
|
<div id="projectname">Faiss
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.5 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
</script>
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
<li>
|
|
<div id="MSearchBox" class="MSearchBoxInactive">
|
|
<span class="left">
|
|
<img id="MSearchSelect" src="search/mag_sel.png"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
alt=""/>
|
|
<input type="text" id="MSearchField" value="Search" accesskey="S"
|
|
onfocus="searchBox.OnSearchFieldFocus(true)"
|
|
onblur="searchBox.OnSearchFieldFocus(false)"
|
|
onkeyup="searchBox.OnSearchFieldChange(event)"/>
|
|
</span><span class="right">
|
|
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
|
|
</span>
|
|
</div>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="files.html"><span>File List</span></a></li>
|
|
</ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Friends</a></div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">/data/users/hoss/faiss/IndexBinaryIVF.cpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) Facebook, Inc. and its affiliates.</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * This source code is licensed under the MIT license found in the</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * LICENSE file in the root directory of this source tree.</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Copyright 2004-present Facebook. All Rights Reserved</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// -*- c++ -*-</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include "IndexBinaryIVF.h"</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include <cstdio></span></div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <memory></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 "hamming.h"</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include "utils.h"</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "AuxIndexStructures.h"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "FaissAssert.h"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "IndexFlat.h"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span>faiss {</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a569058430e4b1b81204df1c2cbd3084a"> 26</a></span> IndexBinaryIVF::IndexBinaryIVF(<a class="code" href="structfaiss_1_1IndexBinary.html">IndexBinary</a> *quantizer, <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nlist)</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  : <a class="code" href="structfaiss_1_1IndexBinary.html">IndexBinary</a>(d),</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  invlists(new <a class="code" href="structfaiss_1_1ArrayInvertedLists.html">ArrayInvertedLists</a>(nlist, code_size)),</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  own_invlists(true),</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  nprobe(1),</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  max_codes(0),</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  maintain_direct_map(false),</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  quantizer(quantizer),</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  nlist(nlist),</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  own_fields(false),</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  clustering_index(nullptr)</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>  FAISS_THROW_IF_NOT (d == quantizer-><a class="code" href="structfaiss_1_1IndexBinary.html#a0e485a7189eec2675032486d3b12cf88">d</a>);</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <a class="code" href="structfaiss_1_1IndexBinary.html#a132119ae93e240b54621c5c669853c7f">is_trained</a> = quantizer-><a class="code" href="structfaiss_1_1IndexBinary.html#a132119ae93e240b54621c5c669853c7f">is_trained</a> && (quantizer-><a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a> == <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a>);</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>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a0c3d371cf3985da70b6dacac74f03491">cp</a>.<a class="code" href="structfaiss_1_1ClusteringParameters.html#a5c7c6f05c75e1668befdb3be148fd5f9">niter</a> = 10;</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> }</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> IndexBinaryIVF::IndexBinaryIVF()</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  : invlists(nullptr),</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  own_invlists(false),</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  nprobe(1),</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  max_codes(0),</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  maintain_direct_map(false),</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  quantizer(nullptr),</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  nlist(0),</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  own_fields(false),</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  clustering_index(nullptr)</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"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#aaa0eb1eca49892304ceaa11bd3a5ffa1"> 56</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#aaa0eb1eca49892304ceaa11bd3a5ffa1">IndexBinaryIVF::add</a>(<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> n, <span class="keyword">const</span> uint8_t *x) {</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a8f5fc7b1cc59623154f7922459d8c7bb">add_with_ids</a>(n, x, <span class="keyword">nullptr</span>);</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> </div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a8f5fc7b1cc59623154f7922459d8c7bb"> 60</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a8f5fc7b1cc59623154f7922459d8c7bb">IndexBinaryIVF::add_with_ids</a>(<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> n, <span class="keyword">const</span> uint8_t *x, <span class="keyword">const</span> <span class="keywordtype">long</span> *xids) {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a6f74afc490b61ba896ecfad037c9a429">add_core</a>(n, x, xids, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> }</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a6f74afc490b61ba896ecfad037c9a429"> 64</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a6f74afc490b61ba896ecfad037c9a429">IndexBinaryIVF::add_core</a>(<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> n, <span class="keyword">const</span> uint8_t *x, <span class="keyword">const</span> <span class="keywordtype">long</span> *xids,</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> *precomputed_idx) {</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  FAISS_THROW_IF_NOT(<a class="code" href="structfaiss_1_1IndexBinary.html#a132119ae93e240b54621c5c669853c7f">is_trained</a>);</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  assert(<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  FAISS_THROW_IF_NOT_MSG(!(<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a1ae109b12efeb9b3349c1de2c6d480e5">maintain_direct_map</a> && xids),</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="stringliteral">"cannot have direct map and add with ids"</span>);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * idx;</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>  std::unique_ptr<long[]> scoped_idx;</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>  <span class="keywordflow">if</span> (precomputed_idx) {</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  idx = precomputed_idx;</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  scoped_idx.reset(<span class="keyword">new</span> <span class="keywordtype">long</span>[n]);</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#a27c32414471c57138b248583fc0c5f8c">assign</a>(n, x, scoped_idx.get());</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  idx = scoped_idx.get();</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">long</span> n_add = 0;</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++) {</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">long</span> <span class="keywordtype">id</span> = xids ? xids[i] : <a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a> + i;</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">long</span> list_no = idx[i];</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span> (list_no < 0)</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">const</span> uint8_t *xi = x + i * <a class="code" href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">code_size</a>;</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordtype">size_t</span> offset = <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#acd3e36cc06fc49e02773e403a84dba95">add_entry</a>(list_no, <span class="keywordtype">id</span>, xi);</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a1ae109b12efeb9b3349c1de2c6d480e5">maintain_direct_map</a>)</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  direct_map.push_back(list_no << 32 | offset);</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  n_add++;</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1IndexBinary.html#a1656c00d77d55999becd71e3d8ea6dd7">verbose</a>) {</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  printf(<span class="stringliteral">"IndexBinaryIVF::add_with_ids: added %ld / %ld vectors\n"</span>,</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  n_add, n);</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a> += n_add;</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> }</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a280d0a3958664c3eb4164fcb62496b00"> 104</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a280d0a3958664c3eb4164fcb62496b00">IndexBinaryIVF::make_direct_map</a>(<span class="keywordtype">bool</span> new_maintain_direct_map) {</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// nothing to do</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (new_maintain_direct_map == <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a1ae109b12efeb9b3349c1de2c6d480e5">maintain_direct_map</a>)</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (new_maintain_direct_map) {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  direct_map.resize(<a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a>, -1);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> key = 0; key < <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a>; key++) {</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordtype">size_t</span> list_size = <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(key);</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> *idlist = <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#a3ab6b389d8d85c5fbf23889064df7e95">get_ids</a>(key);</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">for</span> (<span class="keywordtype">long</span> ofs = 0; ofs < list_size; ofs++) {</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  FAISS_THROW_IF_NOT_MSG(0 <= idlist[ofs] && idlist[ofs] < <a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a>,</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="stringliteral">"direct map supported only for seuquential ids"</span>);</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  direct_map[idlist[ofs]] = key << 32 | ofs;</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>  }</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  direct_map.clear();</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>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a1ae109b12efeb9b3349c1de2c6d480e5">maintain_direct_map</a> = new_maintain_direct_map;</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> }</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#aeaf24ee802fe8f43879c735c363b6fd5"> 127</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#aeaf24ee802fe8f43879c735c363b6fd5">IndexBinaryIVF::search</a>(<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> n, <span class="keyword">const</span> uint8_t *x, <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> k,</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  int32_t *distances, <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> *labels)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  std::unique_ptr<idx_t[]> idx(<span class="keyword">new</span> <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a>[n * <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae9890e0946f3aba99ccad6b637df0c8b">nprobe</a>]);</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  std::unique_ptr<int32_t[]> coarse_dis(<span class="keyword">new</span> int32_t[n * nprobe]);</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordtype">double</span> t0 = <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>();</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#a48cdd06037d1fb8ce827e7522ba05fb8">search</a>(n, x, nprobe, coarse_dis.get(), idx.get());</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  indexIVF_stats.quantization_time += <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>() - t0;</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  t0 = <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>();</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#ac537aa14d2731c0ff907169211389b76">prefetch_lists</a>(idx.get(), n * <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae9890e0946f3aba99ccad6b637df0c8b">nprobe</a>);</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a4f33ec7083279f26c0966c5445ec702d">search_preassigned</a>(n, x, k, idx.get(), coarse_dis.get(),</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  distances, labels, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  indexIVF_stats.search_time += <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>() - t0;</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> }</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#ad233d3fcf4e001849301c0fbeb675f81"> 144</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ad233d3fcf4e001849301c0fbeb675f81">IndexBinaryIVF::reconstruct</a>(<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> key, uint8_t *recons)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  FAISS_THROW_IF_NOT_MSG(direct_map.size() == <a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a>,</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="stringliteral">"direct map is not initialized"</span>);</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordtype">long</span> list_no = direct_map[key] >> 32;</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordtype">long</span> offset = direct_map[key] & 0xffffffff;</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9e0d01c30760152fbac8f08bb5825de4">reconstruct_from_offset</a>(list_no, offset, recons);</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> }</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a4a8cd9437b9adc21696aefe1fa440a22"> 152</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a4a8cd9437b9adc21696aefe1fa440a22">IndexBinaryIVF::reconstruct_n</a>(<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> i0, <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> ni, uint8_t *recons)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  FAISS_THROW_IF_NOT(ni == 0 || (i0 >= 0 && i0 + ni <= <a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a>));</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>  <span class="keywordflow">for</span> (<span class="keywordtype">long</span> list_no = 0; list_no < <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a>; list_no++) {</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordtype">size_t</span> list_size = <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(list_no);</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> *idlist = <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#a3ab6b389d8d85c5fbf23889064df7e95">get_ids</a>(list_no);</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">for</span> (<span class="keywordtype">long</span> offset = 0; offset < list_size; offset++) {</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordtype">long</span> <span class="keywordtype">id</span> = idlist[offset];</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">if</span> (!(<span class="keywordtype">id</span> >= i0 && <span class="keywordtype">id</span> < i0 + ni)) {</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  uint8_t *reconstructed = recons + (<span class="keywordtype">id</span> - i0) * <a class="code" href="structfaiss_1_1IndexBinary.html#a0e485a7189eec2675032486d3b12cf88">d</a>;</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9e0d01c30760152fbac8f08bb5825de4">reconstruct_from_offset</a>(list_no, offset, reconstructed);</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> }</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a75260a5d45fb24a9a3c3462786f1de4d"> 171</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a75260a5d45fb24a9a3c3462786f1de4d">IndexBinaryIVF::search_and_reconstruct</a>(<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> n, <span class="keyword">const</span> uint8_t *x, <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> k,</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  int32_t *distances, <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> *labels,</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  uint8_t *recons)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  std::unique_ptr<idx_t[]> idx(<span class="keyword">new</span> <span class="keywordtype">long</span>[n * <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae9890e0946f3aba99ccad6b637df0c8b">nprobe</a>]);</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  std::unique_ptr<int32_t[]> coarse_dis(<span class="keyword">new</span> int32_t[n * nprobe]);</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>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#a48cdd06037d1fb8ce827e7522ba05fb8">search</a>(n, x, nprobe, coarse_dis.get(), idx.get());</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#ac537aa14d2731c0ff907169211389b76">prefetch_lists</a>(idx.get(), n * <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae9890e0946f3aba99ccad6b637df0c8b">nprobe</a>);</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// search_preassigned() with `store_pairs` enabled to obtain the list_no</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// and offset into `codes` for reconstruction</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a4f33ec7083279f26c0966c5445ec702d">search_preassigned</a>(n, x, k, idx.get(), coarse_dis.get(),</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  distances, labels, <span class="comment">/* store_pairs */</span><span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">for</span> (<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> i = 0; i < n; ++i) {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">for</span> (<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> j = 0; j < k; ++j) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> ij = i * k + j;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> key = labels[ij];</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  uint8_t *reconstructed = recons + ij * <a class="code" href="structfaiss_1_1IndexBinary.html#a0e485a7189eec2675032486d3b12cf88">d</a>;</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">if</span> (key < 0) {</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// Fill with NaNs</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  memset(reconstructed, -1, <span class="keyword">sizeof</span>(*reconstructed) * d);</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordtype">int</span> list_no = key >> 32;</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordtype">int</span> offset = key & 0xffffffff;</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// Update label to the actual id</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  labels[ij] = <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#a21b52cdb0601cd225bd7924932310876">get_single_id</a>(list_no, offset);</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9e0d01c30760152fbac8f08bb5825de4">reconstruct_from_offset</a>(list_no, offset, reconstructed);</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> }</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a9e0d01c30760152fbac8f08bb5825de4"> 206</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9e0d01c30760152fbac8f08bb5825de4">IndexBinaryIVF::reconstruct_from_offset</a>(<span class="keywordtype">long</span> list_no, <span class="keywordtype">long</span> offset,</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  uint8_t *recons)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  memcpy(recons, <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#afc2760bed7c210f2fad9b03109f561ee">get_single_code</a>(list_no, offset), <a class="code" href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">code_size</a>);</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> }</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> </div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a9dfe26312102f0010940fd2fbdf87d85"> 211</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9dfe26312102f0010940fd2fbdf87d85">IndexBinaryIVF::reset</a>() {</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  direct_map.clear();</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>->reset();</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a> = 0;</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> }</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a06d0e73e7ece9689000f936e7f1e2960"> 217</a></span> <span class="keywordtype">long</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a06d0e73e7ece9689000f936e7f1e2960">IndexBinaryIVF::remove_ids</a>(<span class="keyword">const</span> <a class="code" href="structfaiss_1_1IDSelector.html">IDSelector</a>& sel) {</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  FAISS_THROW_IF_NOT_MSG(!<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a1ae109b12efeb9b3349c1de2c6d480e5">maintain_direct_map</a>,</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="stringliteral">"direct map remove not implemented"</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>  std::vector<long> toremove(<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a>);</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="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">long</span> i = 0; i < <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a>; i++) {</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordtype">long</span> l0 = <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (i), l = l0, j = 0;</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> *idsi = <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#a3ab6b389d8d85c5fbf23889064df7e95">get_ids</a>(i);</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">while</span> (j < l) {</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">if</span> (sel.is_member(idsi[j])) {</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  l--;</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>->update_entry(</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  i, j,</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#a21b52cdb0601cd225bd7924932310876">get_single_id</a>(i, l),</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#afc2760bed7c210f2fad9b03109f561ee">get_single_code</a>(i, l));</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  j++;</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  toremove[i] = l0 - l;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// this will not run well in parallel on ondisk because of possible shrinks</span></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordtype">long</span> nremove = 0;</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">for</span> (<span class="keywordtype">long</span> i = 0; i < <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a>; i++) {</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">if</span> (toremove[i] > 0) {</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  nremove += toremove[i];</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>->resize(</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  i, <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(i) - toremove[i]);</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a> -= nremove;</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">return</span> nremove;</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> </div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a4b4b1ba42e6af7c30ccbaf0fc0f38034"> 253</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a4b4b1ba42e6af7c30ccbaf0fc0f38034">IndexBinaryIVF::train</a>(<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> n, <span class="keyword">const</span> uint8_t *x) {</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1IndexBinary.html#a1656c00d77d55999becd71e3d8ea6dd7">verbose</a>) {</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  printf(<span class="stringliteral">"Training quantizer\n"</span>);</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  }</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> </div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#a132119ae93e240b54621c5c669853c7f">is_trained</a> && (<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a> == <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a>)) {</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1IndexBinary.html#a1656c00d77d55999becd71e3d8ea6dd7">verbose</a>) {</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  printf(<span class="stringliteral">"IVF quantizer does not need training.\n"</span>);</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1IndexBinary.html#a1656c00d77d55999becd71e3d8ea6dd7">verbose</a>) {</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  printf(<span class="stringliteral">"Training quantizer on %ld vectors in %dD\n"</span>, n, <a class="code" href="structfaiss_1_1IndexBinary.html#a0e485a7189eec2675032486d3b12cf88">d</a>);</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <a class="code" href="structfaiss_1_1Clustering.html">Clustering</a> clus(<a class="code" href="structfaiss_1_1IndexBinary.html#a0e485a7189eec2675032486d3b12cf88">d</a>, <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a>, <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a0c3d371cf3985da70b6dacac74f03491">cp</a>);</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#a11bff8bcaa366c563076a3d18f3ae30c">reset</a>();</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  std::unique_ptr<float[]> x_f(<span class="keyword">new</span> <span class="keywordtype">float</span>[n * <a class="code" href="structfaiss_1_1IndexBinary.html#a0e485a7189eec2675032486d3b12cf88">d</a>]);</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="namespacefaiss.html#ac8260e10cfeed08a4344b85845773e16">binary_to_real</a>(n * d, x, x_f.get());</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>  <a class="code" href="structfaiss_1_1IndexFlatL2.html">IndexFlatL2</a> index_tmp(d);</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span> </div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae4b4048070a6fc5aa3226a2edf42db5e">clustering_index</a> && <a class="code" href="structfaiss_1_1IndexBinary.html#a1656c00d77d55999becd71e3d8ea6dd7">verbose</a>) {</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  printf(<span class="stringliteral">"using clustering_index of dimension %d to do the clustering\n"</span>,</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae4b4048070a6fc5aa3226a2edf42db5e">clustering_index</a>-><a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>);</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  clus.<a class="code" href="structfaiss_1_1Clustering.html#a839f210abb11c7a1c7162e336e0ff9cf">train</a>(n, x_f.get(), <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae4b4048070a6fc5aa3226a2edf42db5e">clustering_index</a> ? *<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#ae4b4048070a6fc5aa3226a2edf42db5e">clustering_index</a> : index_tmp);</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  std::unique_ptr<uint8_t[]> x_b(<span class="keyword">new</span> uint8_t[clus.<a class="code" href="structfaiss_1_1Clustering.html#a87581785d9516c683bbc7c9392bfa993">k</a> * <a class="code" href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">code_size</a>]);</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <a class="code" href="namespacefaiss.html#ab491c9e2f77a750c9f0324bfe00e3e57">real_to_binary</a>(d * clus.<a class="code" href="structfaiss_1_1Clustering.html#a87581785d9516c683bbc7c9392bfa993">k</a>, clus.<a class="code" href="structfaiss_1_1Clustering.html#a64c5ec0b4a7967d8be2872974b455ff1">centroids</a>.data(), x_b.get());</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> </div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#af04b1093cdebfea189e0e04da68794d7">add</a>(clus.<a class="code" href="structfaiss_1_1Clustering.html#a87581785d9516c683bbc7c9392bfa993">k</a>, x_b.get());</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>-><a class="code" href="structfaiss_1_1IndexBinary.html#a132119ae93e240b54621c5c669853c7f">is_trained</a> = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> </div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="structfaiss_1_1IndexBinary.html#a132119ae93e240b54621c5c669853c7f">is_trained</a> = <span class="keyword">true</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> </div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a5296e62b0524f13ff66c61fb7db499a2"> 292</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5296e62b0524f13ff66c61fb7db499a2">IndexBinaryIVF::merge_from</a>(<a class="code" href="structfaiss_1_1IndexBinaryIVF.html">IndexBinaryIVF</a> &other, <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> add_id) {</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// minimal sanity checks</span></div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  FAISS_THROW_IF_NOT(other.<a class="code" href="structfaiss_1_1IndexBinary.html#a0e485a7189eec2675032486d3b12cf88">d</a> == <a class="code" href="structfaiss_1_1IndexBinary.html#a0e485a7189eec2675032486d3b12cf88">d</a>);</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  FAISS_THROW_IF_NOT(other.<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a> == <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a>);</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  FAISS_THROW_IF_NOT(other.<a class="code" href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">code_size</a> == <a class="code" href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">code_size</a>);</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  FAISS_THROW_IF_NOT_MSG((!<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a1ae109b12efeb9b3349c1de2c6d480e5">maintain_direct_map</a> &&</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  !other.<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a1ae109b12efeb9b3349c1de2c6d480e5">maintain_direct_map</a>),</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="stringliteral">"direct map copy not implemented"</span>);</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  FAISS_THROW_IF_NOT_MSG(<span class="keyword">typeid</span> (*<span class="keyword">this</span>) == <span class="keyword">typeid</span> (other),</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="stringliteral">"can only merge indexes of the same type"</span>);</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>-><a class="code" href="structfaiss_1_1InvertedLists.html#ac2a0686121ef5bdd6eb70f7eb3cf9b3a">merge_from</a> (other.<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>, add_id);</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a> += other.<a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a>;</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  other.<a class="code" href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">ntotal</a> = 0;</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span> }</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="keywordtype">void</span> IndexBinaryIVF::replace_invlists(<a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il, <span class="keywordtype">bool</span> own) {</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  FAISS_THROW_IF_NOT(il-><a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a> == <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">nlist</a> &&</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  il-><a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a> == <a class="code" href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">code_size</a>);</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">if</span> (own_invlists) {</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keyword">delete</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>;</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a> = il;</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  own_invlists = own;</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> </div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span> </div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="keyword">using</span> idx_t = <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a>;</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span> </div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="keyword">template</span><<span class="keyword">class</span> HammingComputer, <span class="keywordtype">bool</span> store_pairs></div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="keyword">struct </span>IVFBinaryScannerL2: BinaryInvertedListScanner {</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>  HammingComputer hc;</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordtype">size_t</span> code_size;</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>  IVFBinaryScannerL2 (<span class="keywordtype">size_t</span> code_size): code_size (code_size)</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  {}</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordtype">void</span> set_query (<span class="keyword">const</span> uint8_t *query_vector)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  hc.set (query_vector, code_size);</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span> </div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  idx_t list_no;</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordtype">void</span> set_list (idx_t list_no, uint8_t <span class="comment">/* coarse_dis */</span>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  this->list_no = list_no;</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  uint32_t distance_to_code (<span class="keyword">const</span> uint8_t *code)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">return</span> hc.hamming (code);</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  }</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordtype">size_t</span> scan_codes (<span class="keywordtype">size_t</span> n,</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">const</span> uint8_t *codes,</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">const</span> idx_t *ids,</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  int32_t *simi, idx_t *idxi,</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordtype">size_t</span> k)<span class="keyword"> const override</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="keyword"> </span>{</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">using</span> C = CMax<int32_t, idx_t>;</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordtype">size_t</span> nup = 0;</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < n; j++) {</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  uint32_t dis = hc.hamming (codes);</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">if</span> (dis < simi[0]) {</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  heap_pop<C> (k, simi, idxi);</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordtype">long</span> <span class="keywordtype">id</span> = store_pairs ? (list_no << 32 | j) : ids[j];</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  heap_push<C> (k, simi, idxi, dis, id);</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  nup++;</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  }</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  codes += code_size;</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">return</span> nup;</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> </div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> </div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span> };</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> store_pairs></div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> BinaryInvertedListScanner *select_IVFBinaryScannerL2 (<span class="keywordtype">size_t</span> code_size) {</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">switch</span> (code_size) {</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="preprocessor">#define HANDLE_CS(cs) \</span></div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="preprocessor"> case cs: \</span></div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="preprocessor"> return new IVFBinaryScannerL2<HammingComputer ## cs, store_pairs> (cs);</span></div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="preprocessor"></span> HANDLE_CS(4);</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  HANDLE_CS(8);</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  HANDLE_CS(16);</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  HANDLE_CS(20);</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  HANDLE_CS(32);</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  HANDLE_CS(64);</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="preprocessor">#undef HANDLE_CS</span></div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="preprocessor"></span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">if</span> (code_size % 8 == 0) {</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> IVFBinaryScannerL2<HammingComputerM8,</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  store_pairs> (code_size);</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (code_size % 4 == 0) {</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> IVFBinaryScannerL2<HammingComputerM4,</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  store_pairs> (code_size);</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> IVFBinaryScannerL2<HammingComputerDefault,</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  store_pairs> (code_size);</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  }</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> }</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span> </div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="keywordtype">void</span> search_knn_hamming_heap(<span class="keyword">const</span> IndexBinaryIVF& ivf,</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordtype">size_t</span> n,</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keyword">const</span> uint8_t *x,</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  idx_t k,</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keyword">const</span> idx_t *keys,</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keyword">const</span> int32_t * coarse_dis,</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  int32_t *distances, idx_t *labels,</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordtype">bool</span> store_pairs,</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keyword">const</span> IVFSearchParameters *params)</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>  <span class="keywordtype">long</span> nprobe = params ? params->nprobe : ivf.nprobe;</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordtype">long</span> max_codes = params ? params->max_codes : ivf.max_codes;</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="code" href="namespacefaiss.html#afd12191c638da74760ff397cf319752c">MetricType</a> metric_type = ivf.metric_type;</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="comment">// almost verbatim copy from IndexIVF::search_preassigned</span></div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordtype">size_t</span> nlistv = 0, ndis = 0, nheap = 0;</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keyword">using</span> HeapForIP = CMin<int32_t, idx_t>;</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keyword">using</span> HeapForL2 = CMax<int32_t, idx_t>;</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> </div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="preprocessor">#pragma omp parallel if(n > 1) reduction(+: nlistv, ndis, nheap)</span></div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="preprocessor"></span> {</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  std::unique_ptr<BinaryInvertedListScanner> scanner</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  (ivf.get_InvertedListScanner (store_pairs));</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="preprocessor">#pragma omp for</span></div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++) {</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keyword">const</span> uint8_t *xi = x + i * ivf.code_size;</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  scanner->set_query(xi);</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * keysi = keys + i * nprobe;</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  int32_t * simi = distances + k * i;</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordtype">long</span> * idxi = labels + k * i;</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">if</span> (metric_type == METRIC_INNER_PRODUCT) {</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  heap_heapify<HeapForIP> (k, simi, idxi);</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  heap_heapify<HeapForL2> (k, simi, idxi);</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  }</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="keywordtype">size_t</span> nscan = 0;</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span> </div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> ik = 0; ik < nprobe; ik++) {</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordtype">long</span> key = keysi[ik]; <span class="comment">/* select the list */</span></div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span> (key < 0) {</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="comment">// not enough centroids for multiprobe</span></div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">continue</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>  FAISS_THROW_IF_NOT_FMT</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  (key < (<span class="keywordtype">long</span>) ivf.nlist,</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="stringliteral">"Invalid key=%ld at ik=%ld nlist=%ld\n"</span>,</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  key, ik, ivf.nlist);</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span> </div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  scanner->set_list (key, coarse_dis[i * nprobe + ik]);</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> </div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  nlistv++;</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordtype">size_t</span> list_size = ivf.invlists->list_size(key);</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  InvertedLists::ScopedCodes scodes (ivf.invlists, key);</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  std::unique_ptr<InvertedLists::ScopedIds> sids;</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> * ids = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (!store_pairs) {</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  sids.reset (<span class="keyword">new</span> InvertedLists::ScopedIds (ivf.invlists, key));</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  ids = sids->get();</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  }</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> </div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  nheap += scanner->scan_codes (list_size, scodes.get(),</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  ids, simi, idxi, k);</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>  nscan += list_size;</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">if</span> (max_codes && nscan >= max_codes)</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordflow">break</span>;</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> </div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  ndis += nscan;</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">if</span> (metric_type == METRIC_INNER_PRODUCT) {</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  heap_reorder<HeapForIP> (k, simi, idxi);</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  heap_reorder<HeapForL2> (k, simi, idxi);</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  } <span class="comment">// parallel for</span></div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  } <span class="comment">// parallel</span></div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span> </div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  indexIVF_stats.nq += n;</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  indexIVF_stats.nlist += nlistv;</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  indexIVF_stats.ndis += ndis;</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  indexIVF_stats.nheap_updates += nheap;</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> </div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> }</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> </div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="keyword">template</span><<span class="keyword">class</span> HammingComputer, <span class="keywordtype">bool</span> store_pairs></div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="keywordtype">void</span> search_knn_hamming_count(<span class="keyword">const</span> IndexBinaryIVF& ivf,</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordtype">size_t</span> nx,</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keyword">const</span> uint8_t *x,</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> *keys,</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordtype">int</span> k,</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  int32_t *distances,</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordtype">long</span> *labels,</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keyword">const</span> IVFSearchParameters *params) {</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> nBuckets = ivf.d + 1;</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  std::vector<int> all_counters(nx * nBuckets, 0);</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  std::unique_ptr<long[]> all_ids_per_dis(<span class="keyword">new</span> <span class="keywordtype">long</span>[nx * nBuckets * k]);</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="keywordtype">long</span> nprobe = params ? params->nprobe : ivf.nprobe;</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordtype">long</span> max_codes = params ? params->max_codes : ivf.max_codes;</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  std::vector<HCounterState<HammingComputer>> cs;</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < nx; ++i) {</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  cs.push_back(HCounterState<HammingComputer>(</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  all_counters.data() + i * nBuckets,</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  all_ids_per_dis.get() + i * nBuckets * k,</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  x + i * ivf.code_size,</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  ivf.d,</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  k</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> </div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordtype">size_t</span> nlistv = 0, ndis = 0;</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span> </div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span> <span class="preprocessor">#pragma omp parallel for reduction(+: nlistv, ndis)</span></div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < nx; i++) {</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * keysi = keys + i * nprobe;</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  HCounterState<HammingComputer>& csi = cs[i];</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="keywordtype">size_t</span> nscan = 0;</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span> </div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> ik = 0; ik < nprobe; ik++) {</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordtype">long</span> key = keysi[ik]; <span class="comment">/* select the list */</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordflow">if</span> (key < 0) {</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="comment">// not enough centroids for multiprobe</span></div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  FAISS_THROW_IF_NOT_FMT (</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  key < (<span class="keywordtype">long</span>) ivf.nlist,</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="stringliteral">"Invalid key=%ld at ik=%ld nlist=%ld\n"</span>,</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  key, ik, ivf.nlist);</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  nlistv++;</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordtype">size_t</span> list_size = ivf.invlists->list_size(key);</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  InvertedLists::ScopedCodes scodes (ivf.invlists, key);</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keyword">const</span> uint8_t *list_vecs = scodes.get();</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> *ids = store_pairs</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  ? <span class="keyword">nullptr</span></div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  : ivf.invlists->get_ids(key);</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span> </div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < list_size; j++) {</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keyword">const</span> uint8_t * yj = list_vecs + ivf.code_size * j;</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span> </div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordtype">long</span> <span class="keywordtype">id</span> = store_pairs ? (key << 32 | j) : ids[j];</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  csi.update_counter(yj, <span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">if</span> (ids)</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  ivf.invlists->release_ids (key, ids);</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>  nscan += list_size;</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">if</span> (max_codes && nscan >= max_codes)</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">break</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>  ndis += nscan;</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span> </div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordtype">int</span> nres = 0;</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> b = 0; b < nBuckets && nres < k; b++) {</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l < csi.counters[b] && nres < k; l++) {</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  labels[i * k + nres] = csi.ids_per_dis[b * k + l];</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  distances[i * k + nres] = b;</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  nres++;</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  }</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  }</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keywordflow">while</span> (nres < k) {</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  labels[i * k + nres] = -1;</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  distances[i * k + nres] = std::numeric_limits<int32_t>::max();</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  ++nres;</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  }</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span> </div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  indexIVF_stats.nq += nx;</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  indexIVF_stats.nlist += nlistv;</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  indexIVF_stats.ndis += ndis;</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span> }</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span> </div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span> </div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span> </div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="keyword">template</span><<span class="keywordtype">bool</span> store_pairs></div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span> <span class="keywordtype">void</span> search_knn_hamming_count_1 (</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keyword">const</span> IndexBinaryIVF& ivf,</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordtype">size_t</span> nx,</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keyword">const</span> uint8_t *x,</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> *keys,</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordtype">int</span> k,</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  int32_t *distances,</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordtype">long</span> *labels,</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keyword">const</span> IVFSearchParameters *params) {</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">switch</span> (ivf.code_size) {</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="preprocessor">#define HANDLE_CS(cs) \</span></div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="preprocessor"> case cs: \</span></div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="preprocessor"> search_knn_hamming_count<HammingComputer ## cs, store_pairs>( \</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="preprocessor"> ivf, nx, x, keys, k, distances, labels, params); \</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="preprocessor"> break;</span></div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="preprocessor"></span> HANDLE_CS(4);</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  HANDLE_CS(8);</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  HANDLE_CS(16);</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  HANDLE_CS(20);</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  HANDLE_CS(32);</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  HANDLE_CS(64);</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="preprocessor">#undef HANDLE_CS</span></div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="preprocessor"></span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordflow">if</span> (ivf.code_size % 8 == 0) {</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  search_knn_hamming_count<HammingComputerM8, store_pairs></div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  (ivf, nx, x, keys, k, distances, labels, params);</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ivf.code_size % 4 == 0) {</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  search_knn_hamming_count<HammingComputerM4, store_pairs></div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  (ivf, nx, x, keys, k, distances, labels, params);</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  search_knn_hamming_count<HammingComputerDefault, store_pairs></div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  (ivf, nx, x, keys, k, distances, labels, params);</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  }</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  }</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span> </div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span> }</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span> </div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span> </div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span> BinaryInvertedListScanner *IndexBinaryIVF::get_InvertedListScanner</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  (<span class="keywordtype">bool</span> store_pairs)<span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordflow">if</span> (store_pairs) {</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordflow">return</span> select_IVFBinaryScannerL2<true> (<a class="code" href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">code_size</a>);</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordflow">return</span> select_IVFBinaryScannerL2<false> (<a class="code" href="structfaiss_1_1IndexBinary.html#a277c2645b8def11c5d982384098c5380">code_size</a>);</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  }</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span> }</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span> </div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexBinaryIVF.html#a4f33ec7083279f26c0966c5445ec702d"> 637</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a4f33ec7083279f26c0966c5445ec702d">IndexBinaryIVF::search_preassigned</a>(<a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> n, <span class="keyword">const</span> uint8_t *x, <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> k,</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> *idx,</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keyword">const</span> int32_t * coarse_dis,</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  int32_t *distances, <a class="code" href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">idx_t</a> *labels,</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordtype">bool</span> store_pairs,</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1IVFSearchParameters.html">IVFSearchParameters</a> *params</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  )<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span> </div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#abcab702ebe1814ff432401bfd39df492">use_heap</a>) {</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  search_knn_hamming_heap (*<span class="keyword">this</span>, n, x, k, idx, coarse_dis,</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  distances, labels, store_pairs,</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  params);</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordflow">if</span> (store_pairs) {</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  search_knn_hamming_count_1<true></div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  (*<span class="keyword">this</span>, n, x, idx, k, distances, labels, params);</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  search_knn_hamming_count_1<false></div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  (*<span class="keyword">this</span>, n, x, idx, k, distances, labels, params);</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  }</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  }</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span> }</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span> </div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span> IndexBinaryIVF::~IndexBinaryIVF() {</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span> (own_invlists) {</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keyword">delete</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a094ef9572645ff86a76ff4df967bf65a">invlists</a>;</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  }</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span> </div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a2c7bc3be67d829d49ac1ab2afc4f6b0c">own_fields</a>) {</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keyword">delete</span> <a class="code" href="structfaiss_1_1IndexBinaryIVF.html#a5c08ac8e6c1444e61b9f357cfba34e2e">quantizer</a>;</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  }</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span> }</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span> </div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span> </div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span> } <span class="comment">// namespace faiss</span></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#l00040">IndexBinaryIVF.h:40</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a6f74afc490b61ba896ecfad037c9a429"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a6f74afc490b61ba896ecfad037c9a429">faiss::IndexBinaryIVF::add_core</a></div><div class="ttdeci">void add_core(idx_t n, const uint8_t *x, const long *xids, const long *precomputed_idx)</div><div class="ttdoc">same as add_with_ids, with precomputed coarse quantizer </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00064">IndexBinaryIVF.cpp:64</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1ClusteringParameters_html_a5c7c6f05c75e1668befdb3be148fd5f9"><div class="ttname"><a href="structfaiss_1_1ClusteringParameters.html#a5c7c6f05c75e1668befdb3be148fd5f9">faiss::ClusteringParameters::niter</a></div><div class="ttdeci">int niter</div><div class="ttdoc">clustering iterations </div><div class="ttdef"><b>Definition:</b> <a href="Clustering_8h_source.html#l00023">Clustering.h:23</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1ArrayInvertedLists_html"><div class="ttname"><a href="structfaiss_1_1ArrayInvertedLists.html">faiss::ArrayInvertedLists</a></div><div class="ttdoc">simple (default) implementation as an array of inverted lists </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00182">InvertedLists.h:182</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a9e0d01c30760152fbac8f08bb5825de4"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a9e0d01c30760152fbac8f08bb5825de4">faiss::IndexBinaryIVF::reconstruct_from_offset</a></div><div class="ttdeci">virtual void reconstruct_from_offset(long list_no, long offset, uint8_t *recons) const </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00206">IndexBinaryIVF.cpp:206</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a3ab6b389d8d85c5fbf23889064df7e95"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a3ab6b389d8d85c5fbf23889064df7e95">faiss::InvertedLists::get_ids</a></div><div class="ttdeci">virtual const idx_t * get_ids(size_t list_no) const =0</div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html_a11bff8bcaa366c563076a3d18f3ae30c"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#a11bff8bcaa366c563076a3d18f3ae30c">faiss::IndexBinary::reset</a></div><div class="ttdeci">virtual void reset()=0</div><div class="ttdoc">Removes all elements from the database. </div></div>
|
|
<div class="ttc" id="structfaiss_1_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#l00035">IndexBinaryIVF.h:35</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a1ae109b12efeb9b3349c1de2c6d480e5"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a1ae109b12efeb9b3349c1de2c6d480e5">faiss::IndexBinaryIVF::maintain_direct_map</a></div><div class="ttdeci">bool maintain_direct_map</div><div class="ttdoc">map for direct access to the elements. Enables reconstruct(). </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8h_source.html#l00049">IndexBinaryIVF.h:49</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a0c3d371cf3985da70b6dacac74f03491"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a0c3d371cf3985da70b6dacac74f03491">faiss::IndexBinaryIVF::cp</a></div><div class="ttdeci">ClusteringParameters cp</div><div class="ttdoc">to override default clustering params </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8h_source.html#l00057">IndexBinaryIVF.h:57</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a4f33ec7083279f26c0966c5445ec702d"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a4f33ec7083279f26c0966c5445ec702d">faiss::IndexBinaryIVF::search_preassigned</a></div><div class="ttdeci">void search_preassigned(idx_t n, const uint8_t *x, idx_t k, const idx_t *assign, const int32_t *centroid_dis, int32_t *distances, idx_t *labels, bool store_pairs, const IVFSearchParameters *params=nullptr) const </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00637">IndexBinaryIVF.cpp:637</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a9eb4370bcc95994822c3a81c290fa919"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a9eb4370bcc95994822c3a81c290fa919">faiss::IndexBinaryIVF::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="IndexBinaryIVF_8h_source.html#l00053">IndexBinaryIVF.h:53</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IDSelector_html"><div class="ttname"><a href="structfaiss_1_1IDSelector.html">faiss::IDSelector</a></div><div class="ttdef"><b>Definition:</b> <a href="AuxIndexStructures_8h_source.html#l00054">AuxIndexStructures.h:54</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexFlatL2_html"><div class="ttname"><a href="structfaiss_1_1IndexFlatL2.html">faiss::IndexFlatL2</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexFlat_8h_source.html#l00077">IndexFlat.h:77</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_1IndexBinary_html_a1656c00d77d55999becd71e3d8ea6dd7"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#a1656c00d77d55999becd71e3d8ea6dd7">faiss::IndexBinary::verbose</a></div><div class="ttdeci">bool verbose</div><div class="ttdoc">verbosity level </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinary_8h_source.html#l00044">IndexBinary.h:44</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Clustering_html_a87581785d9516c683bbc7c9392bfa993"><div class="ttname"><a href="structfaiss_1_1Clustering.html#a87581785d9516c683bbc7c9392bfa993">faiss::Clustering::k</a></div><div class="ttdeci">size_t k</div><div class="ttdoc">nb of centroids </div><div class="ttdef"><b>Definition:</b> <a href="Clustering_8h_source.html#l00059">Clustering.h:59</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html_a132119ae93e240b54621c5c669853c7f"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#a132119ae93e240b54621c5c669853c7f">faiss::IndexBinary::is_trained</a></div><div class="ttdeci">bool is_trained</div><div class="ttdoc">set if the Index does not require training, or if training is done already </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinary_8h_source.html#l00047">IndexBinary.h:47</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#l00052">IndexBinaryIVF.h:52</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#l00042">IndexBinary.h:42</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IVFSearchParameters_html"><div class="ttname"><a href="structfaiss_1_1IVFSearchParameters.html">faiss::IVFSearchParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00060">IndexIVF.h:60</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#l00031">InvertedLists.h:31</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a2c7bc3be67d829d49ac1ab2afc4f6b0c"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a2c7bc3be67d829d49ac1ab2afc4f6b0c">faiss::IndexBinaryIVF::own_fields</a></div><div class="ttdeci">bool own_fields</div><div class="ttdoc">whether object owns the quantizer </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8h_source.html#l00055">IndexBinaryIVF.h:55</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a5296e62b0524f13ff66c61fb7db499a2"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a5296e62b0524f13ff66c61fb7db499a2">faiss::IndexBinaryIVF::merge_from</a></div><div class="ttdeci">virtual void merge_from(IndexBinaryIVF &other, idx_t add_id)</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00292">IndexBinaryIVF.cpp:292</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html_a01749bbdbd3b7ec6bb9390257ab16c5c"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#a01749bbdbd3b7ec6bb9390257ab16c5c">faiss::IndexBinary::idx_t</a></div><div class="ttdeci">Index::idx_t idx_t</div><div class="ttdoc">all indices are this type </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinary_8h_source.html#l00037">IndexBinary.h:37</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a280d0a3958664c3eb4164fcb62496b00"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a280d0a3958664c3eb4164fcb62496b00">faiss::IndexBinaryIVF::make_direct_map</a></div><div class="ttdeci">void make_direct_map(bool new_maintain_direct_map=true)</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00104">IndexBinaryIVF.cpp:104</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html_a0e485a7189eec2675032486d3b12cf88"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#a0e485a7189eec2675032486d3b12cf88">faiss::IndexBinary::d</a></div><div class="ttdeci">int d</div><div class="ttdoc">vector dimension </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_1IndexBinaryIVF_html_ae4b4048070a6fc5aa3226a2edf42db5e"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#ae4b4048070a6fc5aa3226a2edf42db5e">faiss::IndexBinaryIVF::clustering_index</a></div><div class="ttdeci">Index * clustering_index</div><div class="ttdoc">to override index used during clustering </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8h_source.html#l00058">IndexBinaryIVF.h:58</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_ac2a0686121ef5bdd6eb70f7eb3cf9b3a"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#ac2a0686121ef5bdd6eb70f7eb3cf9b3a">faiss::InvertedLists::merge_from</a></div><div class="ttdeci">void merge_from(InvertedLists *oivf, size_t add_id)</div><div class="ttdoc">move all entries from oivf (empty on output) </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00077">InvertedLists.cpp:77</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a21b52cdb0601cd225bd7924932310876"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a21b52cdb0601cd225bd7924932310876">faiss::InvertedLists::get_single_id</a></div><div class="ttdeci">virtual idx_t get_single_id(size_t list_no, size_t offset) const </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00035">InvertedLists.cpp:35</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_1Index_html_ad3f0d3071f987baabbdd3da4500c87ea"><div class="ttname"><a href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">faiss::Index::idx_t</a></div><div class="ttdeci">long idx_t</div><div class="ttdoc">all indices are this type </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00062">Index.h:62</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_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#l00035">InvertedLists.h:35</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_afc2760bed7c210f2fad9b03109f561ee"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#afc2760bed7c210f2fad9b03109f561ee">faiss::InvertedLists::get_single_code</a></div><div class="ttdeci">virtual const uint8_t * get_single_code(size_t list_no, size_t offset) const </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00052">InvertedLists.cpp:52</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a4b4b1ba42e6af7c30ccbaf0fc0f38034"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a4b4b1ba42e6af7c30ccbaf0fc0f38034">faiss::IndexBinaryIVF::train</a></div><div class="ttdeci">void train(idx_t n, const uint8_t *x) override</div><div class="ttdoc">Trains the quantizer. </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00253">IndexBinaryIVF.cpp:253</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Clustering_html"><div class="ttname"><a href="structfaiss_1_1Clustering.html">faiss::Clustering</a></div><div class="ttdef"><b>Definition:</b> <a href="Clustering_8h_source.html#l00056">Clustering.h:56</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_abcab702ebe1814ff432401bfd39df492"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#abcab702ebe1814ff432401bfd39df492">faiss::IndexBinaryIVF::use_heap</a></div><div class="ttdeci">bool use_heap</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8h_source.html#l00046">IndexBinaryIVF.h:46</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#l00028">IndexBinary.cpp:28</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_acd3e36cc06fc49e02773e403a84dba95"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#acd3e36cc06fc49e02773e403a84dba95">faiss::InvertedLists::add_entry</a></div><div class="ttdeci">virtual size_t add_entry(size_t list_no, idx_t theid, const uint8_t *code)</div><div class="ttdoc">add one entry to an inverted list </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00059">InvertedLists.cpp:59</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a9dfe26312102f0010940fd2fbdf87d85"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a9dfe26312102f0010940fd2fbdf87d85">faiss::IndexBinaryIVF::reset</a></div><div class="ttdeci">void reset() override</div><div class="ttdoc">Removes all elements from the database. </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00211">IndexBinaryIVF.cpp:211</a></div></div>
|
|
<div class="ttc" id="namespacefaiss_html_af2a71f7d5402ae02ce169a4cc83020eb"><div class="ttname"><a href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">faiss::getmillisecs</a></div><div class="ttdeci">double getmillisecs()</div><div class="ttdoc">ms elapsed since some arbitrary epoch </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00069">utils.cpp:69</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Clustering_html_a64c5ec0b4a7967d8be2872974b455ff1"><div class="ttname"><a href="structfaiss_1_1Clustering.html#a64c5ec0b4a7967d8be2872974b455ff1">faiss::Clustering::centroids</a></div><div class="ttdeci">std::vector< float > centroids</div><div class="ttdoc">centroids (k * d) </div><div class="ttdef"><b>Definition:</b> <a href="Clustering_8h_source.html#l00062">Clustering.h:62</a></div></div>
|
|
<div class="ttc" id="namespacefaiss_html_ab491c9e2f77a750c9f0324bfe00e3e57"><div class="ttname"><a href="namespacefaiss.html#ab491c9e2f77a750c9f0324bfe00e3e57">faiss::real_to_binary</a></div><div class="ttdeci">void real_to_binary(size_t d, const float *x_in, uint8_t *x_out)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01570">utils.cpp:1570</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a8f5fc7b1cc59623154f7922459d8c7bb"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a8f5fc7b1cc59623154f7922459d8c7bb">faiss::IndexBinaryIVF::add_with_ids</a></div><div class="ttdeci">void add_with_ids(idx_t n, const uint8_t *x, const long *xids) override</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00060">IndexBinaryIVF.cpp:60</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_aaa0eb1eca49892304ceaa11bd3a5ffa1"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#aaa0eb1eca49892304ceaa11bd3a5ffa1">faiss::IndexBinaryIVF::add</a></div><div class="ttdeci">void add(idx_t n, const uint8_t *x) override</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00056">IndexBinaryIVF.cpp:56</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_afaf8b7aa3e846aa4553f6aae67827ec8"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">faiss::InvertedLists::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="InvertedLists_8h_source.html#l00034">InvertedLists.h:34</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a06d0e73e7ece9689000f936e7f1e2960"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a06d0e73e7ece9689000f936e7f1e2960">faiss::IndexBinaryIVF::remove_ids</a></div><div class="ttdeci">long remove_ids(const IDSelector &sel) override</div><div class="ttdoc">Dataset manipulation functions. </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00217">IndexBinaryIVF.cpp:217</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html_a41b6759d127475d5fcd2b3982a8f355e"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#a41b6759d127475d5fcd2b3982a8f355e">faiss::IndexBinary::ntotal</a></div><div class="ttdeci">idx_t ntotal</div><div class="ttdoc">total nb of indexed vectors </div><div class="ttdef"><b>Definition:</b> <a href="IndexBinary_8h_source.html#l00043">IndexBinary.h:43</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html">faiss::IndexBinary</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexBinary_8h_source.html#l00036">IndexBinary.h:36</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinary_html_af04b1093cdebfea189e0e04da68794d7"><div class="ttname"><a href="structfaiss_1_1IndexBinary.html#af04b1093cdebfea189e0e04da68794d7">faiss::IndexBinary::add</a></div><div class="ttdeci">virtual void add(idx_t n, const uint8_t *x)=0</div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_aeaf24ee802fe8f43879c735c363b6fd5"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#aeaf24ee802fe8f43879c735c363b6fd5">faiss::IndexBinaryIVF::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 override</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00127">IndexBinaryIVF.cpp:127</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Clustering_html_a839f210abb11c7a1c7162e336e0ff9cf"><div class="ttname"><a href="structfaiss_1_1Clustering.html#a839f210abb11c7a1c7162e336e0ff9cf">faiss::Clustering::train</a></div><div class="ttdeci">virtual void train(idx_t n, const float *x, faiss::Index &index)</div><div class="ttdoc">Index is used during the assignment stage. </div><div class="ttdef"><b>Definition:</b> <a href="Clustering_8cpp_source.html#l00077">Clustering.cpp:77</a></div></div>
|
|
<div class="ttc" id="namespacefaiss_html_ac8260e10cfeed08a4344b85845773e16"><div class="ttname"><a href="namespacefaiss.html#ac8260e10cfeed08a4344b85845773e16">faiss::binary_to_real</a></div><div class="ttdeci">void binary_to_real(size_t d, const uint8_t *x_in, float *x_out)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01564">utils.cpp:1564</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_ac537aa14d2731c0ff907169211389b76"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#ac537aa14d2731c0ff907169211389b76">faiss::InvertedLists::prefetch_lists</a></div><div class="ttdeci">virtual void prefetch_lists(const idx_t *list_nos, int nlist) const </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00049">InvertedLists.cpp:49</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a75260a5d45fb24a9a3c3462786f1de4d"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a75260a5d45fb24a9a3c3462786f1de4d">faiss::IndexBinaryIVF::search_and_reconstruct</a></div><div class="ttdeci">void search_and_reconstruct(idx_t n, const uint8_t *x, idx_t k, int32_t *distances, idx_t *labels, uint8_t *recons) const override</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00171">IndexBinaryIVF.cpp:171</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_a4a8cd9437b9adc21696aefe1fa440a22"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#a4a8cd9437b9adc21696aefe1fa440a22">faiss::IndexBinaryIVF::reconstruct_n</a></div><div class="ttdeci">void reconstruct_n(idx_t i0, idx_t ni, uint8_t *recons) const override</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00152">IndexBinaryIVF.cpp:152</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1IndexBinaryIVF_html_ad233d3fcf4e001849301c0fbeb675f81"><div class="ttname"><a href="structfaiss_1_1IndexBinaryIVF.html#ad233d3fcf4e001849301c0fbeb675f81">faiss::IndexBinaryIVF::reconstruct</a></div><div class="ttdeci">void reconstruct(idx_t key, uint8_t *recons) const override</div><div class="ttdef"><b>Definition:</b> <a href="IndexBinaryIVF_8cpp_source.html#l00144">IndexBinaryIVF.cpp:144</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#l00044">Index.h:44</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#l00037">IndexBinaryIVF.h:37</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>
|