Skip to content

Commit c3793ef

Browse files
committed
Run doxygen
1 parent a801271 commit c3793ef

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

docs/index.html

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -248,11 +248,11 @@ <h1><a class="anchor" id="autotoc_md7"></a>
248248
<p>In the code example, note that the name of the <code>OneToMany</code> has the form of “SingularToPlural”, like “ParentToChildren”. Similarly, ManyToMany names would be “PluralToPlural”, OneToOne would be “SingularToSingular”.</p>
249249
<h1><a class="anchor" id="autotoc_md9"></a>
250250
Efficiency</h1>
251-
<p>The efficiency for lookup such as <code>FindLeft()</code> and <code>FindRight()</code> is constant time. All operations on a <code>OneToOne</code> are also constant.</p>
252-
<p>Things get more complicated with <code>OneToMany</code> and <code>ManyToMany</code>. They maintain sorted arrays. Insertion and removal of elements in an array involves shifting everything between the point of insertion/removal and the end of the array. In practice, at least in the context of our world editor, this has not been a problem. That’s probably because insert and remove operations are relatively infrequent when compared to lookups.</p>
251+
<p>The efficiency for lookup such as <code>FindLeft()</code> and <code>FindRight()</code> is constant time, or O(1). All operations on a <code>OneToOne</code> are also constant.</p>
252+
<p>Things get more complicated with <code>OneToMany</code> and <code>ManyToMany</code>. They maintain sorted arrays. Insertion and removal of elements in an array involves shifting everything between the point of insertion/removal and the end of the array. This is O(n). It sounds terrible, but in practice, at least in the context of our world editor, this has not been a problem. That’s probably because insert and remove operations are relatively infrequent when compared to lookups.</p>
253253
<h1><a class="anchor" id="autotoc_md10"></a>
254254
Performance</h1>
255-
<p>Performance measurements in Xcode on an iMac M1.</p>
255+
<p>Performance measurements in Xcode on an iMac M1, release build.</p>
256256
<h2><a class="anchor" id="autotoc_md11"></a>
257257
Worst case insert</h2>
258258
<p>The “worst case” is inserting random numbers on the right with the same left value. Results in milliseconds.</p>

0 commit comments

Comments
 (0)