<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.5"/>
<title>Faiss: /tmp/faiss/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">/tmp/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) 2015-present, Facebook, Inc.</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * All rights reserved.</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * This source code is licensed under the BSD+Patents license found in the</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * LICENSE file in the root directory of this source tree.</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// -*- c++ -*-</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include "InvertedLists.h"</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include <cstdio></span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include "utils.h"</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include "FaissAssert.h"</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="keyword">namespace </span>faiss {</div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="keyword">using</span> ScopedIds = InvertedLists::ScopedIds;</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">using</span> ScopedCodes = InvertedLists::ScopedCodes;</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">/*****************************************</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * InvertedLists implementation</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> ******************************************/</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> InvertedLists::InvertedLists (<span class="keywordtype">size_t</span> nlist, <span class="keywordtype">size_t</span> code_size):</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  nlist (nlist), code_size (code_size)</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> </div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> InvertedLists::~InvertedLists ()</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> {}</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div>
<div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#a21b52cdb0601cd225bd7924932310876"> 36</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="l00037"></a><span class="lineno"> 37</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="l00038"></a><span class="lineno"> 38</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  assert (offset < <a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no));</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</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="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"> 43</span> </div>
<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#a3f88cb5bb3073eb7d9777e838208190f"> 44</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1InvertedLists.html#a3f88cb5bb3073eb7d9777e838208190f">InvertedLists::release_codes</a> (<span class="keyword">const</span> uint8_t *)<span class="keyword"> const</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keyword"></span>{}</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div>
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#a6930df334c12b6a20e2c82e165462028"> 47</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1InvertedLists.html#a6930df334c12b6a20e2c82e165462028">InvertedLists::release_ids</a> (<span class="keyword">const</span> idx_t *)<span class="keyword"> const</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="keyword"></span>{}</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div>
<div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#a4e62994e54a0834f130bb4ba09c16a9c"> 50</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1InvertedLists.html#a4e62994e54a0834f130bb4ba09c16a9c">InvertedLists::prefetch_lists</a> (<span class="keyword">const</span> <span class="keywordtype">long</span> *, <span class="keywordtype">int</span>)<span class="keyword"> const</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keyword"></span>{}</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div>
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#afc2760bed7c210f2fad9b03109f561ee"> 53</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="l00054"></a><span class="lineno"> 54</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="l00055"></a><span class="lineno"> 55</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  assert (offset < <a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no));</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</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="l00058"></a><span class="lineno"> 58</span> }</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#acd3e36cc06fc49e02773e403a84dba95"> 60</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="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">const</span> uint8_t *code)</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">return</span> add_entries (list_no, 1, &theid, code);</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> </div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</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="l00067"></a><span class="lineno"> 67</span>  idx_t <span class="keywordtype">id</span>, <span class="keyword">const</span> uint8_t *code)</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> {</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  update_entries (list_no, offset, 1, &<span class="keywordtype">id</span>, code);</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> </div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keywordtype">void</span> InvertedLists::reset () {</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</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="l00074"></a><span class="lineno"> 74</span>  resize (i, 0);</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> }</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> </div>
<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="structfaiss_1_1InvertedLists.html#ac2a0686121ef5bdd6eb70f7eb3cf9b3a"> 78</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="l00079"></a><span class="lineno"> 79</span> </div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">long</span> i = 0; i < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; i++) {</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</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="l00083"></a><span class="lineno"> 83</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">ScopedIds</a> ids (oivf, i);</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (add_id == 0) {</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  add_entries (i, list_size, ids.get (),</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">ScopedCodes</a> (oivf, i).get());</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  std::vector <idx_t> new_ids (list_size);</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</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="l00091"></a><span class="lineno"> 91</span>  new_ids [j] = ids[j] + add_id;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  }</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  add_entries (i, list_size, new_ids.data(),</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <a class="code" href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">ScopedCodes</a> (oivf, i).get());</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  oivf->resize (i, 0);</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> }</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment">/*****************************************</span></div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> * ArrayInvertedLists implementation</span></div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> ******************************************/</span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> ArrayInvertedLists::ArrayInvertedLists (<span class="keywordtype">size_t</span> nlist, <span class="keywordtype">size_t</span> code_size):</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> (nlist, code_size)</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> {</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  ids.resize (nlist);</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  codes.resize (nlist);</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> }</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="keywordtype">size_t</span> ArrayInvertedLists::add_entries (</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> n_entry,</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">const</span> idx_t* ids_in, <span class="keyword">const</span> uint8_t *code)</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> {</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (n_entry == 0) <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</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="l00118"></a><span class="lineno"> 118</span>  <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a> [list_no].resize (o + n_entry);</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</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="l00120"></a><span class="lineno"> 120</span>  codes [list_no].resize ((o + n_entry) * code_size);</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  memcpy (&codes[list_no][o * code_size], code, code_size * n_entry);</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> o;</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"><a class="line" href="structfaiss_1_1ArrayInvertedLists.html#af43d3f5c5bd897205853b289603fb42b"> 125</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="l00126"></a><span class="lineno"> 126</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</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="l00129"></a><span class="lineno"> 129</span> }</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div>
<div class="line"><a name="l00131"></a><span class="lineno"><a class="line" href="structfaiss_1_1ArrayInvertedLists.html#abf4ab66d09d8a1b707dddc77d0c2e8fc"> 131</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="l00132"></a><span class="lineno"> 132</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">return</span> codes[list_no].data();</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> }</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div>
<div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="structfaiss_1_1ArrayInvertedLists.html#abd59f7cf340d9c17eb6b402579e4010b"> 138</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="l00139"></a><span class="lineno"> 139</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</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="l00142"></a><span class="lineno"> 142</span> }</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</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="l00145"></a><span class="lineno"> 145</span> {</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="code" href="structfaiss_1_1ArrayInvertedLists.html#a48563a58d3bbfbb4334f3afdf2c9ba7a">ids</a>[list_no].resize (new_size);</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  codes[list_no].resize (new_size * code_size);</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> </div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="keywordtype">void</span> ArrayInvertedLists::update_entries (</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</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="l00152"></a><span class="lineno"> 152</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="l00153"></a><span class="lineno"> 153</span> {</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  assert (list_no < nlist);</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</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="l00156"></a><span class="lineno"> 156</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="l00157"></a><span class="lineno"> 157</span>  memcpy (&codes[list_no][offset * code_size], codes_in, code_size * n_entry);</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> }</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> ArrayInvertedLists::~ArrayInvertedLists ()</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> {}</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment">/*****************************************</span></div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> * ConcatenatedInvertedLists implementation</span></div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> ******************************************/</span></div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div>
<div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="structfaiss_1_1ConcatenatedInvertedLists.html#a55e8e8fcd065c34f0fb0bc51ced7b864"> 169</a></span> <a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#a55e8e8fcd065c34f0fb0bc51ced7b864">ConcatenatedInvertedLists::ConcatenatedInvertedLists</a> (</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</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="l00171"></a><span class="lineno"> 171</span>  <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> (nil > 0 ? ils_in[0]->nlist : 0,</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  nil > 0 ? ils_in[0]->code_size : 0)</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> {</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  FAISS_THROW_IF_NOT (nil > 0);</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nil; i++) {</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  ils.push_back (ils_in[i]);</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  FAISS_THROW_IF_NOT (ils_in[i]->code_size == code_size &&</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  ils_in[i]->nlist == nlist);</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> }</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div>
<div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="structfaiss_1_1ConcatenatedInvertedLists.html#ae0a5c0e8d256302da0a569ad055c00e5"> 182</a></span> <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#ae0a5c0e8d256302da0a569ad055c00e5">ConcatenatedInvertedLists::list_size</a>(<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">size_t</span> sz = 0;</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</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="l00187"></a><span class="lineno"> 187</span>  sz += il-><a class="code" href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">list_size</a> (list_no);</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">return</span> sz;</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> }</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div>
<div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="structfaiss_1_1ConcatenatedInvertedLists.html#a58b6ba927b61665915b4b9a35c5277ae"> 192</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#a58b6ba927b61665915b4b9a35c5277ae">ConcatenatedInvertedLists::get_codes</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  uint8_t *codes = <span class="keyword">new</span> uint8_t [code_size * <a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#ae0a5c0e8d256302da0a569ad055c00e5">list_size</a>(list_no)], *c = codes;</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</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="l00198"></a><span class="lineno"> 198</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="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">if</span> (sz > 0) {</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</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="l00201"></a><span class="lineno"> 201</span>  c += sz;</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">return</span> codes;</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> }</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> </div>
<div class="line"><a name="l00207"></a><span class="lineno"><a class="line" href="structfaiss_1_1ConcatenatedInvertedLists.html#a159368893fd1c80999600214af416719"> 207</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#a159368893fd1c80999600214af416719">ConcatenatedInvertedLists::get_single_code</a> (</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</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="l00209"></a><span class="lineno"> 209</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</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="l00212"></a><span class="lineno"> 212</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="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> (offset < sz) {</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// here we have to copy the code, otherwise it will crash at dealloc</span></div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</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="l00216"></a><span class="lineno"> 216</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="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">return</span> code;</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  offset -= sz;</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>  FAISS_THROW_FMT (<span class="stringliteral">"offset %ld unknown"</span>, offset);</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> </div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div>
<div class="line"><a name="l00225"></a><span class="lineno"><a class="line" href="structfaiss_1_1ConcatenatedInvertedLists.html#accfbd4f63cbd78c9db162c60afe31848"> 225</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#accfbd4f63cbd78c9db162c60afe31848">ConcatenatedInvertedLists::release_codes</a> (<span class="keyword">const</span> uint8_t *codes)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keyword">delete</span> [] codes;</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> }</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div>
<div class="line"><a name="l00229"></a><span class="lineno"><a class="line" href="structfaiss_1_1ConcatenatedInvertedLists.html#a886e88bc6bf2ebd996b3f62adb9d0cc6"> 229</a></span> <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#a040c6aed1f224f3ea7bf58eebc0c31a4">Index::idx_t</a> * <a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#a886e88bc6bf2ebd996b3f62adb9d0cc6">ConcatenatedInvertedLists::get_ids</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  idx_t *ids = <span class="keyword">new</span> idx_t [<a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#ae0a5c0e8d256302da0a569ad055c00e5">list_size</a>(list_no)], *c = ids;</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</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="l00235"></a><span class="lineno"> 235</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="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (sz > 0) {</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</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="l00238"></a><span class="lineno"> 238</span>  c += sz;</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">return</span> ids;</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> }</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div>
<div class="line"><a name="l00244"></a><span class="lineno"><a class="line" href="structfaiss_1_1ConcatenatedInvertedLists.html#a60bcb32205363041a75bc509ce36d933"> 244</a></span> <a class="code" href="structfaiss_1_1Index.html#a040c6aed1f224f3ea7bf58eebc0c31a4">Index::idx_t</a> <a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#a60bcb32205363041a75bc509ce36d933">ConcatenatedInvertedLists::get_single_id</a> (</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</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="l00246"></a><span class="lineno"> 246</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ils.size(); i++) {</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</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="l00250"></a><span class="lineno"> 250</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="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (offset < sz) {</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</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="l00253"></a><span class="lineno"> 253</span>  }</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  offset -= sz;</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  FAISS_THROW_FMT (<span class="stringliteral">"offset %ld unknown"</span>, offset);</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> }</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> </div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div>
<div class="line"><a name="l00260"></a><span class="lineno"><a class="line" href="structfaiss_1_1ConcatenatedInvertedLists.html#ae9670e5e9afce0ebc1f43317d25b45e2"> 260</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ConcatenatedInvertedLists.html#ae9670e5e9afce0ebc1f43317d25b45e2">ConcatenatedInvertedLists::release_ids</a> (<span class="keyword">const</span> idx_t *ids)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">delete</span> [] ids;</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> }</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> </div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="keywordtype">size_t</span> ConcatenatedInvertedLists::add_entries (</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordtype">size_t</span> , <span class="keywordtype">size_t</span> ,</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keyword">const</span> idx_t* , <span class="keyword">const</span> uint8_t *)</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> {</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  FAISS_THROW_MSG (<span class="stringliteral">"not implemented"</span>);</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> }</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="keywordtype">void</span> ConcatenatedInvertedLists::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="l00272"></a><span class="lineno"> 272</span>  <span class="keyword">const</span> idx_t *, <span class="keyword">const</span> uint8_t *)</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span> {</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  FAISS_THROW_MSG (<span class="stringliteral">"not implemented"</span>);</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> }</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> <span class="keywordtype">void</span> ConcatenatedInvertedLists::resize (<span class="keywordtype">size_t</span> , <span class="keywordtype">size_t</span> )</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_MSG (<span class="stringliteral">"not implemented"</span>);</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> }</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> </div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> </div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span> } <span class="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#l00131">InvertedLists.cpp:131</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#l00138">InvertedLists.cpp:138</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_a9bd256053ee360473842105460fe285f"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a9bd256053ee360473842105460fe285f">faiss::InvertedLists::list_size</a></div><div class="ttdeci">virtual size_t list_size(size_t list_no) const =0</div><div class="ttdoc">get the size of a list </div></div>
<div class="ttc" id="structfaiss_1_1ConcatenatedInvertedLists_html_accfbd4f63cbd78c9db162c60afe31848"><div class="ttname"><a href="structfaiss_1_1ConcatenatedInvertedLists.html#accfbd4f63cbd78c9db162c60afe31848">faiss::ConcatenatedInvertedLists::release_codes</a></div><div class="ttdeci">void release_codes(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#l00225">InvertedLists.cpp:225</a></div></div>
<div class="ttc" id="structfaiss_1_1ConcatenatedInvertedLists_html_ae9670e5e9afce0ebc1f43317d25b45e2"><div class="ttname"><a href="structfaiss_1_1ConcatenatedInvertedLists.html#ae9670e5e9afce0ebc1f43317d25b45e2">faiss::ConcatenatedInvertedLists::release_ids</a></div><div class="ttdeci">void release_ids(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#l00260">InvertedLists.cpp:260</a></div></div>
<div class="ttc" id="structfaiss_1_1ConcatenatedInvertedLists_html_a55e8e8fcd065c34f0fb0bc51ced7b864"><div class="ttname"><a href="structfaiss_1_1ConcatenatedInvertedLists.html#a55e8e8fcd065c34f0fb0bc51ced7b864">faiss::ConcatenatedInvertedLists::ConcatenatedInvertedLists</a></div><div class="ttdeci">ConcatenatedInvertedLists(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#l00169">InvertedLists.cpp:169</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html">faiss::InvertedLists</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00032">InvertedLists.h:32</a></div></div>
<div class="ttc" id="structfaiss_1_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#l00078">InvertedLists.cpp:78</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#l00036">InvertedLists.cpp:36</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html_ae06049e4259edb47d443ef87bdedc744"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">faiss::InvertedLists::code_size</a></div><div class="ttdeci">size_t code_size</div><div class="ttdoc">code size per vector in bytes </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00036">InvertedLists.h:36</a></div></div>
<div class="ttc" id="structfaiss_1_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#l00053">InvertedLists.cpp:53</a></div></div>
<div class="ttc" id="structfaiss_1_1ConcatenatedInvertedLists_html_a886e88bc6bf2ebd996b3f62adb9d0cc6"><div class="ttname"><a href="structfaiss_1_1ConcatenatedInvertedLists.html#a886e88bc6bf2ebd996b3f62adb9d0cc6">faiss::ConcatenatedInvertedLists::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#l00229">InvertedLists.cpp:229</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#l00060">InvertedLists.cpp:60</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_a040c6aed1f224f3ea7bf58eebc0c31a4"><div class="ttname"><a href="structfaiss_1_1Index.html#a040c6aed1f224f3ea7bf58eebc0c31a4">faiss::Index::idx_t</a></div><div class="ttdeci">long idx_t</div><div class="ttdoc">all indices are this type </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00064">Index.h:64</a></div></div>
<div class="ttc" id="structfaiss_1_1ConcatenatedInvertedLists_html_a159368893fd1c80999600214af416719"><div class="ttname"><a href="structfaiss_1_1ConcatenatedInvertedLists.html#a159368893fd1c80999600214af416719">faiss::ConcatenatedInvertedLists::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#l00207">InvertedLists.cpp:207</a></div></div>
<div class="ttc" id="structfaiss_1_1ConcatenatedInvertedLists_html_a60bcb32205363041a75bc509ce36d933"><div class="ttname"><a href="structfaiss_1_1ConcatenatedInvertedLists.html#a60bcb32205363041a75bc509ce36d933">faiss::ConcatenatedInvertedLists::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#l00244">InvertedLists.cpp:244</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a4e62994e54a0834f130bb4ba09c16a9c"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a4e62994e54a0834f130bb4ba09c16a9c">faiss::InvertedLists::prefetch_lists</a></div><div class="ttdeci">virtual void prefetch_lists(const long *list_nos, int nlist) const </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8cpp_source.html#l00050">InvertedLists.cpp:50</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#l00035">InvertedLists.h:35</a></div></div>
<div class="ttc" id="structfaiss_1_1ConcatenatedInvertedLists_html_ae0a5c0e8d256302da0a569ad055c00e5"><div class="ttname"><a href="structfaiss_1_1ConcatenatedInvertedLists.html#ae0a5c0e8d256302da0a569ad055c00e5">faiss::ConcatenatedInvertedLists::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#l00182">InvertedLists.cpp:182</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#l00170">InvertedLists.h:170</a></div></div>
<div class="ttc" id="structfaiss_1_1ConcatenatedInvertedLists_html_a58b6ba927b61665915b4b9a35c5277ae"><div class="ttname"><a href="structfaiss_1_1ConcatenatedInvertedLists.html#a58b6ba927b61665915b4b9a35c5277ae">faiss::ConcatenatedInvertedLists::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#l00192">InvertedLists.cpp:192</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a3f88cb5bb3073eb7d9777e838208190f"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a3f88cb5bb3073eb7d9777e838208190f">faiss::InvertedLists::release_codes</a></div><div class="ttdeci">virtual void release_codes(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#l00044">InvertedLists.cpp:44</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_1_1ScopedIds_html"><div class="ttname"><a href="structfaiss_1_1InvertedLists_1_1ScopedIds.html">faiss::InvertedLists::ScopedIds</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00125">InvertedLists.h:125</a></div></div>
<div class="ttc" id="structfaiss_1_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#l00125">InvertedLists.cpp:125</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a6930df334c12b6a20e2c82e165462028"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a6930df334c12b6a20e2c82e165462028">faiss::InvertedLists::release_ids</a></div><div class="ttdeci">virtual void release_ids(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#l00047">InvertedLists.cpp:47</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_1_1ScopedCodes_html"><div class="ttname"><a href="structfaiss_1_1InvertedLists_1_1ScopedCodes.html">faiss::InvertedLists::ScopedCodes</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00144">InvertedLists.h:144</a></div></div>
</div><!-- 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>