You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
<p>Performance measurements in Xcode on an iMac M1, release build.</p>
260
260
<h2><aclass="anchor" id="autotoc_md11"></a>
261
-
Worst case insert</h2>
262
-
<p>The “worst case” is inserting random numbers on the right with the same left value. The one-to-many uses the optimized bulk insert. Results in milliseconds.</p>
261
+
Insert</h2>
262
+
<p>The worst case is inserting random numbers on the right with the same left value. This test uses the optimized bulk insert. Results in milliseconds.</p>
<p><code>std::unordered_map</code> is not the fastest hash map. I’m aware of faster ones, but all those I have found have a license that is more restrictive than the MIT license.</p>
320
-
<h1><aclass="anchor" id="autotoc_md15"></a>
301
+
<h1><aclass="anchor" id="autotoc_md14"></a>
321
302
How it works</h1>
322
303
<p>This section is for those who want to venture into the code.</p>
323
304
<p>I will show you, and talk you through the structure of the <code>OneToMany</code> template class. The <code>OneToOne</code> and <code>ManyToMany</code> template classes are structured along the same lines.</p>
['best_20case_20insert_1',['Best case insert',['../index.html#autotoc_md12',1,'']]],
5
-
['binary_20relations_20are_20everywhere_2',['Binary relations are everywhere',['../index.html',1,'Binary relations are everywhere'],['../index.html#autotoc_md4',1,'Binary relations are everywhere']]]
4
+
['binary_20relations_20are_20everywhere_1',['Binary relations are everywhere',['../index.html',1,'Binary relations are everywhere'],['../index.html#autotoc_md4',1,'Binary relations are everywhere']]]
0 commit comments