diff options
| author | Puyan Lotfi <puyan@puyan.org> | 2015-07-28 06:04:00 +0000 |
|---|---|---|
| committer | Puyan Lotfi <puyan@puyan.org> | 2015-07-28 06:04:00 +0000 |
| commit | 36b7f1d1c2a006b540efaaecdb0d2c05c1c91772 (patch) | |
| tree | a9e17f8d351d466d50c993c81da6d050a192b162 /llvm/docs/ProgrammersManual.rst | |
| parent | 786e6db1872ddb2c2dc4cc6c994b25084909a76b (diff) | |
| download | bcm5719-llvm-36b7f1d1c2a006b540efaaecdb0d2c05c1c91772.tar.gz bcm5719-llvm-36b7f1d1c2a006b540efaaecdb0d2c05c1c91772.zip | |
Adding ADT SortedVector; client patch will follow.
llvm-svn: 243386
Diffstat (limited to 'llvm/docs/ProgrammersManual.rst')
| -rw-r--r-- | llvm/docs/ProgrammersManual.rst | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/llvm/docs/ProgrammersManual.rst b/llvm/docs/ProgrammersManual.rst index 08cc61a187b..fbc63324c31 100644 --- a/llvm/docs/ProgrammersManual.rst +++ b/llvm/docs/ProgrammersManual.rst @@ -1314,7 +1314,8 @@ never use hash_set and unordered_set because they are generally very expensive std::multiset is useful if you're not interested in elimination of duplicates, but has all the drawbacks of :ref:`std::set <dss_set>`. A sorted vector (where you don't delete duplicate entries) or some other approach is almost -always better. +always better. LLVM actually offers SortedVector which does the job of a sorted +std::vector. .. _ds_map: |
