Deploying to gh-pages from @ da12815 🚀

Author: LTLA

docs/knncolle__annoy_8hpp_source.html

@@ -144,8 +144,8 @@
 <div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keyword">typename</span> std::conditional&lt;!same_internal_distance, std::vector&lt;AnnoyData_&gt;, <span class="keywordtype">bool</span>&gt;::type my_distances;</div>
 <div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
 <div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordtype">int</span> get_search_k(<span class="keywordtype">int</span> k)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">if</span> (my_parent.my_search_mult &lt; 0) {</div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">if</span> (my_parent.my_search_mult &lt; 1) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">return</span> -1; <span class="comment">// instructs Annoy to use k * num_trees. </span></div>
 <div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            <span class="keywordflow">return</span> my_parent.my_search_mult * <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(k) + 0.5; <span class="comment">// rounded.</span></div>
 <div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        }</div>

docs/structknncolle__annoy_1_1AnnoyOptions.html

@@ -138,7 +138,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7e917640043724d3933318a4
         </tr>
       </table>
 </div><div class="memdoc">
-<p>Factor that is multiplied by the number of neighbors <code>k</code> to determine the number of nodes to search in <code>find_nearest_neighbors()</code>. Larger values improve accuracy at the cost of runtime, see <a href="https://github.com/spotify/annoy#tradeoffs">here</a> for details. If set to -1, it defaults to <code>num_trees</code>. </p>
+<p>Factor that is multiplied by the number of neighbors <code>k</code> to determine the number of nodes to search in <code>AnnoySearcher::search()</code>. Larger values improve accuracy at the cost of runtime, see <a href="https://github.com/spotify/annoy#tradeoffs">here</a> for details. This should be greater than or equal to 1 - any other value will be replaced by <code>num_trees</code>. </p>
 
 </div>
 </div>