<!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/InvertedLists.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/InvertedLists.cpp</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/**</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) Facebook, Inc. and its affiliates.</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * This source code is licensed under the MIT license found in the</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * LICENSE file in the root directory of this source tree.</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// -*- c++ -*-</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include "InvertedLists.h"</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include <cstdio></span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "utils.h"</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include "FaissAssert.h"</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="keyword">namespace </span>faiss {</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="keyword">using</span> ScopedIds = InvertedLists::ScopedIds;</div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="keyword">using</span> ScopedCodes = InvertedLists::ScopedCodes;</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">/*****************************************</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> * InvertedLists implementation</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> ******************************************/</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> InvertedLists::InvertedLists (<span class="keywordtype">size_t</span> nlist, <span class="keywordtype">size_t</span> code_size):</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  nlist (nlist), code_size (code_size)</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> {</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> }</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> InvertedLists::~InvertedLists ()</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> {}</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div>
<div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#a21b52cdb0601cd225bd7924932310876"> 35</a></span> InvertedLists::idx_t <a class="code" href="structfaiss_1_1InvertedLists.html#a21b52cdb0601cd225bd7924932310876">InvertedLists::get_single_id</a> (</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  assert (offset < <a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no));</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">return</span> <a class="code" href="structfaiss_1_1InvertedLists.html#a3ab6b389d8d85c5fbf23889064df7e95">get_ids</a>(list_no)[offset];</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> }</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div>
<div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#ad6a2111630ecd67ee5119d5198abcfb1"> 43</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1InvertedLists.html#ad6a2111630ecd67ee5119d5198abcfb1">InvertedLists::release_codes</a> (<span class="keywordtype">size_t</span>, <span class="keyword">const</span> uint8_t *)<span class="keyword"> const</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword"></span>{}</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#ae1618d2b5dca2704d3af8ced58548ac9"> 46</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1InvertedLists.html#ae1618d2b5dca2704d3af8ced58548ac9">InvertedLists::release_ids</a> (<span class="keywordtype">size_t</span>, <span class="keyword">const</span> idx_t *)<span class="keyword"> const</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword"></span>{}</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div>
<div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#ac537aa14d2731c0ff907169211389b76"> 49</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1InvertedLists.html#ac537aa14d2731c0ff907169211389b76">InvertedLists::prefetch_lists</a> (<span class="keyword">const</span> idx_t *, <span class="keywordtype">int</span>)<span class="keyword"> const</span></div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="keyword"></span>{}</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div>
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#afc2760bed7c210f2fad9b03109f561ee"> 52</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1InvertedLists.html#afc2760bed7c210f2fad9b03109f561ee">InvertedLists::get_single_code</a> (</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  assert (offset < <a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no));</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span> <a class="code" href="structfaiss_1_1InvertedLists.html#a60b12f9efe940b617a8380adceef4032">get_codes</a>(list_no) + offset * <a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> }</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div>
<div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#acd3e36cc06fc49e02773e403a84dba95"> 59</a></span> <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1InvertedLists.html#acd3e36cc06fc49e02773e403a84dba95">InvertedLists::add_entry</a> (<span class="keywordtype">size_t</span> list_no, idx_t theid,</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> uint8_t *code)</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> {</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">return</span> add_entries (list_no, 1, &theid, code);</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> }</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="keywordtype">void</span> InvertedLists::update_entry (<span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset,</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  idx_t <span class="keywordtype">id</span>, <span class="keyword">const</span> uint8_t *code)</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> {</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  update_entries (list_no, offset, 1, &<span class="keywordtype">id</span>, code);</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> }</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="keywordtype">void</span> InvertedLists::reset () {</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; i++) {</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  resize (i, 0);</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> }</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#ac2a0686121ef5bdd6eb70f7eb3cf9b3a"> 77</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1InvertedLists.html#ac2a0686121ef5bdd6eb70f7eb3cf9b3a">InvertedLists::merge_from</a> (<a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *oivf, <span class="keywordtype">size_t</span> add_id) {</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> </div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (idx_t i = 0; i < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; i++) {</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> = oivf-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (i);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">ScopedIds</a> ids (oivf, i);</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">if</span> (add_id == 0) {</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  add_entries (i, list_size, ids.get (),</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">ScopedCodes</a> (oivf, i).get());</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  std::vector <idx_t> new_ids (list_size);</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < <a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>; j++) {</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  new_ids [j] = ids[j] + add_id;</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  add_entries (i, list_size, new_ids.data(),</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">ScopedCodes</a> (oivf, i).get());</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  }</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  oivf->resize (i, 0);</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> }</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div>
<div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#aacf34f6cf392771fe2e68210cd4e009b"> 99</a></span> <span class="keywordtype">double</span> <a class="code" href="structfaiss_1_1InvertedLists.html#aacf34f6cf392771fe2e68210cd4e009b">InvertedLists::imbalance_factor</a> ()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  std::vector<int> hist(<a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>);</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; i++) {</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  hist[i] = <a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(i);</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">return</span> <a class="code" href="namespacefaiss.html#af762526714e6138009c72aee98657538">faiss::imbalance_factor</a>(nlist, hist.data());</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</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"><a class="line" href="structfaiss_1_1InvertedLists.html#a156de8be4b21a0dfa9a48a3918a0b5c3"> 109</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1InvertedLists.html#a156de8be4b21a0dfa9a48a3918a0b5c3">InvertedLists::print_stats</a> ()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  std::vector<int> sizes(40);</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; i++) {</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < sizes.size(); j++) {</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">if</span> ((<a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(i) >> j) == 0) {</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  sizes[j]++;</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  }</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < sizes.size(); i++) {</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (sizes[i]) {</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  printf(<span class="stringliteral">"list size in < %d: %d instances\n"</span>, 1 << i, sizes[i]);</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> }</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div>
<div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#a722eef5a0e5bf5dcf78228a903e16af9"> 126</a></span> <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1InvertedLists.html#a722eef5a0e5bf5dcf78228a903e16af9">InvertedLists::compute_ntotal</a> ()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordtype">size_t</span> tot = 0;</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; i++) {</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  tot += <a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(i);</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">return</span> tot;</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> }</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment">/*****************************************</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"> * ArrayInvertedLists implementation</span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> ******************************************/</span></div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> ArrayInvertedLists::ArrayInvertedLists (<span class="keywordtype">size_t</span> nlist, <span class="keywordtype">size_t</span> code_size):</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> (nlist, code_size)</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> {</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  ids.resize (nlist);</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  codes.resize (nlist);</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> }</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="keywordtype">size_t</span> ArrayInvertedLists::add_entries (</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> n_entry,</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">const</span> idx_t* ids_in, <span class="keyword">const</span> uint8_t *code)</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> {</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">if</span> (n_entry == 0) <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">size_t</span> o = <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a> [list_no].size();</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a> [list_no].resize (o + n_entry);</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  memcpy (&<a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a>[list_no][o], ids_in, <span class="keyword">sizeof</span> (ids_in[0]) * n_entry);</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  codes [list_no].resize ((o + n_entry) * code_size);</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  memcpy (&codes[list_no][o * code_size], code, code_size * n_entry);</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">return</span> o;</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> }</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div>
<div class="line"><a name="l00159"></a><span class="lineno"><a class="line" href="structfaiss_1_1ArrayInvertedLists.html#af43d3f5c5bd897205853b289603fb42b"> 159</a></span> <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#af43d3f5c5bd897205853b289603fb42b">ArrayInvertedLists::list_size</a>(<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span> <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a>[list_no].size();</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"><a class="line" href="structfaiss_1_1ArrayInvertedLists.html#abf4ab66d09d8a1b707dddc77d0c2e8fc"> 165</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#abf4ab66d09d8a1b707dddc77d0c2e8fc">ArrayInvertedLists::get_codes</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">return</span> codes[list_no].data();</div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> }</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div>
<div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="structfaiss_1_1ArrayInvertedLists.html#abd59f7cf340d9c17eb6b402579e4010b"> 172</a></span> <span class="keyword">const</span> InvertedLists::idx_t * <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#abd59f7cf340d9c17eb6b402579e4010b">ArrayInvertedLists::get_ids</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">return</span> <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a>[list_no].data();</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> </div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="keywordtype">void</span> ArrayInvertedLists::resize (<span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> new_size)</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> {</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a>[list_no].resize (new_size);</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  codes[list_no].resize (new_size * code_size);</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> }</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="keywordtype">void</span> ArrayInvertedLists::update_entries (</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset, <span class="keywordtype">size_t</span> n_entry,</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">const</span> idx_t *ids_in, <span class="keyword">const</span> uint8_t *codes_in)</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span> {</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  assert (n_entry + offset <= <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a>[list_no].size());</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  memcpy (&<a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a>[list_no][offset], ids_in, <span class="keyword">sizeof</span>(ids_in[0]) * n_entry);</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  memcpy (&codes[list_no][offset * code_size], codes_in, code_size * n_entry);</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> }</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> </div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> ArrayInvertedLists::~ArrayInvertedLists ()</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> </div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment">/*****************************************************************</span></div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * Meta-inverted list implementations</span></div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> *****************************************************************/</span></div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="keywordtype">size_t</span> ReadOnlyInvertedLists::add_entries (</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordtype">size_t</span> , <span class="keywordtype">size_t</span> ,</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> idx_t* , <span class="keyword">const</span> uint8_t *)</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> {</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  FAISS_THROW_MSG (<span class="stringliteral">"not implemented"</span>);</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> }</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="keywordtype">void</span> ReadOnlyInvertedLists::update_entries (<span class="keywordtype">size_t</span>, <span class="keywordtype">size_t</span> , <span class="keywordtype">size_t</span> ,</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">const</span> idx_t *, <span class="keyword">const</span> uint8_t *)</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> {</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  FAISS_THROW_MSG (<span class="stringliteral">"not implemented"</span>);</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> }</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> <span class="keywordtype">void</span> ReadOnlyInvertedLists::resize (<span class="keywordtype">size_t</span> , <span class="keywordtype">size_t</span> )</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> {</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  FAISS_THROW_MSG (<span class="stringliteral">"not implemented"</span>);</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> }</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment">/*****************************************</span></div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"> * HStackInvertedLists implementation</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"> ******************************************/</span></div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div>
<div class="line"><a name="l00227"></a><span class="lineno"><a class="line" href="structfaiss_1_1HStackInvertedLists.html#a882d2fde7902129f3ee2473efc4442da"> 227</a></span> <a class="code" href="structfaiss_1_1HStackInvertedLists.html#a882d2fde7902129f3ee2473efc4442da">HStackInvertedLists::HStackInvertedLists</a> (</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordtype">int</span> nil, <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> **ils_in):</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="structfaiss_1_1ReadOnlyInvertedLists.html">ReadOnlyInvertedLists</a> (nil > 0 ? ils_in[0]->nlist : 0,</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  nil > 0 ? ils_in[0]->code_size : 0)</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> {</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  FAISS_THROW_IF_NOT (nil > 0);</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nil; i++) {</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  ils.push_back (ils_in[i]);</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  FAISS_THROW_IF_NOT (ils_in[i]->code_size == code_size &&</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  ils_in[i]->nlist == nlist);</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> }</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div>
<div class="line"><a name="l00240"></a><span class="lineno"><a class="line" href="structfaiss_1_1HStackInvertedLists.html#af8330d7cdc185533a1286e3413810c5e"> 240</a></span> <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1HStackInvertedLists.html#af8330d7cdc185533a1286e3413810c5e">HStackInvertedLists::list_size</a>(<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordtype">size_t</span> sz = 0;</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il = ils[i];</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  sz += il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">return</span> sz;</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> </div>
<div class="line"><a name="l00250"></a><span class="lineno"><a class="line" href="structfaiss_1_1HStackInvertedLists.html#a3a69cb5d1c05fa6b583672c459ecc4a6"> 250</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1HStackInvertedLists.html#a3a69cb5d1c05fa6b583672c459ecc4a6">HStackInvertedLists::get_codes</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  uint8_t *codes = <span class="keyword">new</span> uint8_t [code_size * <a class="code" href="structfaiss_1_1HStackInvertedLists.html#af8330d7cdc185533a1286e3413810c5e">list_size</a>(list_no)], *c = codes;</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il = ils[i];</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordtype">size_t</span> sz = il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(list_no) * <a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>;</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">if</span> (sz > 0) {</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  memcpy (c, <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">ScopedCodes</a> (il, list_no).<span class="keyword">get</span>(), sz);</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  c += sz;</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">return</span> codes;</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> }</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div>
<div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="structfaiss_1_1HStackInvertedLists.html#aeef6bd41622796f5d142e60fe78a5da8"> 265</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1HStackInvertedLists.html#aeef6bd41622796f5d142e60fe78a5da8">HStackInvertedLists::get_single_code</a> (</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il = ils[i];</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordtype">size_t</span> sz = il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">if</span> (offset < sz) {</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// here we have to copy the code, otherwise it will crash at dealloc</span></div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  uint8_t * code = <span class="keyword">new</span> uint8_t [<a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>];</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  memcpy (code, <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">ScopedCodes</a> (il, list_no, offset).<span class="keyword">get</span>(), code_size);</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">return</span> code;</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  offset -= sz;</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>  FAISS_THROW_FMT (<span class="stringliteral">"offset %ld unknown"</span>, offset);</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> }</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div>
<div class="line"><a name="l00283"></a><span class="lineno"><a class="line" href="structfaiss_1_1HStackInvertedLists.html#ad431aa76dc678d71747dcbc9379d123a"> 283</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HStackInvertedLists.html#ad431aa76dc678d71747dcbc9379d123a">HStackInvertedLists::release_codes</a> (<span class="keywordtype">size_t</span>, <span class="keyword">const</span> uint8_t *codes)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keyword">delete</span> [] codes;</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span> }</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span> </div>
<div class="line"><a name="l00287"></a><span class="lineno"><a class="line" href="structfaiss_1_1HStackInvertedLists.html#af812098083c022166d29a20846de173e"> 287</a></span> <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> * <a class="code" href="structfaiss_1_1HStackInvertedLists.html#af812098083c022166d29a20846de173e">HStackInvertedLists::get_ids</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  idx_t *ids = <span class="keyword">new</span> idx_t [<a class="code" href="structfaiss_1_1HStackInvertedLists.html#af8330d7cdc185533a1286e3413810c5e">list_size</a>(list_no)], *c = ids;</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il = ils[i];</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordtype">size_t</span> sz = il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(list_no);</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (sz > 0) {</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  memcpy (c, <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">ScopedIds</a> (il, list_no).<span class="keyword">get</span>(), sz * <span class="keyword">sizeof</span>(idx_t));</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  c += sz;</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  }</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">return</span> ids;</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span> }</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> </div>
<div class="line"><a name="l00302"></a><span class="lineno"><a class="line" href="structfaiss_1_1HStackInvertedLists.html#aff00b896467e63cf821d35668804b039"> 302</a></span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> <a class="code" href="structfaiss_1_1HStackInvertedLists.html#aff00b896467e63cf821d35668804b039">HStackInvertedLists::get_single_id</a> (</div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span> </div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il = ils[i];</div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordtype">size_t</span> sz = il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">if</span> (offset < sz) {</div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">return</span> il-><a class="code" href="structfaiss_1_1InvertedLists.html#a21b52cdb0601cd225bd7924932310876">get_single_id</a> (list_no, offset);</div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  }</div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  offset -= sz;</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  FAISS_THROW_FMT (<span class="stringliteral">"offset %ld unknown"</span>, offset);</div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span> }</div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span> </div>
<div class="line"><a name="l00318"></a><span class="lineno"><a class="line" href="structfaiss_1_1HStackInvertedLists.html#aa987a3ecea9f4df3340fd8c21f5d7000"> 318</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HStackInvertedLists.html#aa987a3ecea9f4df3340fd8c21f5d7000">HStackInvertedLists::release_ids</a> (<span class="keywordtype">size_t</span>, <span class="keyword">const</span> idx_t *ids)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">delete</span> [] ids;</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> }</div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div>
<div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="structfaiss_1_1HStackInvertedLists.html#a249f680477fac00cdfcf319c3bbe8c05"> 322</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HStackInvertedLists.html#a249f680477fac00cdfcf319c3bbe8c05">HStackInvertedLists::prefetch_lists</a> (<span class="keyword">const</span> idx_t *list_nos, <span class="keywordtype">int</span> nlist)<span class="keyword"> const</span></div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il = ils[i];</div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  il-><a class="code" href="structfaiss_1_1InvertedLists.html#ac537aa14d2731c0ff907169211389b76">prefetch_lists</a> (list_nos, nlist);</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> }</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment">/*****************************************</span></div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="comment"> * SliceInvertedLists implementation</span></div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="comment"> ******************************************/</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> </div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">using</span> idx_t = InvertedLists::idx_t;</div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  idx_t translate_list_no (<span class="keyword">const</span> <a class="code" href="structfaiss_1_1SliceInvertedLists.html">SliceInvertedLists</a> *sil,</div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  idx_t list_no) {</div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  FAISS_THROW_IF_NOT (list_no >= 0 && list_no < sil->nlist);</div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">return</span> list_no + sil->i0;</div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> };</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span> </div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span> SliceInvertedLists::SliceInvertedLists (</div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">const</span> InvertedLists *il, idx_t i0, idx_t i1):</div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  ReadOnlyInvertedLists (i1 - i0, il->code_size),</div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  il (il), i0(i0), i1(i1)</div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span> {</div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span> }</div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div>
<div class="line"><a name="l00357"></a><span class="lineno"><a class="line" href="structfaiss_1_1SliceInvertedLists.html#ab58bf7449476fc4638bc0a004f7ecb07"> 357</a></span> <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1SliceInvertedLists.html#ab58bf7449476fc4638bc0a004f7ecb07">SliceInvertedLists::list_size</a>(<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">return</span> il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (translate_list_no (<span class="keyword">this</span>, list_no));</div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span> }</div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span> </div>
<div class="line"><a name="l00362"></a><span class="lineno"><a class="line" href="structfaiss_1_1SliceInvertedLists.html#a95e1c091bea8695c6df29ed87b3cf0d9"> 362</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1SliceInvertedLists.html#a95e1c091bea8695c6df29ed87b3cf0d9">SliceInvertedLists::get_codes</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">return</span> il-><a class="code" href="structfaiss_1_1InvertedLists.html#a60b12f9efe940b617a8380adceef4032">get_codes</a> (translate_list_no (<span class="keyword">this</span>, list_no));</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> </div>
<div class="line"><a name="l00367"></a><span class="lineno"><a class="line" href="structfaiss_1_1SliceInvertedLists.html#abc95a98970bb7b4b044c5a61520c20d3"> 367</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1SliceInvertedLists.html#abc95a98970bb7b4b044c5a61520c20d3">SliceInvertedLists::get_single_code</a> (</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">return</span> il-><a class="code" href="structfaiss_1_1InvertedLists.html#afc2760bed7c210f2fad9b03109f561ee">get_single_code</a> (translate_list_no (<span class="keyword">this</span>, list_no), offset);</div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> }</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> </div>
<div class="line"><a name="l00374"></a><span class="lineno"><a class="line" href="structfaiss_1_1SliceInvertedLists.html#a362456fac3002d1a5625a13dbfc0752b"> 374</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1SliceInvertedLists.html#a362456fac3002d1a5625a13dbfc0752b">SliceInvertedLists::release_codes</a> (</div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordtype">size_t</span> list_no, <span class="keyword">const</span> uint8_t *codes)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">return</span> il-><a class="code" href="structfaiss_1_1InvertedLists.html#ad6a2111630ecd67ee5119d5198abcfb1">release_codes</a> (translate_list_no (<span class="keyword">this</span>, list_no), codes);</div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> }</div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> </div>
<div class="line"><a name="l00379"></a><span class="lineno"><a class="line" href="structfaiss_1_1SliceInvertedLists.html#ac5eb6df92e3bc9d49d7e88f0ff8d3a88"> 379</a></span> <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> * <a class="code" href="structfaiss_1_1SliceInvertedLists.html#ac5eb6df92e3bc9d49d7e88f0ff8d3a88">SliceInvertedLists::get_ids</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">return</span> il-><a class="code" href="structfaiss_1_1InvertedLists.html#a3ab6b389d8d85c5fbf23889064df7e95">get_ids</a> (translate_list_no (<span class="keyword">this</span>, list_no));</div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span> }</div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div>
<div class="line"><a name="l00384"></a><span class="lineno"><a class="line" href="structfaiss_1_1SliceInvertedLists.html#a714d282706a7301772fcd145854a976e"> 384</a></span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> <a class="code" href="structfaiss_1_1SliceInvertedLists.html#a714d282706a7301772fcd145854a976e">SliceInvertedLists::get_single_id</a> (</div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">return</span> il-><a class="code" href="structfaiss_1_1InvertedLists.html#a21b52cdb0601cd225bd7924932310876">get_single_id</a> (translate_list_no (<span class="keyword">this</span>, list_no), offset);</div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span> }</div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span> </div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span> </div>
<div class="line"><a name="l00391"></a><span class="lineno"><a class="line" href="structfaiss_1_1SliceInvertedLists.html#ad3001048c22bcff5a1a8fb3c13d6a9ca"> 391</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1SliceInvertedLists.html#ad3001048c22bcff5a1a8fb3c13d6a9ca">SliceInvertedLists::release_ids</a> (<span class="keywordtype">size_t</span> list_no, <span class="keyword">const</span> idx_t *ids)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">return</span> il-><a class="code" href="structfaiss_1_1InvertedLists.html#ae1618d2b5dca2704d3af8ced58548ac9">release_ids</a> (translate_list_no (<span class="keyword">this</span>, list_no), ids);</div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span> }</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div>
<div class="line"><a name="l00395"></a><span class="lineno"><a class="line" href="structfaiss_1_1SliceInvertedLists.html#a40f74e21271fa5492fb9b78bb04a514f"> 395</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1SliceInvertedLists.html#a40f74e21271fa5492fb9b78bb04a514f">SliceInvertedLists::prefetch_lists</a> (<span class="keyword">const</span> idx_t *list_nos, <span class="keywordtype">int</span> nlist)<span class="keyword"> const</span></div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  std::vector<idx_t> translated_list_nos;</div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; j++) {</div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  idx_t list_no = list_nos[j];</div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">if</span> (list_no < 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  translated_list_nos.push_back (translate_list_no (<span class="keyword">this</span>, list_no));</div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  il-><a class="code" href="structfaiss_1_1InvertedLists.html#ac537aa14d2731c0ff907169211389b76">prefetch_lists</a> (translated_list_nos.data(),</div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  translated_list_nos.size());</div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> }</div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span> </div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span> </div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment">/*****************************************</span></div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="comment"> * VStackInvertedLists implementation</span></div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment"> ******************************************/</span></div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> </div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">using</span> idx_t = InvertedLists::idx_t;</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">// find the invlist this number belongs to</span></div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordtype">int</span> translate_list_no (<span class="keyword">const</span> <a class="code" href="structfaiss_1_1VStackInvertedLists.html">VStackInvertedLists</a> *vil,</div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  idx_t list_no) {</div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  FAISS_THROW_IF_NOT (list_no >= 0 && list_no < vil->nlist);</div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordtype">int</span> i0 = 0, i1 = vil->ils.size();</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keyword">const</span> idx_t *cumsz = vil->cumsz.data();</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">while</span> (i0 + 1 < i1) {</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordtype">int</span> imed = (i0 + i1) / 2;</div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">if</span> (list_no >= cumsz[imed]) {</div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  i0 = imed;</div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  i1 = imed;</div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  }</div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  assert(list_no >= cumsz[i0] && list_no < cumsz[i0 + 1]);</div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">return</span> i0;</div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> </div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  idx_t sum_il_sizes (<span class="keywordtype">int</span> nil, <span class="keyword">const</span> InvertedLists **ils_in) {</div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  idx_t tot = 0;</div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nil; i++) {</div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  tot += ils_in[i]->nlist;</div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  }</div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">return</span> tot;</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> };</div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span> </div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> </div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span> </div>
<div class="line"><a name="l00446"></a><span class="lineno"><a class="line" href="structfaiss_1_1VStackInvertedLists.html#a8f6ba4b3d64b74409742edad6c6c0f37"> 446</a></span> <a class="code" href="structfaiss_1_1VStackInvertedLists.html#a8f6ba4b3d64b74409742edad6c6c0f37">VStackInvertedLists::VStackInvertedLists</a> (</div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordtype">int</span> nil, <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> **ils_in):</div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <a class="code" href="structfaiss_1_1ReadOnlyInvertedLists.html">ReadOnlyInvertedLists</a> (sum_il_sizes(nil, ils_in),</div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  nil > 0 ? ils_in[0]->code_size : 0)</div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> {</div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  FAISS_THROW_IF_NOT (nil > 0);</div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  cumsz.resize (nil + 1);</div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nil; i++) {</div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  ils.push_back (ils_in[i]);</div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  FAISS_THROW_IF_NOT (ils_in[i]->code_size == code_size);</div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  cumsz[i + 1] = cumsz[i] + ils_in[i]-><a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>;</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  }</div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> }</div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span> </div>
<div class="line"><a name="l00460"></a><span class="lineno"><a class="line" href="structfaiss_1_1VStackInvertedLists.html#a6398b7faee56b47f1f9817f3763fef01"> 460</a></span> <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1VStackInvertedLists.html#a6398b7faee56b47f1f9817f3763fef01">VStackInvertedLists::list_size</a>(<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordtype">int</span> i = translate_list_no (<span class="keyword">this</span>, list_no);</div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  list_no -= cumsz[i];</div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">return</span> ils[i]->list_size (list_no);</div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span> }</div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span> </div>
<div class="line"><a name="l00467"></a><span class="lineno"><a class="line" href="structfaiss_1_1VStackInvertedLists.html#a112f9458bd91ca5dbed2cb6d090a0034"> 467</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1VStackInvertedLists.html#a112f9458bd91ca5dbed2cb6d090a0034">VStackInvertedLists::get_codes</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordtype">int</span> i = translate_list_no (<span class="keyword">this</span>, list_no);</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  list_no -= cumsz[i];</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">return</span> ils[i]->get_codes (list_no);</div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span> }</div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span> </div>
<div class="line"><a name="l00474"></a><span class="lineno"><a class="line" href="structfaiss_1_1VStackInvertedLists.html#a3c229e59737b533464f5403c5cf5fca4"> 474</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1VStackInvertedLists.html#a3c229e59737b533464f5403c5cf5fca4">VStackInvertedLists::get_single_code</a> (</div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordtype">int</span> i = translate_list_no (<span class="keyword">this</span>, list_no);</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  list_no -= cumsz[i];</div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">return</span> ils[i]->get_single_code (list_no, offset);</div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span> }</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span> </div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span> </div>
<div class="line"><a name="l00483"></a><span class="lineno"><a class="line" href="structfaiss_1_1VStackInvertedLists.html#a331222282fb32dc55d6f5847bbd1c848"> 483</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1VStackInvertedLists.html#a331222282fb32dc55d6f5847bbd1c848">VStackInvertedLists::release_codes</a> (</div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordtype">size_t</span> list_no, <span class="keyword">const</span> uint8_t *codes)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keywordtype">int</span> i = translate_list_no (<span class="keyword">this</span>, list_no);</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  list_no -= cumsz[i];</div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordflow">return</span> ils[i]->release_codes (list_no, codes);</div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span> }</div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> </div>
<div class="line"><a name="l00490"></a><span class="lineno"><a class="line" href="structfaiss_1_1VStackInvertedLists.html#a912c3f0417c833a81da5957f4d77452a"> 490</a></span> <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> * <a class="code" href="structfaiss_1_1VStackInvertedLists.html#a912c3f0417c833a81da5957f4d77452a">VStackInvertedLists::get_ids</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordtype">int</span> i = translate_list_no (<span class="keyword">this</span>, list_no);</div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  list_no -= cumsz[i];</div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">return</span> ils[i]->get_ids (list_no);</div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> }</div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span> </div>
<div class="line"><a name="l00497"></a><span class="lineno"><a class="line" href="structfaiss_1_1VStackInvertedLists.html#ab2d660680d9b4a2667c321515b5baa77"> 497</a></span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> <a class="code" href="structfaiss_1_1VStackInvertedLists.html#ab2d660680d9b4a2667c321515b5baa77">VStackInvertedLists::get_single_id</a> (</div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordtype">int</span> i = translate_list_no (<span class="keyword">this</span>, list_no);</div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  list_no -= cumsz[i];</div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">return</span> ils[i]->get_single_id (list_no, offset);</div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span> }</div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span> </div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span> </div>
<div class="line"><a name="l00506"></a><span class="lineno"><a class="line" href="structfaiss_1_1VStackInvertedLists.html#a3048d4656332d160502cd95b22b53be5"> 506</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1VStackInvertedLists.html#a3048d4656332d160502cd95b22b53be5">VStackInvertedLists::release_ids</a> (<span class="keywordtype">size_t</span> list_no, <span class="keyword">const</span> idx_t *ids)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordtype">int</span> i = translate_list_no (<span class="keyword">this</span>, list_no);</div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  list_no -= cumsz[i];</div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">return</span> ils[i]->release_ids (list_no, ids);</div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span> }</div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span> </div>
<div class="line"><a name="l00512"></a><span class="lineno"><a class="line" href="structfaiss_1_1VStackInvertedLists.html#af37c2171d22f7f9200fa5cdedb363471"> 512</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1VStackInvertedLists.html#af37c2171d22f7f9200fa5cdedb363471">VStackInvertedLists::prefetch_lists</a> (</div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">const</span> idx_t *list_nos, <span class="keywordtype">int</span> nlist)<span class="keyword"> const</span></div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  std::vector<int> ilno (nlist, -1);</div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  std::vector<int> n_per_il (ils.size(), 0);</div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; j++) {</div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  idx_t list_no = list_nos[j];</div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">if</span> (list_no < 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordtype">int</span> i = ilno[j] = translate_list_no (<span class="keyword">this</span>, list_no);</div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  n_per_il[i]++;</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>  std::vector<int> cum_n_per_il (ils.size() + 1, 0);</div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < ils.size(); j++) {</div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  cum_n_per_il[j + 1] = cum_n_per_il[j] + n_per_il[j];</div>
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  }</div>
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  std::vector<idx_t> sorted_list_nos (cum_n_per_il.back());</div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; j++) {</div>
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  idx_t list_no = list_nos[j];</div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">if</span> (list_no < 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordtype">int</span> i = ilno[j];</div>
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  list_no -= cumsz[i];</div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  sorted_list_nos[cum_n_per_il[i]++] = list_no;</div>
<div class="line"><a name="l00534"></a><span class="lineno"> 534</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>  <span class="keywordtype">int</span> i0 = 0;</div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < ils.size(); j++) {</div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordtype">int</span> i1 = i0 + n_per_il[j];</div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordflow">if</span> (i1 > i0) {</div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  ils[j]->prefetch_lists (sorted_list_nos.data() + i0,</div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  i1 - i0);</div>
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  }</div>
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  i0 = i1;</div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  }</div>
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span> }</div>
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span> </div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span> </div>
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span> </div>
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment">/*****************************************</span></div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment"> * MaskedInvertedLists implementation</span></div>
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment"> ******************************************/</span></div>
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div>
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span> </div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span> MaskedInvertedLists::MaskedInvertedLists (<span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il0,</div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> *il1):</div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <a class="code" href="structfaiss_1_1ReadOnlyInvertedLists.html">ReadOnlyInvertedLists</a> (il0->nlist, il0->code_size),</div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  il0 (il0), il1 (il1)</div>
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span> {</div>
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  FAISS_THROW_IF_NOT (il1-><a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a> == nlist);</div>
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  FAISS_THROW_IF_NOT (il1-><a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a> == code_size);</div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span> }</div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span> </div>
<div class="line"><a name="l00563"></a><span class="lineno"><a class="line" href="structfaiss_1_1MaskedInvertedLists.html#a5c400887da892a68ce47eff56e30dffc"> 563</a></span> <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1MaskedInvertedLists.html#a5c400887da892a68ce47eff56e30dffc">MaskedInvertedLists::list_size</a>(<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordtype">size_t</span> sz = il0-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(list_no);</div>
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">return</span> sz ? sz : il1-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(list_no);</div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span> }</div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span> </div>
<div class="line"><a name="l00569"></a><span class="lineno"><a class="line" href="structfaiss_1_1MaskedInvertedLists.html#a4376b14cd4e349d51848995c102659af"> 569</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1MaskedInvertedLists.html#a4376b14cd4e349d51848995c102659af">MaskedInvertedLists::get_codes</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keywordtype">size_t</span> sz = il0-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(list_no);</div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keywordflow">return</span> (sz ? il0 : il1)->get_codes(list_no);</div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span> }</div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span> </div>
<div class="line"><a name="l00575"></a><span class="lineno"><a class="line" href="structfaiss_1_1MaskedInvertedLists.html#a924d45d2ab3809c728e7b02ec569b2ba"> 575</a></span> <span class="keyword">const</span> idx_t * <a class="code" href="structfaiss_1_1MaskedInvertedLists.html#a924d45d2ab3809c728e7b02ec569b2ba">MaskedInvertedLists::get_ids</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordtype">size_t</span> sz = il0-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">return</span> (sz ? il0 : il1)->get_ids (list_no);</div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span> }</div>
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span> </div>
<div class="line"><a name="l00581"></a><span class="lineno"><a class="line" href="structfaiss_1_1MaskedInvertedLists.html#a64e66ef4c7dc387091f533cc61d88273"> 581</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1MaskedInvertedLists.html#a64e66ef4c7dc387091f533cc61d88273">MaskedInvertedLists::release_codes</a> (</div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordtype">size_t</span> list_no, <span class="keyword">const</span> uint8_t *codes)<span class="keyword"> const</span></div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordtype">size_t</span> sz = il0-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  (sz ? il0 : il1)-><a class="code" href="structfaiss_1_1MaskedInvertedLists.html#a64e66ef4c7dc387091f533cc61d88273">release_codes</a> (list_no, codes);</div>
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span> }</div>
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span> </div>
<div class="line"><a name="l00588"></a><span class="lineno"><a class="line" href="structfaiss_1_1MaskedInvertedLists.html#a86c8d8c022c79c32b3f776f2ad4f3b1e"> 588</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1MaskedInvertedLists.html#a86c8d8c022c79c32b3f776f2ad4f3b1e">MaskedInvertedLists::release_ids</a> (<span class="keywordtype">size_t</span> list_no, <span class="keyword">const</span> idx_t *ids)<span class="keyword"> const</span></div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordtype">size_t</span> sz = il0-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  (sz ? il0 : il1)-><a class="code" href="structfaiss_1_1MaskedInvertedLists.html#a86c8d8c022c79c32b3f776f2ad4f3b1e">release_ids</a> (list_no, ids);</div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span> }</div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span> </div>
<div class="line"><a name="l00594"></a><span class="lineno"><a class="line" href="structfaiss_1_1MaskedInvertedLists.html#af0d9f7b61caef91e30124b0f7a9d44b9"> 594</a></span> idx_t <a class="code" href="structfaiss_1_1MaskedInvertedLists.html#af0d9f7b61caef91e30124b0f7a9d44b9">MaskedInvertedLists::get_single_id</a> (<span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordtype">size_t</span> sz = il0-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">return</span> (sz ? il0 : il1)->get_single_id (list_no, offset);</div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span> }</div>
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span> </div>
<div class="line"><a name="l00600"></a><span class="lineno"><a class="line" href="structfaiss_1_1MaskedInvertedLists.html#a429657c4c203d472f59147f301de0ede"> 600</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1MaskedInvertedLists.html#a429657c4c203d472f59147f301de0ede">MaskedInvertedLists::get_single_code</a> (</div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset)<span class="keyword"> const</span></div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordtype">size_t</span> sz = il0-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keywordflow">return</span> (sz ? il0 : il1)->get_single_code (list_no, offset);</div>
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span> }</div>
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span> </div>
<div class="line"><a name="l00607"></a><span class="lineno"><a class="line" href="structfaiss_1_1MaskedInvertedLists.html#a5fbd34b4052c314148c44f14b4d3c2d3"> 607</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1MaskedInvertedLists.html#a5fbd34b4052c314148c44f14b4d3c2d3">MaskedInvertedLists::prefetch_lists</a> (</div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keyword">const</span> idx_t *list_nos, <span class="keywordtype">int</span> nlist)<span class="keyword"> const</span></div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  std::vector<idx_t> list0, list1;</div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; i++) {</div>
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  idx_t list_no = list_nos[i];</div>
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordflow">if</span> (list_no < 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordtype">size_t</span> sz = il0-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a>(list_no);</div>
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  (sz ? list0 : list1).push_back (list_no);</div>
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  }</div>
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  il0-><a class="code" href="structfaiss_1_1InvertedLists.html#ac537aa14d2731c0ff907169211389b76">prefetch_lists</a> (list0.data(), list0.size());</div>
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  il1-><a class="code" href="structfaiss_1_1InvertedLists.html#ac537aa14d2731c0ff907169211389b76">prefetch_lists</a> (list1.data(), list1.size());</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> </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> } <span class="comment">// namespace faiss</span></div>
<div class="ttc" id="structfaiss_1_1ArrayInvertedLists_html_abf4ab66d09d8a1b707dddc77d0c2e8fc"><div class="ttname"><a href="structfaiss_1_1ArrayInvertedLists.html#abf4ab66d09d8a1b707dddc77d0c2e8fc">faiss::ArrayInvertedLists::get_codes</a></div><div class="ttdeci">const uint8_t * get_codes(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00165">InvertedLists.cpp:165</a></div></div>
<div class="ttc" id="structfaiss_1_1VStackInvertedLists_html_af37c2171d22f7f9200fa5cdedb363471"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html#af37c2171d22f7f9200fa5cdedb363471">faiss::VStackInvertedLists::prefetch_lists</a></div><div class="ttdeci">void prefetch_lists(const idx_t *list_nos, int nlist) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00512">InvertedLists.cpp:512</a></div></div>
<div class="ttc" id="structfaiss_1_1HStackInvertedLists_html_aff00b896467e63cf821d35668804b039"><div class="ttname"><a href="structfaiss_1_1HStackInvertedLists.html#aff00b896467e63cf821d35668804b039">faiss::HStackInvertedLists::get_single_id</a></div><div class="ttdeci">idx_t get_single_id(size_t list_no, size_t offset) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00302">InvertedLists.cpp:302</a></div></div>
<div class="ttc" id="structfaiss_1_1SliceInvertedLists_html_ad3001048c22bcff5a1a8fb3c13d6a9ca"><div class="ttname"><a href="structfaiss_1_1SliceInvertedLists.html#ad3001048c22bcff5a1a8fb3c13d6a9ca">faiss::SliceInvertedLists::release_ids</a></div><div class="ttdeci">void release_ids(size_t list_no, const idx_t *ids) const override</div><div class="ttdoc">release ids returned by get_ids </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00391">InvertedLists.cpp:391</a></div></div>
<div class="ttc" id="structfaiss_1_1MaskedInvertedLists_html_a86c8d8c022c79c32b3f776f2ad4f3b1e"><div class="ttname"><a href="structfaiss_1_1MaskedInvertedLists.html#a86c8d8c022c79c32b3f776f2ad4f3b1e">faiss::MaskedInvertedLists::release_ids</a></div><div class="ttdeci">void release_ids(size_t list_no, const idx_t *ids) const override</div><div class="ttdoc">release ids returned by get_ids </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00588">InvertedLists.cpp:588</a></div></div>
<div class="ttc" id="structfaiss_1_1ArrayInvertedLists_html_abd59f7cf340d9c17eb6b402579e4010b"><div class="ttname"><a href="structfaiss_1_1ArrayInvertedLists.html#abd59f7cf340d9c17eb6b402579e4010b">faiss::ArrayInvertedLists::get_ids</a></div><div class="ttdeci">const idx_t * get_ids(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00172">InvertedLists.cpp:172</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_1InvertedLists_html_aacf34f6cf392771fe2e68210cd4e009b"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#aacf34f6cf392771fe2e68210cd4e009b">faiss::InvertedLists::imbalance_factor</a></div><div class="ttdeci">double imbalance_factor() const </div><div class="ttdoc">1= perfectly balanced, &gt;1: imbalanced </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00099">InvertedLists.cpp:99</a></div></div>
<div class="ttc" id="structfaiss_1_1SliceInvertedLists_html_ac5eb6df92e3bc9d49d7e88f0ff8d3a88"><div class="ttname"><a href="structfaiss_1_1SliceInvertedLists.html#ac5eb6df92e3bc9d49d7e88f0ff8d3a88">faiss::SliceInvertedLists::get_ids</a></div><div class="ttdeci">const idx_t * get_ids(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00379">InvertedLists.cpp:379</a></div></div>
<div class="ttc" id="structfaiss_1_1SliceInvertedLists_html_a714d282706a7301772fcd145854a976e"><div class="ttname"><a href="structfaiss_1_1SliceInvertedLists.html#a714d282706a7301772fcd145854a976e">faiss::SliceInvertedLists::get_single_id</a></div><div class="ttdeci">idx_t get_single_id(size_t list_no, size_t offset) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00384">InvertedLists.cpp:384</a></div></div>
<div class="ttc" id="structfaiss_1_1SliceInvertedLists_html"><div class="ttname"><a href="structfaiss_1_1SliceInvertedLists.html">faiss::SliceInvertedLists</a></div><div class="ttdoc">vertical slice of indexes in another InvertedLists </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00256">InvertedLists.h:256</a></div></div>
<div class="ttc" id="structfaiss_1_1MaskedInvertedLists_html_a5fbd34b4052c314148c44f14b4d3c2d3"><div class="ttname"><a href="structfaiss_1_1MaskedInvertedLists.html#a5fbd34b4052c314148c44f14b4d3c2d3">faiss::MaskedInvertedLists::prefetch_lists</a></div><div class="ttdeci">void prefetch_lists(const idx_t *list_nos, int nlist) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00607">InvertedLists.cpp:607</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="namespacefaiss_html_af762526714e6138009c72aee98657538"><div class="ttname"><a href="namespacefaiss.html#af762526714e6138009c72aee98657538">faiss::imbalance_factor</a></div><div class="ttdeci">double imbalance_factor(int n, int k, const long *assign)</div><div class="ttdoc">a balanced assignment has a IF of 1 </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01304">utils.cpp:1304</a></div></div>
<div class="ttc" id="structfaiss_1_1MaskedInvertedLists_html_a5c400887da892a68ce47eff56e30dffc"><div class="ttname"><a href="structfaiss_1_1MaskedInvertedLists.html#a5c400887da892a68ce47eff56e30dffc">faiss::MaskedInvertedLists::list_size</a></div><div class="ttdeci">size_t list_size(size_t list_no) const override</div><div class="ttdoc">get the size of a list </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00563">InvertedLists.cpp:563</a></div></div>
<div class="ttc" id="structfaiss_1_1MaskedInvertedLists_html_a429657c4c203d472f59147f301de0ede"><div class="ttname"><a href="structfaiss_1_1MaskedInvertedLists.html#a429657c4c203d472f59147f301de0ede">faiss::MaskedInvertedLists::get_single_code</a></div><div class="ttdeci">const uint8_t * get_single_code(size_t list_no, size_t offset) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00600">InvertedLists.cpp:600</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_1VStackInvertedLists_html_a3c229e59737b533464f5403c5cf5fca4"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html#a3c229e59737b533464f5403c5cf5fca4">faiss::VStackInvertedLists::get_single_code</a></div><div class="ttdeci">const uint8_t * get_single_code(size_t list_no, size_t offset) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00474">InvertedLists.cpp:474</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_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_1VStackInvertedLists_html_a8f6ba4b3d64b74409742edad6c6c0f37"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html#a8f6ba4b3d64b74409742edad6c6c0f37">faiss::VStackInvertedLists::VStackInvertedLists</a></div><div class="ttdeci">VStackInvertedLists(int nil, const InvertedLists **ils)</div><div class="ttdoc">build InvertedLists by concatenating nil of them </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00446">InvertedLists.cpp:446</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a722eef5a0e5bf5dcf78228a903e16af9"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a722eef5a0e5bf5dcf78228a903e16af9">faiss::InvertedLists::compute_ntotal</a></div><div class="ttdeci">size_t compute_ntotal() const </div><div class="ttdoc">sum up list sizes </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00126">InvertedLists.cpp:126</a></div></div>
<div class="ttc" id="structfaiss_1_1VStackInvertedLists_html_a112f9458bd91ca5dbed2cb6d090a0034"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html#a112f9458bd91ca5dbed2cb6d090a0034">faiss::VStackInvertedLists::get_codes</a></div><div class="ttdeci">const uint8_t * get_codes(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00467">InvertedLists.cpp:467</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_1VStackInvertedLists_html"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html">faiss::VStackInvertedLists</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00278">InvertedLists.h:278</a></div></div>
<div class="ttc" id="structfaiss_1_1HStackInvertedLists_html_a3a69cb5d1c05fa6b583672c459ecc4a6"><div class="ttname"><a href="structfaiss_1_1HStackInvertedLists.html#a3a69cb5d1c05fa6b583672c459ecc4a6">faiss::HStackInvertedLists::get_codes</a></div><div class="ttdeci">const uint8_t * get_codes(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00250">InvertedLists.cpp:250</a></div></div>
<div class="ttc" id="structfaiss_1_1HStackInvertedLists_html_af8330d7cdc185533a1286e3413810c5e"><div class="ttname"><a href="structfaiss_1_1HStackInvertedLists.html#af8330d7cdc185533a1286e3413810c5e">faiss::HStackInvertedLists::list_size</a></div><div class="ttdeci">size_t list_size(size_t list_no) const override</div><div class="ttdoc">get the size of a list </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00240">InvertedLists.cpp:240</a></div></div>
<div class="ttc" id="structfaiss_1_1HStackInvertedLists_html_a249f680477fac00cdfcf319c3bbe8c05"><div class="ttname"><a href="structfaiss_1_1HStackInvertedLists.html#a249f680477fac00cdfcf319c3bbe8c05">faiss::HStackInvertedLists::prefetch_lists</a></div><div class="ttdeci">void prefetch_lists(const idx_t *list_nos, int nlist) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00322">InvertedLists.cpp:322</a></div></div>
<div class="ttc" id="structfaiss_1_1VStackInvertedLists_html_a6398b7faee56b47f1f9817f3763fef01"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html#a6398b7faee56b47f1f9817f3763fef01">faiss::VStackInvertedLists::list_size</a></div><div class="ttdeci">size_t list_size(size_t list_no) const override</div><div class="ttdoc">get the size of a list </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00460">InvertedLists.cpp:460</a></div></div>
<div class="ttc" id="structfaiss_1_1SliceInvertedLists_html_a40f74e21271fa5492fb9b78bb04a514f"><div class="ttname"><a href="structfaiss_1_1SliceInvertedLists.html#a40f74e21271fa5492fb9b78bb04a514f">faiss::SliceInvertedLists::prefetch_lists</a></div><div class="ttdeci">void prefetch_lists(const idx_t *list_nos, int nlist) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00395">InvertedLists.cpp:395</a></div></div>
<div class="ttc" id="structfaiss_1_1HStackInvertedLists_html_a882d2fde7902129f3ee2473efc4442da"><div class="ttname"><a href="structfaiss_1_1HStackInvertedLists.html#a882d2fde7902129f3ee2473efc4442da">faiss::HStackInvertedLists::HStackInvertedLists</a></div><div class="ttdeci">HStackInvertedLists(int nil, const InvertedLists **ils)</div><div class="ttdoc">build InvertedLists by concatenating nil of them </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00227">InvertedLists.cpp:227</a></div></div>
<div class="ttc" id="structfaiss_1_1HStackInvertedLists_html_aeef6bd41622796f5d142e60fe78a5da8"><div class="ttname"><a href="structfaiss_1_1HStackInvertedLists.html#aeef6bd41622796f5d142e60fe78a5da8">faiss::HStackInvertedLists::get_single_code</a></div><div class="ttdeci">const uint8_t * get_single_code(size_t list_no, size_t offset) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00265">InvertedLists.cpp:265</a></div></div>
<div class="ttc" id="structfaiss_1_1MaskedInvertedLists_html_af0d9f7b61caef91e30124b0f7a9d44b9"><div class="ttname"><a href="structfaiss_1_1MaskedInvertedLists.html#af0d9f7b61caef91e30124b0f7a9d44b9">faiss::MaskedInvertedLists::get_single_id</a></div><div class="ttdeci">idx_t get_single_id(size_t list_no, size_t offset) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00594">InvertedLists.cpp:594</a></div></div>
<div class="ttc" id="structfaiss_1_1MaskedInvertedLists_html_a4376b14cd4e349d51848995c102659af"><div class="ttname"><a href="structfaiss_1_1MaskedInvertedLists.html#a4376b14cd4e349d51848995c102659af">faiss::MaskedInvertedLists::get_codes</a></div><div class="ttdeci">const uint8_t * get_codes(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00569">InvertedLists.cpp:569</a></div></div>
<div class="ttc" id="structfaiss_1_1VStackInvertedLists_html_a912c3f0417c833a81da5957f4d77452a"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html#a912c3f0417c833a81da5957f4d77452a">faiss::VStackInvertedLists::get_ids</a></div><div class="ttdeci">const idx_t * get_ids(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00490">InvertedLists.cpp:490</a></div></div>
<div class="ttc" id="structfaiss_1_1SliceInvertedLists_html_ab58bf7449476fc4638bc0a004f7ecb07"><div class="ttname"><a href="structfaiss_1_1SliceInvertedLists.html#ab58bf7449476fc4638bc0a004f7ecb07">faiss::SliceInvertedLists::list_size</a></div><div class="ttdeci">size_t list_size(size_t list_no) const override</div><div class="ttdoc">get the size of a list </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00357">InvertedLists.cpp:357</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_1SliceInvertedLists_html_abc95a98970bb7b4b044c5a61520c20d3"><div class="ttname"><a href="structfaiss_1_1SliceInvertedLists.html#abc95a98970bb7b4b044c5a61520c20d3">faiss::SliceInvertedLists::get_single_code</a></div><div class="ttdeci">const uint8_t * get_single_code(size_t list_no, size_t offset) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00367">InvertedLists.cpp:367</a></div></div>
<div class="ttc" id="structfaiss_1_1ReadOnlyInvertedLists_html"><div class="ttname"><a href="structfaiss_1_1ReadOnlyInvertedLists.html">faiss::ReadOnlyInvertedLists</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00211">InvertedLists.h:211</a></div></div>
<div class="ttc" id="structfaiss_1_1ArrayInvertedLists_html_a48563a58d3bbfbb4334f3afdf2c9ba7a"><div class="ttname"><a href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">faiss::ArrayInvertedLists::ids</a></div><div class="ttdeci">std::vector< std::vector< idx_t > > ids</div><div class="ttdoc">Inverted lists for indexes. </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00184">InvertedLists.h:184</a></div></div>
<div class="ttc" id="structfaiss_1_1HStackInvertedLists_html_aa987a3ecea9f4df3340fd8c21f5d7000"><div class="ttname"><a href="structfaiss_1_1HStackInvertedLists.html#aa987a3ecea9f4df3340fd8c21f5d7000">faiss::HStackInvertedLists::release_ids</a></div><div class="ttdeci">void release_ids(size_t list_no, const idx_t *ids) const override</div><div class="ttdoc">release ids returned by get_ids </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00318">InvertedLists.cpp:318</a></div></div>
<div class="ttc" id="structfaiss_1_1MaskedInvertedLists_html_a924d45d2ab3809c728e7b02ec569b2ba"><div class="ttname"><a href="structfaiss_1_1MaskedInvertedLists.html#a924d45d2ab3809c728e7b02ec569b2ba">faiss::MaskedInvertedLists::get_ids</a></div><div class="ttdeci">const idx_t * get_ids(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00575">InvertedLists.cpp:575</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a156de8be4b21a0dfa9a48a3918a0b5c3"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a156de8be4b21a0dfa9a48a3918a0b5c3">faiss::InvertedLists::print_stats</a></div><div class="ttdeci">void print_stats() const </div><div class="ttdoc">display some stats about the inverted lists </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00109">InvertedLists.cpp:109</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a60b12f9efe940b617a8380adceef4032"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a60b12f9efe940b617a8380adceef4032">faiss::InvertedLists::get_codes</a></div><div class="ttdeci">virtual const uint8_t * get_codes(size_t list_no) const =0</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_1InvertedLists_html_ae1618d2b5dca2704d3af8ced58548ac9"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#ae1618d2b5dca2704d3af8ced58548ac9">faiss::InvertedLists::release_ids</a></div><div class="ttdeci">virtual void release_ids(size_t list_no, const idx_t *ids) const </div><div class="ttdoc">release ids returned by get_ids </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00046">InvertedLists.cpp:46</a></div></div>
<div class="ttc" id="structfaiss_1_1VStackInvertedLists_html_a331222282fb32dc55d6f5847bbd1c848"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html#a331222282fb32dc55d6f5847bbd1c848">faiss::VStackInvertedLists::release_codes</a></div><div class="ttdeci">void release_codes(size_t list_no, const uint8_t *codes) const override</div><div class="ttdoc">release codes returned by get_codes (default implementation is nop </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00483">InvertedLists.cpp:483</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_1_1ScopedIds_html"><div class="ttname"><a href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">faiss::InvertedLists::ScopedIds</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00136">InvertedLists.h:136</a></div></div>
<div class="ttc" id="structfaiss_1_1SliceInvertedLists_html_a95e1c091bea8695c6df29ed87b3cf0d9"><div class="ttname"><a href="structfaiss_1_1SliceInvertedLists.html#a95e1c091bea8695c6df29ed87b3cf0d9">faiss::SliceInvertedLists::get_codes</a></div><div class="ttdeci">const uint8_t * get_codes(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00362">InvertedLists.cpp:362</a></div></div>
<div class="ttc" id="structfaiss_1_1VStackInvertedLists_html_a3048d4656332d160502cd95b22b53be5"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html#a3048d4656332d160502cd95b22b53be5">faiss::VStackInvertedLists::release_ids</a></div><div class="ttdeci">void release_ids(size_t list_no, const idx_t *ids) const override</div><div class="ttdoc">release ids returned by get_ids </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00506">InvertedLists.cpp:506</a></div></div>
<div class="ttc" id="structfaiss_1_1MaskedInvertedLists_html_a64e66ef4c7dc387091f533cc61d88273"><div class="ttname"><a href="structfaiss_1_1MaskedInvertedLists.html#a64e66ef4c7dc387091f533cc61d88273">faiss::MaskedInvertedLists::release_codes</a></div><div class="ttdeci">void release_codes(size_t list_no, const uint8_t *codes) const override</div><div class="ttdoc">release codes returned by get_codes (default implementation is nop </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00581">InvertedLists.cpp:581</a></div></div>
<div class="ttc" id="structfaiss_1_1ArrayInvertedLists_html_af43d3f5c5bd897205853b289603fb42b"><div class="ttname"><a href="structfaiss_1_1ArrayInvertedLists.html#af43d3f5c5bd897205853b289603fb42b">faiss::ArrayInvertedLists::list_size</a></div><div class="ttdeci">size_t list_size(size_t list_no) const override</div><div class="ttdoc">get the size of a list </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00159">InvertedLists.cpp:159</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html_ad6a2111630ecd67ee5119d5198abcfb1"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#ad6a2111630ecd67ee5119d5198abcfb1">faiss::InvertedLists::release_codes</a></div><div class="ttdeci">virtual void release_codes(size_t list_no, const uint8_t *codes) const </div><div class="ttdoc">release codes returned by get_codes (default implementation is nop </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00043">InvertedLists.cpp:43</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_1_1ScopedCodes_html"><div class="ttname"><a href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">faiss::InvertedLists::ScopedCodes</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00156">InvertedLists.h:156</a></div></div>
<div class="ttc" id="structfaiss_1_1VStackInvertedLists_html_ab2d660680d9b4a2667c321515b5baa77"><div class="ttname"><a href="structfaiss_1_1VStackInvertedLists.html#ab2d660680d9b4a2667c321515b5baa77">faiss::VStackInvertedLists::get_single_id</a></div><div class="ttdeci">idx_t get_single_id(size_t list_no, size_t offset) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00497">InvertedLists.cpp:497</a></div></div>
<div class="ttc" id="structfaiss_1_1HStackInvertedLists_html_ad431aa76dc678d71747dcbc9379d123a"><div class="ttname"><a href="structfaiss_1_1HStackInvertedLists.html#ad431aa76dc678d71747dcbc9379d123a">faiss::HStackInvertedLists::release_codes</a></div><div class="ttdeci">void release_codes(size_t list_no, const uint8_t *codes) const override</div><div class="ttdoc">release codes returned by get_codes (default implementation is nop </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00283">InvertedLists.cpp:283</a></div></div>
<div class="ttc" id="structfaiss_1_1SliceInvertedLists_html_a362456fac3002d1a5625a13dbfc0752b"><div class="ttname"><a href="structfaiss_1_1SliceInvertedLists.html#a362456fac3002d1a5625a13dbfc0752b">faiss::SliceInvertedLists::release_codes</a></div><div class="ttdeci">void release_codes(size_t list_no, const uint8_t *codes) const override</div><div class="ttdoc">release codes returned by get_codes (default implementation is nop </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00374">InvertedLists.cpp:374</a></div></div>
<div class="ttc" id="structfaiss_1_1HStackInvertedLists_html_af812098083c022166d29a20846de173e"><div class="ttname"><a href="structfaiss_1_1HStackInvertedLists.html#af812098083c022166d29a20846de173e">faiss::HStackInvertedLists::get_ids</a></div><div class="ttdeci">const idx_t * get_ids(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00287">InvertedLists.cpp:287</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>