From 36b7f1d1c2a006b540efaaecdb0d2c05c1c91772 Mon Sep 17 00:00:00 2001
From: Puyan Lotfi <puyan@puyan.org>
Date: Tue, 28 Jul 2015 06:04:00 +0000
Subject: Adding ADT SortedVector; client patch will follow.

llvm-svn: 243386
---
 llvm/docs/ProgrammersManual.rst | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

(limited to 'llvm/docs/ProgrammersManual.rst')

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:
 
-- 
cgit v1.2.3