Deploying to gh-pages from @ HarbourMasters/Torch@ea7f3807e4650d634881b680e1257a80314759ac 🚀

1 files changed, 13 insertions, 4 deletions

diff --git a/TorchUtils_8h_source.html b/TorchUtils_8h_source.html
index 9cb6101..aff1e58 100644
--- a/TorchUtils_8h_source.html
+++ b/TorchUtils_8h_source.html
@@ -117,10 +117,19 @@ $(function(){initNavTree('TorchUtils_8h_source.html','',''); });
 <div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordflow">return</span> format;</div>
 <div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>}</div>
 <div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>uint32_t translate(uint32_t offset);</div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>std::vector&lt;std::filesystem::directory_entry&gt; getRecursiveEntries(<span class="keyword">const</span> std::filesystem::path baseDir);</div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>};</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Container, <span class="keyword">typename</span> Key&gt;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">constexpr</span> <span class="keywordtype">bool</span> contains(<span class="keyword">const</span> Container&amp; c, <span class="keyword">const</span> Key&amp; k) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#if __cplusplus &gt;= 202002L</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">return</span> c.contains(k);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">return</span> c.find(k) != c.end();</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>uint32_t translate(uint32_t offset);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>std::vector&lt;std::filesystem::directory_entry&gt; getRecursiveEntries(<span class="keyword">const</span> std::filesystem::path baseDir);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>};</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 </div><!-- container -->