feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

Fix some complexity errors in the comparison table.

Browse Source 
[SVN r42099]
This commit is contained in:
Daniel James
2007-12-16 10:52:30 +00:00
parent 10b6f40fa5
commit d6bf672e22
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
doc/comparison.qbk
View File

@ -109,8 +109,8 @@
]
[
[Inserting a range of /N/ elements]
[/N/ log(`size()`+/N/)]
[Average case O(/N/), worst case O(/N/ * 'size()')]
[ /N/ log(`size()`+/N/) ]
[Average case O(/N/), worst case O(/N/ * `size()`)]
]
[
[Erase by key, `k`]
@ -135,7 +135,7 @@
[
[Find]
[logarithmic]
[Average case: O(/N/), Worst case: O(`size()`)]
[Average case: O(1), Worst case: O(`size()`)]
]
[/ TODO: Average case is probably wrong. ]
[