mirrors
/
faiss
mirror of https://github.com/facebookresearch/faiss.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
faiss/docs/html/structfaiss_1_1RangeSearchP...

122 lines
10 KiB
HTML
Raw Normal View History

Initial commit
2017-02-23 06:26:44 +08:00
<!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: Member List</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&#160;Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><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="annotated.html"><span>Class&#160;List</span></a></li>
<li><a href="classes.html"><span>Class&#160;Index</span></a></li>
<li><a href="hierarchy.html"><span>Class&#160;Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class&#160;Members</span></a></li>
</ul>
</div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Friends</a></div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="namespacefaiss.html">faiss</a></li><li class="navelem"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">RangeSearchPartialResult</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">faiss::RangeSearchPartialResult Member List</div> </div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a>, including all inherited members.</p>
<table class="directory">
Facebook sync (May 2019) + relicense (#838) Changelog: - changed license: BSD+Patents -> MIT - propagates exceptions raised in sub-indexes of IndexShards and IndexReplicas - support for searching several inverted lists in parallel (parallel_mode != 0) - better support for PQ codes where nbit != 8 or 16 - IVFSpectralHash implementation: spectral hash codes inside an IVF - 6-bit per component scalar quantizer (4 and 8 bit were already supported) - combinations of inverted lists: HStackInvertedLists and VStackInvertedLists - configurable number of threads for OnDiskInvertedLists prefetching (including 0=no prefetch) - more test and demo code compatible with Python 3 (print with parentheses) - refactored benchmark code: data loading is now in a single file
2019-05-28 22:17:22 +08:00
<tr class="even"><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html#aa17f17a53b45bb39b0724d6493ab33c9">add</a>(idx_t id, float dis)</td><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html#aa124ff3a7e6a98960e12a8b32bdaec42">append_buffer</a>()</td><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a></td><td class="entry"></td></tr>
Initial commit
2017-02-23 06:26:44 +08:00
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>buffer_size</b> (defined in <a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a>)</td><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>BufferList</b>(size_t buffer_size) (defined in <a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a>)</td><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a></td><td class="entry"><span class="mlabel">explicit</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>buffers</b> (defined in <a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a>)</td><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html#a78b70417a9ba5b27553b3134f1190958">copy_range</a>(size_t ofs, size_t n, idx_t *dest_ids, float *dest_dis)</td><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a></td><td class="entry"></td></tr>
Facebook sync (May 2019) + relicense (#838) Changelog: - changed license: BSD+Patents -> MIT - propagates exceptions raised in sub-indexes of IndexShards and IndexReplicas - support for searching several inverted lists in parallel (parallel_mode != 0) - better support for PQ codes where nbit != 8 or 16 - IVFSpectralHash implementation: spectral hash codes inside an IVF - 6-bit per component scalar quantizer (4 and 8 bit were already supported) - combinations of inverted lists: HStackInvertedLists and VStackInvertedLists - configurable number of threads for OnDiskInvertedLists prefetching (including 0=no prefetch) - more test and demo code compatible with Python 3 (print with parentheses) - refactored benchmark code: data loading is now in a single file
2019-05-28 22:17:22 +08:00
<tr class="even"><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html#ad323d8ea8914d9071aecff83f69ee8e4">copy_result</a>(bool incremental=false)</td><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>finalize</b>() (defined in <a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a>)</td><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>idx_t</b> typedef (defined in <a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a>)</td><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html#ac01a679f4fa7a00e8cb0dfe15f50d422">merge</a>(std::vector&lt; RangeSearchPartialResult * &gt; &amp;partial_results, bool do_delete=true)</td><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a></td><td class="entry"><span class="mlabel">static</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html#a0ba199c22ed09aebb0f7238229b516e9">new_result</a>(idx_t qno)</td><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html#abd6ae2a92bc18b6528aadf39370d041c">queries</a></td><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html#a41aaed4f59e7a6a99e2a643dfff483f5">RangeSearchPartialResult</a>(RangeSearchResult *res_in)</td><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a></td><td class="entry"><span class="mlabel">explicit</span></td></tr>
Initial commit
2017-02-23 06:26:44 +08:00
<tr bgcolor="#f0f0f0"><td class="entry"><b>res</b> (defined in <a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a>)</td><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html#ab6a385008493c7b630e4e7bc56e3da74">set_lims</a>()</td><td class="entry"><a class="el" href="structfaiss_1_1RangeSearchPartialResult.html">faiss::RangeSearchPartialResult</a></td><td class="entry"></td></tr>
Facebook sync (May 2019) + relicense (#838) Changelog: - changed license: BSD+Patents -> MIT - propagates exceptions raised in sub-indexes of IndexShards and IndexReplicas - support for searching several inverted lists in parallel (parallel_mode != 0) - better support for PQ codes where nbit != 8 or 16 - IVFSpectralHash implementation: spectral hash codes inside an IVF - 6-bit per component scalar quantizer (4 and 8 bit were already supported) - combinations of inverted lists: HStackInvertedLists and VStackInvertedLists - configurable number of threads for OnDiskInvertedLists prefetching (including 0=no prefetch) - more test and demo code compatible with Python 3 (print with parentheses) - refactored benchmark code: data loading is now in a single file
2019-05-28 22:17:22 +08:00
<tr><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html#af4d7ddcd77f328a12a7da89d8febe5d9">wp</a></td><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>~BufferList</b>() (defined in <a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a>)</td><td class="entry"><a class="el" href="structfaiss_1_1BufferList.html">faiss::BufferList</a></td><td class="entry"></td></tr>
Initial commit
2017-02-23 06:26:44 +08:00
</table></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.5
</small></address>
</body>
</html>