1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
<!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/demos/demo_imi_flat.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">Faiss
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Friends</a></div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_db04a82cea9eed053ba8c6e2dba16a96.html">demos</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">demo_imi_flat.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> </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 <cmath></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> <span class="preprocessor">#include <cstdlib></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 <sys/time.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> </div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <faiss/IndexPQ.h></span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <faiss/IndexIVFFlat.h></span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <faiss/IndexFlat.h></span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <faiss/index_io.h></span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keywordtype">double</span> elapsed ()</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> {</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keyword">struct </span>timeval tv;</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  gettimeofday (&tv, <span class="keyword">nullptr</span>);</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keywordflow">return</span> tv.tv_sec + tv.tv_usec * 1e-6;</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> }</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </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> <span class="keywordtype">int</span> main ()</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>  <span class="keywordtype">double</span> t0 = elapsed();</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// dimension of the vectors to index</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">int</span> d = 128;</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// size of the database we plan to index</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordtype">size_t</span> nb = 1000 * 1000;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// make a set of nt training vectors in the unit cube</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// (could be the database)</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">size_t</span> nt = 100 * 1000;</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">//---------------------------------------------------------------</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// Define the core quantizer</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// We choose a multiple inverted index for faster training with less data</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// and because it usually offers best accuracy/speed trade-offs</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// We here assume that its lifespan of this coarse quantizer will cover the</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// lifespan of the inverted-file quantizer IndexIVFFlat below</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="comment">// With dynamic allocation, one may give the responsability to free the</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// quantizer to the inverted-file index (with attribute do_delete_quantizer)</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// Note: a regular clustering algorithm would be defined as:</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// faiss::IndexFlatL2 coarse_quantizer (d);</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// Use nhash=2 subquantizers used to define the product coarse quantizer</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// Number of bits: we will have 2^nbits_coarse centroids per subquantizer</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// meaning (2^12)^nhash distinct inverted lists</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordtype">size_t</span> nhash = 2;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordtype">size_t</span> nbits_subq = int (log2 (nb+1) / 2); <span class="comment">// good choice in general</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordtype">size_t</span> ncentroids = 1 << (nhash * nbits_subq); <span class="comment">// total # of centroids</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>  <a class="code" href="structfaiss_1_1MultiIndexQuantizer.html">faiss::MultiIndexQuantizer</a> coarse_quantizer (d, nhash, nbits_subq);</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  printf (<span class="stringliteral">"IMI (%ld,%ld): %ld virtual centroids (target: %ld base vectors)"</span>,</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  nhash, nbits_subq, ncentroids, nb);</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>  <span class="comment">// the coarse quantizer should not be dealloced before the index</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// 4 = nb of bytes per code (d must be a multiple of this)</span></div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// 8 = nb of bits per sub-code (almost always 8)</span></div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="code" href="namespacefaiss.html#afd12191c638da74760ff397cf319752c">faiss::MetricType</a> metric = faiss::METRIC_L2; <span class="comment">// can be METRIC_INNER_PRODUCT</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <a class="code" href="structfaiss_1_1IndexIVFFlat.html">faiss::IndexIVFFlat</a> index (&coarse_quantizer, d, ncentroids, metric);</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  index.quantizer_trains_alone = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// define the number of probes. 2048 is for high-dim, overkilled in practice</span></div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// Use 4-1024 depending on the trade-off speed accuracy that you want</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  index.nprobe = 2048;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  { <span class="comment">// training</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  printf (<span class="stringliteral">"[%.3f s] Generating %ld vectors in %dD for training\n"</span>,</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  elapsed() - t0, nt, d);</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  std::vector <float> trainvecs (nt * d);</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < nt * d; i++) {</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  trainvecs[i] = drand48();</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> </div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  printf (<span class="stringliteral">"[%.3f s] Training the index\n"</span>, elapsed() - t0);</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  index.verbose = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  index.train (nt, trainvecs.data());</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> </div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">size_t</span> nq;</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  std::vector<float> queries;</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>  { <span class="comment">// populating the database</span></div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  printf (<span class="stringliteral">"[%.3f s] Building a dataset of %ld vectors to index\n"</span>,</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  elapsed() - t0, nb);</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  std::vector <float> database (nb * d);</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < nb * d; i++) {</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  database[i] = drand48();</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> </div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  printf (<span class="stringliteral">"[%.3f s] Adding the vectors to the index\n"</span>, elapsed() - t0);</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>  index.add (nb, database.data());</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// remember a few elements from the database as queries</span></div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordtype">int</span> i0 = 1234;</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordtype">int</span> i1 = 1244;</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  nq = i1 - i0;</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  queries.resize (nq * d);</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = i0; i < i1; i++) {</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < d; j++) {</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  queries [(i - i0) * d + j] = database [i * d + j];</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</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>  { <span class="comment">// searching the database</span></div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">int</span> k = 5;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  printf (<span class="stringliteral">"[%.3f s] Searching the %d nearest neighbors "</span></div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="stringliteral">"of %ld vectors in the index\n"</span>,</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  elapsed() - t0, k, nq);</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>  std::vector<faiss::Index::idx_t> nns (k * nq);</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  std::vector<float> dis (k * nq);</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>  index.search (nq, queries.data(), k, dis.data(), nns.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>  printf (<span class="stringliteral">"[%.3f s] Query results (vector ids, then distances):\n"</span>,</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  elapsed() - t0);</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nq; i++) {</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  printf (<span class="stringliteral">"query %2d: "</span>, i);</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < k; j++) {</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  printf (<span class="stringliteral">"%7ld "</span>, nns[j + i * k]);</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>  printf (<span class="stringliteral">"\n dis: "</span>);</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < k; j++) {</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  printf (<span class="stringliteral">"%7g "</span>, dis[j + i * k]);</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  printf (<span class="stringliteral">"\n"</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>  }</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> }</div>
<div class="ttc" id="structfaiss_1_1IndexIVFFlat_html"><div class="ttname"><a href="structfaiss_1_1IndexIVFFlat.html">faiss::IndexIVFFlat</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFFlat_8h_source.html#l00025">IndexIVFFlat.h:25</a></div></div>
<div class="ttc" id="structfaiss_1_1MultiIndexQuantizer_html"><div class="ttname"><a href="structfaiss_1_1MultiIndexQuantizer.html">faiss::MultiIndexQuantizer</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexPQ_8h_source.html#l00136">IndexPQ.h:136</a></div></div>
<div class="ttc" id="namespacefaiss_html_afd12191c638da74760ff397cf319752c"><div class="ttname"><a href="namespacefaiss.html#afd12191c638da74760ff397cf319752c">faiss::MetricType</a></div><div class="ttdeci">MetricType</div><div class="ttdoc">Some algorithms support both an inner product version and a L2 search version. </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00045">Index.h:45</a></div></div>
</div><!-- 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>