6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-14 00:32:55 +00:00
Code Issues Projects Releases Wiki Activity

improve grammar

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33829 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2007-02-03 08:10:45 +00:00
parent 4ddfac128a
commit 3b23a8cc23
1 changed files with 12 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
docs/ProgrammersManual.html
View File

@ -884,15 +884,18 @@ this, providing various trade-offs.</p>
<div class="doc_text">
<p>If you intend to insert a lot of elements, then do a lot of queries, one
great approach is to use a vector (or other sequential container), and then use
<p>If you intend to insert a lot of elements, then do a lot of queries, a
great approach is to use a vector (or other sequential container) with
std::sort+std::unique to remove duplicates. This approach works really well if
your usage pattern has these two distinct phases (insert then query), and,
coupled with a good choice of <a href="#ds_sequential">sequential container</a>
can provide the several nice properties: the result data is contiguous in memory
(good for cache locality), has few allocations, is easy to address (iterators in
the final vector are just indices or pointers), and can be efficiently queried
with a standard binary search.</p>
your usage pattern has these two distinct phases (insert then query), and can be
coupled with a good choice of <a href="#ds_sequential">sequential container</a>.
</p>
<p>
This combination provides the several nice properties: the result data is
contiguous in memory (good for cache locality), has few allocations, is easy to
address (iterators in the final vector are just indices or pointers), and can be
efficiently queried with a standard binary or radix search.</p>
</div>
@ -983,7 +986,7 @@ elements.
<div class="doc_text">
<p>std::set is a reasonable all-around set class, which is good at many things
but great at nothing. std::set use a allocates memory for every single element
but great at nothing. std::set allocates memory for each element
inserted (thus it is very malloc intensive) and typically stores three pointers
with every element (thus adding a large amount of per-element space overhead).
It offers guaranteed log(n) performance, which is not particularly fast.