<!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/utils.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/utils.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 "utils.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> <span class="preprocessor">#include <cassert></span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <cstring></span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include <cmath></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="preprocessor">#include <sys/time.h></span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <sys/types.h></span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <unistd.h></span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <omp.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="preprocessor">#include <immintrin.h></span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <algorithm></span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <vector></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> <span class="preprocessor">#include "AuxIndexStructures.h"</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "FaissAssert.h"</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> </div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifndef FINTEGER</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor"></span><span class="preprocessor">#define FINTEGER long</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor"></span></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="keyword">extern</span> <span class="stringliteral">"C"</span> {</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">/* declare BLAS functions, see http://www.netlib.org/clapack/cblas/ */</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> <span class="keywordtype">int</span> sgemm_ (<span class="keyword">const</span> <span class="keywordtype">char</span> *transa, <span class="keyword">const</span> <span class="keywordtype">char</span> *transb, FINTEGER *m, FINTEGER *</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  n, FINTEGER *k, <span class="keyword">const</span> <span class="keywordtype">float</span> *alpha, <span class="keyword">const</span> <span class="keywordtype">float</span> *a,</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  FINTEGER *lda, <span class="keyword">const</span> <span class="keywordtype">float</span> *b, FINTEGER *</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  ldb, <span class="keywordtype">float</span> *beta, <span class="keywordtype">float</span> *c, FINTEGER *ldc);</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">/* Lapack functions, see http://www.netlib.org/clapack/old/single/sgeqrf.c */</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"> 49</span> <span class="keywordtype">int</span> sgeqrf_ (FINTEGER *m, FINTEGER *n, <span class="keywordtype">float</span> *a, FINTEGER *lda,</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordtype">float</span> *tau, <span class="keywordtype">float</span> *work, FINTEGER *lwork, FINTEGER *info);</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="keywordtype">int</span> sorgqr_(FINTEGER *m, FINTEGER *n, FINTEGER *k, <span class="keywordtype">float</span> *a,</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  FINTEGER *lda, <span class="keywordtype">float</span> *tau, <span class="keywordtype">float</span> *work,</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  FINTEGER *lwork, FINTEGER *info);</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="keywordtype">int</span> sgemv_(<span class="keyword">const</span> <span class="keywordtype">char</span> *trans, FINTEGER *m, FINTEGER *n, <span class="keywordtype">float</span> *alpha,</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *a, FINTEGER *lda, <span class="keyword">const</span> <span class="keywordtype">float</span> *x, FINTEGER *incx,</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">float</span> *beta, <span class="keywordtype">float</span> *y, FINTEGER *incy);</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> }</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> </div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment">/**************************************************</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> * Get some stats about the system</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> **************************************************/</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">namespace </span>faiss {</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div>
<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb"> 69</a></span> <span class="keywordtype">double</span> <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a> () {</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">struct </span>timeval tv;</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  gettimeofday (&tv, <span class="keyword">nullptr</span>);</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">return</span> tv.tv_sec * 1e3 + tv.tv_usec * 1e-3;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> }</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor">#ifdef __linux__</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="keywordtype">size_t</span> <a class="code" href="namespacefaiss.html#aa3af5769b0b649f112332a874c64d361">get_mem_usage_kb</a> ()</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="keywordtype">int</span> pid = getpid ();</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordtype">char</span> fname[256];</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  snprintf (fname, 256, <span class="stringliteral">"/proc/%d/status"</span>, pid);</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  FILE * f = fopen (fname, <span class="stringliteral">"r"</span>);</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  FAISS_THROW_IF_NOT_MSG (f, <span class="stringliteral">"cannot open proc status file"</span>);</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">size_t</span> sz = 0;</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">for</span> (;;) {</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordtype">char</span> buf [256];</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span> (!fgets (buf, 256, f)) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> (sscanf (buf, <span class="stringliteral">"VmRSS: %ld kB"</span>, &sz) == 1) <span class="keywordflow">break</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>  fclose (f);</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> sz;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> }</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor">#elif __APPLE__</span></div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="keywordtype">size_t</span> <a class="code" href="namespacefaiss.html#aa3af5769b0b649f112332a874c64d361">get_mem_usage_kb</a> ()</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>  fprintf(stderr, <span class="stringliteral">"WARN: get_mem_usage_kb not implemented on the mac\n"</span>);</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> 0;</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> </div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="preprocessor"></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> </div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">/**************************************************</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> * Random data generation functions</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> **************************************************/</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> RandomGenerator::RandomGenerator (<span class="keywordtype">long</span> seed)</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  : mt((unsigned int)seed) {}</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div>
<div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="structfaiss_1_1RandomGenerator.html#a583f124ecacdbe037ac96e23a44dd420"> 114</a></span> <span class="keywordtype">int</span> RandomGenerator::rand_int ()</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>  <span class="keywordflow">return</span> mt() & 0x7fffffff;</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"><a class="line" href="structfaiss_1_1RandomGenerator.html#acbceaa8b017793ca4f8d90e644b0d7f4"> 119</a></span> <span class="keywordtype">long</span> RandomGenerator::rand_long ()</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> {</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> long(rand_int()) | long(rand_int()) << 31;</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"><a class="line" href="structfaiss_1_1RandomGenerator.html#aa460b9bac2593cd1d71305e10ab51af6"> 124</a></span> <span class="keywordtype">int</span> RandomGenerator::rand_int (<span class="keywordtype">int</span> max)</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> {</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">return</span> mt() % max;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> }</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div>
<div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="structfaiss_1_1RandomGenerator.html#ac82a433d7bfa56d750907ba5cf74aed7"> 129</a></span> <span class="keywordtype">float</span> RandomGenerator::rand_float ()</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> mt() / float(mt.max());</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="keywordtype">double</span> RandomGenerator::rand_double ()</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>  <span class="keywordflow">return</span> mt() / double(mt.max());</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> </div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment">/***********************************************************************</span></div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"> * Random functions in this C file only exist because Torch</span></div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"> * counterparts are slow and not multi-threaded. Typical use is for</span></div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> * more than 1-100 billion values. */</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> </div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">/* Generate a set of random floating point values such that x[i] in [0,1]</span></div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> multi-threading. For this reason, we rely on re-entreant functions. */</span></div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="keywordtype">void</span> float_rand (<span class="keywordtype">float</span> * x, <span class="keywordtype">size_t</span> n, <span class="keywordtype">long</span> seed)</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="comment">// only try to parallelize on large enough arrays</span></div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nblock = n < 1024 ? 1 : 1024;</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  RandomGenerator rng0 (seed);</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordtype">int</span> a0 = rng0.rand_int (), b0 = rng0.rand_int ();</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nblock; j++) {</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>  RandomGenerator rng (a0 + j * b0);</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>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> istart = j * n / nblock;</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> iend = (j + 1) * n / nblock;</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>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = istart; i < iend; i++)</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  x[i] = rng.rand_float ();</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  }</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> }</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="keywordtype">void</span> float_randn (<span class="keywordtype">float</span> * x, <span class="keywordtype">size_t</span> n, <span class="keywordtype">long</span> seed)</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> {</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// only try to parallelize on large enough arrays</span></div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nblock = n < 1024 ? 1 : 1024;</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  RandomGenerator rng0 (seed);</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordtype">int</span> a0 = rng0.rand_int (), b0 = rng0.rand_int ();</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="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nblock; j++) {</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  RandomGenerator rng (a0 + j * b0);</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordtype">double</span> a = 0, b = 0, s = 0;</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordtype">int</span> state = 0; <span class="comment">/* generate two number per "do-while" loop */</span></div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> istart = j * n / nblock;</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> iend = (j + 1) * n / nblock;</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>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = istart; i < iend; i++) {</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">/* Marsaglia's method (see Knuth) */</span></div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">if</span> (state == 0) {</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  a = 2.0 * rng.rand_double () - 1;</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  b = 2.0 * rng.rand_double () - 1;</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  s = a * a + b * b;</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  } <span class="keywordflow">while</span> (s >= 1.0);</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  x[i] = a * sqrt(-2.0 * log(s) / s);</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="keywordflow">else</span></div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  x[i] = b * sqrt(-2.0 * log(s) / s);</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  state = 1 - state;</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> }</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment">/* Integer versions */</span></div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="keywordtype">void</span> long_rand (<span class="keywordtype">long</span> * x, <span class="keywordtype">size_t</span> n, <span class="keywordtype">long</span> seed)</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>  <span class="comment">// only try to parallelize on large enough arrays</span></div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nblock = n < 1024 ? 1 : 1024;</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  RandomGenerator rng0 (seed);</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordtype">int</span> a0 = rng0.rand_int (), b0 = rng0.rand_int ();</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> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nblock; j++) {</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  RandomGenerator rng (a0 + j * b0);</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>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> istart = j * n / nblock;</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> iend = (j + 1) * n / nblock;</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = istart; i < iend; i++)</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  x[i] = rng.rand_long ();</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> }</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="keywordtype">void</span> rand_perm (<span class="keywordtype">int</span> *perm, <span class="keywordtype">size_t</span> n, <span class="keywordtype">long</span> seed)</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> {</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++) perm[i] = i;</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>  RandomGenerator rng (seed);</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i + 1 < n; i++) {</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordtype">int</span> i2 = i + rng.rand_int (n - i);</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  std::swap(perm[i], perm[i2]);</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"> 240</span> </div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> </div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="keywordtype">void</span> byte_rand (uint8_t * x, <span class="keywordtype">size_t</span> n, <span class="keywordtype">long</span> seed)</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> {</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// only try to parallelize on large enough arrays</span></div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nblock = n < 1024 ? 1 : 1024;</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>  RandomGenerator rng0 (seed);</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordtype">int</span> a0 = rng0.rand_int (), b0 = rng0.rand_int ();</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> </div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nblock; j++) {</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span> </div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  RandomGenerator rng (a0 + j * b0);</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> istart = j * n / nblock;</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> iend = (j + 1) * n / nblock;</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordtype">size_t</span> i;</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">for</span> (i = istart; i < iend; i++)</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  x[i] = rng.rand_long ();</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"> 265</span> </div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> </div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="keywordtype">void</span> reflection (<span class="keyword">const</span> <span class="keywordtype">float</span> * __restrict u,</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">float</span> * __restrict x,</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordtype">size_t</span> n, <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nu)</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> {</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordtype">size_t</span> i, j, l;</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">for</span> (i = 0; i < n; i++) {</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * up = u;</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">for</span> (l = 0; l < nu; l++) {</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordtype">float</span> ip1 = 0, ip2 = 0;</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> </div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">for</span> (j = 0; j < d; j+=2) {</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  ip1 += up[j] * x[j];</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  ip2 += up[j+1] * x[j+1];</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>  <span class="keywordtype">float</span> ip = 2 * (ip1 + ip2);</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>  <span class="keywordflow">for</span> (j = 0; j < d; j++)</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  x[j] -= ip * up[j];</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  up += d;</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  x += d;</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span> }</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment">/* Reference implementation (slower) */</span></div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="keywordtype">void</span> reflection_ref (<span class="keyword">const</span> <span class="keywordtype">float</span> * u, <span class="keywordtype">float</span> * x, <span class="keywordtype">size_t</span> n, <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nu)</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span> {</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordtype">size_t</span> i, j, l;</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">for</span> (i = 0; i < n; i++) {</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * up = u;</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">for</span> (l = 0; l < nu; l++) {</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordtype">double</span> ip = 0;</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> </div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">for</span> (j = 0; j < d; j++)</div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  ip += up[j] * x[j];</div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  ip *= 2;</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> (j = 0; j < d; j++)</div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  x[j] -= ip * up[j];</div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  up += d;</div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  }</div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  x += d;</div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</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> </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"> 318</span> </div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment">/***************************************************************************</span></div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"> * Matrix/vector ops</span></div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment"> ***************************************************************************/</span></div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span> </div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment">/* Compute the inner product between a vector x and</span></div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"> a set of ny vectors y.</span></div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment"> These functions are not intended to replace BLAS matrix-matrix, as they</span></div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment"> would be significantly less efficient in this case. */</span></div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="keywordtype">void</span> fvec_inner_products_ny (<span class="keywordtype">float</span> * ip,</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> ny)</div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> {</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="comment">// Not sure which one is fastest</span></div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="preprocessor">#if 0</span></div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  FINTEGER di = d;</div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  FINTEGER nyi = ny;</div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordtype">float</span> one = 1.0, zero = 0.0;</div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  FINTEGER onei = 1;</div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  sgemv_ (<span class="stringliteral">"T"</span>, &di, &nyi, &one, y, &di, x, &onei, &zero, ip, &onei);</div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < ny; i++) {</div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  ip[i] = fvec_inner_product (x, y, d);</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  y += d;</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> </div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span> </div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span> </div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span> </div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment">/* Compute the L2 norm of a set of nx vectors */</span></div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="keywordtype">void</span> fvec_norms_L2 (<span class="keywordtype">float</span> * __restrict nr,</div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * __restrict x,</div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx)</div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span> {</div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span> </div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < nx; i++) {</div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  nr[i] = sqrtf (fvec_norm_L2sqr (x + i * d, d));</div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  }</div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span> }</div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span> </div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="keywordtype">void</span> fvec_norms_L2sqr (<span class="keywordtype">float</span> * __restrict nr,</div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * __restrict x,</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx)</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> {</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < nx; i++)</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  nr[i] = fvec_norm_L2sqr (x + i * d, d);</div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> }</div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> </div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="keywordtype">void</span> fvec_renorm_L2 (<span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">float</span> * __restrict x)</div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> {</div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < nx; i++) {</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordtype">float</span> * __restrict xi = x + i * d;</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>  <span class="keywordtype">float</span> nr = <a class="code" href="namespacefaiss.html#a7a49180ebf10e643217bbce5862c7f84">fvec_norm_L2sqr</a> (xi, d);</div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span> (nr > 0) {</div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordtype">size_t</span> j;</div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> inv_nr = 1.0 / sqrtf (nr);</div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">for</span> (j = 0; j < d; j++)</div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  xi[j] *= inv_nr;</div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  }</div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span> }</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"> 395</span> </div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span> </div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span> </div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span> </div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> </div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </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> </div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> </div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment">/***************************************************************************</span></div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="comment"> * KNN functions</span></div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="comment"> ***************************************************************************/</span></div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> </div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment">/* Find the nearest neighbors for nx queries in a set of ny vectors */</span></div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="keyword">static</span> <span class="keywordtype">void</span> knn_inner_product_sse (<span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  float_minheap_array_t * res)</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> {</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordtype">size_t</span> k = res->k;</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordtype">size_t</span> check_period = InterruptCallback::get_period_hint (ny * d);</div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> </div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i0 = 0; i0 < nx; i0 += check_period) {</div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordtype">size_t</span> i1 = std::min(i0 + check_period, nx);</div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> </div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = i0; i < i1; i++) {</div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x_i = x + i * d;</div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y_j = y;</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>  <span class="keywordtype">float</span> * __restrict simi = res->get_val(i);</div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordtype">long</span> * __restrict idxi = res->get_ids (i);</div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  minheap_heapify (k, simi, idxi);</div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < ny; j++) {</div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordtype">float</span> ip = fvec_inner_product (x_i, y_j, d);</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>  <span class="keywordflow">if</span> (ip > simi[0]) {</div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  minheap_pop (k, simi, idxi);</div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  minheap_push (k, simi, idxi, ip, j);</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>  y_j += d;</div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  }</div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  minheap_reorder (k, simi, idxi);</div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  }</div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  InterruptCallback::check ();</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> </div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span> }</div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="keyword">static</span> <span class="keywordtype">void</span> knn_L2sqr_sse (</div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  float_maxheap_array_t * res)</div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span> {</div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordtype">size_t</span> k = res->k;</div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> </div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordtype">size_t</span> check_period = InterruptCallback::get_period_hint (ny * d);</div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i0 = 0; i0 < nx; i0 += check_period) {</div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordtype">size_t</span> i1 = std::min(i0 + check_period, nx);</div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span> </div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = i0; i < i1; i++) {</div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x_i = x + i * d;</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y_j = y;</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordtype">size_t</span> j;</div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordtype">float</span> * simi = res->get_val(i);</div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordtype">long</span> * idxi = res->get_ids (i);</div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span> </div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  maxheap_heapify (k, simi, idxi);</div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keywordflow">for</span> (j = 0; j < ny; j++) {</div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordtype">float</span> disij = <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a> (x_i, y_j, d);</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span> </div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">if</span> (disij < simi[0]) {</div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  maxheap_pop (k, simi, idxi);</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  maxheap_push (k, simi, idxi, disij, j);</div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  y_j += d;</div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  }</div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  maxheap_reorder (k, simi, idxi);</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  InterruptCallback::check ();</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"> 490</span> }</div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> </div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment"></span></div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment">/** Find the nearest neighbors for nx queries in a set of ny vectors */</span></div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="keyword">static</span> <span class="keywordtype">void</span> knn_inner_product_blas (</div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  float_minheap_array_t * res)</div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span> {</div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  res->heapify ();</div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span> </div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">// BLAS does not like empty matrices</span></div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">if</span> (nx == 0 || ny == 0) <span class="keywordflow">return</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>  <span class="comment">/* block sizes */</span></div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> bs_x = 4096, bs_y = 1024;</div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">// const size_t bs_x = 16, bs_y = 16;</span></div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  std::unique_ptr<float[]> ip_block(<span class="keyword">new</span> <span class="keywordtype">float</span>[bs_x * bs_y]);</div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i0 = 0; i0 < nx; i0 += bs_x) {</div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordtype">size_t</span> i1 = i0 + bs_x;</div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">if</span>(i1 > nx) i1 = nx;</div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span> </div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j0 = 0; j0 < ny; j0 += bs_y) {</div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordtype">size_t</span> j1 = j0 + bs_y;</div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">if</span> (j1 > ny) j1 = ny;</div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="comment">/* compute the actual dot products */</span></div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  {</div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordtype">float</span> one = 1, zero = 0;</div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  FINTEGER nyi = j1 - j0, nxi = i1 - i0, di = d;</div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  sgemm_ (<span class="stringliteral">"Transpose"</span>, <span class="stringliteral">"Not transpose"</span>, &nyi, &nxi, &di, &one,</div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  y + j0 * d, &di,</div>
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  x + i0 * d, &di, &zero,</div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  ip_block.get(), &nyi);</div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  }</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>  <span class="comment">/* collect maxima */</span></div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  res->addn (j1 - j0, ip_block.get(), j0, i0, i1 - i0);</div>
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  }</div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  InterruptCallback::check ();</div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  }</div>
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  res->reorder ();</div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span> }</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> <span class="comment">// distance correction is an operator that can be applied to transform</span></div>
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="comment">// the distances</span></div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="keyword">template</span><<span class="keyword">class</span> DistanceCorrection></div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="keyword">static</span> <span class="keywordtype">void</span> knn_L2sqr_blas (<span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  float_maxheap_array_t * res,</div>
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keyword">const</span> DistanceCorrection &corr)</div>
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span> {</div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  res->heapify ();</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>  <span class="comment">// BLAS does not like empty matrices</span></div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">if</span> (nx == 0 || ny == 0) <span class="keywordflow">return</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="keywordtype">size_t</span> k = res->k;</div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span> </div>
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="comment">/* block sizes */</span></div>
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> bs_x = 4096, bs_y = 1024;</div>
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// const size_t bs_x = 16, bs_y = 16;</span></div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordtype">float</span> *ip_block = <span class="keyword">new</span> <span class="keywordtype">float</span>[bs_x * bs_y];</div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordtype">float</span> *x_norms = <span class="keyword">new</span> <span class="keywordtype">float</span>[nx];</div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordtype">float</span> *y_norms = <span class="keyword">new</span> <span class="keywordtype">float</span>[ny];</div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  ScopeDeleter<float> del1(ip_block), del3(x_norms), del2(y_norms);</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>  fvec_norms_L2sqr (x_norms, x, d, nx);</div>
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  fvec_norms_L2sqr (y_norms, y, d, ny);</div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span> </div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span> </div>
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i0 = 0; i0 < nx; i0 += bs_x) {</div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordtype">size_t</span> i1 = i0 + bs_x;</div>
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">if</span>(i1 > nx) i1 = nx;</div>
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span> </div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j0 = 0; j0 < ny; j0 += bs_y) {</div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordtype">size_t</span> j1 = j0 + bs_y;</div>
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">if</span> (j1 > ny) j1 = ny;</div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">/* compute the actual dot products */</span></div>
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  {</div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keywordtype">float</span> one = 1, zero = 0;</div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  FINTEGER nyi = j1 - j0, nxi = i1 - i0, di = d;</div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  sgemm_ (<span class="stringliteral">"Transpose"</span>, <span class="stringliteral">"Not transpose"</span>, &nyi, &nxi, &di, &one,</div>
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  y + j0 * d, &di,</div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  x + i0 * d, &di, &zero,</div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  ip_block, &nyi);</div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span> </div>
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">/* collect minima */</span></div>
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = i0; i < i1; i++) {</div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordtype">float</span> * __restrict simi = res->get_val(i);</div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordtype">long</span> * __restrict idxi = res->get_ids (i);</div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *ip_line = ip_block + (i - i0) * (j1 - j0);</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>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = j0; j < j1; j++) {</div>
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordtype">float</span> ip = *ip_line++;</div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordtype">float</span> dis = x_norms[i] + y_norms[j] - 2 * ip;</div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span> </div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">// negative values can occur for identical vectors</span></div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// due to roundoff errors</span></div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">if</span> (dis < 0) dis = 0;</div>
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span> </div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  dis = corr (dis, i, j);</div>
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span> </div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">if</span> (dis < simi[0]) {</div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  maxheap_pop (k, simi, idxi);</div>
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  maxheap_push (k, simi, idxi, dis, j);</div>
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  }</div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  }</div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  }</div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  InterruptCallback::check ();</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>  res->reorder ();</div>
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> </div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> }</div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> </div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> </div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div>
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span> </div>
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span> </div>
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span> </div>
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span> </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> </div>
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span> <span class="comment">/*******************************************************</span></div>
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span> <span class="comment"> * KNN driver functions</span></div>
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span> <span class="comment"> *******************************************************/</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> <span class="keywordtype">int</span> distance_compute_blas_threshold = 20;</div>
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span> </div>
<div class="line"><a name="l00624"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a880c7318971f866267a86945aaa61b17"> 624</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#a880c7318971f866267a86945aaa61b17">knn_inner_product</a> (<span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <a class="code" href="structfaiss_1_1HeapArray.html">float_minheap_array_t</a> * res)</div>
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span> {</div>
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">if</span> (d % 4 == 0 && nx < distance_compute_blas_threshold) {</div>
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  knn_inner_product_sse (x, y, d, nx, ny, res);</div>
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  knn_inner_product_blas (x, y, d, nx, ny, res);</div>
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  }</div>
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span> }</div>
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span> </div>
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span> </div>
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span> </div>
<div class="line"><a name="l00638"></a><span class="lineno"><a class="line" href="structfaiss_1_1NopDistanceCorrection.html"> 638</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1NopDistanceCorrection.html">NopDistanceCorrection</a> {</div>
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordtype">float</span> operator()(<span class="keywordtype">float</span> dis, <span class="keywordtype">size_t</span> <span class="comment">/*qno*/</span>, <span class="keywordtype">size_t</span> <span class="comment">/*bno*/</span>)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">return</span> dis;</div>
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  }</div>
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span> };</div>
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span> </div>
<div class="line"><a name="l00644"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a2f803e3d3b07cfab63699c89de161237"> 644</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#a2f803e3d3b07cfab63699c89de161237">knn_L2sqr</a> (<span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <a class="code" href="structfaiss_1_1HeapArray.html">float_maxheap_array_t</a> * res)</div>
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span> {</div>
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordflow">if</span> (d % 4 == 0 && nx < distance_compute_blas_threshold) {</div>
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  knn_L2sqr_sse (x, y, d, nx, ny, res);</div>
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <a class="code" href="structfaiss_1_1NopDistanceCorrection.html">NopDistanceCorrection</a> nop;</div>
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  knn_L2sqr_blas (x, y, d, nx, ny, res, nop);</div>
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  }</div>
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span> }</div>
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span> </div>
<div class="line"><a name="l00657"></a><span class="lineno"><a class="line" href="structfaiss_1_1BaseShiftDistanceCorrection.html"> 657</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1BaseShiftDistanceCorrection.html">BaseShiftDistanceCorrection</a> {</div>
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *base_shift;</div>
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keywordtype">float</span> operator()(<span class="keywordtype">float</span> dis, <span class="keywordtype">size_t</span> <span class="comment">/*qno*/</span>, <span class="keywordtype">size_t</span> bno)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">return</span> dis - base_shift[bno];</div>
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div>
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span> };</div>
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span> </div>
<div class="line"><a name="l00664"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a5eb1701e46123827966f2a56da893d1d"> 664</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#a5eb1701e46123827966f2a56da893d1d">knn_L2sqr_base_shift</a> (</div>
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <a class="code" href="structfaiss_1_1HeapArray.html">float_maxheap_array_t</a> * res,</div>
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *base_shift)</div>
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span> {</div>
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <a class="code" href="structfaiss_1_1BaseShiftDistanceCorrection.html">BaseShiftDistanceCorrection</a> corr = {base_shift};</div>
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  knn_L2sqr_blas (x, y, d, nx, ny, res, corr);</div>
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span> }</div>
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span> </div>
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span> </div>
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span> </div>
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="comment">/***************************************************************************</span></div>
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="comment"> * compute a subset of distances</span></div>
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="comment"> ***************************************************************************/</span></div>
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span> </div>
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="comment">/* compute the inner product between x and a subset y of ny vectors,</span></div>
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span> <span class="comment"> whose indices are given by idy. */</span></div>
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span> <span class="keywordtype">void</span> fvec_inner_products_by_idx (<span class="keywordtype">float</span> * __restrict ip,</div>
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * __restrict ids, <span class="comment">/* for y vecs */</span></div>
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny)</div>
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span> {</div>
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nx; j++) {</div>
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * __restrict idsj = ids + j * ny;</div>
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * xj = x + j * d;</div>
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordtype">float</span> * __restrict ipj = ip + j * ny;</div>
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < ny; i++) {</div>
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">if</span> (idsj[i] < 0)</div>
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  ipj[i] = fvec_inner_product (xj, y + d * idsj[i], d);</div>
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  }</div>
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  }</div>
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span> }</div>
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span> </div>
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="comment">/* compute the inner product between x and a subset y of ny vectors,</span></div>
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="comment"> whose indices are given by idy. */</span></div>
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span> <span class="keywordtype">void</span> fvec_L2sqr_by_idx (<span class="keywordtype">float</span> * __restrict dis,</div>
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * __restrict ids, <span class="comment">/* ids of y vecs */</span></div>
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny)</div>
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span> {</div>
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nx; j++) {</div>
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * __restrict idsj = ids + j * ny;</div>
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * xj = x + j * d;</div>
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordtype">float</span> * __restrict disj = dis + j * ny;</div>
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < ny; i++) {</div>
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">if</span> (idsj[i] < 0)</div>
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  disj[i] = <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a> (xj, y + d * idsj[i], d);</div>
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div>
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  }</div>
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span> }</div>
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span> </div>
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span> </div>
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span> </div>
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span> </div>
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span> </div>
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span> <span class="comment">/* Find the nearest neighbors for nx queries in a set of ny vectors</span></div>
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span> <span class="comment"> indexed by ids. May be useful for re-ranking a pre-selected vector list */</span></div>
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span> <span class="keywordtype">void</span> knn_inner_products_by_idx (<span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * ids,</div>
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  float_minheap_array_t * res)</div>
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span> {</div>
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keywordtype">size_t</span> k = res->k;</div>
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span> </div>
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < nx; i++) {</div>
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x_ = x + i * d;</div>
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * idsi = ids + i * ny;</div>
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordtype">size_t</span> j;</div>
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordtype">float</span> * __restrict simi = res->get_val(i);</div>
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordtype">long</span> * __restrict idxi = res->get_ids (i);</div>
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  minheap_heapify (k, simi, idxi);</div>
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span> </div>
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keywordflow">for</span> (j = 0; j < ny; j++) {</div>
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordflow">if</span> (idsi[j] < 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordtype">float</span> ip = fvec_inner_product (x_, y + d * idsi[j], d);</div>
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span> </div>
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keywordflow">if</span> (ip > simi[0]) {</div>
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  minheap_pop (k, simi, idxi);</div>
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  minheap_push (k, simi, idxi, ip, idsi[j]);</div>
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  }</div>
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  }</div>
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  minheap_reorder (k, simi, idxi);</div>
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  }</div>
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span> </div>
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span> }</div>
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span> </div>
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="keywordtype">void</span> knn_L2sqr_by_idx (<span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * __restrict ids,</div>
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  float_maxheap_array_t * res)</div>
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span> {</div>
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keywordtype">size_t</span> k = res->k;</div>
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span> </div>
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < nx; i++) {</div>
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x_ = x + i * d;</div>
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> * __restrict idsi = ids + i * ny;</div>
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keywordtype">float</span> * __restrict simi = res->get_val(i);</div>
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keywordtype">long</span> * __restrict idxi = res->get_ids (i);</div>
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  maxheap_heapify (res->k, simi, idxi);</div>
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < ny; j++) {</div>
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordtype">float</span> disij = <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a> (x_, y + d * idsi[j], d);</div>
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span> </div>
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">if</span> (disij < simi[0]) {</div>
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  maxheap_pop (k, simi, idxi);</div>
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  maxheap_push (k, simi, idxi, disij, idsi[j]);</div>
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  }</div>
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  }</div>
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  maxheap_reorder (res->k, simi, idxi);</div>
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  }</div>
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span> </div>
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span> }</div>
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span> </div>
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span> </div>
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span> </div>
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span> </div>
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span> </div>
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span> <span class="comment">/***************************************************************************</span></div>
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span> <span class="comment"> * Range search</span></div>
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span> <span class="comment"> ***************************************************************************/</span></div>
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span> <span class="comment"></span></div>
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span> <span class="comment">/** Find the nearest neighbors for nx queries in a set of ny vectors</span></div>
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span> <span class="comment"> * compute_l2 = compute pairwise squared L2 distance rather than inner prod</span></div>
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> compute_l2></div>
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span> <span class="keyword">static</span> <span class="keywordtype">void</span> range_search_blas (</div>
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordtype">float</span> radius,</div>
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  RangeSearchResult *result)</div>
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span> {</div>
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span> </div>
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="comment">// BLAS does not like empty matrices</span></div>
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keywordflow">if</span> (nx == 0 || ny == 0) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span> </div>
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="comment">/* block sizes */</span></div>
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> bs_x = 4096, bs_y = 1024;</div>
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="comment">// const size_t bs_x = 16, bs_y = 16;</span></div>
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keywordtype">float</span> *ip_block = <span class="keyword">new</span> <span class="keywordtype">float</span>[bs_x * bs_y];</div>
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  ScopeDeleter<float> del0(ip_block);</div>
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span> </div>
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordtype">float</span> *x_norms = <span class="keyword">nullptr</span>, *y_norms = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  ScopeDeleter<float> del1, del2;</div>
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keywordflow">if</span> (compute_l2) {</div>
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  x_norms = <span class="keyword">new</span> <span class="keywordtype">float</span>[nx];</div>
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  del1.set (x_norms);</div>
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  fvec_norms_L2sqr (x_norms, x, d, nx);</div>
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span> </div>
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  y_norms = <span class="keyword">new</span> <span class="keywordtype">float</span>[ny];</div>
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  del2.set (y_norms);</div>
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  fvec_norms_L2sqr (y_norms, y, d, ny);</div>
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  }</div>
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span> </div>
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  std::vector <RangeSearchPartialResult *> partial_results;</div>
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span> </div>
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j0 = 0; j0 < ny; j0 += bs_y) {</div>
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keywordtype">size_t</span> j1 = j0 + bs_y;</div>
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keywordflow">if</span> (j1 > ny) j1 = ny;</div>
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  RangeSearchPartialResult * pres = <span class="keyword">new</span> RangeSearchPartialResult (result);</div>
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  partial_results.push_back (pres);</div>
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span> </div>
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i0 = 0; i0 < nx; i0 += bs_x) {</div>
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordtype">size_t</span> i1 = i0 + bs_x;</div>
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keywordflow">if</span>(i1 > nx) i1 = nx;</div>
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span> </div>
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="comment">/* compute the actual dot products */</span></div>
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  {</div>
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordtype">float</span> one = 1, zero = 0;</div>
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  FINTEGER nyi = j1 - j0, nxi = i1 - i0, di = d;</div>
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  sgemm_ (<span class="stringliteral">"Transpose"</span>, <span class="stringliteral">"Not transpose"</span>, &nyi, &nxi, &di, &one,</div>
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  y + j0 * d, &di,</div>
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  x + i0 * d, &di, &zero,</div>
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  ip_block, &nyi);</div>
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  }</div>
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span> </div>
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span> </div>
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = i0; i < i1; i++) {</div>
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *ip_line = ip_block + (i - i0) * (j1 - j0);</div>
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span> </div>
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  RangeQueryResult & qres = pres->new_result (i);</div>
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span> </div>
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = j0; j < j1; j++) {</div>
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordtype">float</span> ip = *ip_line++;</div>
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordflow">if</span> (compute_l2) {</div>
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keywordtype">float</span> dis = x_norms[i] + y_norms[j] - 2 * ip;</div>
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">if</span> (dis < radius) {</div>
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  qres.add (dis, j);</div>
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  }</div>
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keywordflow">if</span> (ip > radius) {</div>
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  qres.add (ip, j);</div>
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  }</div>
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  }</div>
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  }</div>
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  }</div>
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  }</div>
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  InterruptCallback::check ();</div>
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  }</div>
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span> </div>
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  RangeSearchPartialResult::merge (partial_results);</div>
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span> }</div>
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span> </div>
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span> </div>
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> compute_l2></div>
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span> <span class="keyword">static</span> <span class="keywordtype">void</span> range_search_sse (<span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="keywordtype">float</span> radius,</div>
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  RangeSearchResult *res)</div>
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span> {</div>
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  FAISS_THROW_IF_NOT (d % 4 == 0);</div>
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span> </div>
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keywordtype">size_t</span> check_period = InterruptCallback::get_period_hint (ny * d);</div>
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keywordtype">bool</span> interrupted = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span> </div>
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span> <span class="preprocessor">#pragma omp parallel</span></div>
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  RangeSearchPartialResult pres (res);</div>
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span> </div>
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i0 = 0; i0 < nx; i0 += check_period) {</div>
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordtype">size_t</span> i1 = std::min(i0 + check_period, nx);</div>
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span> </div>
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span> <span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = i0; i < i1; i++) {</div>
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x_ = x + i * d;</div>
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y_ = y;</div>
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keywordtype">size_t</span> j;</div>
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span> </div>
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  RangeQueryResult & qres = pres.new_result (i);</div>
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span> </div>
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">for</span> (j = 0; j < ny; j++) {</div>
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="keywordflow">if</span> (compute_l2) {</div>
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="keywordtype">float</span> disij = <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a> (x_, y_, d);</div>
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">if</span> (disij < radius) {</div>
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  qres.add (disij, j);</div>
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  }</div>
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordtype">float</span> ip = fvec_inner_product (x_, y_, d);</div>
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">if</span> (ip > radius) {</div>
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  qres.add (ip, j);</div>
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  }</div>
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  }</div>
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  y_ += d;</div>
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  }</div>
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span> </div>
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  }</div>
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span> </div>
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keywordflow">if</span> (InterruptCallback::is_interrupted ()) {</div>
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  interrupted = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  }</div>
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span> </div>
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="preprocessor">#pragma omp barrier</span></div>
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span> <span class="preprocessor"></span> <span class="keywordflow">if</span> (interrupted) {</div>
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  }</div>
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  }</div>
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  pres.finalize ();</div>
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  }</div>
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span> </div>
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordflow">if</span> (interrupted) {</div>
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  FAISS_THROW_MSG (<span class="stringliteral">"computation interrupted"</span>);</div>
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  }</div>
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span> }</div>
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span> </div>
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span> </div>
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span> </div>
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span> </div>
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span> </div>
<div class="line"><a name="l00944"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a1faa7bd079c9b1addf3058ddf882a000"> 944</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#a1faa7bd079c9b1addf3058ddf882a000">range_search_L2sqr</a> (</div>
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keywordtype">float</span> radius,</div>
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <a class="code" href="structfaiss_1_1RangeSearchResult.html">RangeSearchResult</a> *res)</div>
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span> {</div>
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span> </div>
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keywordflow">if</span> (d % 4 == 0 && nx < distance_compute_blas_threshold) {</div>
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  range_search_sse<true> (x, y, d, nx, ny, radius, res);</div>
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  range_search_blas<true> (x, y, d, nx, ny, radius, res);</div>
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  }</div>
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span> }</div>
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span> </div>
<div class="line"><a name="l00959"></a><span class="lineno"><a class="line" href="namespacefaiss.html#ab29d725b808df6f142b80f21aa45e507"> 959</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#ab29d725b808df6f142b80f21aa45e507">range_search_inner_product</a> (</div>
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * y,</div>
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> nx, <span class="keywordtype">size_t</span> ny,</div>
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keywordtype">float</span> radius,</div>
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <a class="code" href="structfaiss_1_1RangeSearchResult.html">RangeSearchResult</a> *res)</div>
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span> {</div>
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span> </div>
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordflow">if</span> (d % 4 == 0 && nx < distance_compute_blas_threshold) {</div>
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  range_search_sse<false> (x, y, d, nx, ny, radius, res);</div>
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  range_search_blas<false> (x, y, d, nx, ny, radius, res);</div>
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  }</div>
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span> }</div>
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span> </div>
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span> </div>
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span> </div>
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span> <span class="comment">/***************************************************************************</span></div>
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span> <span class="comment"> * Some matrix manipulation functions</span></div>
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="comment"> ***************************************************************************/</span></div>
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span> </div>
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span> </div>
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span> <span class="comment">/* This function exists because the Torch counterpart is extremly slow</span></div>
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="comment"> (not multi-threaded + unexpected overhead even in single thread).</span></div>
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span> <span class="comment"> It is here to implement the usual property |x-y|^2=|x|^2+|y|^2-2<x|y> */</span></div>
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span> <span class="keywordtype">void</span> inner_product_to_L2sqr (<span class="keywordtype">float</span> * __restrict dis,</div>
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * nr1,</div>
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> * nr2,</div>
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keywordtype">size_t</span> n1, <span class="keywordtype">size_t</span> n2)</div>
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span> {</div>
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span> </div>
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0 ; j < n1 ; j++) {</div>
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keywordtype">float</span> * disj = dis + j * n2;</div>
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0 ; i < n2 ; i++)</div>
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  disj[i] = nr1[j] + nr2[i] - 2 * disj[i];</div>
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  }</div>
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span> }</div>
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span> </div>
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span> </div>
<div class="line"><a name="l00999"></a><span class="lineno"><a class="line" href="namespacefaiss.html#afb68fe89ad5e948974da1b70d7b4157c"> 999</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#afb68fe89ad5e948974da1b70d7b4157c">matrix_qr</a> (<span class="keywordtype">int</span> m, <span class="keywordtype">int</span> n, <span class="keywordtype">float</span> *a)</div>
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> {</div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  FAISS_THROW_IF_NOT (m >= n);</div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  FINTEGER mi = m, ni = n, ki = mi < ni ? mi : ni;</div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  std::vector<float> tau (ki);</div>
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  FINTEGER lwork = -1, info;</div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keywordtype">float</span> work_size;</div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> </div>
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  sgeqrf_ (&mi, &ni, a, &mi, tau.data(),</div>
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  &work_size, &lwork, &info);</div>
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  lwork = size_t(work_size);</div>
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  std::vector<float> work (lwork);</div>
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span> </div>
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  sgeqrf_ (&mi, &ni, a, &mi,</div>
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  tau.data(), work.data(), &lwork, &info);</div>
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> </div>
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  sorgqr_ (&mi, &ni, &ki, a, &mi, tau.data(),</div>
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  work.data(), &lwork, &info);</div>
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> </div>
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> }</div>
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span> </div>
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> </div>
<div class="line"><a name="l01021"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a3d9c7db82d43c1f0ab1d28b92bc9fe57"> 1021</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#a3d9c7db82d43c1f0ab1d28b92bc9fe57">pairwise_L2sqr</a> (<span class="keywordtype">long</span> d,</div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keywordtype">long</span> nq, <span class="keyword">const</span> <span class="keywordtype">float</span> *xq,</div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordtype">long</span> nb, <span class="keyword">const</span> <span class="keywordtype">float</span> *xb,</div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="keywordtype">float</span> *dis,</div>
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keywordtype">long</span> ldq, <span class="keywordtype">long</span> ldb, <span class="keywordtype">long</span> ldd)</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> {</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="keywordflow">if</span> (nq == 0 || nb == 0) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">if</span> (ldq == -1) ldq = d;</div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">if</span> (ldb == -1) ldb = d;</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keywordflow">if</span> (ldd == -1) ldd = nb;</div>
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span> </div>
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="comment">// store in beginning of distance matrix to avoid malloc</span></div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="keywordtype">float</span> *b_norms = dis;</div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> </div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">long</span> i = 0; i < nb; i++)</div>
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  b_norms [i] = <a class="code" href="namespacefaiss.html#a7a49180ebf10e643217bbce5862c7f84">fvec_norm_L2sqr</a> (xb + i * ldb, d);</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span> </div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">long</span> i = 1; i < nq; i++) {</div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordtype">float</span> q_norm = <a class="code" href="namespacefaiss.html#a7a49180ebf10e643217bbce5862c7f84">fvec_norm_L2sqr</a> (xq + i * ldq, d);</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="keywordflow">for</span> (<span class="keywordtype">long</span> j = 0; j < nb; j++)</div>
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  dis[i * ldd + j] = q_norm + b_norms [j];</div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  }</div>
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span> </div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  {</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordtype">float</span> q_norm = <a class="code" href="namespacefaiss.html#a7a49180ebf10e643217bbce5862c7f84">fvec_norm_L2sqr</a> (xq, d);</div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="keywordflow">for</span> (<span class="keywordtype">long</span> j = 0; j < nb; j++)</div>
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  dis[j] += q_norm;</div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  }</div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span> </div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  {</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  FINTEGER nbi = nb, nqi = nq, di = d, ldqi = ldq, ldbi = ldb, lddi = ldd;</div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keywordtype">float</span> one = 1.0, minus_2 = -2.0;</div>
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> </div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  sgemm_ (<span class="stringliteral">"Transposed"</span>, <span class="stringliteral">"Not transposed"</span>,</div>
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  &nbi, &nqi, &di,</div>
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  &minus_2,</div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  xb, &ldbi,</div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  xq, &ldqi,</div>
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  &one, dis, &lddi);</div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  }</div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> </div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> </div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> }</div>
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> </div>
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> </div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> </div>
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> <span class="comment">/***************************************************************************</span></div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> <span class="comment"> * Kmeans subroutine</span></div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span> <span class="comment"> ***************************************************************************/</span></div>
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span> </div>
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span> <span class="comment">// a bit above machine epsilon for float16</span></div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span> </div>
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> <span class="preprocessor">#define EPS (1 / 1024.)</span></div>
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span> <span class="comment">/* For k-means, compute centroids given assignment of vectors to centroids */</span></div>
<div class="line"><a name="l01078"></a><span class="lineno"><a class="line" href="namespacefaiss.html#aa2c6a9e87a64bba8e8014e14f70bde21"> 1078</a></span> <span class="keywordtype">int</span> <a class="code" href="namespacefaiss.html#aa2c6a9e87a64bba8e8014e14f70bde21">km_update_centroids</a> (<span class="keyword">const</span> <span class="keywordtype">float</span> * x,</div>
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keywordtype">float</span> * centroids,</div>
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keywordtype">long</span> * assign,</div>
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> k, <span class="keywordtype">size_t</span> n,</div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordtype">size_t</span> k_frozen)</div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span> {</div>
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  k -= k_frozen;</div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  centroids += k_frozen * d;</div>
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span> </div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  std::vector<size_t> hassign(k);</div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  memset (centroids, 0, <span class="keyword">sizeof</span>(*centroids) * d * k);</div>
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> </div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> <span class="preprocessor">#pragma omp parallel</span></div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keywordtype">int</span> nt = omp_get_num_threads();</div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordtype">int</span> rank = omp_get_thread_num();</div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="comment">// this thread is taking care of centroids c0:c1</span></div>
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keywordtype">size_t</span> c0 = (k * rank) / nt;</div>
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keywordtype">size_t</span> c1 = (k * (rank + 1)) / nt;</div>
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *xi = x;</div>
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keywordtype">size_t</span> nacc = 0;</div>
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span> </div>
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++) {</div>
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordtype">long</span> ci = assign[i];</div>
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  assert (ci >= 0 && ci < k + k_frozen);</div>
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  ci -= k_frozen;</div>
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <span class="keywordflow">if</span> (ci >= c0 && ci < c1) {</div>
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordtype">float</span> * c = centroids + ci * d;</div>
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  hassign[ci]++;</div>
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < d; j++)</div>
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  c[j] += xi[j];</div>
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  nacc++;</div>
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  }</div>
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  xi += d;</div>
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  }</div>
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span> </div>
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  }</div>
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span> </div>
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> ci = 0; ci < k; ci++) {</div>
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordtype">float</span> * c = centroids + ci * d;</div>
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="keywordtype">float</span> ni = (float) hassign[ci];</div>
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="keywordflow">if</span> (ni != 0) {</div>
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < d; j++)</div>
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  c[j] /= ni;</div>
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  }</div>
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  }</div>
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> </div>
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="comment">/* Take care of void clusters */</span></div>
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keywordtype">size_t</span> nsplit = 0;</div>
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <a class="code" href="structfaiss_1_1RandomGenerator.html">RandomGenerator</a> rng (1234);</div>
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> ci = 0; ci < k; ci++) {</div>
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="keywordflow">if</span> (hassign[ci] == 0) { <span class="comment">/* need to redefine a centroid */</span></div>
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <span class="keywordtype">size_t</span> cj;</div>
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="keywordflow">for</span> (cj = 0; 1; cj = (cj + 1) % k) {</div>
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="comment">/* probability to pick this cluster for split */</span></div>
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordtype">float</span> p = (hassign[cj] - 1.0) / (float) (n - k);</div>
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="keywordtype">float</span> r = rng.<a class="code" href="structfaiss_1_1RandomGenerator.html#ac82a433d7bfa56d750907ba5cf74aed7">rand_float</a> ();</div>
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="keywordflow">if</span> (r < p) {</div>
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keywordflow">break</span>; <span class="comment">/* found our cluster to be split */</span></div>
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  }</div>
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  }</div>
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  memcpy (centroids+ci*d, centroids+cj*d, <span class="keyword">sizeof</span>(*centroids) * d);</div>
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span> </div>
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="comment">/* small symmetric pertubation. Much better than */</span></div>
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < d; j++) {</div>
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keywordflow">if</span> (j % 2 == 0) {</div>
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  centroids[ci * d + j] *= 1 + EPS;</div>
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  centroids[cj * d + j] *= 1 - EPS;</div>
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  centroids[ci * d + j] *= 1 - EPS;</div>
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  centroids[cj * d + j] *= 1 + EPS;</div>
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  }</div>
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  }</div>
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span> </div>
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="comment">/* assume even split of the cluster */</span></div>
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  hassign[ci] = hassign[cj] / 2;</div>
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  hassign[cj] -= hassign[ci];</div>
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  nsplit++;</div>
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  }</div>
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  }</div>
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> </div>
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="keywordflow">return</span> nsplit;</div>
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> }</div>
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> </div>
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> <span class="preprocessor">#undef EPS</span></div>
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> </div>
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span> </div>
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> <span class="comment">/***************************************************************************</span></div>
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span> <span class="comment"> * Result list routines</span></div>
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span> <span class="comment"> ***************************************************************************/</span></div>
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span> </div>
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> </div>
<div class="line"><a name="l01172"></a><span class="lineno"><a class="line" href="namespacefaiss.html#ae0ee1b6fbd3d6da0f1a3550a780ca24c"> 1172</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#ae0ee1b6fbd3d6da0f1a3550a780ca24c">ranklist_handle_ties</a> (<span class="keywordtype">int</span> k, <span class="keywordtype">long</span> *idx, <span class="keyword">const</span> <span class="keywordtype">float</span> *dis)</div>
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> {</div>
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="keywordtype">float</span> prev_dis = -1e38;</div>
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keywordtype">int</span> prev_i = -1;</div>
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < k; i++) {</div>
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="keywordflow">if</span> (dis[i] != prev_dis) {</div>
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="keywordflow">if</span> (i > prev_i + 1) {</div>
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="comment">// sort between prev_i and i - 1</span></div>
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  std::sort (idx + prev_i, idx + i);</div>
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  }</div>
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  prev_i = i;</div>
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  prev_dis = dis[i];</div>
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  }</div>
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  }</div>
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span> }</div>
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span> </div>
<div class="line"><a name="l01188"></a><span class="lineno"><a class="line" href="namespacefaiss.html#afb7b33f6892678ba79aaf5e71777837c"> 1188</a></span> <span class="keywordtype">size_t</span> <a class="code" href="namespacefaiss.html#afb7b33f6892678ba79aaf5e71777837c">merge_result_table_with</a> (<span class="keywordtype">size_t</span> n, <span class="keywordtype">size_t</span> k,</div>
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keywordtype">long</span> *I0, <span class="keywordtype">float</span> *D0,</div>
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> *I1, <span class="keyword">const</span> <span class="keywordtype">float</span> *D1,</div>
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="keywordtype">bool</span> keep_min,</div>
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="keywordtype">long</span> translation)</div>
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span> {</div>
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keywordtype">size_t</span> n1 = 0;</div>
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span> </div>
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> <span class="preprocessor">#pragma omp parallel reduction(+:n1)</span></div>
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  std::vector<long> tmpI (k);</div>
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  std::vector<float> tmpD (k);</div>
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span> </div>
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span> <span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++) {</div>
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keywordtype">long</span> *lI0 = I0 + i * k;</div>
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <span class="keywordtype">float</span> *lD0 = D0 + i * k;</div>
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> *lI1 = I1 + i * k;</div>
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *lD1 = D1 + i * k;</div>
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="keywordtype">size_t</span> r0 = 0;</div>
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keywordtype">size_t</span> r1 = 0;</div>
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> </div>
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <span class="keywordflow">if</span> (keep_min) {</div>
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < k; j++) {</div>
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> </div>
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  <span class="keywordflow">if</span> (lI0[r0] >= 0 && lD0[r0] < lD1[r1]) {</div>
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  tmpD[j] = lD0[r0];</div>
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  tmpI[j] = lI0[r0];</div>
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  r0++;</div>
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (lD1[r1] >= 0) {</div>
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  tmpD[j] = lD1[r1];</div>
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  tmpI[j] = lI1[r1] + translation;</div>
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  r1++;</div>
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  } <span class="keywordflow">else</span> { <span class="comment">// both are NaNs</span></div>
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  tmpD[j] = NAN;</div>
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  tmpI[j] = -1;</div>
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  }</div>
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  }</div>
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < k; j++) {</div>
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="keywordflow">if</span> (lI0[r0] >= 0 && lD0[r0] > lD1[r1]) {</div>
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  tmpD[j] = lD0[r0];</div>
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  tmpI[j] = lI0[r0];</div>
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  r0++;</div>
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (lD1[r1] >= 0) {</div>
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  tmpD[j] = lD1[r1];</div>
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  tmpI[j] = lI1[r1] + translation;</div>
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  r1++;</div>
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  } <span class="keywordflow">else</span> { <span class="comment">// both are NaNs</span></div>
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  tmpD[j] = NAN;</div>
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  tmpI[j] = -1;</div>
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  }</div>
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  }</div>
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  }</div>
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  n1 += r1;</div>
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  memcpy (lD0, tmpD.data(), <span class="keyword">sizeof</span> (lD0[0]) * k);</div>
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  memcpy (lI0, tmpI.data(), <span class="keyword">sizeof</span> (lI0[0]) * k);</div>
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  }</div>
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  }</div>
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span> </div>
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="keywordflow">return</span> n1;</div>
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> }</div>
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> </div>
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> </div>
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> </div>
<div class="line"><a name="l01253"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a8dbc652ba48d41f126b8815004899448"> 1253</a></span> <span class="keywordtype">size_t</span> <a class="code" href="namespacefaiss.html#a8dbc652ba48d41f126b8815004899448">ranklist_intersection_size</a> (<span class="keywordtype">size_t</span> k1, <span class="keyword">const</span> <span class="keywordtype">long</span> *v1,</div>
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  <span class="keywordtype">size_t</span> k2, <span class="keyword">const</span> <span class="keywordtype">long</span> *v2_in)</div>
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span> {</div>
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keywordflow">if</span> (k2 > k1) <span class="keywordflow">return</span> <a class="code" href="namespacefaiss.html#a8dbc652ba48d41f126b8815004899448">ranklist_intersection_size</a> (k2, v2_in, k1, v1);</div>
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  <span class="keywordtype">long</span> *v2 = <span class="keyword">new</span> <span class="keywordtype">long</span> [k2];</div>
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  memcpy (v2, v2_in, <span class="keyword">sizeof</span> (<span class="keywordtype">long</span>) * k2);</div>
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  std::sort (v2, v2 + k2);</div>
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  { <span class="comment">// de-dup v2</span></div>
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keywordtype">long</span> prev = -1;</div>
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  <span class="keywordtype">size_t</span> wp = 0;</div>
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < k2; i++) {</div>
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  <span class="keywordflow">if</span> (v2 [i] != prev) {</div>
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  v2[wp++] = prev = v2 [i];</div>
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  }</div>
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  }</div>
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  k2 = wp;</div>
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  }</div>
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> seen_flag = 1L << 60;</div>
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  <span class="keywordtype">size_t</span> count = 0;</div>
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < k1; i++) {</div>
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keywordtype">long</span> q = v1 [i];</div>
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="keywordtype">size_t</span> i0 = 0, i1 = k2;</div>
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  <span class="keywordflow">while</span> (i0 + 1 < i1) {</div>
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  <span class="keywordtype">size_t</span> imed = (i1 + i0) / 2;</div>
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keywordtype">long</span> piv = v2 [imed] & ~seen_flag;</div>
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="keywordflow">if</span> (piv <= q) i0 = imed;</div>
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="keywordflow">else</span> i1 = imed;</div>
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  }</div>
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="keywordflow">if</span> (v2 [i0] == q) {</div>
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  count++;</div>
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  v2 [i0] |= seen_flag;</div>
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  }</div>
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  }</div>
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <span class="keyword">delete</span> [] v2;</div>
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> </div>
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="keywordflow">return</span> count;</div>
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> }</div>
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span> </div>
<div class="line"><a name="l01291"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a94c1d99ac39d22e362aa27ce7c7ff714"> 1291</a></span> <span class="keywordtype">double</span> <a class="code" href="namespacefaiss.html#a94c1d99ac39d22e362aa27ce7c7ff714">imbalance_factor</a> (<span class="keywordtype">int</span> k, <span class="keyword">const</span> <span class="keywordtype">int</span> *hist) {</div>
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keywordtype">double</span> tot = 0, uf = 0;</div>
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> </div>
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0 ; i < k ; i++) {</div>
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  tot += hist[i];</div>
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  uf += hist[i] * (double) hist[i];</div>
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  }</div>
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  uf = uf * k / (tot * tot);</div>
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span> </div>
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <span class="keywordflow">return</span> uf;</div>
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span> }</div>
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span> </div>
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span> </div>
<div class="line"><a name="l01304"></a><span class="lineno"><a class="line" href="namespacefaiss.html#af762526714e6138009c72aee98657538"> 1304</a></span> <span class="keywordtype">double</span> <a class="code" href="namespacefaiss.html#a94c1d99ac39d22e362aa27ce7c7ff714">imbalance_factor</a> (<span class="keywordtype">int</span> n, <span class="keywordtype">int</span> k, <span class="keyword">const</span> <span class="keywordtype">long</span> *assign) {</div>
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  std::vector<int> hist(k, 0);</div>
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  hist[assign[i]]++;</div>
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  }</div>
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span> </div>
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keywordflow">return</span> <a class="code" href="namespacefaiss.html#a94c1d99ac39d22e362aa27ce7c7ff714">imbalance_factor</a> (k, hist.data());</div>
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span> }</div>
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span> </div>
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span> </div>
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> </div>
<div class="line"><a name="l01315"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a7bea462108bee98d8d5859b51ec4db8e"> 1315</a></span> <span class="keywordtype">int</span> <a class="code" href="namespacefaiss.html#a7bea462108bee98d8d5859b51ec4db8e">ivec_hist</a> (<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">int</span> * v, <span class="keywordtype">int</span> vmax, <span class="keywordtype">int</span> *hist) {</div>
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  memset (hist, 0, <span class="keyword">sizeof</span>(hist[0]) * vmax);</div>
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="keywordtype">int</span> nout = 0;</div>
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="keywordflow">while</span> (n--) {</div>
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="keywordflow">if</span> (v[n] < 0 || v[n] >= vmax) nout++;</div>
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <span class="keywordflow">else</span> hist[v[n]]++;</div>
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  }</div>
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="keywordflow">return</span> nout;</div>
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span> }</div>
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span> </div>
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span> </div>
<div class="line"><a name="l01326"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a154a47857ed321b9db91122770a16e09"> 1326</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#a154a47857ed321b9db91122770a16e09">bincode_hist</a>(<span class="keywordtype">size_t</span> n, <span class="keywordtype">size_t</span> nbits, <span class="keyword">const</span> uint8_t *codes, <span class="keywordtype">int</span> *hist)</div>
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> {</div>
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  FAISS_THROW_IF_NOT (nbits % 8 == 0);</div>
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <span class="keywordtype">size_t</span> d = nbits / 8;</div>
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  std::vector<int> accu(d * 256);</div>
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="keyword">const</span> uint8_t *c = codes;</div>
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++)</div>
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j < d; j++)</div>
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  accu[j * 256 + *c++]++;</div>
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  memset (hist, 0, <span class="keyword">sizeof</span>(*hist) * nbits);</div>
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < d; i++) {</div>
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> *ai = accu.data() + i * 256;</div>
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="keywordtype">int</span> * hi = hist + i * 8;</div>
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < 256; j++)</div>
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k < 8; k++)</div>
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keywordflow">if</span> ((j >> k) & 1)</div>
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  hi[k] += ai[j];</div>
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  }</div>
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span> </div>
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span> }</div>
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span> </div>
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span> </div>
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span> </div>
<div class="line"><a name="l01349"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a4369329c9dbdfe23e3f35d09ba7b5c6e"> 1349</a></span> <span class="keywordtype">size_t</span> <a class="code" href="namespacefaiss.html#a4369329c9dbdfe23e3f35d09ba7b5c6e">ivec_checksum</a> (<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">int</span> *a)</div>
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span> {</div>
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="keywordtype">size_t</span> cs = 112909;</div>
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  <span class="keywordflow">while</span> (n--) cs = cs * 65713 + a[n] * 1686049;</div>
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <span class="keywordflow">return</span> cs;</div>
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> }</div>
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span> </div>
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span> </div>
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span> <span class="keyword">namespace </span>{</div>
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="keyword">struct </span>ArgsortComparator {</div>
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> *vals;</div>
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="keywordtype">bool</span> operator() (<span class="keyword">const</span> <span class="keywordtype">size_t</span> a, <span class="keyword">const</span> <span class="keywordtype">size_t</span> b)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="keywordflow">return</span> vals[a] < vals[b];</div>
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  }</div>
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  };</div>
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span> </div>
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  <span class="keyword">struct </span>SegmentS {</div>
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <span class="keywordtype">size_t</span> i0; <span class="comment">// begin pointer in the permutation array</span></div>
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  <span class="keywordtype">size_t</span> i1; <span class="comment">// end</span></div>
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keywordtype">size_t</span> len()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keywordflow">return</span> i1 - i0;</div>
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  }</div>
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  };</div>
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span> </div>
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="comment">// see https://en.wikipedia.org/wiki/Merge_algorithm#Parallel_merge</span></div>
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <span class="comment">// extended to > 1 merge thread</span></div>
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span> </div>
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <span class="comment">// merges 2 ranges that should be consecutive on the source into</span></div>
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <span class="comment">// the union of the two on the destination</span></div>
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T></div>
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  <span class="keywordtype">void</span> parallel_merge (<span class="keyword">const</span> T *src, T *dst,</div>
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  SegmentS &s1, SegmentS & s2, <span class="keywordtype">int</span> nt,</div>
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="keyword">const</span> ArgsortComparator & comp) {</div>
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keywordflow">if</span> (s2.len() > s1.len()) { <span class="comment">// make sure that s1 larger than s2</span></div>
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  std::swap(s1, s2);</div>
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  }</div>
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span> </div>
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  <span class="comment">// compute sub-ranges for each thread</span></div>
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  SegmentS s1s[nt], s2s[nt], sws[nt];</div>
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  s2s[0].i0 = s2.i0;</div>
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  s2s[nt - 1].i1 = s2.i1;</div>
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span> </div>
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  <span class="comment">// not sure parallel actually helps here</span></div>
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span> <span class="preprocessor">#pragma omp parallel for num_threads(nt)</span></div>
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < nt; t++) {</div>
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  s1s[t].i0 = s1.i0 + s1.len() * t / nt;</div>
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  s1s[t].i1 = s1.i0 + s1.len() * (t + 1) / nt;</div>
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> </div>
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  <span class="keywordflow">if</span> (t + 1 < nt) {</div>
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  T pivot = src[s1s[t].i1];</div>
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  <span class="keywordtype">size_t</span> i0 = s2.i0, i1 = s2.i1;</div>
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  <span class="keywordflow">while</span> (i0 + 1 < i1) {</div>
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="keywordtype">size_t</span> imed = (i1 + i0) / 2;</div>
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  <span class="keywordflow">if</span> (comp (pivot, src[imed])) {i1 = imed; }</div>
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  <span class="keywordflow">else</span> {i0 = imed; }</div>
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  }</div>
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  s2s[t].i1 = s2s[t + 1].i0 = i1;</div>
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  }</div>
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  }</div>
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  s1.i0 = std::min(s1.i0, s2.i0);</div>
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  s1.i1 = std::max(s1.i1, s2.i1);</div>
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  s2 = s1;</div>
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  sws[0].i0 = s1.i0;</div>
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < nt; t++) {</div>
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  sws[t].i1 = sws[t].i0 + s1s[t].len() + s2s[t].len();</div>
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <span class="keywordflow">if</span> (t + 1 < nt) {</div>
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  sws[t + 1].i0 = sws[t].i1;</div>
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  }</div>
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  }</div>
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  assert(sws[nt - 1].i1 == s1.i1);</div>
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span> </div>
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  <span class="comment">// do the actual merging</span></div>
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span> <span class="preprocessor">#pragma omp parallel for num_threads(nt)</span></div>
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < nt; t++) {</div>
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  SegmentS sw = sws[t];</div>
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  SegmentS s1t = s1s[t];</div>
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  SegmentS s2t = s2s[t];</div>
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  <span class="keywordflow">if</span> (s1t.i0 < s1t.i1 && s2t.i0 < s2t.i1) {</div>
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  <span class="keywordflow">for</span> (;;) {</div>
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  <span class="comment">// assert (sw.len() == s1t.len() + s2t.len());</span></div>
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  <span class="keywordflow">if</span> (comp(src[s1t.i0], src[s2t.i0])) {</div>
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  dst[sw.i0++] = src[s1t.i0++];</div>
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="keywordflow">if</span> (s1t.i0 == s1t.i1) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  dst[sw.i0++] = src[s2t.i0++];</div>
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="keywordflow">if</span> (s2t.i0 == s2t.i1) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  }</div>
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  }</div>
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  }</div>
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  <span class="keywordflow">if</span> (s1t.len() > 0) {</div>
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  assert(s1t.len() == sw.len());</div>
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  memcpy(dst + sw.i0, src + s1t.i0, s1t.len() * <span class="keyword">sizeof</span>(dst[0]));</div>
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s2t.len() > 0) {</div>
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  assert(s2t.len() == sw.len());</div>
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  memcpy(dst + sw.i0, src + s2t.i0, s2t.len() * <span class="keyword">sizeof</span>(dst[0]));</div>
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  }</div>
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  }</div>
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  }</div>
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span> </div>
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span> };</div>
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span> </div>
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span> <span class="keywordtype">void</span> fvec_argsort (<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *vals,</div>
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  <span class="keywordtype">size_t</span> *perm)</div>
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span> {</div>
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++) perm[i] = i;</div>
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  ArgsortComparator comp = {vals};</div>
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  std::sort (perm, perm + n, comp);</div>
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span> }</div>
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span> </div>
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span> <span class="keywordtype">void</span> fvec_argsort_parallel (<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *vals,</div>
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  <span class="keywordtype">size_t</span> *perm)</div>
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span> {</div>
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  <span class="keywordtype">size_t</span> * perm2 = <span class="keyword">new</span> <span class="keywordtype">size_t</span>[n];</div>
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  <span class="comment">// 2 result tables, during merging, flip between them</span></div>
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  <span class="keywordtype">size_t</span> *permB = perm2, *permA = perm;</div>
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span> </div>
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  <span class="keywordtype">int</span> nt = omp_get_max_threads();</div>
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  { <span class="comment">// prepare correct permutation so that the result ends in perm</span></div>
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  <span class="comment">// at final iteration</span></div>
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  <span class="keywordtype">int</span> nseg = nt;</div>
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  <span class="keywordflow">while</span> (nseg > 1) {</div>
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  nseg = (nseg + 1) / 2;</div>
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  std::swap (permA, permB);</div>
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  }</div>
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  }</div>
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span> </div>
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span> <span class="preprocessor">#pragma omp parallel</span></div>
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++) permA[i] = i;</div>
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span> </div>
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  ArgsortComparator comp = {vals};</div>
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span> </div>
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  SegmentS segs[nt];</div>
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span> </div>
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  <span class="comment">// independent sorts</span></div>
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span> <span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < nt; t++) {</div>
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  <span class="keywordtype">size_t</span> i0 = t * n / nt;</div>
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="keywordtype">size_t</span> i1 = (t + 1) * n / nt;</div>
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  SegmentS seg = {i0, i1};</div>
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  std::sort (permA + seg.i0, permA + seg.i1, comp);</div>
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  segs[t] = seg;</div>
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  }</div>
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  <span class="keywordtype">int</span> prev_nested = omp_get_nested();</div>
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  omp_set_nested(1);</div>
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span> </div>
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  <span class="keywordtype">int</span> nseg = nt;</div>
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  <span class="keywordflow">while</span> (nseg > 1) {</div>
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  <span class="keywordtype">int</span> nseg1 = (nseg + 1) / 2;</div>
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  <span class="keywordtype">int</span> sub_nt = nseg % 2 == 0 ? nt : nt - 1;</div>
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  <span class="keywordtype">int</span> sub_nseg1 = nseg / 2;</div>
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span> </div>
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> <span class="preprocessor">#pragma omp parallel for num_threads(nseg1)</span></div>
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> s = 0; s < nseg; s += 2) {</div>
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  <span class="keywordflow">if</span> (s + 1 == nseg) { <span class="comment">// otherwise isolated segment</span></div>
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  memcpy(permB + segs[s].i0, permA + segs[s].i0,</div>
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  segs[s].len() * <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>));</div>
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  <span class="keywordtype">int</span> t0 = s * sub_nt / sub_nseg1;</div>
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keywordtype">int</span> t1 = (s + 1) * sub_nt / sub_nseg1;</div>
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  printf(<span class="stringliteral">"merge %d %d, %d threads\n"</span>, s, s + 1, t1 - t0);</div>
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  parallel_merge(permA, permB, segs[s], segs[s + 1],</div>
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  t1 - t0, comp);</div>
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  }</div>
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  }</div>
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> s = 0; s < nseg; s += 2)</div>
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  segs[s / 2] = segs[s];</div>
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  nseg = nseg1;</div>
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  std::swap (permA, permB);</div>
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  }</div>
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  assert (permA == perm);</div>
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  omp_set_nested(prev_nested);</div>
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  <span class="keyword">delete</span> [] perm2;</div>
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span> }</div>
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span> </div>
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span> </div>
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span> </div>
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span> </div>
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span> </div>
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span> </div>
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span> </div>
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span> </div>
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span> </div>
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span> </div>
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span> </div>
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span> </div>
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span> </div>
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span> </div>
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span> </div>
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span> </div>
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span> </div>
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span> </div>
<div class="line"><a name="l01540"></a><span class="lineno"><a class="line" href="namespacefaiss.html#a14884d253128c7af5891a65082ad7dc6"> 1540</a></span> <span class="keyword">const</span> <span class="keywordtype">float</span> *<a class="code" href="namespacefaiss.html#a14884d253128c7af5891a65082ad7dc6">fvecs_maybe_subsample</a> (</div>
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> *n, <span class="keywordtype">size_t</span> nmax, <span class="keyword">const</span> <span class="keywordtype">float</span> *x,</div>
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  <span class="keywordtype">bool</span> verbose, <span class="keywordtype">long</span> seed)</div>
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span> {</div>
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span> </div>
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="keywordflow">if</span> (*n <= nmax) <span class="keywordflow">return</span> x; <span class="comment">// nothing to do</span></div>
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> </div>
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  <span class="keywordtype">size_t</span> n2 = nmax;</div>
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  <span class="keywordflow">if</span> (verbose) {</div>
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  printf (<span class="stringliteral">" Input training set too big (max size is %ld), sampling "</span></div>
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  <span class="stringliteral">"%ld / %ld vectors\n"</span>, nmax, n2, *n);</div>
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  }</div>
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  std::vector<int> subset (*n);</div>
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  rand_perm (subset.data (), *n, seed);</div>
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  <span class="keywordtype">float</span> *x_subset = <span class="keyword">new</span> <span class="keywordtype">float</span>[n2 * d];</div>
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  <span class="keywordflow">for</span> (<span class="keywordtype">long</span> i = 0; i < n2; i++)</div>
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  memcpy (&x_subset[i * d],</div>
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  &x[subset[i] * <span class="keywordtype">size_t</span>(d)],</div>
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <span class="keyword">sizeof</span> (x[0]) * d);</div>
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  *n = n2;</div>
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="keywordflow">return</span> x_subset;</div>
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span> }</div>
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span> </div>
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span> </div>
<div class="line"><a name="l01564"></a><span class="lineno"><a class="line" href="namespacefaiss.html#ac8260e10cfeed08a4344b85845773e16"> 1564</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#ac8260e10cfeed08a4344b85845773e16">binary_to_real</a>(<span class="keywordtype">size_t</span> d, <span class="keyword">const</span> uint8_t *x_in, <span class="keywordtype">float</span> *x_out) {</div>
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < d; ++i) {</div>
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  x_out[i] = 2 * ((x_in[i >> 3] >> (i & 7)) & 1) - 1;</div>
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  }</div>
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span> }</div>
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span> </div>
<div class="line"><a name="l01570"></a><span class="lineno"><a class="line" href="namespacefaiss.html#ab491c9e2f77a750c9f0324bfe00e3e57"> 1570</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacefaiss.html#ab491c9e2f77a750c9f0324bfe00e3e57">real_to_binary</a>(<span class="keywordtype">size_t</span> d, <span class="keyword">const</span> <span class="keywordtype">float</span> *x_in, uint8_t *x_out) {</div>
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < d / 8; ++i) {</div>
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  uint8_t b = 0;</div>
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < 8; ++j) {</div>
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  <span class="keywordflow">if</span> (x_in[8 * i + j] > 0) {</div>
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  b |= (1 << j);</div>
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  }</div>
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  }</div>
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  x_out[i] = b;</div>
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  }</div>
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span> }</div>
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span> </div>
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span> </div>
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span> <span class="comment">// from Python's stringobject.c</span></div>
<div class="line"><a name="l01584"></a><span class="lineno"><a class="line" href="namespacefaiss.html#abefd45801bab63d2eb71005ad7a51d32"> 1584</a></span> uint64_t <a class="code" href="namespacefaiss.html#abefd45801bab63d2eb71005ad7a51d32">hash_bytes</a> (<span class="keyword">const</span> uint8_t *bytes, <span class="keywordtype">long</span> n) {</div>
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  <span class="keyword">const</span> uint8_t *p = bytes;</div>
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  uint64_t x = (uint64_t)(*p) << 7;</div>
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  <span class="keywordtype">long</span> len = n;</div>
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  <span class="keywordflow">while</span> (--len >= 0) {</div>
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  x = (1000003*x) ^ *p++;</div>
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  }</div>
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  x ^= n;</div>
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  <span class="keywordflow">return</span> x;</div>
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span> }</div>
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span> </div>
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span> </div>
<div class="line"><a name="l01596"></a><span class="lineno"><a class="line" href="namespacefaiss.html#ad86caef545c6a7672422d7d34c03f446"> 1596</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespacefaiss.html#ad86caef545c6a7672422d7d34c03f446">check_openmp</a>() {</div>
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  omp_set_num_threads(10);</div>
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span> </div>
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  <span class="keywordflow">if</span> (omp_get_max_threads() != 10) {</div>
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  }</div>
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span> </div>
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  std::vector<int> nt_per_thread(10);</div>
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <span class="keywordtype">size_t</span> sum = 0;</div>
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="keywordtype">bool</span> in_parallel = <span class="keyword">true</span>;</div>
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span> <span class="preprocessor">#pragma omp parallel reduction(+: sum)</span></div>
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  <span class="keywordflow">if</span> (!omp_in_parallel()) {</div>
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  in_parallel = <span class="keyword">false</span>;</div>
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  }</div>
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span> </div>
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  <span class="keywordtype">int</span> nt = omp_get_num_threads();</div>
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  <span class="keywordtype">int</span> rank = omp_get_thread_num();</div>
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span> </div>
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  nt_per_thread[rank] = nt;</div>
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span> <span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span> <span class="preprocessor"></span> <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i < 1000 * 1000 * 10; i++) {</div>
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  sum += i;</div>
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  }</div>
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  }</div>
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span> </div>
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  <span class="keywordflow">if</span> (!in_parallel) {</div>
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  }</div>
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  <span class="keywordflow">if</span> (nt_per_thread[0] != 10) {</div>
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  }</div>
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  <span class="keywordflow">if</span> (sum == 0) {</div>
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  }</div>
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span> </div>
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span> }</div>
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span> </div>
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span> } <span class="comment">// namespace faiss</span></div>
<div class="ttc" id="structfaiss_1_1RandomGenerator_html"><div class="ttname"><a href="structfaiss_1_1RandomGenerator.html">faiss::RandomGenerator</a></div><div class="ttdoc">random generator that can be used in multithreaded contexts </div><div class="ttdef"><b>Definition:</b> <a href="utils_8h_source.html#l00047">utils.h:47</a></div></div>
<div class="ttc" id="namespacefaiss_html_aa2c6a9e87a64bba8e8014e14f70bde21"><div class="ttname"><a href="namespacefaiss.html#aa2c6a9e87a64bba8e8014e14f70bde21">faiss::km_update_centroids</a></div><div class="ttdeci">int km_update_centroids(const float *x, float *centroids, long *assign, size_t d, size_t k, size_t n, size_t k_frozen)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01078">utils.cpp:1078</a></div></div>
<div class="ttc" id="namespacefaiss_html_a5eb1701e46123827966f2a56da893d1d"><div class="ttname"><a href="namespacefaiss.html#a5eb1701e46123827966f2a56da893d1d">faiss::knn_L2sqr_base_shift</a></div><div class="ttdeci">void knn_L2sqr_base_shift(const float *x, const float *y, size_t d, size_t nx, size_t ny, float_maxheap_array_t *res, const float *base_shift)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00664">utils.cpp:664</a></div></div>
<div class="ttc" id="namespacefaiss_html_a7466bd32de31640860393a701eaac5ad"><div class="ttname"><a href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">faiss::fvec_L2sqr</a></div><div class="ttdeci">float fvec_L2sqr(const float *x, const float *y, size_t d)</div><div class="ttdoc">Squared L2 distance between two vectors. </div><div class="ttdef"><b>Definition:</b> <a href="utils__simd_8cpp_source.html#l00501">utils_simd.cpp:501</a></div></div>
<div class="ttc" id="namespacefaiss_html_ad86caef545c6a7672422d7d34c03f446"><div class="ttname"><a href="namespacefaiss.html#ad86caef545c6a7672422d7d34c03f446">faiss::check_openmp</a></div><div class="ttdeci">bool check_openmp()</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01596">utils.cpp:1596</a></div></div>
<div class="ttc" id="namespacefaiss_html_a154a47857ed321b9db91122770a16e09"><div class="ttname"><a href="namespacefaiss.html#a154a47857ed321b9db91122770a16e09">faiss::bincode_hist</a></div><div class="ttdeci">void bincode_hist(size_t n, size_t nbits, const uint8_t *codes, int *hist)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01326">utils.cpp:1326</a></div></div>
<div class="ttc" id="namespacefaiss_html_a14884d253128c7af5891a65082ad7dc6"><div class="ttname"><a href="namespacefaiss.html#a14884d253128c7af5891a65082ad7dc6">faiss::fvecs_maybe_subsample</a></div><div class="ttdeci">const float * fvecs_maybe_subsample(size_t d, size_t *n, size_t nmax, const float *x, bool verbose, long seed)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01540">utils.cpp:1540</a></div></div>
<div class="ttc" id="namespacefaiss_html_ae0ee1b6fbd3d6da0f1a3550a780ca24c"><div class="ttname"><a href="namespacefaiss.html#ae0ee1b6fbd3d6da0f1a3550a780ca24c">faiss::ranklist_handle_ties</a></div><div class="ttdeci">void ranklist_handle_ties(int k, long *idx, const float *dis)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01172">utils.cpp:1172</a></div></div>
<div class="ttc" id="structfaiss_1_1RandomGenerator_html_ac82a433d7bfa56d750907ba5cf74aed7"><div class="ttname"><a href="structfaiss_1_1RandomGenerator.html#ac82a433d7bfa56d750907ba5cf74aed7">faiss::RandomGenerator::rand_float</a></div><div class="ttdeci">float rand_float()</div><div class="ttdoc">between 0 and 1 </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00129">utils.cpp:129</a></div></div>
<div class="ttc" id="namespacefaiss_html_aa3af5769b0b649f112332a874c64d361"><div class="ttname"><a href="namespacefaiss.html#aa3af5769b0b649f112332a874c64d361">faiss::get_mem_usage_kb</a></div><div class="ttdeci">size_t get_mem_usage_kb()</div><div class="ttdoc">get current RSS usage in kB </div></div>
<div class="ttc" id="namespacefaiss_html_a7bea462108bee98d8d5859b51ec4db8e"><div class="ttname"><a href="namespacefaiss.html#a7bea462108bee98d8d5859b51ec4db8e">faiss::ivec_hist</a></div><div class="ttdeci">int ivec_hist(size_t n, const int *v, int vmax, int *hist)</div><div class="ttdoc">compute histogram on v </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01315">utils.cpp:1315</a></div></div>
<div class="ttc" id="namespacefaiss_html_abefd45801bab63d2eb71005ad7a51d32"><div class="ttname"><a href="namespacefaiss.html#abefd45801bab63d2eb71005ad7a51d32">faiss::hash_bytes</a></div><div class="ttdeci">uint64_t hash_bytes(const uint8_t *bytes, long n)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01584">utils.cpp:1584</a></div></div>
<div class="ttc" id="namespacefaiss_html_afb7b33f6892678ba79aaf5e71777837c"><div class="ttname"><a href="namespacefaiss.html#afb7b33f6892678ba79aaf5e71777837c">faiss::merge_result_table_with</a></div><div class="ttdeci">size_t merge_result_table_with(size_t n, size_t k, long *I0, float *D0, const long *I1, const float *D1, bool keep_min, long translation)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01188">utils.cpp:1188</a></div></div>
<div class="ttc" id="structfaiss_1_1HeapArray_html"><div class="ttname"><a href="structfaiss_1_1HeapArray.html">faiss::HeapArray</a></div><div class="ttdef"><b>Definition:</b> <a href="Heap_8h_source.html#l00349">Heap.h:349</a></div></div>
<div class="ttc" id="namespacefaiss_html_a8dbc652ba48d41f126b8815004899448"><div class="ttname"><a href="namespacefaiss.html#a8dbc652ba48d41f126b8815004899448">faiss::ranklist_intersection_size</a></div><div class="ttdeci">size_t ranklist_intersection_size(size_t k1, const long *v1, size_t k2, const long *v2_in)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01253">utils.cpp:1253</a></div></div>
<div class="ttc" id="namespacefaiss_html_a3d9c7db82d43c1f0ab1d28b92bc9fe57"><div class="ttname"><a href="namespacefaiss.html#a3d9c7db82d43c1f0ab1d28b92bc9fe57">faiss::pairwise_L2sqr</a></div><div class="ttdeci">void pairwise_L2sqr(long d, long nq, const float *xq, long nb, const float *xb, float *dis, long ldq, long ldb, long ldd)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01021">utils.cpp:1021</a></div></div>
<div class="ttc" id="namespacefaiss_html_ab29d725b808df6f142b80f21aa45e507"><div class="ttname"><a href="namespacefaiss.html#ab29d725b808df6f142b80f21aa45e507">faiss::range_search_inner_product</a></div><div class="ttdeci">void range_search_inner_product(const float *x, const float *y, size_t d, size_t nx, size_t ny, float radius, RangeSearchResult *res)</div><div class="ttdoc">same as range_search_L2sqr for the inner product similarity </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00959">utils.cpp:959</a></div></div>
<div class="ttc" id="namespacefaiss_html_a880c7318971f866267a86945aaa61b17"><div class="ttname"><a href="namespacefaiss.html#a880c7318971f866267a86945aaa61b17">faiss::knn_inner_product</a></div><div class="ttdeci">void knn_inner_product(const float *x, const float *y, size_t d, size_t nx, size_t ny, float_minheap_array_t *res)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00624">utils.cpp:624</a></div></div>
<div class="ttc" id="namespacefaiss_html_af2a71f7d5402ae02ce169a4cc83020eb"><div class="ttname"><a href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">faiss::getmillisecs</a></div><div class="ttdeci">double getmillisecs()</div><div class="ttdoc">ms elapsed since some arbitrary epoch </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00069">utils.cpp:69</a></div></div>
<div class="ttc" id="structfaiss_1_1NopDistanceCorrection_html"><div class="ttname"><a href="structfaiss_1_1NopDistanceCorrection.html">faiss::NopDistanceCorrection</a></div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00638">utils.cpp:638</a></div></div>
<div class="ttc" id="namespacefaiss_html_ab491c9e2f77a750c9f0324bfe00e3e57"><div class="ttname"><a href="namespacefaiss.html#ab491c9e2f77a750c9f0324bfe00e3e57">faiss::real_to_binary</a></div><div class="ttdeci">void real_to_binary(size_t d, const float *x_in, uint8_t *x_out)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01570">utils.cpp:1570</a></div></div>
<div class="ttc" id="namespacefaiss_html_a94c1d99ac39d22e362aa27ce7c7ff714"><div class="ttname"><a href="namespacefaiss.html#a94c1d99ac39d22e362aa27ce7c7ff714">faiss::imbalance_factor</a></div><div class="ttdeci">double imbalance_factor(int k, const int *hist)</div><div class="ttdoc">same, takes a histogram as input </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01291">utils.cpp:1291</a></div></div>
<div class="ttc" id="namespacefaiss_html_a7a49180ebf10e643217bbce5862c7f84"><div class="ttname"><a href="namespacefaiss.html#a7a49180ebf10e643217bbce5862c7f84">faiss::fvec_norm_L2sqr</a></div><div class="ttdeci">float fvec_norm_L2sqr(const float *x, size_t d)</div><div class="ttdef"><b>Definition:</b> <a href="utils__simd_8cpp_source.html#l00515">utils_simd.cpp:515</a></div></div>
<div class="ttc" id="namespacefaiss_html_a1faa7bd079c9b1addf3058ddf882a000"><div class="ttname"><a href="namespacefaiss.html#a1faa7bd079c9b1addf3058ddf882a000">faiss::range_search_L2sqr</a></div><div class="ttdeci">void range_search_L2sqr(const float *x, const float *y, size_t d, size_t nx, size_t ny, float radius, RangeSearchResult *res)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00944">utils.cpp:944</a></div></div>
<div class="ttc" id="namespacefaiss_html_afb68fe89ad5e948974da1b70d7b4157c"><div class="ttname"><a href="namespacefaiss.html#afb68fe89ad5e948974da1b70d7b4157c">faiss::matrix_qr</a></div><div class="ttdeci">void matrix_qr(int m, int n, float *a)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00999">utils.cpp:999</a></div></div>
<div class="ttc" id="structfaiss_1_1RangeSearchResult_html"><div class="ttname"><a href="structfaiss_1_1RangeSearchResult.html">faiss::RangeSearchResult</a></div><div class="ttdef"><b>Definition:</b> <a href="AuxIndexStructures_8h_source.html#l00031">AuxIndexStructures.h:31</a></div></div>
<div class="ttc" id="namespacefaiss_html_a4369329c9dbdfe23e3f35d09ba7b5c6e"><div class="ttname"><a href="namespacefaiss.html#a4369329c9dbdfe23e3f35d09ba7b5c6e">faiss::ivec_checksum</a></div><div class="ttdeci">size_t ivec_checksum(size_t n, const int *a)</div><div class="ttdoc">compute a checksum on a table. </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01349">utils.cpp:1349</a></div></div>
<div class="ttc" id="structfaiss_1_1BaseShiftDistanceCorrection_html"><div class="ttname"><a href="structfaiss_1_1BaseShiftDistanceCorrection.html">faiss::BaseShiftDistanceCorrection</a></div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00657">utils.cpp:657</a></div></div>
<div class="ttc" id="namespacefaiss_html_a2f803e3d3b07cfab63699c89de161237"><div class="ttname"><a href="namespacefaiss.html#a2f803e3d3b07cfab63699c89de161237">faiss::knn_L2sqr</a></div><div class="ttdeci">void knn_L2sqr(const float *x, const float *y, size_t d, size_t nx, size_t ny, float_maxheap_array_t *res)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00644">utils.cpp:644</a></div></div>
<div class="ttc" id="namespacefaiss_html_ac8260e10cfeed08a4344b85845773e16"><div class="ttname"><a href="namespacefaiss.html#ac8260e10cfeed08a4344b85845773e16">faiss::binary_to_real</a></div><div class="ttdeci">void binary_to_real(size_t d, const uint8_t *x_in, float *x_out)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l01564">utils.cpp:1564</a></div></div>
</div><!-- 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>