223 lines
24 KiB
HTML
223 lines
24 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.5"/>
|
|
<title>Faiss: /data/users/hoss/faiss/Heap.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/Heap.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="comment">/* Function for soft heap */</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 "Heap.h"</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="keyword">namespace </span>faiss {</div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="keyword">template</span> <<span class="keyword">typename</span> C></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"><a class="line" href="structfaiss_1_1HeapArray.html#a48afc496c73e982b8e10fde786628292"> 19</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HeapArray.html#a48afc496c73e982b8e10fde786628292">HeapArray<C>::heapify</a> ()</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">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nh; j++)</div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  heap_heapify<C> (k, val + j * k, ids + j * k);</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> </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">template</span> <<span class="keyword">typename</span> C></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="structfaiss_1_1HeapArray.html#a3c686b3cc0594e6a284fa3a595bebdec"> 27</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HeapArray.html#a3c686b3cc0594e6a284fa3a595bebdec">HeapArray<C>::reorder</a> ()</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> {</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nh; j++)</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  heap_reorder<C> (k, val + j * k, ids + j * k);</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> </div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">template</span> <<span class="keyword">typename</span> C></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="structfaiss_1_1HeapArray.html#abc3e17a9d369abc87353bccf07f7a4fc"> 35</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HeapArray.html#abc3e17a9d369abc87353bccf07f7a4fc">HeapArray<C>::addn</a> (<span class="keywordtype">size_t</span> nj, <span class="keyword">const</span> T *vin, TI j0,</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">size_t</span> i0, <span class="keywordtype">long</span> ni)</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="keywordflow">if</span> (ni == -1) ni = nh;</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  assert (i0 >= 0 && i0 + ni <= nh);</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = i0; i < i0 + ni; i++) {</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  T * __restrict simi = get_val(i);</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  TI * __restrict idxi = get_ids (i);</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">const</span> T *ip_line = vin + (i - i0) * nj;</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nj; j++) {</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  T ip = ip_line [j];</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">if</span> (C::cmp(simi[0], ip)) {</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  heap_pop<C> (k, simi, idxi);</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  heap_push<C> (k, simi, idxi, ip, j + j0);</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>  }</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> }</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="keyword">template</span> <<span class="keyword">typename</span> C></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="structfaiss_1_1HeapArray.html#ad3c61085b43dd54300ad97f1f9503330"> 57</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HeapArray.html#ad3c61085b43dd54300ad97f1f9503330">HeapArray<C>::addn_with_ids</a> (</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">size_t</span> nj, <span class="keyword">const</span> T *vin, <span class="keyword">const</span> TI *id_in,</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">long</span> id_stride, <span class="keywordtype">size_t</span> i0, <span class="keywordtype">long</span> ni)</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>  <span class="keywordflow">if</span> (id_in == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  addn (nj, vin, 0, i0, ni);</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">if</span> (ni == -1) ni = nh;</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  assert (i0 >= 0 && i0 + ni <= nh);</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = i0; i < i0 + ni; i++) {</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  T * __restrict simi = get_val(i);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  TI * __restrict idxi = get_ids (i);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> T *ip_line = vin + (i - i0) * nj;</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const</span> TI *id_line = id_in + (i - i0) * id_stride;</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>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nj; j++) {</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  T ip = ip_line [j];</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">if</span> (C::cmp(simi[0], ip)) {</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  heap_pop<C> (k, simi, idxi);</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  heap_push<C> (k, simi, idxi, ip, id_line [j]);</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>  }</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> }</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="keyword">template</span> <<span class="keyword">typename</span> C></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="structfaiss_1_1HeapArray.html#ab1beefd73c023168c23d5443ee71e369"> 85</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1HeapArray.html#ab1beefd73c023168c23d5443ee71e369">HeapArray<C>::per_line_extrema</a> (</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  T * out_val,</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  TI * out_ids)<span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < nh; j++) {</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordtype">long</span> imin = -1;</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">typename</span> C::T xval = C::Crev::neutral ();</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">const</span> <span class="keyword">typename</span> C::T * x_ = val + j * k;</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < k; i++)</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (C::cmp (x_[i], xval)) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  xval = x_[i];</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  imin = i;</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (out_val)</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  out_val[j] = xval;</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">if</span> (out_ids) {</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (ids && imin != -1)</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  out_ids[j] = ids [j * k + imin];</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  out_ids[j] = imin;</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> }</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// explicit instanciations</span></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="keyword">template</span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1HeapArray.html">HeapArray<CMin <float, long></a> >;</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="keyword">template</span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1HeapArray.html">HeapArray<CMax <float, long></a> >;</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="keyword">template</span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1HeapArray.html">HeapArray<CMin <int, long></a> >;</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="keyword">template</span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1HeapArray.html">HeapArray<CMax <int, long></a> >;</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> </div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> } <span class="comment">// END namespace fasis</span></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_a3c686b3cc0594e6a284fa3a595bebdec"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#a3c686b3cc0594e6a284fa3a595bebdec">faiss::HeapArray::reorder</a></div><div class="ttdeci">void reorder()</div><div class="ttdoc">reorder all the heaps </div><div class="ttdef"><b>Definition:</b> <a href="Heap_8cpp_source.html#l00027">Heap.cpp:27</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_ab1beefd73c023168c23d5443ee71e369"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#ab1beefd73c023168c23d5443ee71e369">faiss::HeapArray::per_line_extrema</a></div><div class="ttdeci">void per_line_extrema(T *vals_out, TI *idx_out) const </div><div class="ttdef"><b>Definition:</b> <a href="Heap_8cpp_source.html#l00085">Heap.cpp:85</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="structfaiss_1_1HeapArray_html_ad3c61085b43dd54300ad97f1f9503330"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#ad3c61085b43dd54300ad97f1f9503330">faiss::HeapArray::addn_with_ids</a></div><div class="ttdeci">void addn_with_ids(size_t nj, const T *vin, const TI *id_in=nullptr, long id_stride=0, size_t i0=0, long ni=-1)</div><div class="ttdef"><b>Definition:</b> <a href="Heap_8cpp_source.html#l00057">Heap.cpp:57</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_a48afc496c73e982b8e10fde786628292"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#a48afc496c73e982b8e10fde786628292">faiss::HeapArray::heapify</a></div><div class="ttdeci">void heapify()</div><div class="ttdoc">prepare all the heaps before adding </div><div class="ttdef"><b>Definition:</b> <a href="Heap_8cpp_source.html#l00019">Heap.cpp:19</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1HeapArray_html_abc3e17a9d369abc87353bccf07f7a4fc"><div class="ttname"><a href="structfaiss_1_1HeapArray.html#abc3e17a9d369abc87353bccf07f7a4fc">faiss::HeapArray::addn</a></div><div class="ttdeci">void addn(size_t nj, const T *vin, TI j0=0, size_t i0=0, long ni=-1)</div><div class="ttdef"><b>Definition:</b> <a href="Heap_8cpp_source.html#l00035">Heap.cpp:35</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>
|